EEE-A DS Lab Quiz-3

Which of the following is not a disadvantage to the usage of array?

• Fixed size

• There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size

• Insertion based on position

• Accessing elements at specified positions

Which of the following statements are true?

• Random access of elements at a linked list is not possible.

• Arrays have better cache locality than linked list.

• The size of linked list is dynamic and can be changed as needed.

• All of the options

P=first->link->link

P=p->link->link

Printf(“%c”,p->data);

The print statements print the ----------------as output

The address field of linked list:

• Contains address of next node

• May contain null character

• Contain address of next pointer

• Both Contains address of next node & May contain null character

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

• Linked list

• Node list

• Primitive list

• Unordered list

    In a Singly Linked List, what does the last node's next pointer point to? 

• The first node 

• The second last node 

• Null 

• Itself 

_________ is When START=NULL in Linked List:

• Housefull

• Overflow

• Underflow

• Saturated

If we want to find last node of a singly linked list then the correct coding is

• If(temp->link!=NULL)

          temp=temp->next;

•  If(temp->data=Num)

          temp=temp->next;

• while(temp->link!=NULL)

          temp=temp->next;

• if(temp->link!=data)

  temp=temp->next;

• It deletes the linked list

• Alternate nodes will be deleted

• it reverses the linked list and deletes alternate nodes

• none

Indexing the ........ element in the list is not possible in linked lists.

• middle

• first

• last

• any where in between