Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
avadh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by avadh
0
votes
1
VANI Question Bank :DBMS
Minimum number of tables required to represent the relation R where the $A_n$ stands for the primary key of each entity is ___________
Minimum number of tables required to represent the relation R where the $A_n$ stands for the primary key of each entity is ___________
662
views
answered
May 27, 2019
Databases
databases
rdbms
+
–
–1
votes
2
Doubt on database normalization for relation having all prime attributes
In a relation, if every attribute is prime but key may not be simple then the relation is in ______. A. 1NF B. 2NF C. 3NF D. BCNF
In a relation, if every attribute is prime but key may not be simple then the relation is in ______.A. 1NFB. 2NFC. 3NFD. BCNF
2.4k
views
answered
May 27, 2019
Databases
databases
database-normalization
rdbms
+
–
0
votes
3
ME Test series
266
views
answered
Jan 12, 2019
0
votes
4
GATE CSE 2015 Set 3 | Question: 25
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
23.9k
views
answered
Dec 28, 2018
DS
gatecse-2015-set3
data-structures
binary-tree
normal
numerical-answers
+
–
0
votes
5
Made easy question: Disk scheduling
1.1k
views
answered
Dec 24, 2018
0
votes
6
SSTF Disk Scheduling
My answer is 202 given 232
My answer is 202given 232
1.9k
views
answered
Dec 24, 2018
Operating System
operating-system
disk-scheduling
+
–
0
votes
7
TCP Congestion Control
1.2k
views
answered
Dec 20, 2018
Computer Networks
computer-networks
congestion-control
tcp
+
–
0
votes
8
TCP-congestion control
Assume a scenario where the size of congestion window of a TCP connection be 40 KB when a timeout occurs. The maximum segment size (MSS) be 2 KB. Let the propagation delay be 200 msec. The time taken by the TCP connection to get back to 40 ... is 6000msec.I am taking MSS as 2KB.ls someone explain NOTE:same question also asked here https://gateoverflow.in/1794/gate2014-1-27
Assume a scenario where the size of congestion window of a TCP connection be 40 KB when a timeout occurs. The maximum segment size (MSS) be 2 KB. Let the propagation dela...
3.5k
views
answered
Dec 20, 2018
Computer Networks
computer-networks
congestion-control
+
–
0
votes
9
TCP-Congestion control
Consider a TCP connection using the slow start congestion control scheme with an initial threshold value of 64 kB and a Maximum Segment Size (MSS) of 2 kB. The receiver's advertised window is initially 32 kB. The first transmission attempt is numbered 0, and all transmission ... size of sender's congestion window at attempt number 10? a. 16 KB b. 18 KB c. 20 KB d. 22 KB
Consider a TCP connection using the slow start congestion control scheme with an initial threshold value of 64 kB and aMaximum Segment Size (MSS) of 2 kB. The receiver’...
679
views
answered
Dec 20, 2018
0
votes
10
TCP-Congestion control
Consider a TCP connection using the slow start congestion control scheme with an initial threshold value of 64 kB and a Maximum Segment Size (MSS) of 2 kB. The receiver's advertised window is initially 32 kB. The first transmission attempt is numbered 0, and all transmission ... size of sender's congestion window at attempt number 10? a. 16 KB b. 18 KB c. 20 KB d. 22 KB
Consider a TCP connection using the slow start congestion control scheme with an initial threshold value of 64 kB and aMaximum Segment Size (MSS) of 2 kB. The receiver’...
679
views
answered
Dec 20, 2018
0
votes
11
slow start
Suppose TCP's additive increase and multiplicative decrease algorithm is used as a congestion control algorithm. The slow start phase begins with 4 MSS and threshold at start of first transmission is 16 MSS. Assume that a time-out occurs during 6 th transmission ... ://gateoverflow.in/2156/gate2012_45 I'm not satisfied with the answer here. Shouldn't it start with 1 MSS again?
Suppose TCP’s additive increase and multiplicative decrease algorithm is used as a congestion control algorithm. The slow start phase begins with 4 MSS and threshold at...
598
views
answered
Dec 20, 2018
Computer Networks
congestion-control
sliding-window
+
–
0
votes
12
slow start
Suppose TCP's additive increase and multiplicative decrease algorithm is used as a congestion control algorithm. The slow start phase begins with 4 MSS and threshold at start of first transmission is 16 MSS. Assume that a time-out occurs during 6 th transmission ... ://gateoverflow.in/2156/gate2012_45 I'm not satisfied with the answer here. Shouldn't it start with 1 MSS again?
Suppose TCP’s additive increase and multiplicative decrease algorithm is used as a congestion control algorithm. The slow start phase begins with 4 MSS and threshold at...
598
views
answered
Dec 20, 2018
Computer Networks
congestion-control
sliding-window
+
–
0
votes
13
Super Key 1
Consider the following relational schema R(ABCDE). The number of super keys in relation R if every two attributes of relation R is candidate keys are __________. Please explain a general method to solve
Consider the following relational schema R(ABCDE). The number of super keys in relation R if every two attributes of relation R is candidate keys are __________.Please ex...
1.4k
views
answered
Dec 19, 2018
Databases
superkeys
databases
+
–
0
votes
14
TIFR CSE 2014 | Part B | Question: 15
Consider the set $N^{*}$ of finite sequences of natural numbers with $x \leq_{p}y$ denoting that sequence $x$ is a prefix of sequence $y$. Then, which of the following is true? $N^{*}$ is uncountable. $\leq_{p}$ is a total order. Every non ... -empty subset of $N^{*}$ has a greatest lower bound. Every non-empty finite subset of $N^{*}$ has a least upper bound.
Consider the set $N^{*}$ of finite sequences of natural numbers with $x \leq_{p}y$ denoting that sequence $x$ is a prefix of sequence $y$. Then, which of the following is...
3.5k
views
answered
Oct 31, 2018
Set Theory & Algebra
tifr2014
set-theory&algebra
partial-order
lattice
+
–
0
votes
15
DRDO2009: Operating System - Resource Allocation
which of the following is true? a:resource preemption is allowed in deadlock can be avoided but cannot be prevented B: if the number of shared resources is greater than the number of process then deadlock can be ... section D: deadlock avoidance schemes required information concerning which resource a process will request and used during its lifetime
which of the following is true?a:resource preemption is allowed in deadlock can be avoided but cannot be preventedB: if the number of shared resources is greater than the...
2.3k
views
answered
Oct 29, 2018
Operating System
drdo2009
operating-system
resource-allocation
+
–
0
votes
16
UGC NET CSE | August 2016 | Part 2 | Question: 40
Consider three CPU intensive processes $P1, P2, P3$ which require $20, 10$ and $30$ units of time, arrive at times $1, 3$ and $7$ respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then ... the beginning of Ready queue and at the end of Ready queue are not counted). $3$ $2$ $4$ $5$
Consider three CPU intensive processes $P1, P2, P3$ which require $20, 10$ and $30$ units of time, arrive at times $1, 3$ and $7$ respectively. Suppose operating system i...
5.8k
views
answered
Oct 23, 2018
Operating System
ugcnetcse-aug2016-paper2
operating-system
process-scheduling
+
–
0
votes
17
GATE CSE 1992 | Question: 4-a
Consider addition in two's complement arithmetic. A carry from the most significant bit does not always correspond to an overflow. Explain what is the condition for overflow in two's complement arithmetic.
Consider addition in two's complement arithmetic. A carry from the most significant bit does not always correspond to an overflow. Explain what is the condition for overf...
2.5k
views
answered
Jul 20, 2018
Digital Logic
gate1992
digital-logic
normal
number-representation
descriptive
+
–
0
votes
18
Virtual gate
313
views
answered
Jul 11, 2018
Algorithms
virtual-gate-test-series
graph-theory
shortest-path
+
–
0
votes
19
data structure
you are given an array which contain both positive and negative integers in it and asked to design an algorithm to find maximum sum which doest contain twp consecutive numbers .what is the time complexiy of efficient algorithm ? nlogn n2 n n2logn
you are given an array which contain both positive and negative integers in it and asked to design an algorithm to find maximum sum which doest contain twp consecutive nu...
779
views
answered
Jun 30, 2018
Algorithms
algorithms
algorithm-design
time-complexity
+
–
0
votes
20
Log formula related doubt.
Confusion regarding these log representations. 1.(logn)2 2.log2n 3.log(logn) 4.log(n)2 which of these are equal . Also explain meaning of each one.(Pls provide any source if possible).
Confusion regarding these log representations.1.(logn)22.log2n3.log(logn)4.log(n)2which of these are equal . Also explain meaning of each one.(Pls provide any source if p...
738
views
answered
Jun 30, 2018
Algorithms
algorithms
time-complexity
+
–
0
votes
21
UGC NET CSE | Junet 2015 | Part 2 | Question: 35
Which phase of compiler generates stream of atoms? Syntax Analysis Lexical Analysis Code Generation Code Optimization
Which phase of compiler generates stream of atoms?Syntax AnalysisLexical AnalysisCode GenerationCode Optimization
4.3k
views
answered
May 15, 2018
Compiler Design
ugcnetcse-june2015-paper2
compiler-design
+
–
0
votes
22
Carry lookahead adder
can anyone tell me wat is the right equation for carry generator in carry lookahead adder ?? Confused .. $ C_{i} = G_{i}+P_{i}C_{i-1}$ $ C_{i+1}=G_{}i+P_{}iC_{}i$
can anyone tell me wat is the right equation for carry generator in carry lookahead adder ?? Confused ..$ C_{i} = G_{i}+P_{i}C_{i-1}$$ C_{i+1}=G_{}i+P_{}iC_{}i$
714
views
answered
Apr 17, 2018
Digital Logic
digital-logic
look-ahead-adder
carry-generator
+
–
1
votes
23
GATE CSE 2012 | Question: 59
Choose the grammatically INCORRECT sentence: They gave us the money back less the service charges of Three Hundred rupees. This country’s expenditure is not less than that of Bangladesh. The committee initially asked for a funding of Fifty Lakh rupees, but later settled for a lesser sum. This country’s expenditure on educational reforms is very less.
Choose the grammatically INCORRECT sentence:They gave us the money back less the service charges of Three Hundred rupees.This country’s expenditure is not less than tha...
6.3k
views
answered
Jan 8, 2018
Verbal Aptitude
gatecse-2012
verbal-aptitude
grammatical-error
normal
+
–
9
votes
24
GATE CSE 2012 | Question: 58
Which one of the following options is the closest in meaning to the word given below? Mitigate Diminish Divulge Dedicate Denote
Which one of the following options is the closest in meaning to the word given below?Mitigate DiminishDivulgeDedicateDenote
2.8k
views
answered
Jan 8, 2018
Verbal Aptitude
gatecse-2012
verbal-aptitude
meaning
easy
+
–
9
votes
25
GATE CSE 2012 | Question: 57
Choose the most appropriate alternative from the options given below to complete the following sentence: Despite several _________ the mission succeeded in its attempt to resolve the conflict. attempts setbacks meetings delegations
Choose the most appropriate alternative from the options given below to complete the following sentence:Despite several _________ the mission succeeded in its attempt to ...
2.9k
views
answered
Jan 8, 2018
Verbal Aptitude
gatecse-2012
verbal-aptitude
easy
most-appropriate-alternative
+
–
4
votes
26
GATE CSE 2016 Set 1 | Question: 55
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ ... $100$ milliseconds. Assuming no frame is lost, the sender throughput is ________ bytes/ second.
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ bytes and the transmission rate at the sender is $80\...
26.1k
views
answered
Nov 12, 2017
Computer Networks
gatecse-2016-set1
computer-networks
stop-and-wait
normal
numerical-answers
+
–
2
votes
27
GATE CSE 2015 Set 3 | Question: 6
Consider a CSMA/CD network that transmits data at a rate of $100\;\textsf{Mbps}\; (10^8\;\text{bits}$ per second) over a $1\;\textsf{km}$ (kilometre) cable with no repeaters. If the minimum frame size required for this network is $1250\;\text{bytes},$ What is the signal speed $\textsf{(km/sec)}$ in the cable? $8000$ $10000$ $16000$ $20000$
Consider a CSMA/CD network that transmits data at a rate of $100\;\textsf{Mbps}\; (10^8\;\text{bits}$ per second) over a $1\;\textsf{km}$ (kilometre) cable with no repeat...
13.8k
views
answered
Nov 12, 2017
Computer Networks
gatecse-2015-set3
computer-networks
congestion-control
csma-cd
normal
+
–
2
votes
28
GATE CSE 2015 Set 1 | Question: 29
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than ... respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is__________________.
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A...
13.3k
views
answered
Nov 12, 2017
Computer Networks
gatecse-2015-set1
computer-networks
normal
numerical-answers
congestion-control
+
–
0
votes
29
quick sort
1.1k
views
answered
Nov 7, 2017
Algorithms
sorting
quick-sort
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register