Computer Science and Application UGC-NET 2008 December Paper II - Q.13 - Q.24
13. The dual of the switching function x+yz is:
(A). x+yz (B). x+yz
(C ). x(y+z) (D). x(y+z)
Ans: D
14. The characteristic equation of D-flip flop is :
(A). Q=1 (B). Q=0
(C ). Q=D (D). Q=D
Ans: D.
15. If four 4 input mulitplexers drive a 4 input multiplexer we get a :
(A) 16 input MUX (B) 8 input MUX
(C ) 4 input MUX (D) 2 input MUX
Ans: A
16. The throughput of slotted ALOHA is given by:
(A). S=G (B). S=GeG
(C ). S=Ge-G (D). S=eG
Ans: C
17. Congestion control is done by
(A). Network layer (B). Physical layer
(C ). Presentation layer (D). Application layer
Ans: A.
Explanation: Addressing, internet-working, error handling, packet sequencing are its other jobs.
18. Assertion(A): Twisted pairs are widely used as transmission medium.
Reasoning(R ): Twisted pairs have adequate performance and low cost.
(A). Both (A) and (R ) are true and (R ) is the correct explanation for (A).
(B). Both (A) and (R ) are true but (R ) is not the correct explanation
(C ). (A) is true but (R ) is false
(D). (A) is false but (R ) is true
Ans: A.
19. 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.
20. IP address in B class is given by:
(A) 125.123.123.2 (B) 191.023.21.54
(C ) 192.128.32.56 (D) 10.14.12.34
Ans: B
21. N processes are waiting for I/O. A process spends a fraction of its time in I/O wait state. The CPU utilization is given by:
(A). 1-P –N (B). 1 – P N
(C ). P N (D). P -N
Ans:B.
Explanation: According to the probabilistic model, if a process spends a fraction p of its time in I/O wait state, and if there are N processes in memory, then the CPU utilization is given by 1-PN
22. If holes are half as large as processes, the fraction of memory wasted in holes is:
(A) 2 / 3 (B) 1 / 2
(C ) 1 / 3 (D) 1 / 5
Ans : D
23. An example of a non-premptive scheduling algorithm is:
(A). Round robin (B). Priority scheduling
(C ). Shortest job first (D). 2 level scheduling
Ans: C
24. An example of a distributed OS is:
(A). Amoeba (B). UNIX
(C ). MS – DOS (D). MULTICS
Ans: A
13. The dual of the switching function x+yz is:
(A). x+yz (B). x+yz
(C ). x(y+z) (D). x(y+z)
Ans: D
14. The characteristic equation of D-flip flop is :
(A). Q=1 (B). Q=0
(C ). Q=D (D). Q=D
Ans: D.
15. If four 4 input mulitplexers drive a 4 input multiplexer we get a :
(A) 16 input MUX (B) 8 input MUX
(C ) 4 input MUX (D) 2 input MUX
Ans: A
16. The throughput of slotted ALOHA is given by:
(A). S=G (B). S=GeG
(C ). S=Ge-G (D). S=eG
Ans: C
17. Congestion control is done by
(A). Network layer (B). Physical layer
(C ). Presentation layer (D). Application layer
Ans: A.
Explanation: Addressing, internet-working, error handling, packet sequencing are its other jobs.
18. Assertion(A): Twisted pairs are widely used as transmission medium.
Reasoning(R ): Twisted pairs have adequate performance and low cost.
(A). Both (A) and (R ) are true and (R ) is the correct explanation for (A).
(B). Both (A) and (R ) are true but (R ) is not the correct explanation
(C ). (A) is true but (R ) is false
(D). (A) is false but (R ) is true
Ans: A.
19. 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.
20. IP address in B class is given by:
(A) 125.123.123.2 (B) 191.023.21.54
(C ) 192.128.32.56 (D) 10.14.12.34
Ans: B
21. N processes are waiting for I/O. A process spends a fraction of its time in I/O wait state. The CPU utilization is given by:
(A). 1-P –N (B). 1 – P N
(C ). P N (D). P -N
Ans:B.
Explanation: According to the probabilistic model, if a process spends a fraction p of its time in I/O wait state, and if there are N processes in memory, then the CPU utilization is given by 1-PN
22. If holes are half as large as processes, the fraction of memory wasted in holes is:
(A) 2 / 3 (B) 1 / 2
(C ) 1 / 3 (D) 1 / 5
Ans : D
23. An example of a non-premptive scheduling algorithm is:
(A). Round robin (B). Priority scheduling
(C ). Shortest job first (D). 2 level scheduling
Ans: C
24. An example of a distributed OS is:
(A). Amoeba (B). UNIX
(C ). MS – DOS (D). MULTICS
Ans: A