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 ukn
3
answers
1
Test by Bikram | Digital Logic | Test 2 | Question: 21
On the fifth clock pulse, a $4$-bit Johnson sequence is $Q0 = 0, \ Q1 = 1, \ Q2 = 1$, and $Q3 = 1$. On the sixth clock pulse, the sequence is ________. $Q0 = 1, \ Q1 = 0, \ Q2 = 0, \ Q3 = 0$ $Q0 = 1, \ Q1 = 1, \ Q2 = 1, \ Q3 = 0$ $Q0 = 0, \ Q1 = 0, \ Q2 = 1, \ Q3 = 1$ $Q0 = 0, \ Q1 = 0, \ Q2 = 0, \ Q3 = 1$
On the fifth clock pulse, a $4$-bit Johnson sequence is $Q0 = 0, \ Q1 = 1, \ Q2 = 1$, and $Q3 = 1$. On the sixth clock pulse, the sequence is ________.$Q0 = 1, \ Q1 = 0, ...
898
views
commented
Feb 6, 2017
Digital Logic
tbb-digital-logic-2
+
–
3
answers
2
Test by Bikram | Digital Logic | Test 2 | Question: 9
A 4-bit synchronous counter uses flip-flops with propagation delay times of $15$ ns each. The maximum possible time required for change of state will be _____. $15$ ns $30$ ns $45$ ns $60$ ns
A 4-bit synchronous counter uses flip-flops with propagation delay times of $15$ ns each. The maximum possible time required for change of state will be _____.$15$ ns$30$...
485
views
answered
Feb 6, 2017
Digital Logic
tbb-digital-logic-2
+
–
7
answers
3
GATE IT 2007 | Question: 11
Let a memory have four free blocks of sizes $4k$, $8k$, $20k$, $2k$ ... $J7$ will be completed will be $16$ $19$ $20$ $37$
Let a memory have four free blocks of sizes $4k$, $8k$, $20k$, $2k$. These blocks are allocated following the best-fit strategy. The allocation requests are stored in a q...
19.3k
views
commented
Feb 1, 2017
Operating System
gateit-2007
operating-system
memory-management
normal
+
–
7
answers
4
GATE CSE 2007 | Question: 5
Consider the DAG with $V = \{1,2,3,4,5,6\}$ shown below. Which of the following is not a topological ordering? $1$ $2$ $3$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $6$ $5$ $3$ $2$ $4$ $1$ $6$ $5$
Consider the DAG with $V = \{1,2,3,4,5,6\}$ shown below.Which of the following is not a topological ordering?$1$ $2$ $3$ $4$ $5$ $6$$1$ $3$ $2$ $4$ $5$ $6$$1$ $3$ $2$ $4$...
7.7k
views
commented
Jan 30, 2017
Algorithms
gatecse-2007
algorithms
graph-algorithm
topological-sort
easy
+
–
3
answers
5
GATE CSE 2016 Set 2 | Question: 54
For the $\text{IEEE 802.11 MAC}$ protocol for wireless communication, which of the following statements is/are TRUE? At least three non-overlapping channels are available for transmissions. The RTS-CTS mechanism is used for collision detection. Unicast frames are ACKed. All I, II, and III I and III only II and III only II only
For the $\text{IEEE 802.11 MAC}$ protocol for wireless communication, which of the following statements is/are TRUE?At least three non-overlapping channels are available ...
16.9k
views
commented
Jan 28, 2017
Computer Networks
gatecse-2016-set2
computer-networks
wifi
normal
non-gate
+
–
7
answers
6
GATE CSE 2016 Set 2 | Question: 07
Consider an eight-bit ripple-carry adder for computing the sum of $A$ and $B$, where $A$ and $B$ are integers represented in $2$'s complement form. If the decimal value of $A$ is one, the decimal value of $B$ that leads to the longest latency for the sum to stabilize is ___________
Consider an eight-bit ripple-carry adder for computing the sum of $A$ and $B$, where $A$ and $B$ are integers represented in $2$'s complement form. If the decimal value o...
19.4k
views
commented
Jan 28, 2017
Digital Logic
gatecse-2016-set2
digital-logic
adder
normal
numerical-answers
+
–
5
answers
7
GATE CSE 2016 Set 2 | Question: 21
B+ Trees are considered BALANCED because. The lengths of the paths from the root to all leaf nodes are all equal. The lengths of the paths from the root to all leaf nodes differ from each other by at most $1$. The number of children of any two non-leaf sibling nodes differ by at most $1$. The number of records in any two leaf nodes differ by at most $1$.
B+ Trees are considered BALANCED because.The lengths of the paths from the root to all leaf nodes are all equal.The lengths of the paths from the root to all leaf nodes d...
11.6k
views
answered
Jan 28, 2017
Databases
gatecse-2016-set2
databases
b-tree
normal
+
–
8
answers
8
GATE CSE 2016 Set 2 | Question: 11
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^{\text{th}}$ vertex in this BFS traversal, then the maximum possible value of $n$ is __________
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^{\text{th}...
13.1k
views
commented
Jan 27, 2017
Algorithms
gatecse-2016-set2
algorithms
graph-algorithms
normal
numerical-answers
graph-search
+
–
0
answers
9
digital logic
166
views
asked
Jan 25, 2017
3
answers
10
data structure
656
views
commented
Jan 24, 2017
0
answers
11
data structure
175
views
asked
Jan 24, 2017
0
answers
12
made easy
418
views
asked
Jan 23, 2017
0
answers
13
doubt
234
views
commented
Jan 23, 2017
1
answer
14
database
292
views
asked
Jan 23, 2017
0
answers
15
database
164
views
asked
Jan 23, 2017
0
answers
16
database
124
views
asked
Jan 23, 2017
0
answers
17
database
155
views
commented
Jan 23, 2017
0
answers
18
database
264
views
asked
Jan 23, 2017
1
answer
19
CONTEXT FREE LANGUAGE
334
views
commented
Jan 21, 2017
1
answer
20
SUBNET
537
views
asked
Jan 21, 2017
2
answers
21
SUBNET MASK
313
views
asked
Jan 21, 2017
0
answers
22
TCP CONNECTION
143
views
asked
Jan 21, 2017
0
answers
23
tcp connecion
A TCP machine is sending window of 65535 bytes over 512Mbps channel that has 20msec one way delay. The line efficiency is ______________(up to 2 decimal places).
A TCP machine is sending window of 65535 bytes over 512Mbps channel that has 20msec one way delay. The line efficiency is ______________(up to 2 decimal places).
278
views
asked
Jan 21, 2017
0
answers
24
computer network
188
views
asked
Jan 20, 2017
1
answer
25
REGULAR EXPRESSION
318
views
asked
Jan 20, 2017
2
answers
26
DFA-MINIMIZATION
1.2k
views
asked
Jan 20, 2017
1
answer
27
compiler
405
views
asked
Jan 19, 2017
Compiler Design
compiler-design
grammar
operator-grammar
operator-precedence
ace-test-series
+
–
2
answers
28
GATE Overflow | Programming | Test 1 | Question: 11
What will be the outout of the following code? #include <stdio.h> int main() { int a = 1, b = 2; int c = a++ || b++; printf("%d %d %d", a, b, c); } 1 2 1 2 3 1 2 2 1 2 2 0
What will be the outout of the following code?#include <stdio.h int main() { int a = 1, b = 2; int c = a++ || b++; printf("%d %d %d", a, b, c); }1 2 12 3 12 2 12 2 0
898
views
commented
Jan 19, 2017
Programming in C
go-programming-1
programming
programming-in-c
short-circuit-rule
+
–
2
answers
29
GATE Overflow | Programming | Test 1 | Question: 10
What will be the output of the following program? #include <stdio.h> void f1(int p1, int *p2, int **p3) { p1 = 20; *p2 = p1; **p3 = *p2; p1 = 10; } int main() { int a = 5, b = 5, *c = &b; f1(a, &b, &c); printf("%d %d %d", a, b, *c); } 5 5 5 5 20 20 10 20 20 20 20 20
What will be the output of the following program?#include <stdio.h void f1(int p1, int *p2, int p3) { p1 = 20; *p2 = p1; p3 = *p2; p1 = 10; } int main() { int a = 5, b ...
795
views
commented
Jan 19, 2017
Programming in C
go-programming-1
programming
programming-in-c
pointers
+
–
5
answers
30
GATE Overflow | Programming | Test 1 | Question: 21
The value returned by the following code is _____ int foo() { int a[] = { 10, 20, 30, 40, 50, 60 }; int *p = &a[1] , *q = &a[5] ; return q-p; }
The value returned by the following code is _____int foo() { int a[] = { 10, 20, 30, 40, 50, 60 }; int *p = &a , *q = &a[5] ; return q-p; }
1.6k
views
commented
Jan 19, 2017
Programming in C
go-programming-1
programming
programming-in-c
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register