자료구조 및 실습
- 한국기술교육대학교
- Muhammad Tariq Mahmood
페이스북
트위터
카카오톡
네이버밴드
링크복사
-
- 주제분류
- 공학 >컴퓨터ㆍ통신 >컴퓨터공학
-
- 강의학기
- 2011년 2학기
-
- 조회수
- 8,486
-
- 평점
- 1.2/5.0 (5)
A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. In this course, students can learn the characteristics of linear data structures such as Array, Stack, Queue, and Deque and non-linear data structures such as Tree and Graph, and understand how to use and implement them. Also, students can understand various Sorting and Searching algorithms using those data structures and learn how to program it for themselves.
- 수강안내 및 수강신청
- ※ 수강확인증 발급을 위해서는 수강신청이 필요합니다
Introduction
차시별 강의
| 1. | |
Introduction | Introduction to Data Structure Course and a breif review of C++ programming |  |
| 2. | |
List-I | Classes in C++, Introduction to Algorithms, Definition and examples of List Data stucture in daily life, List operations, Implementation of List Using Array | |
| 3. | |
List-II | List Implementation using Linked Memory, Some variants of Linked List. Example of list data sturucture usage | |
| 4. | |
Stacks-I | Definition, operations, implementation and usage of stack data structure. | |
| 5. | |
Stacks-II | Converting infix exprerssion to postfix using stack. Implemetatiion of stack using C++ templates | |
| 6. | |
Queques | Definition, operations, implementation and usage of queue data structure. | |
| 7. | |
Tree-I Binary Tree | Definition, operations, and implementation of binary tree data structure | |
| 8. | |
Tree-II Binary Search Tree | Definition, operations, and implementation of binary search tree (BST) | |
| 9. | |
Tree-III AVL Tree | Definition, operations, and implementation of AVL search tree | |
| 10. | |
Tree-IV Threaded Binary Tree | Remaining part of the AVL tree. Definition, operations, and implementation of binary threaded tree. | |
| 11. | |
Tree-V Tree Usage | Some applications and usages of tree data structure | |
| 12. | |
Tree-VI Heap | Definition, operations, and implementation of heap data structure | |
| 13. | |
Tables and Dictionaries | Definition, operations, and implementation of Tables | |
| 14. | |
Sorting | Some sorting algorithms | |
| 15. | |
Graph-I | Definition, representation and transversal of graphs | |
| 16. | |
Graph-II | Some graph algorithms | |
연관 자료
