Hello, if you have any need, please feel free to consult us, this is my wechat: wx91due
CSE 582: Data Structures and Algorithms Fall 2024
|
Classes
|
MoWe 9:30AM - 10:50AM, LGT ENGR LAB 102 WESTCAMPUS |
|---|---|
|
Instructor
|
Prof. Pramod Ganapathi Office hours: MoWe 03:25PM - 04:55PM, Room 105 New Computer Science |
|
TA's
|
Google sheets |
|
Note
|
This course is mainly for satisfying the prerequisites of algorithms and data structures. It will NOT count as a lecture course for CS M.S. students. It will NOT count towards CS Ph.D. quals. However, its credits will count for graduation for both CS M.S. and CS Ph.D. |
|
Course Description
|
The course consists of two parts. The first part covers data structures to efficiently store, organize, modify, and access data. Topics include: arrays, stacks, queues, linked lists, trees, hash tables, priority queues, and graphs. The second part covers the design and analysis of algorithms for solving computer science problems. Topics include: algorithm analysis, exhaustive search algorithms, divide-and-conquer algorithms, greedy algorithms, and dynamic programming algorithms. |
|---|---|
|
Prerequisites
|
Programming experience in at least one high-level programming language and competence in using programming tool chains (writing, compiling, running and debugging programs). Most part of the course will not require coding. We might have one or two instances where we might have coding questions; you will have to use Java programming language in such cases The data structures topics will have example codes in Java. |
|
Credits
|
3 |
|
Course Outcome
|
At the end of the course, the students should have the following knowledge, skills, and wisdom:
|
|
Textbooks
|
|
|
Grading
|
Course requirements and grading are as follows:
|
|
Homework
|
Homework will be posted on Brightspace. Homework must be written on plain sheets of paper, scanned using a good scan app, and a single scanned PDF must be submitted on Brightspace. Homework can also be written using Word or Latex or a tablet. The PDF must have the student ID as the file name. Late submissions will not be graded for any reason (including oversleeping, forgetting, PC issues, technical issues, Brightspace issues, traveling, etc), except in the case of medical emergencies (with documentation submitted to and verified by the Student Support Team) and on the discretion of the instructor based on a case-by-case basis. It is strongly recommended to submit at least one version three days before the deadline. A student can submit an infinite number of versions of the answer sheets PDF to the Brightspace. We only evaluate the last/final version of the solutions PDF uploaded on Brightspace before the deadline. Students should not submit the first version of their homework at the exact deadline or later or a few seconds/minutes just before the deadline. Because, we do not consider the time at which a homework was submitted, we consider the time at which the homework was successfully up on Brightspace (with all pages in human-readable form) and it takes a few seconds/minutes to upload on Brightspace. If Brightspace flags the homework as late, it is late. Regrade requests deadline is 1 week after getting the homework/exam results on Brightspace. |
|
Makeup Exams
|
Makeup exams will not be given for any reason (including oversleeping, forgetting, PC issues, technical issues, Brightspace issues, traveling, etc), except in the cases of medical emergencies (with documentation submitted to and verified by the Student Support Team) and on the discretion of the instructor based on a case-by-case basis; student participation in university sponsored events (with documentation); and religious absences (with documentation). |
|
Attendance
|
Students are expected to attend every class, report for examinations and submit major graded coursework as scheduled. If a student is unable to attend lecture(s), report for any exams or complete major graded coursework as scheduled due to extenuating circumstances, the student must contact the instructor as soon as possible. Students may be requested to provide documentation to support their absence and/or may be referred to the Student Support Team for assistance. Students will be provided reasonable accommodations for missed exams, assignments or projects due to significant illness, tragedy or other personal emergencies. In the instance of missed lectures or recitations, the student is responsible for reviewing posted slides, reviewing recorded lectures, seeking notes from a classmate, etc. Please note, all students must follow Stony Brook, local, state and Centers for Disease Control and Prevention (CDC) guidelines to reduce the risk of transmission of COVID. For questions or more information click here. |
|
Additional Resources
|
|
Academic calendar
Recorded video lectures can be accessed through Google Drive Link using @stonybrook.edu email account.
|
Lectures
|
Class Schedule
|
Slides
|
Study
|
Learning Materials
|
|---|---|---|---|---|
| 1 session | Introduction (Course Info) | [PDF] | [AL Ch. 1][GTG Ch. 1, 2] | Map of Math, Map of CS |
| 1 session | Algorithm Code, Asymptotic Analysis | [PDF], [PDF] | [GTG Ch. 4][AL Ch. 2] | |
| 3 sessions | Arrays and Lists | [PDF] | [GTG Ch. 3, 7] | |
| 1 session | Stacks, Queues, and Dequeues | [PDF] | [GTG Ch. 6] | |
| 1.5 sessions | Recursion | [PDF] | [GTG Ch. 5] | |
| 2.5 sessions | Trees | [PDF] | [GTG Ch. 8, 11] | |
| 1 session | Hashtables | [PDF] | [GTG Ch. 10] | Chaining, Open Addressing |
| 1 session | Priority Queues | [PDF] | [GTG Ch. 9] | |
| Oct 09 | Midterm |
Time: Class time, Venue: Class Syllabus: All topics covered to this date |
||
| 1.5 sessions | Brute Force | [PDF] | [AL Ch. 3] | DFS, BFS |
| 1.5 sessions | Decrease-and-Conquer | [PDF] | [AL Ch. 4, GTG Ch. 14] | Insertion Sort, Topological Sort |
| 3 sessions | Divide-and-Conquer | [PDF] | [AL Ch. 5] | Mergesort, Median Finding |
| 4 sessions | Dynamic Programming | [PDF] | [AL Ch. 8] | Fibonacci, LCS, Edit Distance, APSP, Knapsack, Text Justification, More DP |
| 2 sessions | Greedy Technique | [PDF] | [AL Ch. 9] | MST, Dijkstra |
| 2 sessions | Backtracking | [PDF] | [AL Ch. 12] | Subsets |
| 1 session | Algorithmically Hard Problems | [PDF] | - | Erik Demaine's Complexity I, Complexity II, Michael Sipser's P vs. NP Problem, Avi Wigderson's P vs. NP Problem, Complexity Zoo |
| Dec 11 (We) | Final |
Time: 11:15-1:45 PM, Venue: Class, Schedule Syllabus: All topics |