Substring

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/theory-of-computationautomata-theory/introduction-to-toc/basics-string-ops/asset-substring after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation 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 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
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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
  13. 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
  14. 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
  15. Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
  16. Paper 2 | 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture defines the concept of a substring as a sequence of consecutive symbols within a larger string. The instructor uses the word 'SUBSTRING' to demonstrate valid examples like 'str' and 'sub' versus invalid non-consecutive sequences. He then transitions to calculating the total number of substrings for a specific string, 'GATE', using a tabular method to count substrings by length. This leads to the derivation of a general formula, n(n+1)/2 + 1. Finally, the lecture distinguishes between trivial and non-trivial substrings, providing a formula to calculate the latter by excluding the empty string and the string itself.

Chapters

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

    The instructor begins by defining a substring with on-screen text: 'Substring- Any string of consecutive symbols in some string 'w' can be collectively said as a substring.' He gives an example 'w= abab' where substrings include 'ab', 'a', 'ba'. He then presents the string 'S u b s t r i n g' and a numbered list of potential substrings: 1. utg, 2. sbr, 3. rts, 4. str, 5. sub, 6. $\epsilon$. He marks items 1, 2, and 3 with red crosses, explaining they are not consecutive. He marks 4 ('str'), 5 ('sub'), and 6 ($\epsilon$) with checkmarks, confirming they are valid substrings because the characters appear consecutively in the original string.

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

    The lecture shifts to a problem: 'Consider a string 'GATE' find the total number of substring possible?'. A table is displayed with columns for substring lengths 0 through 4. The instructor fills the table row by row. For length 0, he writes $\epsilon$ (1 substring). For length 1, he lists G, A, T, E (4 substrings). For length 2, he lists GA, AT, TE (3 substrings). For length 3, he lists GAT, ATE (2 substrings). For length 4, he lists GATE (1 substring). He sums these values: 1 + 4 + 3 + 2 + 1 = 11. He writes the formula for this sum on the board: n(n+1)/2 + 1, circling the result 11 to emphasize the total count.

  3. 5:00 – 6:44 05:00-06:44

    The instructor briefly considers a string 'GGGE' to test the counting method, filling a similar table with counts 1, 2, 2, 2, 1 and writing a 9 next to the sum. He then moves to a slide defining trivial and non-trivial substrings. The text reads: 'If w is any string than empty string $\epsilon$ and the string w itself is called a trivial substring and the remaining of the other are the non-trivial sub string'. He writes the formula for non-trivial substrings on the board as [n(n+1)/2 + 1] - 2, explaining that this subtracts the empty string and the string itself from the total count.

The lesson progresses from a basic definition of substrings to a quantitative analysis of how many exist in a string. By breaking down the problem into lengths and using a table, the instructor derives a general formula. The distinction between trivial and non-trivial substrings adds a layer of complexity, refining the count by excluding the empty string and the full string itself.

Loading lesson…