The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 Vikas123
User Vikas123
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Vikas123
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
ME mock1
Consider a binary tree, where for every node P – Q ≤ 2, where P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such a binary tree of height h =4 will be 6 8 9 None of these
answered
Jan 20, 2019
in
Algorithms

43
views
algorithms
1
answer
2
Gateforum Test Series: Algorithms  Minimum Spanning Trees
commented
Jan 14, 2019
in
Algorithms

215
views
gateforumtestseries
algorithms
minimumspanningtrees
1
answer
3
LR(1) parser
neither S1 nor S2 is true S1 is true S2 is true
answered
Jan 14, 2019
in
Compiler Design

85
views
1
answer
4
MadeEasy Subject Test 2019: Compiler Design  Syntax Directed Translation
Consider the following Translation rules for the Grammar G : What will be the output for input string abebebe for bottom up parser ? CBBPBPBP CBBBPPBB CBPBPBPB CBPBBPPB
commented
Jan 14, 2019
in
Compiler Design

215
views
compilerdesign
syntaxdirectedtranslation
madeeasytestseries
madeeasytestseries2019
1
answer
5
made easy cbt1
FIFO replacement policy ignores locality of reference. true/false
answered
Jan 14, 2019
in
CO and Architecture

281
views
1
answer
6
ME Test
answered
Jan 14, 2019
in
Databases

63
views
2
answers
7
mad easy cbt 1
Let A be ternary tree with each node having 0 or 3 children . Let T have 25 node .The number of leaf nodes in ternary tree are
answered
Jan 14, 2019
in
Programming

158
views
1
answer
8
MadeEasy Test Series: Operating System  Disks
Consider a unix inode which maintains $5$ direct disk blocks, $1$ single indirect, $1$ double indirect and $1$ triple indirect DBA. Disk block size is $4 \text{ KB }$ and disk block address is $32 \text{ bits }$. Which of the following is maximum possible file ... $256 \text{ GB }$ $512 \text{ GB }$ $2 \text{ TB }$ Answer by ME: Option $(A)$
answered
Jan 14, 2019
in
Operating System

233
views
madeeasytestseries
operatingsystem
inode
disks
2
answers
9
permutation and combination
1 2 10 16
answered
Jan 13, 2019
in
Mathematical Logic

66
views
1
answer
10
MadeEasy Full Length Test 2019: Operating System  Semaphore
Let S be a binary semaphore variable, S=0 What will be the value of S when following operations are performed: 2P, 4V, 5P, 2P, 8V, 3P, 2V ?
commented
Jan 13, 2019
in
Operating System

459
views
operatingsystem
semaphore
madeeasytestseries2019
madeeasytestseries
1
answer
11
TLB hit ration and memory lookup time
Consider a system where TLB lookup time is $25$ ns and memory access time is $200$ ns, respectively. Assuming a virtual address space of $2$ KB, page size of $32$ bytes, and a PTE size of $2$ bytes, what is the minimum TLB hit ratio that results in an average v2p (virtual to physical) translation latency of $185$ ns?
answered
Jan 13, 2019
in
Operating System

142
views
tlb
hitratio
0
answers
12
Self doubt
11^23 mod 187= 149 by using virtual gate calculator... plz tell me where i am wrong...??
asked
Jan 12, 2019
in
Computer Networks

89
views
seelater
0
answers
13
Self doubt
Here last step i didn't understand… 11^23 mod 187=88....HOW..?? m getting 11^23 mod 187 = 149 by using Gate virtual calculator...???
asked
Jan 12, 2019
in
Computer Networks

32
views
0
answers
14
Made easy 2019
RSA crytptosystem the public key of given user is e=31 and n=3599. The private key of user will be.… Plz fully solution post
asked
Jan 12, 2019
in
Computer Networks

57
views
madeeasytestseries
1
answer
15
me test series
A computer system implements a 38 bit virtual address, page size of 16 KB, and 256 entries translation look aside buffer (TLB) organized into 32 sets each having 8 ways. If TLB tag does not store any process id. The minimum length of TLB tag in bits is____
answered
Jan 12, 2019
in
Operating System

70
views
tlb
operatingsystem
2
answers
16
MadeEasy Test Series 2019: General Aptitude  Speed Time Distance
A ball thrown upward satisfy the equation s=160 t  20 t^2, where S is in m (meter) and t is in sec. what is the maximum height achieved by the ball ? (a) 80 (b) 160 (c) 240 (d) 320 According to me.. Here s=height ... have a velocity of zero (since it will stop at the highest point). So, v=0 than can anyone tell me where I am wrong ?
commented
Jan 11, 2019
in
Numerical Ability

319
views
generalaptitude
speedtimedistance
madeeasytestseries2019
madeeasytestseries
2
answers
17
Madeeasy[CNFlow control]
Consider two computers A and B are connected through a network of 30 Mbps.Assume the distance between them is 3000km and the signal propagation speed is same as the speed of light and the packet size is 12 KB. What is minimum number of bits required for window to achieve 100% utilization during GBN and SR protocol ?
answered
Jan 10, 2019
in
Computer Networks

286
views
computernetworks
gobackn
1
answer
18
CUT VERTEX
plz solve this problem..
commented
Jan 10, 2019
in
Mathematical Logic

185
views
cutoffs
engineeringmathematics
discretemathematics
graphtheory
1
answer
19
Profit and Loss
A merchant marks his good such that the profit on sale of 500 article is equal to the 300 article. the profit % is..?? (a) 50% (b) 75% © 100% (d) 150%
asked
Jan 9, 2019
in
Verbal Ability

126
views
numericalability
profitloss
generalaptitude
1
answer
20
MadeEasy Test Series: Programming & DS  Binary Search Tree
AVL tree is created by inserting the keys 2, 6, 1, 5, 3, 4, 7 in the given order (Assume the tree is initially empty). Then the level order traversals of the tree would be. 2, 1, 3, 5, 4, 6, 7 3, 2, 5, 1 ... . After 2 or 3 rotations I get stuck trying to figure out which way to rotate. Please help me with the proper steps in this question.
commented
Jan 9, 2019
in
DS

171
views
madeeasytestseries
datastructures
binarysearchtree
0
answers
21
Merge Sort
Can anyone help me to understand this problem….??
commented
Jan 9, 2019
in
Algorithms

215
views
mergesort
algorithms
sorting
merging
0
answers
22
PREORDER, POSTORDER INORDER
Acc. to (question) my solution is... uniquely constructed binary tree PRE+POST and IN+POST… where i am wrong….
commented
Jan 9, 2019
in
Algorithms

165
views
treetraversal
datastructures
1
answer
23
Made easy test series
answered
Jan 8, 2019
in
Computer Networks

38
views
1
answer
24
DBMS transaction
Which of the following is used to get back all the transactions back after rollback? a)Rollback b)Commit c)undo d)Redo
answered
Jan 8, 2019
in
Databases

83
views
databases
transactionandconcurrency
2
answers
25
MadeEasy Test Series 2019: Computer Networls  Congestion Control
Please help, I am getting total number of transmission to get BACK TO 38 as 14 and NOT 15. after 14th, it would have became 38, so no need to consider 15th segment right?
answered
Jan 8, 2019
in
Computer Networks

253
views
computernetworks
congestioncontrol
madeeasytestseries
tcp
transportlayer
1
answer
26
Reflexive Relation
Can anyone help …. where I am wrong…??
commented
Jan 8, 2019
in
Mathematical Logic

106
views
relations
settheory&algebra
discretemathematics
0
answers
27
GATE 2019 2way set associative
plz explain …..??
commented
Jan 8, 2019
in
Operating System

132
views
cachememory
coandarchitecture
0
answers
28
Made Easy DS doubt
IS IT CORRECT…??
commented
Dec 28, 2018
in
DS

83
views
1
answer
29
Made Easy2019
The minimum size of stack required to evaluate given post fix expression is _____________ postfix : 2 5 x 6 + 4 2 x  MY ANSWER IS 8.. CAN ANYONE TELL ME WHERE I AM WRONG…??
asked
Dec 28, 2018
in
DS

384
views
datastructures
programminginc
gate2019
preparation
2
answers
30
MadeEasy Test Series 2018: Compiler Design  Intermediate Code
The following program uses six temporary variables p, q, r, s, t and u. The code is : Assuming that all operations take their operands from registers. The minimum number of registers needed to execute this program without spilling are ... three lines and the last line are dead code. So the answer should be 2. Please correct me if wrong.
answered
Dec 25, 2018
in
Compiler Design

417
views
compilerdesign
intermediatecode
madeeasytestseries
52,345
questions
60,503
answers
201,898
comments
95,334
users