LAB FILE

OF

KCS 351
DATA STRUCTURE USING C LAB

By

Student Name
(Roll Number)
B Tech (Branch)-II

Pranveer Singh Institute of Technology

Kanpur - Agra - Delhi National Highway (NH-19) , Bhauti -
Kanpur - 209305
 B.TECH. THIRD SEMESTER
KCS 351 DATA STRUCTURE USING C LAB

Course Outcome (CO) Bloom’s Knowledge Level (KL)

At the end of course, the student will be able to understand
1. CO 1 Employ [L3: Apply] different operations on data structures by applying the knowledge and facts gained using
C language.
2. CO 2 Assess [L5: Evaluate] the performance of data structures on the basis of the results accuracy, run time and
the resources required.
3. CO 3 Devise [L6: Create] the alternative implementations of data structures with respect to its performance to
solve a real world problem.

Write C Programs to illustrate the concept of the following:

1. Sorting Algorithms-(Non Recursive) Selection, Bubble, Insertion, Counting and Radix.
2. Sorting Algorithms-(Recursive) Merge & Quick.
3. Searching Algorithm-Linear and Binary.
4. Implementation of Linked List: Singly, Circular and Double.
5. Implementation of Stack using Array.
6. Implementation of Queue using Array.
7. Implementation of Circular Queue using Array.
8. Implementation of Stack using Linked List.
9. Implementation of Queue using Linked List.
10. Implementation of Circular Queue using Linked List.
11. Implementation of Tree Structures, Binary Tree, Tree Traversal, Binary Search Tree, Insertion and Deletion in
BST.
12. Graph Implementation, BFS, DFS, Minimum cost spanning tree, shortest path algorithm.
 INDEX
Write C Programs to illustrate the concept of the following:

S Experiment Date Marks Evaluator’s

No. Signature
1 Sorting Algorithms-(Non Recursive)
Selection, Bubble, Insertion, Counting
and Radix.
2 Sorting Algorithms-(Recursive) Merge
& Quick.
3 Searching Algorithm-Linear and
Binary.
4 Implementation of Linked List: Singly,
Circular and Double.
5 Implementation of Stack using Array.
6 Implementation of Queue using Array.
7 Implementation of Circular Queue
using Array.
8 Implementation of Stack using Linked
List.
9 Implementation of Queue using Linked
List.
10 Implementation of Circular Queue
using Linked List.
11 Implementation of Tree Structures,
Binary Tree, Tree Traversal, Binary
Search Tree, Insertion and Deletion in
BST.
12 Graph Implementation, BFS, DFS,
Minimum cost spanning tree, shortest
path algorithm.