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 vizzard110
4
answers
1
GATE IT 2006 | Question: 22
When a coin is tossed, the probability of getting a Head is $p, 0 < p < 1$. Let $N$ be the random variable denoting the number of tosses till the first Head appears, including the toss where the Head appears. Assuming that successive tosses are independent, the expected value of $N$ is $\dfrac{1}{p}$ $\dfrac{1}{(1 - p)}$ $\dfrac{1}{p^{2}}$ $\dfrac{1}{(1 - p^{2})}$
When a coin is tossed, the probability of getting a Head is $p, 0 < p < 1$. Let $N$ be the random variable denoting the number of tosses till the first Head appears, incl...
9.4k
views
commented
Dec 13, 2020
Probability
gateit-2006
probability
binomial-distribution
expectation
normal
+
–
0
answers
2
Generating Function- Where to start?
Hello can anyone suggest good video/book to learn generating functions from?..i tried the nptel lecture..it has some audio lag. and i could not make much out of it..I am well versed in combinatorics but my calculus is weak.. Please suggest some resource that teaches generating functions from scratch
Hello can anyone suggest good video/book to learn generating functions from?..i tried the nptel lecture..it has some audio lag. and i could not make much out of it..I am ...
2.2k
views
commented
Dec 11, 2020
Combinatory
generating-functions
preparation
+
–
4
answers
3
GATE IT 2004 | Question: 53
An array of integers of size $n$ can be converted into a heap by adjusting the heaps rooted at each internal node of the complete binary tree starting at the node $\left \lfloor (n - 1) /2 \right \rfloor$ ... to construct a heap in this manner is $O(\log n)$ $O(n)$ $O (n \log \log n)$ $O(n \log n)$
An array of integers of size $n$ can be converted into a heap by adjusting the heaps rooted at each internal node of the complete binary tree starting at the node $\left ...
10.8k
views
commented
Nov 21, 2020
DS
gateit-2004
data-structures
binary-heap
normal
+
–
2
answers
4
GATE CSE 2007 | Question: 73
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... the execution of the instruction INC R3 , what return address will be pushed on to the stack? $1005$ $1020$ $1024$ $1040$
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ are the general purpose registers.$$\begin{array}{|l|l|l|c|} \hline & \text {Instruction} & \...
10.0k
views
commented
Nov 8, 2020
CO and Architecture
gatecse-2007
co-and-architecture
machine-instruction
interrupts
normal
+
–
3
answers
5
GATE IT 2007 | Question: 49
Consider the following grammars. Names representing terminals have been specified in capital letters. ... $G_1$ and $G_2$ are regular Both $G_1$ and $G_2$ are context-free but neither of them is regular
Consider the following grammars. Names representing terminals have been specified in capital letters.$$\begin{array}{llll}\hline \text{$G1$ :} & \text{stmnt} & \text{$\...
12.8k
views
commented
Oct 29, 2020
Theory of Computation
gateit-2007
theory-of-computation
context-free-language
normal
+
–
3
answers
6
GATE CSE 1999 | Question: 2.6
For the schedule given below, which of the following is correct: ... schedule is not serializable but can occur in a scheme using 2PL protocol This schedule is not serializable and cannot occur in a scheme using 2PL protocol
For the schedule given below, which of the following is correct:$$\begin{array}{ll} \text{1} & \text{Read A} & \text{} \\ \text{2} & \text{} & \text{Read B} \\ \text{3...
14.3k
views
commented
Oct 24, 2020
Databases
gate1999
databases
transaction-and-concurrency
normal
+
–
4
answers
7
GATE CSE 1994 | Question: 2.2
On the set $N$ of non-negative integers, the binary operation ______ is associative and non-commutative.
On the set $N$ of non-negative integers, the binary operation ______ is associative and non-commutative.
5.9k
views
commented
Oct 23, 2020
Set Theory & Algebra
gate1994
set-theory&algebra
normal
group-theory
binary-operation
fill-in-the-blanks
+
–
1
answer
8
lattice
Theorem :- A lattice L is not a distributive lattice if and only if L has a sublattice which is isomorphic L1(kite structure) or L2(Pantagon structure). Anyone, please provide an example. I am not able to understand the theorem.
Theorem :- A lattice L is not a distributive lattice if and only if L has a sublattice which is isomorphic L1(kite structure) or L2(Pantagon structure).Anyone, please p...
1.1k
views
commented
Oct 23, 2020
Set Theory & Algebra
set-theory&algebra
lattice
+
–
3
answers
9
GATE CSE 2017 Set 2 | Question: 18
Consider socket API on a Linux machine that supports connected UDP sockets. A connected UDP socket is a UDP socket on which connect function has already been called. Which of the following statements is/are CORRECT? A connected UDP socket can be used to communicate with multiple ... $\text{I}$ and $\text{II}$ Neither $\text{I}$ nor $\text{II}$
Consider socket API on a Linux machine that supports connected UDP sockets. A connected UDP socket is a UDP socket on which connect function has already been called. Whic...
15.1k
views
commented
Oct 21, 2020
Computer Networks
gatecse-2017-set2
computer-networks
udp
+
–
5
answers
10
GATE CSE 2019 | Question: 11
Consider the following two statements about database transaction schedules: Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable ... the above statements is/are TRUE? I only II only Both I and II Neither I nor II
Consider the following two statements about database transaction schedules:Strict two-phase locking protocol generates conflict serializable schedules that are also recov...
17.6k
views
commented
Oct 12, 2020
Databases
gatecse-2019
databases
transaction-and-concurrency
1-mark
+
–
2
answers
11
TOC -Number of Equivalence Classes
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivalence classes here...
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivale...
12.0k
views
commented
Oct 9, 2020
Theory of Computation
theory-of-computation
equivalence-class
myhill-nerode
+
–
4
answers
12
GATE CSE 1993 | Question: 17
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
8.2k
views
commented
Jun 18, 2020
Set Theory & Algebra
gate1993
set-theory&algebra
easy
set-theory
descriptive
+
–
4
answers
13
GATE CSE 2011 | Question: 38
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with different number of total scalar multiplications. For example when multiplied as ... $t=80$, then the minimum number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with d...
15.6k
views
commented
Jan 23, 2020
Algorithms
gatecse-2011
algorithms
dynamic-programming
normal
+
–
7
answers
14
GATE CSE 2019 | Question: GA-1
The expenditure on the project _____ as follows: equipment Rs.$20$ lakhs, salaries Rs.$12$ lakhs, and contingency Rs.$3$ lakhs. break down break breaks down breaks
The expenditure on the project _____ as follows: equipment Rs.$20$ lakhs, salaries Rs.$12$ lakhs, and contingency Rs.$3$ lakhs.break downbreakbreaks downbreaks
9.2k
views
commented
Jan 23, 2020
Verbal Aptitude
gatecse-2019
general-aptitude
verbal-aptitude
most-appropriate-word
1-mark
+
–
2
answers
15
Hashing
Consider a hash table with 8 slots that uses chaining for collision resolution .The table is initially empty .what is probability that after 4 keys inserted at least a chain of 3 created?
Consider a hash table with 8 slots that uses chaining for collision resolution .The table is initially empty .what is probability that after 4 keys inserted at least a ch...
860
views
answered
Jan 18, 2020
5
answers
16
GATE CSE 1996 | Question: 1.3
Suppose $X$ and $Y$ are sets and $|X| \text{ and } |Y|$ are their respective cardinality. It is given that there are exactly $97$ functions from $X$ to $Y$. From this one can conclude that $|X| =1, |Y| =97$ $|X| =97, |Y| =1$ $|X| =97, |Y| =97$ None of the above
Suppose $X$ and $Y$ are sets and $|X| \text{ and } |Y|$ are their respective cardinality. It is given that there are exactly $97$ functions from $X$ to $Y$. From this one...
8.7k
views
commented
Jan 14, 2020
Set Theory & Algebra
gate1996
set-theory&algebra
functions
normal
+
–
5
answers
17
GATE CSE 2007 | Question: 21
How many different non-isomorphic Abelian groups of order $4$ are there? $2$ $3$ $4$ $5$
How many different non-isomorphic Abelian groups of order $4$ are there?$2$$3$$4$$5$
19.6k
views
commented
Jan 11, 2020
Set Theory & Algebra
gatecse-2007
group-theory
normal
+
–
7
answers
18
ISRO2014-32
What is the output of the following C program? #include<stdio.h> void main(void){ int shifty; shifty=0570; shifty=shifty>>4; shifty=shifty<<6; printf("The value of shifty is %o \n",shifty); } The value of shifty is 15c0 The value of shifty is 4300 The value of shifty is 5700 The value of shifty is 2700
What is the output of the following C program?#include<stdio.h void main(void){ int shifty; shifty=0570; shifty=shifty>>4; shifty=shifty<<6; printf("The value of shifty i...
8.1k
views
commented
Dec 29, 2019
Programming in C
programming-in-c
isro2014
output
+
–
1
answer
19
predicate logic
Recall that a predicate logic statement is contingent if its truth value depends on the choice of the universe and on the interpretations of the predicate symbol S and the constant symbol b involved. Consider the following predicate logic statements in which b, x ... - Contingent - Always false (C) Always true - Contingent - Contingent (D) Contingent - Always true - Always false
Recall that a predicate logic statement is contingent if its truth value depends on the choice of the universe and on the interpretations of the predicate symbol S and th...
664
views
commented
Dec 29, 2019
Mathematical Logic
mathematical-logic
propositional-logic
first-order-logic
discrete-mathematics
two-place-predicate
+
–
3
answers
20
dual of function
Dual of EX-OR is equal to (A) NAND (B) NOR (C) EX-NOR (D) None of these
Dual of EX-OR is equal to(A) NAND(B) NOR(C) EX-NOR(D) None of these
8.2k
views
commented
Dec 29, 2019
Digital Logic
dual-function
boolean-algebra
+
–
3
answers
21
GATE CSE 1987 | Question: 2n
State whether the following statements are TRUE or FALSE: A relation $r$ with schema $(X, Y)$ satisfies the function dependency $X \rightarrow Y$, The tuples $\langle 1, 2\rangle$ and $\langle 2, 2 \rangle$ can both be in $r$ simultaneously.
State whether the following statements are TRUE or FALSE:A relation $r$ with schema $(X, Y)$ satisfies the function dependency $X \rightarrow Y$, The tuples $\langle 1, 2...
3.6k
views
commented
Dec 26, 2019
Databases
gate1987
databases
database-normalization
true-false
+
–
1
answer
22
GATE CSE 1990 | Question: 13b
Consider a hash table with chaining scheme for overflow handling: What is the worst-case timing complexity of inserting $n$ elements into such a table? For what type of instance does this hashing scheme take the worst-case time for insertion?
Consider a hash table with chaining scheme for overflow handling:What is the worst-case timing complexity of inserting $n$ elements into such a table?For what type of ins...
2.4k
views
commented
Dec 24, 2019
Algorithms
gate1990
hashing
algorithms
descriptive
+
–
2
answers
23
GATE CSE 1996 | Question: 13
Let $Q=\left( \left\{q_1,q_2 \right\}, \left\{a,b\right \}, \left\{a,b,\bot \right\}, \delta, \bot, \phi \right)$ ... $\delta(q_2,b,b) = \left\{(q_2, \epsilon)\right\}$ $\delta(q_2,\epsilon,\bot) = \left\{(q_2, \epsilon)\right\}$
Let $Q=\left( \left\{q_1,q_2 \right\}, \left\{a,b\right \}, \left\{a,b,\bot \right\}, \delta, \bot, \phi \right)$ be a pushdown automaton accepting by empty stack for the...
5.6k
views
commented
Dec 20, 2019
Theory of Computation
gate1996
theory-of-computation
pushdown-automata
normal
descriptive
+
–
1
answer
24
TIFR CSE 2012 | Part A | Question: 18
A large community practices birth control in the following peculiar fashion. Each set of parents continues having children until a son is born; then they stop. What is the ratio of boys to girls in the community if, in the absence of birth control, 51% of the babies are born male? $51:49$ $1:1$ $49:51$ $51:98$ $98:51$
A large community practices birth control in the following peculiar fashion. Each set of parents continues having children until a son is born; then they stop. What is th...
1.2k
views
commented
Dec 20, 2019
Quantitative Aptitude
tifr2012
quantitative-aptitude
ratio-proportions
+
–
2
answers
25
GATE CSE 1990 | Question: 7-c
A certain moving arm disk-storage device has the following specifications: Number of tracks per surface $= 404$ Track storage capacity $=130030$ bytes. Disk speed $=3600$ rpm Average seek time $=30$ m secs. Estimate the average latency, the disk storage capacity, and the data transfer rate.
A certain moving arm disk-storage device has the following specifications:Number of tracks per surface $= 404$Track storage capacity $=130030$ bytes.Disk speed $=3600$ rp...
8.1k
views
commented
Dec 19, 2019
Operating System
gate1990
operating-system
disk
descriptive
+
–
6
answers
26
GATE CSE 1993 | Question: 11
In the three-level memory hierarchy shown in the following table, $p_i$ denotes the probability that an access request will refer to $M_i$ ... a page swap is $T_i$. Calculate the average time $t_A$ required for a processor to read one word from this memory system.
In the three-level memory hierarchy shown in the following table, $p_i$ denotes the probability that an access request will refer to $M_i$.$$\begin{array}{|c|c|c|c|} \hli...
11.0k
views
commented
Dec 4, 2019
CO and Architecture
gate1993
co-and-architecture
cache-memory
normal
descriptive
+
–
5
answers
27
GATE CSE 2006 | Question: 23
$F$ is an $n\times n$ real matrix. $b$ is an $n\times 1$ real vector. Suppose there are two $n\times 1$ vectors, $u$ and $v$ such that, $u ≠ v$ and $Fu = b, Fv = b$. Which one of the following statements is false? Determinant of $F$ is zero. There are an infinite number of solutions to $Fx = b$ There is an $x≠0$ such that $Fx = 0$ $F$ must have two identical rows
$F$ is an $n\times n$ real matrix. $b$ is an $n\times 1$ real vector. Suppose there are two $n\times 1$ vectors, $u$ and $v$ such that, $u ≠ v$ and $Fu = b, Fv = b$. Wh...
10.1k
views
commented
Nov 11, 2019
Linear Algebra
gatecse-2006
linear-algebra
normal
matrix
+
–
12
answers
28
GATE CSE 2009 | Question: 44
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The ...
37.1k
views
commented
Oct 31, 2019
Databases
gatecse-2009
databases
b-tree
normal
+
–
1
answer
29
left biasing and right biasing in B+ tree insertion
Difference between left biasing and right biasing in B+ tree insertion, Rules to be followed for left and right biasing , Kindly explain with an example ?
Difference between left biasing and right biasing in B+ tree insertion, Rules to be followed for left and right biasing , Kindly explain with an example ?
6.4k
views
commented
Oct 31, 2019
Databases
databases
b-tree
tree
+
–
5
answers
30
GATE CSE 1997 | Question: 19
A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The root (if it is an internal node) has between $1$ and $2d$ key values. The distance ... $4$ with $52$ leaves? What is the minimum number of leaves in a $B^+$-tree of order $d$ and height $h(h\geq 1)$?
A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The roo...
15.0k
views
commented
Oct 30, 2019
Databases
gate1997
databases
b-tree
normal
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register