Computer Science and Information Systems
CSIS 2420 -- Data Structures and Algorithms
In Data Structures and Algorithms i was required to measure algorithms efficiency, use extensive unit testing, create and understand many data structures like linked lists and heaps, understand and utilize abstract datatypes, create and use searches, sorts, recursion, and shortest path algorithms. This class had some complex ideas and theories in it that were difficult to me at first, Sorts and Path algorithms were especially difficult. But after much time reading, experimenting, asking questions and doing assignments I was able to understand the concepts and implement them effectively. The two programs that show my skills the best for this class are my palindrome and merge sort programs. The merge sort uses an in-place selection sort when the size of the partitions are small enough to make the program more efficient, timers for my justification were used. Unpacking is required for both programs.
In Data Structures and Algorithms i was required to measure algorithms efficiency, use extensive unit testing, create and understand many data structures like linked lists and heaps, understand and utilize abstract datatypes, create and use searches, sorts, recursion, and shortest path algorithms. This class had some complex ideas and theories in it that were difficult to me at first, Sorts and Path algorithms were especially difficult. But after much time reading, experimenting, asking questions and doing assignments I was able to understand the concepts and implement them effectively. The two programs that show my skills the best for this class are my palindrome and merge sort programs. The merge sort uses an in-place selection sort when the size of the partitions are small enough to make the program more efficient, timers for my justification were used. Unpacking is required for both programs.
palindromes.jar | |
File Size: | 314 kb |
File Type: | jar |
mergesort.jar | |
File Size: | 11 kb |
File Type: | jar |