The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by tusharp
User tusharp
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User tusharp
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
7
answers
1
GATE2007IT29
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$
comment edited
Aug 12
in
DS

12k
views
gate2007it
datastructure
binarysearchtree
normal
6
answers
2
GATE200760
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? ... no immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.
commented
Apr 25
in
Databases

7.5k
views
gate2007
databases
relationalcalculus
normal
2
answers
3
GATE2016121
Which of the following is NOT a superkey in a relational schema with attributes $V,W,X,Y,Z$ and primary key $V\;Y$? $VXYZ$ $VWXZ$ $VWXY$ $VWXYZ$
commented
Apr 25
in
Databases

2.1k
views
gate20161
databases
databasenormalization
easy
4
answers
4
CMI2012A07
A man has three cats. At least one is male. What is the probability that all three are male? $\frac{1}{2}$ $\frac{1}{7}$ $\frac{1}{8}$ $\frac{3}{8}$
commented
Apr 24
in
Probability

459
views
cmi2012
probability
4
answers
5
GATE2017141
Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relation EMP. Consider the following queries on the database expressed in tuple relational calculus. {$t$  $\exists$u ... ]))} Which of the above queries are safe? I and II only I and III only II and III only I, II and III
commented
Apr 24
in
Databases

5.9k
views
gate20171
databases
relationalcalculus
safequery
normal
7
answers
6
GATE200552
A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending on outcomes head and tail, respectively. The probability that two such randomly generated strings are not identical is: $\frac{1}{2^n}$ $1  \frac{1}{n}$ $\frac{1}{n!}$ $1  \frac{1}{2^n}$
commented
Apr 24
in
Probability

1.8k
views
gate2005
probability
binomialdistribution
easy
4
answers
7
GATE20005
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetitions. What is the number of multisets of size $4$ that can be constructed from n distinct elements so that at least one element occurs exactly twice? How many multisets can be constructed from n distinct elements?
commented
Apr 22
in
Combinatory

1.5k
views
gate2000
permutationandcombination
normal
descriptive
1
answer
8
Rosen 7e Exercise6.5 question 45.b page 433
How many ways can n books be placed on k distinguishable shelves if no two books are the same, and the positions of the books on the shelves matter?
commented
Apr 21
in
Combinatory

197
views
kennethrosen
discretemathematics
permutationandcombination
6
answers
9
GATE19991.10
Which of the following disk scheduling strategies is likely to give the best throughput? Farthest cylinder next Nearest cylinder next First come first served Elevator algorithm
comment edited
Apr 20
in
Operating System

2.8k
views
gate1999
operatingsystem
diskscheduling
normal
4
answers
10
GATE2014128
Consider a selective repeat sliding window protocol that uses a frame size of $1$ $\text{KB}$ to send data on a $1.5$ $\text{Mbps}$ link with a oneway latency of $50$ $\text{msec}$. To achieve a link utilization of $60\%$, the minimum number of bits required to represent the sequence number field is ________.
commented
Apr 19
in
Computer Networks

9k
views
gate20141
computernetworks
slidingwindow
numericalanswers
normal
2
answers
11
GATE2008IT68
Which of the following statements are TRUE? S1: TCP handles both congestion and flow control S2: UDP handles congestion but not flow control S3: Fast retransmit deals with congestion but not flow control S4: Slow start mechanism deals with both congestion and flow control $S1$, $S2$ and $S3$ only $S1$ and $S3$only $S3$and $S4$ only $S1$, $S3$ and $S4$ only
commented
Apr 16
in
Computer Networks

3.8k
views
gate2008it
computernetworks
networkprotocols
normal
8
answers
12
GATE2014325
Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches B, which of the following IP header field(s) may be different from that of the original datagram D? TTL Checksum ... $\text{i}$ and $\text{ii}$ only $\text{ii}$ and $\text{iii}$ only $\text{i, ii}$ and $\text{iii}$
commented
Apr 16
in
Computer Networks

4.9k
views
gate20143
computernetworks
ippacket
normal
4
answers
13
GATE2005IT74
In a communication network, a packet of length $L$ bits takes link $L_1$ with a probability of $p_1$ or link $L_2$ with a probability of $p_2$. Link $L_1$ and $L_2$ have bit error probability of $b_1$ and $b_2$ respectively. The probability that the packet will be received without error via ... $[1  (b_1 + b_2)^L]p_1p_2$ $(1  b_1)^L (1  b_2)^Lp_1p_2$ $1  (b_1^Lp_1 + b_2^Lp_2)$
commented
Apr 15
in
Computer Networks

2.4k
views
gate2005it
computernetworks
errordetection
probability
normal
4
answers
14
GATE199201i
The Boolean function in sum of products form where Kmap is given below (figure) is _______
commented
Apr 14
in
Digital Logic

1.4k
views
gate1992
digitallogic
kmap
normal
4
answers
15
GATE198716a
A Boolean function $f$ is to be realized only by $NOR$ gates. Its $Kmap$ is given below: The realization is
commented
Apr 14
in
Digital Logic

1k
views
gate1987
digitallogic
kmap
6
answers
16
GATE201822
Consider the sequential circuit shown in the figure, where both flipflops used are positive edgetriggered D flipflops. The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of "in" is ____
commented
Apr 14
in
Digital Logic

5k
views
gate2018
digitallogic
flipflop
numericalanswers
normal
3
answers
17
GATE201438
Consider the following combinational function block involving four Boolean variables $x,\:y,\:a,\:b$ where $x,\:a,\:b$ are inputs and $y$ is the output. f(x, a, b, y) { if(x is 1) y = a; else y = b; } Which one of the following digital logic blocks is the most suitable for implementing this function? Full adder Priority encoder Multiplexor Flipflop
comment edited
Apr 13
in
Digital Logic

1.7k
views
gate20143
digitallogic
easy
digitalcircuits
3
answers
18
GATE200390
Consider the function $f$ defined below. struct item { int data; struct item * next; }; int f(struct item *p) { return ((p == NULL)  (p>next == NULL) ((p>data <= p >next > data) && f(p>next) ... decreasing order of data value the elements in the list are sorted in nonincreasing order of data value not all elements in the list have the same data value
commented
Apr 12
in
DS

3.5k
views
gate2003
datastructure
linkedlists
normal
7
answers
19
GATE200436
A circularly linked list is used to represent a Queue. A single variable $p$ is used to access the Queue. To which node should $p$ point such that both the operations $\text{enQueue}$ and $\text{deQueue}$ can be performed in constant time? rear node front node not possible with a single pointer node next to front
commented
Apr 12
in
DS

6.4k
views
gate2004
datastructure
linkedlists
normal
1
answer
20
made easy test series  lossless join and dependency preserving
How is A answer?
answered
Apr 12
in
Databases

92
views
losslessdecomposition
databases
dependencypreserving
functionaldependencies
0
answers
21
Algorithm Time ComplexitySelf Doubt
What is the best case and worst case of the algorithm? And when will best case and worst case will happen?? int main() { for(i=1 ; i<=n ; i++) { if(n%i == 0) { for(j=1 ; j<=n ; j++) { printf("Hello"); } } } }
commented
Apr 12
in
Algorithms

185
views
algorithms
timecomplexity
selfdoubt
1
answer
22
Allen Career Institute:Regular Expression
The regular expression 0*(10*)* denote the same set as (1) (1*0)*1* (2) 0+(0+10)* (3) (0+1)*10(0+1)* (4) None of these Isnot 1) as same as given expression?
comment edited
Apr 11
in
Theory of Computation

81
views
finiteautomata
1
answer
23
GATE2004IT52
A program attempts to generate as many permutations as possible of the string, '$abcd$' by pushing the characters $a, b, c, d$ in the same order onto a stack, but it may pop off the top character at any time. Which one of the following strings CANNOT be generated using this program? $abcd$ $dcba$ $cbad$ $cabd$
commented
Apr 10
in
DS

1.1k
views
gate2004it
datastructure
normal
stack
1
answer
24
Madeeasy Discrete Maths notes
How many 5 letter word possible having atleast 2 a's ?
commented
Apr 9
in
Combinatory

114
views
madeeasynotes
discretemathematics
permutationandcombination
4
answers
25
GATE2015116
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE? $\phi \in 2^{A}$ $\phi \subseteq 2^{A}$ $\left\{5,\left\{6\right\}\right\} \in 2^{A}$ $\left\{5,\left\{6\right\}\right\} \subseteq 2^{A}$ I and III only II and III only I, II and III only I, II and IV only
commented
Apr 9
in
Set Theory & Algebra

5k
views
gate20151
settheory&algebra
sets
normal
14
answers
26
GATE2016240
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
commented
Apr 8
in
DS

12.6k
views
gate20162
datastructure
binarysearchtree
normal
numericalanswers
2
answers
27
GATE20055
A program $P$ reads in $500$ integers in the range $[0, 100]$ representing the scores of $500$ students. It then prints the frequency of each score above $50$. What would be the best way for $P$ to store the frequencies? An array of $50$ numbers An array of $100$ numbers An array of $500$ numbers A dynamically allocated array of $550$ numbers
commented
Apr 8
in
DS

3.8k
views
gate2005
datastructure
arrays
easy
3
answers
28
GATE201030
Suppose the predicate $F(x, y, t)$ is used to represent the statement that person $x$ can fool person $y$ at time $t$. Which one of the statements below expresses best the meaning of the formula, $\qquad∀x∃y∃t(¬F(x,y,t))$ Everyone can fool some person at some time No one can fool everyone all the time Everyone cannot fool some person all the time No one can fool some person at some time
comment edited
Apr 8
in
Mathematical Logic

4.6k
views
gate2010
mathematicallogic
easy
firstorderlogic
1
answer
29
GATE2008IT52
C program is given below: # include <stdio.h> int main () { int i, j; char a [2] [3] = {{'a', 'b', 'c'}, {'d', 'e', 'f'}}; char b [3] [2]; char *p = *b; for (i = 0; i < 2; i++) { for (j = 0; j < 3; j++) { *(p + 2*j + i) = a [i] [j]; } } } ... $\text{e f}$ $\text{a d}$ $\text{b e}$ $\text{c f}$ $\text{a c}$ $\text{e b}$ $\text{d f}$ $\text{a e}$ $\text{d c}$ $\text{b f}$
commented
Apr 7
in
Programming

2.3k
views
gate2008it
programming
programminginc
normal
5
answers
30
GATE201537
Consider the following C program segment. # include <stdio.h> int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '0'; printf("%s", s1); } What will be printed by the program? $12$ $120400$ $1204$ $1034$
commented
Apr 7
in
Programming

2.7k
views
gate20153
programming
programminginc
normal
1
answer
31
Kenneth Rosen Edition 7th Exercise 2.1 Question 9 (Page No. 125)
Determine whether each of these statements is true or false. $0$ $ \epsilon$ $\phi$ $\phi$ $\epsilon$ {$0$} {$0$} $ \subset$ {$ \phi$} $\phi$ $\subset$ {$0$} {$0$} $\epsilon$ {$0$} {$0$} $\subset$ {$0$} {$\phi$} $\subseteq$ {$\phi$}
answered
Apr 5
in
Mathematical Logic

47
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
1
answer
32
Kenneth Rosen Edition 7th Exercise 2.1 Question 10 (Page No. 125)
Determine whether each of these statements is true or false. $\phi$ $ \epsilon$ {$\phi$} $\phi$ $\epsilon$ {$\phi,$ { $\phi$}} {$\phi$} $ \epsilon$ {$ \phi$} {$\phi$} $\epsilon $ {{$\phi$}} {$\phi$} $\subset$ {$0$} {$0$} $\subset$ {$\phi$ , { $\phi$ }} {$\phi$} $\subset$ {{$\phi$ }, { $\phi$}}
answered
Apr 5
in
Set Theory & Algebra

15
views
kennethrosen
discretemathematics
settheory&algebra
1
answer
33
Self doubt
How is the problem.. Distribute 5 toys such that each of 3 child get atleast 1 Different from sum of 3 no. X+y+z=5 such that each digit >= 1. Plz explain ?
commented
Apr 5
in
Combinatory

63
views
permutationandcombination
6
answers
34
GATE2017127
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are nonreentrant, i.e., if a thread holds a lock $l$, then it cannot reacquire lock $l$ without releasing it. If a thread ... are: $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
comment edited
Apr 5
in
Operating System

9.5k
views
gate20171
operatingsystem
processsynchronization
normal
1
answer
35
self doubtLONGEST MASK MATCHINGNETWORK LAYER
what is the intuition behing longest mask matching when different masks gives the same source ID for a given IP address??
answered
Apr 4
in
Computer Networks

31
views
5
answers
36
GATE201848
Consider the weights and values of items listed below. Note that there is only one unit of each item. $\begin{array}{ccc}\hline \textbf{Item number} & \textbf{Weight (in Kgs) }& \textbf{Value (in rupees)} \\\hline \text{$1$} & \text{$10 ... list. The total value of items picked by the greedy algorithm is denoted by $V_{greedy}$. The value of $V_{opt}V_{greedy}$ is ____
commented
Apr 2
in
Algorithms

5.1k
views
gate2018
algorithms
greedyalgorithm
numericalanswers
6
answers
37
GATE2016211
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex $t$ at a distance four from the root. If $t$ is the $n^{th}$ vertex in this BFS traversal, then the maximum possible value of $n$ is __________
commented
Apr 2
in
Algorithms

3k
views
gate20162
algorithms
graphalgorithms
normal
numericalanswers
1
answer
38
Self doubt
Is CONVOY Effect possible in "Longest job first" non preemptive scheduling policy ?
answered
Apr 1
in
Operating System

54
views
operatingsystem
1
answer
39
Peter Linz Edition 4 Exercise 3.1 Question 1 (Page No. 75)
Find all strings in $L((a + b) b (a + ab)^*)$ of length less than four.
answered
Apr 1
in
Theory of Computation

26
views
peterlinz
theoryofcomputation
regularexpressions
1
answer
40
PGEE sample paper
Choose the digital building blocks from the following list using which we can realize any boolean function. (A) 2to1 Multiplexer (B) 4to1 Multiplexer (C) 8to1 Multiplexer (D) 16to1 Multiplexer (E) None of the above
commented
Mar 31
in
Digital Logic

629
views
iiithpgee
booleanalgebra
multiplexer
50,645
questions
56,588
answers
195,788
comments
101,846
users