Practice Questions

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/computer-architecture-it-specialist/grammar-cfg/derivation-recursion/asset-practice-questions after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  14. Compiler Design (IT Specialist): 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
  15. Computer Architecture (IT Specialist): Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  16. Data Communication & Networking (IT Specialist): Introduction to CN, Data Communication, 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, Network Security
  17. Descriptive Test (Main Exam): English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a step-by-step tutorial on eliminating left recursion from Context-Free Grammars (CFGs), a crucial step in compiler design and parsing theory. The instructor begins with the grammar `S -> SSS / 0`. He identifies `S -> SSS` as the left-recursive production and `S -> 0` as the non-recursive alternative. By applying the standard algorithm, he introduces a new non-terminal `A'` to handle the recursion. The original start symbol `S` is rewritten as `S -> 0A'`, while the new non-terminal `A'` is defined by the recursive part `SS` followed by `A'`, plus the epsilon production: `A' -> SSA' / epsilon`.

Next, the instructor moves to a slightly more complex example: `S -> S0S1 / 0 / 1`. He underlines the recursive `S` in `S0S1` to identify `alpha` as `0S1`. The non-recursive parts `0` and `1` become `beta`. The transformation yields `S -> 0S' / 1S'` and `S' -> 0S1S' / epsilon`.

Finally, the lecture addresses a grammar with multiple non-terminals: `S -> A a B`, `A -> A a / b B / a`, and `B -> b B / c`. The focus shifts to eliminating left recursion from `A`. The instructor isolates the recursive production `A a` (where `alpha` is `a`) and the non-recursive productions `b B` and `a` (where `beta` is `b B` and `a`). He writes the new rules: `A -> b B A' / a A'` and `A' -> a A' / epsilon`.

Chapters

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

    The video opens with the instructor analyzing the grammar `S -> SSS / 0`. He underlines the first `S` in `SSS` to mark the recursive part, labeling it `A`. He then constructs the transformed rules `S -> 0A'` and `A' -> SSA' / epsilon`. Moving to the next example, `S -> S0S1 / 0 / 1`, he underlines the recursive `S` and writes `S -> 0S' / 1S'` and `S' -> 0S1S' / epsilon`. He then transitions to a multi-rule grammar, underlining `A` in `A -> A a / b B / a` to identify the recursive component `a` and the non-recursive components `b B` and `a`.

  2. 2:00 – 2:20 02:00-02:20

    The instructor finalizes the left-recursion elimination for the non-terminal `A`. He formulates the new production rules `A -> b B A' / a A'` and `A' -> a A' / epsilon` on the whiteboard. The original grammar `S -> A a B`, `A -> A a / b B / a`, and `B -> b B / c` remains visible as he concludes this segment, setting the stage for the next step involving non-terminal `B`.

The lecture systematically applies the left-recursion elimination algorithm to three distinct grammars. It progresses from simple unary recursion to mixed recursion and finally to a multi-non-terminal grammar, illustrating how to isolate recursive and non-recursive productions to construct equivalent right-recursive forms.

Loading lesson…