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 is not in the array ...
مزيد من المعلومات »-->
1) The worst case occur in linear search algorithm when ....... A. Item is somewhere in the middle of the array B. Item is not in the array ...
مزيد من المعلومات »1) Finding the location of a given item in a collection of items is called ...... A. Discovering B. Finding C. Searching D. Mining 2) Which ...
مزيد من المعلومات »1) To insert a new node in linked list free node will be available in ........ A. Available list B. Avail list C. Free node list D. Memory s...
مزيد من المعلومات »1) Linked lists are best suited ..... A. for relatively permanent collections of data. B. for the size of the structure and the data in the ...
مزيد من المعلومات »1) The post order traversal of binary tree is DEBFCA. Find out the pre order traversal. A. ABFCDE B. ADBFEC C. ABDECF D. ABDCEF 2) While con...
مزيد من المعلومات »1) The queue in which the insertion takes place in the first position after of last element is a ...... A. priority B. dequeue C. circular D...
مزيد من المعلومات »1) ......... form of access is used to add and remove nodes from a queue. A. LIFO, Last In First Out B. FIFO, First In First Out C. Both a a...
مزيد من المعلومات »1. .......................... is a variable that can hold the address of the variables, structure and functions that are used in the program...
مزيد من المعلومات »1. Arrays are best data structures A) for relatively permanent collections of data B) for the size of the structure and the data in the stru...
مزيد من المعلومات »Tree-data-structure (Photo credit: Wikipedia ) 1. Which of the following data structure is non-linear type? A) Strings B) Lists C) Stacks D)...
مزيد من المعلومات »