Linked List homework questions : (print and answer using text and classnotes)
(suggest opening 2 files at once from cd)
(on a PC this can be done with CodeWarriior)
1. What is the difference between a linkList and linkList2 classes?
2. In sortedList what type search is used in the find() method?
(binary, linear, other?)
3. What is the diffeerence between linkList2 and sortedList besides the fact that the data is in order?
4. Is sortedList creating an ascending or descending list?
5. In sortedList what happens when inserting if the key value equals one of the values already in the list?
6. Is there any difference between the linkList2 delete() method and the sortedList remove() method?
7. What ADT is sortedList a good choice for implementation?
8. Is there any difference between displayList() method in linkList2 and sortedList? What is the order of complexity?
9. What does the reset() method of interIterator class do?
10. Draw a model showing the insertAfter() method in interIterator.java passing 25.5 into dd.. (current.dData contains 47.8 and current.next.dData contains 52.6)
11. Daraw a model showing the deleteCurrent() method if current.dData contains 7.3 and previous.dData contains 14.9.
12. Describe the steps taken by the ListInsertionSortApp.