AOS

Submission includes:
1) A readme file with instructions on how to run your project.
2) A 500 x 500 png image of your results, which should be named p1.lastname.png.
3) The source code. You should also name your project AOS_project.lastname.zip.
These are due at 11:59 pm Sunday, March 6th, and should be submitted via Blackboard. Late submission costs you 2%, every day..
This project is 20% of your final grade:
10% for Retrieving the process profiling data, such as memory usage, CPU usage, and page faults
5% for Comparing the efficiency of two input algorithms or programs.
5% for Presenting the performance comparison results.

Project Description:

The idea of this project to extracting the system vs. user-level information of the running programs and use them to compare the efficiency of two algorithms.
The user-level information should include the running time (from the program starts to when it ends)

The system-level information should include:
1) CPU usage
2) Memory usage
3) Hard drive usage
4) RSS: Resident set size: This is non-swapped physical memory that a process had used
5) VMS: Virtual memory size: This is the total virtual memory used by the process
6) Number of page faults
Algorithms selections are due at 11:59 pm Sunday, Feb 20th, and should be sent through Email (with the subject: CS5352 Project topic: your full name) to the TA.
Late submission costs you 2%, every day.
The TA will make sure that the pairs of algorithms selected by each student are different:
The pairs of algorithms can be overlapped but not the same. No algorithms can be selected by more than 2 students.
Examples of Algorithms (The professor should be able to customize the input for project evaluation):
1) QuickSort vs. MergeSort.
2) DSF vs. BFS.
3) Shortest path algorithms: Dijkstra's algorithm vs. Kruskal's algorithm
4) Minimum Spanning Tree: Prim's algorithm vs. Kruskal's algorithm
5) Hash function and collision-resolution methods
6) Page replacement algorithms: LRU vs. FIFO
7) Job scheduling algorithms: Shortest Job First vs. FIFO
8) Data aggregation algorithms
9) Clustering algorithms: K-means vs DBScan
10) Classification techniques
11) Other machine learning techniques
12) Your choices
Running conditions:
1) Algorithm/Program A alone
2) Algorithm/Program B alone
3) Algorithms/Programs A and B concurrently
You present the analysis of your results and findings on comparing the algorithms under different running conditions.
You should use Python for your project, but it is not mandatory.

References:

Tutorial for Project: [PDF]
https://userweb.cs.txstate.edu/~zz11/software/scheduling/
https://greencode.cs.txstate.edu/#/

Project lists

No.	Student name	Topic
1	Cristiano Eleutherio Caon	Quicksort vs Mergesort
2	Ayesha Anjum Shaik	DFS vs BFS
3	Uppanapalli Sravani Lakshmi Radhika	Shortest path algorithms: Dijkstra's algorithm vs. Kruskal's algorithm
4	Mahitha Pammi	Minimum Spanning Tree: Prim's algorithm vs. Kruskal's algorithm
5	Alekhya Koppaka	Job scheduling algorithms : Shortest Job First Vs FIFO
6	Kavya gaddipati	Clustering algorithms: K-means vs DBScan
7	kambham Sai Pranitha	LIFO and FIFO
8	Maroju Sujana Babitha	Naive Bayes vs Logistic Regression algorithms
9	Sawanth Mythrey Bhonagiri	Quick Sort vs Insertion Sort
10	Ankalapu Sai Lakshmi	Classification Techniques
11	Koppisetti Laxman Kishore	Shortest path algorithms: Dijkstra's algorithm vs. Kruskal's algorithm
12	Akhil Katkam	Bubble Sort Vs Merge Sort
13	Goutham Vemula	Quick Sort vs Heap sort
14	Sai Charan Rokandla	Bubble Sort Vs Insertion Sort
15	Chennupati Ravi Kumar	Page replacement algorithms LRU vs FIFO
16	Katiki Raviteja	hash function and collision resolution methods
17	Prasad Vaibhav	shell sort vs heap sort
18	Atturu Venkat Nithin	First Come First Serve vs Priority Scheduling
19	Gandham Subhakari Mounika	Comparison between Binary Search Tree algorithm and AVL tree algorithm
20	Sai Rohith Banda	Page replacement algorithms LRU vs FIFO
21	Sai Kumar Siddu	AVL Tree vs Red Black Trees
22	Chandana Tulluru	Binary Search Tree vs Red Black Trees
23	Nallani Jagadeesh	linear search Vs Binary search algorithm
24	Rohith Yarra	Merge sort Vs Insertion sort algorithm
25	Nallani Ramyari	Insertion sort vs selection sort algorithm
26	Mandadi Ajith Jacinth	heapsort vs merge sort
27	Pulivarthi Sai Trinadh Kumar	Radix sort vs shell sort
28	Rahul Bantu	Radix Sort Vs Heap Sort
29	Diane Renard	Bubble sort VS Shell Sort
30	Jonnalagadda bharatsai	heap sort vs bubble sort

More names can be found here