DS and Algo Foundation Overview

Course Overview

A self-paced online course that is designed so you could clear all your DSA basics with ease. You will be taught by industry experts and cover all the DSA topics thoroughly. This course is for anyone who wants to learn the Basics of Data Structures to start Competitive Programming, Preparation for on-campus/off-campus placements in top-notch companies like Amazon, Microsoft, etc or even Programmers looking to replenish their fundamentals in Data Structures.
avtar

What you will learn

Learn about the core fundamentals of Data Structures & Algorithms
Learn the basic yet important topics of DSA like recursion, searching, sorting, hashing etc
Learn about the more advanced topics like Dynamic Programming, Backtracking, Graph etc
Solve complex problems easily by learning the fundamental algorithmic techniques

Course Description

Do you ever see a complex code and feel that this could be solved more efficiently? Its time to learn how. This foundation course is curated specially for the curious Geek in you who thrives to master the basics of DSA!
01 Analysis of Algorithm
Analysis of Algorithm, Order of Growth, Asymptotic Notations and much more
02 Arrays
Introduction to Arrays, Types of Arrays, Operations on Arrays and much more
03 Recursion
Introduction to Recursion, Applications of Recursion, Writing base cases in Recursion and much more
04 Hashing
Introduction, Application of Hashing, Discussion on Direct Address Table and much more
05 Strings
Introduction of String, Strings in C++, Strings in Java and much more
06 Searching
Binary Search Iterative and Recursive, Analysis of Binary Search, Square Root and much more
07 Sorting
Sorting in C++ STL, Sorting in Java, Arrays.sort() in Java, Collection.sort() in Java and much more
08 Linked List
Introduction, Middle of Linked List, Nth Node from end of Linked List and much more
09 Circular Linked List
Circular Linked List, Circular Linked List Traversal in C++, Circular Linked List Traversal in Java and much more
10 Doubly Linked List
Doubly Linked List, Insert at Begin of Doubly Linked List, Insert at End Doubly Linked List and much more
11 Stack
Understanding the Stack data structure, Applications of Stack, Implementation of Stack and much more
12 Queue
Application of Queue, Implementation of the queue using array and LinkedList, Queue in Java and much more
13 Dequeue
Deque Data Structures, Dequeue in C++ STL and Java and much more
14 Tree
Tree Data Structure, Binary Tree, Implementation in various Transversals and much more
15 Binary Search Tree
Background and Introduction, Search in BST, Insertion in BST and much more
16 Heap
Binary Heap introduction & implementation, Heap Sort, Heap Insert and much more
17 Graph
Introduction to Graph, Graph Representation, Breadth-First Search and much more
18 Greedy Algorithms
Introduction, Activity Selection Problem, Fractional Knapsack and much more
19 Dynamic Programming
Introduction, Dynamic Programming Memoization, Maximum Cuts and much more
20 Backtracking Algorithms
Concepts of Backtracking, Rat In a Maze, N Queen Problem and much more
You May Also Like Latest Post  Fundamentals of Java and Java Collections -geeksforgeeks
 

Protected: DS and Algo Foundation -geeksforgeeks

Get Your ACCESS Password

[sdm_download id=”66777″ fancy=”0″]

The post DS and Algo Foundation -geeksforgeeks (Premium) appeared first on Go Audio.

Geeks For Geeks Courses Overview

A self-paced course that has been divided into 8 weeks where you will learn the basics of DSA and can practice questions & attempt the assessment tests from anywhere in the world. This will further help you to prepare for interviews with top-notch companies like Microsoft, Amazon, Adobe etc. You will also learn algorithmic techniques for solving various problems with full flexibility of time. This course does not require any prior knowledge of Data Structure and Algorithms, but a basic knowledge of any programming language ( C++ / Java) will be helpful.
avtar

What you will learn

Mastering DSA from basic to advanced level
Solving problems which are asked in product-based companies
Solve problems in contests similar to coding round for SDE role
How to become a strong and efficient developer
01 Introduction
Learn from the basics, such as Analysis of Algorithms, Order of Growth and much more
02 Mathematics
Learn Finding the number of digits in a number, Arithmetic and Geometric Progressions, Quadratic Equations, Mean and Median and much more
03 Bit Magic
Bitwise Operators in C++ and Java and many practice problems
04 Recursion
Introduction to Recursion, Applications of Recursion, Writing base cases in Recursion and much more
05 Arrays
Introduction and Advantages, Types of Arrays, Operations on Arrays and much more
06 Searching
Binary Search Iterative and Recursive, Binary Search and various associated problems(With Video Solutions) and much more
07 Sorting
Implementation of C++ STL sort() function in Arrays and Vectors, Sorting in Java, Arrays.sort() in Java, Collection.sort() in Java and much more
08 Matrix
Introduction to Matrix in C++ and Java, Multidimensional Matrix, Pass Matrix as Argument, Printing matrix in a snake pattern and much more
09 Hashing
Introduction and Time complexity analysis, Application of Hashing, Discussion on Direct Address Table and much more
10 Strings
Discussion of String DS, Strings in CPP, Strings in Java, Problems(With Video Solutions) and much more
11 Linked List
Introduction, Doubly Linked List, Circular Linked List, Loop Problems and much more
12 Stack
Understanding the Stack data structure, Applications of Stack, Implementation of Stack in Array and Linked List and much more
13 Queue
Introduction and Application, Implementation of the queue using array and LinkedList and much more
14 Deque
Introduction and Application, Implementation in C++ STL and Java and Problems(With Video Solutions) and much more
15 Tree
Introduction, Implementation in various Transversals and much more
16 Binary Search Tree
Background, Introduction and Application, Implementation of Search in BST, Insertion in BST and much more
17 Heap
Introduction & Implementation, Binary Heap, Heap Sort and much more
18 Graph
Introduction to Graph, Graph Representation, Breadth-First Search and much more
19 Greedy
Introduction, Activity Selection Problem, Fractional Knapsack and much more
20 Backtracking
Concepts of Backtracking, Rat In a Maze, N Queen Problem, Sudoku Problem and much more
21 Dynamic Programming
Introduction, Dynamic Programming, Problems(With Video Solutions) and much more
22 Trie
Introduction, Count Distinct Rows in a Binary Matrix and much more
23 Segment Tree
Introduction, Construction, Range Query, Update Query and much more
24 Disjoint Set
Introduction, Find and Union Operations, Union by Rank, Path Compression and much more
You May Also Like Latest Post  Learn Squared – Design for Production Animation 
 

Protected: Geeks For Geeks Courses : Data Structures and Algorithms

Get Your ACCESS Password

[sdm_download id=”66133″ fancy=”0″]

The post Geeks For Geeks Courses : Data Structures and Algorithms (Self-Paced Course) (premium) appeared first on Go Audio.