Scribd
Upload
16 views2 pages

Data Structures Lecture Schedule

The document outlines the course structure for 'Data Structure and Algorithm' at Alhamd Islamic University for the Fall 2025 semester. It includes course learning outcomes, topics covered in lectures, and prerequisites. The course aims to equip students with practical skills in data structures, algorithm analysis, and their applications.

Uploaded by

Riaz Ahmad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
16 views2 pages

Data Structures Lecture Schedule

The document outlines the course structure for 'Data Structure and Algorithm' at Alhamd Islamic University for the Fall 2025 semester. It includes course learning outcomes, topics covered in lectures, and prerequisites. The course aims to equip students with practical skills in data structures, algorithm analysis, and their applications.

Uploaded by

Riaz Ahmad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

ALHAMD ISLAMIC UNIVERSITY

Department of Computer Science


Semester: FALL-2025
Course Title: Data Structure and Algorithm Class: BSCS-S-2024 (III)
Course Code: CS-314 Pre-requisites: Object Oriented Program
Credit Hours: 4 (3-1) Contact Hours: 3-1
Course Learning Outcomes:
CLO-1: Implement various data structures and their algorithms and apply them in implementing simple applications
CLO-2: Analyze simple algorithms and determine their complexities.
CLO-3: Apply the knowledge of data structure to other application domains.
Lecture No. Topic
1 Abstract Data Types
2 Complexity Analysis
3 Big Oh Notation
4 Stacks: Linked List and Array
Implementations
5 Recursion and Recursive Algorithm
Analysis
6 Divide and Conquer Algorithms
7 Sorting: Selection and Insertion Sort
8 Sorting: Merge and Quick Sort
9 Sorting: Bubble, Heap, Shell Sorts
10 Sorting: Radix and Bucket Sorts
11 Queue and Deque
12 Priority Queues (Linked and Array
Implementations)
13 Linked List and its Types
14 Sorted Linked List
15 Searching an Unsorted Array
16 Binary Search for Sorted Arrays
17 Hashing and Indexing
18 Open Addressing and Chaining
19 Trees and Tree Traversals
20 Binary Search Trees
21 Heaps and M-way Trees
22 Balanced Trees
23 Graphs: Introduction
24 Graph Traversals: BFS and DFS
25 Topological Order
26 Shortest Path Algorithms
27 Adjacency Matrix Implementation
28 Adjacency List Implementation
29 Memory Management
30 Garbage Collection
31 Course Review and Practical Q&A
32 Final Assessment Discussion

You might also like