Data Structures

Back to Yung Yi, Courses

Introduction

Course on undergraduate-level data structure based on C++. Lectured by Prof. Yung Yi, KAIST, South Korea. Chances to learn object-oriented programming (C++) and basic algorithms.

Textbook

Data Structures and Algorithms in C++, 2nd edition by Michael T. Goodrich, Roberto Tamassia, David M. Mount

Lecture slide pptx files

They have been made by Prof. Yung YI. He used many resources from the publisher's instructor companion site and borrowed some figures and texts from Dr. Injong Rhee's slides, but largely reorganized, reeditted, and modified them for a semester course in KAIST EE. Feel free to download, modify, and use them for your convenience.

Contents	Material
0. Introduction and Overview What is data structure? What to learn from this course	Lecture slides (pptx) For prints: 1, 2, 4
1. C++ programming language Objected oriented programming All the basics about C++	Lecture slides (pptx) For prints: 1, 2, 4 Thanks: Slides are originally made by Prof. Tak Gon Kim. About 8 hours of lecture videos at YouTube: 1, 2, 3, 4, 5, 6, 7, 8
2. Array and Linked List	Lecture slides (pptx) For prints: 1, 2, 4
3. Asymptotic Analysis of Algorithms	Lecture slides (pptx) For prints: 1, 2, 4
4. Stacks	Lecture slides (pptx) For prints: 1, 2, 4
5. Queues	Lecture slides (pptx) For prints: 1, 2, 4
6. List and Sequence	Lecture slides (pptx) For prints: 1, 2, 4
7. Trees	Lecture slides (pptx) For prints: 1, 2, 4
8. Priority Queues and Heap	Lecture slides (pptx) For prints: 1, 2, 4
9. Map: Hash Table	Lecture slides (pptx) For prints: 1, 2, 4
9. Map: Skip Lists	Lecture slides (pptx) For prints: 1, 2, 4
10. Search Trees: Binary Search Tree and AVL Tree	Lecture slides (pptx) For prints: 1, 2, 4
10. Search Trees: 2-4 Tree	Lecture slides (pptx) For prints: 1, 2, 4
10. Search Trees: Red Black Tree	Lecture slides (pptx) For prints: 1, 2, 4
11. Graph: Basics and Traversal	Lecture slides (pptx) For prints: 1, 2, 4
11. Graph: Shortest Path	Lecture slides (pptx) For prints: 1, 2, 4
11. Graph: Minimum Spanning Tree	Lecture slides (pptx) For prints: 1, 2, 4
12. Sorting: Merge Sort	Lecture slides (pptx) For prints: 1, 2, 4
12. Sorting: Quick Sort	Lecture slides (pptx) For prints: 1, 2, 4
13. Summary and Final Words	Lecture slides (pptx) For prints: 1