CSCI 132 - Basic Data Structures and Algorithms

Credit(s): 4

Prerequisite(s): any one of the following: CSCI 100, CSCI 107, CSCI 111, CSCI 113, or CSCI 127 .
This course is an examination of advanced Java and basic data structures and their application in problem-solving. Data structures include stacks, queues, and lists. It provides an introduction to algorithms and employing the data structures to solve various problems including searching and sorting, and recursion. Students will understand and use Java class libraries and be introduced to Big-O Notation. The laboratory uses Java. (Fall Semester)

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

Understand the concept of an Abstract Data Type (ADT).
Implement the list ADT.
Implement the stack ADT.
Implement the queue ADT.
Implement the priority queue ADT.
Determine the time complexity of simple algorithms.
Implement several standard sorting techniques.
Implement linear and binary search.
Use recursion.
Utilize the Java programming language.