Course Descriptions

The Course Descriptions catalog describes all undergraduate and graduate courses offered by Michigan State University. The searches below only return course versions Fall 2000 and forward. Please refer to the Archived Course Descriptions for additional information.

Course Numbers Policy

Course Search




Keyword Search



Course Descriptions: Search Results

CPS 260 Discrete Structures in Computer Science

Description:
Propositional and first order logic. Equivalence, inference. Mathematical induction, diagonalization principle. Set operations, relations, functions. Lattices, Boolean algebras. Truth tables and minimization of Boolean expressions. Applications to CPS.
Effective Dates:
FS92 - FS98

CPS 260 Discrete Structures in Computer Science

Description:
Propositional and first order logic. Equivalence, inference. Mathematical induction, diagonalization principle. Set operations, relations, functions. Lattices, Boolean algebras. Truth tables and minimization of Boolean expressions.
Effective Dates:
SS99 - SS99

CSE 260 Discrete Structures in Computer Science

Description:
Propositional and first order logic. Equivalence, inference. Mathematical induction, diagonalization principle. Set operations, relations, functions. Lattices, Boolean algebras. Truth tables and minimization of Boolean expressions.
Effective Dates:
US99 - US99

CSE 260 Discrete Structures in Computer Science

Description:
Propositional and first order logic. Equivalence, inference and method of proof. Mathematical induction, diagonalization principle. Basic counting. Set operations, relations, functions. Grammars and finite state automata. Boolean algebra. Truth tables and minimization of Boolean expressions. Applications to computer science and engineering.
Effective Dates:
FS99 - US04

CSE 260 Discrete Structures in Computer Science

Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: Credits: 4   Lecture/Recitation/Discussion Hours:4
Prerequisite:
MTH 133 or MTH 126 or MTH 153H or LBS 119
Not open to students with credit in:
CPS 260
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.
Effective Dates:
FS04 - FS11

CSE 260 Discrete Structures in Computer Science

Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: Credits: 4   Lecture/Recitation/Discussion Hours:4
Prerequisite:
MTH 133 or MTH 126 or MTH 153H or LB 119
Not open to students with credit in:
CPS 260
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.
Effective Dates:
SS12 - FS13

CSE 260 Discrete Structures in Computer Science

Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: Credits: 4   Lecture/Recitation/Discussion Hours:4
Prerequisite:
MTH 133 or MTH 126 or MTH 153H or LB 119
Not open to students with credit in:
CPS 260
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.
Effective Dates:
SS14 - US18

CSE 260 Discrete Structures in Computer Science

Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: Credits: 4   Lecture/Recitation/Discussion Hours:5
Prerequisite:
MTH 133 or MTH 126 or MTH 153H or LB 119
Not open to students with credit in:
CPS 260
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.
Effective Dates:
FS18 - US22

CSE 260 Discrete Structures in Computer Science

Semester:
Fall of every year, Spring of every year, Summer of every year
Credits:
Total Credits: Credits: 4   Lecture/Recitation/Discussion Hours:5
Prerequisite:
MTH 133 or MTH 126 or MTH 153H or LB 119
Not open to students with credit in:
CPS 260
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.
Effective Dates:
FS22 - US25

CSE 260 Discrete Structures in Computer Science

Semester:
Fall of every year, Spring of every year, Summer of every year
Credits:
Total Credits: Credits: 4   Lecture/Recitation/Discussion Hours:5
Prerequisite:
MTH 124 or MTH 132 or MTH 152H or LB 118
Not open to students with credit in:
CPS 260
Description:
Propositional and first order logic. Equivalence and methods of proof. Basics of counting. Set operations, relations, functions. Grammars and finite state automata. Discrete probability. Applications to computer science and engineering.
Effective Dates:
FS25 - Open