This is a repository for Data-Structure-Algorithms Lab assignments in Second year Information Technology of SPPU!
Do star ⭐ this Repository if you feel it helped & drop a follow!
💙 Happy Learning 💙
Data Structure Concepts (SEM-3)
[1] Consider a student database of SEIT class (at least 15 records). Database contains different fields of every student like Roll No, Name and SGPA.(array of structure)
a) Design a roll call list, arrange list of students according to roll numbers in ascending order (Use Bubble Sort)
b) Arrange list of students alphabetically. (Use Insertion sort)
c) Arrange list of students to find out first ten toppers from a class. (Use Quick sort)
d) Search students according to SGPA. If more than one student having same SGPA, then print list of all students having same SGPA.
e) Search a particular student according to name using binary search without recursion. (all the student records having the presence of search key should be displayed)
(Note: Implement either Bubble sort or Insertion Sort.)
[2] Create Singly Linked List and perform the following operation
(a) Insertion
(b) Deletion
(c) Display Records.
(d) Search a record form linked list.
(Hint: Create class Linked list, define node structure using class or structure. Create menu driven program in which options are
(a) Insert at start
(b) Insert at end
(c) Insert at position
(d) Delete at start
(e) Delete at end
(f) Delete at position
(g) Display record
(h) Search a record)
[3] Implement stack as an abstract data type using singly linked list and use this ADT for conversion of infix expression to postfix, prefix and evaluation of postfix and prefix expression.
[4] Implement Circular Queue using Array. Perform following operations on it.
a) Insertion (Enqueue)
b) Deletion (Dequeue)
c) Display
(Note: Handle queue full condition by considering a fixed size of a queue.)
[5] Implement binary search tree and perform following operations:
a) Insert (Handle insertion of duplicate entry)
b) Delete
c) Search
d) Display tree Traversal (Recursive & Non-recursive)
e) Display - Depth of tree
f) Display - Mirror image
g) Create a copy
h) Display all parent nodes with their child nodes
i) Display leaf nodes
j) Display tree level wise
[6] Construct an Expression Tree from postfix and prefix expression. Perform recursive and nonrecursive In-order, pre-order and post-order traversals.
[7] Implement In-order Threaded Binary Tree and traverse it in In-order and Pre-order
[8] Implement Heap sort to sort given set of values using max or min heap.
[9] Implementation of graph using dynamic arrays (vector in C++) to represent adjacency lists instead of the linked list. Include traversing algorithm and path output.
