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
1
answer
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

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

121
views
theoryofcomputation
1
answer
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

47
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

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

110
views
mathematicallogic
1
answer
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

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

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

120
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

38
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

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

86
views
2
answers
12
gatebook mt2 qn48
Given TMs and L = {x/Every halts on input x } which of the following is true about L? (A) L is recursively enumerable but not recursive (B) L is Recursive but not Context free (C) L is Not Recursively Enumerable (D) L is regular Please explain why is the answer A and not B?
closed
Feb 7
in
Theory of Computation

62
views
turingmachine
recursiverecursivelyenumerable
ldentifylanguage
2
answers
13
Gatebook Mock 2
answer selected
Feb 7
in
Theory of Computation

120
views
gatebook_mt2
theoryofcomputation
2
answers
14
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

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

55
views
theoryofcomputation
dfa
2
answers
16
GATE2017 EC Digital
commented
Feb 7
in
Digital Logic

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

81
views
algorithms
sortingalgorithmsquicksort
1
answer
18
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

843
views
numericalanswers
1
answer
19
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

44
views
0
answers
20
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

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

70
views
1
answer
22
demand paging
closed
Feb 4
in
Operating System

65
views
memorymanagement
demandpaging
3
answers
23
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
1
answer
24
Calculating Circuit Propagation Delay
answer selected
Feb 4
in
Digital Logic

106
views
digitallogic
madeeasy
1
answer
25
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

85
views
operatingsystem
deadlock
1
answer
26
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

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

12
views
ugcnetdec2016ii
0
answers
28
Made Easy MOCK1 Question
commented
Feb 3
in
Algorithms

41
views
1
answer
29
Find the essential prime implicants
commented
Feb 3
in
Digital Logic

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

41
views
algorithms
timecomplexity
algorithm
asymptoticnotations
recurrenceequation
1
answer
31
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

37
views
0
answers
32
TOC Doubt
Turing machine that accept exactly k string,Isnt it completely undecidable?
commented
Feb 1
in
Theory of Computation

29
views
theoryofcomputation
decidability
0
answers
33
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

61
views
1
answer
34
Ace test series
commented
Feb 1
in
Theory of Computation

108
views
acetestseries
theoryofcomputation
0
answers
35
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

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

49
views
1
answer
37
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
0
answers
38
Testbook
commented
Jan 19
in
Theory of Computation

46
views
testbook
testseries
3
answers
39
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

309
views
probability
2
answers
40
Ace test Series
commented
Jan 18
in
Theory of Computation

73
views
acetestseries
testseries
21,535
questions
26,867
answers
61,199
comments
23,218
users