Back to previous page

CS 252 - Data Structures

http://www.bhc.edu/canvas
3.0
Prerequisite: CS 225 and MATH 161 "C" or better. Includes: various algorithmic paradigms, recurrence relations; complexity analysis; advanced algorithms for sorting, searching and string processing; advanced abstract data types - sets, graphs, heaps, hash tables; random number generation, object-oriented programming.
Textbook information is available at http://www.bhc.edu/on-campus/bookstore/ You will need to know the BHC course number, e.g., BL 201, and the section number.
Upon successful completion of this course, the student shall be able to: A. Write programs in an object-oriented programming language implementing linked lists, stacks, queues, trees, graphs, and recursion. B. Select and utilize an efficient search algorithm for a given problem; select and utilize an efficient sort algorithm for a given problem. C. Determine the time and storage complexity of complex algorithms. D. Use the advanced principles of memory management. E. Utilize object oriented programming techniques. F. Analyze and choose the best data structure for a particular set of data.
Black Hawk College: 6600 34th Ave Moline, IL 61265 Phone: 3097965000