PRANVEER SINGH INSTITUTE OF TECHNOLOGY, KANPUR

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Odd Semester 2024-25

B. Tech.- Second Year

Semester - III

Lab File
Data Structure
(BCS351)

Submitted To : Submitted By :
Faculty Name :_________________ Name :_________________
Designation :_________________ Roll No. :_________________
Section :_________________
 Table of Contents
• Vision and Mission Statements of the Institute

• Vision and Mission Statements of the Department

• PEOs, POs, PSOs of the Department

• Course Objective and Outcomes

• List of Experiments

• Index
 Department Vision Statement
To be a recognized Department of Computer Science & Engineering that produces versatile
computer engineers, capable of adapting to the changing needs of computer and related industry.

Department Mission Statements

The mission of the Department of Computer Science and Engineering is:

i. To provide broad based quality education with knowledge and attitude to succeed in Computer
Science & Engineering careers.

ii. To prepare students for emerging trends in computer and related industry.

iii. To develop competence in students by providing them skills and aptitude to foster culture of
continuous and lifelong learning.

iv. To develop practicing engineers who investigate research, design, and find workable solutions to
complex engineering problems with awareness & concern for society as well as environment.

Program Educational Objectives (PEOs)

i. The graduates will be efficient leading professionals with knowledge of computer science &
engineering discipline that enables them to pursue higher education and/or successful careers in
various domains.

ii. Graduates will possess capability of designing successful innovative solutions to real life problems
that are technically sound, economically viable and socially acceptable.

iii. Graduates will be competent team leaders, effective communicators and capable of working in
multidisciplinary teams following ethical values.

iv. The graduates will be capable of adapting to new technologies/tools and constantly upgrading
their knowledge and skills with an attitude for lifelong learning
 Department Program Outcomes (POs)
The students of Computer Science and Engineering Department will be able:

1. Engineering knowledge: Apply the knowledge of mathematics, science, Computer Science &
Engineering fundamentals, and an engineering specialization to the solution of complex
engineering problems.

2. Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and Computer Science & Engineering sciences.

3. Design/development of solutions: Design solutions for complex Computer Science &

Engineering problems and design system components or processes that meet the specified needs
with appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.

4. Investigation: Use research-based knowledge and research methods including design of

experiments, analysis and interpretation of data, and synthesis of the information to provide valid
conclusions.

5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modelling to complex Computer Science &
Engineering activities with an understanding of the limitations.

6. The Engineering and Society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent responsibilities relevant
to the professional engineering practice in the field of Computer Science and Engineering.

7. Environment and sustainability: Understand the impact of the professional Computer Science
& Engineering solutions in societal and environmental contexts, and demonstrate the knowledge
of, and need for sustainable development.

8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the Computer Science & Engineering practice.

9. Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.

10. Communication: Communicate effectively on complex Computer Science & Engineering

activities with the engineering community and with society at large, such as, being able to
comprehend and write effective reports and design documentation, make effective presentations,
and give and receive clear instructions.

11. Project management and finance: Demonstrate knowledge and understanding of the
Computer Science & Engineering and management principles and apply these to one’s own work,
as a member and leader in a team, to manage projects and in multidisciplinary environments.

12. Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.
 Department Program Specific Outcomes (PSOs)
The students will be able to:

1. Use algorithms, data structures/management, software design, concepts of programming

languages and computer organization and architecture.

2. Understand the processes that support the delivery and management of information systems
within a specific application environment.

Course Outcomes

*Level of Bloom’s *Level of Bloom’s Level to be

Level to be met
Taxonomy Taxonomy Met
L1: Remember 1 L2: Understand 2
L3: Apply 3 L4: Analyze 4
L5: Evaluate 5 L6: Create 6

CO Number Course Outcomes

BCS-351.1 Express [L2: Understand] an algorithm to implement it in C language.
BCS-351.2 Employ [L3: Apply] an algorithm to solve a computational problem.
BCS-351.3 Analyze [L4: Analyze] an algorithm to solve a computational problem.
 List of Experiments

Lab Corresponding
Lab Experiment
No. CO
Implementation of sorting techniques (Insertion, Selection, Bubble, Quick,
1 CO1
Merge and Counting Sort)
Implementation of searching techniques (Linear, Binary Search - Iterative
2 CO1
and Recursive)
Implementation of singly linked list (Insertion and Deletion – at beginning,
3 at end and at any specific location, Traversal In-order, Traversal in Reverse CO1
Order, Searching a Data)
Implementation of circular linked list and doubly linked list (Insertion and
4 CO3
Deletion – at beginning, at end and at any specific location, Traversal).
5 Implementation of polynomial addition and merging of two linked lists. CO2
6 Implementation of stack using array and linked list. CO3
Implement using Stack-
a) Conversion of infix notation to postfix notation.
7 CO2
b) Evaluation of postfix expression.
c) Balancing of parenthesis.
8 Implementing Towers of Hanoi using recursive functions. CO3
9 Implementation of linear queue using array and linked list. CO3
10 Implementation of circular queue, double ended queue and priority queue. CO3
Implementation of operations on binary search tree (Create, Insert a node,
Delete a node, Traversal – In order, Pre order and Post order, Counting total
11 number of nodes, Counting number of internal nodes, Counting number of CO2
external nodes, Finding height of tree, Finding smallest node and Finding
largest node).
Implementation of Heap sort covering the operations (Build Max/Min
12 CO3
Heap, Reheap Up, Reheap Down, Insert an element, Delete an element).
Implementation of Graph Traversal Techniques - Breadth First Search
13 CO1
(BFS) and Depth First Search (DFS).
Implementation to find minimum spanning trees using-
14 a) Prim’s Algorithm. CO3
b) Kruskal’s Algorithm.
Implementation to find shortest path using-
15 a) Dijkstra’s Algorithm. CO3
b) Floyd-Warshal’s Algorithm.
 INDEX
Date of Date of Faculty
S.No Lab Experiment Marks
Experiment Submission Signature
Implementation of sorting techniques (Insertion,
1 Selection, Bubble, Quick, Merge and Counting
Sort)
Implementation of searching techniques (Linear,
2
Binary Search - Iterative and Recursive)
Implementation of singly linked list (Insertion
and Deletion – at beginning, at end and at any
3
specific location, Traversal In-order, Traversal in
Reverse Order, Searching a Data)
Implementation of circular linked list and doubly
4 linked list (Insertion and Deletion – at beginning,
at end and at any specific location, Traversal).
Implementation of polynomial addition and
5
merging of two linked lists.
Implementation of stack using array and linked
6
list.
Implement using Stack-
a) Conversion of infix notation to postfix
7 notation.
b) Evaluation of postfix expression.
c) Balancing of parenthesis.
Implementing Towers of Hanoi using recursive
8
functions.
Implementation of linear queue using array and
9
linked list.
Implementation of circular queue, double ended
10
queue and priority queue.
Implementation of operations on binary search
tree (Create, Insert a node, Delete a node,
Traversal – In order, Pre order and Post order,
11 Counting total number of nodes, Counting
number of internal nodes, Counting number of
external nodes, Finding height of tree, Finding
smallest node and Finding largest node).
Implementation of Heap sort covering the
operations (Build Max/Min Heap, Reheap Up,
12
Reheap Down, Insert an element, Delete an
element).
Implementation of Graph Traversal Techniques -
13 Breadth First Search (BFS) and Depth First
Search (DFS).
Implementation to find minimum spanning trees
using-
14
a) Prim’s Algorithm.
b) Kruskal’s Algorithm.
Implementation to find shortest path using-
15 a) Dijkstra’s Algorithm.
b) Floyd-Warshal’s Algorithm.