Learn Basics of Data Structures & Algorithms in C++

Name: Learn Basics of Data Structures & Algorithms in C++
Rating: 3.9 (355 reviews)

Covers Types & Search Algorithms with implementation in C++ & Analysis of Complexity with Interview Based Questions

Created byMehak Mahajan

Last updated 11/2021

English

What you'll learn

Data Structure and its Types
Search Algorithms and its Concept with Example
Search Algorithm Implementation using C++
Complexity Analysis of Search Algorithms

Course content

5 sections • 21 lectures • 3h 48m total length

Topics to be Covered1:10
Introduction to Data Structures and Algorithms
Introduction to Data Structures2:10

Primitive and Non-Primitive Data Structures6:29
Arrays10:36
Explore arrays as a linear non primitive data structure that stores homogeneous items at consecutive memory locations, using 0-based indexing, and the concepts of declaration, definition, and size (subscript).
Array Implementation in C++15:47
Linked List11:00
Program to show Insertion/ Deletion Operation on Linked List27:52
Learn insertion and deletion in a C++ linked list, including insertions at first, last, and between nodes, and deletions of first, last, or middle elements.
Stacks8:24
Learn the stack data structure, its LIFO behavior, and push and pop operations from the top. Understand capacity limits and how FILO and LIFO govern element order.
Program to Show Push/Pop operation of Stack13:42
Queues5:52
Explore the queue data structure, where insertion occurs at the rear and deletion at the front under the FIFO principle, contrasting with stacks.
Queue Implementation in C++7:59
Tree11:55
Explore the tree data structure, its nodes and edges, root and leaf concepts, and how general trees, binary trees, and binary search trees enforce hierarchy and parent-child rules.
Graphs7:53
Explore graphs as a non-linear data structure of vertices and edges, and distinguish directed and undirected graphs while recognizing the role of weights in weighted graphs.

Introduction to Linear Search and its Algorithm19:45
Learn linear (sequential) search, traversing arrays or lists from the first element to locate a target and report its index or absence.
Implementation of Linear Search in C++18:07
Complexity of Linear Search7:20
Explore the time and space complexity of the linear search algorithm, focusing on Big O notation, best, average, and worst cases, and the role of a counter variable.
Introduction to Binary Search and its Algorithm23:04
Explanation of Binary Search Program15:33
Implementation of Binary Search in C++4:31
Implement binary search in C++ using a bottom-up approach with main as the entry point and a statically initialized array. Search 3 shows index 1; 45 is not found (-1).
Complexity of Binary Search9:24

BONUS LECTURE0:24
This is the end of Basics Of Data Structures and Algorithms.
If you want to Learn various Sorting Algorithms of Data Structure that will make you understand how the various Searching Algorithms work. I highly recommend you to buy my 5+ Hours Course. Through this Course that is ""Sorting Algorithms from Beginner to Expert"", you will be able to learn Sorting Algorithms, their Implementation and their Complexity. You can also analyse your performance with the help of Test .
Using the link below you can get it at the Best Price that Udemy is offering for the moment.
https://www.udemy.com/course/sorting-algorithms-from-beginner-to-expert/?referralCode=DEB33C510A113A6DF283

Requirements

Basics of any Programming Language ( for Implementation only)

Description

This is one of the Top Udemy Course on Data Structures , in which more than 10,000 students have already enrolled and benefited from this Course.

This is an online Comprehensive Course in which we will be covering some basic concepts of Data Structure and its types along with the Search Algorithms .

Search Algorithms are Discussed by following the below sequence :

i) Example ,

ii) then their algorithms ,

iii) their line by line coding explained using C++

iv) then there is analysis of complexity in which we will be covering both Space and Time Complexity .

v) Discussion related to Time and Space trade off.

Course Contents

Arrays
Linked List
Stack
Queues
Trees
Graphs
Search Algorithm
Implementation of search algorithm
Analysis of Complexity of Search Algorithm

By the end of this Course learner will feel very much confident about the Data Structure Algorithms and you will be able to decide which data set is suitable by which algorithm as we have more than one algorithm to perform a specific task, but keeping in view regarding the complexity, one can make decision which approach should be opted. Learner can check your concepts by attempting the Practice test ( Assignment and Quiz) based on Interview Questions .

Who this course is for:

Students want to start learning Data Structure

Learn Basics of Data Structures & Algorithms in C++

What you'll learn

Explore related topics

Course content

Introduction2 lectures • 3min

Types of Data Structures11 lectures • 2hr 7min

Searching Algorithms7 lectures • 1hr 38min

Interview Based Questions0

Introduction of My other Data Structure Course1 lecture • 1min

Requirements

Description

Who this course is for: