Data Structure and Algorithms (DSA) solved MCQs

14 of 14

326. All the above* Which of the following data structures are indexed structures

a. linear arrays

B. linked lists

c. both of above

d. none of above

327. Which of the following is not the required condition for binary search algorithm

a. there must be mechanism to delete and/ or insert elements in list

B. the list must be sorted

c. there should be the direct access to the middle element in any sublist

d. none of the above

328. Which of the following is not a limitation ofbinary search algorithm ?

a. binary search algorithm is not efficient when the data elements are more than 1000.

B. must use a sorted array

c. requirement of sorted array is expen- sive when a lot of insertion and dele- tions are needed

d. there must be a mechanism to access middle element directly

329. Two dimensional arrays are also called

a. tables arrays

B. matrix arrays

c. both of the above

d. none of the above

330. The term “push” and “pop” is related to the

a. Array

B. Lists

c. stacks

d. all of above

331. A data structure where elements can be added or removed at either end but not in the middle is referred as

a. Linked lists

B. Stacks

c. Queues

d. Deque

332. The following sorting algorithm is of divide- and-conquer type

a. Bubble sort

B. Insertion sort

c. Quick sort

d. None of the above

333. An algorithm that calls itself directly or indi- rectly is known as

a. Recursion

B. Polish notation

c. Traversal algorithm

d. None of the above

334. The elements of an array are stored suc- cessively in memory cells because

a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

B. the architecture of computer memory does not allow arrays to store other than serially

c. A and B both false

d. A and B both true

335. The memory address of the first element of an array is called

a. base address

B. floor address

c. foundation address

d. first address

336. The memory address of fifth element of anarray can be calculated by the formula

a. LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array

B. LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array

c. LOC(Array[5]=Base(Array)+w(5-lower bou

d. , where w is the number of words per memory cell for the array

337. The following data structure can’t store the non-homogeneous data elements

a. Arrays

B. Records

c. Pointers

d. None of the above

338. The in order traversal of tree will yield a sorted listing of elements of tree in

a. Binary trees

B. Binary search trees

c. Heaps

d. None of above

339. In a Heap tree values in a node is greater than

a. every value in left sub tree and smaller than right sub tree

B. every value in children of it

c. Both of above conditions are true

d. None of above conditions are true

340. In a graph if e=[u, v], Then u and v are called

a. endpoints of e

B. adjacent nodes

c. neighbors

d. all of the above

341. A connected graph T without any cycles is called

a. tree graph

B. free tree

c. tree

d. All of the above

342. The difference between linear array and a record is

a. An array is suitable for homogeneous data but hte data items in a record may have different data type

B. In a record, there may not be a natural ordering in opposed to linear array.

c. A record form a hierarchical structure but a linear array does not

d. All of above

343. The following data structure store the ho- mogeneous data elements

a. Arrays

B. Records

c. Pointers

d. None of the above

344. Which of the following data structure is not linear data structure?

a. Arrays

B. Linked lists

c. A and B are true

d. None is true

Tags

Question and answers in Data Structure and Algorithms (DSA),

Data Structure and Algorithms (DSA) Multiple choice questions and answers,

Important MCQ of Data Structure and Algorithms (DSA),

Solved MCQs for Data Structure and Algorithms (DSA),

Data Structure and Algorithms (DSA) MCQ with answers PDF download