Abstract Data Types CHAPTER 12. Review Questions

Size: px

Start display at page:

Download "Abstract Data Types CHAPTER 12. Review Questions"

Belinda Taylor
5 years ago
Views:

1 PTR bstract ata Types Review Questions. n abstract data type is a data declaration packaged together with the operations that are meaningful for the data type with the implementation hidden from the user.. In an T, the operations that the user uses to access the data are known and the implementation of the data type and the operations are hidden.. linear list is a list in which each element has a unique successor. 4. In a general list, data can be inserted and deleted anywhere and there are no restrictions on the operations that can be used to process the list. In a restricted list, data can only be added or deleted at the ends of the structure and processing is restricted to operations on the data at the ends of the list. 5. Two common implementations of a general list are an array and a linked list. 6. The advantage of using a linked list for the implementation of a linear list is that data can be inserted or deleted anywhere in the list without having to reallocate the list as would have to be done with an array. 7. push operation adds an element to the top of the stack while a pop operation removes an element from the top of the stack. push can put the stack in an overflow condition while a pop can put the stack in an underflow condition. 8. Reversing data, parsing data, postponing data usage, and backtracking steps. 9. The enqueue operation adds an element to the rear of a queue. The dequeue operation removes the element at the front of the queue. The enqueue operation could put the queue in an overflow state while the dequeue could put the queue in an underflow state.. binary tree is balanced when the height of its subtrees differs by no more than one and its subtrees are also balanced.. depth first traversal processes all of the nodes in one subtree before processing all of the nodes in the other subtree. In a breadth first traversal, all the nodes at one level are processed before moving on to the next level.

2 4 PTR STRT T TYPS. path is a sequence of vertices in which each vertex is adjacent to the next one. cycle is a path consisting of at least three vertices that starts and ends with the same vertex. ll cycles are paths but not all paths are cycles.. In a depth-first traversal, all of a vertex's descendents are processed before moving to an adjacent vertex. In a breadth-first traversal, all adjacent vertices of a vertex are processed before going to the next level. 4. The major limitation of using an array to implement a graph is that if any nodes are added or deleted, the array must be reallocated and all of the old data must be moved to the new array. 5. network is a graph with weighted lines. Multiple-hoice Questions 6. b 7. d 8. d 9. c. b. a. b. a 4. a 5. b 6. c 7. d 8. d 9. a. a. c. c. c 4. c 5. d 6. b 7. d 8. b 9. c 4. c 4. b 4. c 4. a

3 STION c 45. d 46. c 47. a 48. d 49. b 5. c 5. b 5. c 5. a 54. b xercises 55. top-> 6 5 <-bottom 56. emptystack Input: Stack to empty (s). While s is not empty. pop( s ) 57. movestack Input: Source stack (s) and destination stack (s). While s is not empty. push ( s, pop(s) ) 58. copystack Input: Source stack (s) and destination stack (s). llocate memory for a temporary stack (Temp). While s is not empty. push ( Temp, pop(s) ). While Temp is not empty. TempValue = pop(temp). push ( s, TempValue ). push ( s, TempValue )

4 6 PTR STRT T TYPS 59. catstack Input: Source stack (s) and destination stack (s). While s is not empty. push ( s, pop(s) ) 6. palindrome Input: String to test (s). Remove all white space and punctuation from s. onvert all of s to lower (or upper) case. llocate memory for a stack (Stack) 4. Set Walker to point to first character in s 5. While Walker not past end of s 5. push ( Stack, what Walker is pointing to ) 5. dvance Walker 6. Set Walker to point to first character in s 7. While Walker not past end of s 7. TempValue = pop ( Stack ) 7. if TempValue is not equal to what Walker is pointing to 7.. Return false if 7. dvance Walker 8. Return true 6. comparestack Input: The two stacks to compare (s and s). llocate memory for two temporary stacks (Temp and Temp). copystack ( s, Temp ) (see #58). copystack ( s, Temp ) (see #58) 4. While Temp is not empty N Temp is not empty 4. TempValue = pop ( Temp ) 4. TempValue = pop ( Temp ) 4. If TempValue is not equal to TempValue

5 4.. Return false if 5. If Temp is not empty OR Temp is not empty 5. Return false if 6. Return true 6. s: top-> <-bottom q: front-> 9 9 <-rear 6. emptyqueue Input: Queue to empty (q). While q is not empty. dequeue( q ) 64. movequeue Input: Source queue (q) and destination queue (q). While q is not empty. enqueue ( q, dequeue(q) ) 65. copyqueue Input: Source queue (q) and destination queue (q). llocate memory for a temporary queue (Temp). While q is not empty. enqueue ( Temp, dequeue(q) ). While Temp is not empty. TempValue = dequeue(temp). enqueue ( q, TempValue ). enqueue ( q, TempValue ) 66. catqueue Input: Source queue (q) and destination queue (q). While q is not empty STION 7

6 8 PTR STRT T TYPS. enqueue ( q, dequeue(q) ) 67. comparequeue Input: The two queues to compare (q and q). llocate memory for two temporary queues (Temp and Temp). copyqueue ( q, Temp ) (see #65). copyqueue ( q, Temp ) (see #65) 4. While Temp is not empty N Temp is not empty 4. TempValue = dequeue ( Temp ) 4. TempValue = dequeue ( Temp ) 4. If TempValue is not equal to TempValue 4.. Return false if 5. If Temp is not empty OR Temp is not empty 5. Return false if 6. Return true 68. a. b. I c. 69. See igure. igure. xercise 69 J I 7. See igure. 7. This tree cannot be drawn because it is not a valid binary tree. Node must be the root because it is listed last in the postorder traversal. rom the inorder traversal, we see that nodes,, and must be in the left subtree (because they are listed to

7 STION 9 the left of the root) and that nodes,, and are in the right subtree. Looking back at the postorder list, however, we see that nodes and are listed first, which is not possible. 7. See igure.. 7. ssuming that arcs are stored in sequence by their destination, the traversal is:,,,,,,, 74. ssuming that arcs are stored in sequence by their destination, the traversal is:,,,,,,, 75. See igure See igure See igure.5. igure. xercise 7 igure. xercise Vertex Vector djacency Matrix

8 PTR STRT T TYPS igure.4 xercise igure.5 xercise

12 Abstract Data Types

12 Abstract Data Types 12.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT). Define