Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Sheshang
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Sheshang
1
answer
1
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.2k
views
answer edited
Jul 16, 2017
Databases
tbb-dbms-1
+
–
1
answer
2
GATE IT 2006 | Question: 76
x + y/2 = 9 3x + y = 10 The value of the Frobenius norm for the above system of equations is $0.5$ $0.75$ $1.5$ $2.0$
x + y/2 = 93x + y = 10The value of the Frobenius norm for the above system of equations is$0.5$$0.75$$1.5$$2.0$
1.5k
views
commented
Apr 16, 2017
Linear Algebra
gateit-2006
linear-algebra
normal
numerical-methods
non-gate
+
–
2
answers
3
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.7k
views
answer edited
Apr 16, 2017
Databases
gatecse-2001
databases
sql
normal
descriptive
+
–
4
answers
4
GATE CSE 2014 Set 2 | Question: 26
Consider the store and forward packet switched network given below. Assume that the bandwidth of each link is $10^6$ bytes / sec. A user on host $A$ sends a file of size $10^3$ bytes to host $B$ through routers $R1$ and $R2$ in three different ways. ... . Which one of the following is CORRECT? $T1<T2<T3$ $T1>T2>T3$ $T2=T3, T3<T1$ $T1=T3, T3> T2$
Consider the store and forward packet switched network given below. Assume that the bandwidth of each link is $10^6$ bytes / sec. A user on host $A$ sends a file of size ...
19.0k
views
commented
Feb 6, 2017
Computer Networks
gatecse-2014-set2
computer-networks
network-switching
normal
+
–
2
answers
5
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...
626
views
commented
Feb 1, 2017
GATE
tbb-mockgate-2
numerical-answers
engineering-mathematics
probability
+
–
1
answer
6
Test by Bikram | Mock GATE | Test 2 | Question: 29
Given a graph $G$ with vertex set $V$ and edge set $E$, which of the following statements is/are correct about graph $G$? If $G$ is directed and acyclic, the asymptotic algorithmic complexity of topological sort on $G$ is $O$\left ... ancestors to descendants), and cross edges (all other remaining links). I only III only I and II only I, II and III
Given a graph $G$ with vertex set $V$ and edge set $E$, which of the following statements is/are correct about graph $G$?If $G$ is directed and acyclic, the asymptotic al...
819
views
commented
Feb 1, 2017
GATE
tbb-mockgate-2
algorithms
graph-algorithms
depth-first-search
+
–
4
answers
7
GATE CSE 2015 Set 2 | Question: 50
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true? A tree has no bridges A bridge cannot be part of a simple cycle Every edge of a clique with size $\geq 3$ is a bridge (A clique is any complete subgraph of a graph) A graph with bridges cannot have cycle
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true?A tree has no bridgesA bridge cannot be part ...
14.5k
views
commented
Feb 1, 2017
Graph Theory
gatecse-2015-set2
graph-theory
graph-connectivity
easy
+
–
1
answer
8
Testbook Test Series: Computer Networks - Csma Cd
A 2-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/microsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including 32 bits of header, checksum, and ... The effective data rate is _____________________ Mbps (correct to 2 decimal places), excluding overhead, assuming that there are no collisions?
A 2-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/microsec. Repeaters are not allowed in this system. Data frames are 512 bits long, includin...
2.0k
views
commented
Jan 26, 2017
Computer Networks
testbook-test-series
computer-networks
csma-cd
effective-data-rate
+
–
1
answer
9
Test by Bikram | Mock GATE | Test 2 | Question: 46
The number of possible Deterministic Finite Automation with two states $q_0$ and $q_1$, where $q_0$ is always the initial state over the alphabet $\left \{ a,b \right \}$ which accept empty language is : ____________.
The number of possible Deterministic Finite Automation with two states $q_0$ and $q_1$, where $q_0$ is always the initial state over the alphabet $\left \{ a,b \right \}$...
923
views
commented
Jan 26, 2017
Theory of Computation
tbb-mockgate-2
numerical-answers
theory-of-computation
finite-automata
number-of-dfa
+
–
5
answers
10
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 ____...
725
views
commented
Jan 25, 2017
Compiler Design
tbb-mockgate-2
numerical-answers
compiler-design
theory-of-computation
context-free-grammar
+
–
2
answers
11
Test by Bikram | Mock GATE | Test 2 | Question: 41
A $DMA$ module is transferring bytes to memory using cycle stealing mode from a device transmitting at $16 KB/s$. The processor is fetching instructions at the rate of $1 MB/s$. The percentage by which the processor will be slowed down due to the $DMA$ activity is ______.
A $DMA$ module is transferring bytes to memory using cycle stealing mode from a device transmitting at $16 KB/s$. The processor is fetching instructions at the rate of $1...
863
views
commented
Jan 25, 2017
GATE
tbb-mockgate-2
numerical-answers
co-and-architecture
dma
+
–
2
answers
12
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 ...
741
views
answered
Jan 25, 2017
GATE
tbb-mockgate-2
data-structures
graph-algorithms
depth-first-search
+
–
2
answers
13
Test by Bikram | Mock GATE | Test 2 | Question: 26
The designers of a computer must select a cache system. They have two options. In first design they uses a direct-mapped cache containing $2$ words per cache line. It would have an instruction miss rate of $3%$ and a data miss rate of $8%$. In second design they uses a $2$- ... $D1 = 0.70, D2 = 0.40$ $D1 = 1.10, D2 = 0.40$ $D1 = 0.70, D2 = 0.48$
The designers of a computer must select a cache system. They have two options.In first design they uses a direct-mapped cache containing $2$ words per cache line. It woul...
625
views
commented
Jan 25, 2017
GATE
tbb-mockgate-2
co-and-architecture
cache-memory
+
–
2
answers
14
Test by Bikram | Mock GATE | Test 2 | Question: 19
Consider a language $L$ that is recognized by a machine $M$. Which of the following statements might not be true? If $M$ is a deterministic finite automaton, then $L$ can be represented by a regular expression. If $M$ is ... represented by a context-free grammar. If $M$ is a non-deterministic pushdown automaton, then $L$ is recursively enumerable.
Consider a language $L$ that is recognized by a machine $M$. Which of the following statements might not be true?If $M$ is a deterministic finite automaton, then $L$ can ...
583
views
commented
Jan 25, 2017
Theory of Computation
tbb-mockgate-2
theory-of-computation
identify-class-language
+
–
1
answer
15
Test by Bikram | Mock GATE | Test 2 | Question: 10
Consider a binary function $g :P \times P \to \left \{ true,false \right \}$, where $P$ is a non-empty subset of the natural numbers that contains an even number of distinct elements. Which of the following statements ... equivalence classes $g$ defines a total order but not a partial order $g$ is reflexive and antisymmetric but not a surjection
Consider a binary function $g :P \times P \to \left \{ true,false \right \}$, where $P$ is a non-empty subset of the natural numbers that contains an even number of disti...
995
views
commented
Jan 25, 2017
Set Theory & Algebra
tbb-mockgate-2
discrete-mathematics
set-theory&algebra
functions
relations
+
–
3
answers
16
Test by Bikram | Mock GATE | Test 2 | Question: 2
Which of the following statements is NOT true? Deadlock can never occur if all resources can be shared by competing processes. Deadlock can never occur if resources must be requested in the same order by processes ... then deadlock has certainly occurred. The Banker's algorithm for avoiding deadlock requires knowing resource requirements in advance
Which of the following statements is NOT true? Deadlock can never occur if all resources can be shared by competing proces...
901
views
commented
Jan 25, 2017
Databases
tbb-mockgate-2
databases
operating-system
deadlock-prevention-avoidance-detection
bankers-algorithm
+
–
1
answer
17
Test by Bikram | Mock GATE | Test 2 | Question: 59
Select the best alternative for the underlined part: Currently $93,250,000$ billion barrels per year, $\underline{\text{world consumption of oil is rising at a rate of}}$ $4.5$ percent annually. World consumption of oil is rising at a ... world's oil is being consumed at the increasing rate of The rise in the rate of the world's oil consumption is
Select the best alternative for the underlined part:Currently $93,250,000$ billion barrels per year, $\underline{\text{world consumption of oil is rising at a rate of}}$ ...
505
views
commented
Jan 25, 2017
Verbal Aptitude
tbb-mockgate-2
verbal-aptitude
most-appropriate-alternative
+
–
2
answers
18
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$
822
views
answered
Jan 25, 2017
GATE
tbb-mockgate-2
analytical-aptitude
odd-one
+
–
2
answers
19
Test by Bikram | Mock GATE | Test 1 | Question: 19
Consider the following $SQ$L query: With max_balance(value) as Select max(balance) from account; The result of executing the above query is: $A$ temporary table is created with the name $max$_$balance$ $A$ temporary view is created with ... view is created with the name $max$_$balance$ $A$ permanent table is created with the name $max$_$balance$
Consider the following $SQ$L query:With max_balance(value) as Select max(balance) from account;The result of executing the above query is:$A$ temporary table is created w...
765
views
commented
Jan 24, 2017
GATE
tbb-mockgate-1
sql
databases
+
–
3
answers
20
Test by Bikram | Mock GATE | Test 1 | Question: 37
A pulse train with a frequency of $1$ $MHz$ is counted using a modulo $1024$ ripple counter built with $J-K$ flip flops. For proper operation of the counter, the maximum permissible propagation delay per flip flop stage is: $10 \: nsec$ $100 \: nsec$ $1000 \: nsec$ $100 \: microsec$
A pulse train with a frequency of $1$ $MHz$ is counted using a modulo $1024$ ripple counter built with $J-K$ flip flops. For proper operation of the counter, the maximum ...
974
views
comment edited
Jan 20, 2017
GATE
tbb-mockgate-1
ripple-counter-operation
digital-counter
digital-logic
+
–
0
answers
21
Virtual Gate Test Series: Computer Networks - IP Datagram
$DF=1$ so fragmentation will not be done. but what will happen next? datagram just rejected? what will be the strategy of the network to do not loss data and retransmit?
$DF=1$ so fragmentation will not be done. but what will happen next? datagram just rejected? what will be the strategy of the network to do not loss data and retransmit?
488
views
commented
Jan 19, 2017
Computer Networks
computer-networks
ip-datagram
virtual-gate-test-series
+
–
0
answers
22
Virtual Gate Test Series: Algorithms - Time Complexity
578
views
commented
Jan 18, 2017
Algorithms
algorithms
time-complexity
virtual-gate-test-series
+
–
1
answer
23
Virtual Gate Test Series: Computer Networks - CSMA
A $8$-node network runs the Carrier Sence Multiple Access $\text{(CSMA) MAC}$ protocol.The maximum data rate of the network is $\text{10 Megabits/sec}.$ Including retries, each node sends traffic according to some unknown random process ... $\text{(including retries)}$ experience a collision _____$\%?$ $\text{(Correct to two decimal places).}$
A $8$-node network runs the Carrier Sence Multiple Access $\text{(CSMA) MAC}$ protocol.The maximum data rate of the network is $\text{10 Megabits/sec}.$ Including retries...
542
views
commented
Jan 18, 2017
Computer Networks
computer-networks
csma-cd
virtual-gate-test-series
+
–
1
answer
24
Virtual Gate Test Series: Digital Logic - Flip Flop Delay
519
views
commented
Jan 18, 2017
Digital Logic
digital-logic
clock-frequency
flip-flop
virtual-gate-test-series
+
–
0
answers
25
Virtual Gate Test Series: Databases - B+ Tree
367
views
asked
Jan 18, 2017
Databases
databases
file-system
b-tree
virtual-gate-test-series
+
–
2
answers
26
Testbook Test Series 2017: Calculus - Functions
The function defined for positive integers by $F\left ( 1 \right )=1 F\left ( 2 \right )=1 F\left ( 3 \right )=-1$ and by identites $F\left ( 2k \right )=F\left ( k \right ), F\left ( 2k+1 \right )=F\left ( k \right ) for\; k>=2$ ... is___ ??
The function defined for positive integers by$F\left ( 1 \right )=1 F\left ( 2 \right )=1 F\left ( 3 \right )=-1$and by identites$F\left ( 2k \right )=F\left ( k \right )...
978
views
commented
Jan 16, 2017
Calculus
testbook-test-series
engineering-mathematics
calculus
functions
+
–
2
answers
27
testbook
737
views
commented
Jan 16, 2017
Digital Logic
testbook-test-series
test-series
digital-logic
+
–
0
answers
28
view serializable
S1: R(A) W(A) W(B) S2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3
S1: R(A) W(A) W(B)S2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(D) 3
490
views
commented
Jan 13, 2017
Databases
databases
transaction-and-concurrency
view-serializable
+
–
5
answers
29
Total propagation delay in Carry look ahead adderIn a 4-b
In a 4-bit carry look ahead adder, the propagation delay of Ex-OR gate is 20ns ,AND and OR gates is 10 ns.The sum and carry output of full adder takes 20ns and 10ns respectively.The total propagation delay of the above adder in ns is __________
In a 4-bit carry look ahead adder, the propagation delay of Ex-OR gate is 20ns ,AND and OR gates is 10 ns.The sum and carry output of full adder takes 20ns and 10ns respe...
11.9k
views
commented
Jan 11, 2017
Digital Logic
digital-logic
test-series
+
–
3
answers
30
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.4k
views
commented
Jan 6, 2017
Databases
gate1995
databases
relational-algebra
normal
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register