Question: A parentheses checker program would be best implemented using?

• 1. Stack
• 2. Queue
• 3. List
• 4. Any of the above

Question: The elements of a linked list are stored?

• 1. In an array
• 2. In a structure
• 3. Anywhere the computer has space for them
• 4. In contiguous memory locations

Question: A graph is a tree if and only if graph is?

• 1. Planar
• 2. Contains no cycles
• 3. Directed graph
• 4. Completely connected

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