Data Structure and Algorithm Training Online

person-using-silver-macbook-pro-1181467
21
Jul
₹18,000 ₹15,000

Upcoming Batches

STARTS DURATION DAYS AVAILABILITY PRICE (INR)
20/06/2020 50+ Hours Sat, Sun 4 Seats Available 18,00015,000
18/07/2020 50+ Hours Sat, Sun 7 Seats Available 18,00015,000
TBD 50+ Hours Sat, Sun TBD 18,00015,000

Objective

Techboost has the best trainers from Tier-1 Product companies for Data Structures training and Algorithms training in Bangalore. This course will teach the core concepts of Data structures and Algorithms needed to understand the complexity of enterprise-level applications. This will help learners crack the technical interviews for tier-1 companies like Amazon, Microsoft, Adobe, etc. and groom the learner on design level understanding of real-life problems. So sign up today for our Data Structures and Algorithms training and excel.

Course Curriculum

1. Introduction
What is a data structure and algorithm?
Analysis of algorithms
Time Complexity
Big – O Notation
Space Complexity

2. Linked Lists and it operations
Singly Linked Lists
Doubly Linked List
Circular Linked Lists
Memory Efficient Doubly Linked List
Problems on Linked List

3. Stacks
Stack and its operations
Stack using Arrays
Stack using Linked List
Problems on Stack
Applications and real-time problems

4. Queue
What is Queue and its operations
Circular Array implementation
Performance and Limitations
Problems on queue

5. Sorting
What is sorting
Bubble Sort
Selection Sort
Merge Sort
Insertion Sort
Quicksort
Problems on sorting

6. Searching
What is searching?
Unordered Linear Search
Sorted/ordered Linear Search
Binary Search
String Searching Algorithms
Problems on searching

7. Trees
What is a tree?
Binary Trees
Types
Structure
Properties
Operations
Binary Tree Traversals
Pre Order Traversals
Post Order Traversals
In Order Traversals
Level Order Traversals
Binary Search Trees
Problems on Trees

8. Graphs and its algorithms.
Graph Representations?
Graph Traversals
Depth First Traversals
Breadth-First Traversals
Comparison between DFS and BFS
Shortest Path Algorithms
Dijkstra’s
Bellman-Ford
Topological Sort
Minimal Spanning Tree
Prim’s Algorithm
Kruskal Algorithm
Problems on graph algorithms

9. Recursion And Backtracking
What is Recursion?
What is Backtracking?
Examples and Problems

10. Greedy Algorithms
Greedy Strategy
Does Greedy always work?
Applications
Problems on Greedy Algorithms

11. Dynamic Programming
What is Dynamic Programming Strategy?
Bottom-up Approach
Top-Down Approach
Problems on DP

Course Content

Time: 10 weeks

Curriculum is empty

Instructor

0.0

0 rating

5 stars
0%
4 stars
0%
3 stars
0%
2 stars
0%
1 star
0%
₹18,000 ₹15,000

30-Day Money-Back Guarantee