Register

Recent questions tagged gatecse-2012

47 votes
6 answers
34
GATE CSE 2012 | Question: 31
Consider the $3$ processes, $P1, P2$ and $P3$ ... $P1, P3, P2$ FCFS: $P1, P2, P3$ RR2: $P1, P3, P2$ FCFS: $P1, P3, P2$ RR2: $P1, P2, P3$
Consider the $3$ processes, $P1, P2$ and $P3$ shown in the table. $$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time} & \textbf{Time Units Req...
User Avatar
25 votes
5 answers
35
GATE CSE 2012 | Question: 30
What is the minimal form of the Karnaugh map shown below? Assume that $X$ denotes a don’t care term $\bar{b} \bar{d}$ $ \bar { b } \bar { d } + \bar{b} \bar{c} $ $ \bar{b} \bar{d} + {a} \bar{b} \bar{c} {d}$ $ \bar{b} \bar{d} + \bar{b} \bar{c} + \bar{c} \bar{d} $
What is the minimal form of the Karnaugh map shown below? Assume that $X$ denotes a don’t care term $\bar{b} \bar{d}$$ \bar { b } \bar { d } + \bar{b} \bar{c} $$ \bar{b...
User Avatar
7 votes
1 answer
36
GATE CSE 2012 | Question: 28
The bisection method is applied to compute a zero of the function $f(x) =x ^{4} – x ^{3} – x ^{2} – 4$ in the interval [1,9]. The method converges to a solution after ––––– iterations. (A) 1 (B) 3 (C) 5 (D) 7
The bisection method is applied to compute a zero of the function $f(x) =x ^{4} – x ^{3} – x ^{2} – 4$ in the interval [1,9]. The method converges to a solution aft...
User Avatar
29 votes
4 answers
38
GATE CSE 2012 | Question: 26
Which of the following graphs is isomorphic to
Which of the following graphs is isomorphic to
User Avatar
24 votes
4 answers
39
GATE CSE 2012 | Question: 25
Given the language $L = \left\{ab, aa, baa\right\}$, which of the following strings are in $L^{*}$? $ abaabaaabaa$ $ aaaabaaaa$ $ baaaaabaaaab$ $ baaaaabaa$ $\text{1, 2 and 3}$ $\text{2, 3 and 4}$ $\text{1, 2 and 4}$ $\text{1, 3 and 4}$
Given the language $L = \left\{ab, aa, baa\right\}$, which of the following strings are in $L^{*}$?$ abaabaaabaa$$ aaaabaaaa$$ baaaaabaaaab$$ baaaaabaa$$\text{1, 2 and 3}...
User Avatar
34 votes
1 answer
41
GATE CSE 2012 | Question: 23
In the IPv4 addressing format, the number of networks allowed under Class $C$ addresses is: $2^{14}$ $2^{7}$ $2^{21}$ $2^{24}$
In the IPv4 addressing format, the number of networks allowed under Class $C$ addresses is:$2^{14}$$2^{7}$$2^{21}$$2^{24}$
User Avatar
29 votes
4 answers
42
GATE CSE 2012 | Question: 22
Which of the following transport layer protocols is used to support electronic mail? $\textsf{SMTP}$ $\textsf{IP}$ $\textsf{TCP}$ $\textsf{UDP}$
Which of the following transport layer protocols is used to support electronic mail?$\textsf{SMTP}$$\textsf{IP}$$\textsf{TCP}$$\textsf{UDP}$
User Avatar
41 votes
4 answers
43
GATE CSE 2012 | Question: 21
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and ...
User Avatar
113 votes
9 answers
45
GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
User Avatar
43 votes
3 answers
47
GATE CSE 2012 | Question: 19
The amount of ROM needed to implement a $4\text{-bit}$ multiplier is $64$ bits $128$ bits $1$ Kbits $2$ Kbits
The amount of ROM needed to implement a $4\text{-bit}$ multiplier is$64$ bits$128$ bits$1$ Kbits$2$ Kbits
User Avatar
26 votes
3 answers
49
GATE CSE 2012 | Question: 17
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the plane is equal to $3$ $4$ $5$ $6$
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the...
User Avatar
35 votes
3 answers
50
GATE CSE 2012 | Question: 16
The recurrence relation capturing the optimal execution time of the $Towers \ of \ Hanoi$ problem with $n$ discs is $T(n) = 2T(n − 2) + 2$ $T (n) = 2T(n − 1) + n$ $T (n) = 2T(n/2) + 1$ $T (n) = 2T(n − 1) + 1$
The recurrence relation capturing the optimal execution time of the $Towers \ of \ Hanoi$ problem with $n$ discs is$T(n) = 2T(n − 2) + 2$$T (n) = 2T(n − 1) + n$$T (...
User Avatar
71 votes
14 answers
54
GATE CSE 2012 | Question: 12
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$
What is the complement of the language accepted by the NFA shown below?Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string.$\phi$$\{\epsilon\}$$a^*$$\{a , \epsilon...
User Avatar
44 votes
10 answers
56
GATE CSE 2012 | Question: 10
The protocol data unit (PDU) for the application layer in the Internet stack is: Segment Datagram Message Frame
The protocol data unit (PDU) for the application layer in the Internet stack is:SegmentDatagramMessageFrame
User Avatar
34 votes
4 answers
58
GATE CSE 2012 | Question: 8
A process executes the code fork(); fork(); fork(); The total number of child processes created is $3$ $4$ $7$ $8$
A process executes the codefork(); fork(); fork();The total number of child processes created is$3$$4$$7$$8$
User Avatar
Page: