BARANI INSTITUTE OF SCIENCES, (Sahiwal Campus)

CS-443 - Data Structures and Algorithms Credit Hours: 4(3-2)

Week # Lecture # Topics Covered Category Weightage

Introduction
1 Introduction to Data Structures- Need and Significance Core 3
Review of the Pre-requisite Knowledge, Standard
Problem Solving,
1 Problem Solving, Standard 3
OO Design and Implementation, Standard
2
Algorithms- Implementation and Testing, Standard
Practical Fundamental OO Design and Implementation
Standard
Practice
Review Continued
Review Continued:
Standard 3
Inheritance,
3
Aggregation and Composition, Standard
Mutable and Immutable Objects , Standard
Abstraction, Standard
Abstract Data Types
2 Concrete and Abstract Data Types, Standard 3
Class invariants, Standard
and pre-and post conditions, Standard
4 Polymorphism. Standard
Practical Aggregation and Composition Practice
Exercises Standard
Interfaces and Abstract Classes,
Polymorphism, Standard
Arrays
Arrays (basic and Object types) Standard 3
5
Algorithms on arrays, Standard
3 Sequential and Binary Searches, Standard
Arrays
6 Multi-dimensional Arrays ±applications and algorithms, Standard 3
Practical Exception Handling. Standard
Complexity Analysis
7 Complexity Analysis, Core 3
4 Algorithm time and space complexity trade offs. Core
Complexity Analysis
8 Practical Sequential Searching in Single and Multi-
Core 3
dimensional Arrays
Linked List
Linked List ±Operations and Representations, Core 3
9 Variations of Linked Lists (doubly, circularly) Core
Applications ±Polynomials, Core
5 Sparse Matrices, Core
Linked List
Dynamic Memory Allocation. Standard 3
10
Practical Doubly Circularly Linked List Implementation
Standard
and associated operations.
Stacks
Stacks: Basic functions, Core 3
6 11
Static and Dynamic Representations, Core
Stack Applications ±Arithmetic Expression, Core
 BARANI INSTITUTE OF SCIENCES, (Sahiwal Campus)
CS-443 - Data Structures and Algorithms Credit Hours: 4(3-2)

Week # Lecture # Topics Covered Category Weightage

post-fix and pre-fix notations
Infix, Core 4
post-fix and pre-fix notations, Core
6 12
in-to post transformation and post-fix evaluation, Core
Practical Linked List Implementation of Stack
Core
Using stack to evaluate post fix expression.
Queues
Queues: Basic Functions, Core 3
13
Static and Dynamic Representations, Core
7 Queue Variations (Deque), Core
Queues
Queue Applications ±OS process and Message queues. Standard 4
14
Practical Queue Implementation
Standard
Using queue for a real-life problem.
Hash Tables
15 Hash Tables ±representation, Core 3
Collision Resolution Algorithms and Applications. Core
8
Hash Table
16 Practical Implementation of some hash functions, Standard 3
Practical Implementation of some hash functions. Standard
Mid Term Examination
9
Mid Term Examination
Recursion
Recursion,
Core 3
17 Complexity of Recursive Algorithms,
Applications of Recursion ±Fibonacci Numbers and the
Core
Moivre
10 Recusion
Formula, Standard 3
18 Tower of Hanoi, Standard
Permutations, Standard
Practical Implementation of Recursive Algorithms Standard
Trees
Trees: Introduction and terminology, Core 3
19
binary trees and types, Core
tree traversals, Core
11 Binary Tree representation
Binary Tree representation, Core 4
20 basic operations . Core
Practical Binary Tree implementation with basic
Core
operations.
AVL Trees
21 Binary Search trees and Representation and operations, Core 4
AVL Trees, Core
12
AVL Tree
22 Multiway and B-tree ±Discussion only. Core 3
Practical AVL Tree Implementation. Core
Heaps and Priority Queues
13 23 Heaps and Priority Queues and Associated Algorithms, Standard 3
Huffman Codes. Standard
 BARANI INSTITUTE OF SCIENCES, (Sahiwal Campus)
CS-443 - Data Structures and Algorithms Credit Hours: 4(3-2)

Week # Lecture # Topics Covered Category Weightage

Heap sort
13 24 Practical Heap Implementation
Standard 3
Heap sort.
Sorting Algorithms
25
Sorting Algorithms and complexity Analysis. Core 3
14 Sorting Algorithms
26 Practical Implementation of bubble sort, Merge sort,
Core 2
count sort,.
Sorting Algorithms
27
Sorting Algorithms and complexity Analysis Core 3
15 Sorting Algorithms
28 Practical Implementation of bubble sort, Merge sort,
Core 4
count sort.
Graphs
Graphs: terminology, Standard 3
29 operations and representation
Graph traversals and searching algorithms (BFS-DFS) Standard
16 Weighted Graphs,
Graphs
Dikstra¶s Algorithms. Standard 4
30
Practical Graph implementation using Adjacency List
Standard
and search algorithms.
Presentations
31
Student Presentations. Standard 3
17
Student Presentations.
32
Student Presentations. Standard 3
Final Term Examination
18
Final Term Examination

Course Objectives

Learning Outcomes

Recommended Study Material

Evaluation Policy
Quizz
- qeasdasdasdas
- asdadasdasd
- Quizzes will be unannounced.
Assignment
- Assignment will be of 20 marks.
Project Work
- adadasdas
- asdqewqwesfsfsd
- Project presentation on multimedia.
 BARANI INSTITUTE OF SCIENCES, (Sahiwal Campus)
CS-443 - Data Structures and Algorithms Credit Hours: 4(3-2)

Week # Lecture # Topics Covered Category Weightage

Course Evaluation

%age Marks
Mid 22.5% 18
Assignments / Quiz 15.0% 12
Final 37.5% 30
Practical 25.0% 20
Total 100% 80