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 nitish
2
answers
1
why stop and wait protocol has flow control but not error control ?
why stop and wait protocol has flow control but not error control ?
why stop and wait protocol has flow control but not error control ?
3.4k
views
answered
Dec 13, 2020
Computer Networks
computer-networks
stop-and-wait
+
–
6
answers
2
TIFR CSE 2013 | Part B | Question: 18
Let $S$ be a set of numbers. For $x \in S$, the rank of $x$ is the number of elements in $S$ that are less than or equal to $x$. The procedure $\textsf{Select}(S, r)$ takes a set $S$ of numbers and a rank $r\left(1 \leq r \leq |S|\right)$ and returns the ... $|S|$ constant · $|S||R|$ constant · $|R| \log |S|$ constant · $|S|(1 + \log |R|)$
Let $S$ be a set of numbers. For $x \in S$, the rank of $x$ is the number of elements in $S$ that are less than or equal to $x$. The procedure $\textsf{Select}(S, r)$ tak...
2.5k
views
answered
Oct 28, 2017
Algorithms
tifr2013
algorithms
quick-sort
time-complexity
+
–
1
answer
3
LR parsing transitions
Consider the following statements: S1: Whenever we apply transition on any symbol the lookahead does not change S2: The lookahead has effect on items of the form [$A\rightarrow \alpha \bullet \beta , a$] where β ≠ ∈ and [$A\rightarrow \alpha \bullet , a$] Which of the above statements are true wrt LR(1) items?
Consider the following statements:S1: Whenever we apply transition on any symbol the lookahead does not changeS2: The lookahead has effect on items of the form[$A\rightar...
835
views
answered
Oct 20, 2017
Compiler Design
compiler-design
parsing
+
–
12
answers
4
GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that o...
62.1k
views
answered
Oct 19, 2017
Digital Logic
gatecse-2015-set2
digital-logic
adder
normal
numerical-answers
+
–
2
answers
5
DirectionSenseTest
Dhruv facing North walks 3Km at 45° to his right to reach C. Then walks 16Km South, then turns right and walks 7Km, then turns left and walks 8Km to point B. What is the distance between C and B?
Dhruv facing North walks 3Km at 45° to his right to reach C. Then walks 16Km South, then turns right and walks 7Km, then turns left and walks 8Km to point B. What is the...
315
views
asked
Oct 12, 2017
Quantitative Aptitude
quantitative-aptitude
+
–
1
answer
6
Combinatorics
272
views
asked
Sep 19, 2017
Quantitative Aptitude
quantitative-aptitude
+
–
2
answers
7
Digital Logic
What are the next two Consecutive number which will come after number (444)5 ( i.e. number 444 with base 5) in this system?
What are the next two Consecutive number which will come after number (444)5 ( i.e. number 444 with base 5) in this system?
558
views
asked
Sep 17, 2017
Digital Logic
digital-logic
numbersystem
+
–
0
answers
8
ACETestSeries Questions
550
views
commented
Sep 9, 2017
Theory of Computation
theory-of-computation
context-free-language
ace-test-series
+
–
2
answers
9
ace mock test
Is this solution wrong?
Is this solution wrong?
605
views
commented
Sep 7, 2017
0
answers
10
Identify Languange
What is nature of this Language (a ^ n) * (b ^ m) where n^2+m^2=16. Here no condition of n and m is provided. So i think we need to consider best solution for this type of question. Kindly assist.
What is nature of this Language(a ^ n) * (b ^ m) where n^2+m^2=16. Here no condition of n and m is provided. So i think we need to consider best solution for this type of...
340
views
asked
Sep 7, 2017
Theory of Computation
theory-of-computation
identify-class-language
laguages
+
–
1
answer
11
DM controller
What is the difference between DM controller and micropcessor. Block diagram of the device seems similar , both contains pins. Then how they are different from each other?
What is the difference between DM controller and micropcessor. Block diagram of the device seems similar , both contains pins. Then how they are different from each other...
323
views
answered
Sep 3, 2017
CO and Architecture
co-and-architecture
+
–
1
answer
12
execution time
how to solve this?
how to solve this?
403
views
answered
Aug 26, 2017
12
answers
13
GATE CSE 2017 Set 1 | Question: 44
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate her public and private keys. If the public key of $A$ is $35$, then the private key of $A$ is __________ .
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate her public and private keys. If the public key of $A$ is $35$, then the ...
23.9k
views
commented
Aug 19, 2017
Computer Networks
gatecse-2017-set1
network-security
computer-networks
rsa-security-networks
out-of-gate-syllabus
numerical-answers
normal
+
–
0
answers
14
OperatingSystem-SecurityQuestions
164
views
edited
Aug 9, 2017
Operating System
operating-system
+
–
0
answers
15
CPU Utilization
601
views
asked
Aug 8, 2017
Operating System
operating-system
+
–
0
answers
16
TestSeries2018Ace
268
views
asked
Aug 8, 2017
Operating System
operating-system
virtual-memory
+
–
1
answer
17
databases
414
views
asked
Aug 4, 2017
Databases
databases
bcnf-decomposition
+
–
1
answer
18
operating system
486
views
commented
Jul 25, 2017
Operating System
operating-system
multilevel-paging
+
–
4
answers
19
Join Number of Tuples
Suppose you are given relations r(A, B) and s(A, C). Suppose that r has 10000 tuples, and s has 5000 tuples. Suppose attribute r.A has 1001 distinct values, and s.A also has 1001 distinct values. The maximum possible size of the join result is
Suppose you are given relations r(A, B) and s(A, C). Suppose that r has 10000 tuples, and s has 5000 tuples. Suppose attribute r.A has 1001 distinct values, and s.A also ...
3.8k
views
answered
Jul 9, 2017
Databases
natural-join
databases
relational-algebra
+
–
1
answer
20
digital logic
262
views
asked
Jun 19, 2017
Digital Logic
digital-logic
+
–
1
answer
21
ace mock test
How many binary search trees can be formed with n distinct and designated(labeled) nodes...??
How many binary search trees can be formed with n distinct and designated(labeled) nodes...??
364
views
answered
Jun 7, 2017
DS
data-structures
binary-search-tree
ace-test-series
+
–
1
answer
22
C programming
303
views
asked
Jun 3, 2017
Programming in C
programming-in-c
output
+
–
2
answers
23
C Programming
1.3k
views
asked
Jun 1, 2017
Programming in C
programming-in-c
output
+
–
0
answers
24
toc fsm
399
views
asked
May 4, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
0
answers
25
TOC TM
298
views
asked
May 4, 2017
Theory of Computation
theory-of-computation
decidability
+
–
3
answers
26
Finite Automata
768
views
commented
May 3, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
1
answer
27
What is the difference between double hashing and rehashing?
4.7k
views
answered
Mar 22, 2017
Algorithms
algorithms
hashing
+
–
17
answers
28
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
Dec 17, 2016
DS
gatecse-2016-set2
data-structures
binary-search-tree
normal
numerical-answers
+
–
4
answers
29
GATE IT 2006 | Question: 23
Let $P$, $Q$ and $R$ be sets let Δ denote the symmetric difference operator defined as $PΔQ=(P \cup Q) - (P ∩ Q).$ Using Venn diagrams, determine which of the following is/are TRUE? $PΔ (Q ∩ R) = (P Δ Q) ∩ (P Δ R)$ $P ∩ (Q ∩ R) = (P ∩ Q) Δ (P Δ R)$ I only II only Neither I nor II Both I and II
Let $P$, $Q$ and $R$ be sets let Δ denote the symmetric difference operator defined as $PΔQ=(P \cup Q) - (P ∩ Q).$ Using Venn diagrams, determine which of the followi...
5.8k
views
commented
Dec 15, 2016
Set Theory & Algebra
gateit-2006
set-theory&algebra
normal
set-theory
+
–
8
answers
30
GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. ...
16.7k
views
commented
Dec 15, 2016
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
difficult
set-theory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register