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
0
answers
1
Ace test Series
commented
2 hours
ago
in
Theory of Computation

12
views
acetestseries
testseries
1
answer
2
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
0
answers
3
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
13 hours
ago
in
Programming

10
views
2
answers
4
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
13 hours
ago
in
Theory of Computation

147
views
decidability
1
answer
5
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
1 day
ago
in
Computer Networks

138
views
computernetworks
testbook
testseries
1
answer
6
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
1 day
ago
in
Algorithms

38
views
0
answers
7
General Question
GATE exam is online, so people are not allowed to take their question papers. So how do people calculate their marks? Does a copy of exam paper is mailed to the candidates after the exam?
commented
1 day
ago
in
GATE

17
views
gate2017
1
answer
8
GATE1996_21
The concurrent programming constructs fork and join are as below: fork <label> which creates a new process executing from the specified label join <variable> which decrements the specified synchronization variable (by 1) and terminates the process if ... not 0. Show the precedence graph for S1, S2, S3, S4, and S5 of the concurrent program below.
commented
1 day
ago
in
Operating System

484
views
gate1996
operatingsystem
processsynchronization
normal
1
answer
9
language
what type of language is this? L={(a^m)(b^n)(c^k)  if(m==n) then n!=k , m,n,k>=1}
commented
2 days
ago
in
Theory of Computation

51
views
1
answer
10
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.
commented
2 days
ago
in
Combinatory

62
views
1
answer
11
turing machine
Consider the following languages: Lne={〈M〉│L(M)≠ф } Le={〈M〉│L(M)=ф } where 〈M〉 denotes encoding of a Turning machine M Then which one of the following is true? (a) Lne is r.e. but not recursive and Le is not r.e. (b) Both are not r.e. (c) Both are recursive (d) Le is r.e. but not recursive and Lne is not r.e.
commented
2 days
ago
in
Theory of Computation

35
views
theoryofcomputation
0
answers
12
Relative Addressing Mode
A two word instruction is stored in memory at an address designated by symbol W. The address field of the instruction (stored at W+1) is designated by symbol Y. The operand used during the execution of the instruction is stored at an address symbolized by the Z. Which of the ... Y + 1) Z = (W + 2) + M [Y] Z = M[M[Y]] + Y Both (A) and (B)
commented
2 days
ago
in
CO & Architecture

14
views
0
answers
13
Discrete Maths
I have solved it by some legacy method ! i want to know how to solve using combinatorics ??
commented
2 days
ago
in
Mathematical Logic

37
views
1
answer
14
LL(k) grammars
1. LL(k) grammars have one to one correspondance with DCFL's 2. LR(k) grammars have one to one correspondance with CFL's Which of them is True and explain it bit clearly?
commented
2 days
ago
in
Compiler Design

326
views
theoryofcomputation
compilerdesign
grammar
ll1
1
answer
15
os doubt
commented
2 days
ago
in
Operating System

44
views
operatingsystem
1
answer
16
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?
commented
2 days
ago
in
CO & Architecture

110
views
pipeline
1
answer
17
Master theorem
answer edited
2 days
ago
in
Algorithms

39
views
algorithms
timecomplexity
mastertheorem
0
answers
18
Made easy book: Doubt in frequency of clock
commented
2 days
ago
in
Digital Logic

23
views
digitallogic
3
answers
19
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
commented
2 days
ago
in
DS

102
views
btree
datastructure
1
answer
20
doubly linked list
A doubly linked list with head and tail pointers can be reversed in O(1) time? True or False but how?
commented
2 days
ago
in
Programming

21
views
0
answers
21
Which of the following is CSL?
commented
3 days
ago
in
Theory of Computation

82
views
0
answers
22
ER MODEL
How to solve this question ?
edited
3 days
ago
in
Databases

22
views
erdiagram
1
answer
23
grammer
commented
3 days
ago
in
Compiler Design

57
views
1
answer
24
morris mano excercise
answered
3 days
ago
in
CO & Architecture

34
views
1
answer
25
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
1
answer
26
If L is any language accepted by DPDA with stack containing only one symbol. Then L can be
commented
3 days
ago
in
Theory of Computation

41
views
theoryofcomputation
contextfree
pushdownautomata
1
answer
27
Stack
Consider a stack is implemented using an array. What is worst case time complexity of push operation? A) O(n) B) O(log n) C) O(n log n) D) O(1)
commented
4 days
ago
in
DS

114
views
stack
datastructure
2
answers
28
Tree DFS
int func(Node root) { if(root == NULL) return 0; else if(root>left == NULL && root>right == NULL) return 2; else return(3 + func(root>left) + func(root>right)); } Above code is executed on the following rooted tree. What will be the output?
commented
4 days
ago
in
Programming

79
views
dfs
algorithms
datastructure
binarytree
0
answers
29
TOC  Pls verify its solution
Please go through its solution. I am unable to understand how L1 and L2 are decidable.
commented
4 days
ago
in
Theory of Computation

38
views
6
answers
30
GATE 2016141
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. Head(Q) returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly Top (S) returns the element at the top of $S$ without removing ... ); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
commented
4 days
ago
in
DS

1.6k
views
gate20161
datastructure
queues
difficult
numericalanswers
7
answers
31
GATE20152_7
The minimum number of JK flipflops required to construct a synchronous counter with the count sequence (0, 0, 1, 1, 2, 2, 3, 3, 0, 0, ...) is _______.
commented
4 days
ago
in
Digital Logic

2.8k
views
gate20152
digitallogic
counter
normal
numericalanswers
2
answers
32
Complexity2
An array of size n. Find the time complexity to insert a new value before an element e in the array? a)O(n) b)O(log n) c)O(1)
commented
4 days
ago
in
Programming

75
views
0
answers
33
Array
An array is of size n. Find the time complexity to insert a new value before an element e in the array? (A) O(N) (B) O(log N) (C) O(1) (D) O(N2)
closed
4 days
ago
in
DS

31
views
arrays
timecomplexity
2
answers
34
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
0
answers
35
computer organization
A CPU, which addresses the data through its 5 registers in one of 14 different modes, is to be designed to support 10 arithmetic instructions, 15 logic instructions, 20 data moving instructions and 10 branch instructions of these instructions 20%, 60%, 60% ... operand type. What is the minimum size of CPU instruction word? (A)18 (B)19 (C)20 (D)21
comment edited
4 days
ago
in
CO & Architecture

18
views
1
answer
36
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
answer edited
4 days
ago
in
CO & Architecture

22
views
1
answer
37
MADE EASY TEST SERIES
answered
5 days
ago
in
Digital Logic

45
views
1
answer
38
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
answers
39
what is the probability that the mother could have had the very long or very short pregnancy
comment edited
5 days
ago
in
Probability

62
views
probability
engineeringmathematics
1
answer
40
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
18,898
questions
23,865
answers
51,932
comments
20,186
users