SET D

HINT FOR EACH QUESTION IS WRITTEN:

Q1. WHICH OF THE FOLLOWING ARE DECIDABLE?
ANS- (D) 3,4
Exp- 3.If L is a RL , then its complement L is also regular is decidable.
4. If L is a RECURSIVE LANGUAGE then its complement L is also recursive is decidable.
Q2. GIVEN THE LANGUAGE L={ab,aa,baa} which of the following are in L*?
ANS- (C)
Exp- 1,2,4 are accepted in the specified language.
Q3. IN THE IPv4 ADDRESSING FORMAT:
ANS-(D)
The total number of networks possible is determined by counting first 3 netidpart in class C, which is
2
24
Q4. Which of the following transport layer protocols is used support electronic mail?
ANS-(A)
SMTP is used is support electronic mail in the given option electronic mail.
Q8. LET W(N) AND A(N) DENOTE RESPECTIVELY, THE WORST CASE AND AVG. CASE
ANS-(C)
EXP- The worst is the order of Big OH, A(n)= O(W(n))
Q10. THE RECURRENCE RELATION FOR TOWER OF HANOI :
ANS-(D)
EXP- The recurrence relation is T(n)=T(n-1)+1+T(n-1)= 2T(n-1)+1
Q11. WHICH OF THE FOLLOWING IS TRUST FOR SQL QUERY?
ANS-(D)
EXP- The query Q and S are true.
Q12. Given the basic ER & relational model
ANS-(C)
The statement is incorrect, because an attribute cannot have more than one value in an attribute.

Q13. What is the complement of the language accepted by NFA

ANS- (B)
Exp- The complement will accept only NULL string.
Q16. The protocol data unit
ANS-(C)
The transmittable unit on application layer is message.
Q18. A process executes the code:
ANS-(C)
Exp: The total number of process created using n fork is 2
n
-1
Q19. The decimal value of 0.5
ANS-(B)
Exp- converting the number into 23 bit fraction and 8 bit mantissa it will be option B.
Q20. The truth table
For a Boolean function
ANS-(A)
EXP- THE F(X,Y) IS X ONLY.
Q21. THE WORST CASE RUNNING TIME FOR SEARCH
ANS-(A)
EXP- It will be nlogn.
Q22. Assuming P!=NP
ANS-(B)
EXP- THE INTERSECTION OF NP-COMPLETE AND P WOULD BE PHI ONLY.
Q23. WHAT WILL BE THE OUTPUT OF THE PROGRAM:
ANS-(C)
EXP- THE OUTPUT OF THE PROGRAM WILL PRINT ALL STATEMENTS.
Q24. WHICH OF THE FOLLOWING IS TRUE;
ANS-(C)

EXP-EVERY RELATION IN BCNF IS ALWAYS IS IN 3NF

Q26. CONSIDER THE SET OF STRINGS ON {0,1}FOR A DFA
ANS-(D)
EXP-THE GIVEN TRANSITION TABLE CAN GIVE THE VALID DFA.
Q27.THE HEIGHT OF A TREE
ANS-(A)
EXP- THE HEIGHT OF THE TREE CAN BE DETERMINED BY INPUTTING THE OPTION A.
Q29. CONSIDER A SOURCE COMPUTER(S)
ANS-(C)
EXP- T
f
=1ms;
t
p
=1ms;
So, to send all 1000 packets from S TO D require 3000 ms.
Q30. Suppose R1(A,B) and R2(c,d)
Ans-(a)
Exp:
The option a will give an empty relation.
Q31. Consider the virtual page reference string:
Ans(b)
Exp:-LRU FAULT=9
FIFO FAULT=6
OPTIMAL FAULT=4
Q33. Consider the directed graph shown in the figure
Ans-(b)
Exp- Dijkstras shortest path algorithm starts with minimum edge weight sequence.
Q34. A list of n strings, each of length n,
Ans-(a)
Exp- The order of the algorithm is nlogn.

Q35. Let G be a complete undirected graph on 6 vertices

Ans-(d)
Exp- 15*4!=360
Q37. Consider the program given below,in block-structed
Ans-(d)
Exp- The flow of the program control will pass in reverse order.
Q38. Suppose a circular queue
Ans(a)
Exp- full:(REAR+1) mod n== FRONT
Empty: REAR== FRONT
Q39. An ISP has the following chunk of CIDR-based IP
Ans(C)
Exp- The half of the bits will be reserved for Organization A so it will be /22 and for Organization B it
will be /21
Q42. Consider the 3 processes P1,P2,P3
Ans(C)
Exp- the completion order for FCFS is P1,P2,P3 and for RR2 is P1,P3,P2
Q43. What is the minimal form of the k-map
Ans(B)
Exp- The minimized expression is bd+bc
Q46.which is of the following graph is isomorphic
Ans(b)
Exp- Isomorphic graph are those whose vertices, edges and in-degree, out-degree must be same.
Q47.consider the following transcations with
Ans(b)
Exp- the given schedule is not conflict serializable schedule as not all combinations are possible.

Common data question q48-49

Consider the following relations-
Q48. How many tuples does the result of the sql
Ans(b)
Exp- The nested query will output 0 tuples, so all 3 tuples must be selected from A.id.
Q49. How many tuples does the result of the relational algebra query
Ans(a)
Exp- 7 tuples will be selected after applying theta join operation.
Common data question q50-51
Consider the following C code segment-
Q50- what output will be generated
Ans(d)
Exp- The output is equivalent to option D after running the program.
Q51- what output will be
Ans-(C)
Exp- The output is equivalent to option C after running the program.

LINKED QUESTION q52-53
Q52- THE NUMBER OF BITS IN THE TAG FIELD
ANS(C)
EXP- BLOCK SIZE=5 bits
Number of Sets=11 bits
Tag size=32-16=16 bits
Q53- the size of the cache tag directory
ANS(A)
Exp- The size of TAG field is =20*2
3
*2
10
=160 Kbits

STATEMENT FOR LINKED QUESTIONQ54-Q55

FOR THE GRAMMAR BELOW
Q54- THE FIRST AND FOLLOW
ANS-(A)
Q55- the appropriate entries
ANS-(D)