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 Sanket_
User Sanket_
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sanket_
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
ISRO201753
In a doubly linked list the number of pointers affected for an insertion operation will be 4 0 1 Depends on the nodes of doubly linked list
answered
May 8
in
DS

2.8k
views
isro2017
datastructure
linkedlists
badquestion
1
answer
2
What can you deduce?
The monthly rainfall chart based on 50 years of rainfall in Agra is shown in the following figure. Which of the following are true? (k percentile is the value such that k percent of the data fall below that value) (i) On average, it rains more in July than in December (ii) ... (A) (i) and (ii) (B) (i) and (iii) (C) (ii) and (iii) (D) (iii) and (iv)
answer selected
Feb 8
in
Numerical Ability

201
views
1
answer
3
E R model
why not b) option
asked
Feb 8
in
Databases

128
views
erdiagram
1
answer
4
Doubt about joins on keys
Consider the following relation: R (A B C) A primary key with 100 tuples. S (E F G) E primary key with 50 tuples. T (AE D) AE primary key with 80 tuples. U (D G H) H primary key with 10 tuples. The maximum number of possible records in the result of _______.
commented
Feb 3
in
Databases

224
views
databases
relationalalgebra
1
answer
5
number of cycles saved using operand forwarding
commented
Feb 2
in
CO & Architecture

136
views
1
answer
6
Madeeasy
commented
Jan 30
in
Operating System

66
views
operatingsystem
madeeasytestseries
0
answers
7
language of pda
i think it should be d) because it is not satisfying same no. of a's and b's constraint on some input like aa,bb.
asked
Jan 30
in
Theory of Computation

25
views
0
answers
8
sql Query
i am not getting Q3.
asked
Jan 30
in
Databases

21
views
1
answer
9
mux and flipflop
asked
Jan 30
in
Digital Logic

45
views
0
answers
10
no. of relations
commented
Jan 30
in
Databases

39
views
0
answers
11
OSbounded waiting
does B satisfy BW?
commented
Jan 28
in
Operating System

172
views
operatingsystem
0
answers
12
euler and ham cycle
Which of the following statements is true? Every complete graph contain Hamiltonian cycle Every complete graph contain Euler cycle Both (a) and (b) None of the above It should be none of the above because when no. of vertices are 2 it doesnt follow these conditions
asked
Jan 28
in
Graph Theory

84
views
1
answer
13
Turing Recognizable and Turing Decidable
answered
Jan 27
in
Theory of Computation

116
views
turingmachine
theoryofcomputation
decidability
1
answer
14
Made Easy
In a particular number system the cubic equation X^3+bX^2+cX190 has roots 5,8 and 9.What is the base of the no system?
commented
Jan 27
in
Digital Logic

126
views
madeeasytestseries
digitallogic
number
system
3
answers
15
madeeasy mock test2
Which of the following statement is true related to synchronization mechanism? a) If any solution is satisfying the progress condition, then it will not have any deadlock. b) Race condition occur if mutual exclusion is satisfied. c) Bounded waiting is always satisfied if there are only two processes. d) None.
answered
Jan 26
in
Operating System

261
views
processsynchronization
deadlock
0
answers
16
left outer join
Find the equivalent Tuple Relational Calculus query for the following: R ⟕ S , where R(A, B) and S(A, C) are the relations and ⟕ is the left outer join symbol in Relational Algebra.
asked
Jan 25
in
Databases

34
views
1
answer
17
Testbook
commented
Jan 18
in
Probability

88
views
0
answers
18
parse tree
Consider two binary operator ‘+’ and ‘–’ with the precendence of ‘+’ being lower than that of operator ‘–’.Operator ‘–’ is right associative while operator ‘+’ to left associative. What is the parse tree for expression (5 + 2 – 7 + 3 – 4)
asked
Jan 11
in
Programming

26
views
1
answer
19
made easy test series
answered
Jan 9
in
Computer Networks

86
views
madeeasytestseries
computernetworks
1
answer
20
viable prefix
asked
Jan 8
in
Compiler Design

94
views
1
answer
21
Reader Writer
commented
Jan 8
in
Operating System

42
views
os
1
answer
22
Made easy test
answered
Jan 6
in
Operating System

54
views
1
answer
23
critical section
getting A) given D)
answer selected
Jan 5
in
Operating System

57
views
2
answers
24
FLIP FLOP
plz make the waveform diagram for Q
answer selected
Jan 2
in
Digital Logic

63
views
1
answer
25
Operand forwarding
given13 my answer12 plz verify. I0 IF ID OF PO WO I1 IF ID OF PO PO WO I2 IF ID OF PO WO I3 IF ID OF PO PO PO PO WO 1 2 3 4 5 6 7 8 9 10 11 12
asked
Jan 2
in
CO & Architecture

94
views
0
answers
26
preorder complexity
time complexity to construct bst from preorder? a) O(n) b)O(nlogn) c)O(n^2) d)O(1) given O(nlogn) my doubt: there are two approaches one that gives O(nlogn) (by finding the inorder traversal) and the other that gives O(n ... max .. INT_MAX}. reference:http://www.geeksforgeeks.org/constructbstfromgivenpreordertraversa/ so shouldn't it be O(n) ?
commented
Jan 2
in
Algorithms

47
views
1
answer
27
errors
asked
Dec 30, 2016
in
Compiler Design

42
views
1
answer
28
connectivity
Consider a simple connected undirected graph G which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of edges graph will be disconnected? a)m – n + 2 b)$_{2}^{m}\textrm{C}n+2$ c)n – 2 d)None of the above
commented
Dec 26, 2016
in
Graph Theory

183
views
2
answers
29
Ethernet
What is the maximum theoretical percent utilization in a 802.3 LAN (that uses 10 base 5 cable) with 128 stations connected to five 500 meter segments. The data rate is 10 Mbps. Assume the frame size is 256 bytes and standard slot time is 51.2 μsec. (A) 70% (B) 90% (C) 80% (D) 60%
commented
Dec 25, 2016
in
Computer Networks

294
views
ethernet
lantechnologies
1
answer
30
CSMA/CD
A 1 KM long CSMA/CD with a propagation delay 5 microsec has 10 mbps bandwidth.Repeaters are not allowed in the system.Data bits of 224 ,header bits of 32 bits are in packet.One slot time is reserved for the sender to start its transmission ... =224 total time =2*slottime +2*Tp+Tt is this approach correct ? in the solution they are only considering 1 slot time
asked
Dec 25, 2016
in
Computer Networks

134
views
0
answers
31
Counting Semaphore v/s Binary Semaphore
commented
Dec 21, 2016
in
Operating System

342
views
semaphore
processsynchronization
operatingsystem
0
answers
32
complexity
Which of the following is correct? a)If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n))) b)If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n)) c)Both (a) and (b) d)None of the above ans given is b) but there is nothing given about functions so it is possible that there is some function like. f(n)=n and g(n)=n^(2*sinn) then we cannot say anything i think it should be d)
commented
Dec 21, 2016
in
Algorithms

36
views
2
answers
33
Linked List
A linked list of length at most n is maintained in circular array C[0:n1], clockwise or anticlock wise; two variables head and last are used to point to first and last element of the list respectively, for instance if linked list is of size x and if it is maintained in clock wise ... be done in O(1), O(1) time O(1), O(n) time O(n), O(1) time O(n), O(n) time
commented
Dec 19, 2016
in
Programming

129
views
0
answers
34
Confusion hashing
What is the average number of probs requires for unsuccessful search into an openaddress hash table with load factor α (assume uniform hashing) . there are two derivations given one leads to 1/(1α) and the other leads to 1/2(1+1/(1α)^2) plz explain the distinction ?
asked
Dec 19, 2016
in
Programming

42
views
1
answer
35
ROMno. of OR Gates
commented
Dec 18, 2016
in
Digital Logic

91
views
0
answers
36
pipeline
asked
Dec 16, 2016
in
CO & Architecture

32
views
1
answer
37
made easy
consider an instruction of indirect addressing mode. what are the number of memory references by the processor when an instruction is a computation that requires a single operand and when it is a branch instruction respectively?? According to me answer ... and two memory references for operand fetch as it is indirect. But solution says 3,2. can someone check??
answered
Dec 16, 2016
in
CO & Architecture

118
views
0
answers
38
Hazards
closed
Dec 15, 2016
in
CO & Architecture

32
views
2
answers
39
Probablity Problem
commented
Dec 15, 2016
in
Probability

164
views
engineeringmathematics
probability
3
answers
40
MADE EASY TEST SERIES
Suppose 10 processes P1 to P10 share 7 identical resource units which can be reserved and release 1 at are time the maximum resource requirement of a processs P i is SP where SP is greater then 0. The maximum value of that ensures deadlock does not occurs is ________ .
answered
Dec 8, 2016
in
Operating System

226
views
deadlock
27,290
questions
35,142
answers
83,926
comments
33,231
users