Old version
This is the CS 112 site as it appeared on May 8, 2019.
Labs
- Lab 0: Preliminaries
- complete on your own ASAP! This should be completed before your first scheduled lab session on Thursday, January 24th or Friday, January 25th, 2018.
- Lab 1: Getting comfortbale with Java and Eclipe
- solutions: Task 1 (1.2), Task 2 (3.2), Task 3 (3.3)
- Lab 2: Arrays, primitives and references
- solutions: Task 1, Task 2
- Lab 3: Understanding Static and Object classes
- solutions: Task 1, Task 2 Task 3
- Lab 4: Inheritance and Polymorphism
- solutions: Cat, Abyssinan, Task 1, Task 2, Task 3
- Lab 5: Recursion
- solutions: RecurPalindrome, Task 2
- Lab 6: Bubble Sort and Algorithm Analysis
- solutions: Task 0, Task 1, Task 2, Task 3, quicksort
- Lab 7: Merge sort; a first look at linked lists; StringNode
- solutions: Task 1, Task 2.1-2.3, Task 2.4, Task 3.1, Task 3.2
- solutions to optional tasks: Task 5, Tasks 6 and 8, Task 7
- Lab 8: Lists and stacks
- solutions: task 1, task 2, ListClient.java, task 3, StackClient.java, task 4
- Lab 9: Using lists, stacks and queues
- solutions: task 1, task 2
- Lab 10: Binary trees
- solutions: task 1, task 2.1, task 2.2 (after deleting 6, after deleting 15, after deleting 20), task 3, task 6
- Lab 11: Heaps, Heapsort and Generic Methods
- solutions: task 1, after one remove, after second remove, after third remove, after insert, task 2, task 3, task 4
- Lab 12: Hash Tables
- solutions: task1, task2, task3
