Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by khushtak
1
votes
0
answers
1
Gate2017-1-1
1.4k
views
asked
Feb 14, 2017
44
votes
8
answers
2
GATE CSE 2017 Set 1 | Question: 50
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). These stages take 5, 4, 20, 10 and 3 nanoseconds (ns) ... speedup (correct to two decimal places) achieved by EP over NP in executing $20$ independent instructions with no hazards is _________ .
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). T...
19.1k
views
asked
Feb 14, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
pipelining
normal
numerical-answers
+
–
85
votes
11
answers
3
GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.
Consider the C code fragment given below.typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->ne...
25.7k
views
asked
Feb 14, 2017
DS
gatecse-2017-set1
data-structures
linked-list
normal
+
–
25
votes
7
answers
4
GATE CSE 2017 Set 1 | Question: 05
Consider the following table: ... $(P) \leftrightarrow (i), (Q) \leftrightarrow (ii), (R) \leftrightarrow (iii)$
Consider the following table:$$\begin{array}{|l|}\hline \textbf {Algorithms} & \textbf{Design Paradigms } & \\\hline \text{P. Kruskal} & \text{i. Divide and Conquer} \...
7.0k
views
asked
Feb 14, 2017
Algorithms
gatecse-2017-set1
algorithms
algorithm-design-technique
easy
match-the-following
+
–
54
votes
12
answers
5
GATE CSE 2017 Set 1 | Question: 04
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt{n}$, $n$ ... $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
Consider the following functions from positive integers to real numbers:$10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$.The CORRECT arrangement of the above functions...
17.8k
views
asked
Feb 14, 2017
Algorithms
gatecse-2017-set1
algorithms
asymptotic-notation
normal
+
–
73
votes
8
answers
6
GATE CSE 2017 Set 1 | Question: 02
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$? $\exists y(\exists xR(x,y))$ $\exists y(\forall xR(x,y))$ $\forall y(\exists xR(x,y))$ $¬\exists x(\forall y¬R(x,y))$ IV only I and IV only II only II and III only
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$?$\exists y(\ex...
17.3k
views
asked
Feb 14, 2017
Mathematical Logic
gatecse-2017-set1
mathematical-logic
first-order-logic
+
–
30
votes
8
answers
7
GATE CSE 2017 Set 1 | Question: 01
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below? $p \Rightarrow q$ $q \Rightarrow p$ $\left ( ¬q \right ) \vee p$ $\left ( ¬p \right ) \vee q$ I only I and IV only II only II and III only
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below?$p \Rightarrow q$$q \Rightarrow p$$\left ( ...
9.0k
views
asked
Feb 14, 2017
Mathematical Logic
gatecse-2017-set1
mathematical-logic
propositional-logic
easy
+
–
32
votes
4
answers
8
GATE CSE 2017 Set 2 | Question: 42
The next state table of a $2-$ ... $T_1 = Q_1+Q_0, \quad T_0= \bar{Q_1} \bar{Q_0}$ $T_1 = \bar{Q_1}Q_0, \quad T_0= Q_1 + Q_0$
The next state table of a $2-$bit saturating up-counter is given below.$\begin{array}{cc|cc} Q_1 & Q_0 & Q_1^+ & Q_0^+ \\ \hline 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 0 \\ 1 & 0...
11.2k
views
asked
Feb 14, 2017
Digital Logic
gatecse-2017-set2
digital-logic
digital-counter
+
–
39
votes
4
answers
9
GATE CSE 2017 Set 2 | Question: 27
If $w, x, y, z$ are Boolean variables, then which one of the following is INCORRECT? $wx+w(x+y)+x(x +y) = x+wy$ $\overline{w \bar{x}(y+\bar{z})} + \bar{w}x = \bar{w} + x + \bar{y}z$ $(w \bar{x}(y+x\bar{z}) + \bar{w} \bar{x}) y = x \bar{y}$ $(w+y)(wxy+wyz) = wxy+wyz$
If $w, x, y, z$ are Boolean variables, then which one of the following is INCORRECT?$wx+w(x+y)+x(x +y) = x+wy$$\overline{w \bar{x}(y+\bar{z})} + \bar{w}x = \bar{w} + x + ...
10.2k
views
asked
Feb 14, 2017
Digital Logic
gatecse-2017-set2
digital-logic
boolean-algebra
normal
+
–
41
votes
3
answers
10
GATE CSE 2017 Set 2 | Question: 08
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed? Contiguous Linked Indexed $1$ and $3$ only $2$ only $3$ only $2$ and $3$ only
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed?ContiguousLinkedIndexed$1$ and $3$ only$2$ on...
13.1k
views
asked
Feb 14, 2017
Operating System
gatecse-2017-set2
operating-system
file-system
normal
+
–
45
votes
4
answers
11
GATE CSE 2017 Set 2 | Question: 12
Given the following binary number in $32$-bit (single precision) $\text{IEEE-754}$ format : $\large 00111110011011010000000000000000$ The decimal value closest to this floating-point number is : $1.45*10^1$ $1.45*10^{-1}$ $2.27*10^{-1}$ $2.27*10^1$
Given the following binary number in $32$-bit (single precision) $\text{IEEE-754}$ format : $\large 00111110011011010000000000000000$Th...
21.8k
views
asked
Feb 14, 2017
Digital Logic
gatecse-2017-set2
digital-logic
number-representation
floating-point-representation
ieee-representation
+
–
44
votes
3
answers
12
GATE CSE 2017 Set 2 | Question: 20
The maximum number of $\textsf{IPv4}$ router addresses that can be listed in the record route (RR) option field of an $\textsf{IPv4}$ header is______.
The maximum number of $\textsf{IPv4}$ router addresses that can be listed in the record route (RR) option field of an $\textsf{IPv4}$ header is______.
16.5k
views
asked
Feb 14, 2017
Computer Networks
gatecse-2017-set2
computer-networks
ip-addressing
numerical-answers
+
–
37
votes
4
answers
13
GATE CSE 2017 Set 2 | Question: 09
Consider the following statements about the routing protocols. Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) in an $\textsf{IPv4}$ network. RIP uses distance vector routing RIP packets are sent using UDP OSPF packets are sent using TCP OSPF operation ... are CORRECT? I and IV only I, II and III only I, II and IV only II, III and IV only
Consider the following statements about the routing protocols. Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) in an $\textsf{IPv4}$ network.RIP us...
12.4k
views
asked
Feb 14, 2017
Computer Networks
gatecse-2017-set2
computer-networks
routing
+
–
36
votes
6
answers
14
GATE CSE 2017 Set 2 | Question: 21
Consider the set $X=\{a, b, c, d, e\}$ under partial ordering $R=\{(a,a), (a, b), (a, c), (a, d), (a, e), (b, b), (b, c), (b, e), (c, c), (c, e), (d, d), (d, e), (e, e) \}$ The Hasse diagram of the partial order $(X, R)$ is shown below. The minimum number of ordered pairs that need to be added to $R$ to make $(X, R)$ a lattice is ______
Consider the set $X=\{a, b, c, d, e\}$ under partial ordering $R=\{(a,a), (a, b), (a, c), (a, d), (a, e), (b, b), (b, c), (b, e), (c, c), (c, e), (d, d), (d, e), (e, e...
11.9k
views
asked
Feb 14, 2017
Set Theory & Algebra
gatecse-2017-set2
set-theory&algebra
lattice
numerical-answers
normal
+
–
33
votes
11
answers
15
GATE CSE 2017 Set 2 | Question: 16
Identify the language generated by the following grammar, where $S$ is the start variable. $ S \rightarrow XY$ $ X \rightarrow aX \mid a$ $ Y \rightarrow aYb \mid \epsilon$ $\{a^mb^n \mid m \geq n, n > 0 \}$ $ \{ a^mb^n \mid m \geq n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n > 0 \}$
Identify the language generated by the following grammar, where $S$ is the start variable.$ S \rightarrow XY$$ X \rightarrow aX \mid a$$ Y \rightarrow aYb \mid \epsilon$$...
18.4k
views
asked
Feb 14, 2017
Theory of Computation
gatecse-2017-set2
theory-of-computation
context-free-language
+
–
39
votes
5
answers
16
GATE CSE 2017 Set 2 | Question: 24
Consider the quadratic equation $x^2-13x+36=0$ with coefficients in a base $b$. The solutions of this equation in the same base $b$ are $x=5$ and $x=6$. Then $b=$ _____
Consider the quadratic equation $x^2-13x+36=0$ with coefficients in a base $b$. The solutions of this equation in the same base $b$ are $x=5$ and $x=6$. Then $b=$ _____
14.4k
views
asked
Feb 14, 2017
Set Theory & Algebra
gatecse-2017-set2
polynomials
numerical-answers
set-theory&algebra
+
–
26
votes
3
answers
17
GATE CSE 2017 Set 2 | Question: 2
Match the following: ... ; R-i; S-iii P-ii; Q-i; R-iv; S-iii P-ii; Q-iv; R-iii; S-i P-iii; Q-iv; R-i; S-ii
Match the following:$$\begin{array}{|ll|ll|}\hline P. & \text{static char var ;} & \text{i.} & \text{Sequence of memory locations to store addresses} \\\hline Q. & \text...
5.8k
views
asked
Feb 14, 2017
Programming in C
gatecse-2017-set2
programming
programming-in-c
match-the-following
+
–
25
votes
7
answers
18
GATE CSE 2017 Set 2 | Question: 03
Match the algorithms with their time complexities: ... $P\rightarrow (iv) \quad Q \rightarrow(iii)\quad r \rightarrow(ii) \quad S\rightarrow(i)$
Match the algorithms with their time complexities:$$\begin{array}{|l|l|}\hline \textbf{Algorithms} & \textbf{Time Complexity} \\\hline \text{P. Tower of Hanoi with $n$...
6.9k
views
asked
Feb 14, 2017
Algorithms
gatecse-2017-set2
algorithms
time-complexity
match-the-following
easy
+
–
57
votes
10
answers
19
GATE CSE 2017 Set 2 | Question: 11
Let $p, q, r$ ... $(\neg p \wedge r) \vee (r \rightarrow (p \wedge q))$
Let $p, q, r$ denote the statements ”It is raining”, “It is cold”, and “It is pleasant”, respectively. Then the statement “It is not raining and it is pleas...
12.2k
views
asked
Feb 14, 2017
Mathematical Logic
gatecse-2017-set2
mathematical-logic
propositional-logic
+
–
41
votes
6
answers
20
GATE CSE 2017 Set 2 | Question: 04
Let $L_1, L_2$ be any two context-free languages and $R$ be any regular language. Then which of the following is/are CORRECT? $L_1 \cup L_2$ is context-free $\overline{L_1}$ is context-free $L_1 - R$ is context-free $L_1 \cap L_2$ is context-free I, II and IV only I and III only II and IV only I only
Let $L_1, L_2$ be any two context-free languages and $R$ be any regular language. Then which of the following is/are CORRECT?$L_1 \cup L_2$ is context-free$\overline{L_1}...
11.7k
views
asked
Feb 14, 2017
Theory of Computation
gatecse-2017-set2
theory-of-computation
closure-property
+
–
Page:
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register