Course Description
Introduction to data structures & algorithm involving problem solving, algorithm concept and data structure concept, recursive & algorithm efficiency, sorting algorithms, divide and conquer, quick sort operation, implementation, and quick sort analysis, merge sort operation, implementation, and merge sort analysis, hash table, introduction to tree and binary search tree.
Course Objectives
The aim of this module is to show how to measure algorithm efficiency and the meaning of “big O notation, use characteristics of recursive in solving a problem. Understand Searching and sorting technique concept. Finally, Tree concept and term related to tree, the characteristics of general tree, binary tree and binary search tree, basic operation of tree.
Course Components
Introduction to Data Structures & Algorithm
Recursive & Algorithm Efficiency
Sorting Algorithms
Bubble Sort
Selection Sort
Insertion Sort
Heap sort
Merge Sort
Quick Sort
Searching Techniques
Introduction & Sequential Search
Binary Search
Binary Search Tree
Text book
Title: Introduction to algorithms
Author(s)/Editor(s): T. Cormen, C. Leiserson, R. Rivest and C. Srein
Publisher: MIT press
ISBN: 0262032937
In addition to the above, the students will be provided with handouts by the lecturer.
Learning Outcomes
Knowledge and understanding
Cognitive skills (thinking and analysis)
Communication skills (personal and academic)
Practical and subject specific skills (Transferable Skills)
Assessment Instruments
Makeup Policy
No missed tests without prior excuse. Each case will be handled separately based on its own merits. Makeup tests will be much more difficult than regularly scheduled tests. Each student is responsible for what is covered and assigned in any classes which they miss. Abuse of this policy will result in a loss of leniency.
Note that:
·This syllabus may change as the course progresses