SEBI GRADE A 2025 – IT
₹8,000,000,000.00
₹299,999,999.00
⭐ Trusted by 1000+ Students
-
About the Course
LMT - SEBI GRADE A 2025 - IT This Course is Only Available
On Our AppDive in and start learning. Get offline access to all the course contents!
No items in this section -
Previous Year Question
-
[ 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
-
[ 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
-
[ Phase 1 Reasoning ] Verbal Analogy
-
[ Phase 1 Reasoning ] Inequality
-
[ Phase 1 Quantitative ] Quadratic Equation
-
[ Phase 1 Quantitative ] Discount
-
[ 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 1 - IT Specialized ] Computer Fundamentals
-
[ Phase 1 - IT Specialized ] Concepts of Programming
-
[ Phase 1 - IT Specialized ] Database + SQL
- Introduction to DBMS Basic Concept [01 Introduction Database Concepts]
- Advantages and Disadvantage of DBMS [01 Introduction Database Concepts]
- Architecture of DBMS [01 Introduction Database Concepts]
- Database Administrator Manager Storage Manager [01 Introduction Database Concepts]
- Data Independence [01 Introduction Database Concepts]
- Entity Relationship Modelling with solved example [02 Entity–Relationship Data Model]
- Extended Entity Relationship Model with solved example [02 Entity–Relationship Data Model]
- Data Modelling [03 Relational Model and relational Algebra]
- Inference Rules [03 Relational Model and relational Algebra]
- Keys [03 Relational Model and relational Algebra]
- E-R To Relational Schema #1 [03 Relational Model and relational Algebra]
- E-R To Relational Schema #2 [03 Relational Model and relational Algebra]
- Introduction to SQL [04 Structured Query Language (SQL) ]
- Data definition language [04 Structured Query Language (SQL) ]
- DML ( data manipulation language ) [04 Structured Query Language (SQL) ]
- DRL ( Data Retrieval Language) [04 Structured Query Language (SQL) ]
- Aggregate Function in SQL [04 Structured Query Language (SQL) ]
- Types Of Joins & Inner Join [04 Structured Query Language (SQL) ]
- Left, Right & Full Join [04 Structured Query Language (SQL) ]
- SQL Queries | Solved Example – 1 [04 Structured Query Language (SQL) ]
- SQL Queries | Solved Example – 2 [04 Structured Query Language (SQL) ]
- SQL Queries | Solved Example – 3 [04 Structured Query Language (SQL) ]
- SQL Queries | Solved Example – 4 [04 Structured Query Language (SQL) ]
- SQL Queries | Solved Example – 5 [04 Structured Query Language (SQL) ]
- PL SQL | part 1 | [04 Structured Query Language (SQL) ]
- PL SQL | part 2 | [04 Structured Query Language (SQL) ]
- Query Processing And Query Optimisation [Part 1] [04 Structured Query Language (SQL) ]
- Query Processing And Query Optimisation [Part 2] [04 Structured Query Language (SQL) ]
- Query Processing And Query Optimisation [Part 3] [04 Structured Query Language (SQL) ]
- Query Processing And Query Optimisation [Part4] [04 Structured Query Language (SQL) ]
- Integrity Constraints [04 Structured Query Language (SQL) ]
- Trigger [04 Structured Query Language (SQL) ]
- Normalization and first normal form 1NF [05 – Relational-Database Design]
- Second Normal Form 2NF example [05 – Relational-Database Design]
- Third Normal Form 3NF with example [05 – Relational-Database Design]
- BCNF | Boyce Cod Normal Form | with example [05 – Relational-Database Design]
- Canonical Cover [05 – Relational-Database Design]
- Decomposition And Dependency Preservation [05 – Relational-Database Design]
- Concurrency Control [06 Transactions Management and Concurrence]
- Concurrency Control – Lock Based Protocol in DBMS Transaction [06 Transactions Management and Concurrence]
- Timestamp Based Protocol [06 Transactions Management and Concurrence]
- Deadlock Full concept in DBMS transaction management [06 Transactions Management and Concurrence]
- Shadow Paging in Database Recovery [06 Transactions Management and Concurrence]
- Log Based Database Recovery [06 Transactions Management and Concurrence]
- Shadow Copy Technique in Database recovery [06 Transactions Management and Concurrence]
- Transaction State and Acid Properties [06 Transactions Management and Concurrence]
- Transaction Schedule [06 Transactions Management and Concurrence]
- View Serializability [06 Transactions Management and Concurrence]
- Conflict Serializability [06 Transactions Management and Concurrence]
-
[ Phase 1 - IT Specialized ] Algorithm for Problem Solving ( Data Structures )
- 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 ]
- Divide & Conquer With Example [ Divide and Conquer ]
- Binary Search [ Divide and Conquer ]
- Max Min Problem with Solved Examples [ Divide and Conquer ]
- Merge Sort Algorithm with Solved Examples [ Divide and Conquer ]
- Multiplying Long Integers Using Divide and Conquer Technique [ Divide and Conquer ]
- Quick Sort Algorithm Web [ Divide and Conquer ]
- Quick Sort Algorithm Explained with Example [ Divide and Conquer ]
- Prim’s Algorithm for Minimum Spanning Tree [ Greedy Method ]
- Flow Shop Scheduling Explained [ Greedy Method ]
- Dijkstra’s Algorithm with Solved Example [ Greedy Method ]
- Kruskal algorithm for Minimum Spanning Tree With Example [ Greedy Method ]
- Dynamic Programming [ Dynamic Programming ]
- DP Approaches 1 [ Dynamic Programming ]
- DP Approaches 2 [ Dynamic Programming ]
- Multistage Graphs [ Dynamic Programming ]
- Multistage Graphs Problem with Solved Example [ Dynamic Programming ]
- Knapsack Problem part 1 [ Dynamic Programming ]
- Knapsack Problem part 2 [ Dynamic Programming ]
- Knapsack Problem part 3 [ Dynamic Programming ]
- Travelling Salesperson Problem with Solved Example [ Dynamic Programming ]
-
[ Phase 1 - IT Specialized ] Networking Concepts
- Introduction to Computer Networks [01 Introduction to Networks]
- Network Topologies [01 Introduction to Networks]
- Network Connecting Devices [01 Introduction to Networks]
- Connection-Oriented vs Connection-Less Communication [01 Introduction to Networks]
- OSI Reference Model [01 Introduction to Networks]
- TCP-IP Reference Model [01 Introduction to Networks]
- OSI vs TCP-IP Model Comparision [01 Introduction to Networks]
- Network Classification LAN, MAN, WAN [01 Introduction to Networks]
- Virtual Lan’s [01 Introduction to Networks]
- CoAxial Cable [02 Physical Layer]
- Twisted-Pair Cables [02 Physical Layer]
- Transmission Media: Guided and Unguided [Difference] [02 Physical Layer]
- Fiber Optics Part [01] [02 Physical Layer]
- Fiber Optics Part [02] [02 Physical Layer]
- Framing and it’s Methods [03 Data Link Layer]
- Error Detection and its Methods [03 Data Link Layer]
- Hamming Code [03 Data Link Layer]
- Cyclic Redundancy Check Part [01] [03 Data Link Layer]
- Cyclic Redundancy Check Part [02] [03 Data Link Layer]
- Parity Checking and Checksum Error Detection [03 Data Link Layer]
- Flow Control: Stop and Wait and Sliding Window Protocol [03 Data Link Layer]
- Go Back- N ARQ System [03 Data Link Layer]
- SDLC protocol [03 Data Link Layer]
- HDLC protocol [03 Data Link Layer]
- Carrier Sense Multiple Access-Collision Detection Procedure (CSMA-CD) [03 Data Link Layer]
- IP address vs MAC address [04 Network Layer]
- IPv4 Header Format [04 Network Layer]
- IPv4 vs IPv6 [04 Network Layer]
- Routing Algorithms Part 01 [04 Network Layer]
- Routing Algorithms Part 02 [04 Network Layer]
- ARP & RARP [04 Network Layer]
- Leaky Bucket Algorithm [04 Network Layer]
- Token Bucket Algorithm [04 Network Layer]
- Berkeley Sockets [05 Transport Layer]
- User Datagram Protocol [05 Transport Layer]
- Domain Name Server – DNS [06 Application Layer]
- Simple Mail Transfer Protocol – SMTP [06 Application Layer]
- Hypertext Transfer Protocol – HTTP [06 Application Layer]
- File Transfer Protocol – FTP [06 Application Layer]
- Network Security Management [07 Network Security]
- SNMP v3 Architecture [07 Network Security]
- Network Access Control With Use Cases [07 Network Security]
- IDS and its Types [08 System Security]
- Firewall & types [08 System Security]
- Firewall Design Principles [08 System Security]
- Data Communication and Networking
- Data Communication and Networking Notes
-
[ Phase 1 - IT Specialized ] OOP's Concept
-
[ Phase 1 - IT Specialized ] Object Oriented Programming in C++
- Object Oriented Programming (C++) Sample
- Object Oriented Programming (C++)
- Object Oriented Programming (C++) Practice Problem
- Introduction to C++
- Input & Output in C++
- Difference between Structure in C & C++
- Class & Objects C++
- Inspector, Mutators, Facilitators
- Contructor & Destructor
- Default Arguments & Inline Function
- Array of Objects
- Dynamic Memory Allocation
- Static Member and function
- Exception handling
- Composition
- Friend Class and function
- Function Overloading
- Operator Overloading
- Copy Constructor
- Inheritance
- Pure Virtual Function
- Types of Inheritance
- Virtual Function
- Template
- RTTI
- Casting Operators
- Dynamic Array of Object
-
[ Phase 1 - IT Specialized ] C Programming
- C Programming Part #1
- C Programming Part #2
- C Programming Part #3
- C Programming Part #4
- C Programming Part #5
- C Programming Part #6
- C Programming Part #7
- C Programming Part #8
- C Programming Part #9
- C Programming Part #10
- C Programming Part #11
- C Programming Part #12
- C Programming Part #15
- C Programming Part #14
- C Programming Part #13
- C Programming Part #16
- C Programming Part #17
- C Programming Part #18
- C Programming Part #19
- C Programming Part #20
- C Programming Part #21
- C Programming Part #22
- C Programming Part #23
- C Programming Part #24
- C Programming Part #25
- C Programming Part #26
- C Programming Part #27
- C Programming Part #28
- C Programming Part #29
- C Programming Part #30
- C Programming [Notes]
- C Programming Practice Problem
-
[ Phase 1 - IT Specialized ] C Snippet Problems with Solutions Video
-
[ Phase 1 - IT Specialized ] Data Analytics Language ( R Language)
-
[ Phase 1 - IT Specialized ] Data Analytics Language ( Python Language)
- [Module 1] Introduction and Installation
- [Module 02 : Basic I/O, Operators & Using] Numbers and Strings
- [Module 02 : Basic I/O, Operators & Using] Lists and Dictionaries
- [Module 02 : Basic I/O, Operators & Using] Assignment Operators
- [Module 02 : Basic I/O, Operators & Using] Development Environment
- [Module 02 : Basic I/O, Operators & Using] Visual Studio Code: [VS_Code]
- [Module 03: Conditional Statements & Loop] Conditional Statements
- [Module 03: Conditional Statements & Loop] User Input
- [Module 03: Conditional Statements & Loop] WHILE Loop
- [Module 03: Conditional Statements & Loop] FOR Loop
- [Module 03: Conditional Statements & Loop] FOR Loop: (Dictionary Enumeration)
- [Module 04: Functions, Classes & Exception] Functions
- [Module 04: Functions, Classes & Exception] Class and Objects
- [Module 04: Functions, Classes & Exception] Constructors
- [Module 04: Functions, Classes & Exception] Exception handling
- [Module 05: Module & Experincin] Modules
- [Module 05: Module & Experincin] Statistics Module
- [Module 05: Module & Experincin] CSV Module
- [Module 05: Module & Experincin] PIP
- [Module 05: Module & Experincin] Jupyter Note Book
- [Module 06: SQLite, Tkinter in Python] SQLite
- [Module 06: SQLite, Tkinter in Python] Tkinter
- [Module 06: SQLite, Tkinter in Python] Making [.exe] in Python
- [Bonus Hands-On Projects+ Source Code] Rock Paper Scissor Python Game
- [Bonus Hands-On Projects+ Source Code] Message Encode Decode in Python Project
- [Bonus Hands-On Projects+ Source Code] Calculator in Python
- [Bonus Hands-On Projects+ Source Code] Source Code of all 3 Projects [Notes]
-
[ Phase 1 - IT Specialized ] Data Warehousing
- Introduction to Data Warehouse
- Meta Data
- Data Mart
- Data Warehouse Architecture
- How to Draw Star , Smowflake and Fack Constelation Basics
- Numericals on Star , Snowflake and Fact Constelation [ Part 1 ]
- Numericals on Star , Snowflake and Fact Constelation [ Part 2 ]
- What is Olap Operations
- OLAP VS OLTP
- Extract Transform and Load (ETL)
- Introduction to Data Mining and Architecture
- Data Visualization Part #1
- Data Visualization Part #2
- Data Preprocessing Part #1
- Data Preprocessing Part #2
-
[ Phase 1 - IT Specialized ] [ Phase 1 - IT Specialized ]
-
[ Phase 1 - IT Specialized ] Shell Programming
-
[ 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
-
[ Phase 2 ] OOP's Concept
-
[ Phase 2 ] Data Structures Concepts
- 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 ]
-
[ Phase 2 ] Algorithms Logic + Code
-
[ Phase 2 ] Data Structure Logic and Code
- Problem 1 [ Arrays ]
- Problem 2 [ Arrays ]
- Problem 3 [ Arrays ]
- Problem 4 [ Arrays ]
- Array Problem – Find Intersection [ Arrays ]
- Arrays Rotation by ‘x’ position [ Arrays ]
- Unique combination to sum up a target [ Arrays ]
- Two Sum Algorithm [ Two Pointers ]
- Two Pointer Example [ Two Pointers ]
- Container with Most Water [ Two Pointers ]
- Trapping Water [ Two Pointers ]
- Anagram [ Two Pointers ]
- K-Most Frequent [ Two Pointers ]
- Daily Temperature [ Stacks ]
- Car Fleet [ Stacks ]
- Sliding Window Algo [ Sliding Window ]
- Stock 1 [ Sliding Window ]
- Stock 2 [Sliding Window ]
- Arrays Part-1
- Arrays Part-2
- Number System
- Number Series
-
[ Phase 2 ] String Manipulation Logic and Code
-
[ Phase 2 ] C Snippet Problems with Solution Videos
-
[ Phase 2 ] Pseudocode
-
IT : 500+ Practice Questions [ Subjectwise ]
SEBI GRADE A 2025 – IT ( Phase 1 + Phase 2) – Crash Courses
Crack your Dream Exams Aptitude in first attempt with LMT Exams Series
- 📚60+ video Lectures
- 📌 500+ Practice Problems
- 📝 Handmade Notes
- 👣 Beginner Friendly
- ⭐️ Trusted by 1000+ Students
- 🔥 10 Lakh+ Video Views of Youtube
Course Sections:
- 🧠 Phase 1
- 🗣 Phase 2
- 📊 IT Specialized
The one-stop destination for everything you need for preparation of SEBI GRADE A Exam
So let’s dive in – Enroll today, Crack the exam & get to work with your Dream Company
Course Features
- Lectures 639
- Quizzes 0
- Duration 50 hours
- Skill level All levels
- Language English
- Students 263
- Certificate No
- Assessments Yes
