Student working in a lab

Computer Science Track

Illinois Tech’s computer science track for high school dual-enrollment courses is designed for students to sequentially build their skills. Students can take the courses below independently or as part of a sequence, but some courses have prerequisites. Check out the course descriptions below for more information about each course.

If students are looking to join CS331 without an AP score or alternative programming course, they should plan on starting the computer science track no later than the fall semester of their junior year.

Are you interested in partnering with Illinois Tech to offer this track to your school?

Learn more about our dual-enrollment school partnership.

CS 115: Object-Oriented Programming (Two credits)

Introduces the use of a high-level object-oriented programming language as a problem-solving tool, including basic data structures and algorithms, object-oriented programming techniques, and software documentation. Designed for students who have had little or no prior experience with computer programming. For students in CS and CS-related degree programs. Students should only take one of these courses

  • Type: In person only
  • Term: Fall
  • When: Section One (15656/15660): Lecture—Wednesday, 5–6:40 p.m.; Lab—Wednesday, 6:50–7:40 p.m.
  • Requirements: For sophomores, juniors, and seniors who have a minimum 2.5 grade-point average on a 4.0 scale; some computer science-related knowledge will be helpful


CS 116: Object-Oriented Programming I (Two credits )

Introduces more advanced elements of object-oriented programming, including dynamic data structures, recursion, searching and sorting, and advanced object-oriented programming techniques. For students in CS and CS-related degree programs.

  • Type: In person only
  • Term: Spring
  • Requirements: Passing CS115, OR passing a one-semester programming course in Java covering the following topics (confirmed by CS teacher)

CS 331: Data Structures and Algorithms (Three credits)

Implementation and application of the essential data structures used in computer science. Analysis of basic sorting and searching algorithms and their relationship to these data structures. Particular emphasis is given to the use of object-oriented design and data abstraction in the creation and application of data structures.

  • Type: Online
  • Term: Spring
  • Requirements: Passing CS116, OR 5 on AP CS A, OR 4 on AP CS A and CS teacher recommendation, OR passing a one year programming course in any language covering the following topics (confirmed by CS teacher)