Course Outlines:

Introduction: data structures, data structure operations, mathematical notations and functions, String Processing: basic terminology, strong strings, character data types, string operations, word processing; Linear Data Structures: arrays, records, pointers, linked lists, stacks, recursions, queues and their applications; Nonlinear Data Structures: trees, graphs and their applications; Sorting, Searching and Hashing. [Prerequisite: CIS 122].

Course Type: Theory

Course Objectives:

1. To learn different types, classifications and operations of data structure.

2. To learn about different linear (array, stack, queue, linked list) and non-linear (tree, graph) data structure as well as sorting, searching techniques.

3. To implementation in real life applications. 

• Lecture 02 (insert, delete, update in array)


• Lecture 03 (Linear Search)


• Lecture 04 (Binary Search)


• Lecture 05 (Stack)


• Lecture 06 (Queue)


• Lecture 09 (Graph)