Recent questions tagged gate2006

+4 votes

1 answer

1

GATE2006-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 (D) 10, 8, 6, 9, 7, 2, 3, 4, 1, 5

asked Nov 27, 2016 in DS by Arjun Veteran (319k points) | 341 views

+5 votes

1 answer

2

GATE2006-85
The grammar $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \varepsilon$ $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 that grammar what is the length of the derivation (number of steps starting from ... l}b^{m}$ with $l\neq m$ $max (l,m) + 2$ $l + m + 2$ $l + m + 3$ $max (l,m) + 3$

asked Nov 7, 2016 in Compiler Design by jothee Veteran (92.8k points) | 217 views

0 votes

1 answer

3

GATE2006-85
Find the grammar that generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$. In that grammar what is the length of the derivation (number of steps starring from $S$) to generate the string $a^{l}b^{m}$ with $l\neq m$ $max (l,m) + 2$ $l + m + 2$ $l + m + 3$ $max (l,m) + 3$

asked Nov 7, 2016 in Compiler Design by jothee Veteran (92.8k points) | 171 views

+4 votes

1 answer

4

GATE2006-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 ... host H1 send out a broadcast ping packet. Which of the following options represents the correct forwarding table on B3?

asked Nov 7, 2016 in Computer Networks by jothee Veteran (92.8k points) | 512 views

+7 votes

3 answers

5

GATE2006-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^{n/2}$ $\frac{2^{n}}{n}$

asked Apr 24, 2016 in Graph Theory by jothee Veteran (92.8k points) | 950 views

+11 votes

4 answers

6

GATE2006-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{n/2}{2}2^{n/2}$ $2^{n-2}$ $2^{n-3}\times 3$ $2^{n-1}$

asked Apr 24, 2016 in Graph Theory by jothee Veteran (92.8k points) | 1.1k views

+4 votes

3 answers

7

GATE2006-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- ... is $h_1$ while that of direct mapped is $h_2$. The value of $h_2$ is: 2.4 ns 2.3 ns 1.8 ns 1.7 ns

asked Apr 24, 2016 in CO & Architecture by jothee Veteran (92.8k points) | 800 views

+12 votes

3 answers

8

GATE2006-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 ... at the beginning of the barrier and re-enabled at the end. The variable process_left is made private instead of shared

asked Apr 24, 2016 in Operating System by jothee Veteran (92.8k points) | 907 views

+5 votes

3 answers

9

GATE2006-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 (j=0; j< ... P2 be M2. The value of the ratio $\frac{M_{1}}{M_{2}}$ $0$ $\frac{1}{16}$ $\frac{1}{8}$ $16$

asked Apr 23, 2016 in CO & Architecture by jothee Veteran (92.8k points) | 761 views

+16 votes

5 answers

10

GATE2006-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 ... rightarrow Bb\mid \varepsilon$ $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \varepsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$

asked Sep 26, 2014 in Compiler Design by Rucha Shelke Loyal (4.2k points) | 1.1k views

+12 votes

4 answers

11

GATE2006-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 ... B3, B4, B2 B1, B3, B5, B2, B4 B1, B5, B2, B3, B4 B1, B3, B4, B5, B2

asked Sep 26, 2014 in Computer Networks by Rucha Shelke Loyal (4.2k points) | 2.9k views

+6 votes

4 answers

12

GATE2006-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; ... the number of cache misses experienced by P1 be M1 and that for P2 be M2. The value of M1 is: 0 2048 16384 262144

asked Sep 26, 2014 in CO & Architecture by Rucha Shelke Loyal (4.2k points) | 1.6k views

+16 votes

3 answers

13

GATE2006-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 ... not be inside a critical section The barrier implementation is correct if there are only two processes instead of three.

asked Sep 26, 2014 in Operating System by Rucha Shelke Loyal (4.2k points) | 2.2k views

+9 votes

3 answers

14

GATE2006-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 right ... , 5, 6, 8, 9 9, 6, 3, 1, 8, 5 9, 3, 6, 8, 5, 1 9, 5, 6, 8, 3, 1

asked Sep 26, 2014 in DS by Rucha Shelke Loyal (4.2k points) | 717 views

+13 votes

3 answers

15

GATE2006-74
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- ... is $h_1$ while that of direct mapped is $h_2$. The value of $h_1$ is: 2.4 ns 2.3 ns 1.8 ns 1.7 ns

asked Sep 26, 2014 in CO & Architecture by Rucha Shelke Loyal (4.2k points) | 2.8k views

+15 votes

3 answers

16

GATE2006-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$

asked Sep 26, 2014 in Graph Theory by Rucha Shelke Loyal (4.2k points) | 1.7k views

+9 votes

2 answers

17

GATE2006-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 ... \}^{*}=\left \{ ACDEFG \right \}$ $ \left \{ AB \right \}^{*}=\left \{ ABCDG \right \}$

asked Sep 26, 2014 in Databases by Rucha Shelke Loyal (4.2k points) | 936 views

+9 votes

4 answers

18

GATE2006-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 ... faster than Plan 2 for all databases For x = 9000, Plan I executes slower than Plan 2 for all databases

asked Sep 26, 2014 in Databases by Rucha Shelke Loyal (4.2k points) | 1.2k views

+17 votes

4 answers

19

GATE2006-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 ... which Query3 returns strictly fewer rows than Query2 There exist databases for which Query4 will encounter an integrity violation at runtime

asked Sep 26, 2014 in Databases by Rucha Shelke Loyal (4.2k points) | 1.8k views

+21 votes

3 answers

20

GATE2006-67
Consider the relation account (customer, balance) where 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 ... using ODBC. Which two of the above statements are correct? 2 and 5 1 and 3 1 and 4 3 and 5

asked Sep 26, 2014 in Databases by Rucha Shelke Loyal (4.2k points) | 2.2k views

+10 votes

1 answer

21

GATE2006-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 ... {k\neq p,q}y_{k}$ $ \max(x_{p},x_{q})>1$ $ \min(x_{p},x_{q})>1$

asked Sep 26, 2014 in Operating System by Rucha Shelke Loyal (4.2k points) | 1.6k views

+12 votes

4 answers

22

GATE2006-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 20% of execution time doing I/O, the next 70% of time doing computation, and the last 10% of time ... be overlapped as much as possible. For what percentage of time does the CPU remain idle? 0% 10.6% 30.0% 89.4%

asked Sep 26, 2014 in Operating System by Rucha Shelke Loyal (4.2k points) | 1.9k views

+7 votes

2 answers

23

GATE2006-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 ... to the process with the lowest process id. The average turn around time is: 13 units 14 units 15 units 16 units

asked Sep 26, 2014 in Operating System by Rucha Shelke Loyal (4.2k points) | 1.4k views

+20 votes

4 answers

24

GATE2006-63, UGCNET-June2012-III-45

asked Sep 26, 2014 in Operating System by Rucha Shelke Loyal (4.2k points) | 2.2k views

+10 votes

1 answer

25

GATE2006-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: 11 bits 13 bits 15 bits 20 bits

asked Sep 26, 2014 in Operating System by Rucha Shelke Loyal (4.2k points) | 3.9k views

+26 votes

4 answers

26

GATE2006-61
The atomic fetch-and-set x, y instruction unconditionally sets the memory location x to 1 and fetches the old value of x n y without allowing any intervening access to the memory location x. Consider the following implementation of P and ... pair of normal load/store can be used The implementation of V is wrong The code does not implement a binary semaphore

asked Sep 26, 2014 in Operating System by Rucha Shelke Loyal (4.2k points) | 2.7k views

+4 votes

1 answer

27

GATE2006-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 ... 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

asked Sep 26, 2014 in Compiler Design by Rucha Shelke Loyal (4.2k points) | 695 views

+11 votes

2 answers

28

GATE2006-59
Consider the following translation scheme. $ S\rightarrow ER$ $ R\rightarrow ^{*}E\left \{ print('*'); \right \} R\mid \varepsilon $ $ E\rightarrow F+E\left \{ print('+'); \right \}\mid F $ $ F\rightarrow S\mid id \left \{ print(id.value); \right \} $ Here id ... . For an input '2 * 3 + 4', this translation scheme prints 2 * 3 + 4 2 * +3 4 2 3 * 4 + 2 3 4+*

asked Sep 26, 2014 in Compiler Design by Rucha Shelke Loyal (4.2k points) | 1k views

+5 votes

3 answers

29

GATE2006-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 $ ... }S\right \} $ $ \left \{ F\rightarrow id \right \} $ and $ \left \{ R\rightarrow \varepsilon \right \} $

asked Sep 26, 2014 in Compiler Design by Rucha Shelke Loyal (4.2k points) | 840 views

+21 votes

2 answers

30

GATE2006-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 ... 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

asked Sep 26, 2014 in Programming by Rucha Shelke Loyal (4.2k points) | 1.6k views

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 questions tagged gate2006

Recent Posts

Recent Blog Comments

Recent Badges