therealgiths
Snarky Genius
2
MONTHS
2 2 MONTHS OF SERVICE
LEVEL 2
900 XP
This is the course to pick if you are just getting into coding and want to build a strong foundation. Widely used in IT industry.
This is where you embark on an amazing journey!
Get doubts resolved in 30 mins
1:1 sessions over voice call & chat with our
skilled teaching assistants
Features that keep you going
A structured curriculum that makes learning easy
Weekly milestones to keep you motivated
Practice code problems of varying difficulty
Compile & run in an integrated coding environment
Industry leading mentors to help you grow
1:1 Mock interviews with resume and career guidance
Structured feedback to make you better
Get a chance to be referred to your mentors’ company
Most flexible program in the industry
Freedom to learn
Watch classes any time at your convenience
Cheat days
Catch up on the course when life is calling you elsewhere
Comprehensive placement package to make you job ready
Get access to an expert placement coach,
professional resume & portfolio services, and Hirist
spotlight benefits, with close focus on soft skills
The results
11 LPA
Average CTC
40x
Return on investment
95%
students bag dream tech jobs
Download our placement report
This can be your success story!
What are you waiting for? Start your journey towards your dream job today.
Course curriculum for the curious
Combo
Premium
Data Structures and Algorithms
15 hrs
Introduction to Programming
Basics of Programming
FLOWCHARTS
Introduction to flowcharts, Decision making using flowcharts, Loops, Example problems
VARIABLES AND DATA TYPES
First program, Variables and data types, Taking input, How data is stored in memory, Arithmetic Operators
CONDITIONAL STATEMENTS
Introduction to If else, Relational and logical operators, Nested conditionals
Loops and Functions
WHILE LOOPS
While loops, Flow of execution of statements in while loop, Example problems using while loop
PATTERNS
Introduction to patterns, Basic Patterns, Square Patterns, Triangular Patterns, Character Patterns, Reverse Triangle, Inverted patterns, Isosceles triangles
FOR LOOPS
For loops, Break and Continue, increment - decrement operators
FUNCTIONS
Introduction to functions, Working of function calling, Variables and its scope, Pass by value
Arrays
INTRODUCTION TO ARRAYS
Introduction to arrays, How arrays are stored in memory, Passing arrays to functions
SEARCHING AND SORTING
Understanding Binary Search, Selection sort, Bubble sort, Insertion sort, Merging two sorted arrays
Strings and 2D Arrays
STRINGS
Introduction to strings, storage of strings and their inbuilt functions
2D ARRAYS
2D arrays, Storage of 2D arrays, Example problems using 2D Arrays
45 hrs
Data Structures & Algorithms
Problem Solving Techniques
RECURSION
Introduction to recursion, Principle of mathematical induction, Fibonacci numbers, Recursion using arrays, Recursion using strings, Recursion using 2D arrays
TIME AND SPACE COMPLEXITY
Order complexity analysis, Theoretical complexity analysis, Time complexity analysis of searching and recursive algorithms, Theoretical space complexity, Space complexity analysis of merge sort
Object Oriented Programming
BASICS OF OOPS
Introduction to OOPS, Creating objects, Getters and setters, Constructors and related concepts, Inbuilt constructor and destructor, Example classes
ADVANCE CONCEPTS OF OOPS
Static members, Function overloading and related concepts, Abstraction, Encapsulation, Inheritance, Polymorphism, Virtual functions, Abstract classes, Exception handling
Linear Data Structures
LINKED LISTS
Introduction to linked list, Inserting node in linked list, Deleting node from linked list, Midpoint of linked list, Merge two sorted linked lists, merge sort of a linked list, Reversing a linked list
STACKS AND QUEUES
Introduction to stacks, Stack using arrays, Dynamic Stack class,Stack using linked list, Inbuilt stack, Queue using arrays, Dynamic queue class, Queue using linked list, Inbuilt queue
Trees
GENERIC TREES
Introduction to Trees, Making a tree node class, Taking a tree as input and printing, Tree traversals, Destructor for tree node class
BINARY TREES
Introduction to Binary Trees, Taking a binary tree as input and printing, Binary Tree traversals, Diameter of binary tree
BINARY SEARCH TREES
Introduction to Binary Search Trees, Searching a node in BST, BST class, Inserting and Deleting nodes in BST, Types of balanced BSTs
Advanced Data Structures
PRIORITY QUEUES
Introduction to Priority Queues, Ways to implement priority queues, Introduction to heaps, Introduction to Complete Binary Trees and its implementation, Insert and Delete operations in heaps, Implementing priority queues, Heap sort, Inbuilt Priority Queue
HASHMAPS
Introduction to Hashmaps, Inbuilt Hashmap, Hash functions, Collision handling, Insert and Delete operation implementation in hashmap, Load factor, Rehashing
TRIES
Introduction to Tries, Making a Trie Node class, Insert, Search and Remove operation implementation in Tries, Types of Tries, Huffman Coding
GRAPHS
Introduction to Graphs, Graph Terminology, Graph implementation, Graph Traversals (DFS and BFS), Weighted and Directed Graphs, Minimum Spanning Trees, Cycle Detection in Graphs, Kruskal's algorithm, Prim's Algorithm, Dijkstra's algorithm
Dynamic Programming
INTRODUCTION TO DYNAMIC PROGRAMMING
ntroduction to Memoization, Introduction to Dynamic Programming, Fibonacci numbers using recursion, memoization and dynamic programming
APPLICATIONS OF DYNAMIC PROGRAMMING
Longest Common Subsequence (LCS) using recursion, memoization and dynamic programming, Edit distance using recursion, memoization and dynamic programming, Knapsack problem using recursion, memoization and dynamic programming
This is where you embark on an amazing journey!
Get doubts resolved in 30 mins
1:1 sessions over voice call & chat with our
skilled teaching assistants
Features that keep you going
A structured curriculum that makes learning easy
Weekly milestones to keep you motivated
Practice code problems of varying difficulty
Compile & run in an integrated coding environment
Industry leading mentors to help you grow
1:1 Mock interviews with resume and career guidance
Structured feedback to make you better
Get a chance to be referred to your mentors’ company
Most flexible program in the industry
Freedom to learn
Watch classes any time at your convenience
Cheat days
Catch up on the course when life is calling you elsewhere
Comprehensive placement package to make you job ready
Get access to an expert placement coach,
professional resume & portfolio services, and Hirist
spotlight benefits, with close focus on soft skills
The results
11 LPA
Average CTC
40x
Return on investment
95%
students bag dream tech jobs
Download our placement report
This can be your success story!
What are you waiting for? Start your journey towards your dream job today.
Course curriculum for the curious
Combo
Premium
Data Structures and Algorithms
15 hrs
Introduction to Programming
Basics of Programming
FLOWCHARTS
Introduction to flowcharts, Decision making using flowcharts, Loops, Example problems
VARIABLES AND DATA TYPES
First program, Variables and data types, Taking input, How data is stored in memory, Arithmetic Operators
CONDITIONAL STATEMENTS
Introduction to If else, Relational and logical operators, Nested conditionals
Loops and Functions
WHILE LOOPS
While loops, Flow of execution of statements in while loop, Example problems using while loop
PATTERNS
Introduction to patterns, Basic Patterns, Square Patterns, Triangular Patterns, Character Patterns, Reverse Triangle, Inverted patterns, Isosceles triangles
FOR LOOPS
For loops, Break and Continue, increment - decrement operators
FUNCTIONS
Introduction to functions, Working of function calling, Variables and its scope, Pass by value
Arrays
INTRODUCTION TO ARRAYS
Introduction to arrays, How arrays are stored in memory, Passing arrays to functions
SEARCHING AND SORTING
Understanding Binary Search, Selection sort, Bubble sort, Insertion sort, Merging two sorted arrays
Strings and 2D Arrays
STRINGS
Introduction to strings, storage of strings and their inbuilt functions
2D ARRAYS
2D arrays, Storage of 2D arrays, Example problems using 2D Arrays
45 hrs
Data Structures & Algorithms
Problem Solving Techniques
RECURSION
Introduction to recursion, Principle of mathematical induction, Fibonacci numbers, Recursion using arrays, Recursion using strings, Recursion using 2D arrays
TIME AND SPACE COMPLEXITY
Order complexity analysis, Theoretical complexity analysis, Time complexity analysis of searching and recursive algorithms, Theoretical space complexity, Space complexity analysis of merge sort
Object Oriented Programming
BASICS OF OOPS
Introduction to OOPS, Creating objects, Getters and setters, Constructors and related concepts, Inbuilt constructor and destructor, Example classes
ADVANCE CONCEPTS OF OOPS
Static members, Function overloading and related concepts, Abstraction, Encapsulation, Inheritance, Polymorphism, Virtual functions, Abstract classes, Exception handling
Linear Data Structures
LINKED LISTS
Introduction to linked list, Inserting node in linked list, Deleting node from linked list, Midpoint of linked list, Merge two sorted linked lists, merge sort of a linked list, Reversing a linked list
STACKS AND QUEUES
Introduction to stacks, Stack using arrays, Dynamic Stack class,Stack using linked list, Inbuilt stack, Queue using arrays, Dynamic queue class, Queue using linked list, Inbuilt queue
Trees
GENERIC TREES
Introduction to Trees, Making a tree node class, Taking a tree as input and printing, Tree traversals, Destructor for tree node class
BINARY TREES
Introduction to Binary Trees, Taking a binary tree as input and printing, Binary Tree traversals, Diameter of binary tree
BINARY SEARCH TREES
Introduction to Binary Search Trees, Searching a node in BST, BST class, Inserting and Deleting nodes in BST, Types of balanced BSTs
Advanced Data Structures
PRIORITY QUEUES
Introduction to Priority Queues, Ways to implement priority queues, Introduction to heaps, Introduction to Complete Binary Trees and its implementation, Insert and Delete operations in heaps, Implementing priority queues, Heap sort, Inbuilt Priority Queue
HASHMAPS
Introduction to Hashmaps, Inbuilt Hashmap, Hash functions, Collision handling, Insert and Delete operation implementation in hashmap, Load factor, Rehashing
TRIES
Introduction to Tries, Making a Trie Node class, Insert, Search and Remove operation implementation in Tries, Types of Tries, Huffman Coding
GRAPHS
Introduction to Graphs, Graph Terminology, Graph implementation, Graph Traversals (DFS and BFS), Weighted and Directed Graphs, Minimum Spanning Trees, Cycle Detection in Graphs, Kruskal's algorithm, Prim's Algorithm, Dijkstra's algorithm
Dynamic Programming
INTRODUCTION TO DYNAMIC PROGRAMMING
ntroduction to Memoization, Introduction to Dynamic Programming, Fibonacci numbers using recursion, memoization and dynamic programming
APPLICATIONS OF DYNAMIC PROGRAMMING
Longest Common Subsequence (LCS) using recursion, memoization and dynamic programming, Edit distance using recursion, memoization and dynamic programming, Knapsack problem using recursion, memoization and dynamic programming