Mock GATE -I(CSE)

(1)

No.1 Training center for

No.1 Training center for GATE/IES/JTO/PSUsin Bangalorein Bangalore

Questions 1 to 25 carry one mark each Questions 1 to 25 carry one mark each

1. I

1. If f A A ==

   

   

   

then then det det ((





) =) = (a)

(a) -2 -2 (b)(b) – – 1 1 (c) (c) 1 1 (d) (d) 22

2. The function





hashas (a) maximum at

(a) maximum at



(b) minimum at(b) minimum at



(c) (c) no no maximum maximum ((d) nod) no

minimum minimum 3. The order of

3. The order of truncation error in Runge-Kutta fourth order method istruncation error in Runge-Kutta fourth order method is (a) O (

(a) O (





) ) (b) (b) O O ((





) ) (c) (c) O O ((





) ) (d) (d) O O ((





))

4. If the

4. If the events S and events S and T T have equal have equal probabilities and are independent with P probabilities and are independent with P (S ∩ (S ∩ T) = T) = P > P > 0 0 then then P(S) =P(S) =

(a)

  

(b)(b)





(c)(c)



(d) P(d) P 5. Which of the following state is not true ?

5. Which of the following state is not true ? (a) DFA is

(a) DFA is equivalent in power to regular expressionequivalent in power to regular expression (b) The PDA is equivalent in power to CFL

(b) The PDA is equivalent in power to CFL (c) The DFA and NFA are equivalent in power (c) The DFA and NFA are equivalent in power (d)

(d) The DPPA and NPDA The DPPA and NPDA are equivalent in pare equivalent in powerower 6. Which of the following is true ?

6. Which of the following is true ?

(a) Though there are no RR conflicts in LR(1) but may be there in LALR (1). (a) Though there are no RR conflicts in LR(1) but may be there in LALR (1). (b) Though there are no SR conflicts in LR(1) but may be there in LALR (1). (b) Though there are no SR conflicts in LR(1) but may be there in LALR (1). (c) Though there are no SR conflicts in LALR(1) but may be there in SLR (1). (c) Though there are no SR conflicts in LALR(1) but may be there in SLR (1). (d) none.

(d) none.

7. Consider the grammar : 7. Consider the grammar :

In the goto goto graph of graph of LR(0) itemLR(0) items , we s , we findfind (a)

(a) SR SR conflicts conflicts (b) (b) RR RR conflicts conflicts (c) (c) both both (d) none(d) none 8.

8. The stack „S‟ The stack „S‟ is stored in is stored in an array indexed an array indexed as [ as [ 1 … 1 … N] N] and and TOP TOP pointer is initially at pointer is initially at zero position .zero position .

Peep( )

Peep( ) is a (non standis a (non standard ) stack routiard ) stack routine which is une which is used to desire sed to desire i th i th element with element with respect to TOPrespect to TOP pointer. Identify the correct statement to return the

pointer. Identify the correct statement to return the element :element : (a)

(a) S[TOP-1 S[TOP-1 -1] -1] (b) (b) S[TOP S[TOP -1] -1] (c) (c) S[TOP S[TOP -1 -1 +1] +1] (d) (d) S[TOP S[TOP +1 +1 -1]-1]

9. A binary search tree has been traversed to search for 88 . Identify which of the statements are correct : 9. A binary search tree has been traversed to search for 88 . Identify which of the statements are correct :

S1 : 58, 90, 60, 75, 78, 80, 85, 88 S1 : 58, 90, 60, 75, 78, 80, 85, 88 S2 : 58, 90, 95, 42, 75, 36, 85, 88 S2 : 58, 90, 95, 42, 75, 36, 85, 88 S3 : 12, 35, 54, 58, 90, 60, 89, 88 S3 : 12, 35, 54, 58, 90, 60, 89, 88

(2)

S4 : 12, 35, 78, 58, 31, 42, 36, 88 S4 : 12, 35, 78, 58, 31, 42, 36, 88 (a)

(a) S1 S1 only only (b) (b) S2, S2, S4 S4 (c) S1, (c) S1, S4 S4 (d) (d) S1, S1, S3S3 10.

10.





++









y + wxy + wx





= ………….= ………….

(a)





+ w+ w





(b)(b)





++





xx





(c)(c)





+ w ++ w +





(d) x + w(d) x + w





yy

11. Which of the following 2‟s complement signed number is divisible by

11. Which of the following 2‟s complement signed number is divisible by -3 & -5 ?-3 & -5 ? (a)

(a) 1111 1111 1111 1111 1011 1011 (b) (b) 1111 1111 1110 1110 00100010 (c)

(c) 1111 1111 1111 1111 0111 0111 (d) (d) 1111 1111 1110 1110 00010001 12. The following assembly language program is stored in

12. The following assembly language program is stored in byte addressable membyte addressable memory from decimalory from decimal address 800 onwards . address 800 onwards . MOV MOV





,,





(100) (100) 44 MOV MOV





,,





(100) (100) 44 ADD ADD





,,





22 MOV MOV





(100) ,(100) ,





44

If each word consume 64 bits what will be the decimal address saved on to stack on the occurrence of If each word consume 64 bits what will be the decimal address saved on to stack on the occurrence of interrupt during ADD instruction

interrupt during ADD instruction (a)

(a) 850 850 (b) (b) 880 880 (c) (c) 911 911 (d) (d) 912912 13. The disk d

13. The disk drive of rive of 20 GB contains 20 GB contains n plotters and n plotters and 640 cylinders 640 cylinders . There are 512 secto. There are 512 sectors per tracks rs per tracks andand 1024 bytes per sectors .

1024 bytes per sectors . What will be the number of What will be the number of recording surfaces and the size of recording surfaces and the size of physical address (inphysical address (in bits)

bits) (a)

(a) 8, 8, 35 35 (b) (b) 16, 16, 24 24 (c) (c) 32, 32, 24 24 (d) (d) 32, 32, 3535 14. Which of

14. Which of the following pagthe following page replacement method guarantees the mine replacement method guarantees the minimum number of page faults ?imum number of page faults ? (a) Replace the page whose next reference will be the farthest in future .

(a) Replace the page whose next reference will be the farthest in future . (b) Replace the page whose next reference will be the nearest in future . (b) Replace the page whose next reference will be the nearest in future . (c) Replace the page whose most reference was the nearest in past . (c) Replace the page whose most reference was the nearest in past .

(d) Replace the page whose most recent reference was the farthest in past. (d) Replace the page whose most recent reference was the farthest in past. 15. Which of the

15. Which of the following is / are true with respect following is / are true with respect to paging ?to paging ? I. It divides physical memory into

I. It divides physical memory into equal size units .equal size units . II. It allows implementation of virtual memory II. It allows implementation of virtual memory III. It suffers from external fragmentation . III. It suffers from external fragmentation . (a)

(a) I I & & III III (b) (b) I I only only (c) (c) II II only only (d) (d) I I & & IIII 16.

16. The language that support ………… Data type binding is ………. Efficient than those that supportThe language that support ………… Data type binding is ………. Efficient than those that support …… …

…… … Data type binding .Data type binding . (a)

(a) Static Static , , less, less, Dynamic Dynamic (b) (b) Dynamic Dynamic , , less, less, staticstatic (c)

(c) Static Static , , max, max, Dynamic Dynamic (d) (d) Dynamic Dynamic , , more more , , staticstatic 17. Let A

17. Let A & B be & B be languages corresponding to two decision problemslanguages corresponding to two decision problems 



&& 



respectively . Let A be NPrespectively . Let A be NP

–

– complete problem. B is not known to be in NP. Which of the following is false ?complete problem. B is not known to be in NP. Which of the following is false ? (a) A is NP

(a) A is NP – – Hard Hard (b) (b) B B may may be be NPNP – – HardHard (c) If A

(c) If A





B B then then B B is is NP-complete NP-complete (d) (d) A A is is in in NPNP 18. Which of the

(3)

(a)

(a) 16, 16, 10, 10, 12, 12, 8, 8, 3, 3, 5 5 (b) (b) 16, 16, 8, 8, 5, 5, 10, 10, 12, 12, 33 (c) 16

(c) 16, , 12, 12, 8, 8, 3, 3, 5, 5, 10 10 (d) (d) 10, 10, 16, 16, 12, 12, 8, 8, 5, 5, 33

19. Given that the block size is 512 bytes, search field is 9 bytes, record pointer is 7 bytes and a block 19. Given that the block size is 512 bytes, search field is 9 bytes, record pointer is 7 bytes and a block pointer is 6 bytes long

pointer is 6 bytes long, what are the orders of , what are the orders of internal and least nodinternal and least nodes of es of





- tree respectively ?- tree respectively ? (a)

(a) 31, 31, 34 34 (b) (b) 34, 34, 31 31 (c)32, (c)32, 33 33 (d) (d) 34, 34, 3232 20. Consider the following schedule S using transactions

20. Consider the following schedule S using transactions





,,





andand





::













rr





(A);(A);





(B);(B);





(A) ;(A) ;





(B) ;(B) ; rr





(A);(A);





(A);(A);





(B);(B);





(B);(B);





(A) ;(A) ;





(A);(A);





(B);(B);





(B);(B);

Which of the following must

Which of the following must be TRUE ?be TRUE ? (a) S is conflict serializable as

(a) S is conflict serializable as





→→





→→





.. (b) S is conflict serializable as (b) S is conflict serializable as





→→





→→





.. (c) S is conflict serializable as (c) S is conflict serializable as





→→





→→





.. (d) S is conflict serializable as (d) S is conflict serializable as





→→





→→





.. 21. Consider source and destination in a 10

21. Consider source and destination in a 10 Mbps network with senders window 5 packets. TransmissionMbps network with senders window 5 packets. Transmission

delay for a packet is 10 μ sec, propagation delay from source to destination is 250 μ sec. How long sender delay for a packet is 10 μ sec, propagation delay from source to destination is 250 μ sec. How long sender

is ideal once a

is ideal once a window is transmitted before being starting second window ? Assume ACK transmissionwindow is transmitted before being starting second window ? Assume ACK transmission time is negligible .

time is negligible .

(a) 250 μ sec

(a) 250 μ sec (b) 400 μ sec(b) 400 μ sec (c) 450 μ sec(c) 450 μ sec (d) 150 μ sec(d) 150 μ sec

22. 22. Subnet

Subnet number number Subnet Subnet mask mask InterfaceInterface 172.

172. 156. 156. 170.0 170.0 255.255.254.0 255.255.254.0 IF0IF0

172.156.168.0 255.255.254.0 IF1

(4)

172.156.166.0 255.255.254.0 R1 172.156.166.0 255.255.254.0 R1 172.156.164.0 255.255.252.0 IF2 172.156.164.0 255.255.252.0 IF2 0.0.0.0 0.0.0.0 R2 0.0.0.0 0.0.0.0 R2

Suppose a router has built up

Suppose a router has built up the routing table above. Router can deliver packets directly over the routing table above. Router can deliver packets directly over interfacesinterfaces 0 and 1 or it can forward packets to router R2. Assume router does the longest prefix match. What the 0 and 1 or it can forward packets to router R2. Assume router does the longest prefix match. What the router does with a packet

router does with a packet addressed to 172.156.167.92 ?addressed to 172.156.167.92 ? (a)

(a) IF IF 1 1 (b) (b) IF IF 2 2 (c) (c) R1 R1 (d) (d) R2R2 23. Which one of

23. Which one of the following HTTP methods is not necessarily idempotent ?the following HTTP methods is not necessarily idempotent ? (a)

(a) POST POST (b) (b) GET GET (c) (c) HEAD HEAD (d) (d) TRACETRACE

24. An individual module has a re

24. An individual module has a reliability of 0.999 & 225 such modules are liability of 0.999 & 225 such modules are puput in series . t in series . The reliabilityThe reliability of the whole software is

of the whole software is (a)

(a) 0.896 0.896 (b) (b) 0.798 0.798 (c) (c) 0.692 0.692 (d) (d) 0.9990.999

25. In

25. In ASP.NET , form contents will remain fiASP.NET , form contents will remain filled even if the page is refreshed , it lled even if the page is refreshed , it is done usingis done using _viewstate .

_viewstate . _viewstate _viewstate is possiblis possible usinge using (a)

(a) URL URL Rewriting Rewriting (b) (b) Cookies Cookies (c) (c) Hidden Hidden Fields Fields (d) (d) NoneNone

Questions 26 to 55 carry two marks each Questions 26 to 55 carry two marks each

26. Consider the following statement formulae : 26. Consider the following statement formulae :





: If x does not occur free in C then: If x does not occur free in C then

∃∃

x[A(x)→C]x[A(x)→C]

⟺⟺

[[

∀∀

x A(x) →C]x A(x) →C]





: {: {

∀∀

x [C(x) → P(x)]x [C(x) → P(x)]

∧∧∃∃

x [C(x)x [C(x)

∧∧

L(x)]}L(x)]}

⇒⇒∃∃

x[P(x)x[P(x)

∧∧

L(x)]L(x)] Which of the following is true ?

Which of the following is true ? (a)

(a)





is true andis true and





is is false false (b)(b)





is false andis false and





is trueis true (c) both

(c) both





andand





are are true true (d) (d) bothboth





andand





are falseare false

27. Let

27. Let A A = {0, = {0, 1, 2} 1, 2} ; P(A) ; P(A) is set is set of all of all subsets of subsets of „A‟ „A‟ and P(A) and P(A) with respect with respect toto

⊆⊆

is a poset, then whichis a poset, then which of the following is false ?

of the following is false ? (a) [P(A) ;

(a) [P(A) ;

⊆⊆

] ] is is a a totally totally ordered ordered set set (b) (b) [P(A) [P(A) ;;

⊆⊆

] is a bounded lattice] is a bounded lattice (c) [P(A) ;

(c) [P(A) ;

⊆⊆

] ] is is a a distributivdistributive e lattice lattice (d) (d) [P(A) [P(A) ;;

⊆⊆

] is a complemented lattice.] is a complemented lattice. 28. There are 100 people in a room. In this group 60 are men,

28. There are 100 people in a room. In this group 60 are men, 30 are young and 10 are young men, then30 are young and 10 are young men, then the number of old women is

the number of old women is (a)

(a) 10 10 (b) (b) 20 20 (c) (c) 30 30 (d) (d) 4040 29. If

29. If L is any L is any language andlanguage and



in its complement then which of the in its complement then which of the following is truefollowing is true (a) Both L and

(a) Both L and



are recursive enumerableare recursive enumerable (b) Both L and

(b) Both L and



can be non-recursively enumerablecan be non-recursively enumerable (c) Both L and

(c) Both L and



can be CSLcan be CSL (d) None of the above

(d) None of the above 30. Which of the

30. Which of the following is a regular languages ?following is a regular languages ? (a) {

(a) {





/ n ≥/ n ≥0} 0} (b) {{(b)









/ m / m ≥ 3, ≥ 3, n ≥4}n ≥4}

(c) {

(5)

31. Consider the following for loop : 31. Consider the following for loop :

for (int i =

for (int i = 0 ; i < n 0 ; i < n ; i += 2) ; i += 2) {{ A[i] = B[i] + C[i] ;

A[i] = B[i] + C[i] ; }}

Suppose we generated the

Suppose we generated the following unoptimizedfollowing unoptimized 3AC (three-address code) for the loop :

3AC (three-address code) for the loop : i :=0 ;

i :=0 ; loop : loop : if (i >

if (i >=n) goto =n) goto after ;after ; t1 t1 := i := i * 4 * 4 ;; t2 t2 := := b[t1] b[t1] ;; t3 t3 := := i i * * 4 4 ;; t4 t4 := := c[t3] c[t3] ;; t5 t5 := t2 := t2 + t4 + t4 ;; t6 t6 := i := i * 4 * 4 ;; a[t6] := t5 ; a[t6] := t5 ; i i := i := i + 2 + 2 ;; goto loop; goto loop; after : after :

Which optimizations can be applied on this code ? Which optimizations can be applied on this code ? (a)

(a) Code Code motion motion (b) (b) Loop Loop unrollingunrolling (c) Loop jamming(c) Loop jamming (d) Common Subexpression elimination

(d) Common Subexpression elimination

32. Find the FIRST and FOLLOW sets for each of the non-terminals in the following grammar (note that 32. Find the FIRST and FOLLOW sets for each of the non-terminals in the following grammar (note that some productions below have epsilon as the right-hand side) :

some productions below have epsilon as the right-hand side) :

A A → → B B C C m m | | CC B → B → D B D B | ε| ε C → k | ε C → k | ε D → p | r D → p | r Find fol

Find follow of low of (D) .(D) . (a)

(a) {p, {p, r, r, $} $} (b) (b) {p, {p, r, r, m} m} (c) (c) {p, {p, m} m} (d) (d) {p, {p, r, r, k, k, m}m} 33. Consider the following algorithm on an array

33. Consider the following algorithm on an array :: Algorithm Do(A, n)

Algorithm Do(A, n)

Input : An integer array A and an integer n Input : An integer array A and an integer n Output: find out

Output: find out if if (n = (n = = 1) = 1) thenthen return A[0] return A[0] else else

return Do(A, n-1) + A[n-1] return Do(A, n-1) + A[n-1] end.

end.

What does the algorithm return for the input array A = {4, 3, 6, 2, 5} and the

What does the algorithm return for the input array A = {4, 3, 6, 2, 5} and the invocation isinvocation is Do(A,5)

Do(A,5) (a)

(a) sum sum of of array array elements elements (b) (b) maximum maximum of of array array elementselements (c)

(c) minimum minimum of of array array elements elements (d) (d) reversing reversing the the array array elementselements 34. Consider the followin

34. Consider the following state table the state variabg state table the state variables P, Q input B x output B, Y. Inles P, Q input B x output B, Y. Initial values itial values P =0,P =0, Q = 1.

(6)

P P Q Q XX









,Z,Z 0 0 0 0 00 0 0 0 0 11 0 0 1 1 00 0 0 1 1 11 1 1 0 0 00 1 1 0 0 11 1 1 1 1 00 1 1 1 1 11 0 1 , 0 0 1 , 0 1 1, 0 1 1, 0 0 0, 0 0 0, 0 1 1 , 0 1 1 , 0 1 1, 1 1 1, 1 0 1 , 0 0 1 , 0 0 1, 0 0 1, 0 1 0, 1 1 0, 1 (a) (a) 0 0 1 1 (b) (b) 1 1 0 0 1 1 (c) 1 (c) 1 1 1 0 0 (d) (d) 0 0 0 0 1 1 00 35. Consider the

35. Consider the following specifications :following specifications : Hit ratio for read = 0.8

Hit ratio for read = 0.8 Hit ratio for write = 0.9 Hit ratio for write = 0.9 Block

Block size size = 2 = 2 wordswords

Cache of 10ns is 10 times faster than main memory Cache of 10ns is 10 times faster than main memory On any miss entire block is to be moved from

On any miss entire block is to be moved from main memory to cache memory.main memory to cache memory. 20%

20% references are for references are for write operatiwrite operations.ons. What is the average a

What is the average access time with write through and write allocate ?ccess time with write through and write allocate ? (a)

(a) 50 50 ns ns (b) (b) 55 55 ns ns (c) (c) 64 64 ns ns (d) (d) 80 80 nsns

36. A computer has 32-bit virtual address space and 1024 Byte page. Page table entries are 4 Bytes. A 36. A computer has 32-bit virtual address space and 1024 Byte page. Page table entries are 4 Bytes. A multi-Level page table is used inorder to

multi-Level page table is used inorder to ensure that each level page table is ensure that each level page table is storable in one page.storable in one page. How many levels

How many levels of of paging paging are required ?are required ? (a)

(a) 1 1 level level (b) (b) 2 2 levels levels (c) (c) 3 3 levels levels (d) (d) 4 4 levelslevels 37. Consider the following snapshot of a system

37. Consider the following snapshot of a system Allocation

Allocation Max Max AvailableAvailable ABCD

ABCD ABCD ABCD ABCDABCD





0012 0012 0012 0012 15201520





1000 1000 17501750





1354 1354 23562356





0632 0632 06520652





0014 0014 06560656

Which of the given claims is/are correct ? Which of the given claims is/are correct ? I. The system is safe and the safe sequence is <

(7)

II. The system is unsafe . II. The system is unsafe .

III. The request issued by process





< 0, 4, 2, 0 < 0, 4, 2, 0 > can be granted> can be granted IV. The system is Deadlocked.

IV. The system is Deadlocked. V. The system is Deadlock free . V. The system is Deadlock free . (a)

(a) I, I, II II & & III III (b) (b) I I & & II II (c) III, (c) III, IV IV & & V V (d) (d) I, I, III III & & VV

38. Consider the program given below : 38. Consider the program given below :

void main ( ) void main ( ) {{ int a = 4; int a = 4; int *p = &a; int *p = &a; int *q = &a; int *q = &a; int = ++(*p) int = ++(*p) int * r = p; int * r = p; r = - - * (p) +4; r = - - * (p) +4; + + * r; + + * r; Printf(“%d %d %d” , a, b, *r) Printf(“%d %d %d” , a, b, *r) }}

What are the final values of m , n, r What are the final values of m , n, r ?? (a)

(a) 8, 8, 8, 8, 8 8 (b) (b) 8, 8, 5, 5, 7 7 (b) (b) 5, 5, 5, 5, 55 (d) 8, 5, 8(d) 8, 5, 8 39. Consider the pseudo-code given below :

39. Consider the pseudo-code given below : x : integer ;

x : integer ;

procedure set-x(n : integer) procedure set-x(n : integer)

x = n; x = n; procedure print-x procedure print-x write-integer (x); write-integer (x); procedure Test (s, p :

procedure Test (s, p : function ; n : integer)function ; n : integer) x : integer; x : integer; if (n in {1, 3}) if (n in {1, 3}) set-x (n); set-x (n); else else s(n); s(n); if (n in {1, 2}) if (n in {1, 2}) print-x print-x else p; else p; set-x(n+2), set-x(n+2), print-x; print-x;

What will be the output of the program for the call ? What will be the output of the program for the call ?

set-x (0); set-x (0);

Test (set-x, print-x, 4); Test (set-x, print-x, 4);

Print-x; Print-x; (a)

(a) 4, 4, 6 6 (b) (b) 6, 6, 4 4 (c) (c) 4, 4, 4 4 (d) (d) 0, 0, 44 40. Consider the following claims :

(8)

I. I.





n is O(n is O(





) ) x x > > 0; 0; y y > > 00 II. 4 II. 4





is O (is O (





)) III. 4. III. 4.





isisΩ (Ω (





)) IV. 10n logn is O(nlogn) IV. 10n logn is O(nlogn) Which of the above are true ? Which of the above are true ? (a)

(a) I I & & II II (b) (b) I, I, II II & & III III (c) I, (c) I, II II & & IV IV (d) (d) I, I, II, II, III III & & IVIV 41. Let

41. Let S = {a, b, c, d, e, f, g} be a collection of objects with S = {a, b, c, d, e, f, g} be a collection of objects with benefit-weight valuebenefit-weight values as :s as : {a: (12,4), b: (10,6), c: (8,5), d: (11,7), e: (14,3), f:

{a: (12,4), b: (10,6), c: (8,5), d: (11,7), e: (14,3), f: (7,1), g: (9,6)}(7,1), g: (9,6)} What is an optimal solution to the fractional Knapsack problem for

What is an optimal solution to the fractional Knapsack problem for S assuming the KnapsaS assuming the Knapsa ck can holdck can hold objects with total weight of 18?

objects with total weight of 18? (a)

(a) 49.4 49.4 (b) (b) 50.2 50.2 (c) (c) 51 51 (d) (d) nonenone 42. Which of the

42. Which of the following inequality best characterizes the number n of keys that cafollowing inequality best characterizes the number n of keys that ca n exist in a Bn exist in a B-tree of -tree of order k with height h? (Assume that a B-tree of height 1 is a B-tree

order k with height h? (Assume that a B-tree of height 1 is a B-tree having only one node)having only one node) (a) { 2 *

(a) { 2 *





- 1} <= n <= {- 1} <= n <= {





- - 1} 1} (b) { (b) { 2 2 **





} <= n <= {} <= n <= {





}} (c) { 2 *

(c) { 2 *





- 1} <= n <= {- 1} <= n <= {





- - 1} 1} (d) (d) { { 2 2 **





- 1} <= n <= {- 1} <= n <= {





}} 43. Consider the following sequence of actions :

43. Consider the following sequence of actions :

r1(A); r2(B); w1(C); w3(B); r3(C); w2(B); w3(A); r1(A); r2(B); w1(C); w3(B); r3(C); w2(B); w3(A); Assume that the read-and write

Assume that the read-and write – – timestamps of timestamps of A, B, and C are each 0 prior to execution of these A, B, and C are each 0 prior to execution of these actions.actions. For which initial timestamps of the transactions T1, T2,

For which initial timestamps of the transactions T1, T2, and T3 will no transaction abort, usingand T3 will no transaction abort, using timestamping protocol with Thomas write rule ?

timestamping protocol with Thomas write rule ? (a) T S(T1) = 100; T S(T2) = 300; T (a) T S(T1) = 100; T S(T2) = 300; T S(T3) = 200S(T3) = 200 (b) T S(T1) = 200; T S(T2) = 100; T S(T3) = (b) T S(T1) = 200; T S(T2) = 100; T S(T3) = 300300 (c) T S(T1) = 100; T S(T2) = 200; T (c) T S(T1) = 100; T S(T2) = 200; T S(T3) = 300S(T3) = 300 (d) Both (b) and (c) (d) Both (b) and (c)

44. A token ring LAN with

44. A token ring LAN with 25 Mbps interconnects M stations using a star topology in the 25 Mbps interconnects M stations using a star topology in the following way.following way. All the input and output lines of the

All the input and output lines of the token ring station interfaces are connected to a catoken ring station interfaces are connected to a ca binet where actualbinet where actual ring is placed. Suppose that the

ring is placed. Suppose that the distance from each station to the cabinet is distance from each station to the cabinet is 100 meters and the ring100 meters and the ring latency per station is 8 bits. Assume that

latency per station is 8 bits. Assume that packets are 1250 bytes . packets are 1250 bytes . How many hosts we suppose to connectHow many hosts we suppose to connect to have minimum size of the token ring ?

to have minimum size of the token ring ? (a)

(a) 100 100 (b) (b) 300 300 (c) (c) 150 150 (d) (d) 200200 45. Which statement is true ?

45. Which statement is true ? 1. XML DOCUMENT

1. XML DOCUMENT cannot use xmcannot use xml as tag name.l as tag name. 2. All XML elements must have a closing tag

2. All XML elements must have a closing tag 3. All XML elements must be lower case 3. All XML elements must be lower case 4. All XML documents must have a DTD 4. All XML documents must have a DTD (a)

(a) 1 1 & & 2 2 (b) (b) 1, 1, 2 2 & & 4 4 (c) (c) 1, 1, 2 2 & & 3 3 (d) (d) AllAll 46. RSA public key cryptog

46. RSA public key cryptography is used and raphy is used and p = 11 and q = 29 and public kp = 11 and q = 29 and public key pair (e, n) is given as (3,ey pair (e, n) is given as (3, 319) . Find the secret key, d = ?

319) . Find the secret key, d = ? (a)

(a) 16 16 (b) (b) 17 17 (c) (c) 187 187 (d) (d) 281281 47. For a source cod

47. For a source code the followine the following values are provg values are provide for ide for N1 = 60, N2 N1 = 60, N2 = 50, n1 = 3= 50, n1 = 30, n2 = 20, 0, n2 = 20, n1* = 10,n1* = 10, n2* = 12.

n2* = 12. Calculate Intelligence Content with the above valuesCalculate Intelligence Content with the above values (a)

(9)

Common Da

Common Data for ta for Questions 48 Questions 48 and 49 :and 49 :

Suppose that a hash table contains hash size

Suppose that a hash table contains hash size = 11 entries indexed from 0 = 11 entries indexed from 0 to 10 and the following keys areto 10 and the following keys are to be mapped into the table :

to be mapped into the table :

12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5 Hash function

Hash function h(i) = (2i h(i) = (2i + 5) mod 11.+ 5) mod 11. 48. Calculate the number of

48. Calculate the number of collisionscollisions (a)

(a) 2 2 (b) (b) 3 3 (c) (c) 4 4 (d) (d) 55

49. If the above keys are handled by Chaining , then how many are empty bucket slots 49. If the above keys are handled by Chaining , then how many are empty bucket slots (a)

(a) 3 3 (b) (b) 4 4 (c) (c) 5 5 (d) (d) 66

Common data for Questions 50 and 51: Common data for Questions 50 and 51:

Consider the following instance of the Optimal Binary Search Tr

Consider the following instance of the Optimal Binary Search Tr ee Problee Problem being solved by Dynamicem being solved by Dynamic programming technique :

programming technique : n

n = = 4; 4; ((





,,





,,





,,





) = (do, if, read, while)) = (do, if, read, while) P(1:4)

P(1:4) = = (3, (3, 3, 3, 1, 1, 1) 1) Q(0:4) Q(0:4) = = (2, (2, 3, 3, 1, 1, 1, 1, 1)1) 50. What is

50. What is the cost the cost of the Oof the O.B.S.T .B.S.T ?? (a)

(a) 34 34 (b) (b) 32 32 (c) (c) 30 30 (d) (d) 4040 51. The root of the tree is

51. The root of the tree is (a)

(a) do do (b) (b) if if (c) (c) read read (d) (d) whilewhile

Statement for Linked Answer Questions 52 and 53 Statement for Linked Answer Questions 52 and 53 ::

Consider the following IP/Subnet mask. Consider the following IP/Subnet mask. IP : 10.

IP : 10. 1. 0. 100 1. 0. 100 Mask: 255.255Mask: 255.255.254.0.254.0

52. What are the network number , subnet number and number of bits borrowed from host ID ? 52. What are the network number , subnet number and number of bits borrowed from host ID ? (a)

(a) 10, 10, 1.0.0 1.0.0 , , 14 14 (b) (b) 10, 10, 1.0.0 1.0.0 , , 8 8 (c) (c) 10, 10, 1.0.0, 1.0.0, 100 100 (d) (d) 10, 10, 1.0.0 1.0.0 , , 1515

53. Based on number of bits borrowed from above question, find number of subnets and hosts per

53. Based on number of bits borrowed from above question, find number of subnets and hosts per subnetsubnet

possible

possible in nin network etwork 10.0.0.010.0.0.0 (a)

(a) 16384, 16384, 510 510 (b) 256, (b) 256, 65534 65534 (c) (c) 32768, 32768, 510 510 (d) (d) 510, 510, 3276832768

Statement for Linked Answer Questions 54 and 55 Statement for Linked Answer Questions 54 and 55 :: A tree

A tree has „2n‟ vertices of has „2n‟ vertices of degree 1. degree 1. „3n‟ vertices of „3n‟ vertices of degree 2 and degree 2 and „n‟ vertices of „n‟ vertices of degree 3.degree 3.

54. Then the number of vertices in the tree is 54. Then the number of vertices in the tree is (a)

(a) 8 8 (b) (b) 10 10 (c) (c) 12 12 (d) (d) 1414

55. Then the number of edges in the tree is 55. Then the number of edges in the tree is (a)

(a) 7 7 (b) (b) 9 9 (c) (c) 11 11 (d) (d) 1313

GENERAL APTITUDE GENERAL APTITUDE Q.Nos 56 to 60 will carry

Q.Nos 56 to 60 will carry one mark eachone mark each

56.A train running at a

56.A train running at a uniform speed crosses two women coming in the uniform speed crosses two women coming in the opposite direction at 2.4 kmphopposite direction at 2.4 kmph and 6 kmph in 45 seconds and 36 seconds respectively . Find the speed of the train ?

(10)

a.10.8

a.10.8 kmph kmph b. b. 12 12 kmph kmph c. c. 13.2 13.2 kmph kmph d. d. 14.4 14.4 kmphkmph 57.A, B and C start a business . A invests 2 times as much as

57.A, B and C start a business . A invests 2 times as much as B invests . A and B invests 3 times of whatB invests . A and B invests 3 times of what C invests. Then the ratio of capital of A,B and C is ?

C invests. Then the ratio of capital of A,B and C is ? a.1:3:6

a.1:3:6 b. b. 6:3:1 6:3:1 c. c. 1:2:3 1:2:3 d. d. 3:2;13:2;1 58.A container contains 1000 litres of milk. From this

58.A container contains 1000 litres of milk. From this container 100 litres of milk was taken container 100 litres of milk was taken out andout and replaced by water . If this process was repeated another three times , how much milk is now con

replaced by water . If this process was repeated another three times , how much milk is now con tained bytained by the container ?

the container ? a.729

a.729 lts lts b. 700 b. 700 lts lts c. c. 656.1 656.1 lts lts d. d. 343.9 343.9 ltslts 59.Identify the pair of words ,

59.Identify the pair of words , which has a relationship similar to the pair which has a relationship similar to the pair in questionin question Romantic : Realistic

Romantic : Realistic a.Dramatic

a.Dramatic : : Prosaic Prosaic b. b. Fanciful Fanciful : : actual actual c. Thought c. Thought : : idea idea d. d. Poet Poet : : DramatistDramatist 60.This question has a set of

60.This question has a set of four words . Choose the four words . Choose the word that does not belong to the groupword that does not belong to the group a.

a. Cartridge Cartridge b. b. Barrel Barrel c. c. Gun Gun d. d. DrumDrum

Q.Nos 61 to 65 will carry

Q.Nos 61 to 65 will carry two marks eachtwo marks each

61.In the following sentence , some part

61.In the following sentence , some part of the sentence is underlined . of the sentence is underlined . Beneath each sentence you willBeneath each sentence you will find four ways of

find four ways of phrasing the underlined part. Choose the best choice that follows the requirements of phrasing the underlined part. Choose the best choice that follows the requirements of standard written English

standard written English In the split brain preparation ,

In the split brain preparation , we have managed to we have managed to dissociate various parts of the brain from one dissociate various parts of the brain from one anotheranother a.to

a.to associate various associate various parts of the bparts of the brain from one anotrain from one anotherher b. to dissociate various parts of the

b. to dissociate various parts of the brain from one anotherbrain from one another c. to dissociate various parts of the

c. to dissociate various parts of the brain from each anotherbrain from each another d. to dissociate various pa

d. to dissociate various parts of the brain among rts of the brain among each othereach other

62.A program instituted in a

62.A program instituted in a particular state allows parents to particular state allows parents to prepay their children‟s prepay their children‟s future collegefuture college

tuition at current rates .The program then

tuition at current rates .The program then pays the tuition annually for the child at any pays the tuition annually for the child at any of the states publicof the states public colleges in which the child enrolls .

colleges in which the child enrolls . Parents should participate in the program as a Parents should participate in the program as a means of decreasingmeans of decreasing

the cost of

the cost of their children‟s college education.their children‟s college education.

Which of the following

Which of the following , if true , is the most , if true , is the most appropriate reason for parents nappropriate reason for parents not to participate in ot to participate in thethe program ?

program ? a.The

a.The parents are unsure abouparents are unsure about which public collegt which public college in the state the child wile in the state the child will attendl attend b. The amount of

b. The amount of money accumulated , by putting the prepayment funds in money accumulated , by putting the prepayment funds in an interest-bearing accountan interest-bearing account today will be greater than the

today will be greater than the total cost of tuition for any of total cost of tuition for any of the public colleges when the child enrollsthe public colleges when the child enrolls c. The annual cost of tuitio

c. The annual cost of tuition at the states public collegn at the states public colleges is expected es is expected to increase at a faster rate than theto increase at a faster rate than the annual increase in the cost of

annual increase in the cost of livingliving

d. Some of the state‟s public colleges are contemplating large in

d. Some of the state‟s public colleges are contemplating large increase in tuition next year.crease in tuition next year. 63.This question consists of six

63.This question consists of six statements followed by options consisting of three statements followed by options consisting of three statements put togetherstatements put together in a specific order . Choose the option which indicates a valid argument , that is , where the third

in a specific order . Choose the option which indicates a valid argument , that is , where the third statement is a conclusion drawn from the

statement is a conclusion drawn from the preceding twopreceding two (A)

(A) Navratilova Navratilova won won the the tournament tournament (B) (B) Only Only talented talented people people can can win win a a tournament tournament (C) (C) Graf Graf is is notnot talented

talented (D) (D) Navratilova Navratilova is is not not talented talented (E) (E) Graf Graf lost lost the the tournament tournament (F) (F) Navratilova Navratilova is is moremore talented than graf

talented than graf a.

(11)

64.Rajesh started walking along the boundaries square field from corner point A.

64.Rajesh started walking along the boundaries square field from corner point A. After half an hour, After half an hour, hehe

reached the corner point „C‟ diagonally opposite to A. If this speed was 8 kmph what is the area of the reached the corner point „C‟ diagonally opposite to A. If this speed was 8 kmph what is the area of the

field in square kilometer ? field in square kilometer ? a.

a. 16 16 b. b. 4 4 c. c. 8 8 d. d. nonenone

65.If the price of petrol is increased by 20 % and subsequently by 40 %, what is the final price if the 65.If the price of petrol is increased by 20 % and subsequently by 40 %, what is the final price if the original price is Rs. 25 ?

original price is Rs. 25 ? a.

(12)

CSE MOCK TEST-I (key) CSE MOCK TEST-I (key)

1.d

1.d 2.a 2.a 3.c 3.c 4.d 4.d 5.d 5.d 6.a 6.a 7.b 7.b 8.c 8.c 9.d 9.d 10.a 10.a 11.b 11.b 12.b 12.b 13.c13.c 14.a 15.d 16.a 17.c 18.a 19.b 20.c 21.b 22.c 23.a 24.b 25.c 26.c 14.a 15.d 16.a 17.c 18.a 19.b 20.c 21.b 22.c 23.a 24.b 25.c 26.c 27.a 28.b 29.b 30.b 31.d 32.d 33.a 34.c 35.c 36.c 37.d 38.d 39.a 27.a 28.b 29.b 30.b 31.d 32.d 33.a 34.c 35.c 36.c 37.d 38.d 39.a 40.a 41.a 42.a 43.d 44.b 45.a 46.c 47.c 48.c 49.c 50.b 51.b 52. 40.a 41.a 42.a 43.d 44.b 45.a 46.c 47.c 48.c 49.c 50.b 51.b 52. 53.c 54.c 55.c 56.b 57.b 58.c 59.a 60.d 61.b 62.b 63.b 64.c 65.a 53.c 54.c 55.c 56.b 57.b 58.c 59.a 60.d 61.b 62.b 63.b 64.c 65.a