Home - Ugc Net Computer Science - Previous Year Solved Papers - UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 August 2016

UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 August 2016 Online Exam Quiz

Important questions about UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 August 2016. UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 August 2016 MCQ questions with answers. UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 August 2016 exam questions and answers for students and interviews.

1. A ripple counter is a (n):

Options

A : Synchronous Counter

B : Asynchronous counter

C : Parallel counter

D : None of the above

2. 8085 microprocessor has ____ bit ALU.

Options

A : 32

B : 16

C : 8

D : 4

3. The register that stores the bits required to mask the interrupts is ______.

Options

A : Status register

B : Interrupt service register

C : Interrupt mask register

D : Interrupt request register

4. Which of the following in 8085 microprocessor performs HL = HL + HL?

Options

A : DAD D

B : DAD H

C : DAD B

D : DAD SP

5. In ______ addressing mode, the operands are stored in the memory. The address of the corresponding memory location is given in a register which is specified in the instruction.

Options

A : Register direct

B : Register indirect

C : Base indexed

D : Displacement

46. The ISO quality assurance standard that applies to software Engineering is

Options

A : ISO 9000 : 2004

B : ISO 9001 : 2000

C : ISO 9002 : 2001

D : ISO 9003 : 2004

47. Which of the following are external qualities of a software product?

Options

A : Maintainability, reusability, portability, efficiency, correctness.

B : Correctness, reliability, robustness, efficiency, usability.

C : Portability, interoperability, maintainability, reusability.

D : Robustness, efficiency, reliability, maintainability, reusability.

48. Which of the following is/are CORRECT statement(s) about version and release? I. A version is an instance of a system, which is functionally identical but non-functionally distinct from other instances of a system. II. A version is an instance of a system, which is functionally distinct in some way from other system instances. III. A release is an instance of a system, which is distributed to users outside of the development team. IV. A release is an instance of a system, which is functionally identical but non-functionally distinct from other instances of a system.

Options

A : I and III

B : II and IV

C : I and IV

D : II and III

49. The Unix Operating System Kernel maintains two key data structures related to processes, the process table and the user structure. Now, consider the following two statements : I. The process table is resident all the time and contain information needed for all processes, even those that are not currently in memory. II. The user structure is swapped or paged out when its associated process is not in memory, in order not to waste memory on information that is not needed. Which of the following options is correct with reference to above statements ?

Options

A : Only (I) is correct.

B : Only (II) is correct.

C : Both (I) and (II) are correct.

D : Both (I) and (II) are wrong.

50. Consider a system which have ‘n’ number of processes and ‘m’ number of resource types. The time complexity of the safety algorithm, which checks whether a system is in safe state or not, is of the order of:

Options

A : O(mn)

B : O(m 2 n 2 )

C : O(m 2 n)

D : O(mn 2 )

51. An operating system supports a paged virtual memory, using a central processor with a cycle time of one microsecond. It costs an additional one microsecond to access a page other than the current one. Pages have 1000 words, and the paging device is a drum that rotates at 3000 revolutions per minute and transfers one million words per second. Further, one percent of all instructions executed accessed a page other than the current page. The instruction that accessed another page, 80% accessed a page already in memory and when a new page was required, the replaced page was modified 50% of the time. What is the effective access time on this system, assuming that the system is running only one process and the processor is idle during drum transfers?

Options

A : 30 microseconds

B : 34 microseconds

C : 60 microseconds

D : 68 microseconds

52. Consider the following page reference string : 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6 Which of the following options, gives the correct number of page faults related to LRU, FIFO, and optimal page replacement algorithms respectively, assuming 05 page frames and all frames are initially empty ?

Options

A : 10, 14, 8

B : 8, 10, 7

C : 7, 10, 8

D : 7, 10, 7

53. Consider a file currently consisting of 50 blocks. Assume that the file control block and the index block is already in memory. If a block is added at the end (and the block information to be added is stored in memory), then how many disk I/O operations are required for indexed (single-level) allocation strategy?

Options

A : 1

B : 101

C : 27

D : 0

54. Given the following two languages : L1 = {uww R ν | u, v, w ∈ {a, b} + } L2 = {uww R ν | u, ν, w ∈ {a, b} + , |u| > |ν|} Which of the following is correct ?

Options

A : L 1 is regular language and L 2 is not regular language.

B : L 1 is not regular language and L 2 is regular language.

C : Both L 1 and L 2 are regular languages

D : Both L 1 and L 2 are not regular languages.

55. An experimental file server is up 75% of the time and down for 25% of the time due to bugs. How many times does this file server have to be replicated to give an availability of at least 99% ?

Options

A : 2

B : 4

C : 8

D : 16

56. Given a Turing Machine M = ({q 0 , q 1 }, {0, 1}, {0, 1, B}, δ, B, {q1 }) Where δ is a transition function defined as δ(q 0 , 0) = (q 0 , 0, R) δ(q 0 , B) = (q 1 , B, R) The language L(M) accepted by Turing machine is given as :

Options

A : 0* 1*

B : 00*

C : 10*

D : 1*0*

57. Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A → ν, with |ν| = k > 1. The derivation tree for any string W ∈ L (G) has a height such that

Options

A : h<((|W| - 1)/k-1)

B : log k |W| < h

C : log k |W| < h < ((|W| - 1)/k-1)

D : log k |W| <= h <= ((|W| - 1)/k-1)

58. Which of the following is not used in standard JPEG image compression?

Options

A : Huffman coding

B : Runlength encoding

C : Zig-zag scan

D : K-L Transform

59. Which of the following is a source coding technique?

Options

A : Huffman coding

B : Arithmetic coding

C : Run-length coding

D : DPCM

60. If the histogram of an image is clustered towards origin on X-axis of a histogram plot then it indicates that the image is ______.

Options

A : Dark

B : Good contrast

C : Bright

D : Very low contrast

Ugc Net Computer Science - Previous Year Solved Papers more Online Exam Quiz

Copyright © 2021
Exam-GK-MCQ-Questions.Com | Contact Us | Privacy Policy | Terms of Use | Sitemap | 0.018186807632446