PRANVEER SINGH INSTITUTE OF TECHNOLOGY, KANPUR

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Odd Semester 2023-24

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 to be
*Level of Bloom’s Taxonomy Level to be met
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 No. Lab Experiment Corresponding CO

1 Implementing sorting techniques. CO1

2 Implementing searching techniques. CO1

3 Implementing linked list CO1

4 Implementing circular linked list, doubly linked list. CO3

5 Implementing reversal of linked list. CO1

6 Implementing polynomial addition using linked list CO2

7 Implementing stacks using array and linked list. CO3

Implementing conversion from infix notation to postfix
8 CO2
notation.
9 Implementing ordinary queue using array and linked list. CO3
Implementing circular queue, double ended queue and
10 CO3
priority queue.
Implementing binary tree traversal and construction of tree
11 CO2
using inorder and preorder traversals.
Implementing binary serach tree including insertion and
12 CO1
deletion in BST.
Implementing AVL tree including insertion and deletion in
13 CO1
AVL tree.
Implementing heap sort to compare with other sorting
14 CO3
techniques.
15 Implementing BFS and DFS in graphs. CO1
Implementing minimum spanning trees including prim’s
16 CO3
and kruskal’s MST.
Implementing shortest path algorithms to compare single
17 CO3
source shortest path and all pairs shortest path.
18 Implementing traversal in threaded binary trees. CO1

19 Implementing Huffman coding using Binary tree. CO2

Implementing Hanoi towers using recursion to compare
20 CO3
iterative and recursive methods.
 INDEX
S Date of Date of Faculty
Lab Experiment Marks
No Experiment Submission Signature

Implementing sorting techniques.

1

Implementing searching techniques.

2

Implementing linked list

3

Implementing circular linked list, doubly

4 linked list.

Implementing reversal of linked list.

5

Implementing polynomial addition using

6 linked list

Implementing stacks using array and linked

7 list.

Implementing conversion from infix notation

8 to postfix notation.

Implementing ordinary queue using array and

9 linked list.

Implementing circular queue, double ended

10 queue and priority queue.
Implementing binary tree traversal and
11 construction of tree using inorder and preorder
traversals.
Implementing binary serach tree including
12 insertion and deletion in BST.

Implementing AVL tree including insertion

13 and deletion in AVL tree.

14 Implementing heap sort.

15 Implementing BFS and DFS in graphs.

Implementing minimum spanning trees

16 including prim’s and kruskal’s MST.
Implementing shortest path algorithms to
17 compare single source shortest path and all
pairs shortest path.
Implementing traversal in threaded binary
18 trees.
 Implementing Huffman coding using Binary
19 tree.

Implementing Hanoi towers using recursion to

20 compare iterative and recursive methods.