Sunday 17 February 2013

UGC NET Previous Year Questions


June 2008 and December 2007

26. The ATM cells ------ byte long
(a) 48 (b) 53 (c) 64 (d) 69

27. For slotted ALOHA maximum channel utilization is
(a) 100% (b) 50% (c) 36% (d)18%

28. For channel of 3 kHz bandwidth ands signal to noise ratio of  30db the maximum data rate is
(a) 3000bps (b) 6000bps (c) 15000bps (d) 30000bps

29. An example of public key encryption algorithm is
(a)    Ceaser cipher algorithm (b) DES algorithm (c) AES algorithm (d) knapsak algorithm

30. With reference to hierarchical routing the optimum number of levels for an m router subnet is
(a) m^2  (b) m (c) ln m (d) square root of m


December 2008

17.  Congestion control is done by 
(A). Network layer (B). Physical layer
(C). Presentation layer (D). Application layer



18. Assertion (A): Twisted pairs are widely used as transmission medium.

Reasoning(R ): Twisted pairs have adequate performance and low cost.
(A). Both (A) and (R ) are true and (R ) is the correct explanation for (A).
(B). Both (A) and (R ) are true but (R ) is not the correct explanation
(C ). (A) is true but (R ) is false
(D). (A) is false but (R ) is true



Ans:- A. Page No .91 of  Tanenbaum book, you will find the following statement. “Due to their adequate performance and low cost, twister pairs are widely used and are likely to remain so for years to come”.


19. An example of a non-adaptive routing algorithm is:
(A). Shortest path routing (B). Centralised routing
(C ). Baran’s hot potato algorithm (D). Baran’s backward learning algorithm


20. IP address in B class is given by:
(A). 125.123.123.2 (B). 191.023.21.54
(C ). 192.128.32.56 (D). 10.14.12.34


26. Device on one network can communicate with devices on another network via a
(A) Hub/Switch (B) Utility server
(C) File server (D) Gateway

27. What is the maximum window size in sliding window protocol used in a computer network?
(A) 4 (B) 8 (C) 15 (D) 16

28. Which of the following are Data Link Layer standard?
1. Ethernet 2. HSSI 3. Frame Relay
4. 10 – Base T 5. Token Ring
(A) 1, 2, 3 (B) 1, 3, 5 (C) 1, 3, 4, 5 (D) 1, 2, 3, 4, 5

29. In case of Bus/Tree topology signal-balancing issue is overcome by
(A) Modulation (B) Polling
(C) Segmentation (D) Strong transmitter

30. Match the following:
(i) Ethernet         (a) Deterministic
(ii) Token Ring    (b) Utilize the full wire speed
(iii) Cut-through switch (c) Prevent looping
(iv) Spanning tree    (d) Checking valid address
Codes :
(A) i – d, ii – a, iii – b, iv – c (B) i – a, ii – d, iii – b, iv – c
(C) i – d, ii – d, iii – c, iv – b (D) i – d, ii – c, iii – b, iv – a


No comments:

Post a Comment