23232_Abhishek Jadhav
Class: SE10
Batch: F10
1.
2. 3. 4. 5. 6. 7. 8. 9. 10.
[21/09/2021]
AssignmentNo. 1 >
Student_Database_using_class_n_sorting.cpp ->
Assignment 1 : Searching and Sorting
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.)
[28/09/2021]
AssignmentNo. 2 >
On Branch named - Assignment_2-Queue ->
Assignment 2 : Circularqueue
Implement Circular Queueusing 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.)
[23/10/2021]
AssignmentNo. 3 >
On Branch named - Assignment_3-Expression_conversion ->
Assignment 3 : Expression Conversion
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.
[31/10/2021]
AssignmentNo. 4 >
On Branch named - Assignment_4-Expression_tree ->
Assignment 4 : Expression Tree
Construct an expression tree for postfix expression and perform recursive and non-recursive Inorder, Preorder and Postorder traversals.
[05/11/2021]
AssignmentNo. 5 >
On Branch named - Assignment_5-BST ->
Assignment 5 : BST
Implement binary search tree and perform following operations:
a) Insert (Handle insertion of duplicate entry)
b) Delete
c) Search
d) Display tree (Traversal)
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
[07/11/2021]
AssignmentNo. 6 >
On Branch named - Assignment_6-Threaded_BST ->
Assignment 6 : Threaded BST
Implement In-order Threaded Binary Tree. Traverse the implemented tree in Pre- order too.
[04/12/2021]
AssignmentNo. 7 >
On Branch named - Assignment_7-MST ->
Assignment 7 : Minimum Spamming Tree
Represent a graph of your college campus using adjacency list /adjacency matrix. Nodes should represent the various departments/institutes and links should represent
the distance between them. Find minimum spanning tree using,
a) Using Kruskal’s algorithm
b) Using Prim’s algorithm
[11/12/2021]
AssignmentNo. 8 >
On Branch named - Assignment_8-Dijikstra's_Algorithm ->
Assignment 8 : Dijkstra's Algorithm
Represent a graph of city using adjacency matrix /adjacency list. Nodes should represent the various landmarks and links should represent the distance between them.
Find the shortest path using Dijkstra's algorithm from single source to all destination. Analyze the implemented algorithm for space and time complexity
[13/12/2021]
AssignmentNo. 9 >
On Branch named - Assignment_9-Heap_Sort ->
Assignment 9 : Implementation of Heap Sort
Implement Heap sort to sort given set of values using max or min heap.
[14/12/2021]
AssignmentNo. 10 >
On Branch named - Assignment_10-File_Handling ->
Assignment 10 : File Handling
Department maintains student’s database. The file contains roll number, name, division and address. Write a program to create a sequential file to store and maintain
student data. It should allow the user to add, delete information of student. Display information of particular student. If record of student does not exist an
appropriate message is displayed. If student record is found it should display the student details.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent