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 manu00x
User manu00x
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User manu00x
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
virtual gate test series
answered
3 days
ago
in
Digital Logic

29
views
+1
vote
2
Linked List
Suppose p and q are 2 nodes in linked list, where p pointing to head node and q pointing to next to head node. Now, chk this condition while(A) { if(p==q)exit(0); p=p>next; q=(q>next)?(q>next>next) ... next? And what should be value of A, so that this while loop satisfies the condition that this linked list satisfies the condition for a loop?
answered
3 days
ago
in
DS

27
views
linkedlists
datastructure
+1
vote
3
up or down counter
answered
3 days
ago
in
Digital Logic

41
views
+3
votes
4
Computer Networks  Transport Layer  Sequence number wrap around
answered
4 days
ago
in
Computer Networks

37
views
computernetworks
tcp
sequencenumber
transportlayer
0
votes
5
TCP and UDP
Why TCP requires three way handshake why not two way is sufficient.. What is the actual use of SYN packet
answered
5 days
ago
in
Computer Networks

49
views
0
votes
6
State True or False: Classes of Grammar and respective automata
answered
Oct 3
in
Theory of Computation

52
views
theoryofcomputation
regularexpressions
regular
finiteautomata
+2
votes
7
self doubt
there is a proof for equivalence of empty stack and final state but what about the prefix property cases empty stack cant accept regular languages which donot accept the prefix property isnt it less powerful than the acceptance by final state ?? what kind of equivalence they have ??
answered
Oct 3
in
Theory of Computation

24
views
theoryofcomputation
empty
stack
final
state
0
votes
8
doubt
C intersection P(C) != phir ?why? (phi is subset of every set)???
answered
Oct 3
in
Mathematical Logic

28
views
discretemathematics
+1
vote
9
Virtual gate
answered
Oct 3
in
Theory of Computation

46
views
0
votes
10
RSA CRYPTOSYSTEM
answered
Oct 3
in
Computer Networks

47
views
computernetworks
+1
vote
11
Data structure
Ttotal number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having a height of 4 are ??
answered
Oct 3
in
DS

111
views
0
votes
12
made easy test
answered
Oct 2
in
Algorithms

51
views
+2
votes
13
Bit stuffing
answered
Oct 1
in
Computer Networks

131
views
bitstuffing
computernetworks
0
votes
14
Bit Stuffing
Answer is 4 or 6 ?
answered
Oct 1
in
Computer Networks

56
views
+2
votes
15
Matrix Chain
Total no. of ways to perform matrix multiplication having 7 matrices is ? Total no. of ways to by which we could parenthesize 7 matrices is ? Does the above two questions are different or same ? Plz explain the answer.
answered
Oct 1
in
Algorithms

83
views
algorithms
dynamicprogramming
+2
votes
16
m array tree
A 3ary tree is a tree in Which every internal node has exactly three children. Now if the tree has n internal nodes then what will be the number of leaves________??
answered
Oct 1
in
DS

40
views
+1
vote
17
ace test
How mny relations they satisfy the property of equivalence relation as well as partial order over set A={1,2,3,4}.
answered
Sep 30
in
Set Theory & Algebra

49
views
0
votes
18
Depth first Search
What should be the answer?? Key is given as opttion B. . !! I was getting D) None
answered
Sep 30
in
Programming

121
views
0
votes
19
Livelock and Spinlock
State the difference between livelock and spinlock.
answered
Sep 30
in
Operating System

41
views
operatingsystem
processsynchronization
+1
vote
20
Resource preemption
Which of the following transitions are not possible? (Assume resource preemption is not allowed) A) 2 and 4 B) 3 and 5 C)4 and 5 D)3 and 5 if resource preemption is not allowed then answer should be A) but answer given is D) how it is possible?
answered
Sep 30
in
Operating System

36
views
operatingsystem
process
0
votes
21
What is the maximum speedup achieved in new pipeline system?
answered
Sep 29
in
CO & Architecture

85
views
co&architecture
pipelining
0
votes
22
Made easy practice book
If an input string w has n symbols and can be recognized by a mealy machine M1 and equivalent Moore machine M2 then number of output symbols by M1 and M2 are respectively?
answered
Sep 29
in
Theory of Computation

30
views
mealymooremachine
madeeasybooklet
0
votes
23
test series
consider a tùring mchine which accepts the empty language i.e TM = { (M)  M accepts empty language} the complement of the language that is generated by Turing machine is?
answered
Sep 29
in
Theory of Computation

24
views
theoryofcomputation
0
votes
24
Queue implementation using singly linked list
answered
Sep 28
in
Programming

30
views
+2
votes
25
madeeasytestseries computernetworks
answered
Sep 28
in
Computer Networks

72
views
madeeasytestseries
computernetworks
+1
vote
26
Pipeline Architecture (CSO)
Generally there are two formulas for finding out time taken by n jobs in a pipeline, time for processing n jobs = time taken by 1 job + (n1)*(time of the largest stage)  (1) here n is the no. of jobs/instructions needed ... Tp = Clock cycle time Both give different timings / values. So which one should be used when??? Please help... Thanks
answered
Sep 28
in
CO & Architecture

45
views
pipelining
co&architecture
+1
vote
27
Compiler_design_LL(1)
Given answer is 3. I am getting Two entries.Check it once.
answered
Sep 28
in
Compiler Design

41
views
ll1parser
0
votes
28
testseries
answered
Sep 27
in
Computer Networks

37
views
0
votes
29
#Operating System > #Paging
answered
Sep 27
in
Operating System

97
views
operatingsystem

paging
0
votes
30
#GATE #PAGING OS
Consider a paged virtual memory system with 32bit virtual address and 1KB pages. Each PTE requires 32 bits. It is desired to limit the page table size to one page. how many levels of page tables are required? Tables at two of the ... ^6 entries how many pages are possible? If the bottom level page table has 2^6 entries how many pages are possible?
answered
Sep 27
in
Operating System

50
views
ospaging
+1
vote
31
#Parsing
Grammar : E>T+E/T T>id/id*T/(E) Is grammar LL(2)?
answered
Sep 26
in
Compiler Design

28
views
contextfreegrammars
+2
votes
32
self doubt computer organization
answered
Sep 26
in
CO & Architecture

32
views
co&architecture
0
votes
33
internalfragmentation
Assume N segments in memory and a page size of P bytes. The wastage on account of internal fragmentation is:
answered
Sep 26
in
Operating System

20
views
fragmentation
0
votes
34
Register Direct and Indirect Addressing Mode
answered
Sep 26
in
CO & Architecture

65
views
addressingmodes
co&architecture
instructionformat
+3
votes
35
Compiler Design, Number Of Tokens
answered
Sep 25
in
Compiler Design

360
views
compilerdesign
tokens
lexeme
+1
vote
36
Finding number of tokens
Find the number of tokens in the below C statement: result = x > y ? "x is greater than y" : "x is less than or equal to y"; My doubt is should we consider the ternary operator "? :" as 1 token or two separate tokens "?" and ":" ??
answered
Sep 25
in
Compiler Design

63
views
compilerdesign
tokens
+1
vote
37
KENNETH rosen book excercise
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21 where 0 <= x1 <= 3 , 1 <= x2 < 4 and x3 >= 15 ?
answered
Sep 25
in
Combinatory

34
views
0
votes
38
Mygetuniv
Is it correct to say that prefix expression is merely the reverse of postfix expression
answered
Sep 25
in
Programming

35
views
+1
vote
39
Aggregate function
Answer given is C . But count will ignore the null values therefore using sum and count, result must be greater . Am i right??
answered
Sep 22
in
Databases

24
views
+2
votes
40
Discrete Mathematics  Quantifiers problem
answered
Sep 14
in
Mathematical Logic

114
views
discretemathematics
mathematicallogic
kennethrosen
propositionallogic
Page:
1
2
3
4
5
6
next »
27,249
questions
35,071
answers
83,728
comments
33,183
users