IF25-12003
Algorithms and Data Structures
Description
This course prepares students to implement linear data structures (arrays, linked lists, stacks and queues), implement non-linear data structures (trees and graphs) and hashing, and explain the concepts of abstract data types and the complexity of data structure operations. Study materials: Foundations of Programming Languages (FPL), Algorithmic Foundations (AL).
Topics
- Linear data structures (arrays, linked lists, stacks and queues)
- Non-linear data structures (trees and graphs) and hashing
- Abstract data types and the complexity of data structure operations
Course Learning Outcomes (CLO)
Each course outcome derives from one programme outcome.
Supported PLOs
- CPL06
- Analyse and implement fundamental concepts of mathematics, statistics, algorithms and computer systems as the foundation of computing.
Previous curriculum equivalent
- IF2121 Algoritma dan Struktur Data · 4 credits · Kode, semester 3→2

