Scribd
Upload
47 views3 pages

CS3301 As02

1. The document provides an assignment for a Data Structures and Programming course at Quantum University located in Roorkee, Uttarakhand, India. 2. It includes the names of 21 student groups and the data structures or algorithms they will present on, such as shell sort, linear search, and Dijkstra's algorithm. 3. The assignment is due on December 8th, 2023 and is worth a maximum of 30 marks.

Uploaded by

wickykumar05
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
47 views3 pages

CS3301 As02

1. The document provides an assignment for a Data Structures and Programming course at Quantum University located in Roorkee, Uttarakhand, India. 2. It includes the names of 21 student groups and the data structures or algorithms they will present on, such as shell sort, linear search, and Dijkstra's algorithm. 3. The assignment is due on December 8th, 2023 and is worth a maximum of 30 marks.

Uploaded by

wickykumar05
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

Quantum University

Campus:-Mandawar ,22Km Milestone,Roorkee-DehradunHighway(NH-73)

Roorkee -247667(Uttarakhand , INDIA )

ASSIGNMENT-2
(Odd Semester 2023-2024)

Subject Name : Data Structure and Programming Subject Code : CS3301

Course: B.TECH/CSE/2nd YR Due Date :08 Dec 2023

Max Marks : 30

S.No. Student Name Presentation Topic


1. Aakansha choudhary
Kritika Shell Sort
Harshit Vashistha
2. Aaarav Saxena
Priyanshu Singh Linear Search
Nitin Singh
3. Aayush kumar
Abhishek Kumar Indexed sequential Search
Vijay Kumar Gautam
4. Abhishek Kumar Singh
Martand Mishra Address Calculation Sort
Tanuj Kumar Kushmi
5. Abiha kazmi
KM Ilma Warshall’s Algorithm
Apeksha Kaushik
6. Alisha
Mehreen Shortest Path Algorithm
Satyam Kumar
7. Alok kumar
Aman Kumhar Binary search
Anurag Mishra
8. Anish Afridi
Somyadeep Hashing Hash Table
Shubham Kumar
9. Ashutosh Kumar
Gaurav Singh Panwar Dijkstra’s Algorithm
Ashwani Dubey
10. Ayan
Md. Zameer Introduction and Representation of Graph
Shakir Azhar
11. Gori Sharma
Vanshika Singh Breadth First Search (BFS)
Jivesh Tiwari
12. Himanshu Tyagi
Vineet Tyagi Bubble Sort
Ujjawal Choudhary
13. Ibrahim Mohd. Rafi
Rao Aadil Interpolation Search
Mohd. Umar
14. Kartikey
Vaidik Heap as a Priority Queue
Satya Prakash Singh
15. Lavish kumar
Md. Mehfooz Alam Depth First Search (DFS)
Dhruv Saroha
16. Mohd. Aamish
Murad Alam Linked List representation of Graph
Sumit Kumar
17. Mohit Kumar
Vikash Yadav Binary Tree Sort
Vicky Kumar
18. Mrityunjay Choudhary
Rishank Jindal Shortest Path Algorithm
Priyanshu Saini
19. Preeti Fartyal
Resham Transitive Closure of Graph
Rudrika Saini
20. Priyanshu Bhardwaj
Ravish Bajpai Graphs, Types of Graph ,Application of Graph
Himanshu Kumar Thakur

21. Md. Ata Karim Redix Sort

You might also like