Universiti Malaysia Perlis • Computer Engineering

Introduction 1.1 History of Algorithms 1.2 Definition, Structure and Properties of Algorithms 1.3 Development of an Algorithm 1.4 Data Structures and Algorithms 1.5 Data Structure- Definition and Classification

Analysis of Algorithms 2.1. Efficiency of Algorithms 2.2. Apriori Analysis 2.3. Asymptotic Notations 2.4. Time Complexity of an Algorithm using O (big-O) notation

Analysis of Algorithms 2.5. Polynomial Vs Exponential Algorithms 2.6. Average, Best, and Worst-Case Complexities 2.7. Analyzing Recursive Programs

Arrays 3.1. Introduction 3.2. Array Operations 3.3. Number of Elements in an Array 3.4. Representation of Arrays in Memory 3.5. Applications

Stacks 4.1. Introduction 4.2. Stack Operations 4.3. Applications

Queues 5.1. Introduction 5.2. Operation of Queues 5.3. Circular Queues 5.4. Other types of Queues 5.5. Applications

Linked Lists 6.1. Introduction 6.2. Singly Linked Lists 6.3. Circular Linked Lists 6.4. Doubly Linked Lists 6.5. Operations on Linked Stack and Linked Queue 6.6. Dynamic Memory Management and Linked Stacks 6.7. Implementation of Linked Representations 6.8. Applications

Linked Lists 6.1. Introduction 6.2. Singly Linked Lists 6.3. Circular Linked Lists 6.4. Doubly Linked Lists 6.5. Operations on Linked Stack and Linked Queue 6.6. Dynamic Memory Management and Linked Stacks 6.7. Implementation of Linked Representations 6.8. Applications

Trees and Binary Trees 7.1. Introduction 7.2. Trees: Definition and Basic Terminologies 7.3. Representation of Trees 7.4. Binary Trees: Basic Terminologies and types 7.5. Representation of Binary Tree 7.6. Binary Tree Traversals 7.7. Applications

Graphs 8.1. Introduction 8.2. Definition and Basic Terminologies 8.3. Representation of Graphs 8.4. Graph Traversal 8.5. Applications