Data Structures :: Linked Lists

Home > Data Structures > Linked Lists > General Questions

1 / 22

 What Member function places a new node at the end of the linked list?

Answer: Option A

Explanation:

The appendNode() member function places a new node at the end of the linked list. The appendNode() requires an integer representing the current data of the node.

Workspace

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

3 / 22

 To create a linked list, we can allocate space and make something point to it, by

writing:

struct-narne *pointer-variable;

Which of the following statement will correctly allocate the space

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

4 / 22

 Assume single linked list pseudo code as follows?

struct Node {
data
next
}
record List {
Node firstNode
}

function1(List list) {
obsoleteNode = list.firstNode; list.firstNode = list.firstNode.next; free obsoleteNode;
}

function2(node node) {
obsoleteNode = node.next; node.next= node.next.next; free obsoleteNode;
}

function3(Node node,Node newNode) {
newNode.next = node.next;node.next= newNode
}

function4(List list, Node newNode) {
newNode.next = list.firstNode; list.firstNode = newNode;
}

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Commvault

5 / 22

 Which of the following can a Dynamic Link Library contain?

Answer: Option D

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Commvault

6 / 22

 Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer?

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

8 / 22

 In a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

10 / 22

 The time required to delete a node x from a doubly linked list having n nodes is

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!