# Data and File Structures [NTA-NET (Based on NTA-UGC) Computer Science (Paper-II)]: Questions 1 - 3 of 129

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: 1

» 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}

## Question number: 2

» 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)

## Question number: 3

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

Edit

Appeared in Year: 2015

MCQ▾

### Question

The inorder traversal of the following tree is: (December)

### Choices

Choice (4)Response

a.

2 3 4 6 7 13 15 17 18 18 20

b.

2 4 3 13 7 6 15 17 20 18 18

c.

15 13 20 4 7 17 18 2 3 6 18

d.

20 18 18 17 15 13 7 6 4 3 2

Developed by: