Adam Blank 
()

Announcements

Information

Welcome to CSE 143! You might want to start by looking at the course policies in the .
Our required this quarter will be Building Java Programs.
You can check your as they come out.
As the get closer we will post more information about them.

Getting Help

It is very important to us that you succeed in CSE 143. We provide many extra resources to help you. The TAs hold many hours in the IPL (Introductory Programming Lab), Adam holds office hours (see staff page), we have a message board called Piazza, and there are many practice problems on our Practice-It website.

Schedule

  • ArrayLists
  • Stacks & Queues
  • Linked Lists
  • Recursion
  • Sets & Maps
  • Comparable
  • Recursive Backtracking
  • Binary Trees
  • Polymorphism
#
Day
Topic
Homework
Syllabus & ArrayList
Ch 1-8; 10.1
ArrayList 1
Being a Client of ArrayList
Section Warm-Up
Implementing ArrayIntList
Ch 15.1
ArrayList 2 Middle of the List
Being the Implementor of ArrayIntList

CSE 142 Review Session

    Problems
Section Warm-Up
More ArrayIntList; Pre/Post Conditions; Exceptions
Ch 4.5; 15.1 - 15.2
Pre/Post
Reference Semantics
Practicing Reference Semantics
Section Warm-Up
Stacks and Queues
Ch 14.1 - 14.4
Being a Client of Stacks and Queues
Section Warm-Up
Efficiency
Ch 13.1 - 13.2
Complexity
List Nodes
Ch 16.1
ListNodes
ListNodes: Before and After
Section Warm-Up
Implementing LinkedIntList
Ch 16.2
LinkedList Traversal
Being the Implementor of LinkedIntList
Section Warm-Up
Implementing More of LinkedIntList
Ch 16.2 - 16.3
Complex LinkedLists
The Power of Recursion
Ch 12.1
Recursive Tracing
Recursive Tracing
Section Warm-Up
Recursive Programming
Ch 12.2 - 12.3
Recursion 1 Recursion 2
Practicing Recursive Programming
Section Warm-Up
Sets and Maps
Ch 11.2 - 11.3
Sets Maps
More Sets and Maps
Ch 11.2 - 11.3
Sets Maps
Being a Client of Sets and Maps
Section Warm-Up
Comparable
Ch 10.2 - 10.3
Comparable
Practicing Comparable
Section Warm-Up
Iterators & Iterable
Ch 15.3
Midterm Review
Midterm Review
Section:
Practice Midterm Solutions
Section Warm-Up
Midterm Exam

Information & Practice Exams

  • 2:30
    3:20 pm in Kane 130
TA's Choice!
Better Searching & Sorting
Ch 13.1 - 13.4
Binary Search Sorting
Recursive Backtracking
Ch 12.5
Recursive Backtracking
Section Warm-Up
Recursive Backtracking
Ch 12.5
Recursive Backtracking
Section Warm-Up
Recursive Backtracking
Ch 12.5
Implementing Binary Trees
Ch 17.1 - 17.2
Tree Traversal 1 Tree Traversal 2
Binary Trees
Section Warm-Up
Binary Search Trees
Ch 17.3 - 17.4
x = change(x)
More Binary Search Trees
Section Warm-Up
More Binary Search Trees
Ch 17.3 - 17.4
x = change(x)
Memorial Day: No Class!
LinkedList Review
Inheritance and Polymorphism
Ch 9.1 - 9.2
Polymorphism
Practicing Polymorphism
Section Warm-Up
Priority Queues & Huffman Trees
For Fun: Extra (NO POINTS)
Hashing
Final Review
Final Review
Final Review
Victory Lap
Final Exam

Information & Practice Exams

  • 2:30
    4:20 pm in Kane 130
    You must sit in your assigned seat. The seat assignments are:
    • Kane 130 main floor (sections A1-A2, AA-AH, AO-AZ): list, map
    • Kane 130 balcony (sections AI-AN): list, map