Transcript LINUX System (English

Data Structures (Second Part)
Lecture 1
Bong-Soo Sohn
Assistant Professor
School of Computer Science and Engineering
Chung-Ang University
Course Overview

Level : 2-th year CSE undergrad students

Topics : Second part of Data Structures

Review of Basic Data Structures


Advanced Data Structures



Array, Linked List, Stack, Queue, Trees, and etc
Graph algorithms, Hashing, Search Trees, etc
Basic Algorithms
 Complexity Analysis
 Sorting, Search, etc
Objectives



Understanding core concepts of various data structures
Applying the data structures to actual programming
Improve the ability of design and analysis of data structures
and algorithms.
Textbook

“Fundamentals of Data Structures in C”,
nd
Horowitz, Sahni, Anderson-Freed, 2
Edition, Silicon Press

C++ version of the same book is also fine.
Evaluation

Grade Percentage
 A : around 30%
 B : around 35%
Midterm Exam : 30%
 Final Exam : 35%
 Assignments + Term Projects : 30%
 Class Participation : 5%

You may get F grade if you miss (more than) ¼ of the whole
classes
 Academic dishonesty (e.g. cheating, plagiarism, and etc.)
will be taken seriously

Course Information



Lecture Time : Mon 3, 4 , Wed 3, 4
Lecture Room : Engineering 2 – 6514
English-Only Lecture





English proficiency can be greatly improved by using and practicing English,
not by just studying English.
Lecture, Homework, Exam : 100% English
Question : English Encouraged but Korean allowed.
Project Presentation : English Presentaion Prefered
(you will get bonus points)
Professor Information




Office : Engineering 2 - 6501
Email : [email protected]
Office Tel : 820-5843
Office Hour : Thu 3pm-5pm, or individual appointment
Announcement

Class Website




http://cau.ac.kr/~bongbong/dsd08
Class information such as lecture notes can be
accessible through this website
We will also use MiniWeb for homework submission
Programming Assignments




We encourage to study and discuss together for doing
programming assignments.
However, you must do programming YOURSELF.
You must not share any of source code with other
students.
Any kind of academic dishonesty will be taken seriously.
Schedule
1
Course Overview, Review : C Pointer
2
Review : Array, Linked List, Stack, Queue
3
Review : Trees
4
Graph (Definition, Traversal, Component)
5
Graph Algorithms.
6
Sorting, Time Complexity
7
Internal/External Sorting
8
Midterm Exam
Schedule
9
Hashing
10
Priority Queues
11
Efficient Binary Search Trees
12
Multiway Search Trees
13
Term Project Progress Discussion
14
Term Project Final Presentation
15
Final Exam
Remarks

Students should have taken the first part of
the Data Structure class (spring semester).

Students should have knowledge and
experience of C programming language.

This course requires students to perform term
project design, implementation, presentation,
and final report writing.