A
Practical File
On
Data Structures and Algorithm Lab
Submitted In Partial Fulfilment of the requirements for the award of degree of
Bachelor of Technology
In
Computer Science & Engineering
From
Engineering College Bikaner
Affiliated to
Bikaner Technical University, Bikaner
(Session:2024-2028)
Submitted to
Dr. Rituraj Soni
Submitted by: Name Assistant Professor
University Roll No: Department of CSE
Program Specific Outcomes (PSOs):
PSO1: Technological Skill: The ability to understand, analyze and develop computer programs in
the areas related to algorithms, system software, multimedia, web design, big data analytics, and
networking for efficient design of computer-based systems of varying complexity.
PSO2: Strategy Development Skill: The ability to apply standard practices and strategies in
software project development using open-ended programming environments to deliver a quality
product for business success.
PSO3: Research Skill: Be able to route their talents in to post graduate and research programs,
promoting remarkable advancements in emerging areas.
PSO4 : Social Enhancement: The ability to apply the knowledge of the technology for social
enhancement and self-improvement.
Course Outcomes (COs)
CO1 Be able to design and analyze the time and space efficiency of the data structure.
CO2 Be capable to identity the appropriate data structure for given problem.
CO3 Have practical knowledge on the applications of data structures.
CO4 To design and implementation of various basic and advanced data structures.
CO5 To introduce various techniques for representation of the data in the real world.
1
INDEX
S.N Name of Practical Date Signature
1. Write an C code for insertion and deletion of element in 1-D Array.
2. Let A and B be two 2D Arrays
a. Write a C Code for adding elements of arrays A and B.
b. Write C Code for subtracting elements of arrays A and B.
c. Write C Code for multiplication of elements of Arrays A and B.
3. Write algorithm and C Program to implement for the following sorting.
Also write the time and space complexity of each algorithm.
a) Bubble Sort
b) Insertion Sort
c) Shell Sort
d) Selection Sort
e) Merge Sort
f) Quick Sort
g) Heap Sort
h) Radix Sort
i) Counting Sort
4. Write a C Code to implement Linear Search in Array.
5. Write a C Code to implement Binary Search in Array.
6. Write a program in C to implement PUSH and POP in stack using
arrays.
7. Write a program in C to implement stack using Linked List.
8. Write a program for factorial calculation and Fibonacci series
calculation using recursion.
9. Write a C program to convert infix expression in postfix and prefix
using stack.
10. Write a C program to evaluate postfix expression using Stack.
11. Write a C Program for insertion and deletion in Linear Queue.
12. Write a C program for insertion and deletion elements in Circular
Queue.
13. Write a program in C to implement Linear Queue using Linked List.
14. Write a C Program to insertion and deletion operation in single linked
List.
15. Write a C Program to insertion and deletion operation in double linked
List.
16. Write a C program for creating, insertion, deletion and searching in
Binary search tree
17. Write a C Program to implement BFS algorithm in Graph.
18. Write a C Program to implement DFS algorithm in Graph.
19. Write a C Program to implement Kruskal Algorithm in Graph.
20. Write a C Program to implement Prims Algorithm in Graph.
2
Program 1: Write an C code for insertion and deletion of element in 1-D Array.
( Keep Font Size 11 for program)