Register

Recent questions tagged gatecse-2009

1.6k
views
0 answers
2 votes
Doubt in pipelining questions.
Consider this question and its selected answer: https://gateoverflow.in/3690/gate2004-it-47And this question: https://gateoverflow.in/1314/gate2009-28Both ... study this? Hamacher book doesn't contain pipelining in this much detail.
User Avatar
10.9k
views
5 answers
34 votes
GATE CSE 2009 | Question: 52
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ ... $\langle 0, 17, 31 \rangle$
User Avatar
14.9k
views
3 answers
47 votes
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$ ... to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
User Avatar
29.1k
views
6 answers
62 votes
GATE CSE 2009 | Question: 56
Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ ... $\text{3NF}$The schema is not in $\text{2NF}$
User Avatar
31.4k
views
7 answers
88 votes
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 ... $18ms$20ms$22ms$
User Avatar
9.0k
views
3 answers
24 votes
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, ... $\left\{14,13,12,8,10\right\}$
User Avatar
14.3k
views
3 answers
23 votes
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\}$ ... ,14,16,13,10,8,12\right\}$\left\{25,14,12,13,10,8,16\right\}$
User Avatar
50.2k
views
18 answers
128 votes
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 ... $I=3$I=4$I=5$
User Avatar
39.6k
views
8 answers
68 votes
GATE CSE 2009 | Question: 55
Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ ... part.Find the names of all suppliers who have not supplied only blue parts.
User Avatar
9.5k
views
3 answers
33 votes
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$ ...
User Avatar
20.5k
views
5 answers
49 votes
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 ... \langle 400, 16, 29 \rangle$ corresponds to sector number:$505035$505036$505037$505038$
User Avatar
5.0k
views
1 answers
5 votes
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 ... path coverage testing.I and IIII and IIII and IIII, II and III
User Avatar
8.3k
views
2 answers
11 votes
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 ... to an external entity.II and IIIII and IIII and IIII, II and III
User Avatar
30.2k
views
6 answers
66 votes
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 ... $ is a factor of $G(x)$G(x)$ has an odd number of terms.
User Avatar
26.8k
views
7 answers
88 votes
GATE CSE 2009 | Question: 47
While opening a $TCP$ ... a connection can increase?$0.015$/s$0.064$/s$0.135$/s$0.327$/s
User Avatar
7.8k
views
3 answers
21 votes
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 ... of the above equations correctly represents RSA cryptosystem?I and III and IIIII and IVIII and IV
User Avatar
25.2k
views
1 answers
92 votes
GATE CSE 2009 | Question: 45
Let $R$ and $S$ be relational schemes such that $R=\{a,b,c\}$ and $S=\{c\}.$ ... $ and $2$1$ and $3$2$ and $4$3$ and $4$
User Avatar
38.1k
views
12 answers
71 votes
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 ... $3$4$5$
User Avatar
6.9k
views
2 answers
30 votes
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 ... conflict-serializable?$S_1 \text{ and } S_2$S_2 \text{ and } S_3$S_3$ only$S_4$ only
User Avatar
18.8k
views
3 answers
50 votes
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 ... intermediate code level.I and III and IVIII and IVI, III and IV
User Avatar
21.6k
views
7 answers
46 votes
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$.
User Avatar
13.5k
views
6 answers
48 votes
GATE CSE 2009 | Question: 40
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ ... $L$ isNot recursive RegularContext free but not regularRecursively enumerable but not context free.
User Avatar
21.7k
views
5 answers
49 votes
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 ... (n)$\Theta(n \log n)$\Theta(n^2)$\Theta(n^2 \log n)$
User Avatar
9.4k
views
3 answers
25 votes
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? ...
User Avatar
44.3k
views
5 answers
40 votes
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$
User Avatar
7.6k
views
2 answers
33 votes
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$ and ...
User Avatar
12.7k
views
2 answers
31 votes
GATE CSE 2009 | Question: 35
The running time of an algorithm is represented by the following recurrence relation: ... $\Theta(n \log n)$\Theta(n^2)$\Theta(n^2 \log n)$
User Avatar
15.0k
views
4 answers
35 votes
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 becauseIt reduces the memory ... helps to reduce the number of page faults in page replacement algorithms.
User Avatar
25.7k
views
13 answers
62 votes
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)); ... are TRUE?(I) only(I) and (II)(II) and (III)(IV) only
User Avatar
19.6k
views
3 answers
37 votes
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 ... the above statements are TRUE?I and III and IIIII and IIIII and IV
User Avatar
Page: