Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Highest voted questions
86
votes
5
answers
81
GATE CSE 2003 | Question: 67
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows. $w(e) = \begin{cases} 0 \text{, if } e \in E_1 \\1 \text{, otherwise} \end{cases}$ A single-source shortest path ... edges in the shortest paths from $v_1$ to all vertices of $G$ $G_1$ is connected $V_1$ forms a clique in $G$ $G_1$ is a tree
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows.$$w(e) = \begin{cases} 0 \text{, if } e \in E_...
Kathleen
19.9k
views
Kathleen
asked
Sep 17, 2014
Algorithms
gatecse-2003
algorithms
graph-algorithms
normal
+
–
85
votes
11
answers
82
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...
khushtak
25.4k
views
khushtak
asked
Feb 14, 2017
DS
gatecse-2017-set1
data-structures
linked-list
normal
+
–
85
votes
18
answers
83
GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight s...
Sandeep Singh
35.1k
views
Sandeep Singh
asked
Feb 12, 2016
Algorithms
gatecse-2016-set1
algorithms
spanning-tree
normal
numerical-answers
+
–
85
votes
9
answers
84
GATE CSE 2016 Set 1 | Question: 33
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is $\Theta (1)$ $\Theta (\log(n))$ $\Theta (\sqrt{n})$ $\Theta (n)$)
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is$\Theta (1)$$\...
Sandeep Singh
30.8k
views
Sandeep Singh
asked
Feb 12, 2016
Digital Logic
gatecse-2016-set1
digital-logic
adder
normal
+
–
85
votes
8
answers
85
GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. ...
Akash Kanase
16.4k
views
Akash Kanase
asked
Feb 12, 2016
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
difficult
set-theory
+
–
85
votes
6
answers
86
GATE IT 2006 | Question: 50
Which one of the choices given below would be printed when the following program is executed? #include <stdio.h> void swap (int *x, int *y) { static int *temp; temp = x; x = y; y = temp; } void printab () { static int i, a = -3, b = -6; i = 0; while (i <= 4) { if ((i++)%2 == 1 ... $a = 12, b = 9$ $a = 3, b = 6$ $a = 3, b = 6$ $a = 6, b = 3$ $a = 15, b = 12$
Which one of the choices given below would be printed when the following program is executed?#include <stdio.h void swap (int *x, int *y) { static int *temp; temp = x; x ...
Ishrat Jahan
25.3k
views
Ishrat Jahan
asked
Oct 31, 2014
Programming in C
gateit-2006
programming
programming-in-c
normal
parameter-passing
+
–
85
votes
6
answers
87
GATE CSE 2006 | Question: 67
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank $1.$ Ties are not broke but ranks are skipped: if ... of the above statements are correct? $2$ and $5$ $1$ and $3$ $1$ and $4$ $3$ and $5$
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasin...
Rucha Shelke
20.9k
views
Rucha Shelke
asked
Sep 26, 2014
Databases
gatecse-2006
databases
sql
normal
+
–
85
votes
16
answers
88
GATE CSE 2012 | Question: 33
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of values that turn up is at least $6$ ? $\dfrac{10}{21}$ $\dfrac{5}{12}$ $\dfrac{2}{3}$ $\dfrac{1}{6}$
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of val...
gatecse
21.8k
views
gatecse
asked
Sep 26, 2014
Probability
gatecse-2012
probability
conditional-probability
normal
+
–
85
votes
6
answers
89
GATE CSE 1998 | Question: 2.19
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is incorrect? R1 and R2 are relations, C1 and C2 are selection conditions and A1 and A2 are attributes of R1. ... $\pi_{A_1} \left(\sigma_{C_1}\left(R_1\right)\right) \to \sigma_{C_1} \left(\pi_{A_1}\left(R_1\right)\right)$
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is incorrect? R1 and R2 are relations, C1 and C2 are selectio...
Kathleen
17.1k
views
Kathleen
asked
Sep 25, 2014
Databases
gate1998
databases
relational-calculus
normal
+
–
84
votes
6
answers
90
GATE CSE 2017 Set 1 | Question: 31
Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements. One eigenvalue must be in $\left [ -5,5 \right ]$ The eigenvalue ... than $5$ Which of the above statements about eigenvalues of $A$ is/are necessarily CORRECT? Both I and II I only II only Neither I nor II
Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements.One eigenvalu...
Arjun
45.5k
views
Arjun
asked
Feb 14, 2017
Linear Algebra
gatecse-2017-set1
linear-algebra
eigen-value
normal
+
–
83
votes
4
answers
91
GATE CSE 2017 Set 1 | Question: 42
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions $T_{1}$ and $T_{2}$ ... -free. The database system is starvation-free, but not deadlock-free. The database system is neither deadlock-free nor starvation-free.
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions ...
Arjun
26.7k
views
Arjun
asked
Feb 14, 2017
Databases
gatecse-2017-set1
databases
timestamp-ordering
deadlock-prevention-avoidance-detection
normal
+
–
83
votes
6
answers
92
GATE CSE 2003 | Question: 79
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical...
go_editor
23.7k
views
go_editor
asked
Apr 24, 2016
Operating System
gatecse-2003
operating-system
normal
virtual-memory
+
–
83
votes
4
answers
93
GATE CSE 2015 Set 1 | Question: 51
Consider the NPDA ... follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
Consider the NPDA $$ \left \langle Q= \left \{ q_{0}, q_{1}, q_{2} \right \},\Sigma = \left \{ 0, 1 \right \}, \Gamma = \left \{ 0, 1, \perp \right \}, \delta, q_{0}, \p...
makhdoom ghaya
23.5k
views
makhdoom ghaya
asked
Feb 13, 2015
Theory of Computation
gatecse-2015-set1
theory-of-computation
pushdown-automata
normal
+
–
83
votes
13
answers
94
GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilo...
Arjun
32.9k
views
Arjun
asked
Sep 23, 2014
Compiler Design
gatecse-2013
compiler-design
parsing
normal
+
–
83
votes
8
answers
95
GATE CSE 2006 | Question: 29
If $s$ is a string over $(0+1)^*$ then let $n_0(s)$ denote the number of $0$'s in $s$ and $n_1(s)$ the number of $1$'s in $s$. Which one of the following languages is not regular? $L=\left \{ s\in (0+1)^* \mid n_{0}(s) \text{ is a 3-digit prime } \right \}$ ... $L=\left \{ s\in (0+1)^*\mid n_{0}(s) \mod 7=n_{1}(s) \mod 5=0 \right \}$
If $s$ is a string over $(0+1)^*$ then let $n_0(s)$ denote the number of $0$’s in $s$ and $n_1(s)$ the number of $1$’s in $s$. Which one of the following languages i...
Rucha Shelke
19.4k
views
Rucha Shelke
asked
Sep 18, 2014
Theory of Computation
gatecse-2006
theory-of-computation
normal
regular-language
+
–
82
votes
12
answers
96
GATE CSE 2014 Set 1 | Question: 27
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size used is $2$ KB. The time taken (in msec) by the TCP connection to get back to $32$ KB congestion window is _________.
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size u...
go_editor
37.5k
views
go_editor
asked
Sep 26, 2014
Computer Networks
gatecse-2014-set1
computer-networks
tcp
congestion-control
numerical-answers
normal
+
–
81
votes
4
answers
97
GATE CSE 2015 Set 2 | Question: 44
Consider the sequence of machine instruction given below: ... forwarding from the PO stage to the OF stage. The number of clock cycles taken for the execution of the above sequence of instruction is _________.
Consider the sequence of machine instruction given below:$$\begin{array}{ll} \text{MUL} & \text{R5, R0, R1} \\ \text{DIV} & \text{R6, R2, R3} \\ \text{ADD} & \text{R7,...
go_editor
26.2k
views
go_editor
asked
Feb 12, 2015
CO and Architecture
gatecse-2015-set2
co-and-architecture
pipelining
normal
numerical-answers
+
–
81
votes
6
answers
98
GATE CSE 2014 Set 2 | Question: 54
SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below: select * from R where a in (select S.a from S) select R. ... a from S) as S1 where R.a=S1.a select R.* from R,S where R.a=S.a and is unique R
SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives t...
go_editor
19.3k
views
go_editor
asked
Sep 28, 2014
Databases
gatecse-2014-set2
databases
sql
normal
+
–
81
votes
5
answers
99
GATE CSE 2014 Set 2 | Question: 43
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block ... size implies a larger cache tag and hence lower cache hit time A smaller block size incurs a lower cache miss penalty
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context?A...
go_editor
20.8k
views
go_editor
asked
Sep 28, 2014
CO and Architecture
gatecse-2014-set2
co-and-architecture
cache-memory
normal
+
–
81
votes
6
answers
100
GATE CSE 2003 | Question: 6
Let $T(n)$ be the number of different binary search trees on $n$ distinct elements. Then $T(n) = \sum_{k=1}^{n} T(k-1)T(x)$, where $x$ is $n-k+1$ $n-k$ $n-k-1$ $n-k-2$
Let $T(n)$ be the number of different binary search trees on $n$ distinct elements.Then $T(n) = \sum_{k=1}^{n} T(k-1)T(x)$, where $x$ is $n-k+1$$n-k$$n-k-1$$n-k-2$
Kathleen
22.3k
views
Kathleen
asked
Sep 16, 2014
DS
gatecse-2003
normal
binary-search-tree
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
3215
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register