SEBI GRADE A 2025 – IT
Free
-
[ Phase 1 - IT Specialized ] Algorithm for Problem Solving ( Data Structures )
- Introduction [ Introduction ]
- Types Of Data Structures [ Introduction ]
- Operations Of Data Structures [ Introduction ]
- Concept Of Abstract Data Type [ Introduction ]
- Arrays – Part 1 [ Introduction ]
- Arrays – Part 2 [ Introduction ]
- Introduction To Stack [ Stacks ]
- Operations Of Stack ADT [ Stacks ]
- Stack Implementation Using Array Part – 1 [ Stacks ]
- Stack Implementation Using Array Part – 2 [ Stacks ]
- Introduction Of Queue [ Queues ]
- Operations Of Queue ADT [ Queues ]
- Queue Implementation Using Array Part – 1 [ Queues ]
- Queue Implementation Using Array Part – 2 [ Queues ]
- Circular Queue Implementation Part – 1 [ Queues ]
- Circular Queue Implementation Part – 2 [ Queues ]
- Introduction To Linked List [ Linked Lists ]
- Array Vs Linked List [ Linked Lists ]
- Linked List Implementation Part – 1 [ Linked Lists ]
- Linked List Implementation Part – 2 [ Linked Lists ]
- Linked List Implementation Part – 3 [ Linked Lists ]
- Linked List Implementation Part – 4 [ Linked Lists ]
- Linked List Implementation Part – 5 [ Linked Lists ]
- Linked List Implementation Part – 6 [ Linked Lists ]
- Stack Implementation Using Linked List – Part 1 [ Linked Lists ]
- Stack Implementation Using Linked List – Part 2 [ Linked Lists ]
- Queue Using Linked List Part – 1 [ Linked Lists ]
- Queue Using Linked List Part – 2 [ Linked Lists ]
- Circular Queue Using Linked List [ Linked Lists ]
- Doubly Linked List – Part 1 [ Linked Lists ]
- Doubly Linked List – Part 2 [ Linked Lists ]
- Doubly Linked List – Part 3 [ Linked Lists ]
- Doubly Linked List – Part 4 [ Linked Lists ]
- Doubly Linked List – Part 5 [ Linked Lists ]
- Introduction to Tree Data Structure & Binary Tree [ Trees ]
- Binary Tree Implementation Part 1 – Insertion & Traversing [ Trees ]
- Binary Tree Implementation Part 2 – Traversing & Deletion [ Trees ]
- Binary tree Traversal [ Trees ]
- Tree traversal methods: Pre, post and in-order traversal [ Trees ]
- (Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order [ Trees ]
- Height Balaced Binary Search Tree [ Trees ]
- AVL Tree [ Trees ]
- AVL Tree Solved Example – #1 [ Trees ]
- AVL Tree Solved Example – #2 [ Trees ]
- B-Tree Introduction [ Trees ]
- B-Tree Solved Example – #1 [ Trees ]
- B-Tree Solved Example – #2 [ Trees ]
- Huffman Coding [ Trees ]
- Graphs Introduction [ Graphs ]
- BFS & DFS – #1 [ Graphs ]
- BFS & DFS – #2 [ Graphs ]
- Topological Sorting [ Graphs ]
- Topological Sorting – Solved Example [ Graphs ]
- Binary Search [ Recursion and Storage Management ]
- Linear Search [ Recursion and Storage Management ]
- Recursion – Winding & Unwinding [ Recursion and Storage Management ]
- Introduction to Buddy System [ Recursion and Storage Management ]
- Problems on Buddy System [ Recursion and Storage Management ]
- Hashing Collision [ Searching & Sorting ]
- Hashing concept [ Searching & Sorting ]
- Linear Probing – #1 [ Searching & Sorting ]
- Linear Probing – #2 [ Searching & Sorting ]
- Linear Probing With Collisions – Solved [ Searching & Sorting ]
- Linear + Quadratic Probing – Solved Example [ Searching & Sorting ]
- Searching & Sorting Introduction [ Searching & Sorting ]
- Selection Sorting – #1 [ Searching & Sorting ]
- Selection Sorting – #2 [ Searching & Sorting ]
- Insertion Sort – #1 [ Searching & Sorting ]
- Insertion Sort – #2 [ Searching & Sorting ]
- Merge Sort – #1 [ Searching & Sorting ]
- Merge Sort – #2 [ Searching & Sorting ]
- Merge Sort – #3 [ Searching & Sorting ]
- Quick Sort – #1 [ Searching & Sorting ]
- Quick Sort – #2 [ Searching & Sorting ]
- Radix Sort – #1 [ Searching & Sorting ]
- Radix Sort – #2 [ Searching & Sorting ]
- Heap Data Structure [ Applications of Data Structures ]
- Min & Max Heap [ Applications of Data Structures ]
- Infix Notation & Conversion [ Applications of Data Structures ]
- Prefix, Postfix Notation & Conversion [ Applications of Data Structures ]
- Prim’s & Kruskal’s #1 [ Applications of Data Structures ]
- Prim’s & Kruskal’s #2 [ Applications of Data Structures ]
- Stack, Queue & Linked List [ Importance Solutions ]
- Trees [ Importance Solutions ]
- Graphs [ Importance Solutions ]
- Recursion & Storage Management [ Importance Solutions ]
- Searching & Sorting [ Importance Solutions ]
- Application Of Data Structures [ Importance Solutions ]
-
[ Phase 1 - IT Specialized ] Concepts of Programming
-
[ Phase 1 - IT Specialized ] Computer Fundamentals
-
[ Phase 1 - English ] Reading Comprehension
-
[ Phase 1 - English ] Sentence Rearrangement
-
[ Phase 1 - English ] Subject Verb and Agreement
-
[ Phase 1 - English ] Verbal Ability Extra
- Introduction to Verbal Ability + Tenses Part #1
- Tenses Part #2
- Tenses Notes
- Error Detection and Correction + Sentence Completion #1
- Tenses Practice Problems
- Sentence Completion #2
- Spotting Erorrs [ Notes + Solved Examples + Practice Problem ]
- Sentence Completion [ Notes + Solved Examples + Practice Problem ]
- Assumption in Verbal Reasoning
- Deduction Reasoning
-
[ Phase 1 - English ] Sentence Correction
-
[ Phase 1 - English ] Fill In The Blanks
-
[ Phase 1 - English ] Error Identification
-
[ Phase 1 - English ] Paragraph
-
[ Phase 1 - English ] Sentence Completion
-
[ Phase 1 - English ] Cloze Test
No items in this section -
[ Phase 1 Reasoning ] Blood Relations
-
[ Phase 1 Reasoning ] Coding Decoding
-
[ Phase 1 Reasoning ] Data Sufficiency
-
[ Phase 1 Reasoning ] Directions
-
[ Phase 1 Reasoning ] Seating Arrangement
-
[ Phase 1 Reasoning ] Syllogism
-
[ Phase 1 Reasoning ] Puzzle
No items in this section -
[ Phase 1 Reasoning ] Verbal Analogy
-
[ Phase 1 Reasoning ] Inequality
No items in this section -
[ Phase 1 Quantitative ] Quadratic Equation
No items in this section -
[ Phase 1 Quantitative ] Discount
No items in this section -
[ Phase 1 Quantitative ] Ratio and Proportion
-
[ Phase 1 Quantitative ] Average
-
[ Phase 1 Quantitative ] Allegations and Mixtures
-
[ Phase 1 Quantitative ] Percentage
-
[ Phase 1 Quantitative ] Profit and Loss
-
[ Phase 1 Quantitative ] Time, Speed and Distance
-
[ Phase 1 Quantitative ] Simple and Compound Interest
-
[ Phase 1 Quantitative ] Probability
-
[ Phase 1 Quantitative ] Permutation and Combination
-
[ Phase 1 Quantitative ] Time and Work
-
[ Phase 1 Quantitative ] Number Series
-
[ Phase 1 Quantitative ] Data Interpretation
-
[ Phase 1 Quantitative ] Number System
- Number System – 1 [ New Video ]
- Number System – 2 [ New Video ]
- Number System – 3 [ New Video ]
- Number System – 4 [ New Video ]
- Number System – 1
- Number System – 2
- Number System – 3
- Number System – 4
- Number System – 5
- Number System – 6
- Number System – 7
- Number System – 8
- Number System – 9
- Number System – 10
- Number System, LCM & HCF Practice Problem
-
[ Phase 1 Quantitative ] Simplifications
-
[ Phase 1 Quantitative ] Data Suffiency
-
[ Phase 2 ] C Snippet Problems with Solution Videos
-
[ Phase 2 ] Pseudocode
No items in this section -
[ Phase 2 ] Description English
- Essay Writing Tips and Tricks
- Essay Writing Examples
- Essay Writing Best Practices
- Reading Comprehension
- Reading Comprehension -1
- Reading Comprehension -2
- Reading Comprehension [ Notes + Solved Examples + Practice Problem ]
- Reading Comprehension Notes 1
- Reading Comprehension Notes 2
- Subject Verb Agreement Notes
-
IT : 500+ Practice Questions [ Subjectwise ]
No items in this section -
[ Phase 1 - IT Specialized ] Database + SQL
No items in this section -
[ Phase 1 - IT Specialized ] Networking Concepts
No items in this section -
[ Phase 1 - IT Specialized ] OOP's Concept
No items in this section -
[ Phase 1 - IT Specialized ] Programming
No items in this section -
[ Phase 1 - IT Specialized ] Data Analytics Language ( R, Python )
No items in this section -
[ Phase 1 - IT Specialized ] Data Warehousing
No items in this section
