Syllabus
Computational Thinking

Computational Thinking

COSC-3302

Credit Spring 2021
01/19/2021 - 05/16/2021

Course Information

Section 001
Distance Learning
W 18:00 - 20:45
DLS DIL
Ralph Hooper

Section 001
Laboratory
W 20:45 - 21:45
DLS DIL
Ralph Hooper

Office Hours

  • M W
    11 am - 1 pm
    Online
    virtual via Blackboard Collaborate -- email for appt
  • M W
    3:30 pm - 5:30 pm
    Online
    virtual via Blackboard Collaborate -- email for appt

Course Requirements

5 Discussion assignments – average will be 20% of your grade

5 Terminology assignments – average will be 20% of your grade

5 Project assignments – average will be 30% of your grade

3 Competency Exams – average will be 30% of your grade

An overall grade will be assigned based on the following scale:

90% - 100% A 89% - 80% B 79% - 70% C 69% - 60% D 0% - 59% F

Readings

Do NOT buy the textbook materials access until you receive detailed instructions from your instructor!

Discrete Math with Applications, Susanna Epp, 5th Edition, Cengage Learning, 2020.

Course Subjects

A focus on discrete mathematical tools for the working computer scientist. An emphasis is placed on using logical notation to express rigorous mathematical arguments. Subjects may include introduction to graph theory, recurrences, sets, functions, and an introduction to program correctness.

This course is designed to provide students in the BAS Software Development program with a methodology for solving problems utilizing modern computing devices. This course includes both an overview of Computational Thinking tools (Abstraction, Decomposition, Pattern Recognition, and Algorithm Design) and an Introduction to the Discrete Mathematical topics of Logic, Proof, Sets, Functions, Relations, Counting, and Graphs.

Student Learning Outcomes/Learning Objectives

1. Utilize Computational Thinking tools such as Abstraction, Decomposition, Pattern Recognition, and Algorithmic Design to formulate problems, automate solution procedures, and analyze results

2. Make use of Logical Statements and associated operators to express mathematical concepts and relationships related to problem solving

3. Construct proofs of assertions by choosing appropriate techniques from your proof toolset

4. Apply correct mathematical terminology and notation to formulate problems

5. Model sequences as recurrence relations

6. Distinguish between and work with the definitions and properties of Sets, Functions, and Relations

7. Formulate and Solve problems using probability and counting techniques

8. Demonstrate an understanding of Graphs and related topics (edges, vertices, walks, trails, paths, and circuits)

Schedule

Week

Competency

Readings and Multimedia

Activities

Due Date[1]

1

Jan 18 - 24

Orientation
Competency 1

Onboarding
Computational Thinking

Orientation Assignment

Jan 27

2

Jan 25 - 31

Competency 1

Logic of Compound Statements

Terminology 1
Discussion 1

Feb 7

3

Feb 1 - 7

Competency 1

Logic of Quantified Statements

Project 1

Feb 7

4

Feb 8 - Feb 14

Competency 2

Methods of Proof

Terminology 2
Discussion 2

Feb 21

5

Feb 15 - 21

Competency 2

Mathematical Induction and Recursion

Project 2

Feb 21

6

Feb 22 - 28

Review and Exam 1

 

 

Feb 28

7

Mar 1 - 7

Competency 3

Set Theory

Terminology 3
Discussion 3

Mar 14

8

Mar 8 - 14

Competency 3

Boolean Algebra

Project 3

Mar 14

9

Mar 22 - 28

Competency 4

Properties of Functions

Terminology 4

 Apr 11

10

Mar 29 - Apr 4

Competency 4

Properties of Relations

Discussion 4

Apr 11

11

Apr 5 - Apr 11

Competency 4

Applications to Cryptography

Project 4

Apr 11

12

Apr 12 - 18

Review and Exam 2

 

 

Apr 18

13

Apr 19 - 25

Competency 5

Counting

Terminology 5

May 9

14

Apr 26 - May 2

Competency 5

Probability

Discussion 5

May 9

15

May 3 - 9

Competency 5

Theory of Graphs

Project 5

May 9

16

May 10 - 16

Review and Exam 3

 

 

May 16



[1] All assignments are due no later than 11:59 PM on the date specified.