Data Structures credit:

4 Hours

Data abstractions: elementary data structures (lists, stacks, queues, and trees) and their implementation using an object-oriented programming language. Solutions to a variety of computational problems such as search on graphs and trees. Elementary analysis of algorithms. Credit is not given toward graduation for: CS 277 if credit for CS 225 has been earned. Prerequisite: CS 126 or CS 128 or ECE 220 ; One of CS 173 , CS 413 , MATH 213 , MATH 314 , MATH 347, MATH 412 , or MATH 413 . This course satisfies the General Education Criteria for: Quantitative Reasoning II