SEBI GRADE A 2025 IT- Phase 1 2025
₹800,000.00
₹80,000.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!
-
[ 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 Sufficiency
-
[ 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
-
[ Paper 2 - IT Specialized Subjects ] Database Concepts
- Entity Relationship Modelling with solved example [ Entity-Relationship Model ]
- Extended Entity Relationship Model with solved example [ Entity-Relationship Model ]
- Data Modelling [ Relational Algebra ]
- Inference Rules [ Relational Algebra ]
- Keys [ Relational Algebra ]
- E-R To Relational Schema #1 [ Relational Algebra ]
- E-R To Relational Schema #2 [ Relational Algebra ]
- Normalization and first normal form 1NF [ Normal Forms ]
- Second Normal Form 2NF example [ Normal Forms ]
- Third Normal Form 3NF with example [ Normal Forms ]
- BCNF | Boyce Cod Normal Form | with example [ Normal Forms ]
- Canonical Cover [ Normal Forms ]
- Decomposition And Dependency Preservation [ Normal Forms ]
- Concurrency Control [ Transactions & Concurrency Control ]
- Concurrency Control – Lock Based Protocol in DBMS Transaction [ Transactions & Concurrency Control ]
- Timestamp Based Protocol [ Transactions & Concurrency Control ]
- Deadlock Full concept in DBMS transaction management [ Transactions & Concurrency Control ]
- Shadow Paging in Database Recovery [ Transactions & Concurrency Control ]
- Log Based Database Recovery [ Transactions & Concurrency Control ]
- Shadow Copy Technique in Database recovery [ Transactions & Concurrency Control ]
- Transaction State and Acid Properties [ Transactions & Concurrency Control ]
- Transaction Schedule [ Transactions & Concurrency Control ]
- View Serializability [ Transactions & Concurrency Control ]
- Conflict Serializability [ Transactions & Concurrency Control ]
-
[ Paper 2 - IT Specialized Subjects ] SQL Queries
- 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) ]
-
[ Paper 2 - IT Specialized Subjects ] Object Oriented Programming in C++
- Object Oriented Programming (C++) Sample
- 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
- Types of Inheritance
- Virtual Function
- Pure Virtual Function
- Template
- RTTI
- Casting Operators
- Dynamic Array of Object
- Object Oriented Programming (C++)
- Object Oriented Programming (C++) Practice Problem
-
[ Paper 2 - IT Specialized Subjects ] C Programming
- 01 – Algorithm & FlowCharts
- 02 – Keywords & Identifiers
- 03 – First program in C
- 04 – Variables & Constants
- 05 – Datatypes in C – Part 1
- 06 – Datatypes in C – Part 2
- 07 – Operators in C
- 08 – Bitwise Operators
- 09 – Basic IO
- 10 – If & If Else – Part 1
- 11 – Nested If Else & Else If – #1
- 12 – Nested If Else & Else If – #2
- 13 – Switch Statement
- 14 – Loops & For Loop
- 15 – While & Do-While Loop
- 16 – Function in C
- 17 – User Defined Function
- 18 – Recursion – #1
- 19 – Recursion – #2
- 20 – Introduction To Arrays
- 21. 1-D Array
- 22. 2-D Array
- 23. Strings
- 24. String Functions
- 25. Structure & Union
- 26. Implementation of Structure & Union
- 27. Structure with function
- 28. Pointers in C
- 29. Pointers in C Code
- 30. Pointer Operations in C
- C Programming [Notes]
- C Programming Practice Problem
-
[ Paper 2 - IT Specialized Subjects ] Data Analytics Languages ( R Language )
-
[ Paper 2 - IT Specialized Subjects ] Data Analytics Languages ( Python Language)
- [ Section 01 : Introduction ] Introduction and Installation
- [Section 02 : Basic I/O, Operators & Using] Numbers and Strings
- [Section 02 : Basic I/O, Operators & Using] Lists and Dictionaries
- [Section 02 : Basic I/O, Operators & Using] Assignment Operators
- [Section 02 : Basic I/O, Operators & Using] Development Environment
- [Section 02 : Basic I/O, Operators & Using] Visual Studio Code: [VS_Code]
- [Section 03: Conditional Statements & Loop] Conditional Statements
- [Section 03: Conditional Statements & Loop] User Input
- [Section 03: Conditional Statements & Loop] WHILE Loop
- [Section 03: Conditional Statements & Loop] FOR Loop
- [Section 03: Conditional Statements & Loop] FOR Loop: (Dictionary Enumeration)
- [Section 04: OOPS! FUNCTIONS, CLASSES & E ] Functions
- [Section 04: OOPS! FUNCTIONS, CLASSES & E ] Class and Objects
- [Section 04: OOPS! FUNCTIONS, CLASSES & E ] Constructors
- [Section 04: OOPS! FUNCTIONS, CLASSES & E ] Exception handling
- [Section 05: Module & Experincin] Modules
- [Section 05: Module & Experincin] Statistics Module
- [Section 05: Module & Experincin] CSV Module
- [Section 05: Module & Experincin] PIP
- [Section 05: Module & Experincin] Jupyter Note Book
- [Section 06: SQLite, Tkinter in Python] SQLite
- [Section 06: SQLite, Tkinter in Python] Tkinter
- [Section 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]
-
[ Paper 2 - IT Specialized Subjects ] Algorithm for Problem Solving
- Introduction to Tree Data Structure & Binary Tree [ Tree and Graph Traversals ]
- Binary Tree Implementation Part 1 – Insertion & Traversing [ Tree and Graph Traversals ]
- Binary Tree Implementation Part 2 – Traversing & Deletion [ Tree and Graph Traversals ]
- Binary tree Traversal [ Tree and Graph Traversals ]
- Tree traversal methods: Pre, post and in-order traversal [ Tree and Graph Traversals ]
- (Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order [ Tree and Graph Traversals ]
- Graphs Introduction [ Tree and Graph Traversals ]
- BFS & DFS – #1 [ Tree and Graph Traversals ]
- BFS & DFS – #2 [ Tree and Graph Traversals ]
- Prim’s Algorithm for Minimum Spanning Tree [ Spanning Trees & Shortest Path ]
- MST – Prim’s Algorithm [ Spanning Trees & Shortest Path ]
- Kruskal algorithm for Minimum Spanning Tree With Example [ Spanning Trees & Shortest Path ]
- Dijkstra’s Algorithm with Solved Example [ Spanning Trees & Shortest Path ]
- All Pair Shortest Path [ Spanning Trees & Shortest Path ]
- Hashing concept [ Hashing, Searching & Sorting ]
- Hashing Collision [ Hashing, Searching & Sorting ]
- Linear Probing – #1 [ Hashing, Searching & Sorting ]
- Linear Probing – #2 [ Hashing, Searching & Sorting ]
- Linear Probing With Collisions – Solved [ Hashing, Searching & Sorting ]
- Linear + Quadratic Probing – Solved Example [ Hashing, Searching & Sorting ]
- Searching & Sorting Introduction [ Hashing, Searching & Sorting ]
- Selection Sorting – #1 [ Hashing, Searching & Sorting ]
- Selection Sorting – #2 [ Hashing, Searching & Sorting ]
- Insertion Sort – #1 [ Hashing, Searching & Sorting ]
- Insertion Sort – #2 [ Hashing, Searching & Sorting ]
- Merge Sort – #1 [ Hashing, Searching & Sorting ]
- Merge Sort – #2 [ Hashing, Searching & Sorting ]
- Merge Sort – #3 [ Hashing, Searching & Sorting ]
- Quick Sort – #1 [ Hashing, Searching & Sorting ]
- Quick Sort – #2 [ Hashing, Searching & Sorting ]
- Radix Sort – #1 [ Hashing, Searching & Sorting ]
- Radix Sort – #2 [ Hashing, Searching & Sorting ]
- Topological Sorting [ Hashing, Searching & Sorting]
- Topological Sorting – Solved Example [ Hashing, Searching & Sorting]
- Divide & Conquer With Example [ Design Techniques (Greedy, DP, DAC) ]
- Binary Search [ Design Techniques (Greedy, DP, DAC) ]
- Multiplying Long Integers Using Divide and Conquer Technique [ Design Techniques (Greedy, DP, DAC) ]
- Max Min Problem with Solved Examples [ Design Techniques (Greedy, DP, DAC) ]
- Dynamic Programming [ Design Techniques (Greedy, DP, DAC) ]
- DP Approaches 1 [ Design Techniques (Greedy, DP, DAC) ]
- DP Approaches 2 [ Dynamic Programming ]
- Multistage Graphs [ Design Techniques (Greedy, DP, DAC) ]
-
[ Paper 2 - IT Specialized Subjects ] Networking Concepts
- Introduction to Computer Networks
- OSI Reference Model
- Network Topologies
- Network Classification LAN, MAN, WAN
- Virtual Lan’s
- Network Connecting Devices
- TCP-IP Reference Model
- User Datagram Protocol
- Domain Name Server – DNS
- Berkeley Sockets
- Simple Mail Transfer Protocol – SMTP
- Hypertext Transfer Protocol – HTTP
- File Transfer Protocol – FTP
- Firewall
-
[ Paper 2 - IT Specialized Subjects ] 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 Preprocessing Part #1
- Data Preprocessing Part #2
- Data Visualization Part #2
- Data Visualization Part #1
-
[ Paper 2 - IT Specialized Subjects ] Information & Cybersecurity Concepts
-
[ Paper 2 - IT Specialized Subjects ] Shell Programming
-
IT : 500+ Practice Questions [ Subjectwise ]
- OOPs – PRACTICE QUESTIONS
- DBMS Practice Questions
- Networking – Practice Questions
- Data Structure & Algorithm – Practice Question
- [ NEW ] Programming Concepts (C , C++ , Java)
- [ NEW ] Shell Programming
- [ NEW ] Networking Concepts
- [ NEW ] SQL
- [ NEW ] Data Warehousing
- [ NEW ] Information and Cyber Security
- [ NEW ] Algorithms for Problem Solving
- [ NEW ] Data Analytics Language (Python / R)
- [ NEW ] Data Concepts
-
[ Previous Year Question ] SEBI Grade A IT - Paper 1
-
[ Previous Year Question ] SEBI Grade A IT - Paper 2
SEBI GRADE A 2025 – IT ( Phase 1 ) – 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
- 📊 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 459
- Quizzes 0
- Duration 50 hours
- Skill level All levels
- Language English
- Students 11
- Certificate No
- Assessments Yes





