National Party Criteria - condition B
Duration: 2 min
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 video segment provides a detailed explanation of the criteria required for a political party to be recognized as a "National Party" in India, specifically focusing on "Condition B". The instructor stands before a digital whiteboard displaying the title "National Party Criteria - Condition B (शर्त B)". The slide outlines that a party must achieve a specific "Seat Strength" by winning at least 2% of the total Lok Sabha seats. The text explicitly clarifies that this percentage translates to "11 seats in the current house". Furthermore, a critical condition is stated: "These members must be elected from at least 3 different states." This requirement is also presented in Hindi at the bottom of the slide. Throughout the lecture, the instructor actively engages with the material, pointing to specific phrases to emphasize the geographical distribution requirement. He also writes supplementary notes on the screen, including "4+" and "2 राज्यों में" (in 2 states), followed by "6% + 4 LS" which he circles. These annotations suggest he is comparing Condition B with other criteria, such as Condition A (involving 6% of valid votes and 4 seats) or State Party criteria, to help students differentiate between the various recognition standards.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces "National Party Criteria - Condition B". He points to the slide text stating a party must "Win at least 2% of total Lok Sabha seats (i.e., 11 seats in the current house)." He emphasizes the condition that these members must be elected from "at least 3 different states." He writes notes on the screen, including "4+" and "2 राज्यों में" (in 2 states), and then "6% + 4 LS", circling the latter to likely contrast it with the current topic or recall a previous condition. He gestures to reinforce the "3 states" requirement.
The lecture effectively breaks down the complex criteria for National Party status into manageable components. By focusing on Condition B, the instructor clarifies that it is not just about the total number of seats won (11 seats or 2%), but also about the geographical spread of those wins (at least 3 states). The side notes written by the instructor, such as "6% + 4 LS", provide context by contrasting this condition with others, likely Condition A, ensuring a comprehensive understanding of the Election Commission's recognition rules. The visual aid of the slide, combined with the instructor's handwritten annotations, creates a clear distinction between the different conditions for party recognition, aiding student retention of the specific numerical thresholds and state requirements.

