Data Structures and Algorithms Quiz

The worst case complexity of quick sort is ..............

• O(n)

• O(log n)

• O(n² )

• O(n log n)

What is the output of following function for start pointing to first node of following linked list?

1->2->3->4->5->6

void fun(struct node* start)

{ If (start == NULL) return;

printf ("%d ", start->data);

if (start->next != NULL )

fun(start->next->next);

printf ("%d ", start->data); }

• 1 4 6 6 4 1

• 1 3 5 1 3 5

• 1 2 3 5

• 1 3 5 5 3 1

The prefix form of A-B/ (C * D ⋀ E) is?

• -/*⋀ACBDE

• -ABCD*⋀DE

• -A/B*C⋀DE

• -A/BC*⋀DE

Which one of the following is a sequence container?

• stack

• dequeue

• queue

• set

Minimum number of queues needed to implement the priority queue is ...........

• 1

• 2

• 3

• 4

What can be said about the array representation of a circular queue when it contains only one element?

• FRONT = REAR + 1

• FRONT = REAR - 1

• FRONT = REAR = NULL

• None of these

Answer explanation

FRONT=REAR

+ A* - BCD is a prefix expression. If A, B, C, D have value 5,4,2,3 respectively the expression evaluates to

• 13

• 7

• 11

• 15

The data structure that is used to implement recursion is

• Binary Tree

• Stack

• Queue

• All of the above

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

• if(temp->link!=NULL) temp=temp->link

• if(temp->data ==num) temp=temp->link

• while(temp->link !=NULL) temp=temp->link

• while(temp->link !=data) temp=temp->link

A text editor generally allows searching in both directions, with wrap around if necessary. If the sequence of lines of code is stored as a linked list, which type is most suitable?

• Singly linked list

• Doubly linked list

• Singly linked circular list

• Doubly linked circular list