CSCI 2341

This course introduces the fundamental Abstract Data Types of computing science, along with their availability and usage in the context of a modern programming language. These include contiguous and non-contiguous lists, stacks, queues, trees, maps, sets, and hash tables. A number of widely used algorithms, searching and sorting in particular, are discussed, along with their complexity. Emphasis in this course is placed on understanding when and how to use the various structures and algorithms studied, and students implement, using the programming language of choice, problem solutions that will help them gain that understanding. Classes 3 hrs. and recitation 1.5 hrs. per week.