KEMBAR78
CS3311-Data Structures Model Lab QP Print (Set-1) | PDF
Scribd
Upload
2K views2 pages

CS3311-Data Structures Model Lab QP Print (Set-1)

The document outlines 17 questions for a data structures laboratory assignment. The questions cover implementing various data structures in C including circular queues, linked lists, stacks, binary trees, heaps, and graphs. They involve operations like insertion, deletion, searching, and sorting of data using algorithms such as linear search, binary search, insertion sort, merge sort, infix to postfix conversion, Dijkstra's algorithm, and Prim's algorithm.

Uploaded by

SARANYA A
Copyright
© © 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
2K views2 pages

CS3311-Data Structures Model Lab QP Print (Set-1)

The document outlines 17 questions for a data structures laboratory assignment. The questions cover implementing various data structures in C including circular queues, linked lists, stacks, binary trees, heaps, and graphs. They involve operations like insertion, deletion, searching, and sorting of data using algorithms such as linear search, binary search, insertion sort, merge sort, infix to postfix conversion, Dijkstra's algorithm, and Prim's algorithm.

Uploaded by

SARANYA A
Copyright
© © 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
You are on page 1/ 2

CS3311 DATA STRUCTURES LABORATORY

SET-1 Question Paper

1. Write a c program to implement circular queue ADT to do the insertion and


deletion operation.

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 infix to postfix conversion for the following


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

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

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

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

8. Write a C program to implement linear search algorithm.

9. Write a C program to implement binary search algorithm

10. 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
11. Consider an array of size 7 with elements 13, 9, 21, 15, 39, 19, and 27 and find the
element 39 in the list by implementing linear search algorithm in C language.
12. Substantiate the importance of MAX Heap in insertion and deletion by
programming using C

13. Write a C Program to implement an application of list ADT – Polynomial


Subtraction

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

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

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

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

You might also like