Professional Documents
Culture Documents
1. General Management 1.1 Lecturer: Name: Office Phone: E-mail: Credit Unit:
Prof. Alan Oxley 05-3687517 alanoxley@petronas.com.my 3 2 hrs lecture and 2 hrs lab session per week
1.2
1.4
Prerequisites:
1.5
3-5pm
Lab
Lec/Tut
11-1pm
(01-02-04)
(01-00-05)
2-4pm
Lab
Friday
2. Course Description
This course covers the different types of data structures. It is aimed to improve the students skills in programming. Students will be exposed in different ways of data representation and information and applying them to solve various problems. A detailed coverage of all fundamental data structures will be presented: stacks, queues, lists, trees and graphs.
3. Learning Outcomes
At the end of the course, students should be able to: 3.1 Learn how to define, analyze and apply suitable data structures and algorithms. Become proficient at implementing (using C++) the common data structures and algorithms used by professional software engineers. Translate the developed algorithm into a working program using programming language.
3.2
3.3
4. Course Outline
No. Topics Notes
Introduction
1 Review of Basic Control Structures
1 week
1 week 2 weeks 2 weeks 2 weeks 2 weeks 2 weeks 1 week
Basic
2 3 4 5
Advanced
6 7 8
Array and Function String and Vector Linked List Stack, Queue
Searching Sorting Trees
5. Textbook / Reference:
5.1 Data Structures Using C++, D.S Malik
5.2
Objects, Abstraction, Data Structures and Design Using C++, Elliot B. Koffman, Paul A.T. Wolfgang
Assessment Task
Lab Exercises Written Tests
% Contribution
20 30
50 100%
7.
Grading
B C+
C D+ D F
65 - 74 55 - 64
50 54 45 49 40 44 0 - 39
ENROLMENT KEY(e-Learning):
TCB1063
How to Study? 1 Learn by doing it. 2 Start learning from the first week. 3 Practice, practice, practice in labs. 4 Solve and understand there and then.
Teaching Style