Register
Filter

Answers by resuscitate

2 votes
4
MadeEasy Test Series: Theory Of Computation - Regular Languages
Which of the following is a non-regular language? $L = \{wxwy \mid x,y,w \in (a+b)^+\}$ $L = \{xwyw \mid x,y,w \in (a+b)^+\}$ $L = \{wxyw \mid x,y,w \in (a+b)^+\}$ All of these
Which of the following is a non-regular language?$L = \{wxwy \mid x,y,w \in (a+b)^+\}$$L = \{xwyw \mid x,y,w \in (a+b)^+\}$$L = \{wxyw \mid x,y,w \in (a+b)^+\}$All of the...
1 votes
6
IPv6
3 votes
7
tcp-max no of segments
Let a file of 16 GB has to be transferrred from host A to host B. Assume an MSS size of 2048B. Then what is maximum number of segments that can be transferred such that TCP sequence no don't get exhausted.Assume TCP sequence field 32 bits a)2^21 b)2^23 c)2^11 d)none
Let a file of 16 GB has to be transferrred from host A to host B. Assume an MSS size of 2048B. Then what is maximum number of segments that can be transferred such that ...
0 votes
9
Computer Arch.
Given a 32 bit processor with 16 MB main memory, 32 KB 4 way set associative on chip cache and block size of 16 words, The number of tag bits in memory address format are : ? Here we will take the length of instruction as 32 bits or 24 ? Why ?
Given a 32 bit processor with 16 MB main memory, 32 KB 4 way set associative on chip cache and block size of 16 words, The number of tag bits in memory address format are...
10 votes
11
Conservative 2 phase locking.
Is it Conservative 2 Phase locking (C2PL) ? T1 LOCK-X (A) LOCK-S (B) R(A) R(B) W(A) UNLOCK (A) COMMIT UNLOCK (B)
Is it Conservative 2 Phase locking (C2PL) ?T1LOCK-X (A)LOCK-S (B)R(A)R(B)W(A)UNLOCK (A)COMMITUNLOCK (B)
4 votes
14
Consider the following ER-Model
2 votes
18
MadeEasy Test Series: Combinatory - Permutation And Combinations
5 member commities are to be formed out of 10 people. The names are written in chits of paper and put into 6 boxes. Atleast _______ chits go into the same box.
5 member commities are to be formed out of 10 people. The names are written in chits of paper and put into 6 boxes. Atleast _______ chits go into the same box.
0 votes
19
average memory access time
Caption
Caption
5 votes
21
Ethernet
if an ethernet station collide 4 time in trying to transmit a single frame how long might it be before the next attempt? a)768 microsec b)819.2 microsec c)409.6 microsec d)none
if an ethernet station collide 4 time in trying to transmit a single frame how long might it be before the next attempt?a)768 microsecb)819.2 microsecc)409.6 microsecd)no...
0 votes
23
Binary exponential backoff
if 50 stations are there and if each slot contain 25 microsec then what would be max waiting time for a station for safe transmission a)200 b)300 c)250 d)400
if 50 stations are there and if each slot contain 25 microsec then what would be max waiting time for a station for safe transmissiona)200 b)300 c)250 d)400
6 votes
24
Is this language DCFL
Hi , my question is : is this language D ( w x wR ) DCFL or Non deterministic CFL ?
Hi , my question is : is this language D ( w x wR ) DCFL or Non deterministic CFL ?
1 votes
25
Fragmentation
header size not given.
header size not given.
1 votes
26
TCP MSS
1 votes
27
Slow start
my ans 65ms
my ans 65ms
1 votes
29
number of WAR dependencies
Consider the following instructions. $I_1:R_1=100$ $I_2:R_1=R_2+R_4$ $I_3:R_2=R_4+25$ $I_4:R_4=R_1+R_3$ $I_5:R_1=R_1+30$ Calculate sum of ($\text{WAR, RAW and WAW}$) dependencies the above instructions. $10$ $12$ $6$ $8$
Consider the following instructions.$I_1:R_1=100$$I_2:R_1=R_2+R_4$$I_3:R_2=R_4+25$$I_4:R_4=R_1+R_3$$I_5:R_1=R_1+30$Calculate sum of ($\text{WAR, RAW and WAW}$) dependenci...
3 votes
30
Sliding window
consider sliding window algorithm with Ws =9 and Wr=7 and no out of order arrivals .what is smallest value of Max sequence number? a) 7 b)15 c)8 d )16
consider sliding window algorithm with Ws =9 and Wr=7 and no out of order arrivals .what is smallest value of Max sequence number?a) 7 b)15 c)8 d )16
Page: