Scribd
Upload
52 views3 pages

CS3311-SET 1.docx - 20241128 - 155956 - 0000

The document outlines the practical end semester examination for the Data Structures Laboratory course for B.E/B.Tech students in the third semester, scheduled for November/December 2022. It includes various programming tasks in C, such as implementing data structures like circular queues, linked lists, stacks, binary search trees, and algorithms like Dijkstra's and Prim's. The exam consists of a single question to be answered within three hours, with a total of 100 marks allocated across different components.

Uploaded by

siddharthag1309
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
52 views3 pages

CS3311-SET 1.docx - 20241128 - 155956 - 0000

The document outlines the practical end semester examination for the Data Structures Laboratory course for B.E/B.Tech students in the third semester, scheduled for November/December 2022. It includes various programming tasks in C, such as implementing data structures like circular queues, linked lists, stacks, binary search trees, and algorithms like Dijkstra's and Prim's. The exam consists of a single question to be answered within three hours, with a total of 100 marks allocated across different components.

Uploaded by

siddharthag1309
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

B.E/B.Tech.

PRACTICAL END SEMESTER EXAMINATIONS, NOVEMBER/DECEMBER 2022

Third Semester

CS3311 – DATA STRUCTURES LABORATORY

(Regulations 2021)

Time: 3 Hours(Answer any one Question)Max. Marks: 100

Aim and
Execution and
Algorithm/ Program Viva-voce Record Total
Results
Procedure

20 30 30 10 10 100
Write a c program to implement circular queue ADT to do the insertion and deletion
1.
operation.

Write a C program that uses functions to perform the following:

a) Create a singly linked list of integers.


2.
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.

Write a c program to implement the polynomial addition and multiplication. Use linked
4.
list implementation.

Write a C program to implement infix to postfix conversion for the following


5
i) A + B * C + D ii) (A + B) * (C + D) iii) A * B + C * D iv) A + B + C + D

Write a c program to create a binary search tree by satisfying the property, the
6
balancing factor for every node is at most 1.

7 Write a c Program to implement AVL trees and its Operations

8 Write a C program to implement the binary heap using priority queues.

Find the shortest paths from the source to all vertices in the given graph using
Dijkstra’s algorithm.

9
Write a C program to implement Prim’s Algorithm for suitable example.
10

11 Write a C program to implement linear search algorithm

12 Write a C program to implement binary search algorithm

Write a C programs for implementing the following sorting methods to arrange a list of
13 integers in ascending order:

a. Insertion sort b) Merge sort

Consider an array of size 7 with elements 13, 9, 21, 15, 39, 19, and 27 and find the
14
element 39 in the list by implementing linear search algorithm in C language.

Substantiate the importance of MAX Heap in insertion and deletion by programming


15
using C

16 Write a C Program to implement an application of list ADT – Polynomial Subtraction

Consider an array of size 7 with elements 13, 9, 21, 15, 39, 19, and 27 and find the
17
element 39 in the list by implementing linear search algorithm in C language

Write a C program to sort the given unsorted array of elements using insertion sort
18
{13,32,26,9,35,18}

19 Write a C program to implement and evaluate the postfix expression.

20 Write a C program to find Maximum and minimum of element in max heap tree.

You might also like