Skip to content

IF25-12003

Algorithms and Data Structures

  • 2025 Curriculum

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

  1. Linear data structures (arrays, linked lists, stacks and queues)
  2. Non-linear data structures (trees and graphs) and hashing
  3. Abstract data types and the complexity of data structure operations

Course Learning Outcomes (CLO)

Each course outcome derives from one programme outcome.

  1. CPMK0607

    Students are able to apply the basic concepts of algorithms and computer systems to solve computational problems.

    CPL06
  2. CPMK0608

    Students are able to explain the basic concepts of algorithms and computer systems to solve computational problems.

    CPL06

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

Back to course catalogue