Data Structures and Algorithms - DSA using C++

Data Structures and Algorithms : DSA using C++, available at $69.99, has an average rating of 4.33, with 335 lectures, 15 quizzes, based on 242 reviews, and has 1464 subscribers.

You will learn about Gain in-depth knowledge about each Data structures including Arrays, Linked List, Stacks, Queues, Trees, Graphs, Heaps, Hashing and Sorting Coded fully using Object Oriented Programming Concepts in C++ Complete working of each Data structure with tracing during learning the concepts as well as during program execution Analyse in-depth each of the Data structures Basics to Advance Level Data Structures This course is ideal for individuals who are Graduates and Undergraduates who want to Learn Data structures using Object Oriented Programming through C++ Language or Any aspirant with some Basic or no knowledge of C++ programming or Students with Data structures in their Curriculum want to Learn beyond their syllabus and gain extra knowledge about Data structures or A Software Developer wants to explore Data structures in depth or with Prior knowledge of Data structures to Analyse computational complexity It is particularly useful for Graduates and Undergraduates who want to Learn Data structures using Object Oriented Programming through C++ Language or Any aspirant with some Basic or no knowledge of C++ programming or Students with Data structures in their Curriculum want to Learn beyond their syllabus and gain extra knowledge about Data structures or A Software Developer wants to explore Data structures in depth or with Prior knowledge of Data structures to Analyse computational complexity.

Enroll now: Data Structures and Algorithms : DSA using C++

Summary

Title: Data Structures and Algorithms : DSA using C++

Price: $69.99

Average Rating: 4.33

Number of Lectures: 335

Number of Quizzes: 15

Number of Published Lectures: 335

Number of Published Quizzes: 14

Number of Curriculum Items: 350

Number of Published Curriculum Objects: 349

Original Price: $119.99

Quality Status: approved

Status: Live

What You Will Learn

Gain in-depth knowledge about each Data structures including Arrays, Linked List, Stacks, Queues, Trees, Graphs, Heaps, Hashing and Sorting

Coded fully using Object Oriented Programming Concepts in C++

Complete working of each Data structure with tracing during learning the concepts as well as during program execution

Analyse in-depth each of the Data structures

Basics to Advance Level Data Structures

Who Should Attend

Graduates and Undergraduates who want to Learn Data structures using Object Oriented Programming through C++ Language

Any aspirant with some Basic or no knowledge of C++ programming

Students with Data structures in their Curriculum want to Learn beyond their syllabus and gain extra knowledge about Data structures

A Software Developer wants to explore Data structures in depth

with Prior knowledge of Data structures to Analyse computational complexity

Target Audiences

Graduates and Undergraduates who want to Learn Data structures using Object Oriented Programming through C++ Language

Any aspirant with some Basic or no knowledge of C++ programming

Students with Data structures in their Curriculum want to Learn beyond their syllabus and gain extra knowledge about Data structures

A Software Developer wants to explore Data structures in depth

with Prior knowledge of Data structures to Analyse computational complexity

You may be new to Data Structure or you have already Studied and Implemented Data Structures but still you feel you need to explore more about Data Structure in detail so that it helps you challenging problems, Coding Challenges and work on Data Structures efficiently.

Whatever the reason, if you are looking for a course that focus on the implementations to give you a complete understanding of how things work, then this is the course for you.

This course goes over the theory of how things work, but only to give you what you need to know to understand the implementation covered.
This course about 50 hours covers each topic in greater details, every topic is covered on Whiteboard which gives you a classroom environment to understand the concepts of Data Structures clearly and improve your Problem Solving and Analytical Skills. Every topic is discussed, analysed and implemented with programs executed showing line-by-line coding and tracing each and every piece of Code.

After completing this course, you will have a clear understanding of Data Structures and Algorithms, how to analyse and implement them.

Course Contents

1. Working of Recursion

2. Arrays Basics and Representation

3. Array Abstract Data Type

4. Linked List and its types

5. Stacks and its applications

6. Queues

7. Trees with Binary Trees and other types

8. Dictionaries

9. Binary Search Tree

10. AVL Trees

11. Graphs

12. Hashing Technique

with Essentials of C++ Programming, which will be helpful in Implementing the Data Structures using C++

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction to the course

Lecture 2: Introduction to Data Structures

Lecture 3: Data structure and memory Usage

Lecture 4: Types of Data Structures

Lecture 5: Linear List and Abstract Data Type

Chapter 2: Recursion

Lecture 1: Idea behind Recursion

Lecture 2: Understanding what Recursion is

Lecture 3: Sum of 2 numbers

Lecture 4: Lets Code Sum of 2 Numbers using Recursion

Lecture 5: Product of 2 Numbers

Lecture 6: Lets Code Product of 2 Numbers Using recursion

Lecture 7: Power Function a^b

Lecture 8: Lets Code Power Function a^b

Lecture 9: Fibonacci Series

Lecture 10: Lets Code Fibonacci Series using Recursion

Lecture 11: Finding GCD or HCF of 2 given numbers Using Recursion

Lecture 12: Lets Code GCD or HCF Using Recursion

Lecture 13: Finding Factorial of a given number Using Recrsion

Lecture 14: Lets Code Factorial Using Recursion

Chapter 3: Computational Complexity

Lecture 1: Introduction to Time and Space Complexity

Lecture 2: Asymptotic Notations

Chapter 4: Array – A Linear Data Structure

Lecture 1: Why Arrays ? and What is Arrays ?

Lecture 2: Declaring, Initializing and Accessing – Arrays

Lecture 3: Static Vs Dynamic Arrays – Memory Layout of Main Memory

Lecture 4: Static Vs Dynamic Arrays Details

Lecture 5: Static Vs Dynamic Arrays Details Continue

Lecture 6: Introduction to 2 Dimension Arrays

Lecture 7: Using Different methods to allocate the Memory for 2 Dimension Arrays

Lecture 8: Allocating and DeAllocating Memory for 2-Dim Arrays

Lecture 9: Representation of Arrays

Lecture 10: Representation of 2-Dim Arrays

Lecture 11: Row-Major and Column-Major Order for 2-Dim Arrays

Lecture 12: Row-Major and Column-Major Order for 3-Dim Arrays

Lecture 13: Representation of n-Dim Arrays

Chapter 5: Array ADT(Abstract Data Type)

Lecture 1: Introduction to Array ADT

Lecture 2: Array Class ADT

Lecture 3: Lets Code the Array ADT class

Lecture 4: Lets Create an Array ADT

Lecture 5: Creating an Exceptional Class and Array

Lecture 6: Inserting the Element in an Array

Lecture 7: Lets write the Code for Inserting the Element in an Array

Lecture 8: Deleting the Element from an Array

Lecture 9: Lets write the Code for Deleting the Element from an Array

Lecture 10: Find() and search() operations on Array

Lecture 11: Lets write the Code for Find() operation on Array

Lecture 12: Lets Code Search() operation on Array

Lecture 13: Lets Code IsEmpty() IsFull() operations on Array

Lecture 14: Lets see Length() and Display() operations

Lecture 15: More Operations – Get(), Set(), FindMAX(), FindMIN(), Sum(), Avg() and Append()

Lecture 16: Lets Implement Get(), Set() and indexOf() operations on Array

Lecture 17: Lets Code FindMAX(), FindMIN(), Sum(), Avg() and Append() operations on Arrays

Lecture 18: Shifting the data Elements of an Array

Lecture 19: Lets Rotate the Elements of Array

Lecture 20: Lets Code Left and Right Rotate of the Elements on Array

Lecture 21: Lets Reverse the Data Elements of Array

Lecture 22: Lets Code Reversing the Data Elements of Array

Lecture 23: Lets Search in Array using LINEAR Search technique

Lecture 24: Lets Code Linear Search Technique

Lecture 25: Lets understand BINARY Search on Array

Lecture 26: Understanding the ITERATIVE BINARY SEARCH

Lecture 27: Lets Code Binary Search (Iterative Method)

Lecture 28: Recursive Binary Search on Arrays

Lecture 29: Lets Code Recursive Binary Search technique

Lecture 30: Binary Search Using Divide and Conquer Apprach

Lecture 31: Lets Code Binary Search Using Divide and Conquer Apprach

Lecture 32: Coding Challenge: Finding Maximum and Minimum from an Array

Lecture 33: Solution to Coding Challenge : Finding Maximum and Minimum

Lecture 34: Coding Challenge : Finding Minimum Number of Merge operations on Arrays

Lecture 35: Solution to Coding Challenge Finding Minimum No. of Merge operations on Arrays

Lecture 36: Coding Challenge : Print All Sub-Arrays with zero sum

Lecture 37: Solution to Coding Challenge printing All Sub-Array with zero-sum

Lecture 38: Coding Challenege : Find Smallest missing positive number from an unsorted array

Lecture 39: Solution to Coding Challenge Finding Smallest Positive number

Chapter 6: Linked List – A Dynamic Data Structure

Lecture 1: Introduction to Linked Lists

Lecture 2: Linked List Vs Arrays

Lecture 3: Linked Lists in CPP

Lecture 4: Types of Linked Lists

Lecture 5: Singly Linked List and its Operations

Lecture 6: Singly Linked List Class ADT

Lecture 7: Lets Code Class ADT for Singly Linked Lists

Lecture 8: Example working with Insert Process in a Linked Lists

Lecture 9: Understanding the Code for Inserting an Element in a Linked List

Lecture 10: Program for Inserting an Element in a Linked List

Lecture 11: Deleting an Element from Singly Linked List

Lecture 12: Program for Delete from Singly Linked Lists

Lecture 13: Applying Find() operation on Singly Linked List

Lecture 14: Program to Implement FIND() operation on Singly Linked Lists

Lecture 15: Applying Search() operation on Singly Linked List

Lecture 16: Program to Implement Search() operation on Singly Linked Lists

Lecture 17: isEmpty() and isFull() in Singly Linked List

Instructors

Himayatullah Sharief
Instructor at Udemy, Python, C C++ and JAVA Developer

Rating Distribution

1 stars: 1 votes

2 stars: 3 votes

3 stars: 13 votes

4 stars: 72 votes

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