Gain insights into connecting discrete mathematics with programming. Explore variables, expressions, data structures, and algorithm design to enhance your problem-solving and implementation skills.

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

# Introduction to linked lists

We've seen that the two most natural ways of storing sequences in computer memory are arrays and linked lists. `ArrayList` is an ADT that uses all concepts of handling arrays more flexibly. That is why the time complexity is the same for arrays and linked lists. 

Linked lists don't work that way. We usually model the memory as a sequence of memory cells, each of which has a unique address. An array or an `ArrayList` is a contiguous piece of memory. Each cell of the memory stores one object, which is a part of the sequence stored in an array or an `ArrayList`. 

In a singly linked list, two successive memory cells are allocated for each object of the sequence. Two memory cells form a node of a sequence. The first cell stores the value of the object, and the second cell stores a reference to the next node of the list. 


Learn the workings of a node-based linked list.

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

List Linked through Nodes

Introduction to linked lists