Data Structures using C

Which of the following points is/are true about Linked List data structure when it is compared with array

• Arrays have better cache locality that can make them better in terms of performance.

• It is easy to insert and delete elements in Linked List

• The size of array has to be pre-decided, linked lists can change their size any time.

• Random access is not allowed in a typical implementation of Linked Lists

• All the Above

You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?

• Delete the First element

• Inser a new element as the first element

• Delete the last element

• Add a new element at the end of the list

Which one of the following is an application of Stack Data Structure?

• Managing function calls

• The stock span problem

• Arithmetic expression evaluation

• All the above

Which one of the following is an application of Queue Data Structure?

• When a resource is shared among multiple consumers.

• When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes

• Process Scheduling

• All the above

Which of the following is true about linked list implementation of stack?

• In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

• In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

• Both of the above

• None of the above

Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree?

• 7 5 1 0 3 2 4 6 8 9

• 0 2 4 3 1 6 5 9 8 7

• 0 1 2 3 4 5 6 7 8 9

• 9 8 6 4 2 3 0 1 5 7

Which of the following is not the type of queue?

• Priority Queue

• Single ended Queue

• Ordinary Queue

• Circular Queue

When a pop() operation is called on an empty queue, what is the condition called?

• Overflow

• Underflow

• Syntax Error

• Garbage Value

Which of the following can be done with LinkedList?

• Implementation of Stacks and Queues

• Implementation of Binary Trees

• Implementation of Abstract Data Structures with dynamic memory allocation

• All of the above

What is the information, which a LinkedList’s Node must store?

• The address of the next node if it exists

• The value of the current node

• Both (A) and (B)

• None of the above