GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Questions by smartmeet
User smartmeet
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User smartmeet
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
2
answers
1
Is there any difference between GO answer key and official answer key in both sets?
asked
Feb 26
in
GATE

330
views
2017gate
0
votes
0
answers
2
Gatebook_Mocktest2(OS)Paging in 2DArray
asked
Feb 8
in
Operating System

130
views
gatebook_mt2
operatingsystem
paging
arrays
optimal
0
votes
1
answer
3
Gatebook_Mocktest2(DS)
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only if N is composite. Assume that the bits array is initialized to all zeroes. for ( int x ... n < N is prime. (A) I only (B) I and II only (C) II and III only (D) I, II, and III
asked
Feb 8
in
DS

91
views
gatebook_mt2
datastructure
spacecomplexity
timecomplexity
asymptoticnotations
0
votes
0
answers
4
Gatebook_Mocktest2(DS)
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) deﬁned to be some element x in the current set such thatxy ≤ xiy for all xi in the current set. Let where ... in order to minimizeT? (A) A sorted list (B) An unordered list (C) An implicit heap (D) An AVL tree
asked
Feb 8
in
DS

56
views
gatebook_mt2
datastructure
avltree
0
votes
1
answer
5
Hashing
If h is any hashing function and is used to hash n keys into a table of size m, here n<=m, the expected number of collisions involving a particular key x is a) Less than 1 b) Less than n c) Less than m d) Less than n/2
asked
Feb 8
in
DS

153
views
hashing
datastructure
chaining
uniformhashing
0
votes
2
answers
6
Data Structure InOrder Predecessor
asked
Feb 8
in
DS

198
views
datastructure
tree
inorder
0
votes
1
answer
7
Gatebook_Mocktest2(OS)
Which of the following statements is FALSE? (A) Each thread has own stack (B) Starvation implies deadlock (C) Smaller page size increases the page table size (D) User level process can not modify its own page table entries
asked
Feb 8
in
Operating System

84
views
gatebook_mt2
operatingsystem
0
votes
1
answer
8
Gatebook_MockTest2(Aptitude)
There are two examinations rooms A and B. If 10 students are sent from A to B, then the number of students in each room is the same. If 20 candidates are sent from B to A, then the number of students in A is double the number of students in B. The number of students in room A is: (A) 20 (B) 80 (C) 100 (D) 200
asked
Feb 8
in
Numerical Ability

76
views
gatebook_mt2
0
votes
3
answers
9
Gatebook_Mocktest2(Operating Systems)
asked
Feb 7
in
Operating System

216
views
operatingsystem
fork
+1
vote
1
answer
10
Gatebook_Mocktest2(Propositional Logic)
asked
Feb 7
in
Mathematical Logic

94
views
gatebook_mt2
mathematicallogic
propositionallogic
0
votes
1
answer
11
GateBook_MockTest2(Programming)
asked
Feb 7
in
Programming

58
views
programminginc
gatebook_mt2
+1
vote
1
answer
12
GateBook Mock Test_2(Compilers)
asked
Feb 7
in
Compiler Design

239
views
gatebook_mt2
compilerdesign
grammar
0
votes
1
answer
13
GateBook Mock Test_2(TOC)
Given TMs and L = {x/Every halts on input x } which of the following is true about L? (A) L is recursively enumerable but not recursive (B) L is Recursive but not Context free (C) L is Not Recursively Enumerable (D) L is regular
asked
Feb 7
in
Theory of Computation

62
views
gatebook_mt2
theoryofcomputation
decidability
turingmachine
+2
votes
0
answers
14
GateBook Mock Test_2(Btree)
A Btree of order m is a tree which satisfies the following properties: Every node has at most m children. Every node (except root) has at least ⌈m/2⌉ children maximium no of internal nodes an order 4 B tree can have with 20 keys.
asked
Feb 7
in
Databases

114
views
gatebook_mt2
datastructure
dbms
btree
databases
0
votes
0
answers
15
GateBook Mock Test_2(Algorithms)
asked
Feb 7
in
Algorithms

89
views
gatebook_mt2
datastructure
algorithms
spacecomplexity
timecomplexity
0
votes
1
answer
16
GateBook Mock Test_2(Data Structure)
asked
Feb 7
in
DS

51
views
datastructure
avltree
gatebook_mt2
+4
votes
4
answers
17
GateBook MockTest2
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20byte IP header and a 20byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
asked
Feb 7
in
Computer Networks

361
views
computernetworks
gatebook_mt2
ippacket
0
votes
1
answer
18
What is the value of ssthresh at the 24 th transmission round?
asked
Feb 7
in
Computer Networks

87
views
thrashing
computernetworks
gatebook_mt2
0
votes
1
answer
19
OSCommon Doubt
In Priority scheduling algorithm, higher value of priority gets higher priority or lower value of priority gets higher priority? Means, Priorities: 1,2,3 for ProcessesA,B,C Now, execution order will be ABC or CBA
asked
Feb 1
in
Operating System

38
views
operatingsystem
cpuscheduling
priority
0
votes
1
answer
20
G be a simple graph on 8 vertices such that there is a vertices of degrees 1,2,3,4,5,6,7 respectively  then
asked
Jan 27
in
Graph Theory

93
views
graphtheory
engineeringmathematics
virtualgate
0
votes
1
answer
21
Lossless or Lossy (Explain with help of table drawing, if possible)
asked
Jan 27
in
Databases

32
views
databases
losslessjoin
0
votes
1
answer
22
What we can do if unary operator comes in infix notation while converting it into postfix/prefix notations?
asked
Jan 18
in
DS

54
views
datastructure
stack
infixpostfix
general
virtualgate
+1
vote
1
answer
23
When they don't mention type of tree then if it's mandatory to take 'Binary Tree'(Check Description)
asked
Jan 18
in
Graph Theory

52
views
discretemathematics
engineeringmathematics
virtualgate
graphtheory
trees
0
votes
1
answer
24
Graph Theory
Let G be a undirected graph with 35 edges and degree of each vertex is at least 3 then maximum number of vertices possible in G is (A) 22 (B) 23 (C) 24 (D) 25 P.S. Explain with ease, if possible!
asked
Jan 18
in
Graph Theory

116
views
graphtheory
engineeringmathematics
discretemathematics
0
votes
1
answer
25
Number of possible conflict equivalent serial schedules
asked
Jan 17
in
Databases

109
views
topologicalsort
databases
concurrency
conflictserializable
algorithms
+1
vote
1
answer
26
Which device have Exactly one i/p address? (Work Station,Router,Gateway can have more than one i/p)
asked
Jan 14
in
Computer Networks

175
views
computernetworks
networklayering
ippacket
0
votes
1
answer
27
Which is maximum Planar graph whose Line Graph is Planar?(Check the answer)
asked
Jan 14
in
Graph Theory

39
views
+1
vote
1
answer
28
How many maximum cycles possible in any Complete graph? (Unlabelled nodes)
asked
Jan 14
in
Graph Theory

143
views
graphtheory
cycle
+1
vote
0
answers
29
Can anyone make the table of Complexities, No. of swaps required for N elements for all type of sorts?
asked
Jan 13
in
Algorithms

61
views
algorithms
timecomplexity
sorting
0
votes
2
answers
30
Gateforum TOC
PS:Ans is (C), Explain why statement4 is TRUE?
asked
Jan 12
in
Theory of Computation

99
views
theoryofcomputation
regularexpressions
Page:
1
2
next »
23,414
questions
30,125
answers
67,509
comments
28,443
users