Schedules of the Indian Constitution

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-INFORMATICS-ASSISTANT/general-knowledge-current-affairs-india-rajasthan/polity/union-constitutional-stru/asset-schedules-of-the-indian-constitution after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Numerical Ability & Problem Solving: Speed Mathematics and Basic Mathematics, Arithmetic, Number System, HCF LCM, Divisibility Rules, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Time and Work, Pipe and Cistern, Speed Time and Distance, Age Problems, Partnership, Data Interpretation, Mental Ability, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Logarithm, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  2. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, Selection Decision Table (Decision Making), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Traverse Surveying, Ratio and Proportion, Mensuration, Permutations and Combinations, Clocks and Calendars, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations
  3. General Knowledge & Current Affairs (India + Rajasthan): History, Geography, Polity, Indian Economy, Static General Knowledge, State Wise GK, GK- Current Affairs, Environment, Physics
  4. Computer Fundamentals & Operating Systems: Basics of COA, Floating Point Rep, Digital Systems & Boolean Basics, Number Representation, Number System, Introduction to OS, File Management, Windows OS, Unix OS, Linux OS, Register Transfer and Microoperations, Virtual Memory
  5. Computer Networks: Introduction to CN, Data Communication, DLL: Error Control, DLL: Access Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Application Layer, Hardware Basics, Network Security
  6. Cyber Security: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  7. Programming (C & OOP): C Fundamentals, Control Flow, Arrays & Pointers, Functions, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Operators & Expressions, Sorting Algorithms, Java Fundamentals, Java
  8. MS Office & Data Processing: MS Office Applications, Basics of DBMS
  9. Internet & Web Technology: Society, Law & Ethics, Terms & Abbreviations, Keyboard Shortcuts, Emerging Tech Trends, Artificial Intelligence, Emerging Technologies, Internet Fundamentals, Website, Browser & Services, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a lecture on formal language theory, focusing on context-free grammars (CFGs) and their properties. The instructor begins by defining a grammar as a set of production rules, using a specific grammar G with rules S → aSb and S → ε to generate the language L(G) = {a^n b^n | n ≥ 0}, a classic non-regular language. The discussion progresses to closure properties, demonstrating that context-free languages are not closed under intersection through a counterexample involving two CFGs, G1 and G2, whose intersection yields {a^n b^n c^n | n ≥ 0}, a language proven not to be context-free. The instructor introduces pushdown automata (PDAs) and their equivalence to CFGs, illustrating a PDA for {a^n b^n} with states and stack-based transitions. The final segment covers the pumping lemma for context-free languages, stating that any sufficiently long string in a context-free language can be divided into five parts satisfying specific conditions. This lemma is applied to prove that {a^n b^n c^n | n ≥ 0} is not context-free by showing that pumping any such string violates the required structure. The lecture combines definitions, examples, diagrams, and proofs to build a coherent understanding of CFGs and their limitations.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces a context-free grammar G with production rules S → aSb and S → ε, explaining that it generates the language L(G) = {a^n b^n | n ≥ 0}. He defines a grammar as a set of production rules and discusses the non-regular nature of this language. The instructor begins to explain the derivation process, showing how the string 'aabb' is generated from the start symbol S, and introduces the concept of a pushdown automaton (PDA) as a recognition mechanism for such languages.

  2. 2:00 – 5:00 02:00-05:00

    The instructor discusses closure properties of context-free languages, emphasizing that their intersection is not necessarily context-free. He presents a counterexample using two grammars, G1 and G2, with languages L(G1) = {a^n b^n | n ≥ 0} and L(G2) = {a^n c^n | n ≥ 0}. Their intersection, L(G1) ∩ L(G2) = {a^n b^n c^n | n ≥ 0}, is shown to be non-context-free. The instructor then draws a diagram of a PDA for {a^n b^n}, illustrating states and transitions, and explains how the PDA uses a stack to track the number of a's and b's during processing.

  3. 5:00 – 9:56 05:00-09:56

    The instructor introduces the pumping lemma for context-free languages, stating that for any context-free language L, there exists a pumping length p such that any string s in L with length ≥ p can be split into s = uvwxy satisfying specific conditions. He explains that this lemma is used to prove a language is not context-free. Applying it to {a^n b^n c^n | n ≥ 0}, he shows that for s = a^p b^p c^p, no valid division satisfies the pumping conditions, as pumping leads to strings outside the language. This demonstrates the language's non-context-free nature. The instructor concludes by summarizing the key concepts covered.

The lecture systematically builds understanding of context-free grammars, starting from basic definitions and examples, progressing to closure properties and counterexamples, and culminating in the pumping lemma. It effectively uses a combination of formal definitions, visual diagrams, and logical proofs to illustrate the limitations and capabilities of context-free languages. The progression from simple derivations to complex proofs demonstrates a structured pedagogical approach, reinforcing core concepts through multiple angles and reinforcing the distinction between regular and context-free languages.

Loading lesson…