Course Aims & Objectives:
The aim of the course is to introduce the concepts of data abstraction and common data structures and algorithms used in programming. A high level programming language will be used to demonstrate the implementation of some of these data structures. On completion of this course, students should be able to understand the applicability of these data structures and be able to implement them.

Units: 3

Level: B3

Medium of Instruction: English

Keyword Syllabus:
Techniques for Algorithm Design; Definitions of Data Structures: Arrays, Stacks and Queues; Linked Lists, Circular Lists, Double Linked Lists, Trees; Implementations and Applications of Data Structures; Searching Algorithms; Complexity Analysis.

Teaching Pattern: .
Duration of course: 1 semester
Current mix of lecture/tutorial/laboratory, other: 2 hrs. lecture; 1 hr. tutorial.

Assessment Pattern:
Examination duration: 2 hours
Percentage distribution of marks for coursework, examination, other: 40% CW, 60% Exam
Grading pattern: Standard (A+AA-...F)
For a student to pass the course, at least 30% of the maximum mark for the examination must be obtained.

Pre-requisite(s): Nil

Pre-cursor(s):
CS3350

Equivalent Course(s): Nil