CSSE230 - Data Structures & Algorithm Analysis
Class Description[edit | edit source]
This class will teach you the basics of writing efficient code. You will learn how to analyze the runtime of various algorithms, and classify them using big-O (maximum runtime), big theta (average runtime), and big omega (minimum runtime) notations. You will also learn various structures for storing data in your programs, including linked lists, heap, and trees. Unfortunately, this class will require you to practice Pair Programming. View Syllabus
| Reading | |
| Homework | |
| Exams | |
| Final Exam | |
| Final Project | Yes |
| Flipped Classroom | Yes |
Advice for Students Taking CSSE230[edit | edit source]
Proofs[edit | edit source]
This class will require you to complete mathematical proofs in class and on homework assignments. While there aren't a huge number of proofs, and you won't be asked to prove anything on an exam, you may find it helpful to delay this class until after taking MA276 Intro to Proofs.
Editor Trees[edit | edit source]
The final project, Editor Trees, is quite difficult. You will need to schedule a lot of time to meet with your partner. You may find it helpful to meet in the CS labs where you have a large screen and are near your professor's office.
Video Lectures[edit | edit source]
Regardless of who teacher your class, your actual professor is Dr. Boutell, as he makes all of the lecture videos that you will be assigned to watch. You may find it helpful to install the Faster Panopto extension if you find the videos too slow.