CSE 5032
Transcript Abbreviation:
Fndns I: Discr Str
Course Description:
Propositional and first-order logic; basic proof techniques; graphs, trees; analysis of algorithms; asymptotic analysis; recurrence relations.
Course Levels:
Undergraduate (1000-5000 level)
Graduate (5000-8000 level)
Designation:
Elective
General Education Course:
(N/A)
Cross-Listings:
(N/A)
Credit Hours (Minimum if “Range”selected):
2.00
Max Credit Hours:
(N/A)
Select if Repeatable:
Off
Maximum Repeatable Credits:
(N/A)
Total Completions Allowed:
(N/A)
Allow Multiple Enrollments in Term:
No
Course Length:
14 weeks (autumn or spring)
12 weeks (summer only)
7 weeks (autumn or spring)
Off Campus:
Never
Campus Location:
Columbus
Instruction Modes:
In Person (75-100% campus; 0-24% online)
Prerequisites and Co-requisites:
Prereq: 5022 or equiv.
Electronically Enforced:
No
Exclusions:
Not open to students with credit for 2321, 625, or 680.
Course Goals / Objectives:
Be competent with using propositional logic.
Be familiar with first-order predicate logic.
Be familiar with proving by contradiction, by ordinary induction and by strong induction.
Be familiar with using asymptotic notation.
Be familiar with analyzing running time of simple iterative algorithms.
Be familiar with graph theory.
Be exposed to analyzing running time of recursive algorithms.
Be exposed to sorting and searching.
Be exposed to designing graph algorithms.
Check if concurrence sought:
No
Contact Hours:
| Topic | LEC | REC out-of-class | REC in-class | Weekly LAB out-of-class | Weekly LAB in-class |
|---|---|---|---|---|---|
| Mathematical reasoning. | 12.0 | 0.0 | 0 | 0.0 | 0 |
| Analysis of simple algorithms. | 6.0 | 0.0 | 0 | 0.0 | 0 |
| Sorting and searching. | 9.0 | 0.0 | 0 | 0.0 | 0 |
| Graph theory. | 9.0 | 0.0 | 0 | 0.0 | 0 |
| Graph algorithms. | 6.0 | 0.0 | 0 | 0.0 | 0 |
| Total | 42 | 0 | 0 | 0 | 0 |
Grading Plan:
Letter Grade
Course Components:
Lecture
Grade Roster Component:
Lecture
Credit by Exam (EM):
No
Grades Breakdown:
| Aspect | Percent |
|---|---|
| Homework | 20% |
| Classroom participation | 10% |
| Midterms, final | 70% |
Representative Textbooks and Other Course Materials:
| Title | Author | Year |
|---|---|---|
| Discrete Mathematics and its Applications | Kenneth H. Rosen |
ABET-CAC Criterion 3 Outcomes:
| Substantial contribution (3-6 hours) | 1 | Analyze a complex computing problem and to apply principles of computing and other relevant disciplines to identify solutions. |
| Substantial contribution (3-6 hours) | 2 | Design, implement, and evaluate a computing-based solution to meet a given set of computing requirements in the context of the program’s discipline. |
| Some contribution (1-2 hours) | 4 | Recognize professional responsibilities and make informed judgments in computing practice based on legal and ethical principles |
| Substantial contribution (3-6 hours) | 6 | Apply computer science theory and software development fundamentals to produce computing-based solutions. |
ABET-ETAC Criterion 3 Outcomes:
(N/A)
ABET-EAC Criterion 3 Outcomes:
| Substantial contribution (3-6 hours) | 1 | an ability to identify, formulate, and solve complex engineering problems by applying principles of engineering, science, and mathematics |
| Substantial contribution (3-6 hours) | 2 | an ability to apply engineering design to produce solutions that meet specified needs with consideration of public health, safety, and welfare, as well as global, cultural, social, environmental, and economic factors |
| Some contribution (1-2 hours) | 4 | an ability to recognize ethical and professional responsibilities in engineering situations and make informed judgments, which must consider the impact of engineering solutions in global, economic, environmental, and societal contexts |
| Some contribution (1-2 hours) | 7 | an ability to acquire and apply new knowledge as needed, using appropriate learning strategies |
Embedded Literacies Info: