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
Regular grammar
answered
Mar 8
in
Theory of Computation

121
views
theoryofcomputation
+4
votes
2
GATE2017 EC Digital
answered
Feb 6
in
Digital Logic

519
views
digitallogic
+2
votes
3
No. of DFA's Possible
The number of different DFA's with two states X and Y,where X is the initial state,over the alphabet $\sum$ = {0,1,2}
answered
Feb 4
in
Theory of Computation

97
views
finiteautomata
counting
+2
votes
4
Find the essential prime implicants
answered
Feb 3
in
Digital Logic

47
views
digitallogic
+3
votes
5
Complexity
int loop(int n) { for(int i=1;i<=n;i++) { for(int j=1;j<n;j+=i) { O(1) } } } What is the time complexity of above code segment?
answered
Jan 30
in
DS

89
views
timecomplexity
algorithms
+4
votes
6
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
Jan 18
in
Theory of Computation

59
views
+1
vote
7
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
Jan 15
in
Combinatory

120
views
+1
vote
8
os doubt
answered
Jan 15
in
Operating System

67
views
operatingsystem
+2
votes
9
morris mano excercise
answered
Jan 14
in
CO & Architecture

46
views
+2
votes
10
Master theorem
answered
Jan 14
in
Algorithms

63
views
algorithms
timecomplexity
mastertheorem
+1
vote
11
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
Jan 14
in
Programming

47
views
+2
votes
12
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
Jan 14
in
DS

135
views
btree
datastructure
+1
vote
13
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
Jan 14
in
Databases

52
views
+2
votes
14
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
Jan 13
in
DS

81
views
+4
votes
15
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
Jan 13
in
CO & Architecture

36
views
+1
vote
16
MADE EASY TEST SERIES
answered
Jan 13
in
Digital Logic

64
views
+3
votes
17
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
Jan 13
in
Databases

47
views
0
votes
18
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
Jan 12
in
Programming

55
views
0
votes
19
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
Jan 12
in
Theory of Computation

23
views
0
votes
20
Time complexity of fractionak knapsack using greedy algorithm is O(n^2)??TRUE/FALSE
answered
Jan 12
in
Algorithms

137
views
greedyalgorithm
algorithms
+1
vote
21
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
Jan 11
in
CO & Architecture

315
views
co&architecture
ioorganization
dma
+1
vote
22
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
Jan 11
in
Digital Logic

48
views
+1
vote
23
testbook
answered
Jan 11
in
Programming

79
views
testbook
testseries
datastructure
dfs
0
votes
24
testbook
answered
Jan 11
in
Compiler Design

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

45
views
+2
votes
26
recurrence
answered
Jan 9
in
Algorithms

49
views
+2
votes
27
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

148
views
virtualgate
+1
vote
28
Virtual Gate
answered
Jan 9
in
Compiler Design

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

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

56
views
0
votes
31
ACETOC
answered
Jan 9
in
Theory of Computation

39
views
theoryofcomputation
+4
votes
32
Maths: Limit
answered
Jan 8
in
Calculus

127
views
limits
engineeringmathematics
calculus
0
votes
33
Back Edge
answered
Jan 7
in
Algorithms

80
views
algorithms
graphalgorithms
+9
votes
34
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

441
views
+2
votes
35
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

120
views
compilerdesign
leftrecursion
+3
votes
36
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

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

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

43
views
+6
votes
39
#algo
Solve this problem?
answered
Jan 6
in
Algorithms

57
views
+3
votes
40
Recurrence relation
answered
Jan 5
in
Mathematical Logic

89
views
Page:
1
2
3
next »
21,535
questions
26,867
answers
61,199
comments
23,218
users