Solved MCQ on Searching and Sorting Algorithms in Data Structure set-2
1) The worst case occur in linear search algorithm when ....... A. Item is somewhere in the middle of the array B. Item…
1) The worst case occur in linear search algorithm when ....... A. Item is somewhere in the middle of the array B. Item…
1) Finding the location of a given item in a collection of items is called ...... A. Discovering B. Finding C. Searchin…
1) To insert a new node in linked list free node will be available in ........ A. Available list B. Avail list C. Free …
1) Linked lists are best suited ..... A. for relatively permanent collections of data. B. for the size of the structure…
1) The post order traversal of binary tree is DEBFCA. Find out the pre order traversal. A. ABFCDE B. ADBFEC C. ABDECF D…
1) The operation of processing each element in the list is known as ...... A. sorting B. merging C. inserting D. traver…
1) The queue in which the insertion takes place in the first position after of last element is a ...... A. priority B. …
1) ......... form of access is used to add and remove nodes from a queue. A. LIFO, Last In First Out B. FIFO, First In …
1. .......................... is a variable that can hold the address of the variables, structure and functions that ar…