Fall 2018, M1522.000900 Data Structure, Seoul National University

Seoul National University
M1522.000900 Data Structure
Fall 2018 - U Kang

News and Announcements

Sept. 4: Class starts. Welcome!

Course Information

This undergraduate level course covers fundamental algorithms and data structures used in computer programming. Data structures are ways of organizing data within a computer's storage so that some desired operations may be performed on that data easily or efficiently. Algorithms are sequences of operations that, usually, take some input data and produce some desired output. Together, they form the foundation of computer programming.
The topics to be covered include abstrract data types, trees, hashing, sorting, graphs, string match, and algorithm design techniques.

Instructor: U Kang (ukang at snu.ac.kr)
- 301-502
- Office hours: Tuesday 14:30-15:30 (also, by appointment)
TA:
- Bonhun Koo (darkgs@snu.ac.kr), 301-519, office hours: Friday, 11:00-12:00
- Huiwen Xu (xuhuiwen33@snu.ac.kr), 301-519, office hours: Tuesday, 10:00-11:00
- Yang Bai (baiyang@snu.ac.kr), 301-519, office hours: Thursday, 11:00-12:00
- Chun Quan (quanchun@snu.ac.kr), 301-519, office hours: Tuesday, 11:00-12:00
Class meets:
- Theory: Tue, Thu 17:00 ~ 18:15 (Room 301-203)
- Lab: Fri 16:00 ~ 17:50 (Room 302-311-1)
URL of this web page: http://datalab.snu.ac.kr/~ukang/courses/18F-DS

Schedule

Date		Topic	Notice
Sep.	4	Introduction
	6	Data Structures and Algorithms (Chapter 1)
	11	Mathematical Preliminaries (Chapter 2)
	13	Mathematical Preliminaries 2 (Chapter 2)	Homework 1 out
	18	Algorithm Analysis (Chapter 3)
	20	Algorithm Analysis 2 (Chapter 3)	Homework 2 out
	25	Lists, Stacks, and Queues (Chapter 4)
	27	Lists, Stacks, and Queues 2 (Chapter 4)	Programming 1 out
Oct.	2	Lists, Stacks, and Queues 3 (Chapter 4): use last lecture's slide	Homework 3 out
	4	Binary Trees (Chapter 5)
	9	Binary Trees 2 (Chapter 5)	Programming 2 out
	11	Binary Trees 3 (Chapter 5)
	16	Binary Trees 4 (Chapter 5)	Homework 4 out
	18	Non-Binary Trees (Chapter 6)
	23, 25	Midterm
	30	Non-Binary Trees 2 (Chapter 6)	Homework 5 out
Nov.	1	Internal Sorting (Chapter 7)
	6	Internal Sorting 2 (Chapter 7)
	8	Internal Sorting 3 (Chapter 7)	Programming 3 out
	13	Internal Sorting 4 (Chapter 7)	Homework 6 out
	15	Searching (Chapter 9)
	20	Searching 2 (Chapter 9)	Programming 4 out
	22	Searching 3 (Chapter 9)	Homework 7 out
	27	Graphs (Chapter 11)
	29	Graphs 2 (Chapter 11)
Dec.	4	Graphs 3 (Chapter 11)	Homework 8 out
	6	Conclusion
	11, 13	Final

Grading

10% Attendance and Quiz
30% Homework
25% Midterm
35% Final
(+5% Participation)

Late policy - for all deliverables:

No delay penalties, for medical etc emergencies (bring doctor's note).
Each person has 4 'slip days' total, for the whole semester. 10% per day of delay, after that.

Textbook

The text book is
A Practical Introduction to Data Structures and Algorithm Analysis, Edition 3.2 (Java Version), Mar 28, 2013 by Cliff A. Shaffer. (available in online)

Prerequisite

M1522.000600 (Computer Programming) or consent of instructor
Knowledge of the Java programming language enough to be able to design, code, and debug programs

Last modified Dec. 3, 2018, by U Kang

Seoul National University M1522.000900 Data Structure Fall 2018 - U Kang