Sarhad University of Science & IT
Department of Electrical Engineering
COURSE PARTICULARS
Course Title: Data Structure and Algorithms Lab. Course Code: CS221L
Offered to: BSc EE Credit Hours: 0-1
Semester: 3rd Session: Fall 2023
Pre requisite: Programming Fundamentals Lab.
COURSE INSTRUCTOR
Instructor: Engr. Noman Muslim E mail: [email protected]
COURSE DISCRIPTION
Introduction of basic data types and functions, arrays, structures, linked lists,
vectors, stacks, queues, tree. Implementations of different algorithms
(including stack, queue, sorting algorithms, tree traversal algorithms, graph
algorithms and dynamic programming).
COURSE OBJECTIVES
To understand and simulate
1. Different types of data structure and its operations.
2. Different types of algorithms and its operations.
COURSE LEARNING OUTCOMES
After completion of this course, the student will be able to:
S.No Course learning outcome PLO Domain Taxonomy
Understand the simulation of
CLO 1 fundamental data structures and 3 Psychomotor 2
algorithms.
Apply and simulate various algorithms
using different data structures in a 3 Psychomotor 3
CLO 2
programming language.
S.NO. Name of Experiment CLO
1 Develop a C++ program that demonstrate and simulate CLO-1
conditional statements, loops, nested loops.
2 Develop C++ programs that display the Array elements in CLO-1
reverse order using Functions.
3 Review & Learning about user define Functions CLO-1
4 Develop and execute a C++ program for Classes and Objects. CLO-1
5 Generate a C++ code that traverse and insertion/deletion CLO-1
in/from arrays.
6 Matrix addition, subtraction and multiplication using multi- CLO-1
dimensional arrays.
7 Traversing, Insertion and deletion in single linked list. CLO-2
8 Implementation of Stack in C++. CLO-2
9 Implementation of Queue data structure in C++. CLO-2
10 Implementation of linear and binary search algorithms in C++. CLO-2
11 Implementation of binary tree and its breadth- depth traversal CLO-2
methods in C++.
12 Implementation of Bubble sort and Insertion sort algorithms in CLO-2
C++.
13 Implementation of Quick sort algorithm in C++. CLO-2
14 Open Ended Lab CLO-2
COURSE WEEKLY DISTRIBUTION
GRADING SYSTEM FOR THE COURSE
The course will be graded as follows:
Midterm 20%
Final term 40%
Lab Report rubrics 20%
Open Ended Lab 10%
Viva 10%
Total: 100%
TEXT BOOK AND READING MATERIALS
Data Structure and Algorithms Lab. Manual
