This course is a bridge course and designed for students who do not meet admission requirements for Master of Science in Computer Science. This course explores the theoretical foundations and principles of computer science, including an overview of computational complexity. The course covers definitions of sets, operations on sets, formal logic, functions and relations, graphs and trees, graph algorithms, analysis of algorithms, finite automata, regular languages and regular grammars, properties of regular language, context-free languages, and Turing machines. The students will complete problem solving assignments connected with theory. The credits for this course are not counted towards the required 30 credits for the Master’s Degree program.
CS 501: DISCRETE STRUCTURES
Class Program