Have a question?
Message sent Close

DSA

Data Structures and Algorithms (DSA) is a core area in computer science that deals with the efficient organization, storage, and manipulation of data. It encompasses two main components:

  1. Data Structures: These are methods for organizing and storing data so that it can be accessed and modified efficiently. Different data structures are suited to different types of operations and applications. Common data structures include:
    • Arrays: Fixed-size, contiguous memory locations.
    • Linked Lists: Collections of nodes, each containing data and a reference to the next node.
    • Stacks: Last-in, first-out (LIFO) structures.
    • Queues: First-in, first-out (FIFO) structures.
    • Trees: Hierarchical structures with nodes connected by edges.
    • Graphs: Collections of nodes (vertices) connected by edges, used for representing networks and relationships
Course Instructor Sateesh Pabbathi

Original price was: ₹25,000.00.Current price is: ₹19,999.00.

Course Overview

Data Structures and Algorithms, is a fundamental area of computer science that focuses on the efficient organization and manipulation of data.

  • Data Structures: These are ways to store and organize data to facilitate access and modifications. Common examples include arrays, linked lists, stacks, queues, trees, and graphs.
  • Algorithms: These are step-by-step procedures or formulas for solving problems and performing tasks, such as sorting data, searching for elements, and optimizing processes

Course Curriculum

Standard template library in c++

Algorithms

Video  15:55

Introduction To STL

Video  9:37

Iterators

Video  13:1
Timeand space complecity

Asymptotic Notation and Analysis

Video 14:26

Design and analysist of algorithms

Video 11:28
Mathematics

Factorial of numbers

Video 9:41

sieve of eratosthenes

Video 15:19
Arrays

Leaders of arrays

Video 12:45

Longest Odd Even Subarray

Video 14:15

Majority elements

Video 15:48

Maximum Circular Subarray Sum

Video 12:24

pair _wise target sum

Video 10:56

Prefix sum technique

Video 15:32

searching in arrays

Video 16:55

Sliding window technique

Video 13:50

stock buy and sell

Video 16:42
Strings

Check Anagrams

Video 11:28

Introduction to strings

Video 10:31

Lexographic rank of string

Video 12:28

Rabin _karp searching algorithms

Video 15:51
Sorting

Heap Sort

Video 20:12
Recursion

Sum of Digits

Video
7:28
Hashing

Longest Subarray With Sum K

Video
14:34
Bit manipulation

Check Kth Bit

Video
13:13

Count Set Bits

Video
11:10

Odd Occurrences In An Array

Video
12:20

Power Of Two

Video
8:41

Power Set

Video
10:32

Two Exception Numbers

Video
13:8
Linked lists

Deleting Node Without Head Pointer

Video
14:3

Segregating Even-Odd Nodes

Video
18:24
Stack

Balanced Parenthesis

Video
12:36

Daily Temperatures

Video
14:23

Evaluation Of Postfix Expression

Video
11:12

Evaluation Of Prefix Expression

Video
12:16

GetMin() In Stack

Video
14:31

Implement Stack Using Arrays

Video
9:47

Implement Stack Using Linked List

Video
10:6

Infix Prefix _ Postfix

Video
11:26

Infix To Postfix

Video
15:30

Infix To Prefix

Video
14:59

Intersection Of Linked Lists

Video
13:11

Introduction To Stack

Video
13:29

Largest Rectangular Area In Histogram

Video
15:53

Postfix To Prefix

Video
12:22

Stock Span Problem

Video
14:45
Queue

Doubly Ended Queue

Video
14:6

First Circular Tour

Video
16:56

Implement Stack Using Queue

Video
18:10

Maximum of K-Subarrays

Video
21:36

Reverse a Queue

Video
13:27
Trees

AVL Tree

Video
21:40
Heaps

Heap Operations C ++Code

Video
8:38

Introduction To Heaps

Video
11:47
Greedy

Introduction To Greedy

 

Fractional Knapsack Problem

Video
16:35

Huffman Coding

Video
13:32

Job Sequencing Problem

Video
15:1
Back tracking

N-Queen Problem

 

Concepts of Backtracking

Video
14:1

Rat In A Maze

Video
20:44

Sudoku Problem

Video
16:7
Graphs

Minimum Height Trees

Video
18:46