COURSE DESCRIPTION

NAME OF INSTITUTION Lahore Garrison University

PROGRAM (S) TO BE EVALUATED BS Software Engineering

Course Objective: The aim of this course is to cover basic and in-depth concepts of Data Structures
and Algorithm. Students will learn how data structures are helpful to solve different problems. It will
provide foundation in learning advanced algorithm analysis course. Student can use C++ language for
the purpose of implementation and they will learn generic concepts which will be used for developing
different software applications. The knowledge of C++ languages is expected as strong background.

Course Code CC-6313

Course Title Data Structure
Credit Hours 4(3+1)
Prerequisites by Programming Fundamentals
Course(s) and Topics
Grading Schema
Assignment: 10%
(homework, quizzes,
Quiz: 10%
midterms, final,
Class Participation: 5%
programming
Mid Term: 25%
assignments, lab work,
Final Term: 50%
etc.)
Course Coordinator/ Adnan Ahmed
Instructor(s)
Coordinator’s/ Qualifications: MS (CS)
Instructor’s Profile Areas of Interest: Artificial Intelligence, Machine Learning

Counselling Hours Thursday: 12:00 pm – 2:00 pm

Friday: 9:00 am – 11:00 am
2nd Flr Staff Room
Course Content Abstract data types, complexity analysis, Big Oh notation, Stacks (linked lists
 At the end of the course the students will be BT
PLO/GA
able to: Level*
1. Identify various data structures and their 1 C-2
CLO1
algorithms
and array2.implementations),
Analyze time andRecursion and analyzing
space complexities of recursive
2 algorithms,
C-4
CLO2
divide and
dataconquer algorithms,
structures Sorting algorithms (selection, insertion,
and algorithms
merge, quick, bubble, heap, shell, radix, bucket), queue, dequeuer, priority
3. Select appropriate algorithms to use 3 C-3
queues (linked and array implementations of queues), linked list & its
CLO3
in specific applications.
various types, sorted linked list, searching an unsorted array, binary search
for sorted 4. Compare tradeoffs in the design and
CLO 4 arrays, hashing and indexing, open addressing and 4
chaining, trees
C-4
and tree implementations
traversals, binaryof the data
search trees, heaps, M-way tress, balanced trees,
*graphs, breadth-first and depth-first traversal, topological order, shortest
BT = Bloom’s Taxonomy, C = Cognitive domain,
Ppath, adjacencydomain,
= Psychomotor matrixA = and adjacency
Affective domain list implementations, memory
management
*PLO1 and Education
= Academic garbage collection.
, *PLO2= Knowledge for Solving Computing Problems
Textbook *PLO3 = Problem
The aim of thisAnalysis
course*PLO4
is to =cover
Design/Development of Solutions
basic and in-depth concepts of Data
Structures and AlgorithMr. Students will learn how data structures are
helpful to solve different problems. It will provide foundation in learning
advanced algorithm analysis course. Student can use C++ language for the
purpose of implementation and they will learn generic concepts which will
be used for developing different software applications. The knowledge of C+
+ languages is expected as strong background.
Reference Material Nell Dale : C++ Plus Data Structures, Latest Edition, Jones & Bartlett
Data Structure using C/C++ by Mark Alan. Yadidyah Langsam, Moshe J.
Augenstein, Aaron M. Tenenbaum: Data Structures using C and C++.
Dr. Sohail Aslam: Data Structures Handouts.
Course Learning
Outcomes (CLOs):
Weeks Lectures Topics Covered CLOs Assessments
Course Overview, Introduction to Different Data 1
1 Structures. Data Types, Primitive Data types, Non –
Week-1 Primitive Data Types
Abstract data types, (ADT’s), Data Structures, Lists, ADT 1
2
List Operations
3 Complexity Analysis & Big Oh Notation 1 Quiz 1
Week-2
4 ADT Stacks, ADT Stack Operations and implementation 1 Assignment 1

Infix, Prefix, Postfix notation, Conversions. 1

5
Week-3 Postfix Expression Evaluation.
6 Recursion and analyzing recursive algorithms 2

Sorting algorithms(Selection sort, bubble sort ) 2 Class Activity

7
Week-4 1
8 Insertion sort , Quick sort 2

9 Intro. & Implementation of List as Singly Link List 2 Quiz 2

Week-5 Intro. & Implementation of List as Singly Link 2 Class Activity
10 2
List( Insertion and deletion function)
Solving stack problems using Link List Implementation 2
11
Week-6 of Queue as Singly Link List
12 Intro. & Applications of Doubly Link List (DLL) 2

13 Queue / Stack Operations implementation using DLL 2

Week-7 Intro. & Applications of Circular Link List (CLL) Queue / 2
14
Stack Operations implementation using CLL
Queue , Dequeue & its implementation using arrays
Week-8 1 Hour

15 Priority queues, Circular queues using arrays 2

Week-9
16 Mid Term Exam 2

Divide and conquer algorithms, Assignment 2

17 2
Week-
10 Binary Tree, Strictly Binary Tree, Complete Binary Tree
18 2

Week-
11 19
 Implementation of BST
3

20 3
Tree Traversal: Three Tick method
AVL Trees, Operations on AVL Tree Quiz 3
21 3
Week-
12 Heaps, Min Heaps, Max Heaps
22 3

Implementation of Heap sort Class Activity

23 3 3
Week-
13 Min Balanced BST, Max Balanced BST
24 3

Graphs, Types of Graphs

25 3
Week-
14 Adjacency matrix and adjacency list implementations Class Activity
26 3 4

Hashing. Hashing Techniques, Collisions & Collisions

27 3
Week- Avoidance Methods
15 Memory management and garbage collection
28 3

Hashing. Hashing Techniques, Collisions & Collisions Class Activity

5
29 Avoidance Methods 3
Week-
16
Presentations
30 1

Presentation
31 1
Week-
17 Final Term Exam
32 1

Laboratory Projects/Experiments Done in Lab is not associated with this course.

the Course However, ML-based programming
assignments and class tasks have been taken
 from the students.

Class Time Spent on (in credit hours) Theory Problem Solution

Analysis Design

01 01 01

Oral and Written Communications Physical presence in classroom and online

social interaction.
Modes for communication:
● Google Classroom
● WhatsApp Group
● LGU ERP Portal
Coordinator / Instructor(s) Name: Adnan Ahmed

Instructor Signature:

Date: 29 – May – 2024