UNIVERSITI TUN HUSSEIN ONN MALAYSIA FAKULTI SAINS KOMPUTER DAN TEKNOLOGI MAKLUMAT PERANCANGAN KULIAH LECTURE PLAN. Minggu (Week)

Size: px

Start display at page:

Download "UNIVERSITI TUN HUSSEIN ONN MALAYSIA FAKULTI SAINS KOMPUTER DAN TEKNOLOGI MAKLUMAT PERANCANGAN KULIAH LECTURE PLAN. Minggu (Week)"

Abigayle Claribel Long
6 years ago
Views:

UNIVERSITI TUN HUSSEIN ONN MALAYSIA FAKULTI SAINS KOMPUTER DAN TEKNOLOGI MAKLUMAT PERANCANGAN KULIAH LECTURE PLAN MAKLUMAT MATA PELAJARAN (SUBJECT INFORMATION) SEMESTER/SESI (SEMESTER/SESSION) : 2

1 UNIVERSITI TUN HUSSEIN ONN MALAYSIA FAKULTI SAINS KOMPUTER DAN TEKNOLOGI MAKLUMAT PERANCANGAN KULIAH LECTURE PLAN MAKLUMAT MATA PELAJARAN (SUBJECT INFORMATION) SEMESTER/SESI (SEMESTER/SESSION) : /2012 KOD MATA PELAJARAN (SUBJECT CODE) : BIT 1073/BIT NAMA MATA PELAJARAN (NAME OF SUBJECT) : DATA STRUCTURE AND BEBAN AKADEMIK PELAJAR (STUDENT ACADEMIC LOAD) : Aktiviti Pembelajaran (Learning Activity) Minggu (Week) Jam/Minggu (Hour /Week) ALGORITHMS Bilangan Jam / Semester (Hour/Semester) Kuliah (Lecture) Tutorial (Tutorial) Amali (Practical) Pembelajaran Kendiri (Independent Study) Lain-lain (Others) 1. Penilaian Formal (Penilaian Berterusan & Peperiksaan Akhir) 2. Pembelajaran Berpusatkan Pelajar (SCL) JUMLAH JAM BELAJAR (JJB) TOTAL STUDENT LEARNING TIME (SLT) Matapelajaran Pra-syarat (Pre requisite subjects) : BIT 1033 / BIT 10303: COMPUTER PROGRAMMING Nama Pensyarah (Lecturer s name) : MOHD ZAKI BIN MOHD SALIKON (P) DR. SHAHREEN BINTI KASIM NORHANIM BINTI SELAMAT MUHAMMAD ADIB BIN KHALAPIAH HAZWANI BINTI RAHMAT Disediakan oleh (Prepared by) : Tandatangan (Signature) : Nama (Name) : Mohd Zaki Bin Mohd Salikon Tarikh (Date): 13 February 2012 Disahkan oleh (Approved by) : Tandatangan (Signature) : Nama (Name) : Dr. Mohd Najib Bin Mohd Salleh Tarikh (Date): 13 February 2012

2 MATLAMAT (GOALS) : To provide students with a good understanding on data structures and their implementation. SINOPSIS (SYNOPSIS) : This course introduces students to data concept, data structure and types of data structure, array, pointer, abstract data type, searching, sorting, trees and graph. HASIL PEMBELAJARAN (LEARNING OUTCOMES) : By the end of the course, students should be able to : 1. design problem solving process using data structure techniques. (C5, CTPS) 2. construct a computer application using data structure techniques. (P4, Practical Skill) 3. demonstrate the implementation of data structure techniques in any high level programming language. (A3, LL) ISI KANDUNGAN (CONTENT) : MINGGU (WEEK) KANDUNGAN (CONTENT) DATA TYPE AND ABSTRACT DATA TYPE 1.1 Data Types 1.2 Array 1.3 Pointer DATA TYPE AND ABSTRACT DATA TYPE 1.4 Abstract Data Type 1.5 Object 1.6 Class 1.7 Supporting Programming Language DATA STRUCTURE 2.1 Introduction to Structure of Data Type 2.2 Stack 2.3 Queue 2.4 Recursive DATA STRUCTURE 2.5 Sorting 2.6 Searching 2.7 Tree 2.8 Graph LINKED LIST 3.1 Linked List Concept 3.2 Type of Linked List LINKED LIST 3.3 Linked List Operation STACK 4.1 Introduction to Stack 4.2 Stack Implementation 4.3 Stack Operation PENTAKSIRAN (ASSESSMENT) Quiz 1 PROJECT/ASSIGNMENT TEST

3 MID SEMESTER BREAK QUEUE 5.1 Introduction to Queue 5.2 Linear Queue 5.3 Circular Queue 5.4 Queue Implementation 5.5 Queue Operation SEARCHING AND SORTING 6.1 Big Oh Notation 6.2 Bubble Sort 6.3 Insertion Sort 6.4 Selection Sort 6.5 Quick Sort 6.6 Merge Sort SEARCHING AND SORTING 6.7 Sequences Searching 6.8 Binary Searching 6.9 Sorting and Searching Technique Analysis TREE 7.1 Introduction to Tree and Binary Tree 7.2 Traversing a Binary Tree TREE 7.3 Binary Tree Searching (Insertion, Deletion and Develop) 7.4 Binary Tree Operation GRAPHS 8.1 ADT Graph 8.2 Traversal Graph 8.3 Depth-first and Breadth-first Algorithms GRAPHS 8.4 Shortest Paths 8.5 Best-first FINAL EXAMINATION Quiz 2 PROJECT PRESENTATION TUGASAN / PROJEK (ASSIGNMENT / PROJECT) (i) (ii) (iii) Tugasan (Assignment) The task is developing a small system based on scenario given using C language. Projek (Project) The task is developing a small system based on scenario given using C language. Amali (Practical) MINGGU AMALI (WEEK) (CONTENT) 2 DATA TYPE AND ABSTRACT DATA TYPE Data Types, Array. Pointer PERKAKASAN/PERISIAN Personal Computer Borland C/Turbo C

4 3 DATA TYPE AND ABSTRACT DATA TYPE Struct 4 DATA STRUCTURE Recursive 5 LINKED LIST Linked List Operation 6 STACK Stack Operation 7 QUEUE Queue Operation 8 SORTING Bubble, Selection, Insertion, Quick, Merge Sort 9 SEARCHING Sequences, Binary Searching 10 TREE Traversing a Binary Tree Binary Tree Operation 11 GRAPHS Depth-first and Breadth-first Algorithms 12 GRAPHS Shortest Paths Best-first 13 PROJECT PRESENTATION PENILAIAN (ASSESSMENT) : Kerja Kursus (Coursework) Peperiksaan Akhir (Final Examination) Perkara (Item) Domain Pemberat (Weightage) Kuiz (Quiz) Kognitif (Cognitive) 5 % Ujian (Test) Kognitif (Cognitive) 20 % Psikomotor Projek (Project) / 20 % (Psychomotor) Tugasan Afektif (Assignment) 15 % (Affective) Peperiksaan Akhir Kognitif (Final Examination) (Cognitive) 40 % JUMLAH (TOTAL) 100 % Elemen (Element) Pengetahuan (Knowledge) Praktikal (Practical) KI (Soft-skills) Pengetahuan (Knowledge) RUJUKAN (REFERENCES) : 1. Malik D.S C++ programming: program design including data structures. Course Technology/Cengage Learning. 2. Karumanchi N Data structures and Algorithms Made Easy. Bombay: CareerMonk Publications. 3. Weiss M.A Data Structures and Algorithm Analysis in C++, Pearson Addison Wesley. 4. I. Chai & J. D. White Structuring Data and Building Algorithms -- an ANSI-C based approach. McGraw-Hill Education. 5. Zainuri M. S. et al Modul Struktur Data, Kuittho. 6. Clifford A. S A Practical Introduction to Data Structures and Algorithm Analysis Third Edition (C++ Version).

5 KEHADIRAN / PERATURAN SEMASA KULIAH (LECTURE ATTENDANCE / REGULATION) (1) Pelajar mesti hadir tidak kurang dari 80% masa pertemuan yang ditentukan bagi sesuatu mata pelajaran termasuk mata pelajaran Hadir Wajib (HW) dan mata pelajaran Hadir Sahaja (HS). Students must attend lectures not less than 80% of the contact hours for every subject including Compulsory Attendance Subjects (Hadir Wajib HW) and Attendance Only Subjects (Hadir Sahaja HS) (2) Pelajar yang tidak memenuhi perkara (1) di atas tidak dibenarkan menghadiri kuliah dan menduduki sebarang bentuk penilaian selanjutnya. Markah sifar (0) akan diberikan kepada pelajar yang gagal memenuhi perkara (1). Manakala untuk mata pelajaran Hadir Wajib (HW), pelajar yang gagal memenuhi perkara (1) akan diberi Hadir Gagal (HG). Students who do not fulfill item (1) will not be allowed to attend further lectures and sit for any further examination. Zero mark (0) will be given to students who fail to comply with item (1). While for Compulsory Attendance Subjects (Hadir Wajib HW), those who fail to comply with item (1) will be given Failure Attendance (Hadir Gagal HG). (3) Pelajar perlu mengikut dan patuh kepada peraturan berpakaian yang berkuatkuasa dan menjaga disiplin diri masing-masing untuk mengelakkan dari tindakan tatatertib diambil terhadap pelajar. Students must obey all rules and regulations of the university and must discipline themselves in order to avoid any disciplinary actions against them. (4) Pelajar perlu mematuhi peraturan keselamatan semasa pengajaran dan pembelajaran. Student must obey safety regulations during learning and teaching process. MATRIK HASIL PEMBELAJARAN SUBJEK DAN HASIL PEMBELAJARAN PROGRAM (SUBJECT LEARNING OUTCOMES AND PROGRAMME LEARNING OUTCOMES MATRIX) Dilampirkan (Attached)

6 Course Learning Outcome and Programme Learning Outcome Matrix Faculty: Fakulti Sains Komputer dan Teknologi Maklumat Programme: BIT Subject: Data Structure And Algorithms Code: BIT 1073/ BIT Compliance to PLO Course Learning Outcomes LO-1 LO-2 LO-3 LO-4 LO-5 LO-6 LO-7 LO-8 LO-9 Delivery Assessment Design problem solving process using data structure techniques. (C5, CTPS) C5 Lectures, SCL Quiz, Test, Final Exam Key Performance Indicator (KPI) 30 % - Grade C and above Construct a computer application using data structure techniques. (P4, Practical Skill) P4 Lectures, Lab, SCL Assignment, Project 80% - Submit assignment on time 30% - Get 40 marks Demonstrate the implementation of data structure techniques in any high level programming language. (A3, LL) A3 Lectures, SCL Presentation 50% - Present their project Total Level of Learning Taxonomy Psychomotor Cognitive Affective P1 Perception C1 Knowledge A1 Receiving P2 Set C2 Comprehension A2 Responding P3 Guided Response C3 Application A3 Valuing P4 Mechanism C4 Analysis A4 Organising P5 Complex Overt Response C5 Synthesis A5 Internalising P6 Adaptation C6 Evaluation 1= substantial contribution to outcome 2= moderate contribution to outcome P7 Organization

UNIVERSITI TUN HUSSEIN ONN MALAYSIA FAKULTI SAINS KOMPUTER DAN TEKNOLOGI MAKLUMAT PERANCANGAN KULIAH LECTURE PLAN MAKLUMAT KURSUS (COURSE INFORMATION)

UNIVERSITI TUN HUSSEIN ONN MALAYSIA FAKULTI SAINS KOMPUTER DAN TEKNOLOGI MAKLUMAT PERANCANGAN KULIAH LECTURE PLAN MAKLUMAT KURSUS (COURSE INFORMATION) SEMESTER / SESI (SEMESTER / SESSION) : II/ 2016/2017