The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Kaluti
User Kaluti
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kaluti
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
GATE200370
Let $G= (V,E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is a sequence of vertices ($v_{i},v_{i+1}, \dots , v_j$) such that $(v_k, v_{k+1}) \in E$ for all $k$ in $i$ through $j1$. A simple path is a path in which no ... path length from $j$ to $k$ If there exists a path from $j$ to $k$, every simple path from $j$ to $k$ contains at most $A[j,k]$ edges
commented
Dec 11, 2019
in
Algorithms

4.9k
views
gate2003
algorithms
graphalgorithms
normal
3
answers
2
TIFR2013B5
Given a weighted directed graph with $n$ vertices where edge weights are integers (positive, zero, or negative), determining whether there are paths of arbitrarily large weight can be performed in time $O(n)$ $O(n . \log(n))$ but not $O (n)$ $O(n^{1.5})$ but not $O (n \log n)$ $O(n^{3})$ but not $O(n^{1.5})$ $O(2^{n})$ but not $O(n^{3})$
commented
Dec 11, 2019
in
Algorithms

1.3k
views
tifr2013
algorithms
graphalgorithms
1
answer
3
master theorem
T(n)=4T(n/2)+n/logn this can be solved by master theorem but why t(n)=2t(n/2)+n/logn can't be solved by master theorem ?
commented
Dec 6, 2019
in
Algorithms

807
views
4
answers
4
TIFR2012B4
Let $\wedge $, $\vee $ denote the meet and join operations of lattice. A lattice is called distributive if for all $x, y, z,$ ... lattice. Modular, but not distributive lattice. Distributive lattice. Lattice but not a complete lattice. Under the give ordering positive integers do not form a lattice.
commented
Dec 5, 2019
in
Set Theory & Algebra

1.3k
views
tifr2012
settheory&algebra
lattice
5
answers
5
GATE2005IT38
Let $P$ be a nondeterministic pushdown automaton (NPDA) with exactly one state, $q$, and exactly one symbol, $Z$, in its stack alphabet. State $q$ is both the starting as well as the accepting state of the PDA. The stack is initialized with one $Z$ before the start of the operation ... $L(P)$ and $N(P)$ are necessarily $Σ^*$. Neither $L(P)$ nor $N(P)$ are necessarily $Σ^*$
commented
Dec 1, 2019
in
Theory of Computation

3.6k
views
gate2005it
theoryofcomputation
pushdownautomata
normal
4
answers
6
The intersection of a context free language and a regular language
The intersection of a context free language and a regular language a)need not be regular b)need not be context free c) is always regular d) is always context free
commented
Dec 1, 2019
in
Theory of Computation

1.4k
views
4
answers
7
GATE200727
Consider the set of (column) vectors defined by$X = \left \{x \in R^3 \mid x_1 + x_2 + x_3 = 0, \text{ where } x^T = \left[x_1,x_2,x_3\right]^T\right \}$ ... a linearly independent set, but it does not span $X$ and therefore is not a basis of $X$. $X$ is not a subspace of $R^3$. None of the above
commented
Jun 22, 2019
in
Linear Algebra

3.7k
views
gate2007
linearalgebra
normal
vectorspace
3
answers
8
GATE2004IT32
Let $A$ be an $n \times n$ ...
commented
Jun 6, 2019
in
Linear Algebra

2.3k
views
gate2004it
linearalgebra
matrices
normal
6
answers
9
GATE2007IT2
Let $A$ be the matrix $\begin{bmatrix}3 &1 \\ 1&2\end{bmatrix}$. What is the maximum value of $x^TAx$ where the maximum is taken over all $x$ that are the unit eigenvectors of $A?$ $5$ $\frac{(5 + √5)}{2}$ $3$ $\frac{(5  √5)}{2}$
commented
Jun 5, 2019
in
Linear Algebra

3.8k
views
gate2007it
linearalgebra
eigenvalue
normal
7
answers
10
GATE2014247
The product of the nonzero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
commented
Jun 5, 2019
in
Linear Algebra

10.9k
views
gate20142
linearalgebra
eigenvalue
normal
numericalanswers
3
answers
11
GATE2016204
Consider the system, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a solution. Which one of the ... is CORRECT? $I, II$ and $III$ are true. Only $II$ and $III$ are true. Only $III$ is true. None of them is true.
commented
Jun 5, 2019
in
Linear Algebra

4.5k
views
gate20162
linearalgebra
systemofequations
normal
1
answer
12
GATE199103,xiv
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following is the strongest correct statement about a finite language over some finite alphabet $\Sigma$ ? It could be undecidable It is Turingmachine recognizable It is a context sensitive language. It is a regular language. None of the above,
commented
May 29, 2019
in
Theory of Computation

1.5k
views
gate1991
theoryofcomputation
easy
regularlanguages
0
answers
13
ACE Test Series: Programming in C
What will be output of the program? int d=0; int f(int a,int b){ int c; d++; if(b==3) return a*a*a; else{ c=f(a,b/3); return(c*c*c); } } int main(){ printf("%d",f(4,81)); return 0; }
commented
May 23, 2019
in
Programming

172
views
programminginc
1
answer
14
Max heap
Conversion of binary search tree into a Max heap takes: O(n) time O(nlog n) time None
commented
May 23, 2019
in
Programming

63
views
2
answers
15
PGEE 2019
for(int i=0; i<=100;i++) { if (i % 3 == 0) printf("Great); if(i%5 == 0) printf("India"); } Count the number of times GreatIndia is printed. 6 20 33 none of these
commented
May 23, 2019
in
Programming

277
views
iiithpgee
loop
counting
programming
0
answers
16
ACE test Series: Programming and DSProgramming
void find(int x){ static int i=10,y=0; y=y+i; for(i;i>0;i=i10){ if(x!=0) find(x1); else{ printf("%d",y); } } } What will be output printed for find(4)?
commented
May 23, 2019
in
Programming

146
views
programminginc
acetestseries
programming
1
answer
17
Programming doubt(ACE)
void print(int i){ static int x=4; if(i!=0){ print(x); } printf("%d",x); } What will be output printed for print(10)? Will it print value as call by value or call by reference?
commented
May 23, 2019
in
Programming

110
views
programminginc
output
programming
1
answer
18
Made Easy Test Series:Programming
Consider the following C program #include<stdio.h> int main(){ char *arr={"GATE","CAT","IES","IAS","PSU","IFS"}; call(arr); return 0; } void call(char **ptr){ char **ptr1; ptr1=(ptr+=(sizeof(int)))2; printf("%s",*ptr1); } Assume size of int pointer 4B.What will be output?
commented
May 22, 2019
in
Programming

120
views
madeeasytestseries
programming
1
answer
19
Made Easy Test Series:DS
I want longest path from root to leaf. Then which code is correct among Code1 or Code2? Code1) int tree(Struct node *root){ int a=0, b=0,c=0; if(root==NULL) return 0; if((root>left==NULL)&&(root>right==NULL)) return 1; a=1+tree(root ... )&&(root>right==NULL)) return 1; a=tree(root>left); b=tree(root>right); c=1+max(a,b); return c; }
answered
May 22, 2019
in
DS

76
views
madeeasytestseries
datastructures
1
answer
20
IIIT PGEE 2019
Which of the following gives O(1) complexity if we want to check whether an edge exists between two given nodes in a graph? Adjacency List Adjacency Matrix Incidence Matrix None of these
commented
May 22, 2019
in
DS

153
views
iiithpgee
graphtheory
timecomplexity
2
answers
21
Made Easy Test Series:Programming Test
Consider the following function $foo()$ void foo(int n){ if(n<=0) printf("Bye"); else{ printf("Hi"); foo(n3); printf("Hi"); foo(n1); } } Let $P(n)$ represent recurrence relation, indicating number of ... $1$ or $2?$
commented
May 22, 2019
in
Programming

159
views
madeeasytestseries
programming
programminginc
1
answer
22
Made Easy Test Series: ProgrammingRecursive and Iterative Program
$I=$Iterative Program $R=$ Recursive Program $(A)$ For every program belonging to class $I$, there is an equivalent program to class $R.$ $(B)$ Every program in $R$ uses strictly more stack space compared to equivalent program in $I.$ Among $(A)$ and $(B)$ which one is correct?
answered
May 22, 2019
in
Programming

28
views
madeeasytestseries
datastructures
1
answer
23
Made Easy Test Series:Binary Tree
Consider the following function with a binary tree with atleast one node: int path(struct node *x, int len){ if(x==NULL) return B; else return A; } Assume the above function is used to check the given binary tree has any path with specified length from root to ... $B$ is $(len== 1)$ which of these two option correct? Please Explain.
commented
May 22, 2019
in
DS

116
views
madeeasytestseries
datastructures
1
answer
24
Made Easy Test Series: Data Structure
$A)$ Rotation operation of AVL tree always preserves the inorder numbering. $B)$ If every node of BST has either $0$ or $2$ children , then searching time is $O(log n)$ Which statement is correct? Given $A)$ is correct but $B)$ is not. Plz explain how?
commented
May 22, 2019
in
DS

57
views
datastructures
madeeasytestseries
3
answers
25
Made Easy Test Series: DSHash Table
Consider a hash table with $N$ slots. It is given that the collision resolution technique used in chaining. Assume simple uniform hashing, what is the probability that the last $k$ slots are unfilled after the first $'r'$ insertions? $A)\left ( 1\frac{N}{k} \right )^{r}$ ... $C)\left ( 1+\frac{N}{k} \right )^{r1}$ $D)\left ( 1\frac{k}{N} \right )^{r1}$
commented
May 21, 2019
in
DS

165
views
datastructures
madeeasytestseries
hashing
1
answer
26
Self Doubt on Linked List
Can somebody write the code or algorithm, how merge sort works efficiently in linked list? Is Heap sort most inefficient in Linked List Sorting? Elaborate plz
commented
May 21, 2019
in
DS

61
views
linkedlists
datastructures
1
answer
27
IIIT PGEE 2019
What is the time complexity to delete an arbitrary node from binary heap? O(n) O(log n) O(1) O(n log n)
commented
May 21, 2019
in
Programming

170
views
iiithpgee
timecomplexity
binaryheap
1
answer
28
Made Easy Test Series:Programming in C
Consider the following $C$ implementation which when given $3$ numbers a,b,c as input, find the maximum of $3$ numbers $a,b,c.$ int kickstart(int a,int b,int c) { if(B1) return a; if(a>=b) return B2; return kickstart(c,a,b); } How the boxes filled up ... $a\geq c, B2:kickstart\left ( b,c,a \right );$ Is it $I) and II)$ or $I) and IV)$
commented
May 21, 2019
in
Programming

219
views
madeeasytestseries
programming
programminginc
2
answers
29
oops doubt
A default catch block catches, [A]. all thrown objects [B]. no thrown objects [C]. any thrown object that has not been caught by an earlier catch block [D]. all thrown objects that have been caught by an earlier catch block
answered
May 21, 2019
in
Programming

58
views
oops
class
trycatch
nongate
2
answers
30
Made Easy Test Series:Programming(FLT4)
#include<stdio.h> #include<iostream> int bar(int m, int n){ if(m==0)return n; if(n==0)return m; return bar(n%m,m); } int foo(int m,int n){ return(m*n/bar(m,n)); } int main(){ int x=foo(1000,1500); printf("%d",x); return 0; } Output of the program is ___________
commented
May 21, 2019
in
Programming

211
views
madeeasytestseries
programming
programminginc
2
answers
31
GATE2006IT78
A pipelined processor uses a $4$stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic operations as well as the load and store operations are carried out in the EX stage. The sequence of ... the sequence of instructions are, respectively, $2, 2, 4$ $3, 2, 3$ $4, 2, 2$ $3, 3, 2$
commented
Jan 26, 2019
in
CO and Architecture

3.8k
views
gate2006it
coandarchitecture
pipelining
normal
3
answers
32
What is the number of states in the minimal DFA with input symbols {0,1,2} where 2nd last symbol is 1?
comment edited
Jan 9, 2019
in
Theory of Computation

1.7k
views
theoryofcomputation
minimalstateautomata
4
answers
33
GATE20137
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes? $O(1)$ $O(\log n)$ $O(n)$ $O(n \log n)$
commented
Jan 8, 2019
in
DS

3.3k
views
gate2013
datastructures
easy
binarysearchtree
1
answer
34
Equivalence of acceptance by empty stack and acceptance by final state. : PDA, Prefix Property
commented
Jan 1, 2019
in
Theory of Computation

342
views
1
answer
35
Back edge,tree edge,forward edges in BFS
Consider the following statements: 1. Let T be the DFS tree resulting from DFS traversal on a connected directed graph the root of the tree is an articulation point, iff it has at least two children. 2. When BFS is carried out on a directed ... back edge, or cross edge and not forward edge as in the case of DFS. Find TRUE or FALSE for both the statements
commented
Dec 31, 2018
in
DS

2.1k
views
algorithms
bfs
dfs
graphalgorithms
programminginc
datastructures
2
answers
36
breadth first search
The max possible height of BFS tree , if BFS is run on a complete bipartite graph Km,n where m>=1 , n>=1 with starting vertex S is
commented
Dec 25, 2018
in
Programming

520
views
bfs
bipartitegraph
0
answers
37
William Stalling Computer Organization I/O (DMA) question CYCLE stealing VS Burst Mode
comment edited
Dec 23, 2018
in
CO and Architecture

1k
views
coandarchitecture
dma
2
answers
38
GATE2004IT47
Consider a pipeline processor with $4$ stages $S1$ to $S4$. We want to execute the following loop: for (i = 1; i < = 1000; i++) {I1, I2, I3, I4} where the time taken (in ns) by instructions $I1$ to $I4$ for stages $S1$ to $S4$ ... $I1$ for $i = 2$ will be available after $\text{11 ns}$ $\text{12 ns}$ $\text{13 ns}$ $\text{28 ns}$
comment edited
Dec 23, 2018
in
CO and Architecture

4.5k
views
gate2004it
coandarchitecture
pipelining
normal
10
answers
39
GATE200447
Consider a system with a twolevel paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. The ... instruction execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
comment edited
Nov 25, 2018
in
CO and Architecture

21.9k
views
gate2004
coandarchitecture
virtualmemory
normal
3
answers
40
Write Trough
Do we consider hierarchical model or simultaneous access model for write through ?
comment edited
Sep 25, 2018
in
CO and Architecture

129
views
cachememory
coandarchitecture
write_through
50,737
questions
57,275
answers
198,154
comments
104,823
users