Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2009
2
votes
0
answers
1
Doubt in pipelining questions.
Consider this question and its selected answer: https://gateoverflow.in/3690/gate2004-it-47 And this question: https://gateoverflow.in/1314/gate2009-28 Both questions are somewhat similar. In the first one's answer, instruction $I_1$ (when i = ... I am missing? PS. From where can I study this? Hamacher book doesn't contain pipelining in this much detail.
Consider this question and its selected answer: https://gateoverflow.in/3690/gate2004-it-47And this question: https://gateoverflow.in/1314/gate2009-28Both questions are s...
Rishabh Gupta 2
1.5k
views
Rishabh Gupta 2
asked
Nov 4, 2017
CO and Architecture
co-and-architecture
pipelining
gateit-2004
gatecse-2009
+
–
33
votes
5
answers
2
GATE CSE 2009 | Question: 52
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$
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...
go_editor
10.3k
views
go_editor
asked
Apr 23, 2016
Operating System
gatecse-2009
operating-system
disk
normal
+
–
47
votes
3
answers
3
GATE CSE 2009 | Question: 54
A sub-sequence 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 ... $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
A sub-sequence 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 ...
go_editor
14.3k
views
go_editor
asked
Apr 23, 2016
Algorithms
gatecse-2009
normal
algorithms
dynamic-programming
recursion
+
–
61
votes
6
answers
4
GATE CSE 2009 | Question: 56
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})$ ... $\text{2NF}$ but not in $\text{3NF}$ The schema is not in $\text{2NF}$
Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\tex...
go_editor
27.9k
views
go_editor
asked
Apr 23, 2016
Databases
gatecse-2009
databases
sql
database-normalization
normal
+
–
87
votes
7
answers
5
GATE CSE 2009 | Question: 58
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$
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 maxi...
go_editor
29.9k
views
go_editor
asked
Apr 23, 2016
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
+
–
24
votes
3
answers
6
GATE CSE 2009 | Question: 60
Consider a binary max-heap 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\}$
Consider a binary max-heap 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...
go_editor
8.6k
views
go_editor
asked
Apr 23, 2016
DS
gatecse-2009
data-structures
binary-heap
normal
+
–
23
votes
3
answers
7
GATE CSE 2009 | Question: 59
Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap? $\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\}$
Consider a binary max-heap implemented using an array.Which one of the following array represents a binary max-heap?$\left\{25,12,16,13,10,8,14\right\}$ $\left\{25,14,...
Kathleen
13.6k
views
Kathleen
asked
Sep 22, 2014
DS
gatecse-2009
data-structures
heap
easy
+
–
126
votes
18
answers
8
GATE CSE 2009 | Question: 57, ISRO2016-75
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$
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 ...
Kathleen
48.1k
views
Kathleen
asked
Sep 22, 2014
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
isro2016
+
–
68
votes
8
answers
9
GATE CSE 2009 | Question: 55
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 non-blue part. Find the names of all suppliers who have not supplied only blue parts.
Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\tex...
Kathleen
38.2k
views
Kathleen
asked
Sep 22, 2014
Databases
gatecse-2009
databases
sql
normal
+
–
32
votes
2
answers
10
GATE CSE 2009 | Question: 53
A sub-sequence 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(i-1, j-1\right), l\left(i,j\right)\right)$
A sub-sequence 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 ...
Kathleen
9.2k
views
Kathleen
asked
Sep 22, 2014
Algorithms
gatecse-2009
algorithms
normal
dynamic-programming
recursion
+
–
48
votes
5
answers
11
GATE CSE 2009 | Question: 51
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$
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...
Kathleen
19.3k
views
Kathleen
asked
Sep 22, 2014
Operating System
gatecse-2009
operating-system
disk
normal
+
–
5
votes
1
answer
12
GATE CSE 2009 | Question: 50
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 ... that should be tested during path coverage testing. I and II II and III I and III I, II and III
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 m...
Kathleen
4.7k
views
Kathleen
asked
Sep 22, 2014
IS&Software Engineering
gatecse-2009
is&software-engineering
cyclomatic-complexity
easy
+
–
11
votes
2
answers
13
GATE CSE 2009 | Question: 49
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
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...
Kathleen
7.8k
views
Kathleen
asked
Sep 22, 2014
IS&Software Engineering
gatecse-2009
is&software-engineering
normal
data-flow-diagrams
+
–
64
votes
6
answers
14
GATE CSE 2009 | Question: 48
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.
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)$ contai...
Kathleen
28.9k
views
Kathleen
asked
Sep 22, 2014
Computer Networks
gatecse-2009
computer-networks
error-detection
normal
+
–
86
votes
7
answers
15
GATE CSE 2009 | Question: 47
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (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 ... sequence numbers used for packets of a connection can increase? $0.015$/s $0.064$/s $0.135$/s $0.327$/s
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low orde...
Kathleen
25.2k
views
Kathleen
asked
Sep 22, 2014
Computer Networks
gatecse-2009
computer-networks
tcp
difficult
ambiguous
+
–
21
votes
3
answers
16
GATE CSE 2009 | Question: 46
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 ... Which of the above equations correctly represents RSA cryptosystem? I and II I and III II and IV III and IV
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...
Kathleen
7.3k
views
Kathleen
asked
Sep 22, 2014
Computer Networks
gatecse-2009
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
90
votes
1
answer
17
GATE CSE 2009 | Question: 45
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_{R-S}(r) - \pi_{R-S} \left (\pi_{R-S} (r) \times s - \pi_{R-S,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$
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_{R-S}(r) - \pi_{R-S} \left (\pi_{R-S}...
Kathleen
24.5k
views
Kathleen
asked
Sep 22, 2014
Databases
gatecse-2009
databases
relational-calculus
difficult
+
–
70
votes
12
answers
18
GATE CSE 2009 | Question: 44
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$
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 ...
Kathleen
36.8k
views
Kathleen
asked
Sep 22, 2014
Databases
gatecse-2009
databases
b-tree
normal
+
–
30
votes
2
answers
19
GATE CSE 2009 | Question: 43
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
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...
Kathleen
6.5k
views
Kathleen
asked
Sep 22, 2014
Databases
gatecse-2009
databases
transaction-and-concurrency
normal
+
–
50
votes
3
answers
20
GATE CSE 2009 | Question: 42
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 L-attributed ... both source language and intermediate code level. I and II I and IV III and IV I, III and IV
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 langu...
Kathleen
18.2k
views
Kathleen
asked
Sep 22, 2014
Compiler Design
gatecse-2009
compiler-design
parsing
normal
+
–
46
votes
7
answers
21
GATE CSE 2009 | Question: 41
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$.
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$.
Kathleen
21.0k
views
Kathleen
asked
Sep 22, 2014
Theory of Computation
gatecse-2009
theory-of-computation
finite-automata
easy
+
–
48
votes
6
answers
22
GATE CSE 2009 | Question: 40
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.
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...
Kathleen
13.0k
views
Kathleen
asked
Sep 22, 2014
Theory of Computation
gatecse-2009
theory-of-computation
easy
identify-class-language
+
–
48
votes
5
answers
23
GATE CSE 2009 | Question: 39
In quick-sort, 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)$
In quick-sort, 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 com...
Kathleen
21.1k
views
Kathleen
asked
Sep 22, 2014
Algorithms
gatecse-2009
algorithms
sorting
normal
+
–
25
votes
3
answers
24
GATE CSE 2009 | Question: 38
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)}$
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) (...
Kathleen
8.9k
views
Kathleen
asked
Sep 22, 2014
Algorithms
gatecse-2009
algorithms
spanning-tree
normal
+
–
39
votes
5
answers
25
GATE CSE 2009 | Question: 37,ISRO-DEC2017-55
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$. $2$ $3$ $4$ $5$
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$.$2$$3$$4$$5$
Kathleen
43.3k
views
Kathleen
asked
Sep 22, 2014
DS
gatecse-2009
data-structures
binary-search-tree
normal
isrodec2017
avl-tree
+
–
32
votes
2
answers
26
GATE CSE 2009 | Question: 36
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$ ...
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...
Kathleen
7.3k
views
Kathleen
asked
Sep 22, 2014
DS
gatecse-2009
data-structures
hashing
normal
+
–
31
votes
2
answers
27
GATE CSE 2009 | Question: 35
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)$
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{...
Kathleen
12.2k
views
Kathleen
asked
Sep 22, 2014
Algorithms
gatecse-2009
algorithms
recurrence-relation
time-complexity
normal
+
–
35
votes
4
answers
28
GATE CSE 2009 | Question: 34
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 ... is required by the translation lookaside buffer. It helps to reduce the number of page faults in page replacement algorithms.
A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address becauseIt reduces the memory access ti...
Kathleen
14.3k
views
Kathleen
asked
Sep 22, 2014
Operating System
gatecse-2009
operating-system
virtual-memory
easy
+
–
61
votes
13
answers
29
GATE CSE 2009 | Question: 33
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows: void enter_CS(X) { while(test-and-set(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
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows:void enter_CS(X) { while(test-an...
Kathleen
24.7k
views
Kathleen
asked
Sep 22, 2014
Operating System
gatecse-2009
operating-system
process-synchronization
normal
+
–
36
votes
3
answers
30
GATE CSE 2009 | Question: 32
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
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 sta...
Kathleen
18.6k
views
Kathleen
asked
Sep 22, 2014
Operating System
gatecse-2009
operating-system
process-scheduling
normal
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register