CSD 235 Algorithms and Data Structures

5 credits

Students study fundamental algorithms and data structures, learn to use lists, arrays, stacks and queues, and apply searching and sorting methods to solve intermediate level programming problems. Students will write medium sized C++ programs consisting of multiple classes and data structures.

Prerequisites: CS 143

Course Outcomes
Upon successful completion of this course students will be able to:

Explain the basic principles of software engineering
Implement various data structures like linked lists, stacks, queues, and binary trees using Object Oriented Programing (OOP) techniques
Implement searching and sorting routines on various data structures while paying close attention to the efficiency of the algorithms being used
Use STL and its particular components to implement data structures
Estimate efficiency of algorithms
Demonstrate a thorough understanding of recursion and its role in implementation of linked lists and tree data structures
Develop technical documentation, properly explain algorithms, organize and clarify ideas used in a solution
Use industry standard conventions for describing algorithm complexity analysis

Global Outcomes
This course teaches to the global outcome of communication.

Total Hours: 60 Lecture Hours: 40 Lab or Clinical Hours: 20