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.
Announcements¶
This Week (at a glance)¶
Monday (01/19)
- Nothing!
Tuesday (01/20)
- 🧑🏫 Section 3: Implementing Data Structures
Wednesday (01/21)
- 📚 Pre-Class Material 4 (Complete before class.)
- 👥 Lesson 4: References; Linked Nodes Meet in ARC 147 (A lecture) or KNE 130 (B lecture)
- 💻 P0 - Ciphers due @ 11:59PM PT.
Thursday (01/22)
- 🧑🏫 Section 4: References; Linked Nodes
- 🎨 C1 - Abstract Strategy Games released. Due Wednesday (01/28) @ 11:59PM PT.
Friday (01/23)
- 📚 Pre-Class Material 5 (Complete before class.)
- 👥 Lesson 5: Linked Nodes w/ Loops Meet in ARC 147 (A lecture) or KNE 130 (B lecture)
- 🔁 Weekly resubmission period closes @ 11:59 pm
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!
Lessons
Anything listed in the “Lesson” materials for a day should be read before attending class that day. The Lessons are a first introduction to the most important terms and concepts for that day of class. It is okay if the Lesson doesn’t make complete sense as we have the rest of the class day to clarify the concepts, but if you don’t do the Lesson the class session won’t make any sense.
| Topic | Programming / Creative Projects | Resubmissions | ||
|---|---|---|---|---|
| Week 0 | ||||
| Mon 01/05 | ||||
| Tue 01/06 | ||||
| Wed 01/07 | 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 01/08 | SEC 00 Welcome & Software Setup resources: materials | |||
| Released C0 I.S. by 11:59PM PT Warm Up | ||||
| Fri 01/09 | LES 01 Comparable; Inheritance | |||
| Week 1 | ||||
| Mon 01/12 | ||||
| Tue 01/13 | SEC 01 Comparable; Inheritance resources: materials | |||
| Wed 01/14 | LES 02 Polymorphism; Abstract Classes | |||
| Thu 01/15 | SEC 02 Polymorphism; Abstract Classes resources: materials | |||
| Released P0 I.S. by 11:59PM PT Ciphers | ||||
| Fri 01/16 | LES 03 Implementing Data Structures; ArrayIntList | |||
| Week 2 | ||||
| Mon 01/19 | ||||
| Tue 01/20 | SEC 03 Implementing Data Structures resources: materials | |||
| Wed 01/21 | LES 04 References; Linked Nodes pre-class: materials | |||
| Released R0 C0 Due 11:59 pm PT Resub 0 | ||||
| Thu 01/22 | SEC 04 References; Linked Nodes | |||
| Released C1 I.S. by 11:59PM PT Abstract Strategy Games | ||||
| Fri 01/23 | LES 05 Linked Nodes w/ Loops | |||
| Week 3 | ||||
| Mon 01/26 | ||||
| Released R1 C0, P0 Due 11:59 pm PT Resub 1 | ||||
| Tue 01/27 | QUIZ 00 Quiz 0 Note: Information for Quiz 0
| |||
| Wed 01/28 | LES 06 Modifying Links; LinkedIntList | |||
| Thu 01/29 | SEC 06 Linked Nodes w/ Loops | |||
| Released P1 I.S. by 11:59PM PT Mini-Git | ||||
| Fri 01/30 | LES 07 Runtime Analysis | |||
| Week 4 | ||||
| Mon 02/02 | ||||
| Released R2 C0, P0, C1 Due 11:59 pm PT Resub 2 | ||||
| Tue 02/03 | SEC 07 Linked Lists | |||
| Wed 02/04 | LES 08 Recursive Tracing | |||
| Thu 02/05 | SEC 08 Recursive Tracing | |||
| Fri 02/06 | LES 09 Recursive Programming | |||
| Week 5 | ||||
| Mon 02/09 | ||||
| Released R3 P0, C1 Due 11:59 pm PT Resub 3 | ||||
| Tue 02/10 | QUIZ 01 Quiz 1 Note: Information for Quiz 1
| |||
| Wed 02/11 | LES 10 Exhaustive Search | |||
| Thu 02/12 | SEC 10 Recursive Programming | |||
| Released C2 I.S. by 11:59PM PT Mondrian Art | ||||
| Fri 02/13 | LES 11 Recursive Backtracking | |||
| Week 6 | ||||
| Mon 02/16 | ||||
| Released R4 C1, P1 Due 11:59 pm PT Resub 4 | ||||
| Tue 02/17 | SEC 11 Exhaustive Search & Recursive Backtracking | |||
| Wed 02/18 | LES 12 Linked Lists w/ Recursion | |||
| Thu 02/19 | SEC 12 Linked Lists w/ Recursion | |||
| Released P2 I.S. by 11:59PM PT Disaster Relief | ||||
| Fri 02/20 | LES 13 Binary Trees: Traversal | |||
| Week 7 | ||||
| Mon 02/23 | ||||
| Released R5 P1, C2 Due 11:59 pm PT Resub 5 | ||||
| Tue 02/24 | SEC 13 Binary Trees: Introduction | |||
| Wed 02/25 | LES 14 Binary Trees: Modification | |||
| Thu 02/26 | SEC 14 Binary Trees: Modification | |||
| Released P3 I.S. by 11:59PM PT Cornbear's Classifier | ||||
| Fri 02/27 | LES 15 Machine Learning + Cornbear's Classifier | |||
| Week 8 | ||||
| Mon 03/02 | ||||
| Released R6 P1, C2, P2 Due 11:59 pm PT Resub 6 | ||||
| Tue 03/03 | QUIZ 02 Quiz 2 Note: Information for Quiz 2
| |||
| Wed 03/04 | LES 16 Binary Search Trees | |||
| Thu 03/05 | SEC 16 Binary Search Trees | |||
| Released C3 I.S. by 11:59PM PT B(e)ST of the B(e)ST | ||||
| Fri 03/06 | LES 17 Hashing | |||
| Week 9 | ||||
| Mon 03/09 | ||||
| Released R7 C2,P2,P3,C3 Due 11:59 pm PT Resub 7 | ||||
| Tue 03/10 | SEC 17 Final Exam Review 1 | |||
| Wed 03/11 | LES 18 Final Exam Review | |||
| Thu 03/12 | SEC 18 Final Exam Review 2 | |||
| Fri 03/13 | LES 19 Victory Lap & Next Steps | |||
| Week 10 | ||||
| Mon 03/16 | ||||
| Tue 03/17 | EXAM Final Exam - 12:30-2:20pm | |||
| Wed 03/18 | ||||
| Thu 03/19 | ||||
| Fri 03/20 | ||||