D12CSPII-1-10

UGC NET Dec-2012 Computer Science (Paper II) Mock Test    [1-10]   [11-20]    [21-30]   [31-40]   [41-50]                                                               HOME

1.Consider the circuit shown below. In a certain steady state, Y is at logical ‘ 1 ’. What are possible values of A, B, C ?

A = 0, B = 0, C = 1
A = 0, B = C = 1
A = 1, B = C = 0
A = B = 1, C = 1

2.The worst case time complexity of AVL tree is better in comparison to binary search tree for
Search and Insert Operations
Search and Delete Operations
Insert and Delete Operations
Search, Insert and Delete Operations

3.The GSM network is divided into the following three major systems :
SS, BSS, OSS
BSS, BSC, MSC
CELL, BSC, OSS
SS, CELL, MSC

4.The power set of the set {} is
{}
{, {}}
{0}
{0, , {}}

5.If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.
239
310
321
325

6.Component level design is concerned with
Flow oriented analysis
Class based analysis
Both of the above
None of the above

7. The ‘C’ language is
Context free language
Context sensitive language
Regular language
None of the above

8.The Mobile Application Protocol (MAP) typically runs on top of which protocol ?
SNMP (Simple Network Management Protocol)
SMTP (Simple Mail Transfer Protocol)
SS7 (Signalling System 7)
HTTP (Hyper Text Transfer Protocol)

9.If a packet arrive with an M-bit value is ‘l’ and a fragmentation offset value ‘0’, then it is ______ fragment.
First
Middle
Last
All of the above

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
32
64
128
160

[1-10]   [11-20]    [21-30]   [31-40]   [41-50]                                                               HOME

Mr.Neelamadhaba Panigrahi,I & CT,FMU

This page is developed by our student Mr. Neelamadhaba Panigrahi, 2nd semester ICT and Ex-student, Miss Priyadarsini Mishra Thank u Neelamadhaba & Priyadarsini!!