# NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 4 - 6 of 2202

Access detailed explanations (illustrated with images and videos) to 2202 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Unlimited Access for Unlimited Time!

View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

## Question number: 4

Edit

Appeared in Year: 2015

Match List-Ⅰ List-Ⅱ▾

### Question

Match the following terms: (December)

 List-Ⅰ List-Ⅱ (A)Direct proof (i)A proof that the implication p→q is true 0 that proceeds by showing that p must be false when q is false. (B)Trivial proof (ii)A proof that the implication p→q is true based on the fact that q is true (C)Vacuous proof (iii)A proof that the implication p→q is true based on the fact that p is false (D)Indirect proof (iv)A proof that the implication p→q is true that proceeds by showing that q must be true when p is true

### Choices

Choice (4)Response
• (A)
• (B)
• (C)
• (D)

a.

• (iv)
• (ii)
• (iii)
• (i)

b.

• (i)
• (iii)
• (ii)
• (iv)

c.

• (iv)
• (i)
• (iii)
• (ii)

d.

• (iv)
• (iii)
• (i)
• (ii)

## Question number: 5

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

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}

Developed by: