Scribd
Upload
10 views

DS LAB EXAM PROGRAMS

The document outlines the internal and external exam programs for B.Tech students in the Data Structures course for the academic year 2023-24. It includes a comprehensive list of C programming tasks covering various data structures and algorithms, such as linked lists, trees, queues, and sorting techniques. Additionally, there are extra programs specified for the external exam only, focusing on advanced data structures and algorithms.

Uploaded by

md sameer
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
10 views

DS LAB EXAM PROGRAMS

The document outlines the internal and external exam programs for B.Tech students in the Data Structures course for the academic year 2023-24. It includes a comprehensive list of C programming tasks covering various data structures and algorithms, such as linked lists, trees, queues, and sorting techniques. Additionally, there are extra programs specified for the external exam only, focusing on advanced data structures and algorithms.

Uploaded by

md sameer
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

DS LAB INTERNAL & EXTERNAL EXAM

PROGRAMS LIST
B.Tech I-YR / II-SEM A.Y.: 2023-24

SUB: DS SECTIONS: CSE & ALLIED

Programs for both Internal & External exams:

1. Write a C program to implement the following operations on to a 1D Array:

a. INSERT b. DELETE c. SEARCH d. TRAVERSE


2. Write a C program to implement Self-referential Structure.
3. Write a C program to Perform Dynamic Memory Allocation.
4. Write a C program to implement Single linked list i) Insertion ii) Deletion iii) Display
5. Write a function to reverse the nodes of a Single linked list
6. Write a program that implement Stack (its operations) using Arrays

7. Write a program that implement Circular Queue (its operations) using Arrays
8. Write C programs to implement Stack ADT using Linked List
9. Write a program that implement Queue (its operations) using Arrays
10. Write C programs to implement Queue ADT using Linked List
11. Write a C program to implement different hash methods
12. Write a C program to implement Quadratic probing collision resolving technique
13. Write a C program to implement Linear Probing collision resolving technique.

14. Write a C program to find height of a Binary tree


15. Write a program that uses functions to perform the following operations on doubly linked
list: i) Creation ii) Insertion iii) Deletion iv) Traversal
16. Write a program that uses functions to perform the following operations on circular linked
list: i) Creation ii) Insertion iii) Deletion iv) Traversal
17. Write a C program to Convert the given Infix Expression to Postfix Expression.
18. Write a C program to Evaluate the given Postfix Expression.
19. Write a C program to implement Binary search tree i) Insertion ii) deletion iii) Traversals
20. Write a C program to implement AVL tree i) Creation ii) Deletion iii) Traversal

21. Write a C program to count the number of leaf nodes in a tree.


22. Write a C program for implement DFS Graph traversal
23. Write a C program for implement BFS Graph traversal
24. Write C program to implement the Quick Sort technique.
25. Write C program to implement the Merge sort technique
26. Write a C program for implement Boyer –Moore pattern matching algorithm.

27. Write a C program to implement Brute Force pattern matching algorithm


28. Write C programs to implement Circular Queue ADT using Linked List
ADDITIONAL PROGRAMS (For External Exam only)
1. Write a C program to implement Dictionary ADT using Skip list data structure.
2. Write a C program to implement binary search tree Non-recursive Pre-Order traversal
3. Write a C program to implement binary search tree Non-recursive Post–Order traversal
4. Write a C program to implement binary search tree Non-recursive In-Order traversal
5. Write a C program to implement External Merge sort technique.
6. Write a C program to implement Knuth-Morris-Pratt pattern matching algorithm
7. Implement Dictionary ADT using list data structure.
8. Write C program to implement the Heap sort technique
9. Write a C Program to Check if a Given Binary Tree is an AVL Tree or Not
10. WACP that swaps two nodes in a linked list. The nodes are identified by numbers and are
passed as parameters. For example, to exchange nodes 5 & 8, you would call swap(5,8).
If the exchange is successful, the function returns 1 else it returns 0.
11. WACP that traverses a linked list & delete all the nodes whose keys are negative.
12. WACP to copy the contents of one stack into another.
13. WACP that creates a Queue from a Stack. After the queue has been created, the top of the
stack should be the front of the queue and the base of the stack should be the rear of the
queue. At the end, the stack should be empty.
14. WACP to reconstruct a binary tree from its preorder and inorder traversal sequences.
15. WACP to find the minimum and maximum elements in a Binary Search Tree.
16. WACP to split a given list of integers represented by a singly linked list into two lists in
the following way:
Let the list be L = (l0, l1, l2, l3,………, ln)
The resultant lists would be R1 = (l0, l2, l4, ……. ) & R2 = (l1, l3, l5, ……….).
17. WACP that merges two ordered linked lists into one list. When two lists are merged, the
data in the resulting list are also ordered. The two original lists should be left unchanged,
that is, the merged list should be a new list.
18. Given a queue of integers, WACP that deletes all negative integers with out changing the
order of the remaining elements in the queue.
19. WACP to find next node in same level for given node in a Binary tree.
20. WACP to check if given Binary tree is Complete Binary tree or not?
21. WACP to convert Binary tree to its mirror.
22. WACP to print all paths from root to leaf nodes in a given Binary tree.
23. WACP to find ancestors of given node in a Binary tree.
24. WACP to find inorder predecessor for the given key in a Binary Search Tree.
25. WACP to check if an undirected graph contains cycles or not.
26. WACP to determine if an undirected graph is a tree?
27. WACP to implement Merge Sort technique for Singly Linked List
28. WACP to Remove duplicates from a sorted linked list
29. WACP to implement Level Order Traversal of Binary Tree
30. WACP to check if given array represents min heap or not

You might also like