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

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

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

1. Which of the following is a sequential circuit?

Options

A : Multiplexer

B : Decoder

C : Counter

D : Full adder

2. 8085 microprocessor has _____ hardware interrupts.

Options

A : 2

B : 3

C : 4

D : 5

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

Options

A : DAD D

B : DAD H

C : DAD B

D : DAD SP

4. The register that stores all interrupt requests is:

Options

A : Interrupt mask register

B : Interrupt service register

C : Interrupt request register

D : Status register

5. The _____ addressing mode is similar to register indirect addressing mode, except that an offset is added to the contents of the register. The offset and register are specified in the instruction.

Options

A : Base indexed

B : Base indexed plus displacement

C : Indexed

D : Displacement

46. Software safety is quality assurance activity that focuses on hazards that

Options

A : affect the reliability of a software component.

B : may cause an entire system to fail.

C : may result from user input errors.

D : prevent profitable marketing of the final product.

47. Which of the following sets represent five stages defined by Capability Maturity Model (CMM) in increasing order of maturity ?

Options

A : Initial, Defined, Repeatable, Managed, Optimized.

B : Initial, Repeatable, Defined, Managed, Optimized.

C : Initial, Defined, Managed, Repeatable, Optimized.

D : Initial, Repeatable, Managed, Defined, Optimized.

48. The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to complete the project using the effort formula of basic COCOMO given below : E = a(KLOC) b Assume that the values of a and b are 2.5 and 1.0 respectively.

Options

A : 25 person months

B : 75 person months

C : 62.5 person months

D : 72.5 person months

49. In UNIX, processes that have finished execution but have not yet had their status collected are known as _________.

Options

A : Sleeping processes

B : Stopped processes

C : Zombie processes

D : Orphan processes

50. In Unix operating system, when a process creates a new process using the fork () system call, which of the following state is shared between the parent process and child process?

Options

A : Heap

B : Stack

C : Shared memory segments

D : Both Heap and Stack

51. Which of the following information about the UNIX file system is not correct?

Options

A : Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks.

B : An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data.

C : Each i-node is 256-bytes long.

D : All the files and directories are stored in data blocks.

52. Which of the following option with reference to UNIX operating system is not correct?

Options

A : INT signal is sent by the terminal driver when one types and it is a request to terminate the current operation.

B : TERM is a request to terminate execution completely. The receiving process will clean up its state and exit.

C : QUIT is similar to TERM, except that it defaults to producing a core dump if not caught.

D : KILL is a blockable signal.

53. A multicomputer with 256 CPUs is organized as 16 × 16 grid. What is the worst case delay (in hops) that a message might have to take ?

Options

A : 16

B : 15

C : 32

D : 30

54. Suppose that the time to do a null remote procedure call (RPC) (i.e. 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs ?

Options

A : 49 msec

B : 80 msec

C : 48 msec

D : 100 msec

55. Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation R M defined by M. As all states are reachable from the start state, R M has _____ equivalence classes.

Options

A : 2

B : 4

C : 5

D : 6

56. Let L = {0 n 1 n |n ≥ 0} be a context free language. Which of the following is correct ?

Options

A : L' is context free and L k is not context free for any k ≥ 1.

B : L' is not context free and L k is not context free for any k ≥ 1.

C : Both L' and L k is for any k ≥ 1 are context free

D : Both L' and L k is for any k ≥ 1 are not context free

57. Given a Turing Machine M = ({q 0 , q 1 , q 2 , q 3 }, {a, b}, {a, b, B}, δ, B, {q 3 }) Where δ is a transition function defined as δ(q 0 , a) = (q 1 , a, R) δ(q 1 , b) = (q 2 , b, R) δ(q 2 , a) = (q 2 , a, R) δ(q 3 , b) = (q 3 , b, R) The language L(M) accepted by the Turing Machine is given as:

Options

A : aa*b

B : aa*b

C : aba*b

D : aba*

58. Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x knowing y; and I (x; y) is the information transmission. Which of the following does not define the channel capacity of a discrete memoryless channel?

Options

A : max I (x; y) p(x)

B : max [H(y) – H(y|x)] p(x)

C : max [H(x) – H(x|y)] p(x)

D : max H(x|y) p(x)

59. Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information ?

Options

A : 2 bits per symbol

B : 1.75 bits per symbol

C : 1.50 bits per symbol

D : 1.25 bits per symbol

60. Which of the following is used for the boundary representation of an image object?

Options

A : Quad Tree

B : Projections

C : Run length coding

D : Chain codes

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