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
Answers by Sheshang
0
votes
1
Test by Bikram | Mock GATE | Test 2 | Question: 45
An experiment gives three mutually exclusive and collectively exhaustive events $X, Y, Z$ such that $P$\left ( X\right )$=$ $2P$\left ( Y\right )$ $=$ $3P$\left ( Z\right )$ Then $P$\left ( \bar{x} \right )$ is _______
An experiment gives three mutually exclusive and collectively exhaustive events $X, Y, Z$ such that$P$$\left ( X\right )$$=$ $2P$$\left ( Y\right )$ $=$ $3P$$\left ( Z\r...
683
views
answered
Jan 25, 2017
GATE
tbb-mockgate-2
numerical-answers
engineering-mathematics
probability
+
–
0
votes
2
Test by Bikram | Mock GATE | Test 2 | Question: 38
$S\rightarrow A0 B$ $A\rightarrow BB \mid 0$ $B\rightarrow AA \mid 1$ The number of terminal strings of length $5$ generated by the context-free grammar shown above is _______.
$S\rightarrow A0 B$$A\rightarrow BB \mid 0$$B\rightarrow AA \mid 1$ The number of terminal strings of length $5$ generated by the context-free grammar shown above is ____...
809
views
answered
Jan 25, 2017
Compiler Design
tbb-mockgate-2
numerical-answers
compiler-design
theory-of-computation
context-free-grammar
+
–
0
votes
3
Test by Bikram | Mock GATE | Test 2 | Question: 27
Let $T$ be a depth-first search tree of a connected undirected graph $G$. For each vertex $v$ of $T$, Let pre$\left ( v \right )$ be the number of nodes visited up to and including $v$ during a preorder traversal of $T$ ... is the lowest common ancestor of $u$ and $v$ in $T$, then $w = u$. II only III only I and II II and III
Let $T$ be a depth-first search tree of a connected undirected graph $G$. For each vertex $v$ of $T$,Let pre$\left ( v \right )$ be the number of nodes visited up to and ...
823
views
answered
Jan 25, 2017
GATE
tbb-mockgate-2
data-structures
graph-algorithms
depth-first-search
+
–
1
votes
4
Test by Bikram | Mock GATE | Test 2 | Question: 56
Choose the odd one out: $ab$ $ab$ $ab$ $pp$ $bb$ $qq$ $abc$ $cba$ $ba$ $ba$ $ba$
Choose the odd one out:$ab$ $ab$ $ab$$pp$ $bb$ $qq$$abc$ $cba$$ba$ $ba$ $ba$
921
views
answered
Jan 25, 2017
GATE
tbb-mockgate-2
analytical-aptitude
odd-one
+
–
0
votes
5
testbook
779
views
answered
Jan 16, 2017
Digital Logic
testbook-test-series
test-series
digital-logic
+
–
10
votes
6
GATE CSE 2011 | Question: 43
An $8\text{KB}$ direct-mapped write-back cache is organized as multiple blocks, each size of $32\text{-bytes}$. The processor generates $32\text{-bit}$ addresses. The cache controller contains the tag information for each cache block comprising of the ... the cache controller to store meta-data (tags) for the cache? $4864$ bits $6144$ bits $6656$ bits $5376$ bits
An $8\text{KB}$ direct-mapped write-back cache is organized as multiple blocks, each size of $32\text{-bytes}$. The processor generates $32\text{-bit}$ addresses. The cac...
12.5k
views
answered
Jan 1, 2017
CO and Architecture
gatecse-2011
co-and-architecture
cache-memory
normal
+
–
0
votes
7
Test by Bikram | Data Structures | Test 2 | Question: 30
Meena is working in an IT company as HR manager. She has a large list of potential candidates to be recruited which are all sorted by their names. But she found that due to a bug in software 'O' was ... What would be the appropriate algorithm to correct the list of candidate profiles? Quick Sort Heap Sort Insertion Sort Merge Sort
Meena is working in an IT company as HR manager. She has a large list of potential candidates to be recruited which are all sorted by their names. But she found that due ...
1.1k
views
answered
Dec 20, 2016
Programming in C
tbb-ds-2
+
–
4
votes
8
Test by Bikram | Data Structures | Test 2 | Question: 7
You are given a linked list, L, and another linked list, P, containing integers, sorted in ascending order. The operation print_lots(L,P) will print the elements in L that are in positions specified by P. For instance, if $P = 1, 3, 4, 6$, the first, ... of your routine function is ______________ ? $O( n^2 )$ $O(n)$ $O(n \log n)$ $O(\log n)$
You are given a linked list, L, and another linked list, P, containing integers, sorted in ascending order. The operation print_lots(L,P) will print the elements in L tha...
1.5k
views
answered
Dec 20, 2016
Programming in C
tbb-ds-2
+
–
1
votes
9
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 24
Consider two pipelines A and B. Pipeline A has $8$ stages with uniform stage delay of $2$ns. Pipeline B has $5$ stages with uniform stage delays of $3$ns. Time saved (in ns) by pipeline A compared to pipeline B to execute $100$ instructions is _____.
Consider two pipelines A and B. Pipeline A has $8$ stages with uniform stage delay of $2$ns. Pipeline B has $5$ stages with uniform stage delays of $3$ns. Time saved (in ...
305
views
answered
Dec 15, 2016
CO and Architecture
tbb-coa-1
co-and-architecture
numerical-answers
pipelining
speedup
+
–
5
votes
10
Test by Bikram | Databases | Test 1 | Question: 1
What is the minimum number of tables required to represent this E-R diagram in the relational model? Considering that for both R1 and R2 cardinality is $1:1$ $2$ $3$ $4$ $5$
What is the minimum number of tables required to represent this E-R diagram in the relational model? Considering that for both R1 and R2 cardinality is $1:1$$2$$3$$4$$5$...
1.3k
views
answered
Dec 14, 2016
Databases
tbb-dbms-1
+
–
2
votes
11
Test by Bikram | Databases | Test 1 | Question: 21
A transaction is in __________ state after the final statement has been executed. partially committed active committed aborted
A transaction is in __________ state after the final statement has been executed.partially committedactivecommittedaborted
634
views
answered
Dec 14, 2016
Databases
tbb-dbms-1
+
–
0
votes
12
Test by Bikram | Databases | Test 1 | Question: 17
This is an Instance of Sailors Relation ... S2.rating ) SELECT S.sname FROM Sailors S WHERE S.rating >ALL ( SELECT S2.rating FROM Sailors S2 WHERE S2.age < 21 )
This is an Instance of Sailors Relation$$\overset{\text{Sailors Table}} { \begin{array}{|l|l|} \hline \text{S_ID} & \text{S_Name} & \text{Rating} & \text{Age} \\ \hline 1...
985
views
answered
Dec 14, 2016
Databases
tbb-dbms-1
+
–
1
votes
13
Test by Bikram | Databases | Test 1 | Question: 5
Two transactions of $T1$ and $T2$ are given as follows: $T1: \text{R1(A) W1(A) R1(B) W1(B)}$ $T2 : \text{ R2(B) W2(B) R2(C) W2(C)}$ Total number of Conflict Serializable schedules formed by $T1$ and $T2$ are $2$ $70$ $54$ $12$
Two transactions of $T1$ and $T2$ are given as follows:$T1: \text{R1(A) W1(A) R1(B) W1(B)}$$T2 : \text{ R2(B) W2(B) R2(C) W2(C)}$Total number of Conflict Serializable...
630
views
answered
Dec 14, 2016
Databases
tbb-dbms-1
+
–
3
votes
14
GATE Overflow | General Aptitude | Test 1 | Question: 4
A and B working separately can do a work in 9 and 12 days respectively. If they work for a day alternately, after A start the work, the work will be completed in ________ days.
A and B working separately can do a work in 9 and 12 days respectively. If they work for a day alternately, after A start the work, the work will be completed in _______...
402
views
answered
Dec 12, 2016
Quantitative Aptitude
go-general-aptitude-1
numerical-answers
quantitative-aptitude
work-time
+
–
23
votes
15
GATE CSE 1992 | Question: 12-a
Draw the precedence graph for the concurrent program given below S1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9
Draw the precedence graph for the concurrent program given belowS1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9
3.6k
views
answered
Dec 5, 2016
Operating System
gate1992
operating-system
normal
concurrency
precedence-graph
descriptive
+
–
30
votes
16
GATE2014 EC-1: GA-10
You are given three coins: one has heads on both faces, the second has tails on both faces, and the third has a head on one face and a tail on the other. You choose a coin at random and toss it, and it comes up heads. The probability that the other face is tails is $\dfrac{1}{4}$ $\dfrac{1}{3}$ $\dfrac{1}{2}$ $\dfrac{2}{3}$
You are given three coins: one has heads on both faces, the second has tails on both faces, and the third has a head on one face and a tail on the other. You choose a coi...
10.4k
views
answered
Nov 28, 2016
Quantitative Aptitude
gate2014-ec-1
quantitative-aptitude
probability
conditional-probability
+
–
14
votes
17
GATE CSE 1991 | Question: 12-a
Suppose a database consist of the following relations: SUPPLIER (SCODE,SNAME,CITY). PART (PCODE,PNAME,PDESC,CITY). PROJECTS (PRCODE,PRNAME,PRCITY). SPPR (SCODE,PCODE,PRCODE,QTY). Write SQL programs corresponding to the following queries: Print PCODE values for ... part to a project in the second city, but do not print the triples in which the two CITY values are same.
Suppose a database consist of the following relations:SUPPLIER (SCODE,SNAME,CITY). PART (PCODE,PNAME,PDESC,CITY). PROJECTS (PRCODE,PRNAME,PRCITY). SPPR (SCODE,PCODE,PRCOD...
3.4k
views
answered
Nov 25, 2016
Databases
gate1991
databases
sql
normal
descriptive
+
–
30
votes
18
GATE CSE 1995 | Question: 27
Consider the relation scheme. ... for the publisher with PNAME='TECHNICAL PUBLISHERS'. Get the names of all authors who have published a book for any publisher located in Madras
Consider the relation scheme.$$\begin{array}{ll} \text{AUTHOR} & \text{(ANAME, INSTITUTION, ACITY, AGE)} \\\hline \text{PUBLISHER} & \text{(PNAME, PCITY)} \\\hline \te...
4.6k
views
answered
Nov 24, 2016
Databases
gate1995
databases
relational-algebra
normal
descriptive
+
–
1
votes
19
GATE2014 EC-4: GA-8
Industrial consumption of power doubled from $2000-2001$ to $2010-2011$. Find the annual rate of increase in percent assuming it to be uniform over the years. $5.6$ $7.2$ $10.0$ $12.2$
Industrial consumption of power doubled from $2000-2001$ to $2010-2011$. Find the annual rate of increase in percent assuming it to be uniform over the years. $5.6$ $7.2$...
2.9k
views
answered
Nov 9, 2016
Quantitative Aptitude
gate2014-ec-4
percentage
normal
quantitative-aptitude
+
–
11
votes
20
GATE IT 2007 | Question: 24
A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which the DFS call to the vertex $u$ terminates. Which of the following statements is always TRUE for all edges $(u, v)$ in the graph ? $d[u] < d[v]$ $d[u] < f[v]$ $f[u] < f[v]$ $f[u] > f[v]$
A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which t...
13.9k
views
answered
Nov 3, 2016
Algorithms
gateit-2007
algorithms
graph-algorithms
normal
graph-search
depth-first-search
+
–
1
votes
21
GATE CSE 2001 | Question: 21-a
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number. Write a relational algebra using $( \Pi, \sigma, \rho, \times)$ to find the list of names which appear more than once in examinee.
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number.Write a relational algebra using $( \Pi, \sigma, \rho, \times)...
3.9k
views
answered
Aug 17, 2016
Databases
gatecse-2001
databases
sql
normal
descriptive
+
–
13
votes
22
GATE CSE 2001 | Question: 3
Prove that powerset $(A \cap B) = \text{powerset}(A) \cap \text{powerset}(B)$ Let $\text{sum} (n) = 0 + 1 + 2 + ..... + n$ for all natural numbers n. Give an induction proof to show that the following equation is true for all natural numbers $m$ and $n$: $\text{sum}(m+n) = \text{sum}(m) + \text{sum}(n) + mn$
Prove that powerset $(A \cap B) = \text{powerset}(A) \cap \text{powerset}(B)$Let $\text{sum} (n) = 0 + 1 + 2 + ..... + n$ for all natural numbers n. Give an induction pro...
2.3k
views
answered
Jun 16, 2016
Set Theory & Algebra
gatecse-2001
set-theory&algebra
normal
set-theory
descriptive
+
–
2
votes
23
CMI2015-B-02
Consider a social network with $n$ persons. Two persons $A$ and $B$ are said to be connected if either they are friends or they are related through a sequence of friends: that is, there exists a set of persons $F_1, \dots, F_m$ such that $A$ and ... . It is known that there are $k$ persons such that no pair among them is connected. What is the maximum number of friendships possible?
Consider a social network with $n$ persons. Two persons $A$ and $B$ are said to be connected if either they are friends or they are related through a sequence of friends:...
610
views
answered
Jun 11, 2016
Combinatory
descriptive
cmi2015
combinatory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register