test 3

Linked list is generally considered as an example of _________ type of memory allocation.

What would be the asymptotic time complexity to insert an element at the second position in the linked list?

Underflow condition in linked list may occur when attempting to ________

A doubly linked list performs traversal in _________.

In a circular linked list _______________

In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

Consider the following definition in c programming language

struct node
{
int data;
struct node * next;
}
typedef struct node NODE;
NODE *ptr;

Which of the following c code is used to create new node?

What would be the asymptotic time complexity to find an element in the linked list?

Consider an implementation of unsorted circular 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 end node of the linked list

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time?
) 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

In which data stricture direct or random access is not possible?

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

What kind of linked list is best to answer question like “What is the item at position n?”

A variant of the linked list in which none of the node contains NULL pointer is?

A linear collection of data elements where the linear node is given by means of pointer is called?