UGC NET JUNE 2013
SYLLABUS, MODEL PAPER/ PREVIOUS YEARS SOLVED QUESTION PAPERS.
UGC NET (NATIONAL ELIGIBILITY TEST) : OLD SOLVED/PREVIOUS EXAM QUESTION PAPERS WITH SOLUTIONS AND EXPLANATIONS AND FREE STUDY MATERIALS.
COMPUTER MEMORY BASED PREVIOUS YEARS SOLVED PAPERS I, II AND III TO PREPARE AND PASS THE UGC NET/SLET ENTRANCE EXAMINATION WITH HIGH PERCENTAGE.
COMPUTER BASIC QUESTIONS FOR BANK EXAM, HTAT, CTAT, TAT, UGC-NET, INTERVIEW AND OTHER EXAM'S, WHERE BASIC QUESTION'S ARE REQUIRED.
3. The total number of spanning trees that can be drawn using five labeled vertices is:
(A). 125
(B).64
(C ). 36
(D). 16
4. Extremely low power dissipation and low cost per gate can be achieved in
(A) MOS ICS
(B) C MOS ICS
(C ) TTL ICS
(D) ECL ICS
5. An example of a universal building block is :
(A). EX-OR Gate
(B). AND Gate
(C ). OR gate
(D). NOR Gate
6. An example of a layer that is absent in broadcast networks is :
(A). Physical layer
(B). Presentation layer
(C ). Network layer
(D). application layer
7. The ATM cell is :
(A). 48 bytes long
(B). 53 bytes long
(C ). 64 bytes long
(D). 69 bytes long
8. 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
9. Suppose it takes 100ns to access page table and 20 ns to access associative memory. If the average access time is 28ns, the corresponding hit rate is:
(A). 100 percent
(B). 90 percent
(C ). 80 percent
(D). 70 percent
10. Transmission of N signals , each band limited to Fm Hz by TDM, requires a minimum band-width of
(A).fm
(B) 2 fm
(C ) N fm
(D) 2N fm
11. 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
12. A relation R in {1,2,3,4,5,6} is given by {(1,2),(2,3),(3,4),(4,4),(4,5)}. The relation is :
(A) Reflexive
(B). symmetric
(C ). Transitive
(D). not reflexive, not symmetric and not transitive
13. The dual of the switching function x+yz is:
(A). x+yz
(B). x+yz
(C ). x(y+z)
(D). x(y+z)
14. The characteristic equation of D-flip flop is :
(A). Q=1
(B). Q=0
(C ). Q=D
(D). Q=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
16. The throughput of slotted ALOHA is given by:
(A). S=G
(B). S=GeG
(C ). S=Ge-G
(D). S=eG
17. Congestion control is done by
(A). Network layer
(B). Physical layer
(C ). Presentation layer
(D). Application layer
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
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
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
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
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
23. An example of a non-premptive scheduling algorithm is:
(A). Round robin
(B). Priority scheduling
(C ). Shortest job first
(D). 2 level scheduling
24. An example of a distributed OS is:
(A). Amoeba
(B). UNIX
(C ). MS – DOS
(D). MULTICS
25. Which one of the following correctly describes a static variable:
(A). It cannot be initialized.
(B). It is initialized once at the commencement of execution and cannot be changed during run time.
(C ). It retains its value during the life of the program.
(D). None of the above
IF YOU FIND ANY ANSWER WRONG,COMMENT ME, SO THAT I RIGHT THAT ANSWER
THANKS
UGC NET (NATIONAL ELIGIBILITY TEST) : OLD SOLVED/PREVIOUS EXAM QUESTION PAPERS WITH SOLUTIONS AND EXPLANATIONS AND FREE STUDY MATERIALS.
COMPUTER MEMORY BASED PREVIOUS YEARS SOLVED PAPERS I, II AND III TO PREPARE AND PASS THE UGC NET/SLET ENTRANCE EXAMINATION WITH HIGH PERCENTAGE.
COMPUTER BASIC QUESTIONS FOR BANK EXAM, HTAT, CTAT, TAT, UGC-NET, INTERVIEW AND OTHER EXAM'S, WHERE BASIC QUESTION'S ARE REQUIRED.
1. The channel capacity of a band-limited Gaussian channel is given by
(A). B log2 (2+S/N)
(B) B log2 (1+S/N)
(C ).B log10(1+S/N)
(D). B loge(1+S/N)
2. The graph K 3,4 has _______ edges.
(A). 3 edges
(B) 4 edges
(C ). 7 edges
(D) 12 edges
(A). B log2 (2+S/N)
(B) B log2 (1+S/N)
(C ).B log10(1+S/N)
(D). B loge(1+S/N)
2. The graph K 3,4 has _______ edges.
(A). 3 edges
(B) 4 edges
(C ). 7 edges
(D) 12 edges
3. The total number of spanning trees that can be drawn using five labeled vertices is:
(A). 125
(B).64
(C ). 36
(D). 16
4. Extremely low power dissipation and low cost per gate can be achieved in
(A) MOS ICS
(B) C MOS ICS
(C ) TTL ICS
(D) ECL ICS
5. An example of a universal building block is :
(A). EX-OR Gate
(B). AND Gate
(C ). OR gate
(D). NOR Gate
6. An example of a layer that is absent in broadcast networks is :
(A). Physical layer
(B). Presentation layer
(C ). Network layer
(D). application layer
7. The ATM cell is :
(A). 48 bytes long
(B). 53 bytes long
(C ). 64 bytes long
(D). 69 bytes long
8. 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
9. Suppose it takes 100ns to access page table and 20 ns to access associative memory. If the average access time is 28ns, the corresponding hit rate is:
(A). 100 percent
(B). 90 percent
(C ). 80 percent
(D). 70 percent
10. Transmission of N signals , each band limited to Fm Hz by TDM, requires a minimum band-width of
(A).fm
(B) 2 fm
(C ) N fm
(D) 2N fm
11. 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
12. A relation R in {1,2,3,4,5,6} is given by {(1,2),(2,3),(3,4),(4,4),(4,5)}. The relation is :
(A) Reflexive
(B). symmetric
(C ). Transitive
(D). not reflexive, not symmetric and not transitive
13. The dual of the switching function x+yz is:
(A). x+yz
(B). x+yz
(C ). x(y+z)
(D). x(y+z)
14. The characteristic equation of D-flip flop is :
(A). Q=1
(B). Q=0
(C ). Q=D
(D). Q=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
16. The throughput of slotted ALOHA is given by:
(A). S=G
(B). S=GeG
(C ). S=Ge-G
(D). S=eG
17. Congestion control is done by
(A). Network layer
(B). Physical layer
(C ). Presentation layer
(D). Application layer
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
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
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
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
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
23. An example of a non-premptive scheduling algorithm is:
(A). Round robin
(B). Priority scheduling
(C ). Shortest job first
(D). 2 level scheduling
24. An example of a distributed OS is:
(A). Amoeba
(B). UNIX
(C ). MS – DOS
(D). MULTICS
25. Which one of the following correctly describes a static variable:
(A). It cannot be initialized.
(B). It is initialized once at the commencement of execution and cannot be changed during run time.
(C ). It retains its value during the life of the program.
(D). None of the above
IF YOU FIND ANY ANSWER WRONG,COMMENT ME, SO THAT I RIGHT THAT ANSWER
THANKS
0 comments:
Post a Comment