# Data and File Structures-Priority Queues and Heaps [NTA-NET (Based on NTA-UGC) Computer Science (Paper-II)]: Questions 1 - 5 of 14

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 » Priority Queues and Heaps

Edit

Appeared in Year: 2016

MCQ▾

### Question

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

### Choices

Choice (4)Response

a.

[26,15,17,14,11,9, 13]

b.

[26,15,14,17,11,9, 13]

c.

[26,13,17,14,11,9, 15]

d.

[26,15,13,14,11,9, 17]

## Question number: 2

» Data and File Structures » Priority Queues and Heaps

Edit

Appeared in Year: 2010

MCQ▾

### Question

What is the most appropriate data structure to implement a priority queue? (June Paper II)

### Choices

Choice (4)Response

a.

Heap

b.

c.

Circular array

d.

Binary tree.

## Question number: 3

» Data and File Structures » Priority Queues and Heaps

Edit

Appeared in Year: 2010

MCQ▾

### Question

The time complexity to build a heap of n elements is (December Paper II)

### Choices

Choice (4)Response

a.

0 (lgn)

b.

0 (nlgn)

c.

0 (1)

d.

0 (n)

## Question number: 4

» Data and File Structures » Priority Queues and Heaps

Edit

Appeared in Year: 2011

MCQ▾

### Question

When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in (queue containing n elements) (June Paper 2)

### Choices

Choice (4)Response

a.

q (n) and q (1) respectively

b.

q (n) and q (n) respectively

c.

q (1) and q (1) respectively

d.

None of the above

## Question number: 5

» Data and File Structures » Priority Queues and Heaps

Edit

Appeared in Year: 2013

MCQ▾

### Question

Consider the following statements for priority queue:

S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.

S2: The elements of a priority queue may be complex structures that are ordered on one or several fields.

Which of the following is correct? (June Paper II)

### Choices

Choice (4)Response

a.

S1 and S2 are incorrect.

b.

S1 is correct and S2 is incorrect.

c.

S1 is incorrect and S2 is correct.

d.

S1 and S2 are correct.

Developed by: