Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged test-series
0
votes
1
answer
211
Applied Test Series
How big would the window size have to be for the channel utilization to be greater than 98 percent and the bandwidth is 1 Gbps? Suppose that the size of a packet is 1,500 bytes, including both header fields and data. The one way propagation delay is 15 milliseconds for the channel ?
How big would the window size have to be for the channel utilization to be greater than 98 percent and the bandwidth is 1 Gbps? Suppose that the size of a packet is 1,500...
LRU
1.3k
views
LRU
asked
Oct 4, 2021
Computer Networks
test-series
computer-networks
data-link-layer
+
–
1
votes
1
answer
212
3-Address Code Generation
Hi Everyone, For this the Given Answer is 5, I got 4. I am now confused about how the 3 address code is generated here.
Hi Everyone,For this the Given Answer is 5, I got 4. I am now confused about how the 3 address code is generated here.
Nihal Singh
1.4k
views
Nihal Singh
asked
Oct 4, 2021
Compiler Design
compiler-design
three-address-code
static-single-assignment
test-series
+
–
2
votes
1
answer
213
Applied Test Series
Consider the size of the congestion window of a TCP connection be 40 KB when a timeout occurs. The round trip time of the connection is 50 msec and the maximum segment size used is 2 KB. How much time it will be required(in milli sec) to reach the congestion window of 30 KB?
Consider the size of the congestion window of a TCP connection be 40 KB when a timeout occurs. The round trip time of the connection is 50 msec and the maximum segment si...
LRU
546
views
LRU
asked
Oct 4, 2021
Computer Networks
computer-networks
congestion-control
tcp
test-series
+
–
1
votes
1
answer
214
Applied Test Series
The packet is sent from source to router with the link having the maximum transmission unit (MTU) as 480 bytes, the header is of size 20 bytes. The intermediate fragment size is X and the last fragment size is Y when the packet size is of 2000 bytes including the header. Calculate the value of X+Y in bytes?
The packet is sent from source to router with the link having the maximum transmission unit (MTU) as 480 bytes, the header is of size 20 bytes. The intermediate fragment ...
LRU
889
views
LRU
asked
Oct 4, 2021
Computer Networks
computer-networks
network-layer
test-series
fragmentation
+
–
0
votes
1
answer
215
Applied Test Series
Suppose a router receives an IP packet containing 600 data bytes and has to forward the packet to a network with a maximum transmission unit of 200 bytes. Assume that the IP header is 20 bytes long. What will be the fragment offset of the third fragment ?
Suppose a router receives an IP packet containing 600 data bytes and has to forward the packet to a network with a maximum transmission unit of 200 bytes. Assume that the...
LRU
650
views
LRU
asked
Oct 4, 2021
Computer Networks
computer-networks
network-layer
test-series
fragmentation
+
–
0
votes
1
answer
216
Applied Test Series
A PC has just booted up and wants to communicate with a host on a remote subnet. The PC knows the IP addresses of its default gateway and the remote host. However, in order to properly construct a frame, the PC needs an appropriate destination MAC address. What MAC address does the PC need to learn, and what protocol will the PC use to learn that MAC address?
A PC has just booted up and wants to communicate with a host on a remote subnet. The PC knows the IP addresses of its default gateway and the remote host. However, in ord...
LRU
925
views
LRU
asked
Oct 4, 2021
Computer Networks
computer-networks
network-layer
test-series
+
–
3
votes
1
answer
217
Applied Test Series
How to approach with such questions. Do we have to generate strings to validate the property of the grammars ?
How to approach with such questions. Do we have to generate strings to validate the property of the grammars ?
LRU
358
views
LRU
asked
Oct 3, 2021
Theory of Computation
test-series
theory-of-computation
context-free-grammar
+
–
1
votes
1
answer
218
Applied Test Series
The language accepted by the given PDA is
The language accepted by the given PDA is
LRU
280
views
LRU
asked
Oct 3, 2021
Theory of Computation
theory-of-computation
context-free-language
npda
test-series
+
–
3
votes
1
answer
219
Applied Test Series
On any given Sunday, Sam initiates a connection with his girlfriend Alice in order to plan out what movie they're going to watch on Tuesdays with Morrie. This Sunday, immediately after Sam initiates the connection, Alice decides to send him a 60 KB ... congestion window of 1. Neglect queuing and processing delays at both the sender and receiver, and assume there are no losses.
On any given Sunday, Sam initiates a connection with his girlfriend Alice in order to plan out what movie they’re going to watch on Tuesdays with Morrie. This Sunday, i...
LRU
639
views
LRU
asked
Oct 1, 2021
Computer Networks
computer-networks
tcp
congestion-control
test-series
+
–
0
votes
1
answer
220
Applied Test Series
Consider the effect of using additive increase multiplicative decrease(AIMD) on a line with propagation delay of 10ms.The receive window is 24KB and the maximum segment size is 2KB. How long does it take to completely send full window size segment in ms initial threshold of 20KB?
Consider the effect of using additive increase multiplicative decrease(AIMD) on a line with propagation delay of 10ms.The receive window is 24KB and the maximum segment s...
LRU
589
views
LRU
asked
Sep 30, 2021
Computer Networks
computer-networks
tcp
congestion-control
test-series
+
–
0
votes
1
answer
221
Applied Test Series
Consider the effect of using slow start on a line with 12 msec round trip time. The size of the congestion window is set to 40 KB. The sender side threshold is set to 20 KB. After 7th transmission a time-out occurs, after timeout the time taken to send the first full window of 20 KB is (in msec). ? [ Assume window size at the start of the slow start phase is 2 KB, MSS=2KB]
Consider the effect of using slow start on a line with 12 msec round trip time. The size of the congestion window is set to 40 KB. The sender side threshold is set to 20 ...
LRU
493
views
LRU
asked
Sep 30, 2021
Computer Networks
computer-networks
tcp
congestion-control
test-series
+
–
2
votes
1
answer
222
GATE ACADEMY TEST SERIES
Under a relational database if table A has a foreign key constraint referencing to another table B, then Each tuple in A is related to zero or one tuple of B. Each tuple in A is related to exactly one tuple of B. Each tuple of A is related to zero or more tuple of B. None of these.
Under a relational database if table A has a foreign key constraint referencing to another table B, then Each tuple in A is related to zero or one tuple of B.Each tuple i...
LRU
306
views
LRU
asked
Sep 28, 2021
Databases
database-design
test-series
relational-model
+
–
0
votes
1
answer
223
GATE ACADEMY TEST SERIES
What is the minimum number of students, each of whom comes from one of the 50 states, who must be enrolled in a university to guarantee that there are at least 100 who come from the same state?
What is the minimum number of students, each of whom comes from one of the 50 states, who must be enrolled in a university to guarantee that there are at least 100 who co...
LRU
672
views
LRU
asked
Sep 26, 2021
Mathematical Logic
pigeonhole-principle
discrete-mathematics
test-series
+
–
0
votes
0
answers
224
Go screening test 1
How to check solutions of screening test 1 for gate 2020?
How to check solutions of screening test 1 for gate 2020?
Mayankprakash
289
views
Mayankprakash
asked
May 7, 2019
Others
test-series
+
–
3
votes
2
answers
225
Made Easy Test Series:TOC-Turing Machine
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length}$P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on whi...
srestha
1.0k
views
srestha
asked
Apr 30, 2019
Theory of Computation
theory-of-computation
turing-machine
test-series
+
–
0
votes
0
answers
226
IS THERE ANY other SITE FOR TEST SERIES SUBJECT WISE for NTA NET CS
hii guys there are lot of sites providing Q/A for ugcnet cs but not test series, some sites provide but not good quality they provide BANK,GATE,RAILWAYS IN TEST SERIES. I saw only one site Career Endeavour is good. IS THERE ANY other SITE FOR TEST SERIES SUBJECT WISE for NTA NET CS
hii guys there are lot of sites providing Q/A for ugcnet cs but not test series, some sites provide but not good quality they provide BANK,GATE,RAILWAYS IN TEST SERIES. I...
Adnan Ashraf
657
views
Adnan Ashraf
asked
Apr 27, 2019
CBSE/UGC NET
test-series
ugcnet
ntanet
+
–
1
votes
1
answer
227
Made Easy Test Series:TOC-DFA
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________ Answer will be $3$ or $6?$
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________Answer will be...
srestha
935
views
srestha
asked
Apr 23, 2019
Theory of Computation
theory-of-computation
test-series
made-easy-test-series
+
–
1
votes
0
answers
228
mock test
with deep regards team memmber of GATE Overflow there are only two mock tests available for NTA NET, there should be test series subject wise and full length also like of GATE MOCK EXAMS here. plz,that will be your Great Contribution @Arjun sir,@Bikram THANKS
with deep regards team memmber of GATE Overflow there are only two mock tests available for NTA NET, there should be test series subject wise and full length also like of...
Adnan Ashraf
487
views
Adnan Ashraf
asked
Apr 1, 2019
CBSE/UGC NET
ugcnet2019
test-series
net
ntanet
exam
+
–
1
votes
0
answers
229
dbms ace test series
SQL view is said to be updatable (that is, inserts, updates or deletes can be applied on the view) if which of the following conditions are satisfied by the query defining the view? 1. The select clause contains only attribute names of the relation, and ... clause has only one database relation. 3. The query does not have a group by or having clause. 4. All of the mentioned
SQL view is said to be updatable (that is, inserts, updates or deletes can be applied on the view) if which of the following conditions are satisfied by the query definin...
Priyansh Singh
323
views
Priyansh Singh
asked
Mar 29, 2019
Databases
databases
test-series
+
–
0
votes
1
answer
230
MOCK TEST
Consider an array consisting of –ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign altogether i.e all +ve on one side and then all -ve on the other? a)N-1 b)N c)N+1 d) (N*(N-1))/2 answer given is a)
Consider an array consisting of –ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign a...
Dipanshu Rana
373
views
Dipanshu Rana
asked
Mar 22, 2019
Algorithms
time-complexity
algorithm-design
test-series
+
–
0
votes
0
answers
231
Virtual GATE
Let A be a regular set. Consider the two sets below L1={x | $\exists n\geq 0, \exists y\epsilon A :$ y=$x^n$} L2={x | $\exists n\geq 0, \exists y\epsilon A :$ x=$y^n$} which of the following statements is true? L1 and L2 both are regular L1 is regular but L2 is not L1 is not regular but L2 is L1 and L2 both are non-regular
Let A be a regular set. Consider the two sets belowL1={x | $\exists n\geq 0, \exists y\epsilon A :$ y=$x^n$}L2={x | $\exists n\geq 0, \exists y\epsilon A :$ x=$y^n$}which...
aditi19
497
views
aditi19
asked
Mar 17, 2019
Theory of Computation
virtual-gate
test-series
theory-of-computation
regular-language
regular-expression
+
–
1
votes
0
answers
232
GeeksforGeeks
Let G be a graph with no isolated vertices, and let M be a maximum matching of G. For each vertex v not saturated by M, choose an edge incident to v. Let T be the set of all the chosen edges, and let L = M ∪ T. Which of the following option is TRUE? A L is always ... G. B L is always a minimum edge cover of G. C Both (A) and (B) D Neither (A) nor (B) Can anyone pls help solving this?
Let G be a graph with no isolated vertices, and let M be a maximum matching of G. For each vertex v not saturated by M, choose an edge incident to v. Let T be the set of ...
Ashish Goyal
1.5k
views
Ashish Goyal
asked
Jan 30, 2019
Graph Theory
graph-matching
discrete-mathematics
graph-theory
test-series
+
–
0
votes
2
answers
233
Virtual Gate
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let G be a complete graph on 10 vertices. Let u, v, w be three distinct vertices in G. How many simple paths are there from u to v going through w?
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex...
sudharshan
792
views
sudharshan
asked
Jan 24, 2019
Graph Theory
discrete-mathematics
graph-theory
test-series
+
–
0
votes
1
answer
234
Dynamic programming
My answer came out to be 13: because when we will compute T(13) { as we are using Dynamic programming , it will have to compute value of T(12),T(11),…...T(2) only once(as it will store it and reuse it) so the stack size will be 1 (for T(13))+11 (for T(12),T(11),…...T(2)) = 12…...(48/4) } will any one help me out
My answer came out to be 13:because when we will compute T(13){as we are using Dynamic programming , it will have to compute value of T(12),T(11),…...T(2) only once(as ...
Nandkishor3939
702
views
Nandkishor3939
asked
Jan 22, 2019
Algorithms
algorithms
dynamic-programming
programming
test-series
+
–
0
votes
0
answers
235
HOW TO ATTEMPT MOCK TEST
#mocktest #suggestion Which of these strategies will be best for attempting mock test ? 1- FCFS (Attepmting each question as it's come ) 2- SJF (Solving easy then moderate & then difficult by finding their level ) 3- Round Robin + SRTF ( Giving ... time of 0.5-2 minute then solving remaining problems ) 4- Any other strategy . If possible give reason to your answer
#mocktest #suggestionWhich of these strategies will be best for attempting mock test ?1- FCFS (Attepmting each question as it's come )2- SJF (Solving easy then moderate ...
Ajay Maurya 6
267
views
Ajay Maurya 6
asked
Jan 21, 2019
Others
preparation
test-series
general
+
–
1
votes
1
answer
236
Time complexity
Rackson
563
views
Rackson
asked
Jan 20, 2019
Algorithms
time-complexity
test-series
+
–
3
votes
2
answers
237
TOC-Turing Machine
Consider the given below Turing Machine and identify the correct language accepted: (a+b)*aa(a+b)* b*a(bb*a)*a b*ab*a None of these The answer is given as (1). But I think (3) is correct as well. Can anyone tell me why only (1) is correct.
Consider the given below Turing Machine and identify the correct language accepted:(a+b)*aa(a+b)*b*a(bb*a)*ab*ab*aNone of theseThe answer is given as (1). But I think (3)...
Anurag Aizen Mukherj
1.0k
views
Anurag Aizen Mukherj
asked
Jan 20, 2019
Theory of Computation
theory-of-computation
turing-machine
test-series
+
–
0
votes
2
answers
238
Compiler Design
Type of ERROR
Type of ERROR
balchandar reddy san
981
views
balchandar reddy san
asked
Jan 19, 2019
Compiler Design
compiler-design
lexical-analysis
test-series
+
–
0
votes
1
answer
239
asymptotic notation
O(n) O(Log n) O(Log log n) none
O(n)O(Log n)O(Log log n)none
gate_forum
474
views
gate_forum
asked
Jan 13, 2019
Algorithms
algorithms
recurrence-relation
asymptotic-notation
test-series
+
–
0
votes
1
answer
240
toplogical sort
none
none
gate_forum
445
views
gate_forum
asked
Jan 13, 2019
Algorithms
topological-sort
graph-algorithm
test-series
+
–
Page:
« prev
1
...
3
4
5
6
7
8
9
10
11
12
13
...
29
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register