# Questions by Abhisek Tiwari 4

–1 vote
1
If a processor has 64 address lines and 8 data lines. Then find maximum number of opcodes generated by processor. a)6 b)9 c)3 d)8
2
Suppose a dequeue is stored in a circular array with N memory cells. At which of the following condition is the dequeue is full? (i) LEFT = N and RIGHT = 1 (ii) LEFT = RIGHT + 1 (iii) LEFT = 1 and RIGHT = N (iv) LEFT = RIGHT - 1 + N (i) and (iii) (iii) and (iv) (ii) and (iii) (i) and (iv)
–1 vote
3
Mod X counter then X=? Nothing mentioned about J0,K0,J1,K1 ,J2,K2 how should i approach such Q? considering all 0?
4
Ouput please explain 2nd and 3rd Output.
5
In ipv4 and Ipv6 fragmented Datagrams are reassembled only at Destination. is it False?
6
A graph with each vertex has even degree contain Hamiltonian Cycle. True/False plz explain how to ensure Hamiltonian Cycle.
7
L={ XWX^r | x belongs to (0,1)+ ,W belongs to (0,1)*} it will be regular i.e can be reduced to form start and end with same symbol. but if domain of x==(0,1)* will still be regular?? i think no it will be DCFL
8
can anyone plz provide ref for delay in Direct Mapping,Set Associative and Associative mapping in terms of mux and comparator delay!
9
A cyclic group O(G)=200 g be its generator O(g^x)=100 for some x.what is value of x? a.1 b.2 c.3 d.4 1 and 3 cant be possible as [order of generator equal to order of group] how to choose bw 2 and 4???
10
True/False SJF and SRTF both suffer from Convoy effect. please tell reason.
11
Checking for Euler Path i.A graph has Euler path if exactly two vertices is of odd degree. if a graph have euler circuit=>all vertices even degree=>euler circuit which already cover euler path. am i correct? i is necessary and sufficient condition? So for checking Euler ... check either 1.Euler Circuit or 2.Exactly two odd degree then it will have euler path but not euler circuit. is it correct?
12
1.Rigorous 2PL avoid cascading rollback but suffer from deadlock. 2.Strict,Rigorous,Conservative all are Conflict Serilizable. True?
13
Lost Update Problem: Ti W(A) then no read on A(there might be other operation) then Tj W(A) =====>lost update(WW) am i correct? or if consecutive two write on same data by Ti then Tj.???
14
1.”Maximal and Minimal element is unique in case of Bounded Lattice” [This is necessary condition not sufficient.] i.e Upper bound =Maximal and Lower bound =Minimal for Bounded lattice. 2.Upper bound and lower bound in Bounded lattice is unique. am i correct???
15
if a language is recognized by Non deterministic Polynomial time TM then L is recognized by Deterministic polynomial time TM
16
Number of state in DFA accepting a language L={anbn,1<= n <=3 } over {a,b} ……..
17
1. 0(000)*0(000)* == 00(000)* is it equal how?