UGC NET DECEMBER 2018 Computer Science Paper – II – Modal Exam

Optical storage is a

Data security threats include

The number of bits required for an IPV 6 address is

Consider a logical address space of 8 pages of 1024 words mapped with memory of 32 frames. How many bits are there in the physical address ?

The amount of uncertainty in a system of symbol is called

If a packet arrive with an M-bit value is ‘1’ and a fragmentation offset value ‘0’, then it is______ fragment

The maturity levels used to measure a process are

All of the following are examples of real security and privacy risks except

Which of the following can be the sequence of nodes examined in binary search tree while searching for key 88 ?

The Mobile Application Protocol (MAP) typically runs on top of which protocol ?

In UNIX, which of the following command is used to set the task priority ?

Which API is used to draw a circle ?

How many edges are there in a forest of t-trees containing a total of n vertices ?

Linux operating system uses

Consider the tree given below :

Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree.

The ‘C’ language is

The time complexity to build a heap of n elements is

The VLF and LF bauds use propagation for communication

The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.

The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using :

How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ?

Which of the following is true ?

Which of the following is a bad example of recursion ?

What is the result of the following expression ?
(l&2) + (3&4)

In how many ways can 15 indistinguishable fish be placed into 5 different ponds, so that each pond contains atleast one fish ?

A chip having 150 gates will be classified as

Emergency fixes known as patches are result of

Testing of software with actual data and in actual environment is called

A hash function f defined as f (key) = key mod 13, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79 ?

Encryption and Decryption is the responsibility of Layer.

RAD stands for______.

The relationship of data elements in a module is called

A station in a network forward incoming packets by placing them on its shortest output queue. What routing algorithm is being used ?

Active X controls are Pentium binary programs that can be embedded in ____________

Encoding of data bits 0011 into 7-bit even Parity Hamming Code is

The value of the following expression (13 / 4 * 3) % 5 + 1 is

The worst case time complexity of AVL tree is better in comparison to binary search tree for

Basis path testing falls under

The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be

What is the size of the Unicode character in Windows Operating System?

Dijkestra banking algorithm in an operating system, solves the problem of

Match the following IC families with their basic circuits :
a.   TTL                   1. NAND
b.   ECL                  2. NOR
c.   CMOS              3. Inverter Code

Match the following with respect to C++ data types :
a.   User defined type      1. Qualifier
b.   Built in type              2. Union
c.   Derived type             3. Void
d.   Long double             4. Pointer

“Black” refers in the “Black-box” testing means

Component level design is concerned with

Match the following :
List-I                                                                        List – II
a. Wireless Application Environment                 i. HTTP
b. Wireless Transaction Protocol                       ii. IP
c. Wireless Datagram Protocol                          iii. Scripts
d. Wireless                                                            iv. UDP

B + tree are preferred to binary tree in database because

Web Mining is not used in which of the following areas ?

A graph is non-planar if and only if it contains a subgraph homomorphic to

The design issue of Datalink Layer in OSI Reference Model is

In which tree, for every node the height of its left subtree and right subtree differ almost by one