The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged gate2009
GATE 2009 Computer Science & Information Technology Question Paper with Solution
+1
vote
0
answers
1
Doubt in pipelining questions.
Consider this question and its selected answer: https://gateoverflow.in/3690/gate2004it47 And this question: https://gateoverflow.in/1314/gate200928 Both questions are somewhat similar. In the first one's answer, instruction $I_1$ (when i = 2), ... that I am missing? PS. From where can I study this? Hamacher book doesn't contain pipelining in this much detail.
asked
Nov 4, 2017
in
CO & Architecture
by
Rishabh Gupta 2
Boss
(
16.3k
points)

300
views
coandarchitecture
pipelining
gate2004it
gate2009
+21
votes
3
answers
2
GATE200952
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 number. ... $\langle 0, 15, 31 \rangle$ $\langle 0, 16, 30 \rangle$ $\langle 0, 16, 31 \rangle$ $\langle 0, 17, 31 \rangle$
asked
Apr 23, 2016
in
Operating System
by
jothee
Veteran
(
115k
points)

2.3k
views
gate2009
operatingsystem
disks
normal
+28
votes
2
answers
3
GATE200954
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 the longest ... of $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
asked
Apr 23, 2016
in
Algorithms
by
jothee
Veteran
(
115k
points)

3.2k
views
gate2009
normal
algorithms
dynamicprogramming
recursion
+27
votes
3
answers
4
GATE200956
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})$ ... in $3NF$ but not in $\text{BCNF}$ The schema is in $2NF$ but not in $3NF$ The schema is not in $2NF$
asked
Apr 23, 2016
in
Databases
by
jothee
Veteran
(
115k
points)

5.1k
views
gate2009
databases
sql
databasenormalization
normal
+36
votes
5
answers
5
GATE200958
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 the minimum ... wait before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
asked
Apr 23, 2016
in
Computer Networks
by
jothee
Veteran
(
115k
points)

7.3k
views
gate2009
computernetworks
slidingwindow
normal
+14
votes
2
answers
6
GATE200960
Consider a binary maxheap implemented using an array. What is the content of the array after two delete operations on $\left\{25,14,16,13,10,8,12\right\}$ $\left\{14,13,12,10, 8\right\}$ $\left\{14,12,13,8,10\right\}$ $\left\{14,13,8,12,10\right\}$ $\left\{14,13,12,8,10\right\}$
asked
Apr 23, 2016
in
DS
by
jothee
Veteran
(
115k
points)

1.1k
views
gate2009
datastructure
heap
normal
+14
votes
2
answers
7
GATE200959
Consider a binary maxheap implemented using an array. Which one of the following array represents a binary maxheap? $\left\{25,12,16,13,10,8,14\right\}$ $\left\{25,14,13,16,10,8,12\right\}$ $\left\{25,14,16,13,10,8,12\right\}$ $\left\{25,14,12,13,10,8,16\right\}$
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
59.9k
points)

1.5k
views
gate2009
datastructure
heap
normal
+51
votes
11
answers
8
GATE200957, ISRO201675
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 minimum ... distinctly? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
asked
Sep 22, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.9k
points)

13.3k
views
gate2009
computernetworks
slidingwindow
normal
isro2016
+30
votes
4
answers
9
GATE200955
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})$ ... names of all suppliers who have supplied only nonblue part. Find the names of all suppliers who have not supplied only blue parts.
asked
Sep 22, 2014
in
Databases
by
Kathleen
Veteran
(
59.9k
points)

5.8k
views
gate2009
databases
sql
normal
+18
votes
3
answers
10
GATE200953
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 the ... $\text{expr2} = \max\left(l\left(i1, j1\right), l\left(i,j\right)\right)$
asked
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)

2.1k
views
gate2009
algorithms
normal
dynamicprogramming
recursion
+26
votes
2
answers
11
GATE200951
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 ... $\langle 400, 16, 29 \rangle$ corresponds to sector number: $505035$ $505036$ $505037$ $505038$
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)

5k
views
gate2009
operatingsystem
disks
normal
+4
votes
1
answer
12
GATE200950
Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE? The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph. The cyclomatic complexity of ... paths that should be tested during path coverage testing. I and II II and III I and III I, II and III
asked
Sep 22, 2014
in
IS&Software Engineering
by
Kathleen
Veteran
(
59.9k
points)

973
views
gate2009
is&softwareengineering
cyclomaticcomplexity
easy
+9
votes
2
answers
13
GATE200949
Which of the following statements are TRUE? The context diagram should depict the system as a single bubble. External entities should be identified clearly at all levels of DFDs. Control information should not be represented in a DFD. A data store can be connected wither to another data store or to an external entity. II and III II and III I and III I, II and III
asked
Sep 22, 2014
in
IS&Software Engineering
by
Kathleen
Veteran
(
59.9k
points)

1.2k
views
gate2009
is&softwareengineering
normal
dataflowdiagrams
+27
votes
5
answers
14
GATE200948
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
Sep 22, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.9k
points)

6.4k
views
gate2009
computernetworks
errordetection
normal
+40
votes
5
answers
15
GATE200947
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. The clock ... at which sequence numbers used for packets of a connection can increase? $0.015$/s $0.064$/s $0.135$/s $0.327$/s
asked
Sep 22, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.9k
points)

7.5k
views
gate2009
computernetworks
tcp
difficult
ambiguous
+16
votes
3
answers
16
GATE200946
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$ ... Which of the above equations correctly represents RSA cryptosystem? I and II I and III II and IV III and IV
asked
Sep 22, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.9k
points)

2k
views
gate2009
computernetworks
networksecurity
normal
+47
votes
1
answer
17
GATE200945
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 )$ ... Select R.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
Sep 22, 2014
in
Databases
by
Kathleen
Veteran
(
59.9k
points)

6.9k
views
gate2009
databases
relationalcalculus
difficult
+33
votes
10
answers
18
GATE200944
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 order of leaf ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$
asked
Sep 22, 2014
in
Databases
by
Kathleen
Veteran
(
59.9k
points)

7.7k
views
gate2009
databases
btree
normal
+15
votes
1
answer
19
GATE200943
Consider two transactions $T_1$ and $T_2$, and four schedules $S_1, S_2, S_3, S_4$, of $T_1$ and $T_2$ as given below: $T_1: R_1[x]W_1[x]W_1[y]$ $T_2: R_2[x]R_2[y]W_2[y]$ $S_1: R_1[x]R_2[x]R_2[y] W_1[x] W_1[y] W_2[y]$ ... $S_1 \text{ and } S_2$ $S_2 \text{ and } S_3$ $S_3$ only $S_4$ only
asked
Sep 22, 2014
in
Databases
by
Kathleen
Veteran
(
59.9k
points)

1.6k
views
gate2009
databases
transactions
normal
+24
votes
1
answer
20
GATE200942
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 can be ... at both source language and intermediate code level. I and II I and IV III and IV I, III and IV
asked
Sep 22, 2014
in
Compiler Design
by
Kathleen
Veteran
(
59.9k
points)

4.1k
views
gate2009
compilerdesign
parsing
normal
+22
votes
6
answers
21
GATE200941
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
Sep 22, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
59.9k
points)

2.5k
views
gate2009
theoryofcomputation
finiteautomata
easy
+28
votes
5
answers
22
GATE200940
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
Sep 22, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
59.9k
points)

2.7k
views
gate2009
theoryofcomputation
easy
identifyclasslanguage
+26
votes
3
answers
23
GATE200939
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
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)

3.9k
views
gate2009
algorithms
sorting
normal
+12
votes
1
answer
24
GATE200938
Consider the following graph: Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal’s algorithm? $\text{(b, e) (e, f) (a, c) (b, c) (f, g) (c, d)}$ $\text{(b, e) (e, f) (a, c) (f, g) (b, c) (c, d)}$ $\text{(b, e) (a, c) (e, f) (b, c) (f, g) (c, d)}$ $\text{(b, e) (e, f) (b, c) (a, c) (f, g) (c, d)}$
asked
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)

1.4k
views
gate2009
algorithms
spanningtree
normal
+18
votes
2
answers
25
GATE200937,ISRODEC201755
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
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
59.9k
points)

6.9k
views
gate2009
datastructure
binarysearchtree
normal
isrodec2017
+19
votes
2
answers
26
GATE200936
The keys $12, 18, 13, 2, 3, 23, 5$ and $15$ are inserted into an initially empty hash table of length $10$ using open addressing with hash function $h(k) = k \mod 10$ and linear probing. What is the resultant hash table? A B C D $0$ $1$ $2$ $2$ $3$ $23$ $4$ $5$ $15$ $6$ $7$ $8$ $18$ $9$ $0$ ... $8$ $18$ $9$ $15$ $0$ $1$ $2$ $2, 12$ $3$ $13, 3, 23$ $4$ $5$ $5, 15$ $6$ $7$ $8$ $18$ $9$
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
59.9k
points)

1.3k
views
gate2009
datastructure
hashing
normal
+15
votes
2
answers
27
GATE200935
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
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.9k
points)

2k
views
gate2009
algorithms
recurrence
timecomplexity
normal
+23
votes
2
answers
28
GATE200934
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 page table ... It is required by the translation lookaside buffer. It helps to reduce the number of page faults in page replacement algorithms.
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)

2.6k
views
gate2009
operatingsystem
virtualmemory
easy
+27
votes
9
answers
29
GATE200933
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 associated with ... at the same time Which of the above statements are TRUE? (I) only (I) and (II) (II) and (III) (IV) only
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)

5.9k
views
gate2009
operatingsystem
processsynchronization
normal
+18
votes
3
answers
30
GATE200932
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 transition $A$ ... uses nonpreemptive scheduling. Which of the above statements are TRUE? I and II I and III II and III II and IV
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
59.9k
points)

2.3k
views
gate2009
operatingsystem
processschedule
normal
Page:
1
2
3
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
Recent Posts
IIT Gandhinagar review
Is DAIICT good for doing MTech ?
AIR175 : GO is enough
GATE 2019 My reasoned routine. (AIR 558)
if i can you also can
Follow @csegate
Recent questions tagged gate2009
Recent Blog Comments
can i get a call on 580 (OBCNCL)
Many times Anger , Aggression and Fear push...
One word would be "Priorities" Second word shall...
What's interesting to me is that despite having...
Brother!! your all posts are really worth to read...
48,634
questions
52,769
answers
183,405
comments
68,307
users