Question: Graph in which all vertices have equal degree is called?

• 1. Simple graph
• 2. Multi graph
• 3. Regular graph
• 4. Complete graph

Question: In queues the end from where items inserted is called?

• 1. Rear
• 2. Top
• 3. Front
• 4. None of the above

Question: Representation of two dimensional arrays in memory is?

• 1. Column major
• 2. Row major
• 3. Both column major and row major
• 4. None of the above

Question: Which data structure is used for implementing recursion?

• 1. Array
• 2. Tree
• 3. Queue
• 4. Stack

Question: Address of the first element of the array is called?

• 1. Initial address
• 2. Base address
• 3. First address
• 4. Location address

Question: The data structure required to check whether an expression contains balanced parenthesis is?

• 1. Array
• 2. Tree
• 3. Queue
• 4. Stack

Question: A linked list can be?

• 1. Single
• 2. Double
• 3. Circular
• 4. All of the above

Question: The list with no node is called?

• 1. No list
• 2. Zero list
• 3. Empty list
• 4. All of the above

Question: Items in linked list are called?

• 1. Information
• 2. Element
• 3. Data
• 4. Node

Question: Pushing an element into stack already having four elements and stack size of 4. Then stack becomes?

• 1. Empty stack
• 2. Empty collection
• 3. Underflow
• 4. Overflow