K01149 - 20181002125220 - Updated-PRO FORMA MTS3023 A181
K01149 - 20181002125220 - Updated-PRO FORMA MTS3023 A181
K01149 - 20181002125220 - Updated-PRO FORMA MTS3023 A181
Data Structures
Nama Kursus: Struktur Data
Course Name:
1
MTS 3023
Kod Kursus/
Course Code:
Sinopsis: Kursus ini membincangkan teori, konsep dan prinsip dalam pengaturcaraan berstruktur. Pelajar akan
menggunakan teknik berstruktur dalam menyelesaikan masalah yang berkait dengan elemen asas data
struktur, senarai berpaut, tindanan, baris gilir, pepohon binari, isihan dan graf
2
Synopsis: This course discusses the theory, concepts and principles for structured programming. Student will use
structured technique in solving problems that are related to basic element of data structure, linked lists,
stacks, queues, binary trees, sorting and graph
Hasil Pembelajaran Kursus: Pada akhir kursus para pelajar akan dapat: (contoh) – menerangkan prinsip asas imunisasi (C2, PLO1)
Course Learning Outcomes (CLO) : At the end of the course the students will be able to : (example) – explain the basic principles of
immunization (C2, PLO1):
CLO1 1. Determine time complexity of an algorithm and data structures used in the computer program (C4, PLO1)
1. Menentukan kompleksiti masa bagi algoritma dan struktur data yang digunakan di dalam atur cara komputer (C4, PLO1)
2. Solve related computer based problems using appropriate algorithms and data structures (BKMM1, PLO8)
CLO2 2. Menyelesaikan masalah yang berkaitan komputer dengan menggunakan algorithma dan sruktur data yang bersesuaian.
(BKMM1, PLO8)
7
3. Develop algorithms and data structures programs using appropriate computer language (P5, PLO3)
CLO3 3. Membangunkan atur cara algorithma dan struktur data menggunakan bahasa pengaturcaraan komputer yang bersesuaian
(P5, PLO3)
4. Work effectively as part of a team. (KKBP4, PLO4)
CLO4
4. Bekerja secara cekap di dalam satu kumpulan. (KKBP4, PLO4)
CLO5
Pemetaan Hasil Pembelajaran Kursus kepada Hasil Pembelajaran Program / Mapping of the Course Learning Outcomes to the
Programme Learning Outcomes
Course Programme Learning Outcomes (PLO)
Learning Teaching
Outcomes PLO PLO PLO PLO PLO PLO PLO PLO PLO PLO PLO PLO Assessment
Methods
(CLO) 1 2 3 4 5 6 7 8 9 10 11 12
Lecture and Mid Term Test
CLO1 Discussion
CLO5
Tunjukkan perkaitan antara CLO dan PLO dengan menanda “/” pada kotak berkaitan. / Indicate the relevancy between the CLO and PLO by
ticking “/” the appropriate relevant box.
(Deskripsi ini mesti dibaca bersama dengan Standard 2.1.2, 2.2.1 dan 2.2.2 di Area 2 – muka surat 16 & 18 / This description must be read
together with Standards 2.1.2, 2.2.1 and 2.2.2 in Area 2 – pages 16 & 18)
Hasil Pembelajaran Program:
PLO1: Menguasai ilmu dan pedagogi dalam bidang Teknologi Maklumat
PLO2: Boleh mengajar mata pelajaran Teknologi Maklumat yang ditawarkan di sekolah dan IPT
PLO3: Menguasai kemahiran teknikal, termasuk penggunaan teknologi pendidikan dan ICT
PLO4: Mengamalkan tahap profesionalisme, nilai, sikap dan tingkahlaku beretika
PLO5: Mempamerkan kemahiran mengurus keusahawanan dan menjalankan tanggungjawab sosial
PLO6: Berkomunikasi secara efektif dan boleh bekerja dalam pasukan
PLO7: Cekap mengurus maklumat dan berkebolehan belajar sepanjang hayat
PLO8: Berfikir secara kreatif dan kritis
PLO9: Menjalankan penyelidikan dalam bidang IT dan pendidikan
PLO10: Peka terhadap isu-isu semasa dan global
Transferable Skills
10 Knowledge and Practical Skills; Critical Thinking; Problem Solving and Teamwork.
(if applicable):
(Skills learned in the course of
study which can be useful and
utilized in other settings)
Pengagihan Jam Pembelajaran Pelajar / Distribution of Student Learning Time (SLT)
Teaching and Learning Activities
CLO*
Guided Learning Guided
Independen
Week Course Content Outline (please tick (√)) t SLT
(F2F) Learning
Learning
CLO1 CLO2 CLO3 CLO4 CLO5 L T P O (NF2F)
(NF2F)
1 Introduction to Pro Forma 2 1 2 5
Introduction to Data Structures
Basic concept of data structures 2 1 2 5
2 - The abstract data type (ADT)
- Algorithm efficiency
Linked List 2 2 4 8
3 - Basic properties
- Implementation (Insert, delete & sorting)
4 Double Linked List 2 2 4 8
- Basic properties
- Implementation (Insert, delete & sorting)
11 Stack 2 2 4 8
5 - Concept stack
- Implementation (insertion and deletion)
- Stack Application (Static and Dynamic)
6 Queue - Concept queue 2 2 4 8
- Implementation (insertion and deletion)
- Queue application (Static and Dynamic)
7 Searching 2 1 4 7
- Concept searching - Linear search
- Binary search
- Hashing chain
8 Sorting 2 1 4 7
- Concepts sorting
- Bubble sort
- Selection sort - Merge sort
- Quick sort
9 Mid Term Test 2 2 4
10-11 Tree 4 2 6 12
- Introduction to tree
- Tree traversal
- Binary search tree
- Balanced tree
12 Graph 2 1 4 7
- Introduction to graph
- Graph traversal
- Shortest Path Algorithm
13 Lab Test 1 2 3
14 Group Project Presentation 2 4 6
Jumlah 22 8 12 46 88
Total 88
M. M. Raghuwanshi. (2016). Algorithm and Data Structures. Alpha Science Intl Ltd.
Rujukan / References : (include required and Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser.(2014). Data Structures
13 further readings, and should be the most and Algorithms in Java 6th Edition. Wiley Publishing.
current)
Main, M. & Savitch, W. (2011). Data Structures and Other Object Using C++. Fourth
edition. New York : Pearson.
Gilberg, R.F & Forouzan, B. A, (2005), Data Structures: A Pseudocode Approach with C,
Second Edition,Course Technology.
Maklumat tambahan lain /
14
Other additional information :
15 PENGESAHAN / VERIFICATION
Tandatangan:
Signature: Tandatangan:
Signature:
Jawatan:
Jawatan:
Designation:
Designation:
(Ketua Jabatan/ TDA&A/Dekan)
(Penyelaras Kursus/ Course
(HOD/Deputy Dean
Coordinator)
(A&I)/Dean)
Tarikh: Tarikh:
Date: Date: