


Data Structure (Spring Semester, 2008)
Course Schedule & Lecture Notes

[March 03] Introduction to Lecture [Generic Code], Function Pointer Example
[March 10] (No Lecture, The professor should participate in the IETF meeting.)
[March 17] Chapter 1. Basic Concepts [Basic Concepts], [Homework 1]
[March 24] Chapter 2. Recursion [Recursion], [Homework 2]
[March 31] Chapter 3. Stacks [Stacks], [Homework 3]
[April 07] Chapter 4. Queues [Queues], [Homework 4], queues.h, stdbool.h
[April 14] Chapter 5. General Linear Lists  1/2 [Queue2], [General Linear List], [Homework 5  기한 5월 4일까지 연장]
[April 21] Chapter 5. General Linear Lists  2/2 [General Linear List  2]
[April 28] MIDTERM EXAMINAION
[May 05] (No Lecture, Children's day)
[May 07, A Supplementary Lecture] Chapter 6. Introduction to Trees [Introduction to Tree], [Homework 6]
[May 12] (No Lecture, Birthday Of Lord Buddha)
[May 19] Chapter Chapter 7. Binary Search Trees [BST]
[May 26] 8. AVL Search Trees [AVL Trees], [Homework 7]
[June 02] Chapter 9. Heaps [Heaps], [Homework 8], [Term Project]
[June 09] Chapter 10. Multiway Trees [Multuway Trees],[Homework 9]
[June 16] Chapter 11. Graphs [Graphs]
[June 19, 19:00] FINAL EXAMINATION

Overview

Lecturer: YounHee Han (Rm. B303, Tel: 5601486, yhhan@kut.ac.kr)
Classes: Monday, 2:006:00am
Lecture Room: A207
TA: SeungIll Hyun (freeprison@kut.ac.kr)
Course Board: http://link.kut.ac.kr/~linkroot/zb5
Course Description:
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 realization through implementation, and analysis of their efficiency. Implementations in this course are carried out in the C (or C++) language, but the principles are more generally applicable to most modern programming environments. Students should have at least one semester of programming experience with C language.

Lecture Topics

 Data abstraction
 Pointer, Array, Struct
 Recursive
 List, Stack, Queue, Priority Queue
 Tree, Balanced Tree, AVL Tree, RedBlack Tree, B Tree
 Graph
 Sorting Technique

References

 PPT materials provided by professor
 Data Structures  A Pseudocode Approach with C (Second Edition), Richard F. Gilberg & Behrouz A. Forouzan, Thomson, 2005
 ISBN: 9780534390808
 URL: Click

Logistics

 Attendance  one class absence will result in the deduction of two points out of
100 points. Five absences will not result in ten points deduction, but "failure" (i.e.,
grade 'F') in this course.
 Exam  there will be midterm exam and final exam for the evaluation of the
knowledge learned from the class.
 Homework  much intensive homework will be set. Any cheating (or copying) will
result in grade 'F'.

Evaluation

 Attendance (10%), Homework (20%), Midterm exam (30%), Final exam (40%)


