Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by tusharp
13
answers
1
GATE IT 2007 | Question: 29
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$
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 gi...
39.4k
views
comment edited
Aug 12, 2019
DS
gateit-2007
data-structures
binary-search-tree
normal
+
–
6
answers
2
GATE CSE 2007 | Question: 60
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? ... immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.
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 ...
23.7k
views
commented
Apr 25, 2019
Databases
gatecse-2007
databases
relational-calculus
normal
+
–
2
answers
3
GATE CSE 2016 Set 1 | Question: 21
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$
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$
7.2k
views
commented
Apr 25, 2019
Databases
gatecse-2016-set1
databases
database-normalization
easy
+
–
5
answers
4
CMI2012-A-07
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}$
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}$
2.0k
views
commented
Apr 24, 2019
Probability
cmi2012
probability
+
–
5
answers
5
GATE CSE 2017 Set 1 | Question: 41
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. { ... Which of the above queries are safe? I and II only I and III only II and III only I, II and III
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 relatio...
25.6k
views
commented
Apr 24, 2019
Databases
gatecse-2017-set1
databases
relational-calculus
safe-query
normal
+
–
11
answers
6
GATE CSE 2005 | Question: 52
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}$
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 probabili...
8.7k
views
commented
Apr 24, 2019
Probability
gatecse-2005
probability
binomial-distribution
easy
+
–
6
answers
7
GATE CSE 2000 | Question: 5
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 ... n distinct elements so that at least one element occurs exactly twice? How many multisets can be constructed from n distinct elements?
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 repetiti...
8.0k
views
commented
Apr 22, 2019
Combinatory
gatecse-2000
combinatory
normal
descriptive
+
–
2
answers
8
Rosen 7e Exercise-6.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?
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?
1.8k
views
commented
Apr 21, 2019
Combinatory
kenneth-rosen
discrete-mathematics
combinatory
+
–
6
answers
9
GATE CSE 1999 | Question: 1.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
Which of the following disk scheduling strategies is likely to give the best throughput?Farthest cylinder nextNearest cylinder nextFirst come first servedElevator algorit...
11.2k
views
comment edited
Apr 20, 2019
Operating System
gate1999
operating-system
disk-scheduling
normal
+
–
6
answers
10
GATE CSE 2014 Set 1 | Question: 28
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 one-way 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 ________.
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 one-way latency of $50$ $\...
27.3k
views
commented
Apr 19, 2019
Computer Networks
gatecse-2014-set1
computer-networks
sliding-window
numerical-answers
normal
+
–
2
answers
11
GATE IT 2008 | Question: 68
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
Which of the following statements are TRUE?S1: TCP handles both congestion and flow controlS2: UDP handles congestion but not flow controlS3: Fast retransmit deals wit...
16.0k
views
commented
Apr 16, 2019
Computer Networks
gateit-2008
computer-networks
network-protocols
normal
+
–
9
answers
12
GATE CSE 2014 Set 3 | Question: 25
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 ... $\text{ii}$ only $\text{ii}$ and $\text{iii}$ only $\text{i, ii}$ and $\text{iii}$
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...
16.5k
views
commented
Apr 16, 2019
Computer Networks
gatecse-2014-set3
computer-networks
ip-packet
normal
+
–
4
answers
13
GATE IT 2005 | Question: 74
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 ... $[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)$
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 ...
8.9k
views
commented
Apr 15, 2019
Computer Networks
gateit-2005
computer-networks
error-detection
probability
normal
+
–
4
answers
14
GATE CSE 1992 | Question: 01-i
The Boolean function in sum of products form where K-map is given below (figure) is _______
The Boolean function in sum of products form where K-map is given below (figure) is _______
5.3k
views
commented
Apr 14, 2019
Digital Logic
gate1992
digital-logic
k-map
normal
fill-in-the-blanks
+
–
3
answers
15
GATE CSE 1987 | Question: 16-a
A Boolean function $f$ is to be realized only by $\text{NOR}$ gates. Its $K$-map is given below: The realization is
A Boolean function $f$ is to be realized only by $\text{NOR}$ gates. Its $K$-map is given below:The realization is
4.2k
views
commented
Apr 14, 2019
Digital Logic
gate1987
digital-logic
k-map
+
–
9
answers
16
GATE CSE 2018 | Question: 22
Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered $\text{D}$ flip-flops. 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 ____
Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered $\text{D}$ flip-flops.The number of states in the state trans...
23.2k
views
commented
Apr 14, 2019
Digital Logic
gatecse-2018
digital-logic
flip-flop
numerical-answers
normal
1-mark
+
–
4
answers
17
GATE CSE 2014 Set 3 | Question: 8
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 Flip-flop
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...
7.2k
views
comment edited
Apr 13, 2019
Digital Logic
gatecse-2014-set3
digital-logic
easy
digital-circuits
+
–
6
answers
18
GATE CSE 2003 | Question: 90
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- ... order of data value the elements in the list are sorted in non-increasing order of data value not all elements in the list have the same data value
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 -...
18.2k
views
commented
Apr 12, 2019
DS
gatecse-2003
data-structures
linked-list
normal
+
–
8
answers
19
GATE CSE 2004 | Question: 36
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
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 $\t...
31.1k
views
commented
Apr 12, 2019
DS
gatecse-2004
data-structures
linked-list
normal
+
–
1
answer
20
made easy test series - lossless join and dependency preserving
How is A answer?
How is A answer?
1.0k
views
answered
Apr 12, 2019
Databases
lossless-decomposition
databases
dependency-preserving
database-normalization
+
–
1
answer
21
Algorithm Time Complexity-Self 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"); } } } }
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...
1.3k
views
commented
Apr 12, 2019
Algorithms
algorithms
time-complexity
self-doubt
+
–
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?
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 theseIsnot 1) as same as given expression?
578
views
comment edited
Apr 11, 2019
Theory of Computation
finite-automata
+
–
1
answer
23
GATE IT 2004 | Question: 52
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$
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 ...
6.2k
views
commented
Apr 10, 2019
DS
gateit-2004
data-structures
normal
stack
+
–
1
answer
24
Madeeasy Discrete Maths notes
How many 5 letter word possible having atleast 2 a's ?
How many 5 letter word possible having atleast 2 a's ?
936
views
commented
Apr 9, 2019
Combinatory
madeeasy-notes
discrete-mathematics
combinatory
+
–
6
answers
25
GATE CSE 2015 Set 1 | Question: 16
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? $\varnothing \in 2^{A}$ $\varnothing \subseteq 2^{A}$ ... I and III only II and III only I, II and III only I, II and IV only
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?$\varnoth...
15.6k
views
commented
Apr 9, 2019
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
set-theory
normal
+
–
17
answers
26
GATE CSE 2016 Set 2 | Question: 40
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$.
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 _________.No...
50.0k
views
commented
Apr 8, 2019
DS
gatecse-2016-set2
data-structures
binary-search-tree
normal
numerical-answers
+
–
4
answers
27
GATE CSE 2005 | Question: 5
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
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...
20.8k
views
commented
Apr 8, 2019
DS
gatecse-2005
data-structures
array
easy
+
–
5
answers
28
GATE CSE 2010 | Question: 30
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 ... 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
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...
82.4k
views
comment edited
Apr 8, 2019
Mathematical Logic
gatecse-2010
mathematical-logic
easy
first-order-logic
+
–
2
answers
29
GATE IT 2008 | Question: 52
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 < ... $\text{b e}$ $\text{c f}$ $\text{a c}$ $\text{e b}$ $\text{d f}$ $\text{a e}$ $\text{d c}$ $\text{b f}$
C program is given below:# include <stdio.h int main () { int i, j; char a [3] = {{'a', 'b', 'c'}, {'d', 'e', 'f'}}; char b [3] ; char *p = *b; for (i = 0; i < 2; i++)...
10.5k
views
commented
Apr 7, 2019
Programming in C
gateit-2008
programming
programming-in-c
normal
array
+
–
8
answers
30
GATE CSE 2015 Set 3 | Question: 7
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$
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 pro...
16.3k
views
commented
Apr 7, 2019
Programming in C
gatecse-2015-set3
programming
programming-in-c
normal
array
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register