• ""
  • ""

Welcome To CSCI 230

Why you should take this class:

At the end of this course, you will be able to:

  1. Analyze algorithms using asymptotic analysis.
  2. Distinguish between the notions of an abstract data type and physical data structure.
  3. Apply stacks, queues, lists, trees, binary search trees, balanced binary trees, hash tables, heaps and priority queues, and graph ADTs in computer solutions.
  4. Implement ADTs and appropriate operations on ADTs.
  5. Be able to identify the advantages and disadvantages of the use of specific data structures in specific problem situations.
  6. Distinguish between various sorting algorithms in terms of how they work and their efficiency in specific problem situations.
  7. Apply written communication skills to produce one or more reports on one to two pages on topics of data structures and algorithms.