CBSE NET JULY 2016 PAPER 3 SOLVED PART-3

This entry was posted in CBSE NET on by

Pages: 1 2 3 4 5

  1. The number of different binary trees with 6 nodes is ………….

(A) 6 (B) 42

(C) 132 (D) 256

Answer: C

  1. Let A[1…n] be an array of n distinct numbers. If i<j and A[i]>A[j], then the pair (i,j) is called an inversion of A. What is the expected number of inversions in any permutation on n elements?

(A) θ(n) (B) θ(lg n)

(C) θ(nlg n) (D) θ(n2)

Answer: D

check Explanation: http://targatenet.com/cbse-net-june-2016-answer-keys/

  1. Which one of the following array represents a binary max-heap?

(A) [26, 13, 17, 14, 11, 9, 15]

(B) [26, 15, 14, 17, 11, 9, 13]

(C) [26, 15, 17, 14, 11, 9, 13]

(D) [26, 15, 13, 14, 11, 9, 17]

Answer: C

check Explanation: http://targatenet.com/cbse-net-june-2016-answer-keys/

  1. Match the following:

(a) Huffman codes (i) O(n2)

(b) Optimal polygon triangulation (ii) θ(n3)

(c) Activity selection problem (iii) O(nlgn)

(d) Quicksort (iv) θ(n)

Codes:

(a) (b) (c) (d)

(A) (i) (ii) (iv) (iii)

(B) (i) (iv) (ii) (iii)

(C) (iii) (ii) (iv) (i)

(D) (iii) (iv) (ii) (i)

Answer: C

  1. Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined?

(A) 925, 221, 912, 245, 899, 259, 363, 364

(B) 3, 400, 388, 220, 267, 383, 382, 279, 364

(C) 926, 203, 912, 241, 913, 246, 364

(D) 3, 253, 402, 399, 331, 345, 398, 364

Answer: C

check Explanation: http://targatenet.com/cbse-net-june-2016-answer-keys/




  1. A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ……………. chords and divides the polygon into …………… triangles.

(A) n-2, n-1 (B) n-3, n-2

(C) n-1, n (D) n-2, n-2

Answer: B

  1. Implicit return type of a class constructor is:

(A) not of class type itself (B) class type itself

(B) a destructor of class type (D) a destructor not of class type

Answer: B

  1. It is possible to define a class within a class termed as nested class. There are ………… types of nested classes.

(A) 2 (B) 3

(C) 4 (D) 5

Answer: B

  1. Which of the following statements is correct?

(A) Aggregation is a strong type of association between two classes with full ownership.

(B) Aggregation is a strong type of association between two classes with partial ownership.

(C) Aggregation is a weak type of association between two classes with partial ownership.

(D) Aggregation is a weak type of association between two classes with full ownership.

Answer: C

  1. Which of the following statements is correct?

(A) Every class containing abstract method must not be declared abstract.

(B) Abstract class cannot be directly initiated with ‘new’ operator.

(C) Abstract class cannot be initiated.

(D) Abstract class contains definition of implementation.

Answer: B,C

  1. Which of the following statements is not correct?

(A) HTML is not screen precise formatting language.

(B) HTML does not specify a logic.

(C) DHTML is used for developing highly interactive web pages.

(D) HTML is a programming language.

Answer: D

  1. When one object reference variable is assigned to another object reference variable then

(A) a copy of the object is created.

(B) a copy of the reference is created.

(C) a copy of the reference is not created.

(D) it is illegal to assign one object reference variable to another object reference variable.

Answer: B

  1. A server crashes on the average once in 30 days, that is, the Mean Time Between Failures (MTBF) is 30 days. When this happens, it takes 12 hours to reboot it, that is, the Mean Time to Repair (MTTR) is 12 hours. The availability of server with these reliability data values is approximately:

(A) 96.3% (B) 97.3%

(C) 98.3% (D) 99.3%

Answer: C

check Explanation: http://targatenet.com/cbse-net-june-2016-answer-keys/

  1. Match the software maintenance activities in List-I to its meaning in List-II.

List-I List-II

  1. Corrective (a) Concerned with performing activities to reduce the software complexity thereby improving program understandability and increasing software maintainability.
  2. Adaptive (b) Concerned with fixing errors that are observed when the software is in use.

III. Perfective (c) Concerned with the change in the software that takes place to make the software adaptable to new environment (both hardware and software).

  1. Preventive (d) Concerned with the change in the software that takes place to make the software adaptable to changing user requirements.

Codes:

I II III IV

(A) (b) (d) (c) (a)

(B) (b) (c) (d) (a)UGC net study material

(C) (c) (b) (d) (a)

(D) (a) (d) (b) (c)

Answer: B

  1. Match each application/software design concept in List-I to its definition in List-II.

List-I List-II

  1. Coupling (a) Easy to visually inspect the design of the software and understand its purpose.
  2. Cohesion (b) Easy to add functionality to a software without having to redesign it.

III. Scalable (c) Focus of a code upon a single goal.

  1. Readable (d) Reliance of a code module upon other code modules.

Codes:

I II III IV

(A) (b) (a) (d) (c)

(B) (c) (d) (a) (b)

(C) (d) (c) (b) (a)

(D) (d) (a) (c) (b)

Answer: C

Pages: 1 2 3 4 5

Leave a comment