# Structures and Algorithms 4

Electronic Engineering MCQ Question Papers: ENTC, IT Interview Placement

Subject:  Structures and Algorithms 4

Part 4: List for questions and answers of Data Structures & Algorithms

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

a) The list must be sorted

b) there should be the direct access to the middle element in any sublist

c) There must be mechanism to delete and/or insert elements in list

d) none of above

Q2. Which of the following is not a limitation of binary search algorithm?

a) Must use a sorted array

b) Requirement of sorted array is expensive when a lot of insertion and deletions are needed

c) There must be a mechanism to access middle element directly

d) Binary search algorithm is not efficient when the data elements are more than 1000

Q3. Two dimensional arrays are also called

a) Tables arrays

b) Matrix arrays

c) Both of above

d) None of above

Q4. A variable P is called pointer if

a) P contains the address of an element in DATA

b) P points to the address of first element in DATA

c) P can store only memory addresses

d) P contain the DATA and the address of DATA

Q5. Which of the following data structure can’t store the non-homogeneous data elements?

a) Arrays

b) Records

c) Pointers

d) None

Q6. Which of the following data structure store the homogeneous data elements?

a) Arrays

b) Records

c) Pointers

d) None

Q7. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called

a) Elementary items

b) Atoms

c) Scalars

d) All of above

Q8. 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 lienear array does not

d) All of above

Q9. Which of the following statement is false?

a) Arrays are dense lists and static data structure

b) Data elements in linked list need not be stored in adjecent space in memory

c) Pointers store the next data element of a list

d) Linked lists are collection of the nodes that contain information part and next pointer

Q10. Binary search algorithm can not be applied to

b) Sorted binary trees

c) Sorted linear array

d) Pointer array

Q11. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called

a) Underflow

b) Overflow

c) Housefull

d) Saturated

Q12. The situation when in a linked list START=NULL is

a) Underflow

b) Overflow

c) Housefull

d) Saturated

Q13. Which of the following is two way list?

d) None of above

Q14. Which of the following name does not relate to stacks?

a) FIFO lists

b) LIFO list

c) Piles

d) Push-down lists

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

a) Array

b) Lists

c) Stacks

d) All of above

Q16. A data structure where elements can be added or removed at either end but not in the middle

b) Stacks

c) Queues

d) Deque

Q17. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

a) FAEKCDBHG

b) FAEKCDHGB

c) EAFKHDCBG

d) FEAKDCHBG

Q18. Two main measures for the efficiency of an algorithm are

a) Processor and memory

b) Complexity and capacity

c) Time and space

d) Data and space

Q19. The time factor when determining the efficiency of algorithm is measured by

a) Counting microseconds

b) Counting the number of key operations

c) Counting the number of statements

d) Counting the kilobytes of algorithm

Q20. The space factor when determining the efficiency of algorithm is measured by

a) Counting the maximum memory needed by the algorithm

b) Counting the minimum memory needed by the algorithm

c) Counting the average memory needed by the algorithm

d) Counting the maximum disk space needed by the algorithm

Part 4: List for questions and answers of Data Structures & Algorithms