Description

Prerequisite: MA 101 or equivalent completed in high school ; CSC,CSU
Majors and minors;CPE,CPU Majors
Propositional logic and the predicate calculus. Logic gates and circuits.
Methods of proof. Elementary set theory. Mathematical induction. Recursive
definitions and algorithms. Solving recurrences. The analysis of algorithms
and asymptotic growth of functions. Elementary combinatorics. Introduction
to graph theory. Ordered sets, including posets and equivalence relations.
Introduction to formal languages and automata.

General Information

Webassign Homework
http://webassign.ncsu.edu
Lecture Locations
001 - Bitzer - MWF - EB1 1011
002- Barnes - TR - Hunt Library

Announcements

Announcements are not public for this course.
Staff Office Hours
NameOffice Hours
Tiffany Barnes
When?
Where?
David Warren
When?
Where?
Donald Bitzer
When?
Where?
Fogo Tunde-Onadele
When?
Where?
Guojing Zhou
When?
Where?
Markel Sanz Ausin
When?
Where?
Rachel Harred
When?
Where?
Smit Anand
When?
Where?
Erick Draayer
When?
Where?
Akintunde Ruth Oluwadamilola
When?
Where?
Alessandra Scafuro
When?
Where?
Ziwei Wu
When?
Where?
Xiaoting Fu
When?
Where?
Kyungjin Park
When?
Where?
Kyle Kloster
When?
Where?
Maryam Riahi
When?
Where?
Levente Szabo
When?
Where?
Tasmia Shahriar
When?
Where?
Mark Abdelshiheed
When?
Where?
Behrooz Mostafavi
When?
Where?