test_ data structure and algorithm - flashcards _ quizlet par 3

4/29/2014 Test: Data Structure and Algorithm - flashcards | Quizlet

http://quizlet.com/40567764/test?mult_choice=on&prompt-with=1&limit=20 1/4

20 Multiple Choice Questions

1. Arrange items in a predetermined order.a. Node

b. CORRECT: Sort

c. LIFO

d. Heap

2. Notation in which the operator separates its operands.a. CORRECT: Infix Notation

b. merge sort

c. Postfix Notation

d. INCORRECT: Prefix Notation

3. Process all nodes of a tree by recursively processing the left subtree, then processing the rightsubtree, and finally the root.a. Postfix Notation

b. Level‑order Traversal

c. CORRECT: Postorder Traversal

d. In‑order Traversal

4. Repeatedly taking the next item and inserting it into the final data structure in its properorder with respect to items already inserted.a. Quicksort

b. merge sort

c. CORRECT: Insertion Sort

d. Selection Sort

5. First in first out is a policy that items are processed in order of arrival.a. LIFO

b. Sort

c. Heap

d. CORRECT: FIFO

85%B

Data Structure and Algorithm - fl…NAME: ________________________

http://quizlet.com/latest

http://quizlet.com/40567764/data-structure-and-algorithm-flashcards-flash-cards/



6. A list of data values, all of the same typea. FIFO

b. CORRECT: Array

c. Heap

d. Sort

7. Sequentially examining each element in a list until the target element is found or the last hasbeen completely processed.a. Binary Tree

b. merge sort

c. Linked List

d. CORRECT: Linear Search

8. Polish Notation Notation in which the operator comes before its operands.a. CORRECT: Prefix Notation

b. Postfix Notation

c. Recursion

d. Infix Notation

9. A data structure in which a list of nodes or elements of a data structure connected bypointers.a. merge sort

b. Node

c. Binary Tree

d. CORRECT: Linked List

10. A dictionary in which keys are mapped to array positions by a hash function.a. CORRECT: Hash Table

b. Binary Tree

c. Symbol table

d. Stack



11. A collection of information which must be kept at a single memory location.a. Queue

b. CORRECT: Node

c. Sort

d. Heap

12. Process all nodes of a tree by recursively processing the left subtree, then processing the root,and finally the right subtree.a. INCORRECT: Postorder Traversal

b. Level‑order Traversal

c. CORRECT: In‑order Traversal

d. Binary Tree

13. Process all nodes of a tree by depth: first the root, then the children of the root, etc.a. Postorder Traversal

b. Linear Search

c. CORRECT: Level‑order Traversal

d. In‑order Traversal

14. An algorithmic technique where a function, in order to accomplish a task, calls itself withsome part of the task.a. CORRECT: Recursion

b. LIFO

c. Array

d. Queue

15. A complete tree where every node has a key more extreme (greater or less) than or equal tothe key of its parent. Ua. Queue

b. FIFO

c. Node

d. CORRECT: Heap



16. The non‑terminal symbol that stands for a complete valid utterance in the language beingparsed.a. Array

b. Hash Table

c. CORRECT: Start symbol

d. Stack

17. A data structure with first‑in first‑out behavior, supporting the operations enqueue (to insert)and dequeue (to remove)a. INCORRECT: Stack

b. Heap

c. CORRECT: Queue

d. Node

18. A sort algorithm that splits the items to be sorted into two groups, recursively sorts eachgroup, and merges them into a final, sorted sequence.a. CORRECT: merge sort

b. Insertion Sort

c. Quicksort

d. Sort

19. A specific type of tree data structure in which each node has at most two branches, one leftand one right.a. Linked List

b. Hash Table

c. Array

d. CORRECT: Binary Tree

20. A sort algorithm that repeatedly looks through remaining items to find the least one andmoving it to its final location.a. CORRECT: Selection Sort

b. Quicksort

c. merge sort

d. Insertion Sort

test_ data structure and algorithm - flashcards _ quizlet par 3

Documents