Monday, 24 November 2014

UGC NET Computer Science Paper II Previous Questions December 2012 - Part 1

1.       Consider the circuit shown below. In a certain steady state, Y is at logical ‘l’. What are possible values of A, B, C ?
(A) A = 0, B = 0, C = 1             (B) A = 0, B = C = 1
(C) A = 1, B = C = 0                 (D) A = B = 1, C = 1
Answer: A or D
2.       The worst case time complexity of AVL tree is better in comparison to binary search tree for
(A) Search and Insert Operations
(B) Search and Delete Operations
(C) Insert and Delete Operations
(D) Search, Insert and Delete Operations
Answer: D
3.       The GSM network is divided into the following three major systems:
(A) SS, BSS, OSS                   (B) BSS, BSC, MSC
(C) CELL, BSC, OSS              (D) SS, CELL, MSC
Answer: A
4.       The power set of the set {ϕ} is
(A) {ϕ}                 (B) {ϕ, {ϕ}}
(C) {0}                (D) {0, ϕ, {ϕ}}
Answer: B
5.       If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queues of I/O blocks requests are 98, 37, 14, 124, 65, 67.
(A) 239               (B) 310
(C) 321              (D) 325
Answer: C

6.       Component level design is concerned with
(A) Flow oriented analysis                 (B) Class based analysis
(C) Both of the above                         (D) None of the above
Answer: C
7.       The ‘C’ language is
(A) Context free language     (B) Context sensitive language
(C) Regular language                        (D) None of the above
Answer: A
8.       The Mobile Application Protocol (MAP) typically runs on top of which protocol ?
(A) SNMP (Simple Network Management Protocol)
(B) SMTP (Simple Mail Transfer Protocol)
(C) SS7 (Signalling System 7)
(D) HTTP (Hyper Text Transfer Protocol)
Answer: C
9.       If a packet arrive with an M-bit value is ‘l’ and a fragmentation offset value ‘0’, then it is ……………. fragment.
(A) First              (B) Middle
(C) Last              (D) All of the above
Answer: A
10.    The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be
(A) 32                 (B) 64
(C) 128              (D) 160
Answer: D
Explanation:
Number of bit strings of length 8 that start with 1 (1 x x x x x x x): 27 = 128.
Number of bit strings of length 8 that end with 00 (x x x x x x 0 0): 26 = 64.
Number of bit strings of length 8 that start with 1 and end with 00 (0 0 x x x x x 1): 25 = 32.
Applying the subtraction rule, the number is 128 + 64 − 32 = 160.

Pages   2   3   4   5 

0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App