Question $1(1$ point$)$

$$

What is the optimal time complexity to count the number of nodes in a linked list?

Question $1$ options:

O$($n$^2)$

O$($nlogn$)$

O$(1)$

O$($n$)$

Question $2(1$ point$)$

$$

The last node in a singly linked list points to

Question $2$ options:

first node

a null pointer

middle node

last node

Question $3(1$ point$)$

$$

What is the space complexity for deleting a linked list

Question $3$ options:

O$($nlogn$)$

O$($n$^2)$

O$($n$)$

O$(1)$

Question $4(1$ point$)$

$$

Minimum number of fields in each node of a doubly linked list is

Question $4$ options:

$3$

$1$

$2$

$4$

Question $5(1$ point$)$

$$

In a doubly linked list, what is the advantage of having both forward and backward pointers?

Question $5$ options:

It allows for faster sorting of the list.

It reduces memory usage.

It allows for efficient traversal in both directions.

It ensures that the list contains no duplicates.

Question $6(1$ point$)$

$$

In the best case, the number of comparisons needed to search a singly linked of length n for a given element will be

Question $6$ options:

n

$1$

nlogn

n$^2$

Question $7(1$ point$)$

$$

If the head pointer of a singly linked list points to nullptr, this indicates

Question $7$ options:

The list needs to be destroyed

The list is full and cannot accept new nodes

There are no nodes in the list

There are $10$ nodes in the list

Question $8(1$ point$)$

$$

Consider the following operations to insert a new node at the head of a linked list. Does the order of $1$ and $2$ matter?

$1$: new$->$next $=$ head;

$2$: head $=$ new;

Question $8$ options:

TrueFalse

Question $9(1$ point$)$

$$

In the worst case, the number of comparisons needed to search a singly linked of length n for a given element will be

Question $9$ options:

$1$

nlogn

n

n$^2$

Question $10(1$ point$)$

$$

In a circular linked list, the last node points to the

Question $10$ options:

first node

none

middle node

tail node