Linked List

Choose difficulty:

Beginner

Intermediate

Advanced

1. As we have the memory address of Nodes can we traverse backwards in a linked list ?

a: Yes, we can. Explanation

Explanation

b: No, we can’t. Explanation

Explanation

2. What are the advantages of a linked list?

a: Dynamic Memory Allocation Explanation

Explanation

b: They require less memory than an array to store the same data. Explanation

Explanation

c: We can easily traverse back to previous elements. Explanation

Explanation

d: None of the above. Explanation

Explanation

3. What is the time complexity for insertion of an element into linked list?

a: O(1) Explanation

Explanation

b: O(log n) Explanation

Explanation

c: O(n) Explanation

Explanation

d: O(n^2) Explanation

Explanation

4. The following is a pseudo code for deleting an element from a linked list.

Which of the following is the most appropriate substitution for line 13?

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)