Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
set2018
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by set2018
2
answers
1
number of tokens
1) 8 2) 9 3) 12 4) 10
1) 82) 93) 124) 10
655
views
commented
Jan 7, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
0
answers
2
Leaf node of the tree always have only inherited atrribute.
Leaf node of the tree always have only inherited atrribute. State true or false.
Leaf node of the tree always have only inherited atrribute.State true or false.
294
views
asked
Jan 7, 2018
Compiler Design
compiler-design
+
–
3
answers
3
M.E test
Let G be a grammar with the following productions. If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an item in the initial state?
Let G be a grammar with the following productions.If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an ...
1.4k
views
commented
Jan 7, 2018
Compiler Design
compiler-design
parsing
lr-parser
made-easy-test-series
numerical-answers
+
–
4
answers
4
GATE CSE 2004 | Question: 11
Consider the following statements with respect to user-level threads and kernel-supported threads context switch is faster with kernel-supported threads for user-level threads, a system call can block the entire process Kernel supported threads can be scheduled independently User level threads ... ) and (IV) only (II) and (III) only (I) and (III) only (I) and (II) only
Consider the following statements with respect to user-level threads and kernel-supported threadscontext switch is faster with kernel-supported threadsfor user-level thre...
27.4k
views
commented
Dec 15, 2017
Operating System
gatecse-2004
operating-system
threads
normal
+
–
0
answers
5
congestion window size
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 MSS and the threshold at the start is 1st transmission is 16 MSS. Assume TCP use over a lossy link i.e., timeout occur after transmission of 7th packet . The congestion window size at the end of 14 RTT is _________ (in MSS).
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 MSS and the thresho...
1.3k
views
commented
Dec 14, 2017
1
answer
6
largest prime number ?
If N = 15! – 13!, then the largest prime number that divides N is _____________.
If N = 15! – 13!, then the largest prime number that divides N is _____________.
672
views
closed
Dec 13, 2017
3
answers
7
#testseries
Consider a system having ‘N ’ resources of the same type. ‘N’ resources are shared between 3 processes P1 , P2 and P3 which have individual peak demand of 4, 6 and 8. The minimum value of ‘N’ to ensure that deadlock will never occur, if it is given the maximum requirement for combination of P1 and P3 is 9 are__________.
Consider a system having ‘N ’ resources of the same type. ‘N’ resources are shared between 3 processes P1 , P2 and P3 which have individual peak demand of 4, 6 an...
2.2k
views
comment edited
Dec 13, 2017
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
0
answers
8
how many number of clock pulses
623
views
commented
Dec 12, 2017
Digital Logic
digital-logic
+
–
0
answers
9
What is the output of the combinational circuit?
Consider the combinational circuit given below: What is the output of this combinational circuit?
Consider the combinational circuit given below:What is the output of this combinational circuit?
819
views
commented
Dec 12, 2017
Digital Logic
digital-logic
combinational-circuit
+
–
0
answers
10
digital circuit
325
views
commented
Dec 12, 2017
1
answer
11
B+ tree
Assume a system has following parameters to construct a B+ tree. The specification of the tree are: • Size of search key is 15 B • Size of block is 512 B • Size of record pointer is 9 B • Size of block pointer is 8 B The maximum number of keys that can be accommodated in each non-leaf node of the tree is ________.
Assume a system has following parameters to construct a B+ tree. The specification of the tree are:• Size of search key is 15 B• Size of block is 512 B• Size of rec...
751
views
commented
Dec 12, 2017
Databases
databases
b-tree
tree
+
–
1
answer
12
OUTPUT OF PROGRAM
357
views
answer selected
Dec 11, 2017
Programming in C
programming-in-c
+
–
4
answers
13
Find number of variables in optimized code
Consider following 3 address code t1 = t+e t2 = g+a t3 = t1*t2 t4 = t2+t2 t5 = t4+t3 The minimum number of temporary variables that can be used in equivalent 3-address code of above code is Approach: t = t+e, g = g+a, t = t*g, g = g+g,t = t+g. Hence 4 temporary variables are needed. Is this right?
Consider following 3 address codet1 = t+et2 = g+at3 = t1*t2t4 = t2+t2t5 = t4+t3The minimum number of temporary variables that can be used in equivalent 3-address code of ...
2.3k
views
commented
Dec 11, 2017
Compiler Design
compiler-design
intermediate-code
three-address-code
+
–
3
answers
14
self doubt
if a boolean function having cyclic prime implicants k-map then the function is having how many minimal form?? F(A,B,C)
if a boolean function having cyclic prime implicants k-map then the function is having how many minimal form?? F(A,B,C)
4.6k
views
commented
Dec 11, 2017
Digital Logic
boolean-algebra
+
–
0
answers
15
deadlock
Consider a system having ‘N ’ resources of the same type. ‘N’ resources are shared between 3 processes P1 , P2 and P3 which have individual peak demand of 4, 6 and 8. The minimum value of ‘N’ to ensure that deadlock will never occur, if it is given the maximum requirement for combination of P1 and P3 is 9 are__________.
Consider a system having ‘N ’ resources of the same type. ‘N’ resources are shared between 3 processes P1 , P2 and P3 which have individual peak demand of 4, 6 an...
272
views
closed
Dec 11, 2017
3
answers
16
Shortest path - bellman ford and floyd warshall
Consider the following statements with respect to a directed graph G in which edges can have positive or negative edge length but that has no negative cycles: S1 : The Bellman-Ford algorithm correctly computes shortest path ... Floyd-Warshall algorithm correctly computes shortest path lengths between every pair of vertices. Which of them is correct?
Consider the following statements with respect to a directed graph G in which edges can have positive or negative edge length but that has no negative cycles:S1 : The Be...
3.1k
views
commented
Dec 11, 2017
Algorithms
algorithms
shortest-path
+
–
1
answer
17
equivalence class
Consider the following regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is __________.
Consider the following regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is __________.
272
views
asked
Dec 10, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
18
Which of the following is true?
1)S1 is regular but not S2 2)S2 is regular but not S1 3)S1 and S2 are not regular 4)S1 and S2 are regular
1)S1 is regular but not S22)S2 is regular but not S13)S1 and S2 are not regular4)S1 and S2 are regular
2.0k
views
commented
Dec 10, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
19
Which of the following language generated by given grammar?
Which of the following language generated by given grammar? 1) L = {w : na(w) and nb(w) both are even} 2) L = {w : na(w) and nb(w) both are odd} 3) L = {w : na(w) or nb(w) are even} 4) L = {w : na(w) or nb(w) are odd}
Which of the following language generated by given grammar?1) L = {w : na(w) and nb(w) both are even}2) L = {w : na(w) and nb(w) both are odd}3) L = {w : na(w) or nb(w) a...
439
views
answer selected
Dec 10, 2017
Theory of Computation
theory-of-computation
+
–
2
answers
20
Madeeasy Test Series
Consider the following statements: S1: If a Turing machine can't write on the portion of the tape that contains the input, then it can only recognize regular languages. S2: Language $\{1^n \mid n \text{ is prime}\}$ is decidable. S3: Problem of determining ... . Which of the following is true? Only S1 and S2 are true Only S2 and S3 are true Only S3 is true All of these
Consider the following statements:S1: If a Turing machine can't write on the portion of the tape that contains the input, then it can only recognize regular languages.S2:...
2.1k
views
commented
Dec 10, 2017
Theory of Computation
theory-of-computation
decidability
+
–
0
answers
21
Concatenation of two different language
Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈ True or false
Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈True or false
377
views
asked
Dec 10, 2017
4
answers
22
GATE IT 2005 | Question: 85a
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, ...
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...
5.2k
views
commented
Dec 10, 2017
Computer Networks
gateit-2005
computer-networks
routing
normal
+
–
0
answers
23
context free language
Consider the following languages. The number of the above languages L1, L2, L3 and L4 are context free languages is ______. Answer given is 2 ,L2 and L4.My doubt is why L2 why not L3.I also got 2 .pls someone explain
Consider the following languages.The number of the above languages L1, L2, L3 and L4 are context free languages is ______.Answer given is 2 ,L2 and L4.My doubt is why L2 ...
574
views
commented
Dec 9, 2017
0
answers
24
identify the language ?
Let L = {ambnbkdl⎪(n+k = odd) only if m = l; m, n, k, l > 0}. Which of the following is true about L? 1)L is CFL but not DCFL 2)L is regular but not CFL 3)L is DCFL but not regular 4)none of the above
Let L = {ambnbkdl⎪(n+k = odd) only if m = l; m, n, k, l 0}. Which of the following is true about L?1)L is CFL but not DCFL2)L is regular but not CFL3)L is DCFL but not...
349
views
asked
Dec 8, 2017
Theory of Computation
theory-of-computation
+
–
0
answers
25
efficiency of protocol?
Assume there are 100 nodes are connected to a 1000 meter length of the coaxial cable. Using some protocol, each node can transmit 50 frames/second, where the average frame length is 2500 bits. The transmission rate at each node is 108 bps. The efficiency of this protocol is ________. (Upto 1 decimal place)
Assume there are 100 nodes are connected to a 1000 meter length of the coaxial cable. Using some protocol, each node can transmit 50 frames/second, where the average fram...
368
views
closed
Dec 8, 2017
1
answer
26
TCP message
Consider the following scenario: Suppose a TCP message that contains 900 B of data and 20 B of TCP header is passed to IP code at host A for delivery to B. IP header is of 20 B. Assume that link A-R1 has maximum frame size of 1024 B including a 14-B frame header, link R1 ... at each of the three links respectively are: A)920; 440; 440 B) 960; 460; 440 C) 960; 460; 460 D) 940; 460; 460
Consider the following scenario:Suppose a TCP message that contains 900 B of data and 20 B of TCP header is passed to IP code at host A for delivery to B. IP header is of...
775
views
asked
Dec 8, 2017
1
answer
27
Probability of Successful transmission
Q If probability of frame reaching safely is 0.1 then mean number of transmissions of a frame to make it success is _____. How to solve this question?
Q If probability of frame reaching safely is 0.1 then mean number of transmissions of a frame to make it success is _____.How to solve this question?
1.8k
views
commented
Dec 8, 2017
Computer Networks
computer-networks
probability
expectation
+
–
0
answers
28
TCP congestion window
Let the size of congestion window of a TCP connection be 38 KB when a timeout occurs. The propagation time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken (in msec) by the TCP connection to get back to 36 KB congestion window is ________
Let the size of congestion window of a TCP connection be 38 KB when a timeout occurs. The propagation time of the connection is 100 msec and the maximum segment size used...
610
views
commented
Dec 8, 2017
Computer Networks
computer-networks
tcp
+
–
0
answers
29
packet switching
Consider a source computer (S) transmitting a file of size 105 bits to a destination computer (D) over a network of three routers (R1 , R2 and R3) and four links (L1, L2, L3 and L4). L1 connects S to R1; L2 connects R1 to R2; L3 connects ... each of size 1000 bits. The total sum of transmission and propagation delays in transmitting the file from S to D is ________ (in msec).
Consider a source computer (S) transmitting a file of size 105 bits to a destination computer (D) over a network of three routers (R1 , R2 and R3) and four links (L1, L2,...
629
views
commented
Dec 8, 2017
4
answers
30
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
asked
Dec 7, 2017
Computer Networks
computer-networks
congestion-control
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register