Select a Course:
CSIS 211 Introduction to Data Structures and Algorithms

Course Description

This course is intended to introduce students to the concept of data structures and algorithms. Basic topics in this course include arrays, lists, stacks and queues. Advanced topics such as dictionaries including binary search trees, hashing, priority queues, and heaps will also be covered. In addition, this course will introduce analysis of algorithms, sorting algorithms, and object-oriented programming techniques including abstract data types, inheritance, and polymorphism.

By successfully completing this course you will earn 3 units of college credit.

Table of Contents

Course Objectives

  • Compose computer programs using a high level programming languages as a means of problem solving. This includes abstract data types, inheritance, and polymorphism.
  • Evaluate the advanced features of an object oriented programming language including arrays, pointer manipulation, recursion, and object oriented programming.
  • Discover how data is stored and manipulated in a computer by applying searching and sorting alogorithms.
  • Analyze algorithm complexity using Big O notation.
  • Develop a fundamental knowledge of the practical uses of data structures and their applications. This includes stacks, queues, lists, and binary trees
  • Evaluate sorting and searching algorithms complexities and their usage
  • Solve sorting and searching problems by applying the most efficient algorithm.
Table of Contents

 Course Learning Outcomes

  • Demonstrate an understanding of abstract data types and polymorphism
  • Apply BigO notation to describe algorithmic complexity
  • Apply proper sorting techniques to various data sizes.
  • Demonstrate the proper use of tree, lists, stacks and queues.
  • Use pointers and dynamic memory allocation to create list data structures.
Table of Contents