IMS ENGINEERING COLLEGE

Data Structures Lab

(BCS-351)

B.TECH – II YEAR
(ODD SEM 2025-2026)

Name

Roll No.

Section-Batch
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

IMS ENGINEERING COLLEGE

(Affiliated to Dr A P J Abdul Kalam Technical University, Lucknow )
Approved by AICTE - Accredited by NAAC – ‘A’ Grade
NH#24, Adhyatmik Nagar, Ghaziabad, UP, India
www.imsec.ac.in

2
 Vision and Mission of the Institute and Department

Vision of the Institute

To make IMSEC an Institution of Excellence for empowering students through technical education
coupled with incorporating values and developing engineering acumen for innovations and
leadership skills for the betterment of society.

Mission of the Institute

Mission 1: To promote academic excellence by continuous learning in core and emerging
Engineering areas using innovative teaching and learning methodologies.

Mission 2: To inculcate values and ethics among the learners.

Mission 3: To promote industry interactions and produce young entrepreneurs.

Mission 4: To create a conducive learning and research environment for life-long learning to
develop the students as technology leaders and entrepreneurs for addressing societal needs.

Vision of the Department

To provide globally competent professionals in the field of Computer Science & Engineering
embedded with sound technical knowledge, aptitude for research and innovation, and nurture
future leaders with ethical values to cater to the industrial & societal needs.

Mission of the Department

Mission 1: To provide quality education in both the theoretical and applied foundations of
Computer Science & Engineering.
Mission 2: Conduct research in Computer Science & Engineering resulting in innovations thereby
nurturing entrepreneurial thinking.
Mission 3: To inculcate team building skills and promote life-long learning with high societal and
ethical values.

3
 CSE Department Program Educational Objectives (PEOs)

B. Tech Computer Science & Engineering Department has the following Program Educational
Objectives:

PEO1: Possess core theoretical and practical knowledge in Computer Science and Engineering
for successful career development in industry, pursuing higher studies or entrepreneurship.
PEO2: Ability to imbibe life-long learning for global challenges to impact society and
environment.
PEO3: To demonstrate work productivity with leadership and managerial skills having ethics
and human value in progressive career path.
PEO4: To exhibit communication skill and collaborative skill plan and participate in
multidisciplinary fields of Computer Science & Engineering.

CSE Department Program Specific Outcomes (PSOs)

B.Tech Computer Science & Engineering Department has the following Program Specific
Outcomes:

PSO1: To analyze and demonstrate, the recent engineering practices, ethical values and
strategies in real time world problems to meet the challenges for the future.
PSO2: To develop adaptive computing system using computational intelligence strategies and
algorithmic design to address diverse challenges in data analysis and machine learning.

4
PROGRAM OUTCOMES
Engineering Graduates will be able to:

1. Engineering knowledge: Apply the knowledge of mathematics, 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 engineering sciences.
3. Design/development of solutions: Design solutions for complex 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. Conduct investigations of complex problems: 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
engineering activities with an understanding of the limitations.
6. The engineer 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.
7. Environment and sustainability: Understand the impact of the professional 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 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 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
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.

5
 IMS Engineering College
NH-09, Adhyatmik Nagar, Near Dasna, Distt. Ghaziabad, U.P.
Tel: (0120) 4940000
Department of Computer Science and Engineering

Course Name: Data Structures using C Lab Course Code: BCS-351

Semester / Year: 3rd/ 2nd NBA Code: C206
Subject Lab Coordinator: Ms. Sonia Sharma
Associated Faculty name: Mr. Amit Maan, Dr. N U Khan, Mr. Nishant Anand, Ms. Seema, Ms.
Ankita, Mr. Aditya Batra

Bloom’s
COURSE OUTCOMES Level
K1
Implement and analyze various searching and sorting algorithms using recursive
C206.1
and non-recursive techniques.
K2
C206.2 Implement basic data structures such as array and linked list.

Implement the both array-based and linked-list based Stack and Queue data K3
C206.3
structures and its operations.
Implement general tree data structures, including binary tree and binary search K4
C206.4
trees using linked lists.
Identify, model, solve and develop code for real life problems like shortest path K5
C206.5
and MST using graph theory.

Course
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
Outcomes

C206.1 3 3 3 2 1 1 - - 1 - 1 2 3 3

C206.2 3 3 3 2 1 1 - - 1 - 1 2 3 2

C206.3 3 3 3 2 1 1 - - 1 - 1 2 3 2

C206.4 3 3 3 2 1 1 - - 1 - 1 2 3 2

C206.5 3 3 3 2 1 1 - - 1 - 1 2 3 3

C206 3 3 3 2 1 1 - - 1 - 1 2 3 2.4
 SYLLABUS

Subject: Data Structures Using C Lab Code: BCS-351

BCS351- Data Structure Lab

List of Experiments (Indicative & not limited to)
1. Implementing Sorting Techniques: Bubble Sort, Insertion Sort, Selection Sort, Shell,
Sort, Radix Sort, Quick sort
2. Implementing Searching and Hashing Techniques: Linear search, Binary search,
Methods for Hashing: Modulo Division, Digit Extraction, Fold shift, Fold Boundary,
Linear Probe for Collision Resolution. Direct and Subtraction hashing
3. Implementing Stacks: Array implementation, Linked List implementation, Evaluation of
postfix expression and balancing of parenthesis, Conversion of infix notation to postfix
notation
4. Implementing Queue: Linked List implementation of ordinary queue, Array
implementation of circular queue, Linked List implementation of priority queue, Double
ended queue
5. Implementing Linked List: Singly Linked Lists, Circular Linked List, Doubly Linked
Lists: Insert, Display, Delete, Search, Count, Reverse(SLL), Polynomial, Addition,
Comparative study of arrays and linked list
6. Implementing Trees: Binary search tree: Create, Recursive traversal: preorder, post
order, in order, Search Largest, Node, Smallest Node, Count number of nodes, Heap: Min
Heap, Max Heap: reheap Up, reheap Down, Delete, Expression Tree, Heapsort
7. Implementing Graphs: Represent a graph using the Adjacency Matrix, BFS, Find the
minimum spanning tree (using any method Kruskal’s Algorithm or Prim’s Algorithm) Self
Learning Topics: Shortest Path Algorithm
 LIST OF PROGRAMS

Subject: Data Structures Using C Lab Code: BCS-351

LIST OF PROGRAMS

Subject: Data Structure Using C Lab Code: BCS-351

MAPPING
Exp. No NAME OF EXPERIMENT
WITH CO
1 Program for Implementation of Bubble Sort Algorithm CO206.1

2 Program for Implementation of Selection Sort Algorithm CO206.1

3 Program for Implementation of Quick Sort Algorithm CO206.1

4 Program for Implementation of Shell Sort Algorithm CO206.1

5 Program for Binary Search Algorithm CO206.1

6 Program for Stack implementation through Array CO206.3

7 Program for Queue implementation through Array CO206.3

8 Program for Circular Queue implementation through Array CO206.3

Program for Stack implementation using dynamic memory CO206.2
9
allocation
Program for queue implementation using dynamic memory CO206.2
10
allocation
Program for Circular Queue implementation using dynamic CO206.2
11
memory allocation
Program for List implementation using dynamic memory CO206.2
12
allocation
13 Program for implementation of Binary Tree CO206.4

Program for implementation of Binary Search Tree and traverse CO206.4

14
the tree in Preorder, Post order, and In order
15 Program for Implementation of Breadth First Search Algorithm CO206.5

16 Program for Implementation of Depth First Search Algorithm CO206.5