Data Structures and Algorithm
| Course Level: | Undergraduate course |
| Course Location: | Universitas Indonesia, Faculty of Computer Science |
| Year: | 2015, 2017 |
Description
This course teaches basic techniques for abstracting data, creating algorithms that can access the data, and manipulating the abstract structure. This course also covers analysis of the complexity of space and time in implementing an algorithm. The topics covered include: concept of abstract data type, linear data model (array and dynamic list, stack and queue), set, hierarchical data model (binary tree, heap, binary search tree, AVL-tree, B-tree) model graph, hashtable, tracking algorithm. This course covers the following
Topics
- Algorithm Complexity Analysis
- Abstract Data Types and Java Collections
- Recursive
- Linear Data Model: List, Stack, Queue
- Hierarchical Data Model: Binary Trees, Heaps, Binary Search Trees, AVL-tree, Red-black Trees, B-Trees
- Structural Data Model: Graph
- Hashing
- Sorting and Searching Algorithm