Duplicate of Data Structures

Which of the following algorithm design technique is used in the quick sort algorithm?

• Dynamic programming
• Backtracking
• Divide and conquer
• Greedy method

Which of the following is useful in traversing a given graph by breadth first search?

• Stack
• Set
• List
• Queue

An empty list is the one which has no

• Nodes
• Data
• Both a and b
• Address

Which of the following data structure can't store the non-homogeneous data elements?

• Arrays
• Records
• Pointers
• Stacks

What is the minimum number of nodes that a binary tree can have?

• Zero
• One
• Two
• None

The goal of hashing is to produce a search that takes

• O(1) time
• O(n2 ) time
• O(log n ) time
• O(n log n ) time

The time factor when determining the efficiency of algorithm is measured by

• Counting microseconds
• Counting the number of key operations
• Counting the number of statements
• Counting the kilobytes of algorithm

What is the result of the following operationTop (Push (S, X))

• X
• S
• null
• None Of These

Postfix of this infix expression : (((3+6)*(2-4))+7)

• 36+24-*7+
• 362+-47*+
• 36247+-*+
• 36+247-*

Best Data structure for storing an address book

• Tries
• B+ Tree
• Queues
• Linked List