DAA_HandsOn

This repository contains the Hands On assignments for the course CSE 5311 (Design and Analysis of Algorithms) under Prof. Larz White at the University of Texas at Arlington

Hands_On 2

Details about Hands On 2 assignment

Direct Link to the folder - Hands_On_2

This assignment implements -

1. insertion sort
2. selection sort
3. bubble sort

Each of the sorts have -

• source code - insertion_sort.py selection_sort.py bubble_sort.py
• time vs input array size plot code (using mathplotlib) - plot_insertion.py plot_selection.py plot_bubble.py
• image of the plot generated - plot_insertionsort.png selectionsort.png plot_bubblesort.png

Additional files:

• computer information (work done on GitHub Codespaces) - computer_benchmark_info.txt
• selection sort correctness - selectionsort_correctness.py
• benchmark plot for the 3 sorting algorithms (python code and plot image) - benchmark_sorting_algorithms.py benchmark_sorting_algorithms.png

Hands_On 3

Details about Hands On 3 assignment

Direct Link to the folder - Hands_On_3

1. Solution in the PDF
2. Plot for time vs n
   • time vs n plot: timeplot.pytimeplot.png
   • time vs n plot with polynomial fitting (w/ only original data points): timeplot_fit.py timeplot_fit.png
   • time vs n plot with polynomial fitting (both graphs shown for comparision): timeplot_fit_bounds.py timeplot_fit_bounds.png
3. Bounds
   • python code to showcase the lower and upper bounds on the plot w/ (time vs n) and polynomial graph: timeplot_fit_bounds.py
   • plot: timeplot_fit_bounds.png
   • more explaination about the bounds in the PDF
4. n0 value
   • python code to zoom in and mark the n0 value: timeplot_fit_n0.py
   • plot: timeplot_fit_n0.png
5. Solution in PDF
6. Solution in PDF
7. Merge sort: merge_sort.c

Other files:

• PDF containing the non-coding solutions to some of the questions: Hands_On_3_Solutions.pdf

Hands_On 4

Details about Hands On 4 assignment

Direct Link to the folder - Hands_On_4

Problem 0:

• Fibonacci sequence python implementation: fibonacci_sequence.py
• Output screenshot: fib_output.png

Problem 1:

• Code: merge_arrays.py
• Output screenshot: merge_output.png

Problem 2:

• Code: remove_duplicates.py
• Output screenshot: remove_duplicates_output.png

Solutions document for part 2 and 3 of Problems 1, 2: solutions.txt

Hands_On 5

Details about Hands On 5 assignment

• Min heap python implementation meeting all the specified requirements: min_heap.py
• Examples of heap working (screenshots): detailed output simplified output

Hands_On 6

Details about Hands On 6 assignment

• Q1:

  • Random version: quicksort_random.py
  • Non - random version: quicksort_nonrandom.py
  • Output: terminal_output_screenshot.png

• Q2:

  • Code: quicksort_nonrandom_benchmarks.py
  • Output: quicksort_performance.png

• Q3:

  • Q3.pdf

Hands_On 8

Details about Hands On 8 assignment

• Q1:

  • Implementation of quicksort w/ the ith order statistic: quicksort_i.py
  • Output (examples): output.png

• Q2:

  1. Stack: stack.c
     • Output: stack_output.mov
  2. Queue: queue.c
     • Output: queue_output.mov
  3. Linked List: linked_list.c
     • Output: linked_list_output.mov

Hands_On 9

Details about Hands On 9 assignment

• Hash Function: hash_function.c hash_function.h

• Hash Table: hash_table.c hash_table.h

  • The code allows for any hash function

• Main Function: main.c

• Output: output.txt

  • Example array with size within the specified range
  • Example array for growing the hash table
  • Example array for shrinking the hash table

Hands_On 10

Details about Hands On 10 assignment

1. Binary Search Tree
   • Code: bst.c
   • Output: bst_output.mov
2. AVL Tree
   • Code: avl.c
   • Output: avl_output.mov
3. Red Black Tree
   • Code: rb.c
   • Output: red_black_output.mov

Hands_On 11

Details about Hands On 11 assignment

1. Dynamic Array Implemtation:
   • Code: main.cpp
   • Output: main_output.png
2. Chapter 17 Homework:
   • Solution: chap17.txt

Hands_On 13

Details about Hands On 13 assignment

1. Topological Sort: topological_sort.py
2. Depth First Search: dfs.py
3. Kruskal Algorithm: kruskal.py

Hands_On 14

Details about Hands On 14 assignment

1. Dijkstra's algorithm: dijkstra.py
2. Bellman-Ford algorithm: bellman_ford.py
3. Floyd-Warshall algorithm: floyd_warshall.py