Log in Register

Steps to start the course with Carlos Raul

1

Share your information

Insert the email with which you signed up in the app or will be signing up, and complete the payment using your debit or credit card.

+

+

2

Unlock all content

After completing the payment, you will receive a confirmation email and the course will be unlocked in the app.

+

+

3

Start Learning

Take at least 10 mins of your day to complete one lesson from the teacher and practice with our engaging learning activities.

Ready for the next step?

Buy Now

EducUp

Start the course

from EducUp's App

EducUp

Carlos is a Senior Software Engineer and startup founder who loves building and impacting people’s lives using technology and innovation.

View profile of educuper

EducUp

Carlos Raul is waiting for you

What you will learn

Become premium and unlock all the content. Prices are in USD (American dollars).

You will be able to implement efficient solutions to complex real-world problems.

You will be able to recognize the data structures needed to streamline numerous operations.

You will enjoy 55 FREE lessons and you will be able to continue the course by choosing one of our plans.

You will be able to study in your free time, from anywhere, with 2922 didactic explanations.

You will strengthen your analysis and abstraction skills with 5273 dynamic exercises.

You will strengthen your coding skills with 1306 questions and answers on Data Structure and Algorithms.

In just 2 months you should be able to complete this course.

Become premium and unlock all the content. Prices are in USD (American dollars).

You will be able to implement efficient solutions to complex real-world problems.

You will be able to recognize the data structures needed to streamline numerous operations.

You will enjoy 55 FREE lessons and you will be able to continue the course by choosing one of our plans.

You will be able to study in your free time, from anywhere, with 2922 didactic explanations.

You will strengthen your analysis and abstraction skills with 5273 dynamic exercises.

You will strengthen your coding skills with 1306 questions and answers on Data Structure and Algorithms.

In just 2 months you should be able to complete this course.

EducUp

Take a diagnostic of the course!

EducUp

Course Content

Challenge 1

Abstract Data Types

Abstract Data Types

Array and Array Operations

Array and Array Operations

Array and Array Operations

Circular Linked Lists

Circular Linked Lists

Circular Linked Lists

Stack Operations – 1

Stack Operations – 1

Stack Operations – 1

Stack using Array

Stack using Array

Stack using Array

Stack Operations – 2

Stack Operations – 2

Stack Operations – 2

Stack using Linked List

Stack using Linked List

Stack using Linked List

Queue using Array

Queue using Array

Queue using Array

Stack Operations – 3

Stack Operations – 3

Stack Operations – 3

Queue Operations

Queue Operations

Queue Operations

Queue using Linked List

Queue using Linked List

Queue using Linked List

Priority Queue

Priority Queue

Singly Linked Lists Operations – 1

Singly Linked Lists Operations – 1

Singly Linked Lists Operations – 1

Double Ended Queue (Dequeue)

Double Ended Queue (Dequeue)

Double Ended Queue (Dequeue)

Singly Linked Lists Operations – 2

Singly Linked Lists Operations – 2

Singly Linked Lists Operations – 2

Queue using Stacks

Queue using Stacks

Queue using Stacks

Singly Linked Lists Operations – 3

Singly Linked Lists Operations – 3

Singly Linked Lists Operations – 3

Stack using Queues

Stack using Queues

Stack using Queues

Singly Linked Lists

Singly Linked Lists

Singly Linked Lists

Doubly Linked Lists

Doubly Linked Lists

Doubly Linked Lists

Application of Stacks

Application of Stacks

Prefix to Infix Conversion

Prefix to Infix Conversion

Prefix to Infix Conversion

Decimal to Binary using Stacks

Decimal to Binary using Stacks

Decimal to Binary using Stacks

Postfix to Infix Conversion

Postfix to Infix Conversion

Postfix to Infix Conversion

Evaluation of an Infix Expression (Not Parenthesized)

Evaluation of an Infix Expression (Not Parenthesized)

Evaluation of an Infix Expression (Not Parenthesized)

Towers of Hanoi

Towers of Hanoi

Towers of Hanoi

Evaluation of a Prefix Expression

Evaluation of a Prefix Expression

Evaluation of a Prefix Expression

Reverse a Word using Stack

Reverse a Word using Stack

Reverse a Word using Stack

Evaluation of a Postfix Expression

Evaluation of a Postfix Expression

Evaluation of a Postfix Expression

Balanced Parenthesis

Balanced Parenthesis

Balanced Parenthesis

Infix to Prefix Conversion

Infix to Prefix Conversion

Infix to Prefix Conversion

Infix to Postfix Conversion

Infix to Postfix Conversion

Infix to Postfix Conversion

Types of Lists

Skip List

Skip List

Xor Linked List

Xor Linked List

Xor Linked List

Self Organizing List

Self Organizing List

Self Organizing List

Free List

Free List

Heap

Heap

Heap

Ternary Heap – 2

Ternary Heap – 2

Ternary Heap – 2

Pairing Heap

Pairing Heap

Binary Heap

Binary Heap

Leftlist Heap

Leftlist Heap

Weak Heap

Weak Heap

Skew Heap

Skew Heap

Binomial and Fibonacci Heap

Binomial and Fibonacci Heap

Binomial and Fibonacci Heap

D-ary Heap

D-ary Heap

Min/Max Heap

Min/Max Heap

Ternary Heap – 1

Ternary Heap – 1

Ternary Heap – 1

Graph

Adjacency List

Adjacency List

Propositional and Directed Acyclic Word Graph

Propositional and Directed Acyclic Word Graph

Propositional and Directed Acyclic Word Graph

Graph

Graph

Directed Graph

Directed Graph

Adjacency Matrix

Adjacency Matrix

Adjacency Matrix

Directed Acyclic Graph

Directed Acyclic Graph

Directed Acyclic Graph

Incidence Matrix and Graph Structured Stack

Incidence Matrix and Graph Structured Stack

Incidence Matrix and Graph Structured Stack

Multigraph and Hypergraph

Multigraph and Hypergraph

Multigraph and Hypergraph

Binary Decision Diagrams & And Inverter Graph

Binary Decision Diagrams & And Inverter Graph

Binary Decision Diagrams & And Inverter Graph

Undirected Graph

Undirected Graph

Undirected Graph

Challenge 2

Arrays Types

Bit Array

Bit Array

Sparse Matrix

Sparse Matrix

Count Inversion

Count Inversion

Count Inversion

Rotation Array Operation

Rotation Array Operation

Rotation Array Operation

Parallel Array

Parallel Array

Dynamic Array

Dynamic Array

Reversal Array Operation

Reversal Array Operation

Reversal Array Operation

Sparse Array

Sparse Array

Suffix Array

Suffix Array

Number of Jumps to Reach End-array Operation

Number of Jumps to Reach End-array Operation

Number of Jumps to Reach End-array Operation

Matrix

Matrix

Binary Trees

Inorder Traversal

Inorder Traversal

Inorder Traversal

Binary Trees using Array

Binary Trees using Array

Binary Trees using Array

AA Tree

AA Tree

AVL Tree

AVL Tree

Binary Trees using Linked Lists

Binary Trees using Linked Lists

Binary Trees using Linked Lists

Cartesian Tree

Cartesian Tree

Binary Tree Operations

Binary Tree Operations

Binary Tree Operations

Weight Balanced Tree

Weight Balanced Tree

Weight Balanced Tree

Preorder Traversal

Preorder Traversal

Preorder Traversal

Red Black Tree

Red Black Tree

Postorder Traversal

Postorder Traversal

Postorder Traversal

Top Tree

Top Tree

Splay Tree

Splay Tree

Binary Tree Properties

Binary Tree Properties

Binary Tree Properties

Treap

Treap

Binary Search Tree

Binary Search Tree

Binary Search Tree

Balanced Binary Tree

Balanced Binary Tree

Balanced Binary Tree

Tango Tree

Tango Tree

Self Balancing Binary Search Tree

Self Balancing Binary Search Tree

Self Balancing Binary Search Tree

Randomized Binary Search Tree

Randomized Binary Search Tree

Randomized Binary Search Tree

Rope

Rope

Threaded Binary Tree

Threaded Binary Tree

Threaded Binary Tree

B-Trees

B-Tree

B-Tree

2-3 Tree

2-3 Tree

B+ Tree

B+ Tree

Trees

Ternary Tree – 1

Ternary Tree – 1

Ternary Tree – 1

Disjoint-Set Data Structure

Disjoint-Set Data Structure

Disjoint-Set Data Structure

Bin

Bin

Ternary Tree – 2

Ternary Tree – 2

Ternary Tree – 2

K-ary Tree – 1

K-ary Tree – 1

KD Tree

KD Tree

Expression Tree

Expression Tree

Expression Tree

K-ary Tree – 2

K-ary Tree – 2

Van Emde Boas Tree

Van Emde Boas Tree

Van Emde Boas Tree

Trie

Suffix Tree – 2

Suffix Tree – 2

Suffix Tree – 2

Trie

Trie

Suffix Tree – 1

Suffix Tree – 1

Suffix Tree – 1

Hash Tables

Hash Tables

Hash Tables

Hash Tables with Quadratic Probing

Hash Tables with Quadratic Probing

Hash Tables with Quadratic Probing

Hash Tables with Linear Probing

Hash Tables with Linear Probing

Hash Tables with Linear Probing

Hash Tables Chaining using Linked Lists

Hash Tables Chaining using Linked Lists

Hash Tables Chaining using Linked Lists

Hashing Functions

Hashing Functions

Hashing Functions

Double Hashing

Double Hashing

Hash Tables Chaining using Doubly Linked Lists

Hash Tables Chaining using Doubly Linked Lists

Hash Tables Chaining using Doubly Linked Lists

Hash Tree

Hash Tree

Hash Tables Chaining with Binary Trees

Hash Tables Chaining with Binary Trees

Hash Tables Chaining with Binary Trees

Min Hash

Min Hash

Hash Tables Chaining with List Heads

Hash Tables Chaining with List Heads

Hash Tables Chaining with List Heads

Direct Addressing Tables

Direct Addressing Tables

Direct Addressing Tables

Download our app

Choose one of the stores

Choose one of the stores

en

Course Categories

Personal Finance

Contact US

Miami, Florida US.

hello@educup.io