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.
Answers by saurabh rai
User saurabh rai
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User saurabh rai
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
MADE EASY TEST SERIES
Which of the following represents the minimum number of states in DFA for given language : 5 states 6 states 7 states 8 states I am being able to draw a DFA with 5 states but Made easy says 6 states are required. Please verify.
answered
5 hours
ago
in
Theory of Computation

21
views
+1
vote
2
Recurrence
An organism is born on day K=1 with 1 cell. During day K=2,3,...... the organism produces $\frac{K^{2}}{K1}$ times more new cells than it produced on day K1. Number of cells in the organism at the end of 9th day if no cell dies is ___________ My Issue: Unable to solve the recurrence relation.
answered
2 days
ago
in
Combinatory

62
views
+1
vote
3
os doubt
answered
3 days
ago
in
Operating System

44
views
operatingsystem
+2
votes
4
morris mano excercise
answered
3 days
ago
in
CO & Architecture

34
views
+2
votes
5
Master theorem
answered
3 days
ago
in
Algorithms

39
views
algorithms
timecomplexity
mastertheorem
+1
vote
6
doubly linked list
A doubly linked list with head and tail pointers can be reversed in O(1) time? True or False but how?
answered
3 days
ago
in
Programming

21
views
+2
votes
7
DS: Deletion from B Tree
Someone please can check if this deletion from BST is correct? my concern is the in the resulted tree 30 must be the parent of 35, this sub tree 253035 structure shouldn't be changed
answered
3 days
ago
in
DS

102
views
btree
datastructure
+1
vote
8
Made Easy
Consider the following relation: R (A1, A,2, ....., An) and Every (n – 2) attributes of R forms Candidate key. Which of the following represents the number of super keys are there in R ? a. nCn–2 * 22 b. nCn–2 + n + 1 c. nCn–2 * [3] d. nCn–2
answered
3 days
ago
in
Databases

34
views
+2
votes
9
Static Variable
Consider storage class of a variable declared as static. Where the memory will be allocated? (A) Code Segment (B) Stack Segment (C) Heap Segment (D) Data Segment
answered
4 days
ago
in
DS

64
views
+4
votes
10
computer organization
Given that 4 GB and 2 MB are the respective sizes of main memory and cache. Find the most appropriate tag bit length. Assume the block size is same in both cache and main memory and direct mapping is used with byte addressable memory. (A)10 ( ... given op(b)........but how it possible bez there is no block size given.....plz someone explain this
answered
5 days
ago
in
CO & Architecture

22
views
+1
vote
11
MADE EASY TEST SERIES
answered
5 days
ago
in
Digital Logic

45
views
+3
votes
12
MADE EASY TEST SERIES
Suppose we have a relation R(A, B, C, D, E) with FDs {A → B, AB → C, D → AC, D → E}. R is decomposed as R1(ACD), R2(DE), R3(ABC). Which of the following statement is true regarding the ... depending preserving 3. lossy and dependency preserving 4. lossy and not dependency preserving Made easy says option 1 but i got option 3. Please guide.
answered
5 days
ago
in
Databases

36
views
0
votes
13
Testbook Question
number of boxes in the grid number of lines on the side of grid number of squares that can be made in the grid number of possible paths to topleft to bottomright of the grid
answered
5 days
ago
in
Programming

35
views
0
votes
14
made easy mock
Let L1 = {an bm cn⎪m, n ≥ 0} and L2 = {an cn⎪n ≥ 0}. Both L1 and L2 are context free languages. If L = (L1 – L2) then L is ________ Finite language Regular language DCFL Not DCFL can anyone give the elaboration..??
answered
5 days
ago
in
Theory of Computation

13
views
0
votes
15
Time complexity of fractionak knapsack using greedy algorithm is O(n^2)??TRUE/FALSE
answered
5 days
ago
in
Algorithms

50
views
greedyalgorithm
algorithms
+1
vote
16
GATE2005
Consider a disk drive with the following specifications: 16 surfaces, 512 tracks/surface, 512 sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one 4 byte word is ready ... . Memory cycle time is 40 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is____________
answered
6 days
ago
in
CO & Architecture

245
views
co&architecture
ioorganization
dma
+1
vote
17
ME test series
the given answer will be satisfied only if we considere 5 NOT gates here.. but why not to consider 6 NOT gate?? how is D answer?
answered
6 days
ago
in
Digital Logic

33
views
+1
vote
18
testbook
answered
6 days
ago
in
Programming

61
views
testbook
testseries
datastructure
dfs
0
votes
19
testbook
answered
6 days
ago
in
Compiler Design

32
views
testbook
testseries
compilerdesign
+1
vote
20
doubt
Explain Internal And External fragmentation clearly??
answered
Jan 10
in
Operating System

37
views
+2
votes
21
recurrence
answered
Jan 9
in
Algorithms

43
views
+2
votes
22
Virtual Gate
Consider the following two statements: S1: Activation records can have permanent lifetime in case of static allocation. S2: Activation records can have nested lifetime in case of stack allocation. Which of the option is correct regarding S1 and S2 respectively (A) True. True (B) True. False (C) False. True (D) False. False
answered
Jan 9
in
Compiler Design

115
views
virtualgate
+1
vote
23
Virtual Gate
answered
Jan 9
in
Compiler Design

98
views
testseries
virtualgate
+6
votes
24
GATE FORUM
Shouldn't it be 6?
answered
Jan 9
in
Mathematical Logic

70
views
gateforumtestseries
discretemathematics
+1
vote
25
ace digital ques 1
i think 5 will b answer .Rt?
answered
Jan 9
in
Digital Logic

45
views
0
votes
26
ACETOC
answered
Jan 9
in
Theory of Computation

29
views
theoryofcomputation
+4
votes
27
Maths: Limit
answered
Jan 8
in
Calculus

84
views
limits
engineeringmathematics
calculus
0
votes
28
Back Edge
answered
Jan 7
in
Algorithms

64
views
algorithms
graphalgorithms
+8
votes
29
min heap
The number of binary min. heaps that can be formed from a set of 7 distinct integers is _________?
answered
Jan 7
in
DS

226
views
+2
votes
30
Remove Left recursion
Eliminate the left recursion of the grammar $S\rightarrow Bb / a$ $B\rightarrow Bc /Sd /e$
answered
Jan 7
in
Compiler Design

55
views
compilerdesign
leftrecursion
+3
votes
31
Maths Logics
Is the given statement True ? Please explain $\forall_x \left \{ P(x) \vee Q(x) \right \}\Leftrightarrow \forall_x P(x) \vee \forall_x Q(x) $ $\forall_x \left \{ P(x) \wedge Q(x) \right \}\Leftrightarrow \forall_x P(x) \wedge \forall_x Q(x) ... Q(x)$ $\exists_x \left \{ P(x) \wedge Q(x) \right \}\Leftrightarrow \exists_x P(x) \wedge \exists_x Q(x) $
answered
Jan 7
in
Mathematical Logic

76
views
mathematicallogic
+1
vote
32
Doubt OS  Round Robin Context Switch
answered
Jan 7
in
Operating System

33
views
contextswitch
operatingsystem
cpuscheduling
roundrobin
0
votes
33
Please explain ?
Please explain how SIPO and PISO work here ?
answered
Jan 6
in
Digital Logic

37
views
+6
votes
34
#algo
Solve this problem?
answered
Jan 6
in
Algorithms

50
views
+3
votes
35
Recurrence relation
answered
Jan 5
in
Mathematical Logic

82
views
+2
votes
36
Pipelining
A nonpipeline processor has a clock rate 3 GHz and an average CPI of 4. An upgrade to the processor introduce 5 stage pipeline. How ever due to internal delay the clock rate of the new processor has to be reduces to 2 GHz. What is the speedup of pipeline over nonpipeline?
answered
Jan 5
in
CO & Architecture

132
views
pipeline
co&architecture
0
votes
37
slot time and roundtrip time
What is different between slot time and round trip time? To calculate the min frame length in ethernet we use RTT then what is the significance of slot time.
answered
Jan 5
in
Computer Networks

26
views
computernetworks
ethernet
+1
vote
38
Serial schedule
answered
Jan 5
in
Databases

19
views
databases
madeeasy_testseries
+1
vote
39
doubt
why x=a[i][j] and x=f(a,b) are not three address code..
answered
Jan 5
in
Compiler Design

25
views
three
address
intermediatecode
+2
votes
40
Pipelining (Hamacher)
A pipeline processor has two branch delay slots. An optimizing compiler can fill one of these slots 85% of the time and can fill the second slot 20% of the time. What percentage improvement in performence achieved by this optimization, assuming 20% of the instruction executed are branch instruction?
answered
Jan 5
in
CO & Architecture

110
views
pipeline
Page:
1
2
3
next »
18,898
questions
23,865
answers
51,932
comments
20,186
users