Module #1

Question 1

It is the mathematical language of
computer science.

Answer 1

Discrete Structures

Question 2

It develops mathematical
reasoning

Answer 2

Discrete Structures

Question 3

It is a gateway to more advanced
courses in the field of
mathematical science.

Answer 3

Discrete Structures

Question 4

It is the study of mathematical structures and objects that are
fundamentally discrete rather than continuous.

Answer 4

Discrete Structures

Question 5

a series of steps to accomplish a task.

Answer 5

Algorithm

Question 6

is a set of steps for a computer
program to accomplish a task.

Answer 6

Algorithm

Question 7

Computer Science deals with

Answer 7

the design and analysis of algorithms.

Question 8

Audio and Video Compression Algorithms

Answer 8

Lossless
Lossy

Question 9

Route Finding Algorithms

Answer 9

Dijkstra’s Algorithm
A* Search Algorithm
D* Algorithm

Question 10

Optimization and Scheduling Algorithms

Answer 10

Min–Min algorithm
Max-Min algorithm

Question 11

Prove that your algorithms terminate.

Answer 11

TERMINATION

Question 12

Prove that your algorithms find a solution when there is one.

Answer 12

COMPLETENESS

Question 13

Prove that the solution of your algorithms is correct.

Answer 13

SOUNDNESS

Question 14

Prove that your algorithms find the best solution

Answer 14

OPTIMALITY

Question 15

Prove that your algorithms finish before the end of line on earth.

Answer 15

EFFICIENCY, TIME AND SPACE COMPLEXITY

Question 16

Useful Tools for Discrete Structures

Answer 16

• Logic
• Set Theory
• Functions
• Sequences

Question 17

What’s your job?

Answer 17

• To build a mathematical model for each scenario.
• To develop an algorithm for solving each task.
• To justify that your solutions work.