IMPORTANT SOLVED MCQS FOR UGC NET COMPUTER SCIENCE JUNE 2015

IMPORTANT SOLVED MCQS FOR UGC NET COMPUTER SCIENCE JUNE 2015

1. Consider the following transaction involving two bank accounts x and y

read(x); x := x -50; write(x); read(y); y := y - 50; write(y)

The constraint that the sum of the accounts x and y should remain constant is that of

(A) Atomicity

 (B) Consistency

(C) Isolation

(D) Durability

Ans : B

2. Consider the following two statements

S1:If a candidate is known to be corrupt, then he will not be elected.

S2:If a candidate is kind, he will be elected

Which one of the following statements follows from S1 and S2 as per sound inference

rules of logic?

(A) If a person is known to be corrupt, he is kind

(B) If a person is not known to be corrupt, he is not kind

(C) If a person is kind, he is not known to be corrupt.

(D) If a person is not kind, he is not known to be corrupt.

Ans : C

3. A software requirements specification (SRS) document should avoid discussing which

one of the following?

(A) User Interface issues

(B) Non-functional requirements

(C) Design Specification

(D) Interfaces with third party software

Ans : C

4.  Which one of the following statements is NOT correct about HTTP cookies?

(A) A cookie is a piece of code that has the potential to compromise the security of an

Internet user

(B) A cookie gains entry to the user’s work area through an HTTP header

(C) A cookie has an expiry date and time

(D) cookies can be used to track the browsing pattern of a particular site.

Ans : B

5. In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of

the following is TRUE?

(A) In both AST and CFG, let node N2 be the successor of node N1. In the input program,

the code corresponding to N2 is present after the code corresponding to N1.

(B) For any input program, neither AST nor CFG will contain a cycle

(C) The maximum number of successors of a node in an AST nad a CFG depends on the

input program.

(D) Each node in AST and CFG corresponds to at most one statement in the input

program

Ans : C

6. Let R be the relation on the set of positive integers such that aRb if and only if a and b

are distinct and have a common divisor other than 1. Which one of the following

statements about R is true?

(A) R is symmetric and reflexive but not transitive.

(B) R is reflexive but not symmetric and not transitive.

(C) R is transitive but not reflexive and not symmetric.

(D) R is symmetric but not reflexive and not transitive

Ans : D

7. Consider a complete binary tree where the left and the right subtrees of the root are maxheaps.

The lower bound for the number of operators to convert the tree to a heap is

(A) Ω(log n)

(B) Ω(n)

(C) Ω(n log n)

 (D) Ω(n2)

Ans : A

8. Match the following

P. Lexical analysis                 1. Graph coloring

Q. Parsing                               2. DFA minimization

R. Register allocation                         3. Post-order traversal

S. Expression evaluation        4. Production tree

(A) P-2, Q-3, R-1, S-4.

 (B) P-2, Q-1, R-4, S-3.

(C) P-2, Q-4, R-1, S-3

(D) P-2, Q-3, R-4, S-1.

Ans : C

9. Identify the correct order in which a server process must invoke the function calls accept,

bind, listen, and recv according to UNIX socket API.

(A) Listen, accept, bind, recv

 (B) bind, listen, accept, recv

(C) Bind, accept, listen, recv

(D) accept, listen, bind, recv

Ans : B

10. Consider the following statements.

I. The complement of every turning decidable language is turning decidable.

II. There exists some language which is in NP but is not turning decidable

III.If L is a language in NP, L is Turning Decidable

Which of the above statements is/are true?

(A)  Only II

(B) Only III

(C) Only I and II

(D) Only I and III

Ans : D

11. A graph is self-complementary if it is isomorphic to its complement. For All selfcomplementary

graphs on n vertices, n is

(A) A multiple of 4

 (B) Even

(C) Odd

 (D) Congruent 0 mod 4,or,1 mod 4.

Ans : D

12. Given below are some algorithms, and some algorithm design paradigms

1.Dijkstra’s shortest path                               i.Divide and conquer

2.Floyd-warshall algorithm to compute all    ii.Dynamic programming

Pairs shortest path

3.Binary search on a sorted array                iii.Greedy design

4.Backtracking search on a graph                 iv.Depth-first search

v. Breadth-first search

Match the above algorithms on the left to the corresponding design paradigm they they

follow.

(A) 1-i,2-iii,3-i,4-v.

 (B) 1-iii,2-iii,3-i,4-v.

(C) 1-iii,2-ii,3-i,4-iv.

(D) 1-iii,2-ii,3-i,4-v.

Ans : C

13. Which one of the following assertions concerning code inspection and code walkthrough

is true?

(A) Cod inspection is carried out once the code has been unit tested

(B) code inspection and code walkthrough are synonyms

(C) Adherence to coding standards is checked during code inspection

(D) code walkthrough is usually carried out by an independent test team

Ans : C

14. In a connected graph , a bridge is an edge whose removal discounts a graph. Which one of

the following statements is true?

(A) A tree has no bridges

(B) A bridge cannot be part of a simple cycle

(C) Every edge of a clique with size

graph)

(D) A graph with bridges cannot have a cycle

Ans : B

15. The cardinality of the power set of {0,1,2,……,10} is ____________

Ans : 2048

All the Best.