The Certificates in the Foundations of Programming, Data Structures & Algorithms, offered by the University of Michigan-Flint, is an intensive online program designed for students and professionals that seek to add foundational knowledge of computing and programming to fill gaps in their current skillset. Prior experience or coursework in computing is not required. Courses are asynchronous online (so students can learn and practice on their own time) with Q&A sessions offered each week by a faculty instructor from CIT.

This program is suitable for individuals with non-technical backgrounds, who are looking to computing knowledge and skills to change their career path. This certificate program is also for current undergraduate students that do not have programming and algorithms as part of their degree coursework, but would benefit from the kinds of skills they can incorporate into their own program of study. Computing provides an immediate boost of high-demand job skills. This program may also count towards meeting prerequisite requirements for graduate study in fields related to computing offered by the College of Innovation and Technology at the University of Michigan-Flint. 

For these non-credit certificates, participants will undertake 24 hours of coursework (to be certified in all three areas, 72 hours of coursework is required). Each certificate covers a different topic: 1) programming, 2) data structures, and 3) algorithms. Courses will be offered asynchronous online, with synchronous instructor sessions via zoom periodically for Q&A or other assistance with coursework. Each of the courses conclude with a final exam. Successful completion includes testing on the certificate course content with 85% or better score. Certificates of completion will be issued to students who successfully complete the course, to be included with any CIT graduate program admissions materials. 

FOUNDATIONS OF DATA STRUCTURES

This course introduces students to various topics in discrete mathematics, such as set theory, mathematical logic, trees, and graph theory. Applications to relational databases, modeling reactive systems and program verification are also discussed.

Topic Details

Week 1

• Sets

• Mathematical Induction

• Functions, Sequences, and Relations

Week 2

• Algorithms

• Introduction to Number Theory

• Counting Methods

• Recurrence Relations

Week 3

• Graph Theory

• Trees

• Boolean Algebra

• Network Models

Week 4

• Review and Final Test