Dale - Computer Science Illuminated 341

# Dale - Computer Science Illuminated 341 - operation is...

This preview shows page 1. Sign up to view the full content.

314 Chapter 9 Abstract Data Types and Algorithms 2. Name and describe the three views of data. 3. Array-based implementation and linked implementation : a. Define these terms. b. What do they have in common? c. What distinguishes one from the other? 4. Draw the unsorted list containing the following strings: blue , black , green , yellow , red , purple , white , and violet . a. In an unsorted array-based list b. In a sorted array-based list c. In an unsorted linked list d. In a sorted linked list 5. Give the meaning of the following expressions in an array-based implementation: a. Put item b. Remove the item c. Get next item d. More items? 6. Give the meaning of the following expressions in a linked implementation: a. Put item b. Remove the item c. Get next item d. More items? 7. What does it mean to say that the Delete
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: operation is ambiguous? 8. What three properties characterize lists? Explain what each means. 9. How were we able to make the list generic? 10. The obvious place to place a new item in an unsorted list is different in an array-based and a linked implementation. Explain. Questions 11 through 13 use the following list of values. 11. Show the state of the list when current is first set to the 4th item in the list in the selection sort. 12. Show the state of the list when current is first set to the 5th item in the list in the bubble sort algorithm. 13. Show the state of the list when the first recursive call is made. 8 length [0] list [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] 23 41 66 20 2 90 9 34 19 40 99...
View Full Document

## This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online