Cybersecurity Center

CS250 Data Structures I

Course Description

Review of basic structures; object-oriented techniques; analysis, comparison, and design of algorithms for data structure processing; binary trees, recursion; sorting, searching methods. Prerequisites: CS 214 with a grade of C- or better and MATH 128 or equivalent. IAI: CS 912.

Learning Outcomes

  • Write programs in a high level language implementing text and binary files, linked lists, recursion, and the abstract data types such as stacks and queues 
  • Select and utilize an efficient sorting algorithm for a given problem. 
  • Describe and apply the principles of memory management. 
  • Analyze algorithms for time and storage complexity