Recent questions tagged gatecse-2012

46 votes

4 answers

1

GATE CSE 2012 | Question: 49
Consider the following C code segment. int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf( \n %d %d , a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a += ++b ... $\begin{array}{ll} \text{4} & \text{2} \\ \text{4} & \text{2} \\ \text{2} & \text{0} \\ \end{array}$

Consider the following C code segment.int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf(“ \n %d %d ”, a, ...

10.1k views

go_editor asked Apr 21, 2016

48 votes

4 answers

2

GATE CSE 2012 | Question: 51
Consider the following relations $A, B$ and $C:$ ... contain? SELECT A.Id FROM A WHERE A.Age > ALL (SELECT B.Age FROM B WHERE B.Name = Arun') $4$ $3$ $0$ $1$

Consider the following relations $A, B$ and $C:$ $$\overset{\textbf{A}}{\begin{array}{|c|c|c|}\hline\\\textbf{Id}& \textbf{Name}& \textbf{Age} \\\hline12& \text{A...

13.7k views

go_editor asked Apr 21, 2016

42 votes

3 answers

3

GATE CSE 2012 | Question: 53
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\varepsilon$ is the empty string, \$ indicates end of input, and, $ ... $ E2 : B \rightarrow S, S \rightarrow \varepsilon$ $ E3 : B \rightarrow S$

For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\var...

17.4k views

go_editor asked Apr 21, 2016

32 votes

4 answers

4

GATE CSE 2012 | Question: 55
A computer has a $256$-$\text{KByte}$, 4-way set associative, write back data cache with block size of $32$ $\text{Bytes}$. The processor sends $32$ $\text{bit}$ addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, ... tag directory is: $160$ $\text{Kbits}$ $136$ $\text{Kbits}$ $40$ $\text{Kbits}$ $32$ $\text{Kbits}$

A computer has a $256$-$\text{KByte}$, 4-way set associative, write back data cache with block size of $32$ $\text{Bytes}$. The processor sends $32$ $\text{bit}$ addresse...

12.3k views

go_editor asked Apr 21, 2016

9 votes

4 answers

5

GATE CSE 2012 | Question: 65
Given the sequence of terms, $\text{AD CG FK JP}$, the next term is $\text{OV}$ $\text{OW}$ $\text{PV}$ $\text{PW}$

Given the sequence of terms, $\text{AD CG FK JP}$, the next term is$\text{OV}$$\text{OW}$$\text{PV}$$\text{PW}$

2.7k views

gatecse asked Sep 29, 2014

18 votes

2 answers

6

GATE CSE 2012 | Question: 64
Which of the following assertions are CORRECT? P: Adding $7$ to each entry in a list adds $7$ to the mean of the list Q: Adding $7$ to each entry in a list adds $7$ to the standard deviation of the list R: Doubling each entry in a list doubles the mean of the ... entry in a list leaves the standard deviation of the list unchanged $P$, $Q$ $Q$, $R$ $P$, $R$ $R$, $S$

Which of the following assertions are CORRECT?P: Adding $7$ to each entry in a list adds $7$ to the mean of the list Q: Adding $7$ to each entry in a list adds $7$ to the...

6.0k views

gatecse asked Sep 29, 2014

23 votes

1 answer

7

GATE CSE 2012 | Question: 63
An automobile plant contracted to buy shock absorbers from two suppliers $ X$ and $ Y$ . $ X$ supplies $60\%$ and Y supplies $40\%$ of the shock absorbers. All shock absorbers are subjected to a quality test. The ones that pass the quality test are considered reliable. ... shock absorber, which is found to be reliable, is made by $Y$ is $0.288$ $0.334$ $0.667$ $0.720$

An automobile plant contracted to buy shock absorbers from two suppliers $ X$ and $ Y$ . $ X$ supplies $60\%$ and Y supplies $40\%$ of the shock absorbers. All shock abso...

5.1k views

gatecse asked Sep 29, 2014

12 votes

2 answers

8

GATE CSE 2012 | Question: 62
A political party orders an arch for the entrance to the ground in which the annual convention is being held. The profile of the arch follows the equation $y=2x-0.1x^{2}$ where $y$ is the height of the arch in meters. The maximum possible height of the arch is $8$ meters $10$ meters $12$ meters $14$ meters

A political party orders an arch for the entrance to the ground in which the annual convention is being held. The profile of the arch follows the equation $y=2x-0.1x^{2}$...

3.1k views

gatecse asked Sep 29, 2014

9 votes

3 answers

9

GATE CSE 2012 | Question: 61
Wanted Temporary, Part-time persons for the post of Field Interviewer to conduct personal interviews to collect and collate economic data. Requirements: High School-pass, must be available for Day, Evening and Saturday work. ... inference from the above advertisement? Gender-discriminatory Xenophobic Not designed to make the post attractive Not gender-discriminatory

Wanted Temporary, Part-time persons for the post of Field Interviewer to conduct personal interviews to collect and collate economic data. Requirements: High School-pass,...

3.4k views

gatecse asked Sep 29, 2014

15 votes

1 answer

10

GATE CSE 2012 | Question: 60
Choose the most appropriate alternative from the options given below to complete the following sentence: Suresh’s dog is the one ________ was hurt in the stampede. that which who whom

Choose the most appropriate alternative from the options given below to complete the following sentence:Suresh’s dog is the one ________ was hurt in the stampede.thatwh...

4.9k views

gatecse asked Sep 29, 2014

18 votes

3 answers

11

GATE CSE 2012 | Question: 59
Choose the grammatically INCORRECT sentence: They gave us the money back less the service charges of Three Hundred rupees. This country’s expenditure is not less than that of Bangladesh. The committee initially asked for a funding of Fifty Lakh rupees, but later settled for a lesser sum. This country’s expenditure on educational reforms is very less.

Choose the grammatically INCORRECT sentence:They gave us the money back less the service charges of Three Hundred rupees.This country’s expenditure is not less than tha...

6.4k views

gatecse asked Sep 29, 2014

13 votes

1 answer

12

GATE CSE 2012 | Question: 58
Which one of the following options is the closest in meaning to the word given below? Mitigate Diminish Divulge Dedicate Denote

Which one of the following options is the closest in meaning to the word given below?Mitigate DiminishDivulgeDedicateDenote

2.9k views

gatecse asked Sep 29, 2014

10 votes

2 answers

13

GATE CSE 2012 | Question: 57
Choose the most appropriate alternative from the options given below to complete the following sentence: Despite several _________ the mission succeeded in its attempt to resolve the conflict. attempts setbacks meetings delegations

Choose the most appropriate alternative from the options given below to complete the following sentence:Despite several _________ the mission succeeded in its attempt to ...

3.0k views

gatecse asked Sep 29, 2014

33 votes

2 answers

14

GATE CSE 2012 | Question: 56
The cost function for a product in a firm is given by $5q^{2}$, where $q$ is the amount of production. The firm can sell the product at a market price of $\text₹ 50$ per unit. The number of units to be produced by the firm such that the profit is maximized is $5$ $10$ $15$ $25$

The cost function for a product in a firm is given by $5q^{2}$, where $q$ is the amount of production. The firm can sell the product at a market price of $\text₹ 50$ pe...

5.6k views

gatecse asked Sep 29, 2014

33 votes

2 answers

15

GATE CSE 2012 | Question: 54
A computer has a $256\text{-KByte}$, 4-way set associative, write back data cache with block size of $32\text{-Bytes}$. The processor sends $32\text{-bit}$ ... bit and $1$ replacement bit. The number of bits in the tag field of an address is $11$ $14$ $16$ $27$

A computer has a $256\text{-KByte}$, 4-way set associative, write back data cache with block size of $32\text{-Bytes}$. The processor sends $32\text{-bit}$ addresses to t...

22.1k views

gatecse asked Sep 29, 2014

29 votes

3 answers

16

GATE CSE 2012 | Question: 52
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\varepsilon$ is the empty string, \$ indicates end of input, and, $ ... $ \text{FOLLOW}(A) = \{a, b\} $ $ \text{FOLLOW}(B) =\{a, b\} $

For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\var...

4.9k views

gatecse asked Sep 29, 2014

70 votes

6 answers

17

GATE CSE 2012 | Question: 50
Consider the following relations $A, B$ and $C:$ ... is the same as that of $A$. $(A\cup B)\bowtie _{A.Id > 40 \vee C.Id < 15} C$ $7$ $4$ $5$ $9$

Consider the following relations $A, B$ and $C:$$$\overset{\text{A}}{\begin{array}{|c|c|c|} \hline \text {ID} & \text {Name} & \text {Age} \\\hline\text{12}& \text{Arun}...

29.3k views

gatecse asked Sep 29, 2014

45 votes

4 answers

18

GATE CSE 2012 | Question: 48
Consider the following C code segment. int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf( \n %d %d , a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a += + ... $\begin{array}{lll} 3 & & 1 & \\ 5 & & 2 & \\ 5 & & 2 & \end{array}$

Consider the following C code segment.int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf(“ \n %d %d ”, a, ...

13.9k views

gatecse asked Sep 29, 2014

43 votes

3 answers

19

GATE CSE 2012 | Question: 47
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudo-code below is invoked as height (root) to compute the height of a binary tree rooted at the tree pointer root. int height(treeptr n) { if(n == NULL) return -1 ... ; B2: $\max(h1, h2) $ B1: $(1+ \text{height}(n \to \text{ right}))$ ; B2: $\max(h1, h2)$

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudo-code below is invoked as height (root) to compute...

11.1k views

Arjun asked Sep 29, 2014

68 votes

7 answers

20

GATE CSE 2012 | Question: 46
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $100010$ is not. All strings of length less than $3$ are also in the language. A partially ...

Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $1000...

14.3k views

Arjun asked Sep 29, 2014

74 votes

7 answers

21

GATE CSE 2012 | Question: 45
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the t...

38.4k views

Arjun asked Sep 29, 2014

78 votes

8 answers

22

GATE CSE 2012 | Question: 44
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$

Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and th...

25.6k views

Arjun asked Sep 29, 2014

47 votes

4 answers

23

GATE CSE 2012 | Question: 43
Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a foreign key that refers to $C$ in $R_{2}$. If data in $r_{1}$ and $r_{2}$ satisfy referential ... $\prod_{B}(r_{1}) = \prod _{C}(r_{2})$ $\prod_{B}(r_{1}) - \prod _{C}(r_{2}) \neq \varnothing$

Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a for...

11.2k views

Arjun asked Sep 29, 2014

23 votes

3 answers

24

GATE CSE 2012 | Question: 42
Consider the virtual page reference string $\text{1, 2, 3, 2, 4, 1, 3, 2, 4, 1}$ on a demand paged virtual memory system running on a computer system that has main memory size of $3$ page frames which are initially empty. Let $\text{LRU}$, $\text{FIFO}$ ... $\text{OPTIMAL} < \text{FIFO} < \text{LRU}$ $\text{OPTIMAL} = \text{LRU}$ $\text{OPTIMAL} = \text{FIFO}$

Consider the virtual page reference string$$\text{1, 2, 3, 2, 4, 1, 3, 2, 4, 1}$$on a demand paged virtual memory system running on a computer system that has main memory...

10.3k views

Arjun asked Sep 29, 2014

45 votes

2 answers

25

GATE CSE 2012 | Question: 41
A file system with $300$ GByte disk uses a file descriptor with $8$ direct block addresses, $1$ indirect block address and $1$ doubly indirect block address. The size of each disk block is $128$ Bytes and the size of each disk block address is $8$ Bytes. ... file size in this file system is $3$ KBytes $35$ KBytes $280$ KBytes dependent on the size of the disk

A file system with $300$ GByte disk uses a file descriptor with $8$ direct block addresses, $1$ indirect block address and $1$ doubly indirect block address. The size of ...

21.0k views

Arjun asked Sep 29, 2014

66 votes

9 answers

26

GATE CSE 2012 | Question: 40
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices $S$ and $T$. Which one will be reported by Dijkstra's shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex $v$ is updated only ... a strictly shorter path to $v$ is discovered. $\text{SDT}$ $\text{SBDT}$ $\text{SACDT}$ $\text{SACET}$

Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices $S$ and $T$. Which one will be reported by Dijkstra’s shortest...

26.8k views

gatecse asked Sep 26, 2014

72 votes

14 answers

27

GATE CSE 2012 | Question: 39
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $

A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is$O (n \log...

28.9k views

gatecse asked Sep 26, 2014

41 votes

5 answers

28

GATE CSE 2012 | Question: 37
How many onto (or surjective) functions are there from an $n$-element $(n ≥ 2)$ set to a $2$-element set? $ 2^{n}$ $2^{n} – 1$ $2^{n} – 2$ $2(2^{n} – 2)$

How many onto (or surjective) functions are there from an $n$-element $(n ≥ 2)$ set to a $2$-element set?$ 2^{n}$$2^{n} – 1$$2^{n} – 2$$2(2^{n} – 2)$

9.4k views

gatecse asked Sep 26, 2014

41 votes

4 answers

29

GATE CSE 2012 | Question: 36
Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted. Program main; Var ... Procedure A1; Var ... Call A2; End A1 Procedure A2; Var ... Procedure A21; Var ... Call ... The correct set of activation records along with their access links is given by:

Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted.Program main; Var ... Procedure A1; Var ....

13.0k views

gatecse asked Sep 26, 2014

46 votes

6 answers

30

GATE CSE 2012 | Question: 35
Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, $REAR = FRONT = 0$. The conditions to detect ... : $(REAR+1) \mod n == FRONT$ full: $(FRONT+1) \mod n == REAR$ empty: $REAR == FRONT$

Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out u...

24.2k views

gatecse asked Sep 26, 2014

Page:

1
2
3
next »