Discrete Mathematical Algorithms and Data Structures-02-02.png

momoexp4.tar.gz

java and C++

OnlyPython

OnlyJava

OnlyCplusplus

OnlyC

JavaLang3

Discrete mathematics is the basis of several popular algorithms. This course shows the discreteness of data structures and algorithms. It can benefit programmers with a non-CS background looking to strengthen their foundations by connecting theoretical concepts with practical programming scenarios.

The course starts with discussing relating discrete mathematics with algorithms and data structures. You will have examples demonstrating variables, conditional expressions, and arrays as basic building blocks of programming. Then, you will use classes and objects to define and implement linear data structures. You will also learn about the binary tree traversals and templates and the topics of time complexity, set difference, and rearranging the values in a string.

By the end of the course, you will have a strong grasp of algorithm design, data structure implementation, and overall problem-solving.

Programming Discrete Math Concepts for Beginners

**(True or False)** In De Morgan’s laws:

`not (a and b) is the same as (not a) or (not b)`

(True or False) In De Morgan’s laws:
<code>not (a and b) is the same as (not a) or (not b)</code>

**(True or False)** A programming language continuously checks that a logical operator's left operand (the first one) is evaluated before the right operand (the second one).

(True or False) A programming language continuously checks that a logical operator’s left operand (the first one) is evaluated before the right operand (the second one).

How many logical operators are there?

A programming language always checks that the left operand (the first one) is evaluated before the right operand (the second one).

The AND (`&&`) and OR (`||`) operations both use this special evaluation.

The second condition is not checked, depending on what type of operations take place.

What’s true for short-circuit evaluation?

What’s true for short-circuit evaluation?

It’s syntactically wrong but semantically correct.

It's semantically wrong but syntactically correct.

It's semantically wrong and syntactically wrong.

Find a flaw in this sentence: 

“Here’s my chair, Emilia.”

Find a flaw in this sentence:
“Here’s my chair, Emilia.”

Test your knowledge of using logical expressions in algorithms.

Course Introduction

Programming Language and Boolean Algebra

Logical Expressions and Algorithms

Arrays and Discrete Mathematics

Classes, Objects, and Methods

Linear Data Structures

Tree, Algorithms, and Templates

Time Complexity

Propositional Logic

Combinatorics

Wrapping Up

Quiz: Logical Expressions and Algorithms