What is the advantage of using a doubly linked list for chaining over singly linked list?

What is the advantage of using linked list over the doubly linked list for chaining?

A

it takes less memory

B

it causes more collisions

C

it makes the process of insertion and deletion faster

D

it causes less collisions

A doubly linked list is declared as struct Node{ int Value; struct Note*fwd; struct Node * Bwd; } Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly liked list, if it is assumed that X points to neither the first nor the last node of the list?

A

x → Bwd → Fwd = X → Fwd → Bwd = X → Bwd;

B

X → Bwd.Fwd = x → Fwd;X.Fwd → Bwd = X → Bwd;

C

X.Bwd → Fwd = Bwd;X → Fwd.Bwd = X.Bwd;

D

X → Bwd → Fwd = X → Bwd;X → Fwd → Bwd = X → Fwd;

Which of the following statements are not correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?

A

Complexity of Insertion and Deletion at known position is O(n) in SLL and O(1) in DLL

B

SLL uses lesser memory per node than DLL

C

DLL has more searching power than SLL

D

Number of node fields in SLL is more than DLL

Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?

A

The best algorithm for the problem takes θ(n) time in the worst case.

B

The best algorithm for the problem takes θ(n log n) time in the worst case

C

The best algorithm for the problem takes θ(n²) time in the worst case.

D

It is not possible to reverse a singly linked list in O(1) space

Consider a singly linked list of the form where F is a pointer to the first element in the linked list and L is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?

A

Delete the last element of the list

B

Delete the first element of the list

C

Add an element after the last element of the list t

D

Interchange the first two elements of the list

Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?

A

Possible if X is not last node

B

Possible if size of linked list is even

C

Possible if size of linked list is odd

D

Possible if X is not first node

You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?

A

Delete the first element

B

Insert a new element as a first element

C

Delete the last element of the list

D

Add a new element at the end of the list

Simplify : $${{{5 \over 3} \times {7 \over {51}}{\text{ of }}{{17} \over 5} - {1 \over 3}} \over {{2 \over 9} \times {5 \over 7}{\text{ of }}{{28} \over 5} - {2 \over 3}}}$$

A

$$\frac{1}{2}$$

B

4

C

2

D

$$\frac{1}{4}$$

Consider a single linked list where F and L are pointers to the first and last elements respectively of the linked list. The time for performing which of the given operations depends on the length of the linked list ?

A

Delete the first element of the list

B

Interchange the first two elements of the list

C

Delete the last element of the list

D

Add an element at the end of the list

Which of the following assertions are CORRECT? P: Adding 7 to each entry in a list adds 7 to the mean of the list Q: Adding 7 to each entry in a list adds 7 to the standard deviation of the list R: Doubling each entry in a list doubles the mean of the list S: Doubling each entry in a list leaves the standard deviation of the list unchanged

A

P. Q

B

Q. R

C

P. R

D

R. S

What is the advantage of using a doubly linked list for chaining over singly linked list?

Related Questions