Course Title
Discrete Math 2
Course Description
Algorithms, relations, topics in graph theory, tree traversal, spanning trees, Boolean algebra, logic gates, circuits, automata, Turing machines.
Pass/Fail Only?
No
Faculty Permission Required?
No
Credit Hours Min
3
Instructional Method
Lecture
Prerequisite
Complete ALL of the following Courses:
Name
Learning Objective 1
Objective
Follow the steps of an algorithm to produce proper output.
Name
Learning Objective 2
Objective
Create algorithms to perform various tasks.
Name
Learning Objective 3
Objective
Know the basic definitions concerning relations and interpret them in specific examples.
Name
Learning Objective 4
Objective
Be able to represent relations in multiple ways.
Name
Learning Objective 5
Objective
Know the basic definitions concerning graphs and interpret them in specific examples.
Name
Learning Objective 6
Objective
Be able to represent graphs in multiple ways.
Name
Learning Objective 7
Objective
Know the basic definitions concerning trees and interpret them in specific examples.
Name
Learning Objective 8
Objective
Apply the theory of trees to decision-making and searching
Name
Learning Objective 9
Objective
Solve problems and prove identities in Boolean algebra
Name
Learning Objective 10
Objective
Construct combinatorial circuits that perform basic computational tasks.
Name
Learning Objective 11
Objective
Construct and interpret phrase-structure grammars.
Name
Learning Objective 12
Objective
Construct and interpret finite-state machines.
Name
Learning Objective 13
Objective
Know the basic definitions concerning formal languages and interpret them in specific examples.
Name
Learning Objective 14
Objective
Know the definition of a Turing machine and interpret the actions of specific examples.