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 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
answers
1
Dynamic Programming
Find an optimal parenthesization of a matrixchain product whose sequence of dimensions <5,10,3,12,5,50,6>.
commented
Mar 22
in
Algorithms

137
views
algorithms
dynamicprogramming
1
answer
2
Regular grammar
commented
Mar 8
in
Theory of Computation

138
views
theoryofcomputation
2
answers
3
regular expression
Find the regular expression for $L=a^nb^m$ where $n>=3$ , $m$ is even ?
answer selected
Mar 8
in
Theory of Computation

82
views
theoryofcomputation
regularexpressions
1
answer
4
regular expression
Find dfa that accept regular expression ab(a+ab)*(a+aa)
asked
Mar 8
in
Theory of Computation

134
views
theoryofcomputation
1
answer
5
Logically Equivalent justify your answer
answer selected
Mar 3
in
Mathematical Logic

200
views
mathematicallogic
2
answers
6
Type of error
a) Lexical Error b) Syntax error c) Both a and b d) None of these
commented
Feb 8
in
Compiler Design

188
views
1
answer
7
which of the following is true..??
commented
Feb 8
in
Operating System

796
views
2
answers
8
No. of Tokens
answer selected
Feb 7
in
Compiler Design

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

58
views
discretemathematics
1
answer
10
Linked list time complexity
Given two singly linked list of size n. The time complexity of computing the union and intersection of two linked list is. a) O(n) and O(nlogn) b) O(n) and O(n) c) O(nlogn) and O(nlogn) d) O(nlogn) and O(n)
commented
Feb 7
in
Algorithms

140
views
2
answers
11
Maximum File Size
I am getting 282. Answer given is 256..??
commented
Feb 7
in
Operating System

112
views
4
answers
12
GB Mock 2
answer selected
Feb 7
in
Theory of Computation

148
views
gatebook_mt2
theoryofcomputation
2
answers
13
GATE19871V
The most relevant addressing mode to write positionindependent codes is: Direct mode Indirect mode Relative mode Indexed mode
commented
Feb 7
in
CO & Architecture

350
views
gate1987
co&architecture
addressingmodes
1
answer
14
dfa gatebook QS
commented
Feb 7
in
Theory of Computation

65
views
theoryofcomputation
dfa
2
answers
15
GATE2017 EC Digital
commented
Feb 7
in
Digital Logic

611
views
digitallogic
2
answers
16
Algorithm quicksort
Reply with solution @ Habibkhan,@Gabbar,@Arjun Sir
answer selected
Feb 7
in
Algorithms

97
views
algorithms
sortingalgorithmsquicksort
1
answer
17
GATE 2017 EC
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
commented
Feb 6
in
Numerical Ability

1.1k
views
numericalanswers
1
answer
18
combinatrics
Find the number of seven digit integers with sum of the digits equal to 11 and formed by using the digits 1,2 and 3 only. ans given 161
answer selected
Feb 6
in
Combinatory

50
views
0
answers
19
MADE EASY TEST SERIES
Made easy says answer is option C but i doubt it. Can somebody confirm ?
commented
Feb 5
in
Theory of Computation

81
views
2
answers
20
which of the following is the regular language
commented
Feb 5
in
Theory of Computation

76
views
1
answer
21
demand paging
closed
Feb 4
in
Operating System

107
views
memorymanagement
demandpaging
3
answers
22
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

151
views
finiteautomata
counting
2
answers
23
Calculating Circuit Propagation Delay
answer selected
Feb 4
in
Digital Logic

169
views
digitallogic
madeeasytestseries
1
answer
24
starvation
I'm looking for an explanation for this Since no bounded waiting means a process waits while others can enter the system hence that process is starving and starvation freedom implies no process should starve for a long amount of time (not ... not true no starvation => bounded waiting I think I might be missing something so can you please highlight that
commented
Feb 4
in
Operating System

141
views
operatingsystem
deadlock
1
answer
25
UGCNETDEC2016II26
Match the following Layers and Protocols for a user browsing with SSL: a. Application of layer i. TCP b. Transport layer ii. IP c. Network layer iii. PPP d. Datalink layer iv. HTTP aiv; bi; cii; diii aiii; bii; ci; div aii; biii; civ; di aiii; bi; civ; dii
answer selected
Feb 4
in
Others

118
views
ugcnetdec2016ii
1
answer
26
UGCNETDEC2016II23
Which of the following is a valid heap? A B C D
answer selected
Feb 4
in
Others

83
views
ugcnetdec2016ii
0
answers
27
Made Easy MOCK1 Question
commented
Feb 3
in
Algorithms

46
views
2
answers
28
Find the essential prime implicants
commented
Feb 3
in
Digital Logic

81
views
digitallogic
1
answer
29
solve the recurrence
T(n)= T($\frac{n}{2}$) + $\frac{n^{2}}{2}$ + n
answer selected
Feb 2
in
Algorithms

60
views
algorithms
timecomplexity
asymptoticnotations
recurrence
1
answer
30
ME test
If G is a bipartate planar graph with 'n' vertices, then maximum number of edges in G is ____________ ? A) 2n4 B) 3n2 C) n2 D) n
commented
Feb 1
in
Mathematical Logic

41
views
1
answer
31
TOC Doubt
Turing machine that accept exactly k string,Isnt it completely undecidable?
commented
Feb 1
in
Theory of Computation

48
views
theoryofcomputation
decidability
0
answers
32
Min heap
A min heap having 1024 distinct elements with keys ranging from 0 to 1023 is stored in array of 1024 indices. The maximum difference between the keys of all the element that can possibly be stored at (n/2)th index of the array is...........
commented
Feb 1
in
Algorithms

75
views
1
answer
33
Ace test series
commented
Feb 1
in
Theory of Computation

109
views
acetestseries
theoryofcomputation
0
answers
34
gate 2014 set3
onsider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChildrightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr ... is the root....how is f node ever called using the above program although f is a leaf node.
closed
Jan 30
in
Programming

46
views
1
answer
35
CFL  Problem Test Series
L={a^n b^k, n <= k <=2n} 1.CFL 2.Non CFL
commented
Jan 30
in
Theory of Computation

58
views
2
answers
36
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

162
views
timecomplexity
algorithms
1
answer
37
Testbook
commented
Jan 19
in
Theory of Computation

67
views
testbooktestseries
testseries
3
answers
38
Probability
It is known that screws produced by a certain company will be defective with probability $0.01$ independently of each other. The company sells the screws in package of $10$ and offers a replacement guarantee that at most $1$ of the $10$ screws is defective. What proportion of packages sold must the company replace? Answer given is $0.04$
answer selected
Jan 19
in
Probability

413
views
probability
2
answers
39
Ace test Series
commented
Jan 18
in
Theory of Computation

86
views
acetestseries
testseries
1
answer
40
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

61
views
24,979
questions
32,079
answers
74,604
comments
30,153
users