Data Structures and Algorithms is one of the most important skills that every computer science student must-have. It is often seen that people with good knowledge of these technologies are better programmers than others and thus, crack the interviews of almost every tech giant.
What you'll learn
- Learn various Popular Data Structures and their Algorithms
- Develop your Analytical skills on Data Structure and use then efficiently
- Learn Recursive Algorithms on Data Structures
- Learn about various Sorting Algorithms
- Implementation of Data Structures using C and C++
Requirements
- Desktop/ Laptop
- Internet connectivity min 2 Mbps
Target Audience
- Software Developer
- Web developer
- Data Analyst
- Cloud Engineer
- DevOps Engineer
- Algorithm Constructs
- Complexity analysis of algorithms (Big O notation )
- Basic Data Structures
- Arrays
- Stacks
- Queues
- Circular Queues
- Lists
- LinkedList
- What are the different class of algorithms
- How to write efficient Algorithm
- Introduction to algorithm design techniques
- Algorithm Design techniques
- Analysis of an Algorithm
- Asymptotic Analysis
- Algorithm Analysis
- Complexity
- Complexity Analysis
- Space complexity of algorithm
- Time complexity of algorithm
- Case study on Algorithm Design techniques
- Application of Data structures
- Linked lists
- Singly linked lists
- Doubly linked lists
- Circular linked lists
- Node-based storage with arrays
- Problems related to linked lists
- Queue
- Deque
- Problems related to queues
- Stack
- Problems related to stack
- Linear Search
- Binary Search
- Selection sort
- Insertion sort
- Merge sort
- Quicksort
- Introduction to trees
- Trees and terminology
- Tree traversals
- Binary trees
- Complete binary trees / Almost complete binary tree (ACBT)
- Array implementation of ACBT
- Binary search trees
- AVL tree
- Multi-way tree
- Brief introduction and uses cases of B-Tree /B+ Tree.
- Introduction to graph theory
- Graph Terminology
- Different types of Graphs
- Representation of Graphs
- Adjacency Matrix
- Adjacency List
- Graph Traversal Algorithms ( Breadth First Search, Depth First Search)
- Shortest Path
- Level Setting : Dijkstra’s algorithm
- Level Correcting: All-pairs shortest path, Floyd-Warshall algorithm
- Spanning Trees
- Minimum spanning tree algorithms,
- Prim’s algorithm
- Kruskal’s Algorithm
This course does not require any prior expertise but we need a passionate mind that wants to learn and experience things with us.
The course delivery will be completely online.
The course will be delivered in hybrid mode, which means our trainers will be taking sessions online along with recorded lectures on our platform.
The fee once paid is not refundable or adjustable under any circumstances in future
