Endsem Exam Questions: Unit 4

Pattern Matching Architecture

Q1. Explain the architectural necessity of Regular Expressions for data validation.

Validating complex string formats—such as email addresses or passwords—using standard conditional loops requires bloated, fragile substring extraction logic. Regular Expressions (RegExp) define complex validation rules in a single, condensed pattern. The JavaScript engine delegates RegExp execution to highly optimized, underlying C/C++ libraries, providing massive performance superiority over manual JavaScript loops.

Q2. Differentiate between Literal and Constructor notation in RegExp instantiation.

Literal notation encloses the pattern in forward slashes (e.g., /pattern/i). The JavaScript engine compiles literals at load time. This provides optimal performance for static patterns that do not change during execution.

Constructor notation instantiates a RegExp object via the new keyword (e.g., new RegExp("pattern", "i")). The engine compiles the pattern dynamically at runtime. This notation is mandatory when the pattern relies on variable user input that is unknown at compilation time.

Syntax and Execution

Q3. Define RegExp quantifiers and provide three distinct examples.

Quantifiers dictate the exact required frequency of the preceding character or capture group.

• * (Asterisk): Requires zero or more occurrences. Matches if the character is missing or repeated infinitely.
• + (Plus): Requires one or more occurrences. Matches only if the character exists at least once.
• {n,m} (Range): Requires between n and m occurrences explicitly. {2,5} matches if the character repeats 2, 3, 4, or 5 times.

Q4. Detail the execution of the split() and replace() String methods when interacting with RegExp.

The split() method divides a string into an array. Using RegExp instead of a static string delimiter allows dynamic splitting, such as dividing a sentence regardless of varying whitespace (/\s+/).

The replace() method substitutes matched substrings. Integrating RegExp enables subexpression replacement. The developer captures groups using parentheses () and injects them into the replacement string using structural tags ($1, $2), allowing complex formatting transformations.

Q5. Explain the structural limitations of Regular Expressions.

Regular Expressions process regular languages. They cannot parse recursive, hierarchical, or infinitely nested structures like HTML or XML. Attempting to parse HTML with RegExp causes catastrophic execution failures.

Furthermore, overly complex or poorly optimized RegExp patterns trigger “catastrophic backtracking.” When processing unexpected input, the engine consumes exponential CPU cycles evaluating infinite failing permutations, resulting in application freezing and denial-of-service conditions.