Algorithms and Data Structures

Algorithms and Data Structures, available at $64.99, has an average rating of 4.3, with 96 lectures, 2 quizzes, based on 10 reviews, and has 197 subscribers.

You will learn about Algorithm creation Development of programming logic How to optimize resources, operations and execution times Different data structures, how they work and how to implement them in code This course is ideal for individuals who are Programming students or Interested in improving their programming skills It is particularly useful for Programming students or Interested in improving their programming skills.

Enroll now: Algorithms and Data Structures

Summary

Title: Algorithms and Data Structures

Price: $64.99

Average Rating: 4.3

Number of Lectures: 96

Number of Quizzes: 2

Number of Published Lectures: 96

Number of Published Quizzes: 2

Number of Curriculum Items: 109

Number of Published Curriculum Objects: 109

Number of Practice Tests: 2

Number of Published Practice Tests: 2

Original Price: $199.99

Quality Status: approved

Status: Live

What You Will Learn

Algorithm creation
Development of programming logic
How to optimize resources, operations and execution times
Different data structures, how they work and how to implement them in code

Who Should Attend

Programming students
Interested in improving their programming skills

Target Audiences

Programming students
Interested in improving their programming skills

In this Algorithms and Data Structures course you will learn in a basic and very complete way the most elementary notions about these pillars of software development. This course will give a complete tour of all the most basic concepts to learn how to create your own algorithms, thanks to the global vision that you will acquire. In fact throughout the course you will learn how to apply each idea to any programming language.

You will learn fundamental programming skills:

– Elementary Algorithms

– Development of programming logic

– Best practices when writing code

– Optimization of resources, time and operations in an algorithm

– Data Structures implementation in code

In addition you will have downloadable didactic material, advice from my +15 years of programming experience, solved exercises and examples of use for real life situations, so that you understand what logic follows each algorithm and know how to implement it in the language of your choice.

The course is divided into 2 main blocks addressed throughout the different sections:

Algorithms

In this block you will learn how to develop from scratch algorithms to solve problems no matter what programming language or technology you use. We will mainly focus on the development logic so that you will be able to transfer the idea to your own development environment. Therefore, no matter what language you use, the contents of these classes will be totally useful for you.

Among the different algorithms that we will see are included the sorting algorithms with a detailed explanation of how they work and each line and element of the code that they have. Did you know that in this course we will create a sorting algorithm faster than the famous Bubble Sort, Selection or Insertion? If you want to know how to create algorithms with optimization and efficiency in mind…this is the ideal course for you.

Data Structures

In this block you will learn about the different Data Structures that exist, from the most basic to the most complex ones, and both static and dynamic data structures. What is a static data structure? And a dynamic one? What are they for? How to use one or the other? All this is explained in the course.

Did you know that in everyday life there are many situations in which algorithms can be applied to Data Structures? For example in a simple supermarket we find several situations that could be handled with Lists, Stacks and Queues. Precisely in this course we will develop along a complete project, the management of these issues by means of Dynamic Data Structures.

We will develop each one of the functionalities in code explained in detail of the following data structures:

Static and Dynamic Data Structures (Arrays and Multidimensional Arrays).

Linear Dynamic Data Structures (Lists, Stacks and Queues)

Non-Linear Dynamic Data Structures (Trees)

All concepts are explained in detail, step by step and understanding the why of each thing. This way you will be able to grasp a correct foundation on these programming pillars from the very beginning of your professional development. This course will allow you to expand into any area of software development.

Isn’t it great? Well, the best of all is that it is at your fingertips.

Buy the course and enjoy all that is waiting for you.

See you soon!

José Javier Villena

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Lecture 2: How to get the most out of this course

Chapter 2: Algorithms – Development of programming logic

Lecture 1: Development of programming logic

Lecture 2: Exercises (Includes best practice tips)

Lecture 3: Exercises (Includes tips on how to learn from others)

Lecture 4: Exercises

Lecture 5: Optimization of an Algorithm

Lecture 6: Algorithm for perfect numbers

Lecture 7: How to Debug an Algorithm (Debugging) Part 1

Lecture 8: How to Debug an Algorithm (Debugging) Part 2

Lecture 9: Source code of this section

Chapter 3: Introduction to data structures

Lecture 1: Main data structures

Lecture 2: Other data structures (Struct)

Lecture 3: Other data structures (UNION)

Lecture 4: Other data structures (ENUM)

Lecture 5: Source code of this section

Chapter 4: ARRAYS: Static and dynamical data structures

Lecture 1: Static Arrays

Lecture 2: Dynamic Arrays

Lecture 3: Character Strings – Part 1

Lecture 4: Character Strings – Part 2

Lecture 5: Character Strings – Part 3

Lecture 6: Source code of this section

Chapter 5: Sorting Algorithms

Lecture 1: Sorting Algorithms. Types and why they are important

Lecture 2: Exchange Algorithms (Bubble Sort)

Lecture 3: Code implementation of the Bubble Sort algorithm – Part 1

Lecture 4: Code implementation of the Bubble Sort algorithm – Part 2

Lecture 5: Sorting by selection algorithm

Lecture 6: Code Implementation of the Algorithm by Selection – Part 1

Lecture 7: Coding Implementation of the Selection algorithm – Part 2

Lecture 8: Insertion Algorithm

Lecture 9: Code Implementation of the Insertion Algorithm – Part 1

Lecture 10: Code Implementation of the Insertion Algorithm – Part 2

Lecture 11: Measuring Algorithm Execution Time

Lecture 12: Creating Your Own Sorting Algorithm Project – Part 1

Lecture 13: Project on Creating Your Own Sorting Algorithm – Part 2

Lecture 14: Project on Creating Your Own Sorting Algorithm – Part 3

Lecture 15: Final Tips to improve development skills

Lecture 16: Source code of this section

Chapter 6: BONUS: RECURSION

Lecture 1: What is recursion?

Lecture 2: Recursion Basic Level – Part 1

Lecture 3: Recursion Basic Level – Part 2

Lecture 4: Recursion Intermediate Level

Lecture 5: Recursion Advanced Level (Towers of Hanoi explained in detail) – Part 1

Lecture 6: Recursion Advanced Level (Towers of Hanoi explained in detail) – Part 2

Lecture 7: Recursion Advanced Level (Towers of Hanoi explained in detail) – Part 3

Lecture 8: Source code of this section

Chapter 7: MATRICES (ARRAY OF ARRAYS)- DATA STRUCTURES

Lecture 1: Matrices

Lecture 2: Static Matrices. Real examples of use – Part 1

Lecture 3: Static Matrices. Real examples of use – Part 2

Lecture 4: Static Matrices. Real examples of use – Part 3

Lecture 5: Matrix Index Manipulations (Exercise) – Part 1

Lecture 6: Matrix Index Manipulations (Exercise) – Part 2

Lecture 7: Matrix Index Managements (Exercise) – Part 3

Lecture 8: Dynamic Matrices – Part 1

Lecture 9: Dynamic Matrices – Part 2

Lecture 10: Dynamic Matrices – Part 3

Lecture 11: Clearing Memory

Lecture 12: MultiDimensional Arrays – Part 1

Lecture 13: MultiDimensional Matrices – Part 2

Lecture 14: Source code for this section

Chapter 8: LISTS (Linear Dynamic Data Structures)

Lecture 1: Lists, types and logic

Lecture 2: Code implementation of a list – Part 1

Lecture 3: Code implementation of a list – Part 2 –

Lecture 4: Code implementation of a list – Part 3

Lecture 5: Insert item in the list – Part 1

Lecture 6: Insert element in the list – Part 2

Lecture 7: Delete element from a list – Part 1

Lecture 8: Delete element from a list – Part 2

Lecture 9: BONUS: insert element in a specific position – Part 1

Lecture 10: BONUS: insert element in a specific position – Part 2

Lecture 11: Source code of this section

Chapter 9: QUEUES (Linear Dynamic Data Structures)

Lecture 1: Logic of a queue

Lecture 2: Implementation in Code. Insertion and traversal of elements – Part 1

Lecture 3: Implementation in Code. Insertion and Traversal of Elements – Part 2

Lecture 4: Remove element and CHALLENGE – Part 1

Lecture 5: Remove element and CHALLENGE – Part 2

Lecture 6: Source code of this section

Chapter 10: STACKS (Linear Dynamic Data Structures)

Lecture 1: Logic of a stack

Lecture 2: Implementation in Code. Insertion and traversal of elements – Part 1

Lecture 3: Implementation in Code. Insertion and traversal of elements – Part 2

Lecture 4: Remove element and RETO – Part 1

Instructors

Jose Javier Villena
Analista-Programador

Rating Distribution

1 stars: 0 votes
2 stars: 1 votes
3 stars: 1 votes
4 stars: 2 votes
5 stars: 6 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu