# Data Structures: MCQ Set – 02

• (B) Stack
• (C) Queue
• (D) Array

• (A) 0
• (B) -1
• (C) 1
• (D) None of Above

#### Q13: An ADT is defined to be a mathematical model of a user-defined type along with the collection of all____________ operations on that model.

• (A) Cardinality
• (B) Assignment
• (C) Primitive
• (D) Structured

• (A) 256
• (B) 255
• (C) 248
• (D) 260

#### Q15: Find the odd one out

• (A) Bin-Packing Problem
• (B) TVSP Problem
• (C) Knap Sack Problem
• (D) OBST Problem
• (E) Sum of Subset

#### Q16: Which of the following are essential statement types for describing algorithms?

• (A) Sequence
• (B) Selection
• (C) Repetition
• (D) All the above
• (E) A and B Only

#### Q17: An algorithm is complete if

• (A) It terminates with a solution when one exists
• (B) It starts with a solution
• (C) It does not terminate with a solution
• (D) It has a loop
• (E) It has a decision parameter.

#### Q18: When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in (queue containing n elements)

• (A) q(n) and q(1) respectively
• (B) q(n) and q(n) respectively
• (C) q(1) and q(1) respectively
• (D) None of the above

#### Q19: A linear collection of data elements where the linear node is given by means of pointer is called

• (B) Node list
• (C) Primitive list
• (D) None of these

• (A) -6
• (B) 6
• (C) 4
• (D) None