HomeGoals

Home

Goals

SignUp / Login

Data Structures and Algorithms in C++ specialization
Live Class

Data Structures and Algorithms

4.6

(120 ratings)

This Specialization takes you forward in your competitive programming journey by teaching aspects of space and time complexity on complex data structures like linked lists, stacks, queues, etc. Learn different searching and sorting algorithms alongside trees and graphs.

Features

Shareable Certificate
Earn a Certificate upon completion
100% Online Live Class
Mentor driven live classes
Instant Doubt Resolution
Get your doubt clarified instantly
Practice Material
Get Notebook to revise, practice, test yourself and interact with mentor

Live Session to be Scheduled

What You Will Learn

Goal - Competitive Programming - C++
What you will learn

Data Structures and Algorithms

  • Learn how to compare two algorithms performing the same task based on time complexity and space complexity
  • Get to know about another linear data structure meant to store data with the same types (Linked List)
  • Learn about more linear data structures (Stacks and Queues) and how to use them
  • Get familiar with sorting a given data using different algorithms available
  • Get to know how to search a data within a linear data structure
  • Learn about non-linear data structures (trees and graphs), how and where they are used
  • Also, learn how to traverse these non-linear data structures

PREREQUISITE KNOWLEDGE
  • Laptop with good internet connection
  • Computer basics

Data Structures and Algorithms Batch Schedule

Batch Starting at
Introduction to Data Structures and Complexity

Not Scheduled | 60 min

Introduction to Data Structures, How to compare two algorithms, Time Complexities, Space Complexities, How to calculate complexities, Asymptotic Notations, Big O Notation.

Introduction to Data Structures and Complexity

Introduction to Data Structures, How to compare two algorithms, Time Complexities, Space Complexities, How to calculate complexities, Asymptotic Notations, Big O Notation.

Not Scheduled | 60 min
Linked List

Disadvantages of Arrays, Introduction to Linked List, Representation of linked list in memory, Space Complexity, Insertion, Traversing, Deletion, Advantages of Linked List, Disadvantages of Linked List, Applications of Linked List, Doubly Linked List, Doubly Linked List - Insertion; Deletion, Advantages of Doubly linked list.

Not Scheduled | 60 min
Stacks and Queues

Introduction to Stacks, Stack Operations - Insertion; Pop; Peek; isEmpty; isFull; length, Applications of Stacks, Stacks using Linked List, Introduction to Queues, Queue Operations - Enqueue; Dequeue; isEmpty; isFull; length; Applications of Queue, Queues using Linked List, Problems with Queue, Introduction to Circular Queue, Circular Queue Operations - Enqueue; Dequeue; isEmpty; isFull; length.

Not Scheduled | 60 min
Sorting Algorithms

Introduction to Sorting, Types of Sorting algorithms, Stability of Sorting algorithms, Bubble Sort, Complexity of Bubble Sort, Selection Sort, Complexity of Selection Sort, Insertion Sort, Complexity of Insertion Sort.

Not Scheduled | 60 min
Searching Algorithms

Introduction to Searching, Sequential Search and Interval Search, Linear Search, Complexity of Linear Search, Binary Search, Complexity of Binary Search.

Not Scheduled | 60 min
Trees Data Structures

Introduction to Trees, Terminologies used in trees, Types of Trees, Applications of trees, Binary Search Tree, BST Operations - Insert; Search; Delete.

Not Scheduled | 60 min
Breadth-First Search and Depth First Search - Trees

Introduction to tree traversals, Types of traversals, BFS in trees, BFS Algorithm, Complexity of BFS Algorithm, DFS in trees, Inorder Traversal, Preorder Traversal, Postorder Traversal.

Not Scheduled | 60 min
Graph Data Structures

Introduction to Graphs, Types of Graphs, Applications of Graphs, Degree of Vertices, Representation of Graphs, Adjacency Matrix, Adjacency List, Tree as a special Graph, Forest, Spanning Tree.

Not Scheduled | 60 min
Breadth-First Search and Depth First Search - Graphs

Introduction to graph traversals, BFS in Graphs, BFS Algorithm, Complexity of BFS Algorithm, Applications of BFS, DFS in Graphs, DFS Algorithm, Complexity of DFS Algorithm, Applications of DFS.

Not Scheduled | 60 min
Certificate

Data Structures and Algorithms


Want to know more?