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

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 » Linked Lists

Edit

Appeared in Year: 2013

MCQ▾

Question

If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (December Paper-II)

Choices

Choice (4)Response

a.

Neither of the pointers change

b.

Front pointer and a rear pointer changes

c.

Only front pointer changes

d.

Only rear pointer changes

Question number: 2

» Data and File Structures » Linked Lists

Edit

Appeared in Year: 2013

MCQ▾

Question

Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation? (June Paper III)

Choices

Choice (4)Response

a.

Circular linked list

b.

Dequeue

c.

Linked list

d.

Doubly linked list

Question number: 3

» Data and File Structures » Linked Lists

Edit

Appeared in Year: 2013

MCQ▾

Question

Linked Lists are not suitable for ________. (September Paper II)

Choices

Choice (4)Response

a.

Binary Search

b.

Polynomial Manipulation

c.

Insertion

d.

Radix Sort

Developed by: