Advertisements

21.
The maximum window size for data transmission
using selective repeat protocol with 8-bit frame sequence number is :

(A) 2

^{8}
(B) 2

^{7}
(C) 2

^{8}-1
(D) 2

^{6}
Answer: B

22. Suppose
class based addressing scheme is used in a University Computer Center. The
class C address with subnet mark is adopted for network is 255.255.255.254,
then how many subnets and how many systems per subnets are possible?

(A) 64, 2

(B) 1, 254

(C) 0, 0

(D) 128, 0

Answer: D

23. The
Denial of Service (DOS) is attacked on .............

(A) Authentication

(B) Availability

(C) Confidentiality

(D) Integrity

Answer: B

24. The
digital signal is to be designed to permit 160 kbps data rate for a bandwidth
of 20 kHz. What will be

(i) number
of levels and (ii) S/N ratio?

(A) 7, 28.8
dB

(B) 6, 27.8
dB

(C) 5, 29.8
dB

(D) 4, 24.07
dB

Answer: D

25. The
difference between congestion control and flow control is ................

(A) Flow
control is local phenomenon while congestion control is global phenomenon.

(B) Flow
control uses timers while congestion control uses retransmissions.

(C) Flow
control uses NACs while congestion control uses ACKs.

(D) Option
(B) and (C) only

Answer: A

26. For
sorting ................ algorithm scans the list by swapping the entries
whenever pair of adjacent keys are out of desired order.

(A) Quick
sort

(B) Shell
sort

(C) Insertion
sort

(D) Bubble
sort

Answer: D

27. For
the following:

(i) To solve a problem linear algorithm
must perform faster than quadratic algorithm

(ii) An
algorithm with worst case time behaviour = 3n takes 30 operations for every
input of size n = 10

(A) Both (i)
and (ii) are false

(B) Both (i)
and (ii) are true

(C) (i) is
false and (ii) is true

(D) (i) is
true and (ii) is false

Answer: D

28. The
best/worst case time complexity of quick sort is :

(A) O(n)/O(n

^{2})
(B) O(n)/O(n
log n)

(C) O(n log n)/O(n

^{2})
(D) O(n log
n)/O(n log n)

Answer: C

29. For
job sequence problem :

**Item : 1 2 3 4 5 6 7**

**Profit : 3 5 20 18 1 6 30**

**deadline : 1 3 4 3 2 1 2**

Which is the
optimal value?

(A) (1, 5, 6,
4)

(B) (2, 3, 1,
7)

(C) (7, 6, 4,
3)

(D) (1, 2, 3,
4)

Answer: C

30. For
the following problem statements :

(i) 3 COL : Given a graph G, can G be
painted with 3 colours.

(ii) COLO :
Given a graph G, find the chromatic number of G.

(iii) COLC :
Given a graph G, find an optimal colouring of G.

Select
correct answer :

(A) (i) is P,
(ii) is NP , (iii) is NP.

(B) (i) is
NP complete, (ii) and (iii) are NP- hard

(C) (i) is P
and (ii) and (iii) are NP

(D) All are
polynomial time

Answer: B

## 0 Comments