Details

No
Complete
2025-05-22 11:42:43
2025-06-09 15:22:08
Joel David Sari
904173478
jsari6@gatech.edu
Accepted Applicant
Pauline Marilyn Glenn
pglenn8
University of Connecticut
352 Mansfield Rd. Unit 2048, Storrs, CT 06269-2048
United States
[ 108108 ]
CSE 3500
Algorithms and Complexity
Spring 2025
(Semester Basis)
3 credit hours
CS 3510, 3 credit hours
Policy
CS 3510, 3 credit hours
Policy

Notes

2025-05-22 11:42:43 - Joel David Sari <jsari6>

I received an A in this course, which I believe aligns directly with Georgia Tech’s CS 3510 (Design and Analysis of Algorithms). Core topics included asymptotic analysis, divide-and-conquer, greedy algorithms, dynamic programming, graph algorithms (BFS, DFS, MSTs, shortest paths), and NP-completeness. We also studied randomized algorithms, selection algorithms, and data structures (heaps, BSTs, hash tables), using CLRS 4th ed. Weekly quizzes, assignments, and two timed exams (Midterm and Final exam) ensured deep comprehension and hands-on implementation.

Trail Log

2025-06-09 15:22:08

Final equivalencies entered by Makesia D Scott (ms366) Final equiv: CS 3510 (3 hrs). Policy. Phase set to Complete.

2025-06-05 13:58:15

Draft equivalencies entered by Pauline Marilyn Glenn (pglenn8) Draft equiv: CS 3510 (3 hrs). Policy. Phase set to Registrar 2.

2025-05-27 14:29:02

Assigned to Pauline Marilyn Glenn (pglenn8) by Shannon Davis (sdavis376). Phase set to Department.

2025-05-22 11:42:43

Evaluation initiated by Joel David Sari (904173478). Phase set to Registrar 1.