Register

Recent questions tagged gatecse-2012

10.5k
views
4 answers
46 votes
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) ...
User Avatar
14.2k
views
4 answers
49 votes
GATE CSE 2012 | Question: 51
Consider the following relations $A, B$ and $C:$ ... $3$0$1$
User Avatar
18.1k
views
3 answers
42 votes
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,$ ... $ E3 : B \rightarrow S$
User Avatar
12.7k
views
4 answers
32 votes
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}$ ... $ $\text{Kbits}$136$ $\text{Kbits}$40$ $\text{Kbits}$32$ $\text{Kbits}$
User Avatar
2.8k
views
4 answers
9 votes
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}$
User Avatar
6.2k
views
2 answers
18 votes
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 ... $, $Q$Q$, $R$P$, $R$R$, $S$
User Avatar
5.3k
views
1 answers
23 votes
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 ... $ is$0.288$0.334$0.667$0.720$
User Avatar
3.2k
views
2 answers
12 votes
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 ... height of the arch is $8$ meters$10$ meters$12$ meters$14$ meters
User Avatar
3.5k
views
3 answers
10 votes
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 ... ?Gender-discriminatoryXenophobicNot designed to make the post attractiveNot gender-discriminatory
User Avatar
5.0k
views
1 answers
15 votes
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.thatwhichwhowhom
User Avatar
6.6k
views
3 answers
18 votes
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 ... a lesser sum.This country's expenditure on educational reforms is very less.
User Avatar
3.0k
views
1 answers
13 votes
GATE CSE 2012 | Question: 58
Which one of the following options is the closest in meaning to the word given below?Mitigate DiminishDivulgeDedicateDenote
User Avatar
3.1k
views
2 answers
11 votes
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.attemptssetbacksmeetingsdelegations
User Avatar
5.8k
views
2 answers
33 votes
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 ... $10$15$25$
User Avatar
22.8k
views
2 answers
33 votes
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}$ ... $14$16$27$
User Avatar
5.1k
views
3 answers
29 votes
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 ... {FOLLOW}(A) = \{a, b\} $ \text{FOLLOW}(B) =\{a, b\} $
User Avatar
30.0k
views
6 answers
71 votes
GATE CSE 2012 | Question: 50
Consider the following relations $A, B$ and $C:$ ... $.$(A\cup B)\bowtie _{A.Id > 40 \vee C.Id < 15} C$$7$4$5$9$
User Avatar
14.2k
views
4 answers
45 votes
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 ...
User Avatar
11.8k
views
3 answers
44 votes
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 ... $\max(h1, h2)$
User Avatar
14.7k
views
7 answers
68 votes
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$ ...
User Avatar
40.4k
views
7 answers
74 votes
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 ... end of the tenth transmission.$8$ MSS$14$ MSS$7$ MSS$12$ MSS
User Avatar
27.0k
views
8 answers
79 votes
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})$ ... $?$\text{1005 ms}$\text{1010 ms}$\text{3000 ms}$\text{3003 ms}$
User Avatar
11.7k
views
4 answers
47 votes
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 ... {C}(r_{2})$\prod_{B}(r_{1}) - \prod _{C}(r_{2}) \neq \varnothing$
User Avatar
10.7k
views
3 answers
23 votes
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 ... $\text{OPTIMAL} = \text{FIFO}$
User Avatar
21.5k
views
2 answers
46 votes
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. ... system is$3$ KBytes$35$ KBytes$280$ KBytesdependent on the size of the disk
User Avatar
27.5k
views
9 answers
66 votes
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 ... $\text{SDT}$ $\text{SBDT}$ $\text{SACDT}$ $\text{SACET}$
User Avatar
29.5k
views
14 answers
72 votes
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}) $
User Avatar
9.7k
views
5 answers
43 votes
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)$
User Avatar
13.4k
views
4 answers
41 votes
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 ... set of activation records along with their access links is given by:
User Avatar
24.6k
views
6 answers
46 votes
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 ... full: $(FRONT+1) \mod n == REAR$empty: $REAR == FRONT$
User Avatar
Page: