Welcome to CSE 123: Introduction to Computer Programming III 🎉
What is this class? What will I learn?
Computing continues to play an ever-increasing role in today’s society. Having an understanding of computing is an essential skill for those in the 21st century; from working in industries more reliant on technology, using computational methods to further scientific understanding, or being an informed citizen in a world with technology all around us.
This course is a third course in computer programming focused on the design and implementation of data structures. It assumes students already have significant experience with programming and understand fundamental computing concepts (such as control structures (loops and conditionals), variables and data, and arrays) as well as basic data structure (lists, sets, stacks, queues, and maps/dictionaries) and the fundamentals of object-oriented programming.
In this course, students will learn:
- How to implement compound data structures such as lists and trees.
- The use of recursion to efficiently solve computational problems.
- How to utilize inheritance to represent relationships among similar classes.
Prior Experience and Expectations
Prerequisite Material
This course is intended for students who already have some programming experience. Students entering CSE 123 should already be familiar with programming constructs for problem decomposition (methods or functions), control structures (loops and conditionals), variables and data types (such as integer data), data structures such as arrays, lists, sets, and maps/dictionaries, and the basics of object-oriented programming.
To better assess if CSE 123 is the right class for you, the Allen School has developed a Self-Guided Placement to help students assess which intro course is the right one for them to enroll in. Please see this website for more information on who to contact if you have questions about which introductory CSE course is the right course for you.
Programming Language
CSE 123 is taught in the Java programming language. Unlike CSE 122, CSE 123 does assume prior experience with the Java programming langauge. If you have not programmed in Java before, or if you would like to get some extra practice or review, please see our Java Tutorial.
Syllabus
If you want to learn more about the course and its policies, please check out our course syllabus.
Feedback
Feedback is always welcome! You can contact the the course staff or submit anonymous feedback.
Registration
Please do not email the course staff or instructors regarding registration for the course. The course staff do not have access to add codes. Please email ugrad-adviser@cs.washington.edu for assistance.
This Week (at a glance)¶
Monday (06/29)
- IPL opens!
Tuesday (06/30)
- 🧑🏫 Section 1: Implementing Data Structures
Wednesday (07/01)
- 👥 Lesson 2: References; Linked nodes Meet in AND 205 @ 12:00
- 📚 Pre-Class Material 2 (Complete before class.)
- 💻 P0 - Search Engine due @ 11:59PM PT.
Thursday (07/02)
- 🧑🏫 Section 2: References; Linked nodes
- 🎨 C0 - Abstract Strategy Games released. Due Wednesday (07/08) @ 11:59PM PT.
Friday (07/03)
- University holiday - campus is closed (office hours cancelled)
Calendar¶
Info
This is a rough sketch of the quarter and things are subject to change. We can accurately predict the past, but predicting the future is hard!
Pre-Class
Anything listed in the “pre-class” materials (PCMs) for a day should be read before attending class that day. The PCMs are a first introduction to the most important terms and concepts for that day of class. It is okay if the PCMs don’t make complete sense as we have the rest of the class day to clarify the concepts, but if you don’t do the PCMs, the class session won’t make any sense.
| Topic | Programming / Creative Projects | Resubmissions | ||
|---|---|---|---|---|
| Week 0 | ||||
| Mon 06/22 | ||||
| Tue 06/23 | ||||
| Wed 06/24 | LES 00 Welcome; Syllabus Note: Note: Normally you would complete the Pre-class Work before class. There is nothing you need to complete before class today! | |||
| Thu 06/25 | SEC 00 Welcome & Software Setup resources: materials | |||
| Released P0 I.S. by 11:59PM PT Search Engine | ||||
| Fri 06/26 | LES 01 Implementing Data Structures; ArrayIntList; Pre-/Post-Conditions | |||
| Week 1 | ||||
| Mon 06/29 | ||||
| Tue 06/30 | SEC 01 Implementing Data Structures resources: materials | |||
| Wed 07/01 | LES 02 References; Linked nodes | |||
| Thu 07/02 | SEC 02 References; Linked nodes resources: materials | |||
| Released C0 I.S. by 11:59PM PT Abstract Strategy Games | ||||
| Fri 07/03 | HOLIDAY Independence Day (Observed) | |||
| Week 2 | ||||
| Mon 07/06 | ||||
| Tue 07/07 | QUIZ 00 Quiz 0 Note: Information for Quiz 0
| |||
| Wed 07/08 | LES 03 Linked Nodes w/ Loops | |||
| Released R0 Resub 0 | ||||
| Thu 07/09 | SEC 04 Linked Nodes w/ Loops | |||
| Released P1 Mini-Git | ||||
| Fri 07/10 | LES 04 Modifying Links; Linked Int List Note: No PCM for today! Instead, please review the material on Linked Nodes from Lesson and Section 2 | |||
| Week 3 | ||||
| Mon 07/13 | ||||
| Released R1 Resub 1 | ||||
| Tue 07/14 | SEC 05 Linked Lists | |||
| Wed 07/15 | LES 05 Runtime Analysis | |||
| Thu 07/16 | SEC 06 Runtime Analysis | |||
| Fri 07/17 | LES 06 Recursive Tracing | |||
| Week 4 | ||||
| Mon 07/20 | ||||
| Released R2 Resub 2 | ||||
| Tue 07/21 | QUIZ 01 Quiz 1 Note: Information for Quiz 1
| |||
| Wed 07/22 | LES 07 Recursive Programming | |||
| Thu 07/23 | SEC 08 Recursive Tracing / Programming | |||
| Released C1 Mondrian Art OR Grammar Solver | ||||
| Fri 07/24 | LES 08 Binary Trees: Traversal | |||
| Week 5 | ||||
| Mon 07/27 | ||||
| Released R3 Resub 3 | ||||
| Tue 07/28 | SEC 09 Binary Trees | |||
| Wed 07/29 | LES 09 Binary Trees: Modification | |||
| Thu 07/30 | SEC 10 Binary Trees: Modification | |||
| Released C2 BrettFeed | ||||
| Fri 07/31 | LES 10 Comparable Interface / Binary Search Trees | |||
| Week 6 | ||||
| Mon 08/03 | ||||
| Released R4 Resub 4 | ||||
| Tue 08/04 | QUIZ 02 Quiz 2 Note: Information for Quiz 2
| |||
| Wed 08/05 | LES 11 Inheritance | |||
| Thu 08/06 | SEC 12 Comparable Interface / Binary Search Trees | |||
| Released P2 Cornbear's Classifier | ||||
| Fri 08/07 | LES 12 Abstract Classes / Polymorphism | |||
| Week 7 | ||||
| Mon 08/10 | ||||
| Released R5 Resub 5 | ||||
| Tue 08/11 | SEC 13 Inheritance | |||
| Wed 08/12 | LES 13 IntList Case Study | |||
| Thu 08/13 | SEC 14 Abstract Classes / Polymorphism | |||
| Released C3 ??? | ||||
| Fri 08/14 | LES 14 Exhaustive Search / Recursive Backtracking | |||
| Week 8 | ||||
| Mon 08/17 | ||||
| Released R6 Resub 6 | ||||
| Tue 08/18 | SEC 15 Final Exam Review | |||
| Wed 08/19 | LES 15 Victory Lap and Next Steps | |||
| Thu 08/20 | EXAM Final Exam Pt. 1 | |||
| Fri 08/21 | EXAM Final Exam Pt. 2 | |||