30-MAY-2023_CSE1_LAB_11_QUIZ

How many pointers are contained as data members in the nodes of a circular,double linked list of integers with five nodes.

• 15

• 8

• 10

• 5

Which type of linked list stores the address of the header node in the next field of the last node?

• double linked list

• single linked list

• circular linked list

• None of the above

Which of the following is the correct declaration of linked list?

• struct node*

  {

  int data

  node *link

  }

• struct node

  {

  int data

  struct node *link

  }

• struct node

  {

  int data

  node link

  }

• struct node*

  {

  int data

  struct node *link

  }

In a double linked list

• 4

• 0

• 1

• Depends up on the nodes of the linked list

In a circular linked list insertion of a record involves the modification of -------------

• 1 pointer

• 2 pointer

• 3 pointers

• None

What is the time complexity of inserting at the end in dynamic arrays?

• O(1)

• O(n)

• Either O(1) or O(n)

• O(logn)

What is the time complexity to count the number of elements in the linked list?

• O(1)

• O(n)

• O(n2)

• O(logn)

Which of the following is false about a doubly linked list?

• We can navigate in both the directions

• It requires more space than a singly linked list

• The insertion and deletion of a node take a bit longer

• Implementing a doubly linked list is easier than singly linked list

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?

• Delete the first element

• Insert a new element as a first element

• Delete the last element of the list

• Add a new element at the end of the list

Linked lists are not suitable for the implementation of

• Insertion sort

• Polynomial manipulation

• Binary search

• Radix sort