Practice Questions_RE

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/theory-of-computation/regular-expressions/regex-design-algebra/asset-practice-questions-re after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. 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)
  13. 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, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a lecture segment focused on formal languages and automata theory, specifically dealing with regular expressions and string generation. The session begins with a multiple-choice question displayed prominently on the screen: 'Which of the following is correct'. Four options are listed in orange text: a) (xx)*y = x(xy)*, b) (xy)*x = x(yx)*, c) x(xy)* = (xx)*y, and d) (xy)* = (yx)*, testing student knowledge of regular expression identities. The instructor systematically evaluates each option to determine the valid identity among the choices. For option (a), he writes 'xx' underneath the expression and draws a cross mark, indicating that the equality does not hold. He then examines option (b), placing a blue checkmark next to it to signify that it is the correct identity. He verbally explains that (xy)*x represents strings starting and ending with 'x' separated by 'y's, which is structurally identical to x(yx)*. He quickly dismisses options (c) and (d) by marking them with crosses.

Following the multiple-choice question, the slide changes to a new problem statement: 'find the no of strings of length <= 3 generated by the (a + ab)+'. The instructor writes the regular expression (a + ab)+ on the whiteboard area in blue ink. He begins to enumerate the strings generated by this expression. He lists 'a' as the first string of length 1. He then lists 'aa' and 'aaa' as subsequent strings. He continues by writing 'aab' and 'aba' to cover length 3. As he lists these strings, he seems to be counting the total occurrences. In the final frames, he circles the number '5' next to the list of strings, indicating his calculated answer for the number of strings with length less than or equal to 3. This segment illustrates the process of expanding a regular expression to find specific string counts. The instructor's method involves writing out the possibilities to ensure none are missed, a common strategy in combinatorics problems involving regular languages. The visual progression from the theoretical identity question to the practical counting problem shows a comprehensive approach to teaching regular expression properties. Throughout the video, a watermark for 'KNOWLEDGEGATE' is also visible, identifying the educational source. The instructor, wearing a black t-shirt with the same logo, provides a very clear and methodical explanation of the concepts.

Chapters

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

    The video starts with a multiple-choice question on regular expression identities. The instructor analyzes options (a) through (d), marking (b) as correct with a checkmark and others with crosses. He explains the equivalence of (xy)*x and x(yx)*. Then, the slide changes to a counting problem: 'find the no of strings of length <= 3 generated by the (a + ab)+'. He writes the expression and lists strings: a, aa, aaa, aab, aba. He circles the number 5, indicating the count.

The video covers two main topics: verifying regular expression identities and counting strings generated by a regular expression. The instructor uses visual aids like checkmarks and crosses to guide the student through the logic. The transition from theoretical identities to practical string enumeration demonstrates a comprehensive teaching method for formal languages.

Loading lesson…