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.
Recent activity 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
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
5
answers
2
GATE2017215
The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below? MNOPQR NQMPOR QMNROP POQNMR
answer selected
Feb 23
in
Algorithms

780
views
gate20172
algorithms
bfs
graphsearch
2
answers
3
GATE2017219
Consider the following tables T1 and T2. T1 P Q 2 2 3 8 7 3 5 8 6 9 8 5 9 8 T2 R S 2 2 8 3 3 2 9 7 5 7 7 2 In table T1. P is the primary key and Q is the foreign key referencing R in table T2 with on ... In order to delete record $\rangle 3, 8 \langle$ from the table T1, the number of additional records that need to be deleted from table T1 is _______
answer selected
Feb 23
in
Databases

1.2k
views
gate20172
databases
numericalanswers
2
answers
4
GATE2017210
If $f(x) = R \: \sin ( \frac{\pi x}{2}) + S. f’(\frac{1}{2}) = \sqrt{2}$ and $\int_0^1 f(x) dx = \frac{2R}{\pi}$, then the constants $R$ and $S$ are $\frac{2}{\pi}$ and $\frac{16}{\pi}$ $\frac{2}{\pi}$ and 0 $\frac{4}{\pi}$ and 0 $\frac{4}{\pi}$ and $\frac{16}{\pi}$
answer selected
Feb 23
in
Calculus

743
views
gate20172
engineeringmathematics
calculus
differentiability
7
answers
5
GATE201721
The representaiton of teh value of a 16bit unsigned integer $X$ in hexadecimal number system is BCA9. The representation of the value of $X$ in octal number system is 571244 736251 571247 136251
answer selected
Feb 23
in
Digital Logic

701
views
gate20172
4
answers
6
GATE2017236
The preorder traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the postorder traversal of this tree is 2, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19, 20 2, 7, 6, 10, 9, 8, 15, 17, 20, 19, 16, 12 7, 2, 6, 8, 9, 10, 20, 17, 19, 15, 16, 12 7, 6, 2, 10, 9, 8, 15, 16, 17, 20, 19, 12
answer selected
Feb 23
in
DS

691
views
gate20172
1
answer
7
#probability_doubt_in_basic_concept
commented
Feb 23
in
Numerical Ability

103
views
probability
engineeringmathematics
discretemathematics
numericalability
7
answers
8
GATE2017233
A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below: Process Current Allocation Maximum Requirement P1 3 7 P2 1 6 P3 3 5 Which of the following best describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked
commented
Feb 15
in
Operating System

946
views
gate20172
operatingsystem
resourceallocation
6
answers
9
GATE2017239
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$NFA whose transition table is given below: $\delta$ $\epsilon$ $a$ $b$ $\rightarrow \: q_0$ $\{q_2\}$ $\{q_1\}$ $\{q_0\}$ $q_1$ $\{q_2\}$ $\ ... }(q_2, aba)$ is $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
commented
Feb 15
in
Theory of Computation

1k
views
gate20172
5
answers
10
GATE2017235
Consider two hosts $X$ and $Y$, connected by a single direct link of rate $10^6$ bits/ser. The distance between the two hosts is 10,000 km and the propagation speed along the link is $2 \times 10^8$ m/sec. Host $X$ sends a file of 50,000 bytes as ... the value of $p$ and $q$ are $p$=50 and $q$=100 $p$=50 and $q$=400 $p$=100 and $q$=50 $p$=400 and $q$=50
commented
Feb 15
in
Computer Networks

1k
views
gate20172
computernetworks
3
answers
11
GATE2017251
Consider the set of process with arrival time ( in milliseonds ) , CPU burst time ( in millisecods) and priority ( $0$ is the highest priority ) shown below . None of the process have I/O burst time Process Arival Time Burst ... P5 9 16 4 The average waiting time (in milli seconds) of all the process using premtive priority scheduling algorithm is ______
commented
Feb 15
in
Operating System

1.4k
views
gate20172
operatingsystem
processschedule
numericalanswers
6
answers
12
GATE2017244
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______
commented
Feb 15
in
Databases

2.8k
views
gate20172
databases
transactions
numericalanswers
conflictserializable
3
answers
13
GATE2017245
The read access times and the hit ratios for different caches in a memory hierarchy are as given below: Cache Read access time (in nanoseconds) Hit ratio Icache 2 0.8 Dcache 2 0.9 L2cache 8 0.9 The read access time ... fetch and 40% are for memory operand fetch. The average read access time in nanoseconds (up to 2 decimal places) is _________
commented
Feb 15
in
CO & Architecture

1.5k
views
gate20172
co&architecture
cachememory
numericalanswers
5
answers
14
How to find the complexity of T(n)=T(sqrt(n)) + 1 ?
answered
Feb 12
in
Algorithms

3.1k
views
algorithms
recurrence
4
answers
15
GATE2017126
Let $G=\left ( V,E \right )$ be $any$ connected undirected edgeweighted graph. The weights of the edges in $E$ are positive and distinct. Consider the following statements: (I) Minimum Spanning Tree of $G$ is always unique. (II) Shortest path between any two vertices of $G$ ... ? (A) (I) only (B) (II) only (C) both (I) and (II) (D) neither (I) nor (II)
commented
Feb 11
in
Algorithms

615
views
gate20171
algorithms
graphalgorithms
normal
3
answers
16
Test series: gatebook mock 2
Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no self loops and there is at most one edge between any pair ... m = 1 (C) M = 7, m = 4 (D) M = 6, m = 4 Shouldn't the answer be D?
answer selected
Feb 10
in
Graph Theory

137
views
gatebook_mt2
1
answer
17
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
answer selected
Feb 10
in
DS

153
views
hashing
datastructure
chaining
uniformhashing
1
answer
18
GATE2007IT37
Consider a Direct Mapped Cache with 8 cache blocks (numbered 07). If the memory block requests are in the following order 3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, 24, 2, 63, 5, 82,17, 24. Which of the following memory blocks will not be in the cache at the end of the sequence ? 3 18 20 30
commented
Feb 9
in
CO & Architecture

378
views
gate2007it
co&architecture
cachememory
normal
3
answers
19
Gatebook_Mocktest2(Operating Systems)
commented
Feb 9
in
Operating System

216
views
operatingsystem
fork
2
answers
20
Gate ECE GA 2017
commented
Feb 8
in
Numerical Ability

742
views
speedtimedistance
0
answers
21
Gatebook_Mocktest2(OS)Paging in 2DArray
asked
Feb 8
in
Operating System

130
views
gatebook_mt2
operatingsystem
paging
arrays
optimal
1
answer
22
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
answers
23
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
2
answers
24
Gatebook mock
answered
Feb 8
in
CO & Architecture

339
views
gatebook_mt2
co&architecture
speedup
1
answer
25
GATE2016Session7GA10
Ananth takes $6$ hours and Bharath takes $4$ hours to read a book. Both started reading copies of the book at the same time. After how many hours is the number of pages to be read by Ananth, twice that to be read by Bharath? Assume Ananth and Bharath read all the pages with constant pace. $1$ $2$ $3$ $4$
commented
Feb 8
in
Verbal Ability

157
views
gate2016session7aptitude
logicalreasoning
numericalability
2
answers
26
gatebook mt2 qn36
Consider a simple inorder fivestage pipeline with a twocycle branch misprediction penalty and a singlecycle loaduse delay penalty. For a specific program, 30% of the instructions are loads, 20% are branches, the remaining 50% ... instruction, and 75% of branches are predicted correctly. What is the average CPI of this program on this processor?
answered
Feb 8
in
CO & Architecture

593
views
co&architecture
machineinstructions
clockcycle
2
answers
27
Data Structure InOrder Predecessor
commented
Feb 8
in
DS

198
views
datastructure
tree
inorder
2
answers
28
Pipelining and CPI
Consider a nonpipelined processor design which has a cycle time of 10ns and average CPI of 1.4. If each pipeline stage adds extra 20ps due to register setup delay. The pipeline stalls 20% of the time for 1 cycle and 5% of the time for 2 cycles (these occurrences are disjoint). What is the new CPI?
commented
Feb 8
in
CO & Architecture

360
views
co&architecture
pipeline
badquestion
1
answer
29
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
commented
Feb 8
in
Operating System

84
views
gatebook_mt2
operatingsystem
1
answer
30
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
answered
Feb 8
in
Numerical Ability

76
views
gatebook_mt2
4
answers
31
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?
commented
Feb 8
in
Computer Networks

361
views
computernetworks
gatebook_mt2
ippacket
2
answers
32
No. of Tokens
answered
Feb 7
in
Compiler Design

174
views
0
answers
33
Test book test series
Number of toposorts for the poset shown in the diagram are
commented
Feb 7
in
Mathematical Logic

51
views
discretemathematics
1
answer
34
How many maximum cycles possible in any Complete graph? (Unlabelled nodes)
commented
Feb 7
in
Graph Theory

143
views
graphtheory
cycle
1
answer
35
GateBook Mock Test_2(Compilers)
commented
Feb 7
in
Compiler Design

239
views
gatebook_mt2
compilerdesign
grammar
1
answer
36
number of cycles in given graph:
commented
Feb 7
in
Algorithms

69
views
datastructure
3
answers
37
GATE20088
Given $f_1$, $f_3$ and $f$ in canonical sum of products form (in decimal) for the circuit $f_1 = \Sigma m(4, 5, 6, 7, 8)$ $f_3 = \Sigma m(1, 6, 15)$ $f = \Sigma m(1, 6, 8, 15)$ then $f_2$ is $\Sigma m(4, 6)$ $\Sigma m(4, 8)$ $\Sigma m(6, 8)$ $\Sigma m(4, 6, 8)$
commented
Feb 7
in
Digital Logic

641
views
gate2008
digitallogic
canonicalnormalform
easy
4
answers
38
GATE199212b
Let the page reference and the working set window be $c\ c\ d\ b\ c\ e\ c\ e\ a\ d\ $ and $4$, respectively. The initial working set at time $t=0$ contains the pages $\{a,d,e\}$, where $a$ was referenced at time ... $t=2$. Determine the total number of page faults and he average number of page frames used by computing the working set at each reference.
commented
Feb 7
in
Operating System

465
views
gate1992
operatingsystem
memorymanagement
normal
2
answers
39
GateBook Mock 2
According to me option B is correct.
answered
Feb 7
in
Theory of Computation

97
views
gatebook_mt2
theoryofcomputation
1
answer
40
GateBook_MockTest2(Programming)
edited
Feb 7
in
Programming

58
views
programminginc
gatebook_mt2
23,414
questions
30,126
answers
67,509
comments
28,443
users