Benefits of Recognition

Duration: 1 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/general-awareness/polity/democracy-election-accoun/asset-benefits-of-recognition after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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)
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  6. 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
  7. 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
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  12. 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
  13. Full Length Mock Tests:
  14. Sectional Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture, presented by Pramod Rana, focuses on the "Benefits of Recognition" (मान्यता के लाभ) for political parties in India. The slide outlines key privileges granted to recognized parties, including exclusive usage of reserved symbols, free airtime on Akashvani and Doordarshan, and free electoral rolls. The instructor elaborates on the concept of "Star Campaigners," explaining the limit of 40 for recognized parties versus 20 for unrecognized ones, noting that travel expenses are not added to the candidate's limit. He also discusses the nomination process, specifically the requirement for "Amarchit Chunav-Chinh" (nomination of candidates) at the national or state level, and the specific number of candidates (20) that can be nominated by unrecognized parties.

Chapters

  1. 0:00 – 1:25 00:00-01:25

    The instructor begins by introducing the topic "Benefits of Recognition" displayed on the slide. He points to the bullet point "Star Campaigners: 40 for recognized parties; 20 for unrecognized," explaining the distinction in campaigner limits. He then moves to the Hindi text "Amarchit Chunav-Chinh," circling the word "Chunav-Chinh" (election symbol/candidate) and explaining the rules regarding the nomination of candidates. He highlights the number "20" in the context of unrecognized parties, emphasizing that this limit applies to the number of candidates they can field. He gestures towards the text "Travel expense not added to candidate's limit" to clarify financial regulations.

The lecture systematically breaks down the advantages political parties gain upon official recognition. The core concepts covered include the exclusive right to a reserved symbol, which prevents confusion among voters. The instructor clarifies the "Star Campaigner" rule, a crucial mechanism for managing election expenditure limits, where recognized parties get 40 campaigners and unrecognized ones get 20. He further details the nomination process, specifically the "Amarchit Chunav-Chinh" provision, which allows parties to nominate candidates. The distinction between national and state-level recognition is implied through the context of these benefits. The visual aids, including the slide text and the instructor's annotations (circles and underlines), reinforce the specific numerical limits and procedural rules essential for understanding Indian electoral laws.

Loading lesson…