Scribd
Upload
49 views1 page

Module 1

This document provides an introduction to the course "Discrete Structures I". It discusses how discrete mathematics concepts are useful for describing problems in computer science, with applications in areas like cryptography and software development. Some key tools covered in discrete structures include logic, set theory, functions, and sequences. The document also outlines how algorithms are sets of steps to accomplish computational tasks, and provides examples like compression algorithms, route finding algorithms, and optimization algorithms. It describes the objectives of building mathematical models, developing algorithms, and proving their termination, completeness, soundness, optimality, and efficiency.

Uploaded by

vianvargas43
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views1 page

Module 1

This document provides an introduction to the course "Discrete Structures I". It discusses how discrete mathematics concepts are useful for describing problems in computer science, with applications in areas like cryptography and software development. Some key tools covered in discrete structures include logic, set theory, functions, and sequences. The document also outlines how algorithms are sets of steps to accomplish computational tasks, and provides examples like compression algorithms, route finding algorithms, and optimization algorithms. It describes the objectives of building mathematical models, developing algorithms, and proving their termination, completeness, soundness, optimality, and efficiency.

Uploaded by

vianvargas43
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

DISCRETE STRUCTURES I

Module 1 | Introduction to Discrete Structures


MODULE 1
I. Intro to Discrete Structures
A. Discrete Mathematics and Computer Science A. DISCRETE MATHEMATICS AND COMPUTER
SCIENCE
- Concepts from discrete math are useful for
I. DATA STRUCTURES describing objects and problems in computer
- Mathematical language of computer science. algo and programming languages.
- Develops mathematical reasoning. - Have applications in cryptography, automated
- Gateway to more advanced courses in the field theorem proving and software development.
of mathematical science.
• It is a foundational material for computer science.
• Study of mathematical structures and objects that TOOLS FOR DS
are fundamentally discrete rather than continuous. • Logic
• Set Theory
• Functions
ALGORITHM • Sequences
- CS deals with the design and analysis of
algorithms.
- Algorithms is a set of steps for computer
program to accomplish a task.

Famous Algorithms

• Audio and Video Compression Algorithms


o Lossless
o Lossy
• Route Finding Algorithms
o Dijkstra’s Algorithm
o A* Search Algorithm
o D* Algorithm
• Optimization and Scheduling Algorithms
o Min – Min Algo
o Max -Min Algo

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

Termination
o Prove that your algorithms terminate.
Completeness
o Prove that your algorithms find a
solution when there is one.

Soundness

o Prove that the solution of your algo is


correct.

Optimality

o Prove that your algo find the best


solution.

Efficiency, Time and Space and Complexity

o Prove that your algo finish before the


end of line on earth.

You might also like