State party Criteria - Condition C & D
Duration: Under a minute
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, Divisibility Rules, HCF LCM, Verbal Analogy (Word Based Analogy)
- General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics
- Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
- Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics
- Full Length Mock Tests:
- Sectional Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational segment focuses on the specific criteria required for a political party to be officially recognized as a State Party within the Indian electoral framework. The instructor utilizes a presentation slide titled State Party Criteria Condition C & D to break down the quantitative thresholds necessary for this designation. The visual aid presents both English and Hindi text, ensuring accessibility for a diverse student audience. The lecture emphasizes the mathematical nature of these political qualifications.
Chapters
0:00 – 0:15 00:00-00:15
During the clip, the instructor physically interacts with the slide to highlight key data points. He first directs attention to Condition C, which mandates winning 3% of total Assembly seats or 3 seats, whichever is higher. He circles the percentage figure in the Hindi text. Subsequently, he addresses Condition D, explaining the requirement to win one Lok Sabha seat for every 25 Assembly seats in the state. He circles the number 25 and the specific term Lok Sabha seat to reinforce the ratio.
The instruction effectively bridges the gap between abstract political rules and concrete numerical examples. By circling specific numbers like 3% and 25, the teacher draws attention to the critical variables in the criteria. This visual reinforcement aids in memorizing the complex rules regarding state party status, ensuring students grasp the distinction between assembly-level and parliamentary-level seat requirements.