Register

Recent questions tagged gatecse-2011

29 votes
2 answers
32
GATE CSE 2011 | Question: 35
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$ ... of processes. What is the average waiting time for the three processes? $5.0$ ms $4.33$ ms $6.33$ ms $7.33$ ms
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$$$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arriva...
User Avatar
25 votes
7 answers
36
GATE CSE 2011 | Question: 31
Given $i = \sqrt{-1}$, what will be the evaluation of the definite integral $\int \limits_0^{\pi/2} \dfrac{\cos x +i \sin x} {\cos x - i \sin x} dx$ ? $0$ $2$ $-i$ $i$
Given $i = \sqrt{-1}$, what will be the evaluation of the definite integral $\int \limits_0^{\pi/2} \dfrac{\cos x +i \sin x} {\cos x - i \sin x} dx$ ?$0$$2$$-i$$i$
User Avatar
56 votes
6 answers
37
GATE CSE 2011 | Question: 30
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$ ... always true irrespective of the value of $x$ $P(x)$ being true means that $x$ has exactly two factors other than $1$ and $x$
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$, and a predicate$$P\left(x\right) = \neg \left(x=1\right)\wedge \forall y \left...
User Avatar
48 votes
9 answers
38
GATE CSE 2011 | Question: 29
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a...
User Avatar
36 votes
4 answers
41
GATE CSE 2011 | Question: 26
Consider the languages $L1, \:L2 \:and \: L3$ ... Automata (PDA) can be used to recognize $L1$ and $L2$ $L1$ is a regular language All the three languages are context free Turing machines can be used to recognize all the languages
Consider the languages $L1, \:L2 \:and \: L3$ as given below.$L1=\{0^p 1^q \mid p, q \in N\}, \\ L2 = \{0^p 1^q \mid p, q \in N \:and \:p=q\} \: and, \\ L3 = \{0^p 1^q 0^...
User Avatar
23 votes
2 answers
43
GATE CSE 2011 | Question: 23
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?
User Avatar
43 votes
2 answers
44
GATE CSE 2011 | Question: 22
What does the following fragment of C program print? char c[] = "GATE2011"; char *p = c; printf("%s", p + p[3] - p[1]); $\text{GATE2011}$ $\text{E2011}$ $2011$ $011$
What does the following fragment of C program print?char c[] = "GATE2011"; char *p = c; printf("%s", p + p[3] - p );$\text{GATE2011}$$\text{E2011}$$2011$$011$
User Avatar
17 votes
2 answers
49
GATE CSE 2011 | Question: 17
K4 and Q3 are graphs with the following structures. Which one of the following statements is TRUE in relation to these graphs? K4 is a planar while Q3 is not Both K4 and Q3 are planar Q3 is planar while K4 is not Neither K4 nor Q3 is planar
K4 and Q3 are graphs with the following structures.Which one of the following statements is TRUE in relation to these graphs?K4 is a planar while Q3 is notBoth K4 and Q3 ...
User Avatar
27 votes
6 answers
51
GATE CSE 2011 | Question: 15
The minimum number of $\text{D}$ flip-flops needed to design a mod-258 counter is 9 8 512 258
The minimum number of $\text{D}$ flip-flops needed to design a mod-258 counter is98512258
User Avatar
24 votes
7 answers
52
GATE CSE 2011 | Question: 14
The simplified SOP (Sum of Product) from the Boolean expression $(P + \bar{Q} + \bar{R}) . (P + \bar{Q} + R) . (P + Q +\bar{R})$ is $(\bar{P}.Q+\bar{R})$ $(P+\bar{Q}.\bar{R})$ $(\bar{P}.Q+R)$ $(P.Q+R)$
The simplified SOP (Sum of Product) from the Boolean expression$$(P + \bar{Q} + \bar{R}) . (P + \bar{Q} + R) . (P + Q +\bar{R})$$ is $(\bar{P}.Q+\bar{R})$$(P+\bar{Q}.\bar...
User Avatar
22 votes
2 answers
53
GATE CSE 2011 | Question: 13
Which one of the following circuits is NOT equivalent to a $2$-input $XNOR$ (exclusive $NOR$) gate?
Which one of the following circuits is NOT equivalent to a $2$-input $XNOR$ (exclusive $NOR$) gate?
User Avatar
Page: