Scribd
Upload
8 views

About

Data Structures Lab

Uploaded by

joyaljms98
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

About

Data Structures Lab

Uploaded by

joyaljms98
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

22-382-0106 DATA STRUCTURES CATEGORY L T P CREDIT

LAB
LAB 0 1 2 2

Prerequisite: Programming Fundamentals

Course Outcomes: After the completion of the course the student will be able to

CO1 Implement basic C programs. (Cognitive level: Apply)

CO2 Develop programs using C data types, Functions with (Cognitive level: Apply)
recursion, Pointers and Structures.

CO3 Apply elementary data structures, Non linear data structures (Cognitive level: Apply)
and binary search tree using C.

CO4 Implement Heap and Graph operations using C. (Cognitive level: Apply)

CO5 Apply sorting techniques and Dictionary operations using C. (Cognitive level: Apply)

Mapping of Course Outcomes with Programme Outcomes - Low=1, Medium=2, High=3


PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3

CO2 2 3

CO3 3 2 3

CO4 3 3

CO5 2 2 3

23
22-382-0106- DATA STRUCTURES LAB

1. Write a C program to evaluate the arithmetic expression ((a -b / c * d + e) * (f +g)) and


display its solution.
2. Create a C Program to read 3 integer values, find the largest among them.
3. Develop a C program to check if the number is Prime or not.
4. Develop a program to check whether the given number is armstrong or not.
5. Write a c program to read a string and count the number of vowels, consonants and
spaces in it.
6. Using structure, write a program to read and print data of n employees (Name, Employee
Id and Salary)
7. Write a C program to create a fibonacci series using recursive function.
8. Find the factorial of a given Natural Number n using
i) a non recursive function
ii) a recursive function
9 . Do the following using pointers
i) add two numbers
ii) swap two numbers using user defined function
10. Construct binary search trees to perform insertion, deletion, search
11. Apply Queue and stack in Breadth First Search and Depth First Search respectively
12. Write a program to create a binary search tree and find the number of leaf nodes
13. Create a binary search tree with the following operations:
i)Insert a new node .
ii)Inorder traversal.
iii)Preorder traversal.
iv)Postorder traversal.
v)Delete a node.
14. Design, develop, and execute a program in C to create a max heap and perform the
following operations
i)Insertion
ii)Deletion
iii)Print Largest Value
15. Write a program to implement Depth First Search (DFS) graph traversal methods.
16. Write a program to implement Depth First Search (DFS) graph traversal methods.
17. Create a text file containing the name, height, weight of the students in a class. Perform
Quick sort and Merge sort on this data and store the resultant data in two separate files.
Also write the time taken by the two sorting methods into the respective files.
Sony Mathew 5.5 60
Arun Sajeev 5.7 58
Rajesh Kumar 6.1 70
18. Write a program to sort a set of numbers using Heap sort and find a particular number
from
the sorted set using Binary Search.
19. Implement a Hash table using Chaining method. Let the size of hash table be 10 so that the
index varies from 0 to 9.
20. Implement a Hash table that uses Linear Probing for collision resolution

24

You might also like