CSC-200 CS3: Data Structures

CS3: Data Structures covers the fundamentals of data structures, introduction to analysis of algorithms, and team development of software applications. This course is the third in a series of three required programming courses for a traditional computer science degree. Data structures covered include sets, lists, stacks, queues, linked lists, binary trees, and heaps. Advanced topics include, binary search trees, search and sort algorithms, recursion, and algorithm efficiencies in software development. Students will be introduced to project management and team dynamics through the development of a large software solution.

Credits

4

Prerequisite

CSC-190

Lecture Contact Hours

4

Lab Contact Hours

1

Other Contact Hours

0

Department

  • Computer Science

Grading Scheme

  • Letter

SUNY Gen Ed Credit

  • No

Course Learning Outcomes

  1. Identify and implement advanced data structures for the manipulation of data
  2. Integrate multiple algorithms to form a complex computer solution
  3. Analyze and evaluate the efficiencies of available data structures in order to select the appropriate solution for a given algorithm
  4. Plan, prioritize, and build a complex computer solution within a collaborative work environment