TGGS > ECE > 573
Efficient Algorithms
Sorting: Bubble sort, Selection sort, Insertion sort, Heap sort, Merge sort, Quick sort. Graph search: Linear search, Binary search, Breadth-first search, Depth-first search. Bellman-Ford algorithm. Dijkstra's algorithm. A* algorithm. Data structures: Lists, Arrays, Stacks, Queues, Hash tables, Heaps, Binary trees. Algorithm paradigms: Recursion, Divide and conquer, Greedy algorithm, Dynamic programming. Optimization: Maximum-flow, Linear programming, Simplex algorithm. Computational complexity theory: big-O notation, NP. Applications: Data compression, Security, Math.
Instructor(s) : W. Sae-Tang
Credits : (3-0-6)
Course Learning Outcome (What are they?)
| ELO1 | ELO2 | ELO3 | ELO4 | ELO5 | ELO6 | ELO7 | ELO8 | ELO9 | ELO10 |
| Morale and Ethics | Knowledge | Intellectual Skill | Interpersonal Skill and responsibility | Analytical, communications and IT skills | ||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 1 | 2 | 3 | 4 | 1 | 2 | 3 | 4 | 5 | 1 | 2 | 3 | 4 | 5 | 1 | 2 | 3 | 4 | 5 | 6 |
Revision : July 2020
Other Revisions : July 2021