CSE214 - Data Structures
CSE214 - Data Structures
Fall 2026, SUNY Korea
Fall 2026, SUNY Korea
Instructor: Byungkon Kang
Classes: M,W 14:00 - 15:20 @B203
Recitation: M 15:30 - 16:25 @B203
Prerequisites: A grade of 'C' or higher in CSE114.
Office hours (@C512): MW 10:00 - 12:00. No need to make appointments during these hours.
TA office hours
Shubhangi Garnaik (Graduate TA): T,Th 12:00 - 14:00
Seoyeon Ahn (Undergraduate TA): T,Th 09:00 - 11:30, 14:00 - 15:30
This is a course designed to introduce core concepts in data structures and their related algorithms. We will go over some of the most fundamental and frequently used programming constructs (known as data structures) that will help you store, manage, and manipulate your data. In addition to the "major" data structures, we'll have a chance to take a look at some of the concepts and algorithms associated with them.
The following is the list of the official course outcomes that is expected of students successfully completing this course.
An ability to program using sophisticated features of object oriented programming.
An ability to define and use data types, and use algorithmic design.
An understanding of the importance of time and memory efficiency in algorithm design.
Take a look at this set of self-assessment problems to learn what is expected of the students who pass this course. You'll need your 'stonybrook.edu' account to access this file and the lecture slides.
A textbook is not mandatory, but many of the materials will be based on the following book.
"Data structures and the Java collections framework" (3rd ed.), William J. Collins.
It's an old book, but not outdated in terms of the core idea.
The following may be subject to change, so please check back regularly.
Week 1: Course introduction + Review of Java Ch. 1 & 2 (3/3 HW0 out), Rec. 1 - Java Settings (3/4), Continued (3/5 HW0 due)
Week 2: Object-oriented programming basics Ch. 1 & 2(3/10), Rec. 2 - OOP practice (3/11), Continued (3/12 HW1 out)
Week 3: Complexity measures Ch. 3 (3/17), Rec. 3 - Run-time analysis (3/18), Continued (3/19 HW1 due, HW2 out)
Week 4: ArrayList Ch. 6 (3/24), Rec. 4 - ArrayList iterators (3/25), ArrayList Ch.6 (3/26 HW2 due, HW3 out),
Week 5: Linked List Ch. 7 (3/31), Rec. 5 - Linked List + Midterm review (4/1) Midterm 1 (4/2 HW3 due, HW4 out)
Week 6: Stacks Ch. 8 (4/7), Rec. 6 - Stacks (4/8), Queues (4/9, HW4 due, HW5 out) // Midterm report
Week 7: Recursion Ch. 5 (4/14), Rec. 7- Recursion (4/15), Recursion cont.'d Ch. 5 (4/16, HW5 due)
Week 8: Trees Ch. 9 (4/21), Rec. 8 - Recursion practice (4/22), Trees Ch. 9, 10 (4/23 HW6 out) // Last week for GPNC/W option
Week 9: Balanced BSTs Ch. 12.1 (4/28), Rec. 9 - ArraList & Tree iterators (4/29), Balanced BSTs Ch. 12.1 (4/30 HW6 due, HW7 out)
Week 10: No class (5/5), Rec. 10 - Midterm review (5/6), Midterm 2 (5/7 HW7 due)
Week 11: Priority queues Ch. 13 (5/12), Rec. 11 - Priority queues, (5/13), Sorting Ch. 11 (5/14)
Week 12: Sorting cont.'d (5/19 HW8 out), Rec. 12 - Sorting (5/20), Maps and sets Ch. 12 (5/21)
Week 13: Maps and sets cont.'d (5/26 HW8 due, HW9 out), Rec. 13 - Maps (5/27), Graphs Ch. 15 (5/28)
Week 14: Graphs cont.'d (6/2 HW9 due, HW10 out), Rec. 14 - No class (6/3), Dynamic programming (6/4)
Week 15: Dynamic programming (6/9 HW10 due), Rec. 15 - Final review (6/10 Last day of class)
Final exam: June 16th, 12:30 - 15:00
Your final raw score is determined by the following breakdown. The final letter grade will be decided on a curve, where the boundary cases can be promoted to higher letter grades based on class participation and performance improvement over time.
You *must* complete all homework assignments. Late submissions are worth 0%, but are nevertheless required for successfully completing this course. Such late assignments are to be turned in within 3 days (72 hours) of the original due date. Anything submitted after that period is considered missing work. For every missed assignment, your final grade will be reduced by one whole letter (e.g., 'B-' to 'C-'). You may not submit an 'empty' homework - A valid submission is a work that is worth a nonzero grade.
You may bring a single A4-sized double-sided 'cheat-sheet' for your reference. The sheet must be handwritten in pen/pencil on a paper. No photocopies, attachments, or printouts will be allowed.
There will be one comprehensive final exam, with more emphasis on the recent materials, on the designated final date. Cheat-sheet allowed.
These include (unannounced) pop-quizzes and programming exercises given during the recitation sessions. The same submission policy as the assignments' applies to programming recitations - You must complete *everything*, regardless of lateness.
Missing more than 20% of the lectures will result in an automatic F grade.
Missing more than 20 minutes of class will be counted as an unexcused absence (abusing this 20-minute grace period will definitely result in a series of unexcused absences).
Up to 2 (two) excused absences will be ignored, but you must notify me via written notes at least two days prior. If you wish to be excused due to sickness, you must (1) send me an email *before* the class starts, mentioning which hospital you intend to visit, and (2) submit a doctor's note within a day clearly explaining why you had to be absent (only stating your symptoms is not a valid note).
For all graded works, you have exactly three (3) days since the release of the grades to make a petition for a regrade. I understand this is a bit short, but it's necessary to keep up with the class schedule. Keep in mind that everything in that assignment/test will be regraded (i.e., not just that specific problem you requested for).
I will notify those who are not in good standing at around week 7 or 8. This will be a good time for you to decide if you wish to change your grade options for this course. However, such a midterm report will also be available to whoever request for it up until week 13.
** A midterm report is not a report on your midterm exams. It's a report on your current standing in class.
Students should pursue their academic goals in an honest way that does not put you at an unfair advantage over other students. You are responsible for all work you submitted and representing other’s work as yours is always wrong. Faculty is required to report any suspected instance of academic dishonesty to the school. Regarding your homework, you are encouraged to discuss it with others, but you should write your own code. For more information please refer to http://www.stonybrook.edu/commcms/academic\_integrity/index.html.
Typing in a query to a virtual assistant software such as ChatGPT does not count as your own 'work'. Even the slightest use of these tools (including mere installation of such plug-ins) in any of your assignments will result in the immediate dismissal from class with a grade of 'F'. Any suspected students will be subjected to further investigations such as interviews, additional in-person assignments, etc..
If you have a physical, psychological, medical or learning disability that may impact your course work, please let the instructor know. Reasonable accommodation will be provided if necessary and appropriate. All information and documentation are confidential.
Stony Brook University expects students to respect the rights, privileges, and property of other people. Faculty are required to report to the Office of Judicial Affairs any disruptive behavior that interrupts their ability to teach, compromises the safety of the learning environment, or inhibits students' ability to learn. Faculty in the HSC Schools and the School of Medicine are required to follow their school-specific procedures.