0% found this document useful (0 votes)
2 views3 pagesCs3311-Set 1
The document outlines a series of programming tasks for a Data Structures Laboratory course, focusing on implementing various data structures and algorithms in C. Key tasks include creating linked lists, stacks, queues, binary search trees, AVL trees, and implementing sorting and searching algorithms. Additionally, it covers polynomial operations, heap implementations, and hashing techniques.
Uploaded by
vidyasreeuxCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views3 pagesCs3311-Set 1
The document outlines a series of programming tasks for a Data Structures Laboratory course, focusing on implementing various data structures and algorithms in C. Key tasks include creating linked lists, stacks, queues, binary search trees, AVL trees, and implementing sorting and searching algorithms. Additionally, it covers polynomial operations, heap implementations, and hashing techniques.
Uploaded by
vidyasreeuxCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
/ 3
CS3311 – DATA STRUCTURES LABORATORY
1. Write a c program to implement queue ADT to do the insertion and
deletion operation using linked list.
2. Write a C program that uses functions to perform the following:
a) Create a singly linked list of integers.
b) Delete a given integer from the above linked list.
c) Display the contents of the above list after deletion
3. Write a C program to implement stack ADT using linked list implementation.
4. Write a c program to implement the polynomial addition and multiplication.
Use linked list implementation.
5 Write a C program to convert an infix to postfix expression using arrays.
6 Write a c program to create a binary search tree by satisfying the property,
the balancing factor for every node is at most 1.
7 Write a c Program to implement AVL trees and its operations.
Page 1 of 3
8 Write a C program to implement the binary heap using priority queues.
9 Find the shortest paths from the source to all vertices using Dijkstra’s
algorithm.
10 Write a C program to implement Prim’s Algorithm for suitable example.
11 Write a C program to implement linear search algorithm
12 Write a C program to implement binary search algorithm
13 Write a C programs for implementing the following sorting methods to
arrange a list of integers in ascending order:
a) Insertion sort b) Merge sort
14 Substantiate the importance of MAX Heap in insertion and deletion by
programming using C
15 Write a C Program to implement an application of list ADT – Polynomial
Subtraction
16 Write a C program to sort the given unsorted array of elements using insertion
sort
{13,32,26,9,35,18}
17 Write a C program to implement and evaluate the postfix expression.
18 Write a C program to find Maximum and minimum of element in max heap tree.
19 Write a C program to implement Hashing using open addressing.
20 Write a C program to implement Hashing using Separate chaining
Page 2 of 3
Page 3 of 3
