Recent questions tagged gate2006-cse

19 votes

1 answer

1

GATE CSE 2006 | Question: 77
Statement for Linked Answer Questions 76 & 77: A $3$-ary max heap is like a binary max heap, but instead of $2$ children, nodes have $3$ children. A $3$-ary heap can be represented by an array as follows: The root is stored in the first location, $a[0]$, nodes in the next level, from left to ... $10, 9, 4, 5, 7, 6, 8, 2, 1, 3$ $10, 8, 6, 9, 7, 2, 3, 4, 1, 5$

Arjun asked in DS Nov 27, 2016

by Arjun

4.3k views

20 votes

4 answers

2

GATE CSE 2006 | Question: 85
The grammar $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \epsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$ generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$. In this grammar what is the length of the derivation (number of steps starting from $S$) to generate ... $l\neq m$ $\max (l,m) + 2$ $l + m + 2$ $l + m + 3$ $\max (l,m) + 3$

jothee asked in Compiler Design Nov 7, 2016

by jothee

3.7k views

16 votes

1 answer

3

GATE CSE 2006 | Question: 83
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the graph, the bridges organize themselves in a spanning tree. First, the root bridge is identified as the bridge with the least ...

jothee asked in Computer Networks Nov 7, 2016

by jothee

4.6k views

34 votes

5 answers

4

GATE CSE 2006 | Question: 73
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in $G$ is: $n$ $n + 2$ $2^{\frac{n}{2}}$ $\frac{2^{n}}{n}$

jothee asked in Graph Theory Apr 24, 2016

by jothee

5.1k views

67 votes

5 answers

5

GATE CSE 2006 | Question: 72
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The maximum degree of a vertex in $G$ is: $\binom{\frac{n}{2}}{2}.2^{\frac{n}{2}}$ $2^{n-2}$ $2^{n-3}\times 3$ $2^{n-1}$

jothee asked in Graph Theory Apr 24, 2016

by jothee

11.3k views

31 votes

4 answers

6

GATE CSE 2006 | Question: 75
Consider two cache organizations. First one is $32$ $kB$ $2$-way set associative with $32$ $byte$ block size, the second is of same size but direct mapped. The size of an address is $32$ $bits$ in both cases . A $2$-to-$1$ multiplexer has latency of $0.6 ns$ while a $k-$ ... of direct mapped is $h_2$. The value of $h_2$ is: $2.4$ $ns$ $2.3$ $ns$ $1.8$ $ns$ $1.7$ $ns$

jothee asked in CO and Architecture Apr 24, 2016

by jothee

7k views

31 votes

4 answers

7

GATE CSE 2006 | Question: 79
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arrive and then all processes leave the barrier. Let the number of processes ... at the beginning of the barrier and re-enabled at the end. The variable process_left is made private instead of shared

jothee asked in Operating System Apr 24, 2016

by jothee

5.3k views

27 votes

5 answers

8

GATE CSE 2006 | Question: 81
A CPU has a $32$ $KB$ direct mapped cache with $128$ byte-block size. Suppose $A$ is two dimensional array of size $512 \times512$ with elements that occupy $8-bytes$ each. Consider the following two $C$ code segments, $P1$ and $P2$. $P1$: for (i=0; i<512; i++) { for ( ... $M2$. The value of the ratio $\frac{M_{1}}{M_{2}}$: $0$ $\frac{1}{16}$ $\frac{1}{8}$ $16$

jothee asked in CO and Architecture Apr 23, 2016

by jothee

6.7k views

39 votes

4 answers

9

GATE CSE 2006 | Question: 84
Which one of the following grammars generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$? $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid a\mid b$ $A\rightarrow aA\mid \varepsilon$ $B\rightarrow Bb\mid \varepsilon$ ... $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \varepsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$

Rucha Shelke asked in Compiler Design Sep 26, 2014

by Rucha Shelke

8.1k views

45 votes

4 answers

10

GATE CSE 2006 | Question: 82
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the graph, the bridges organize themselves in a spanning tree. First, the root bridge is identified as the bridge with the least serial number. ... $\text{B1, B5, B2, B3, B4}$ $\text{B1, B3, B4, B5, B2}$

Rucha Shelke asked in Computer Networks Sep 26, 2014

by Rucha Shelke

15.3k views

38 votes

8 answers

11

GATE CSE 2006 | Question: 80
A CPU has a $32 KB$ direct mapped cache with $128$ byte-block size. Suppose A is two dimensional array of size $512 \times512$ with elements that occupy $8$-bytes each. Consider the following two C code segments, $P1$ and $P2$. P1: for (i=0; i<512; i++) { for (j=0; ... $P1$ be $M_{1}$and that for $P2$ be $M_{2}$. The value of $M_{1}$ is: $0$ $2048$ $16384$ $262144$

Rucha Shelke asked in CO and Architecture Sep 26, 2014

by Rucha Shelke

10.9k views

55 votes

3 answers

12

GATE CSE 2006 | Question: 78
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arrive and then all processes leave the barrier. Let the number of ... need not be inside a critical section The barrier implementation is correct if there are only two processes instead of three.

Rucha Shelke asked in Operating System Sep 26, 2014

by Rucha Shelke

11.8k views

20 votes

2 answers

13

GATE CSE 2006 | Question: 76
Statement for Linked Answer Questions 76 & 77: A $3$-ary max heap is like a binary max heap, but instead of $2$ children, nodes have $3$ children. A $3$-ary heap can be represented by an array as follows: The root is stored in the first location, $a[0]$, nodes in the next level, from left to ... $9, 6, 3, 1, 8, 5$ $9, 3, 6, 8, 5, 1$ $9, 5, 6, 8, 3, 1$

Rucha Shelke asked in DS Sep 26, 2014

by Rucha Shelke

2.9k views

53 votes

4 answers

14

GATE CSE 2006 | Question: 74
Consider two cache organizations. First one is $32 \; \textsf{KB}\;2\text{-way}$ set associative with $32 \; \text{byte}$ block size, the second is of same size but direct mapped. The size of an address is $32\; \text{bits}$ in both cases . A $2\text{-to-}1$ multiplexer has ... The value of $h_1$ is: $2.4 \text{ ns} $ $2.3 \text{ ns}$ $1.8 \text{ ns}$ $1.7 \text{ ns}$

Rucha Shelke asked in CO and Architecture Sep 26, 2014

by Rucha Shelke

17.8k views

49 votes

4 answers

15

GATE CSE 2006 | Question: 71
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of vertices of degree zero in $G$ is: $1$ $n$ $n + 1$ $2^n$

Rucha Shelke asked in Graph Theory Sep 26, 2014

by Rucha Shelke

11.1k views

24 votes

2 answers

16

GATE CSE 2006 | Question: 70
The following functional dependencies are given: $ AB\rightarrow CD,AF\rightarrow D,DE\rightarrow F,$C\rightarrow G,F\rightarrow E,G\rightarrow A $ Which one of the following options is false? $ \left \{ CF \right \}^{*}=\left \{ ACDEFG \right \}$ $ \left \{ BG \right \} ... $ \left \{ AB \right \}^{*}=\left \{ ABCDG \right \}$

Rucha Shelke asked in Databases Sep 26, 2014

by Rucha Shelke

6.9k views

36 votes

8 answers

17

GATE CSE 2006 | Question: 69
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts ... faster than Plan 2 for all databases For $x = 9000,$ Plan I executes slower than Plan 2 for all databases

Rucha Shelke asked in Databases Sep 26, 2014

by Rucha Shelke

7.7k views

47 votes

5 answers

18

GATE CSE 2006 | Question: 68
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. ... strictly fewer rows than Query$2$ There exist databases for which Query$4$ will encounter an integrity violation at runtime

Rucha Shelke asked in Databases Sep 26, 2014

by Rucha Shelke

12.7k views

73 votes

6 answers

19

GATE CSE 2006 | Question: 67
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank $1.$ Ties are not broke but ranks are skipped: if ... of the above statements are correct? $2$ and $5$ $1$ and $3$ $1$ and $4$ $3$ and $5$

Rucha Shelke asked in Databases Sep 26, 2014

by Rucha Shelke

13k views

47 votes

2 answers

20

GATE CSE 2006 | Question: 66
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $x_i$ instances of a resource $R$, $ 1\leq i\leq n$ . Currently, all instances of $R$ are occupied. Further, for all $i$, process $i$ has placed a request for an additional $y_i$ instances while ... $ \max(x_{p},x_{q})>1$ $ \min(x_{p},x_{q})>1$

Rucha Shelke asked in Operating System Sep 26, 2014

by Rucha Shelke

10.7k views

41 votes

7 answers

21

GATE CSE 2006 | Question: 65
Consider three processes, all arriving at time zero, with total execution time of $10$, $20$ and $30$ units, respectively. Each process spends the first $\text{20%}$ of execution time doing I/O, the next $\text{70%}$ ... percentage of time does the CPU remain idle? $\text{0%}$ $\text{10.6%}$ $\text{30.0%}$ $\text{89.4%}$

Rucha Shelke asked in Operating System Sep 26, 2014

by Rucha Shelke

14.8k views

30 votes

3 answers

22

GATE CSE 2006 | Question: 64
Consider three processes (process id $0$, $1$, $2$ respectively) with compute time bursts $2$, $4$ and $8$ time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by ... the process with the lowest process id. The average turn around time is: $13$ units $14$ units $15$ units $16$ units

Rucha Shelke asked in Operating System Sep 26, 2014

by Rucha Shelke

9.3k views

56 votes

5 answers

23

GATE CSE 2006 | Question: 63, UGCNET-June2012-III: 45
A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to ... more efficient now Hardware support for memory management is no longer needed CPU scheduling can be made more efficient now

Rucha Shelke asked in Operating System Sep 26, 2014

by Rucha Shelke

16.7k views

41 votes

1 answer

24

GATE CSE 2006 | Question: 62, ISRO2016-50
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a translation look-aside buffer (TLB) which can hold a total of $128$ page table entries and is $4$-way set associative. The minimum size of the TLB tag is: $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$

Rucha Shelke asked in Operating System Sep 26, 2014

by Rucha Shelke

18.2k views

86 votes

6 answers

25

GATE CSE 2006 | Question: 61
The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening access to the memory location $x$ ... a pair of normal load/store can be used The implementation of $V$ is wrong The code does not implement a binary semaphore

Rucha Shelke asked in Operating System Sep 26, 2014

by Rucha Shelke

18.8k views

19 votes

1 answer

26

GATE CSE 2006 | Question: 60
Consider the following C code segment. for (i = 0, i < n; i++) { for (j = 0; j < n; j++) { if (i%2) { x += (4*j + 5*i); y += (7 + 4*j); } } } Which one of the following is false? ... computation There is scope of common sub-expression elimination in this code There is scope of strength reduction in this code There is scope of dead code elimination in this code

Rucha Shelke asked in Compiler Design Sep 26, 2014

by Rucha Shelke

5.4k views

26 votes

3 answers

27

GATE CSE 2006 | Question: 59
Consider the following translation scheme. $ S\rightarrow ER$ $ R\rightarrow *E\left \{ \text{print}(\text{ }*\text{'}); \right \} R\mid \varepsilon $ $ E\rightarrow F+E\left \{ \text{print}(\text{ }+\text{'}); \right \}\mid F $ ... $2 * 3 + 4$ $2 * +3 \ 4$ $2 \ 3 * 4 +$ $2 \ 3 \ 4+*$

Rucha Shelke asked in Compiler Design Sep 26, 2014

by Rucha Shelke

6.6k views

20 votes

3 answers

28

GATE CSE 2006 | Question: 58
Consider the following grammar: $S\rightarrow FR$ $ R\rightarrow * S\mid \varepsilon $ $ F\rightarrow id $ In the predictive parser table $M$ of the grammar the entries $M[S,id]$ and $M[R,\$]$ respectively are $ \left \{ S\rightarrow FR \right \} $ and $ ... $ \left \{ F\rightarrow id \right \} $ and $ \left \{ R\rightarrow \varepsilon \right \} $

Rucha Shelke asked in Compiler Design Sep 26, 2014

by Rucha Shelke

5.1k views

56 votes

4 answers

29

GATE CSE 2006 | Question: 57
Consider this C code to swap two integers and these five statements: the code void swap (int *px, int *py) { *px = *px - *py; *py = *px + *py; *px = *py - *px; } S1: will generate a compilation error S2: may generate a ... procedure correctly for some but not all valid input pointers S5: may add or subtract integers and pointers S1 S2 and S3 S2 and S4 S2 and S5

Rucha Shelke asked in Programming Sep 26, 2014

by Rucha Shelke

14.2k views

14 votes

2 answers

30

GATE CSE 2006 | Question: 56, ISRO2009-58
Consider the following code written in a pass-by-reference language like FORTRAN and these statements about the code. subroutine swap(ix,iy) it = ix L1 : ix = iy L2 : iy = it end ia = 3 ib = 8 call swap (ia, ib+5) print *, ia, ib end ... : The program will print 13 and -2 Exactly the following set of statement(s) is correct: S1 and S2 S1 and S4 S3 S1 and S5

Rucha Shelke asked in Programming Sep 26, 2014

by Rucha Shelke

4.7k views

Page:

1
2
3
next »

Follow @gateoverflow

GATE Overflow

Recent questions tagged gate2006-cse

Search GATE Overflow