Data Structures Quiz

What will be the output of the following code? struct node { int data; struct node *x; struct node *y; };

• Implementation of SLL

• Implementation of DLL

• Implementation of CLL

• None of the above

What will be the output of the following code? void function() { if(head==NULL) printf("\n List is Empty: "); else { struct node *temp=head; head=head->next; free(temp) // temp->next=NULL; } }

• DLL Delete At End

• SLL Delete At End

• SLL Insert At Beginning

• SLL Delete At Beginning

Linked list and Array are considered as an example of ___________ type of memory allocation.

• Static and Dynamic

• Dynamic and Static

• Heap and Dynamic

• None

What will be the output of the following code? void function() { int value; struct node *nn=(struct node*)malloc(sizeof(struct node)); nn->data=value; nn->next=NULL; if(head==NULL) head=nn; else { nn->next=head; head=nn; } }

• DLL Delete At End

• SLL Delete At End

• SLL Insert At Beginning

• SLL Insert At End

What will be the output of the following code? void function() { struct node *temp=head; while(temp!=NULL) { printf("%d ",temp->data); temp=temp->next; } }

• Displaying elements

• Printing nodes

• Traversal data

• All

Consider the following definition in c programming language. struct node { int data; struct node *next; } typedef struct node NODE; NODE *nn; Which of the following c code is used to create new node?

• nn = (NODE*)malloc(sizeof(NODE));

• nn = (NODE*)malloc(NODE);

• nn = (NODE*)malloc(sizeof(NODE*));

• nn = (NODE)malloc(sizeof(NODE));

What is the value of the postfix expression 6 3 4 * + 2 - ?

• 74

• -18

• 16

• 40

Match the following questions a) If (rear==front) b) If (rear==MAX-1) c) OVERFLOW d) UNDERFLOW

• If unable insert an element into queue when it is full

• If unable delete an element from queue when it is empty

• Queue is full

• Queue is empty

Match the following questions a) If (top==-1) b) If (top==MAX-1) c) Stack d) Queue

• FIFO (FCFS)

• LIFO (FILO)

• Stack is full

• Stack is empty

Match the following questions a) If (head==NULL) b) free(temp) c) SLL d) DLL

• Delete of temp

• List is empty

• Fordward & Backward direction

• Fordward direction