Linked List Question Set 1

What is the operation of the below statements?

• Insert a new node to the front of a linked list

• Create a new node for a linked list

• Insert a new node to the end of the linked list

• Calculate the size of a linked list

What advantage does a linked list have over an array?

• Size of the list doesn't need to be mentioned at the beginning of the program

• You can add or remove elements from the middle of the list.

• The linked list doesn't have a size limit

• All of these are true.

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?

i) Insertion at the front of the linked list

ii) Insertion at the end of the linked list

iii) Deletion of the front node of the linked list

iv) Deletion of the last node of the linked list

• i, ii

• i, iv

• ii, iv

• i, iii

• ii, iii

How to insert a node after a position P in singly linked list?

• Newnode -> data = P ;

  Newnode -> next = p ->next ;

  P -> next = newnode ;

• Newnode -> data = x ;

  Newnode -> next = p ->next ;

  P -> next = L ;

• Newnode -> data = x ;

  Newnode -> next = p ->node ;

  P -> nextnode = next ;

• Newnode -> data = x ;

  Newnode -> next = p ->next ;

  P -> next = newnode ;

A linked list contains a list pointer variable _____that stores the address of the first node of the list.

• Head

• NULL

• NEXT

• LAST

How to insert a new node in the beginning of the linked list

• Previous node -> new node, new node -> next node

• Head -> new node, new node -> previous node

• Previous tail -> new node, new node -> null

• Head ->  previous node, previous node -> new node

Which one of these pictures is the insertion in the middle of linked list

• 
• 
• 
• 

Nodes in a linked list contain two things

• Direction and a pointer

• A Pointer and a reference

• Data and a pointer

• A pointer and a node

The doubly linked list would have at least how many fields in a node?

• 1

• 2

• 3

• 4

Which of this not about linked list ?

• It can be used to implement several other common abstract data types example stack, queue, tree

• Each record of a linked list is often called an 'element' or 'node'

• It use more memory than arrays because of the storage used by their pointers.

• A nonlinear collection of data elements