Introduction to Comp139 Lecture 6
Let's dive into the details surrounding Comp139 Lecture 6. Writing a chained (linked) list class.
Comp139 Lecture 6 Comprehensive Overview
More work with chained/linked lists. The birthday game. Chains of items as a storage mechanism. Converting specific list code to a list to hold any type of thing, then restricting it again with generics to only hold specific things (but ...
Write the linked list implementation of a queue. Make the code pass the standard queue unit tests. Show a queue example.
Summary & Highlights for Comp139 Lecture 6
- Fix a freeing bug in remove. Add toString. Make array expand if we run out of room.
- Comp139 Lecture 16
- pc pro comptia testout lab, hardware technician, testout 15.1 build a computer from scratch, testout pc pro certification exam, ...
- Review the HashMap duplicates code. Talk about containsKey vs containsValue. Talk about using LinkedHashMap to retain order ...
- The third video for Writing for Scholarly Publication by Anne Huff.
That wraps up our extensive overview of Comp139 Lecture 6.