Saturday 13 September 2014

IMPORTANT SOLVED MODEL TEST PAPER FOR UGC NET DECEMBER 2014

IMPORTANT SOLVED MODEL TEST PAPER FOR UGC NET DECEMBER 2014

1. The total number of spanning trees that can be drawn using five labeled vertices is:
(A). 125 (B).64
(C ). 36 (D). 16

Ans : A.
Explanation:
As per Cayleys formula for counting spanning trees
T(Kn)= n^ (n-2) where n is the number of vertices.
T(k5)=5 5-2=5 3= 5 * 5 * 5=125

2. Four jobs J1,J2,J3, and J4 are waiting to be run. Their expected run times are 9,6,3 and 5 respectively. In order to minimize average response time, the jobs should be run in the order:
(A). J1 J2 J3 J4 (B). J4 J3 J2 J1
(C ) J3 J4 J1 J2 (D) J3 J4 J2 J1
Ans : D

Easy one
J3=3
J4=5
J2=6
J1=9

3. If a code is ‘t’ error detecting, the minimum hamming distance should be equal to :
(A). t-1 (B). t
(C ). t+1 (D). 2t+1

Ans: C.
Very often asked question.
Tip:
For error detection, formula is t+1
For error correction, formula is 2t+1


4. 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
Ans:- A. Shortest path routing.

5. What is Granularity ?
(A) The size of database
(B) The size of data item
(C) The size of record
(D) The size of file
Ans:-B

6. A copy constructor is invoked when :
(A). a function returns by value
(B). an argument is passed by value
(C ). A function returns by reference
(D). none of the above
Ans:- B
Very simple

7. Which of the following OS treats hardware as a file system?
(A) UNIX (B) DOS (C) Windows NT (D) none of the above
Ans:- A.
Unix basics question

8. If the executing program size is greater than the existing RAM of a computer, it is still possible to execute the program if the OS supports:
(A) Multitasking
(B) virtual memory
(C) paging system
(D) none of the above
Ans: B


9. Synthesized attribute can be easily simulated by a
(A) LL grammar
 (B) Ambiguous grammar
(C ) LR grammar
(D) None of the above
Ans:- C

10. In the process management Round-robin method is essentially the pre-emptive version of _______________.
(A) FILO
(B) FIFO
(C ) SSF
 (D) Longest time first
Ans:- B

Click to buy Trueman's UGC NET Computer Sceince Book
11. A program is located in the smallest available hole in the memory is ______________
(A) best-fit
(B) first-bit
(C ) worst-fit
(D ) buddy
Ans:- A

12. An astable multivibrator has
A)one stable state  
(B)two stable states
C)no stable states   
(D)none of these
Ans:- C.
TIP:
An astable multivibrator has two states but neither of them are stable.

13. The number of different trees with 8 nodes is


(A) 256
(B) 255
(C) 248
(D) None of these


Ans:-C


Explanation:-
Formula is 2n-n.
Here the value of n=8. So, the formula would become28-8=256-8=248So the answer is 248 and so the option is C.

14. Prototyping is used to

(A) test the software as an end product
(B) expand design details
(C) refine and establish requirements gathering
(D) None of the above
Ans:-C
15. The throughput of pure ALOHA is given by,
(A) S=G
(B) S=e pow 2G
(C) S=Ge pow 2G
(D) S=Ge pow -2G
Ans:-D
Often asked question
16. Assume N segments in memory and a page size of P bytes. The wastage on account of internal fragmentation is:
(A) NP/2 bytes
(B) P/2 bytes
(C) N/2 bytes
(D) NP bytes
Ans.: A
17. A compiler that runs on one machine and produces code for a different machine is called:
(A) Cross compilation
(B) One pass compilation
(C) Two pass compilation
(D) None of the above
Ans:- A
18. Reverse engineering is the process which deals with:
(A) Size measurement
(B) Cost measurement
(C) Design recovery
(D) All of the above
Ans:- C
19. In multiuser database if two users wish to update the same record at the same time, they are prevented from doing so by

(A) Jamming
(B) Password
(C) Documentation
(D) Record lock
Ans:-D

20. Validation means

(A) are we building the product right
(B) are we building the right product
(C) verification of fields
(D) None of the above

Ans:-B

1 comment: