Data Structures and Algorithms using C++

Data Structures and Algorithms using C++

Course Name

Data Structures and Algorithms using C++

Instructor

Saurabh Shukla

Prerequisite

  • You must know C++ language, as all the programs during the course will be implemented in C++ language only
  • Recommended topics of C++ language for the revision are functions, arrays, pointer, classes, Objects, Constructor, Destructor and new, delete
  • For online LIVE classes, you have to download Zoom Client for meetings on laptop or mobile. (Laptop is recommended) (https://zoom.us/download)
  • Good Internet connection
  • Laptop or desktop computer is required for programming practice at home

Duration

26 Oct 2021 to 5 Jan 2022 | 6:00 PM to 7:00 PM | Tue-Thu-Sat

Subscription Validity: till 30 Sep 2022

Subscription validity is a time period to access LIVE class recordings, assignments, certificate download, discussion forum, etc.

Fee

INR 3500/-

Making payment means you are agreeing with our Terms and Conditions. Read them carefully.

Features

  • Recording of the class will be available till 30 Sep 2022. You can access these recordings any number of times during the course
  • Course Completion Certificate
  • Implementation of most of the data structures (specified in the syllabus) in C++ language
  • Doubt handling during the course.
  • Discussion Forum | Doubt Handling after the class
  • Assignments: 100+ Practice Problems

Syllabus
Introduction to Data Structure,
Implementation of various data structures:

  • Array and its implementation
  • Dynamic Array and its implementation
  • singly linked list, doubly linked list
  • circular linked list
  • circular doubly linked list
  • stack and its implementation(using array, dynamic array and linked list)
  • queue and its implementation (using array, dynamic array and linked list)
  • Variations of Stack and Queue
  • binary search tree and its implementation
  • graph and its implementation
  • Algorithms and Problems:

  • Array (rotation, element frequency)
  • Linked List (reverse a linked list, finding whether a linked list has a loop or not)
  • Recursion (Tower of Hanoi,Fibonacci Series, Factorial , etc.)
  • Sorting (bubble, selection, insertion, quick, merge, heap sort)
  • Searching (linear and binary)
  • Hashing
  • Strings (Pattern matching, all permutation of a string)
  • Graph (BFS, DFS, Dijkstra’s)
  • Tree (Huffman’s coding, Heap Tree)
  • Dynamic Programming (Fibonacci series)
  • Greedy algorithms ( Prim’s, Kruskal’s MST)
  • divide and conquer algorithms
  • Register in the batch now before its too late, as we are limited with the batch size.

    Batch Code Starting Date Time|Days Mode of Teaching Offer Price
    SA 26-Sep-2021 6:00 PM | TTS Online LIVE