CYK Algorithim

Duration: 1 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-2-compiler-design/grammar-cfg/decidability-cyk-algo/asset-cyk-algorithim after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. Computer Networks: 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video introduces the Cocke-Younger-Kasami (CYK) algorithm, a parsing method for context-free grammars named after John Cocke, Daniel Younger, and Tadao Kasami. It employs bottom-up parsing and dynamic programming. The standard version requires grammars in Chomsky Normal Form (CNF), though transformations exist. The instructor emphasizes its efficiency, noting the worst-case running time is O(n^3 . |G|), where n is string length and |G| is grammar size. This makes it highly efficient for worst-case asymptotic complexity, even if other algorithms perform better on average. The slide also references Sipser 1997 regarding grammar transformation.

Chapters

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

    The instructor begins by circling the title "CYK algorithm" and underlining the full name "Cocke-Younger-Kasami" along with the core techniques "bottom-up parsing and dynamic programming." He moves to the second bullet point, underlining "Chomsky normal form (CNF)" to emphasize the specific input requirement. In the third bullet, he underlines "Big O notation" and the complexity formula "O(n^3 . |G|)" to focus on performance metrics. Towards the end, he writes "aa+" and "aab" on the slide as handwritten examples, and draws a red circle around "100%" to likely discuss parsing completeness or specific string matching scenarios.

The lesson effectively bridges theoretical definitions with practical performance metrics. By visually emphasizing the complexity formula and input constraints, the instructor clarifies why CYK is preferred for worst-case analysis. The handwritten examples suggest a transition towards applying the algorithm to specific strings, reinforcing the connection between the abstract complexity bounds and concrete parsing tasks.

Loading lesson…