Building for Schoold of Internet-Media
Building for Schoold of Internet-Media


Data Structure (Spring Semester, 2007)



Course Schedule & Lecture Notes

  • [March 7] Introduction to Lecture, Chapter 1-1. OO Concept: Part I
  • [March 14] Chapter 1-2. OO Concept: Part II, Chapter 2. Abstract Data Type
  • [March 21] (No Lecture, The professor should participate in the IETF meeting.)
  • [March 28] Chapter 3. Pointer, Array, Struct Data Type (Inside Memory)
  • [April 4] Chapter 4. Recursion
  • [April 11] Chapter 5. List
  • [April 18] Chapter 6. Stack
                        Chapter 7. Queue
  • [April 25] MIDTERM EXAMINAION
  • [May 2] Chapter 8. Algorithm & Efficiency
                     Chapter 9. Sorting - Part 1
                     (Supplementary Materials - [1], [2], [3], [4], [5]), 4th HomeWork - [Click]
  • [May 9] Chapter 9. Sorting - Part 2
  • [May 16] Chapter 10. Tree - Part 1
  • [May 23] Chapter 10. Tree - Part 2, 5th HomeWork (Final) - [Click]
  • [May 30] Chapter 11. Priority Queue and Chapter 13. Balanced Tree - Part 1
  • [June 6] (No Lecture, A legal holiday - The Memorial Day)
  • [June 13] Chapter 13. Balanced Tree - Part 2 and Chapter 14. Graph
  • [June 20] FINAL EXAMINATION

  • Overview

  • Lecturer: Youn-Hee Han (Rm. B303, Tel: 560-1486, yhhan@kut.ac.kr)
  • Classes: Wed, 9:00-1:00am
  • Lecture Room: A-203
  • TA: SeungIll Hyun (freeprison@kut.ac.kr)
  • Course Board: http://icl.kut.ac.kr/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. The experience of both C and C++ is even better. An overview of the C++ essentials will be provided during the course. Students with less C++ experience are allowed to do the homeworks with C language. Of course, the usage of C++ is welcome.

  • Lecture Topics

    • C++ essentials
    • Object-oriented Design
    • Data abstraction
    • Pointer, Array, Struct
    • Recursive
    • List, Stack, Queue, Priority Queue
    • Algorithms and Efficiency
    • Search, Sort
    • Tree, Balanced Tree, AVL Tree, Red-Black Tree, B Tree
    • Graph

    References


    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 (30%), Midterm exam (30%), Final exam (30%)