Question: Search tables used by compilers for efficient searching generally use?

• 1. Linear lists of records
• 2. Hash tables
• 3. Binary search tables
• 4. Binary search trees

Question: Queue can be used to implement?

• 1. Radix Sort
• 2. Quick Sort
• 3. Depth First Search
• 4. Recursion

Question: Which among following data structure is linear data structure?

• 1. Trees
• 2. Graphs
• 3. Arrays
• 4. All of the above

Question: Two main measures of the efficiency of an algorithm are?

• 1. Complexity and Capacity
• 2. Processor and Memory
• 3. Time and Space
• 4. Date and Space

Question: Term push and pop is related to?

• 1. Lists
• 2. Array
• 3. Stacks
• 4. All of the above

Question: Best average behaviour is shown by?

• 1. Merge sort
• 2. Quick sort
• 3. Heap sort
• 4. Insertion sort

Question: A Queue is a?

• 1. Ordered Array
• 2. FIFO
• 3. LIFO
• 4. Linear Tree

Question: Representation of data structure in memory is known as?

• 1. Abstract data type
• 2. Storage structure
• 3. File structure
• 4. Recursive

Question: An adjacency matrix representation of a graph can not contain information of?

• 1. Edges
• 2. Direction of edges
• 3. Parallel edges
• 4. Nodes

Question: Stack is also called?

• 1. First in last out
• 2. First in first out
• 3. Last in last out
• 4. Last in first out