Question 45 Which one of the following operations on an empty stack is considered as an error operation called stack underflow?

• a. Peek()
• b. isEmpty()
• c. Pop()
• d. Push()

Tag: 2 Data Structure and Algorithms

Question 35 Which one of the following is true about Complete Binary Trees with height h?

• a. All leaf nodes must be at the same level.
• b. Every node must have a minimum of 2 children.
• c. It is not full at the level h-1.
• d. At the level h it must be filled from left to right.

Tag: 2 Data Structure and Algorithms

Question 71 Which of the following is not true about arrays and linked lists?

• a. Inserting or deleting an item in an array is computationally less expensive than in a linked list
• b. In a linked list, we can insert and delete items without shifting data
• c. Data in an array is physically stored in consecutive memory locations
• d. Random access of items in an array is computationally less expensive than in a linked list
• Tag: Data Structure and Algorithms