Quiz on Data Structures

Which of the following is not a type of linked list

• Circular

• doubly

• Singly

• priority

Which of the following statement is true for traversing a linked list

• while(Start!=NULL)

• while(ptr!=NULL)

• While(Ptr-->data !=NULL)

• while(ptr==NULL)

Which statement is true for inserting node in the beginning

• new_node = start

• start = new_node

• start==ptr

• start == new_node

IF Node has to be inserted at the end of the list then which of the following code is correct?

• 
• 
• 

The overflow condition in Circular Queue is

• if front == 0 && rear == -1

• if front == max-1 && rear == max -1

• if front == 0 && rear == max-1

• if front == -1 && rear == max

In double ended queue, input restricted queue means

• insertion cant be done on the queue

• insertion can be done but deletion can not be done on the queue

• insertion is done from both the ends but deletion from only one end

• deletion can be done form both ends but insertion from only one end

Which of the following is not among a linear data structure

• stack

• array

• queue

• tree

which of the following is not a dynamic data structure

• array

• linked list

what is the condition to preform enqueue operation in queue

• if(front == -1) then enqueue ( )

• if rear == 0 then enqueue( )

• if rear !== MAX-1 the enqueue( )

• if front != -1 and rear !== MAX the enqueue( )