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)** Many high-level languages come with their own algorithm libraries.

(True or False) Many high-level languages come with their own algorithm libraries.

**(True or False)** Semantically, recursion is the process of a function calling itself (either directly or indirectly).

(True or False) Semantically, recursion is the process of a function calling itself (either directly or indirectly).

**(True or False)** To prevent infinite recursion, we always provide a condition or base case.

(True or False) To prevent infinite recursion, we always provide a condition or base case.

**(True or False)** Container classes in C++ have the same role as the collections frameworks in languages like Java.

(True or False) Container classes in C++ have the same role as the collections frameworks in languages like Java.

Test your knowledge of tree algorithms and templates.

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: Tree, Algorithms, and Templates