2. Instructor Information
|
Name |
Baek Seung-Hwan |
Department |
Dept. of Computer Science & Eng. |
| Email address |
shwbaek@postech.ac.kr
|
Homepage |
|
| Office |
054-279-2908 |
Office Phone |
|
| Office Hours |
Mon. & Wed. 12:15- 13:45
|
3. Course Objectives
Data Structures is an essential area of study for computer scientists and for anyone who will ever undertake any serious programming task. This course deals with the fundamentals of organizing and manipulating data efficiently using clean conceptual models. Students study many of the important conceptual data types, their implementation, and analysis of their efficiency. Topics will cover algorithm analysis, lists, trees, priority queues, dictionaries (hash tables, balanced search trees), graphs, strings (tries, pattern matching), and sorting.
4. Prerequisites & require
- Students are expected to be familiar with Python to understand the course. Note that we will use C/C++ for the main language but may draw analogy from Python for easy of explanation.
- Those who are not familiar with C/C++ and object-oriented programming must study Chapters 1 and 2 of the textbook before coming to the first lecture.
- Students are strongly encouraged to complete CSED103 prior to enrolling in this course to gain a solid foundation in C/C++.
5. Grading
| Midterm Exam |
Final Exam |
Attendance |
Assignment |
Project |
Presentation/Discussion |
Laboratory/Practice |
Quiz |
Others |
Total |
|
|
|
|
|
|
|
|
|
|
| 비고 |
Grades will be earned on the following basis:
- Midterm and final: 70%
- Homework/Programming Assignment: 20%
- Attendance: 10%
|
6. Course Materials
| Title |
Author |
Publisher |
Publication
Year/Edition |
ISBN |
|
Data Structures and Algorithms in C (2nd Edition)
|
Michael T. Goodrich et al.
|
John Wiley & Sons
|
2011
|
978-0-470-38327-8
|
7. Course References
Sartaj Sahni, "Data Structures, Algorithms, and Applications in C (2nd Ed.)," Silicon Press, 2004
8. Course Plan
1. Algorithm Analysis
2. Lists, Stacks, Queues
3. Trees
4. Priority Queues & Heaps
5. Sorting
6. Binary Search Trees
7. AVL Trees-1
8. AVL Trees-2
9. 2-3 Trees & B-Trees
10. Dictionaries & Hashing
11. Graph & Representations
12. Graph Traversals
13. Shortest Path Finding
14. Minimum-Cost Spanning Trees
15. Tries
16. Expression Trees
9. Course Operation
** Attendance policy **
(1) Arriving more than 15 minutes late will count as one absence.
(2) Three instances of being late will be counted as one absence.
(3) Unexcused absences may lead to disciplinary action:
- Grades will be reduced with each absence beyond four (e.g., from A to B).
- Accumulating eight absences will result in failing the course.
(4) There will be random check during the class. If you mark your digital attendance and then disappear later during the random check, it will count as 3 absences.
10. How to Teach & Remark
Homework
- Programming assignments will be released four times during the semester
- Need to start early otherwise can’t finish on time
Self-study
- Lectures may only cover the concepts without discussing the details
- The assignments and exams requires you to understand the details in the textbook
- Strongly recommend you to read out the textbook yourself
- Self-study is very important for you to succeed in this course and others
11. Supports for Students with a Disability
- Taking Course: interpreting services (for hearing impairment), Mobility and preferential seating assistances (for developmental disability), Note taking(for all kinds of disabilities) and etc.
- Taking Exam: Extended exam period (for all kinds of disabilities, if needed), Magnified exam papers (for sight disability), and etc.
- Please contact Center for Students with Disabilities (279-2434) for additional assistance