Course Introduction
- Course Name: Struktur Data
- Course Code: CCH1D4
- Credits : 3 (including 1 credit Lab Work)
- 14 weeks, each
- 3 x 50 minutes class (round up to 4)
- 150 minutes lab work (10 weeks)
- 3 x 2 hours of structured exercise
- 3 x 2 hours of independent activity
- 14 weeks, each
Prerequisite
- Dasar Algoritma dan Pemrograman
Points
- Mid and Final Exam [60%]
- Mid Exam 25-30%
- Final Exam 30-35%
- Assignment, Quiz, Project [25%]
- Assignment + Quiz 10-15%
- Project 10-15%
- Practicum [15%]
CLO Points
- CLO1 : Array and Linear Linked List
- Exercise, Lab Assessment 1, Mid Term
- CLO2 : Linked List Variation
- Exercise, Lab Assessment 2, Mid Term
- CLO3 : Stack and Queue
- Exercise, Lab Assessment 3, Final Term
- CLO4 : Non Linear : Tree and Graph
- Exercise, Lab Assessment 4, Final Term
- CLO5 : Final Project
Point Distributions
| A | 80 … 100.0 |
| AB | 75 … 79.99 |
| B | 70 … 74.99 |
| BC | 60 … 69.99 |
| C | 50 … 59.99 |
| D | 40 … 49.99 |
| E | 0 … 39.99 |
Lecture Slides
- 01 – Introduction to Data Structure
- 02 – Abstract Data Type
- 03 – Introduction to Pointer
- 04 – Single Linked List
- 05 – Linked List Variation – Double Linked List
- 06 – Linked List Variation – Circular Linked List
- 07 – Linked List Variation – Multi Linked List
- 08 – Stack
- 09 – Queue
- 10 – Recursive
- 11 – Tree
- 12 – Graph
GitHub Exercise
Lab Work Exercise
Teaching History
- [2013/2014] – IF3602
- [2013/2014] – IF3607
- [2013/2014] – Lab Work IF3601
- [2013/2014] – Lab Work IF3603
- [log book link]