Mastering Data Structures Algorithms using C and C++

Mastering Data Structures & Algorithms using C and C++, available at $124.99, has an average rating of 4.59, with 391 lectures, 11 quizzes, based on 49980 reviews, and has 202383 subscribers.

You will learn about Learn various Popular Data Structures and their Algorithms. Develop your Analytical skills on Data Structure and use then efficiently. Learn Recursive Algorithms on Data Structures Learn about various Sorting Algorithms Implementation of Data Structures using C and C++ This course is ideal for individuals who are Developer who want to get Deepest knowledge of Data Structure or Undergraduate who want to Learn Data Structures Perfectly It is particularly useful for Developer who want to get Deepest knowledge of Data Structure or Undergraduate who want to Learn Data Structures Perfectly.

Enroll now: Mastering Data Structures & Algorithms using C and C++

Summary

Title: Mastering Data Structures & Algorithms using C and C++

Price: $124.99

Average Rating: 4.59

Number of Lectures: 391

Number of Quizzes: 11

Number of Published Lectures: 390

Number of Published Quizzes: 11

Number of Curriculum Items: 402

Number of Published Curriculum Objects: 401

Original Price: $159.99

Quality Status: approved

Status: Live

What You Will Learn

Learn various Popular Data Structures and their Algorithms.

Develop your Analytical skills on Data Structure and use then efficiently.

Learn Recursive Algorithms on Data Structures

Learn about various Sorting Algorithms

Implementation of Data Structures using C and C++

Who Should Attend

Developer who want to get Deepest knowledge of Data Structure

Undergraduate who want to Learn Data Structures Perfectly

Target Audiences

Developer who want to get Deepest knowledge of Data Structure

Undergraduate who want to Learn Data Structures Perfectly

You may be new to Data Structure or you have already Studied and Implemented Data Structures but still you feel you need to learn more about Data Structure in detail so that it helps you solve challenging problems and used Data Structure efficiently.

This 53 hoursof course covers each topic in greater details, every topic is covered on Whiteboard which will improve your Problem Solving and Analytical Skills. Every Data Structure is discussed, analysed and implemented with a Practical line-by-line coding.

Source code for all Programs is available for you to download

About Instructor

I am the Instructor of this course, I have been teaching this course to university students for a long period of time, I know the pulse of students very well, I know how to present the topic so that it’s easy to grasp for students.

I know how to use White board to explain the topic and also to make it memorable. Remembering the thing and using them in right place is more important than just understanding the topic.

After Completing Course

?After completing this course you will be confident enough to take up any challenging problem in coding using Data Structures.

Course Contents

1. Recursion

2. Arrays Representation

3. Array ADT

4. Linked List

5. Stack

6. Queues

7. Trees

8. Binary Search Tree

9. AVL Trees

10. Graphs

11. Hashing Technique

Course Curriculum

Chapter 1: Before we Start

Lecture 1: Instructors Note

Lecture 2: Introduction

Chapter 2: Essential C and C++ Concepts

Lecture 1: Arrays Basics

Lecture 2: Practice : Arrays Basics

Lecture 3: Structures

Lecture 4: Practice : Structures

Lecture 5: Pointers

Lecture 6: Practice : Pointers

Lecture 7: Reference in C++

Lecture 8: Practice : Reference

Lecture 9: Pointer to Structure

Lecture 10: Practice : Pointer to Structure

Lecture 11: Functions

Lecture 12: Practice : Functions

Lecture 13: Parameter Passing Methods

Lecture 14: Practice : Parameter Passing Methods

Lecture 15: Array as Parameter

Lecture 16: Practice : Array as Parameter

Lecture 17: Structure as Parameter

Lecture 18: Practice : Structure as Parameter

Lecture 19: Structures and Functions (Must Watch)

Lecture 20: Converting a C program to a C++ class (Must Watch)

Lecture 21: Practice : Monolithic Program

Lecture 22: Practice : Modular Program

Lecture 23: Practice : Structure and Functions

Lecture 24: Practice : Object-Oriented Program

Lecture 25: C++ Class and Constructor

Lecture 26: Practice : C++ Class

Lecture 27: Template classes

Lecture 28: Practice : Template Class

Chapter 3: Required Setup for Programming

Lecture 1: Online C and C++ compiler

Lecture 2: Setup CodeBlocks and Settings

Lecture 3: Setup Dev-C++ and Settings

Lecture 4: Debugging using Dev-C++

Lecture 5: Debugging using CodeBlocks

Lecture 6: Setup Visual Studio

Lecture 7: Debugging using Visual Studio

Lecture 8: Setup Xcode

Chapter 4: Introduction

Lecture 1: Introduction

Lecture 2: Stack vs Heap Memory

Lecture 3: Stack vs Heap. Continued

Lecture 4: Physical vs Logical Data Structures

Lecture 5: ADT

Lecture 6: Time and Space Complexity

Lecture 7: Time and Space Complexity from Code

Chapter 5: Recursion

Lecture 1: How Recursion Works ( Tracing )

Lecture 2: Generalising Recursion

Lecture 3: How Recursion uses Stack

Lecture 4: Recurrence Relation – Time Complexity of Recursion

Lecture 5: Lets Code Recursion

Lecture 6: Static and Global Variables in Recursion

Lecture 7: Lets Code Static and Global in Recursion

Lecture 8: Tail Recursion

Lecture 9: Head Recursion

Lecture 10: Tree Recursion

Lecture 11: Lets Code Tree Recursion

Lecture 12: Indirect Recursion

Lecture 13: Lets Code Indirect Recursion

Lecture 14: Nested Recursion

Lecture 15: Lets Code Nested Recursion

Lecture 16: Sum of Natural Number using Recursion

Lecture 17: Lets Code Sum of N using Recursion

Lecture 18: Factorial using Recursion

Lecture 19: Lets Code Factorial using Recursion

Lecture 20: Power using Recursion

Lecture 21: Lets Code Power Recursion

Lecture 22: Taylor Series using Recursion

Lecture 23: Lets Code Taylor Series using Recursion

Lecture 24: Taylor Series using Horners Rule

Lecture 25: Lets Code Taylor Series Horners Rule – Recursion

Lecture 26: Lets Code Taylor Series Iterative

Lecture 27: Fibonacci Series using Recursion – Memoization

Lecture 28: Lets Code Fibonacci

Lecture 29: nCr using Recursion

Lecture 30: Lets Code nCr using Recursion

Lecture 31: Tower of Hanoi Problem

Lecture 32: Lets Code Tower of Hanoi

Lecture 33: Quiz 1 Solutions

Chapter 6: Arrays Representations

Lecture 1: Introduction to Array

Lecture 2: Declarations of Array

Lecture 3: Demo – Array Declaration

Lecture 4: Static vs Dynamic Arrays

Lecture 5: Demo – Static vs Dynamic Array

Lecture 6: How to Increase Array Size

Lecture 7: Demo – Increasing Array Size

Lecture 8: 2D Arrays

Lecture 9: Demo – 2D Array

Lecture 10: Array Representation by Compiler

Lecture 11: Row Major Formula for 2D Arrays

Lecture 12: Column Major Formula for 2D Arrays

Lecture 13: Formulas for nD Arrays

Lecture 14: Formulas for 3D Arrays

Instructors

Abdul Bari
Professional Programmer and Educator

Rating Distribution

1 stars: 363 votes

2 stars: 374 votes

3 stars: 3075 votes

4 stars: 15149 votes

5 stars: 31039 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!