Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Recent questions tagged gate2009
0
votes
0
answers
GATE200957, ISRO201675 Video Solution
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
asked
Apr 19
in
Computer Networks
by
admin
(
3.6k
points)

3
views
gate2009
computernetworks
slidingwindow
normal
isro2016
videosolution
0
votes
0
answers
GATE200928 Video Solution
Consider a $4$ stage pipeline processor. The number of cycles needed by the four instructions $I1, I2, I3, I4$ in stages $S1, S2, S3, S4$ is shown below: $\begin{array}{ccccc} \hline \textbf{} & \textbf {$S _1$} &\textbf {$ ... number of cycles needed to execute the following loop? For $(i=1$ to $2)$ {I1; I2; I3; I4;} $16$ $23$ $28$ $30$
asked
Apr 19
in
CO & Architecture
by
admin
(
3.6k
points)

3
views
gate2009
coandarchitecture
pipelining
normal
videosolution
0
votes
0
answers
GATE200944 Video Solution
The following key values are inserted into a $B+$  tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

2
views
gate2009
databases
btree
normal
videosolution
0
votes
0
answers
GATE200958 Video Solution
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
asked
Apr 19
in
Computer Networks
by
admin
(
3.6k
points)

3
views
gate2009
computernetworks
slidingwindow
normal
videosolution
0
votes
0
answers
GATE200947 Video Solution
While opening a $TCP$ connection, the initial sequence number is to be derived using a timeofday (ToD) clock that keeps running even when the host is down. The low order $32$ bits of the counter of the ToD clock is to be used for the initial sequence numbers ... which sequence numbers used for packets of a connection can increase? $0.015$/s $0.064$/s $0.135$/s $0.327$/s
asked
Apr 19
in
Computer Networks
by
admin
(
3.6k
points)

1
view
gate2009
computernetworks
tcp
difficult
ambiguous
videosolution
0
votes
0
answers
GATE200930 Video Solution
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A nonpreemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... any deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

4
views
gate2009
operatingsystem
resourceallocation
normal
videosolution
0
votes
0
answers
GATE200945 Video Solution
Let $R$ and $S$ be relational schemes such that $R=\{a,b,c\}$ and $S=\{c\}.$ Now consider the following queries on the database: $\pi_{RS}(r)  \pi_{RS} \left (\pi_{RS} (r) \times s  \pi_{RS,S}(r)\right )$ ... .a,R.b From R,S Where R.c = S.c Which of the above queries are equivalent? $1$ and $2$ $1$ and $3$ $2$ and $4$ $3$ and $4$
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

1
view
gate2009
databases
relationalcalculus
difficult
videosolution
0
votes
0
answers
GATE200937,ISRODEC201755 Video Solution
What is the maximum height of any AVLtree with $7$ nodes? Assume that the height of a tree with a single node is $0$. $2$ $3$ $4$ $5$
asked
Apr 19
in
DS
by
admin
(
3.6k
points)

3
views
gate2009
datastructures
binarysearchtree
normal
isrodec2017
videosolution
0
votes
0
answers
GATE200948 Video Solution
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error? $G(x)$ contains more than two terms $G(x)$ does not divide $1+x^k$, for any $k$ not exceeding the frame length $1+x$ is a factor of $G(x)$ $G(x)$ has an odd number of terms.
asked
Apr 19
in
Computer Networks
by
admin
(
3.6k
points)

2
views
gate2009
computernetworks
errordetection
normal
videosolution
0
votes
0
answers
GATE200955 Video Solution
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... of all suppliers who have supplied only nonblue part. Find the names of all suppliers who have not supplied only blue parts.
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

1
view
gate2009
databases
sql
normal
videosolution
0
votes
0
answers
GATE200933 Video Solution
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using testandset instruction as follows: void enter_CS(X) { while(testandset(X)); } void leave_CS(X) { X = 0; } In the above solution, $X$ is a memory location ... at the same time Which of the above statements are TRUE? (I) only (I) and (II) (II) and (III) (IV) only
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate2009
operatingsystem
processsynchronization
normal
videosolution
0
votes
0
answers
GATE200956 Video Solution
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... $3NF$ but not in $\text{BCNF}$ The schema is in $2NF$ but not in $3NF$ The schema is not in $2NF$
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

3
views
gate2009
databases
sql
databasenormalization
normal
videosolution
0
votes
0
answers
GATE200951 Video Solution
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number ... $\langle 400, 16, 29 \rangle$ corresponds to sector number: $505035$ $505036$ $505037$ $505038$
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

0
views
gate2009
operatingsystem
disks
normal
videosolution
0
votes
0
answers
GATE20096 Video Solution
What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{input NOR}$ gates? $2$ $3$ $4$ $5$
asked
Apr 19
in
Digital Logic
by
admin
(
3.6k
points)

2
views
gate2009
digitallogic
minnogates
normal
videosolution
0
votes
0
answers
GATE20098, UGCNETJune2012III58 Video Solution
A CPU generally handles an interrupt by executing an interrupt service routine: As soon as an interrupt is raised. By checking the interrupt register at the end of fetch cycle. By checking the interrupt register after finishing the execution of the current instruction. By checking the interrupt register at fixed time intervals.
asked
Apr 19
in
CO & Architecture
by
admin
(
3.6k
points)

1
view
gate2009
coandarchitecture
interrupts
normal
ugcnetjune2012iii
videosolution
0
votes
0
answers
GATE200913 Video Solution
Which of the following statement(s) is/are correct regarding BellmanFord shortest path algorithm? P: Always finds a negative weighted cycle, if one exists. Q: Finds whether any negative weighted cycle is reachable from the source. $P$ only $Q$ only Both $P$ and $Q$ Neither $P$ nor $Q$
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

2
views
gate2009
algorithms
graphalgorithms
normal
videosolution
0
votes
0
answers
GATE200939 Video Solution
In quicksort, for sorting $n$ elements, the $\left(n/4\right)^{th}$ smallest element is selected as pivot using an $O(n)$ time algorithm. What is the worst case time complexity of the quick sort? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

2
views
gate2009
algorithms
sorting
normal
videosolution
0
votes
0
answers
GATE200942 Video Solution
Which of the following statements are TRUE? There exist parsing algorithms for some programming languages whose complexities are less than $\Theta(n^3)$ A programming language which allows recursion can be implemented with static storage allocation. No Lattributed definition ... both source language and intermediate code level. I and II I and IV III and IV I, III and IV
asked
Apr 19
in
Compiler Design
by
admin
(
3.6k
points)

2
views
gate2009
compilerdesign
parsing
normal
videosolution
0
votes
0
answers
GATE200916, ISRO201712 Video Solution
Which one of the following is FALSE? There is a unique minimal DFA for every regular language Every NFA can be converted to an equivalent PDA. Complement of every contextfree language is recursive. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.
asked
Apr 19
in
Theory of Computation
by
admin
(
3.6k
points)

3
views
gate2009
theoryofcomputation
easy
isro2017
nondeterminism
videosolution
0
votes
0
answers
GATE200921 Video Solution
An unbalanced dice (with $6$ faces, numbered from $1$ to $6$) is thrown. The probability that the face value is odd is $90\%$ of the probability that the face value is even. The probability of getting any even numbered face is the same. If the probability ... following options is closest to the probability that the face value exceeds $3$? $0.453$ $0.468$ $0.485$ $0.492$
asked
Apr 19
in
Probability
by
admin
(
3.6k
points)

1
view
gate2009
probability
normal
videosolution
0
votes
0
answers
GATE200954 Video Solution
A subsequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the length of ... of $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

2
views
gate2009
normal
algorithms
dynamicprogramming
recursion
videosolution
0
votes
0
answers
GATE200929 Video Solution
Consider a $4$way set associative cache (initially empty) with total $16$ cache blocks. The main memory consists of $256$ ... $3$ $8$ $129$ $216$
asked
Apr 19
in
CO & Architecture
by
admin
(
3.6k
points)

2
views
gate2009
coandarchitecture
cachememory
normal
videosolution
0
votes
0
answers
GATE200912, ISRO201637 Video Solution
$S \to aSa \mid bSb\mid a\mid b$ The language generated by the above grammar over the alphabet $\{a,b\}$ is the set of: all palindromes all odd length palindromes strings that begin and end with the same symbol all even length palindromes
asked
Apr 19
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate2009
theoryofcomputation
contextfreelanguages
easy
isro2016
videosolution
0
votes
0
answers
GATE20092 Video Solution
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n > 2$. $2$ $3$ $n1$ $n$
asked
Apr 19
in
Graph Theory
by
admin
(
3.6k
points)

4
views
gate2009
graphtheory
graphcoloring
normal
videosolution
0
votes
0
answers
GATE200934 Video Solution
A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because It reduces the memory access time to read or write a memory location. It helps to reduce the size of ... It is required by the translation lookaside buffer. It helps to reduce the number of page faults in page replacement algorithms.
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

2
views
gate2009
operatingsystem
virtualmemory
easy
videosolution
0
votes
0
answers
GATE200927 Video Solution
Given the following state table of an FSM with two states $A$ and $B$ ... length of an input string which will take the machine to the state $A=0,B=1$ with $output=1$. $3$ $4$ $5$ $6$
asked
Apr 19
in
Theory of Computation
by
admin
(
3.6k
points)

1
view
gate2009
theoryofcomputation
finiteautomata
normal
videosolution
0
votes
0
answers
GATE200940 Video Solution
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.
asked
Apr 19
in
Theory of Computation
by
admin
(
3.6k
points)

2
views
gate2009
theoryofcomputation
easy
identifyclasslanguage
videosolution
0
votes
0
answers
GATE20099, ISRO201652 Video Solution
In which one of the following page replacement policies, Belady's anomaly may occur? FIFO Optimal LRU MRU
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

2
views
gate2009
operatingsystem
pagereplacement
normal
isro2016
videosolution
0
votes
0
answers
GATE200952 Video Solution
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number and $s$ is the sector ... $\langle 0, 16, 30 \rangle$ $\langle 0, 16, 31 \rangle$ $\langle 0, 17, 31 \rangle$
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

2
views
gate2009
operatingsystem
disks
normal
videosolution
0
votes
0
answers
GATE200932 Video Solution
In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state: Now consider the following statements: If a process makes a transition $D$, it would result in another process making ... preemptive scheduling. Which of the above statements are TRUE? I and II I and III II and III II and IV
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

2
views
gate2009
operatingsystem
processschedule
normal
videosolution
0
votes
0
answers
GATE200941 Video Solution
The above DFA accepts the set of all strings over $\{0,1\}$ that begin either with $0$ or $1$. end with $0$. end with $00$. contain the substring $00$.
asked
Apr 19
in
Theory of Computation
by
admin
(
3.6k
points)

1
view
gate2009
theoryofcomputation
finiteautomata
easy
videosolution
0
votes
0
answers
GATE200918 Video Solution
Consider the program below: #include <stdio.h> int fun(int n, int *f_p) { int t, f; if (n <= 1) { *f_p = 1; return 1; } t = fun(n1, f_p); f = t + *f_p; *f_p = t; return f; } int main() { int x = 15; printf("%d/n", fun(5, &x)); return 0; } The value printed is: $6$ $8$ $14$ $15$
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

8
views
gate2009
algorithms
recursion
identifyfunction
normal
videosolution
0
votes
0
answers
GATE200910 Video Solution
The essential content(s) in each entry of a page table is / are Virtual page number Page frame number Both virtual page number and page frame number Access right information
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate2009
operatingsystem
virtualmemory
easy
videosolution
0
votes
0
answers
GATE200953 Video Solution
A subsequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the ... $\text{expr2} = \max\left(l\left(i1, j1\right), l\left(i,j\right)\right)$
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

2
views
gate2009
algorithms
normal
dynamicprogramming
recursion
videosolution
0
votes
0
answers
GATE200935 Video Solution
The running time of an algorithm is represented by the following recurrence relation: $T(n) = \begin{cases} n & n \leq 3 \\ T(\frac{n}{3})+cn & \text{ otherwise } \end{cases}$ Which one of the following represents the time complexity of the algorithm? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

3
views
gate2009
algorithms
recurrence
timecomplexity
normal
videosolution
0
votes
0
answers
GATE200931 Video Solution
Consider a disk system with $100$ cylinders. The requests to access the cylinders occur in following sequence: $4, 34, 10, 7, 19, 73, 2, 15, 6, 20$ Assuming that the head is currently at cylinder $50$, what is the time taken to satisfy all requests if it ... cylinder to adjacent one and shortest seek time first policy is used? $95 \ ms$ $119 \ ms$ $233 \ ms$ $276 \ ms$
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate2009
operatingsystem
diskscheduling
normal
videosolution
0
votes
0
answers
GATE20093 Video Solution
Which one of the following is TRUE for any simple connected undirected graph with more than $2$ vertices? No two vertices have the same degree. At least two vertices have the same degree. At least three vertices have the same degree. All vertices have the same degree.
asked
Apr 19
in
Graph Theory
by
admin
(
3.6k
points)

3
views
gate2009
graphtheory
normal
degreeofgraph
videosolution
0
votes
0
answers
GATE200946 Video Solution
In the RSA public key cryptosystem, the private and public keys are $(e, n)$ and $(d, n)$ respectively, where $n=p \times q$ and $p$ and $q$ are large primes. Besides, $n$ is public and $p$ and $q$ are private. Let $M$ be an integer such ... Which of the above equations correctly represents RSA cryptosystem? I and II I and III II and IV III and IV
asked
Apr 19
in
Computer Networks
by
admin
(
3.6k
points)

1
view
gate2009
computernetworks
networksecurity
normal
videosolution
0
votes
0
answers
GATE20095, ISRO201757 Video Solution
$(1217)_8$ is equivalent to $(1217)_{16}$ $(028F)_{16}$ $(2297)_{10}$ $(0B17)_{16}$
asked
Apr 19
in
Digital Logic
by
admin
(
3.6k
points)

1
view
gate2009
digitallogic
numberrepresentation
isro2017
videosolution
0
votes
0
answers
GATE200924 Video Solution
The binary operation $\Box$ ... following is equivalent to $P \vee Q$? $\neg Q \Box \neg P$ $P\Box \neg Q$ $\neg P\Box Q$ $\neg P\Box \neg Q$
asked
Apr 19
in
Mathematical Logic
by
admin
(
3.6k
points)

3
views
gate2009
mathematicallogic
easy
propositionallogic
videosolution
Page:
1
2
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Jul 2020
Shaik Masthan
39 Points
hiteshpujari
9 Points
Meghana518
6 Points
bittujash
6 Points
Pawan_k
6 Points
srestha
5 Points
RavGopal
4 Points
Anirban Chand
4 Points
Mk Utkarsh
4 Points
abcd9982
3 Points
7,536
questions
1,781
answers
10,866
comments
90,472
users