Brute Force Technique
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper-2 | 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
- Paper-2 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Paper-2 | 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
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Paper-2 | 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
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), 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, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture focuses on the Brute Force technique used in compiler design for parsing context-free grammars. The instructor begins by defining the algorithm, which involves systematically expanding non-terminals by trying every available alternative against the input string. If a mismatch occurs, the parser backtracks to try the next alternative. The session includes detailed walkthroughs of specific grammars. The first example uses S -> cAd and A -> ab / a to parse strings cad and cada. The instructor draws parse trees to visualize the expansion process, showing how A expands to ab (resulting in cabd, a mismatch) versus a (resulting in cad, a match). The second example involves a more complex grammar S -> aAc / aB to parse addc, demonstrating successful matching through the aB production. Finally, the lecture concludes by analyzing the drawbacks of this approach, specifically noting the high time complexity of O(2^n) and the performance issues caused by extensive backtracking.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the 'Brute force technique' for parsing. The slide displays the core logic: 'Whenever a non-terminal is expanding first time, then go with the first alternative and compare with the i/p string.' He explains that if the first alternative does not match, the parser must proceed to the second, then the third, continuing until all alternatives are exhausted. The slide emphasizes that if any alternative matches, parsing is successful; otherwise, it fails. He underlines key phrases like 'first alternative' and 'compare with the i/p string' to highlight the iterative comparison process. The text also mentions '3rd alternative' to illustrate the exhaustive nature of the search.
2:00 – 5:00 02:00-05:00
The instructor demonstrates the technique with two examples. First, for grammar S -> cAd, A -> ab / a, he parses w1 = cad. He draws a parse tree starting with S, expanding to cAd. He then expands A to ab, yielding cabd, which mismatches cad. He backtracks, expands A to a, yielding cad, which matches. He then attempts w2 = cada, showing that neither ab nor a for A produces cada, leading to failure. Second, for S -> aAc / aB, A -> b / c, B -> ccd / ddc, he parses w = addc. He shows that S -> aAc fails for both A alternatives (abc, acc), but S -> aB succeeds when B expands to ddc. He draws multiple trees to show the branching paths of the brute force search. The visual representation clearly shows the 'c', 'A', 'd' structure and the leaf nodes representing the terminal strings.
5:00 – 5:47 05:00-05:47
The lecture concludes with the disadvantages of the brute force method. The slide lists three points: 'Brute force requires lot of back-tracking, takes O(2^n)', 'Back Tracking is very costly & reduces the performance of parser', and 'Debugging is very difficult.' The instructor circles the complexity notation O(2^n) and underlines the phrase 'very costly' to emphasize the inefficiency of this parsing strategy compared to others. He explains that the exponential time complexity makes it impractical for large inputs. The slide text is clearly visible with red underlines and circles added by the instructor to stress the negative aspects of this parsing approach.
The video provides a comprehensive overview of brute force parsing, moving from the theoretical algorithm to concrete examples involving parse trees and backtracking, and finally critiquing the method's computational inefficiency.

