Computer Science

Computer Science

Sitterson Hall, CB# 3175
(919) 590-6200

First Session, 2022

COMP 110 Introduction to Programming (3) ***Canceled****

An introduction to programming. Fundamental programming skills, typically using Java, JavaScript, or Python. Problem analysis and algorithm design. Students may not receive credit for both COMP 110 and COMP 116.

COMP 116 Introduction to Scientific Programming (3)

Prerequisite: MATH 231 or 241; a grade of C or better is required. An introduction to programming for computationally oriented scientists. Fundamental programming skills, typically using MATLAB or Python. Problem analysis and algorithm design with examples drawn from simple numerical and discrete problems. Students can receive credit for only one of COMP 110 and 116.

COMP 283 Discrete Structures (3) ***Canceled****

Prerequisite: MATH 231 or Math 241; a grade of C or better is required. Introduces discrete structures (sets, tuples, relations, functions, graphs, trees) and the formal mathematics (logic, proof, induction) used to establish their properties and those of algorithms that work with them. Develops problem-solving skills through puzzles and applications central to computer science.

COMP 455 Models of Languages and Computation (3)

Prerequisites, COMP 210 or 410 and COMP 283 or MATH 381. Introduction to the theory of computation. Finite automata, regular languages, pushdown automata, context-free languages, and Turing machines. Undecidable problems.

COMP 992 Master’s (Non-Thesis) (3)

Permission of the instructor.

COMP 994 Doctoral Dissertation (3)

Permission of the instructor.

Second Session, 2022

COMP 110 Introduction to Programming (3)

An introduction to programming. Fundamental programming skills, typically using Java, JavaScript, or Python. Problem analysis and algorithm design. Students may not receive credit for both COMP 110 and COMP 116.

COMP 283 Discrete Structures (3)***Canceled****

Prerequisite: MATH 231 or Math 241; a grade of C or better is required. Introduces discrete structures (sets, tuples, relations, functions, graphs, trees) and the formal mathematics (logic, proof, induction) used to establish their properties and those of algorithms that work with them. Develops problem-solving skills through puzzles and applications central to computer science.