Noncredit Certificates
Social:
Noncredit certificates are available for students looking to strengthen their technical skills for career advancement or to qualify for admission to a College of Innovation & Technology graduate program. These intensive, asynchronous online courses are designed to fill skill gaps for students who have already completed undergraduate degrees.
Courses are primarily self-paced, with weekly live Q&A sessions via Zoom led by CIT faculty for additional support. Each course concludes with a final exam, and students who successfully complete a course will receive a certificate of completion, which can be included with CIT graduate program application materials.
Computing certificates are four-week courses scheduled back-to-back, and registration is open year-round.
Please note: Noncredit certificates are not eligible for financial aid.
On this page:
Foundations of Object-Oriented Programming
Introduces problem-solving and programming principles for scientific and technical applications using Java. Covers step-wise refinement, program decomposition, and core language concepts, including iteration, selection, input-output protocols, arrays, structures and subprograms. Students learn algorithm design, inheritance, complexity, and data structures such as linked lists, stacks, queues and trees, along with recursion, testing and debugging.
Objectives
Students learn to analyze, design, write, compile, run and debug programs in Java, gaining fluency in object-oriented programming and the keywords and coding structures needed to build a complete Java program. Upon completing the course, students will be able to:
- Recognize object-oriented programming concepts and create classes
- Design algorithms using pseudocode, flowcharts and structured charts
- Use object-oriented programming methods to solve a variety of problems, and apply foundational design techniques to those solutions
- Use an integrated development environment to edit, build, debug and test programs
- Describe basic and advanced data structures, including linked lists, stacks, queues and trees, and outline differences among data structures and searching and sorting algorithms
- Calculate and analyze the complexity of small to medium programs built with basic data structures
- Implement and evaluate data structures and algorithms for efficient, appropriate solutions to assigned problems, with demonstrable results
Registration links
Foundations of Programming
Introduces programming concepts, problem-solving strategies and algorithmic thinking using C++. Covers variables, control structures, functions, arrays, object-oriented programming and file handling, with emphasis on writing clean, efficient, well-documented code and developing strong problem-solving skills.
Objectives
Students completing this course will be able to:
- Apply basic principles of programming in C++
- Solve problems using algorithms and C++ programming constructs
- Design, implement and test programs that solve real-world problems
- Understand control structures (if-else, loops), functions, arrays and basic object-oriented programming concepts
- Write, debug and optimize code efficiently, following best practices
- Work with files for input and output operations in C++
- Collaborate on projects and understand the importance of code readability and documentation
Registration links
Foundations of Data Structures
Introduces problem-solving and programming principles for scientific and technical applications using Java. Covers step-wise refinement, program decomposition, and core language concepts, including iteration, selection, input-output protocols, arrays, structures and subprograms. Students learn algorithm design, inheritance, complexity, and data structures such as linked lists, stacks, queues and trees, along with recursion, testing and debugging.
Objectives
Students completing this course will be able to:
- Classify the nodes of a tree by parent, children, siblings, ancestors and descendants
- Design and conduct experiments to verify the theoretical complexities of algorithm implementations
- Identify the properties (transitivity, reflexivity, symmetry and anti-symmetry) of a binary relation
- Identify various paths and cycles, such as Euler and Hamiltonian, in a graph
- Perform complexity analysis of simple algorithms
- Prove the correctness of simple algorithms using program assertions
- Understand and use the basic concepts of relational database systems
- Use a truth table to determine the veracity of a proposition
- Write an induction proof
Registration links
Refund Policy
Refunds for all certificates may be requested up to seven days before the start of coursework. Refunds requested after that date will not be issued.