CSCI 132 - Basic Data Structures and Algorithms

Credit(s): 4

Prerequisite(s): any one of the following: CSCI 100, CSCI 107, CSCI 113, or CSCI 127 .
This course explores advanced Java programming and the implementation of core data structures used in problem-solving. Students design and apply stacks, queues, arrays, array algorithms, and linked lists to solve computational problems. Topics include searching, sorting, recursion, and an introduction to algorithm analysis using Big-O notation. Emphasis is placed on applying object-oriented principles and Java class libraries to develop efficient and maintainable code. (Fall Semester)

Course Learning Outcomes: Upon completion of the course, students will be able to

Implement and apply Abstract Data Types such as lists, stacks, queues and priority queues.
Determine the time complexity of simple algorithms.
Implement and apply common sorting techniques such as insertion sort, selection sort, quicksort and mergesort.
Implement and apply common searching techniques such as linear and binary search.
Utilize the Java programming language and its libraries to solve problems.