UGC NET COMPUTER SCIENCE MODEL SOLVED PAPER FOR JUNE 2015

UGC NET COMPUTER SCIENCE MODEL SOLVED PAPER FOR JUNE 2015

1. Time sharing provides

(a) Disk management

 (b) File system management

(c) Concurrent execution

(d) All of the above

Ans.: C

2. A process executes the following code:

for (i=0; i<n; i++)

fork();

The total number of child processes created is

(a) n

 (b) 2n – 1

(c) 2n

(d) 2n+1 – 1

Ans.: B

3. The performance of Round Robin algorithm depends heavily on

(a) Size of the process

 (b) The i/o bursts of the process

(c) The CPU burst of the process

(d) The size of the time quantum

Ans.: D

4. Match the following :

(i) OLAP (A) Regression

(ii) OLTP (B) Data Warehouse

(iii) Decision Tree (C) RDBMS

(iv) Neural Network (D) Classification

(i) (ii) (iii) (iv)

(a) (B) (C) (A) (D)

(b) (B) (C) (D) (A)

(c) (C) (B) (A) (D)

(d) (C) (B) (D) (A)

Ans.: B

5. In Win32, which function is used to create Windows Applications ?

(a) WinAPP

(b) Win API

 (c) Win Main

 (d) WinVoid

Ans.: C

6. 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

Ans.: A

7. The document standards for EDI were first developed by large business house during the 1970s and are now under the control of the following standard organisation :

(a) ISO

(b) ANSI

(c) ITU-T

 (d) IEEE

Ans.: B

8. A typical digital telephone channel in TDM circuits is allocated a speed of

(a) 4 kbps

 (b) 8 kbps

(c) 64 kbps

 (d) 1.544 Mbps

Ans.: D

9. Which of the following is not a WAN technology?

(a) X.25

(b) Frame Relay

(c) ATM

(d) None of the above

Ans.: D

10. The coupling between different modules of a software is categorized as follows:

(I) Content coupling

(II) Common coupling

(III) Control coupling

(IV) Stamp coupling

(V) Data coupling

Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (Most desirable)

as follows:

(a) I, II, III, IV, V

 (b) V, IV, III, II, I

 (c) I, III, V, II, IV

 (d) IV, II, V, III, I

Ans.: A

11. The proof of the proposition

“Every simple graph with at least two vectors has two vertices of equal degree” is based on

(a) Inclusion-Exclusion principle

(b) Pigeonhole principle

(c) Elementary counting technique

(d) none of the above

Ans.: B

12. Which statement is true?

(a) The model of deterministic finite state machine includes the model of non-deterministic finite state

machine as special

(b) The model of non-deterministic finite state machine includes the model of deterministic finite state as

special case

(c) Non-deterministic finite state machines are not more powerful than deterministic.

(d) None of the above.

Ans.: B

13. Algorithm to find optimal spanning tree is

(a) Kruskal’s algorithm

(b) DEPTH-FIRST search

(c) BREADTH-FIRST Search

 (d) none of these

Ans.: A

14. Which of the following is a good reason to use linked lists in a program?

(a) To make execution faster

(b) To access any element randomly

(c) To allocate space dynamically whenever needed

(d) To make deletion of elements easier’

Ans.: C

15. Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?

(a) Deleting a node whose location is given

(b) Searching an unsorted list for a given item

(c) Inserting a node after the node with a given location

(d) Traversing the list to process each node

Ans.: A