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
Type of error
a) Lexical Error b) Syntax error c) Both a and b d) None of these
commented
Feb 8
in
Compiler Design

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

75
views
2
answers
3
No. of Tokens
answer selected
Feb 7
in
Compiler Design

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

33
views
discretemathematics
1
answer
5
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

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

74
views
2
answers
7
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

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

108
views
gatebook_mt2
theoryofcomputation
2
answers
9
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

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

46
views
theoryofcomputation
dfa
2
answers
11
GATE2017 EC Digital
commented
Feb 7
in
Digital Logic

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

72
views
algorithms
sortingalgorithmsquicksort
1
answer
13
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

714
views
numericalanswers
1
answer
14
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

38
views
0
answers
15
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

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

52
views
1
answer
17
demand paging
closed
Feb 4
in
Operating System

58
views
memorymanagement
demandpaging
2
answers
18
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

70
views
finiteautomata
counting
1
answer
19
Calculating Circuit Propagation Delay
answer selected
Feb 4
in
Digital Logic

79
views
digitallogic
madeeasy
1
answer
20
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

57
views
operatingsystem
deadlock
1
answer
21
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

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

6
views
ugcnetdec2016ii
0
answers
23
Made Easy MOCK1 Question
commented
Feb 3
in
Algorithms

38
views
1
answer
24
Find the essential prime implicants
commented
Feb 3
in
Digital Logic

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

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

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

25
views
theoryofcomputation
decidability
0
answers
28
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

56
views
1
answer
29
Ace test series
commented
Feb 1
in
Theory of Computation

88
views
acetestseries
theoryofcomputation
0
answers
30
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

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

40
views
1
answer
32
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

68
views
timecomplexity
algorithms
0
answers
33
Testbook
commented
Jan 19
in
Theory of Computation

41
views
testbook
testseries
3
answers
34
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

249
views
probability
2
answers
35
Ace test Series
commented
Jan 18
in
Theory of Computation

62
views
acetestseries
testseries
1
answer
36
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

55
views
0
answers
37
Hash Table
Consider an empty lash table of size = 10. The elements (12, 32, 25, 37, 46, 50, 47) are to be inserted, The hash function is (2x + 1) mod 10 and linear probing resolution technique is used let x be the no. of empty ... value of 10y + x? [Collisions on linear probed slot is counted as separate collisions] Your Answer: 53 Correct Answer: 73 Status: incorrect
commented
Jan 17
in
Programming

19
views
2
answers
38
Self doubt
REF: http://gateoverflow.in/76419/decidability Consider the language: 1) L = {<M> L(M) = $\epsilon$ } 2) L = {<M> M accepts epsilon } Now, lets consider the 1st language: It will contain all TM encodings for TM' ... other question is if we can have finite automata that accepts $\epsilon$, then we can also have TM that accepts $\epsilon$, right?
comment edited
Jan 17
in
Theory of Computation

284
views
decidability
1
answer
39
Testbook
packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets? my answr 18 given :20
commented
Jan 17
in
Computer Networks

209
views
computernetworks
testbook
testseries
1
answer
40
Hashing
Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is _______ (upto 2 decimal place).
commented
Jan 16
in
Algorithms

71
views
20,788
questions
25,938
answers
59,533
comments
21,926
users