Academics

Apply Now
About Us
Fast Facts
Prospective Students
Current Students

About Us
Academic Programs
News
Events
Support Pace
Apply Now
Learn More
Contact Us

Course Detail Information

Select the desired Level or Schedule Type to find available classes for the course.

CS 241 - Data Structures and Algorithms
Course Description:Concepts of abstract data types (ADT) including stack, queue, priority queue, hashtable, and binary search tree. Problem-Solving with the ADTs. Tradeoffs of ADT implementation with arrays and linked lists. Basic sorting and searching algorithms. Algorithm run-time analysis. Course Rotation: Fall and Spring. 4.000 Credit hours 4.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture, Tutorial Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Undergraduate Prerequisites: Undergraduate level CS 122 Minimum Grade of C or Undergraduate level IS 323 Minimum Grade of C

CS 241 - Data Structures and Algorithms

Course Description:Concepts of abstract data types (ADT) including stack, queue, priority queue, hashtable, and binary search tree. Problem-Solving with the ADTs. Tradeoffs of ADT implementation with arrays and linked lists. Basic sorting and searching algorithms. Algorithm run-time analysis.

Course Rotation: Fall and Spring.

4.000 Credit hours
4.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture, Tutorial

Computer Science Department

Restrictions:
Must be enrolled in one of the following Levels:
Undergraduate

Prerequisites:
Undergraduate level CS 122 Minimum Grade of C or Undergraduate level IS 323 Minimum Grade of C