Appeal and Penalties (Sec19-20)

Duration: 2 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-appeal-and-penalties-sec19-20 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.

This educational video segment focuses on the 'Right to Information Act 2005,' specifically covering Section 19-20 titled 'Appeal and Penalties.' Presented by Pramod Rana, the lecture utilizes a bilingual slide (English and Hindi) to explain the legal mechanisms for citizens dissatisfied with information requests. The instructor systematically breaks down the appeal hierarchy, the burden of proof placed on officials, and the financial penalties for non-compliance, using visual cues like circling key terms to emphasize critical deadlines and amounts.

Chapters

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

    The instructor begins by introducing the slide titled 'Appeal and Penalties (Sec 19-20) / अपील और दंडित्व (भाग 19-20).' He starts with the 'First Appeal' bullet point, reading the text 'To a senior officer within 30 days if not satisfied with the PIO's decision.' He physically circles the acronym 'PIO' and the Hindi phrase '30 दिनों' (30 days) to stress the timeframe and the authority involved. Next, he addresses the 'Second Appeal,' pointing to the text 'To the Central/State Information Commission within 90 days,' explaining the escalation path. He then discusses the 'Burden of Proof,' highlighting the sentence 'The burden to prove that denial was justified lies on the PIO,' indicating that the official must justify withholding information. Finally, he covers the 'Penalty' section, circling the number '250' in the Hindi text to emphasize the fine of 'Rs. 250 per day for delay, up to a maximum of Rs. 25,000,' ensuring students understand the financial consequences of delays.

The lecture provides a comprehensive overview of the redressal mechanisms under the RTI Act. It establishes a clear two-tier appeal system: an internal appeal to a senior officer within 30 days, followed by an external appeal to the Information Commission within 90 days. The instructor emphasizes the legal principle that the burden of proof rests entirely on the Public Information Officer to justify any denial of information, protecting the citizen's right to know. Furthermore, the lesson outlines strict financial penalties, including a daily fine of Rs. 250 for delays, capped at Rs. 25,000, to ensure timely compliance and accountability within government bodies.

Loading lesson…