CYB 354 Data Structures and Algorithms
The course introduces data structures and algorithms which provide a variety of solutions to searching and sorting tasks. Students are expected to apply Big O notation efficiency techniques to analyzing time and space complexity. In the course, students are introduced to some common data structures, such as array, liked list, heap, tree, stack, and queue. Sort algorithms include but are not limited to bubble sort, selection sort, insertion sort, merge sort, shell sort, quicksort, radix sort, and heap sort.