NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 5 - 7 of 2012

Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 5

» Programming in C and C Plus Plus » Reference Semantics and Their Implementation

Edit

Appeared in Year: 2015

MCQ▾

Question

Loop unrolling is a code optimization technique: (December)

Choices

Choice (4) Response

a.

That avoids tests at every iteration of the loop

b.

That improves performance by decreasing the number of instructions in a basic block.

c.

That exchanges inner loops with outer loops

d.

That reorders operations to allow multiple computations to happen in parallel.

Question number: 6

» Data and File Structures » File Structures » Traversal Techniques of Trees

Edit

Appeared in Year: 2015

MCQ▾

Question

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp

Discovery time stamps and finishing time stamps of Depth

Discovery Time Stamps and Finishing Time Stamps of Depth

Discovery time stamps and finishing time stamps of Depth First Search is given

It shows which of the following depth first forest?

Choices

Choice (4) Response

a.

{a, b, e} {c, d, h} {f, g}

b.

{a, b, e} {c, d, f, g, h}

c.

{a, b, c, d} {e, f, g} {h}

d.

{a, b, e} {f, g} {c, d} {h}

Question number: 7

» Data and File Structures » Arrays » Applications, Uses and Address Calculation

Edit

Appeared in Year: 2015

MCQ▾

Question

A three dimensional array in ‘C’ is declared as int A [x] [y] [z]. Here, the address of an item at the location A [p] [q] [r] can be computed as follows (where w is the word length of an integer): (December)

Choices

Choice (4) Response

a.

&A [0] [0] [0] +w (x×y×p + z×q + r)

b.

&A [0] [0] [0] +w (y×z×q + z×p + r)

c.

&A [0] [0] [0] +w (y×z×p + z×q + r)

d.

&A [0] [0] [0] +w (x×y×q + z×p + r)

Developed by: