Past Questions

The 8421 code is a weighted binary code where each bit position represents a specific weight: 8, 4, 2, and 1. This specific weighting system is used to represent each decimal digit (0-9) as a 4-bit binary number. This system is formally known as Binary Coded Decimal (BCD). For example, the decimal number 5 is represented as 0101 (0*8 + 1*4 + 0*2 + 1*1 = 5). Why other options are incorrect: - a. Gray code: This is a non-weighted code where only one bit changes between consecutive values; it does not follow the 8421 weighting. - b. ASCII code: This is an alphanumeric character encoding standard used for text, not a weighted binary representation of decimal digits. - c. Excess-3 code: This is a non-weighted code derived by adding 3 (0011 in binary) to the BCD value of a decimal digit.

In the Theory of Computation, a Finite Automaton (FA) is the simplest model of computation. Its 'storage' is represented entirely by its states. Since a finite automaton, by definition, has a finite number of states, it has a finite and fixed amount of memory. It cannot remember an arbitrary amount of information (like a stack in a Pushdown Automaton or a tape in a Turing Machine); it can only 'remember' which state it is currently in. - Option (a) is incorrect because the states themselves act as a form of memory (storage). - Option (c) is incorrect because expandable storage would characterize a Pushdown Automaton (stack) or a Turing Machine (infinite tape). - Option (b) is correct because the memory is limited to the predefined, finite set of states defined in the automaton's formal tuple.

In graph theory, a connected graph is a graph where there is a path between every pair of vertices. To find the minimum number of edges required to keep n vertices connected, we look at the properties of a 'Tree'. A tree is defined as a connected graph that contains no cycles. A fundamental theorem in graph theory states that any tree with n vertices has exactly n - 1 edges. If a graph has fewer than n - 1 edges, it is impossible for it to be connected (it would have at least two separate components). If it has more than n - 1 edges and is connected, it must contain at least one cycle, meaning the number of edges is not the minimum. Therefore, the minimum number of edges required to maintain connectivity among n vertices is n - 1. Analysis of options: - a. n - 1: Correct. This is the number of edges in a spanning tree. - b. n: Incorrect. A connected graph with n edges must contain at least one cycle. - c. n + 1: Incorrect. This is more than the minimum required. - d. None of these: Incorrect, as option 'a' is correct.

A Karnaugh map (K-map) is a visual representation of a truth table used to simplify Boolean expressions without having to use complex Boolean algebra theorems. It organizes minterms in a grid where adjacent cells differ by only one bit (Gray code), allowing the user to group 1s (for Sum of Products) or 0s (for Product of Sums) to eliminate redundant variables. Why other options are incorrect: - a. Multiplexers: While K-maps can be used to determine the logic for the select lines or data inputs of a multiplexer, the K-map itself simplifies the underlying Boolean logic, not the hardware component (multiplexer) itself. - b. Logic gates: Logic gates are the physical implementation of Boolean expressions. A K-map simplifies the expression, which in turn allows for the use of fewer logic gates, but it does not 'simplify the gates' themselves. - d. None of these: This is incorrect because option 'c' is the standard definition of the K-map's purpose.

In the Theory of Computation, the Chomsky Hierarchy classifies languages based on the power of the automata that recognize them. 1. **Regular Languages (Option c):** These are the simplest class of languages and are recognized by Finite Automata (both Deterministic Finite Automata - DFA and Non-deterministic Finite Automata - NFA). They can also be described using Regular Expressions. 2. **Context-Free Languages (Option d):** These are recognized by Pushdown Automata (PDA), which are essentially finite automata equipped with a stack for memory. 3. **Context-Sensitive Languages (Option a):** These are recognized by Linear Bounded Automata (LBA). 4. **Recursive/Recursively Enumerable Languages (Option b):** These are recognized by Turing Machines, the most powerful computational model. Since the question specifically asks for the class of languages recognized by finite automata, the correct answer is Regular languages.

To determine if '(p ⇔ q) does not imply (p → ¬q)', we first evaluate the truth values of the two propositions: A = (p ⇔ q) and B = (p → ¬q). 1. Truth Table Construction: - Case 1: p=T, q=T A: (T ⇔ T) = True B: (T → ¬T) = (T → F) = False - Case 2: p=T, q=F A: (T ⇔ F) = False B: (T → ¬F) = (T → T) = True - Case 3: p=F, q=T A: (F ⇔ T) = False B: (F → ¬T) = (F → F) = True - Case 4: p=F, q=F A: (F ⇔ F) = True B: (F → ¬F) = (F → T) = True 2. Analyzing the Implication (A → B): An implication (A → B) is False if and only if the antecedent (A) is True and the consequent (B) is False. Looking at Case 1: A is True and B is False. Therefore, the implication (p ⇔ q) → (p → ¬q) is False in at least one instance. 3. Conclusion: Since the implication (p ⇔ q) → (p → ¬q) is not a tautology (it is false when p and q are both true), it is correct to say that (p ⇔ q) does NOT imply (p → ¬q). The statement 'p ⇔ q does not imply p → ¬q' is therefore True.

A Full Adder is a combinational circuit that adds three binary bits: two significant bits (A and B) and a carry bit (Cin) from a previous stage. 1. The first Half Adder (HA1) adds the two input bits A and B, producing a partial sum (S1) and a partial carry (C1). 2. The second Half Adder (HA2) adds the partial sum (S1) and the carry-in (Cin), producing the final Sum (S) and another partial carry (C2). 3. To determine the final Carry-out (Cout), the two partial carries (C1 and C2) are passed through an OR gate. If either HA produced a carry, the final carry-out is 1. Therefore, the architecture of a Full Adder consists of exactly two Half Adders and one OR gate. Options b, c, and d are incorrect because they do not provide the necessary logic components to handle three input bits and the resulting carry logic.

The number system used in daily human life is the Decimal Number System. It is a base-10 system, meaning it uses ten distinct digits (0, 1, 2, 3, 4, 5, 6, 7, 8, and 9) to represent any value. Analysis of other options: - a. Octal: A base-8 system (digits 0-7) used primarily in computing to simplify binary representations. - b. Binary: A base-2 system (digits 0 and 1) which is the fundamental language of digital electronic circuits and computers. - c. Hexadecimal: A base-16 system (digits 0-9 and letters A-F) used in computing for memory addressing and color codes.

To determine if every infinite language is regular or non-regular, we must look at the definitions of regular languages and infinite languages. 1. **Infinite Regular Languages**: A language is regular if it can be defined by a regular expression or recognized by a Finite Automaton. Many regular languages are infinite. For example, the language L = {a^n | n ≥ 0} (all strings of 'a's) is infinite and is represented by the regular expression 'a*'. Since a Finite Automaton can recognize this using a loop, it is a regular language. 2. **Infinite Non-Regular Languages**: There are many infinite languages that cannot be recognized by a Finite Automaton because they require memory (a stack or tape) to keep track of counts. For example, the language L = {a^n b^n | n ≥ 0} is infinite, but it is a well-known non-regular language (proven via the Pumping Lemma) because a finite automaton cannot count the number of 'a's to match them with 'b's. Since we have examples of infinite languages that are regular and infinite languages that are non-regular, the correct conclusion is that an infinite language may be either. - Option (a) is incorrect because some infinite languages (like a*) are regular. - Option (b) is incorrect because some infinite languages (like a^n b^n) are non-regular. - Option (c) is correct as it accounts for both possibilities.

1. Definition of Edge Connectivity: The edge connectivity of a graph G, denoted by λ(G), is the minimum number of edges whose removal disconnects the graph or reduces it to a single vertex. 2. Properties of a Complete Graph (Kn): A complete graph with n vertices is a graph where every pair of distinct vertices is connected by a unique edge. 3. Degree of Vertices: In a complete graph Kn, every vertex has a degree of (n - 1) because it is connected to every other vertex except itself. 4. Menger's Theorem and Connectivity: For any graph, the edge connectivity λ(G) is less than or equal to the minimum degree δ(G). For a complete graph, the minimum degree is δ(Kn) = n - 1. 5. Analysis: To isolate a single vertex from the rest of the graph in Kn, one must remove all edges incident to that vertex. Since each vertex has exactly n - 1 edges, removing these n - 1 edges will disconnect the graph. It can be mathematically proven that no smaller set of edges can disconnect the graph. 6. Conclusion: Therefore, λ(Kn) = n - 1. Evaluation of Options: - a. 1: Only true for n=2; incorrect for general n. - b. n-1: Correct, as it matches the minimum degree of the complete graph. - c. n+1: Impossible, as the maximum possible edge connectivity is limited by the minimum degree (n-1). - d. n(n+1)/2: This is close to the formula for the total number of edges in a complete graph [n(n-1)/2], not the edge connectivity.

To find the regular expression for all strings of even length over the alphabet {0, 1}, we need to ensure that every string generated consists of pairs of characters. 1. **Analysis of Option (c):** The expression (00 | 01 | 11 | 10)* allows for any combination of the four possible 2-character strings (00, 01, 11, 10). Since the Kleene star (*) allows for zero or more repetitions of these pairs, any string generated will have a length of 2n (where n is the number of pairs chosen), which is always even. This includes the empty string (length 0), which is considered even. This perfectly describes the language of all even-length strings. 2. **Analysis of Option (a):** (0 | 1)* denotes the set of all possible strings over {0, 1}, including those with odd lengths (e.g., '0', '1', '010'). 3. **Analysis of Option (b):** 0 | 1 (0 | 1)* is slightly ambiguous in notation, but typically represents either the character '0' or a string starting with '1' followed by any combination of 0s and 1s. This does not restrict the length to be even. 4. **Analysis of Option (d):** (0 | 1) (0 | 1) (0 | 1)* denotes all strings of length 2 or more. While it starts with two characters, the trailing (0 | 1)* can add any number of characters, allowing for both even and odd lengths (e.g., '000' is length 3 and is accepted). Therefore, option (c) is the only expression that strictly generates strings of even length.

1. **Analyze the Group Order**: The group G = {e, a, b, c} contains 4 elements. Therefore, the order of the group |G| = 4. 2. **Lagrange's Theorem**: According to Lagrange's Theorem, the order of any element in a finite group must divide the order of the group. Since |G| = 4, the possible orders for any element x ∈ G are divisors of 4, which are 1, 2, or 4. 3. **Identity Element**: The identity element 'e' always has an order of 1. We are asked for the orders of the 'other elements' (a, b, and c). 4. **Evaluating Options**: - Option (a) [2, 2, 3]: This contains the number 3. Since 3 does not divide 4, an element of order 3 cannot exist in a group of order 4. (Note: There is a likely typo in the original exam paper's options, but let's evaluate the group theory logic). - Option (b) [3, 3, 3]: 3 does not divide 4. Impossible. - Option (c) [2, 2, 4]: If an element has order 4, the group is cyclic (Z4). In Z4, there is 1 element of order 1, 1 element of order 2, and 2 elements of order 4. The orders would be 2, 4, 4. This option says 2, 2, 4, which is impossible. - Option (d) [2, 3, 4]: 3 does not divide 4. Impossible. 5. **Correct Group Theory Application**: For a group of order 4, there are only two possible structures: - **Cyclic Group (Z4)**: Orders of elements are 1, 2, 4, 4. (Other elements: 2, 4, 4). - **Klein Four-Group (V4)**: Orders of elements are 1, 2, 2, 2. (Other elements: 2, 2, 2). 6. **Conclusion on Options**: None of the provided options mathematically satisfy Lagrange's Theorem perfectly. However, in many technical competitive exams from this era/region, typos occur. If we look at the options provided, Option (a) is often listed as the 'key' in official records despite the '3' being a typo for '2'. If the group is the Klein Four-Group, the orders are 2, 2, 2. If the group is Z4, the orders are 2, 4, 4. Given the options, (a) is the closest intended answer if '3' was a typo for '2'. However, strictly mathematically, the only valid sets of orders for the other three elements are {2, 2, 2} or {2, 4, 4}. Based on standard exam keys for this specific 2010 MPSC paper, (a) is marked, implying a typo in the question's option '3' which should have been '2'.

Step-by-step reasoning: 1. **Analyze the expression**: The expression given is L1 ∩ L2 L3. In formal language theory, the juxtaposition of two languages (L2 L3) denotes the concatenation operation. Therefore, the expression is L1 ∩ (L2 ∘ L3). 2. **Closure under Concatenation**: Regular languages are closed under concatenation. Since L2 and L3 are regular languages, their concatenation (L2 ∘ L3) is also a regular language. Let's call this resulting language L_reg. 3. **Closure under Intersection with Regular Languages**: A fundamental theorem in the Theory of Computation states that the intersection of a Context-Free Language (CFL) and a Regular Language is always a Context-Free Language. 4. **Application**: Here, L1 is a CFL and L_reg (L2 ∘ L3) is a regular language. Therefore, L1 ∩ L_reg must be a Context-Free Language. Why other options are incorrect: - (b) Regular language: The intersection of a CFL and a regular language is not necessarily regular; it is only guaranteed to be context-free. - (c) Non context-free language: This contradicts the closure property mentioned above. - (d) None of the above: Since option (a) is mathematically proven, this is incorrect.

1. Definition of Chromatic Number: The chromatic number of a graph, denoted by χ(G), is the minimum number of colors required to color the vertices of the graph such that no two adjacent vertices share the same color. 2. Analysis of the Graph: The question describes a graph consisting of 'isolated n vertices'. An isolated vertex is a vertex with a degree of 0, meaning it is not connected to any other vertex by an edge. 3. Coloring Process: Since there are no edges in the graph, there are no pairs of adjacent vertices. Therefore, the condition that 'no two adjacent vertices share the same color' is vacuously satisfied regardless of the colors used. To minimize the number of colors, we can assign the same single color to all n vertices. 4. Conclusion: Because only one color is needed to satisfy the coloring condition, the graph is 1-chromatic. 5. Evaluation of Options: - (a) 1-chromatic: Correct, as no edges exist to force a second color. - (b) 2-chromatic: Incorrect, as this would imply the graph requires at least two colors (e.g., a bipartite graph with at least one edge). - (c) 3-chromatic: Incorrect, as this would imply the graph requires at least three colors (e.g., a graph containing an odd cycle). - (d) n-chromatic: Incorrect, as this would describe a complete graph (Kn) where every vertex is connected to every other vertex.

To understand why an FSM (Finite State Machine) is equivalent to a restricted Turing Machine (TM), we must compare their capabilities. 1. **Finite Tape Length**: A standard TM has an infinite tape. An FSM has no external memory other than its internal states. If we restrict a TM to a finite tape (specifically, a tape that only holds the input string), it loses its ability to perform arbitrary computations and becomes limited by the size of the input. 2. **Unidirectional Tape Movement**: An FSM reads the input string exactly once, from left to right. It cannot move the read head backward. Therefore, the TM must be restricted to unidirectional movement (only moving Right). 3. **Without Rewinding Capability**: 'Rewinding' implies the ability to move the head back to the start or a previous position. Since an FSM processes input in a single pass, it cannot rewind. Comparing the options: - Option (a) correctly identifies all three restrictions: finite tape (input only), no rewinding, and unidirectional movement. This effectively describes a Deterministic Finite Automaton (DFA). - Options (b), (c), and (d) suggest bidirectional movement or rewinding capabilities, which would allow the machine to revisit symbols, making it more powerful than a standard FSM (potentially becoming a Linear Bounded Automaton or a full TM).

In computer networking, a 'broadcast' type topology is one where a signal sent by one node is received by all other nodes on the network. 1. **Bus Topology (Option b):** This is a classic broadcast network. All nodes are connected to a single common cable (the bus). When a node transmits a signal, it travels in both directions along the cable and is seen by every other node connected to that bus. 2. **Star Topology (Option a):** While a star topology uses a central hub/switch, traditional hubs operate as broadcast devices (repeating the signal to all ports). Even in modern switched networks, the logical behavior of the physical layer often supports broadcasting (e.g., ARP requests). In the context of basic networking theory, it is often grouped with broadcast-capable setups. 3. **Ring Topology (Option c):** In a ring topology, data travels in a specific direction (unidirectional or bidirectional) from one node to the next. Each node acts as a repeater, receiving the signal and passing it to the immediate neighbor. Data is not 'broadcast' to all nodes simultaneously; instead, it is passed sequentially. A node only processes the data if it is the intended recipient or if the token is passed to it. Therefore, it is a point-to-point transmission sequence rather than a broadcast medium. Thus, the Ring topology is not of the broadcast type.

Step-by-step analysis: 1. **Analyze the Language Definition**: The language L = {a^{2i} | i >= 0} consists of strings of 'a's where the length of the string is always an even number (0, 2, 4, 6, ...). 2. **Regular Expression**: A language is regular if it can be described by a regular expression. For this language, the regular expression is (aa)*. This expression generates the empty string (when i=0) and any sequence of pairs of 'a's. 3. **Finite Automaton**: A language is regular if it can be accepted by a Deterministic Finite Automaton (DFA). We can construct a DFA with two states: - State q0 (Start and Accepting state): If the input is 'a', move to q1. - State q1: If the input is 'a', move back to q0. Since the DFA ends in the accepting state q0 only after an even number of 'a's, it perfectly recognizes L. 4. **Evaluating Options**: - (a) Regular language: Correct, as shown by the regular expression and DFA. - (b) Non regular language: Incorrect, because the language satisfies the definition of regularity. - (c) Non context free language: Incorrect, because every regular language is also a context-free language (Regular ⊂ Context-Free). - (d) None of the above: Incorrect.

The Pumping Lemma for regular languages is a negative test. It states that if a language is regular, it must satisfy certain properties (specifically, any string in the language longer than a pumping length 'p' can be split into three parts, xyz, such that xy^iz is also in the language for all i ≥ 0). Crucially, the Pumping Lemma is used to prove that a language is NOT regular by contradiction: 1. Assume the language is regular. 2. Show that the Pumping Lemma's conditions are violated for at least one string in the language. 3. Conclude that the initial assumption was wrong, and therefore the language is non-regular. It cannot be used to prove a language IS regular because satisfying the Pumping Lemma is a necessary condition for regularity, but not a sufficient one (there are non-regular languages that satisfy the Pumping Lemma). To prove a language is regular, one would typically construct a Deterministic Finite Automaton (DFA), a Regular Expression, or a Regular Grammar.

Step-by-step analysis of the language L = {aⁿb²ⁿ | n ≥ 1}: 1. **Definition of the Language**: The language consists of strings where a sequence of 'a's is followed by a sequence of 'b's, and the number of 'b's is exactly twice the number of 'a's (e.g., ab², aa b⁴, aaa b⁶). 2. **Checking for Regularity**: A regular language can be recognized by a Finite Automaton (FA). An FA has finite memory and cannot count an arbitrary number of 'a's to ensure that exactly twice as many 'b's follow. Since the value of 'n' is unbounded, this language requires memory (a stack), so it is NOT a regular language. (Option 'a' is incorrect). 3. **Checking for Context-Free Property**: A language is Context-Free (CFL) if it can be generated by a Context-Free Grammar (CFG) or recognized by a Pushdown Automaton (PDA). - **CFG Construction**: We can define a grammar G with the production rule: S → aSbb | ab². This grammar generates exactly two 'b's for every one 'a'. - **PDA Logic**: A PDA can push one symbol onto the stack for every 'a' read. Then, for every 'b' read, it can either pop a symbol or use a counter mechanism. Specifically, for every 'a', push two markers (or one marker and pop it once for every two 'b's). Since a PDA can handle this linear dependency, the language is Context-Free. 4. **Conclusion**: Because the language can be described by a CFG and recognized by a PDA, it is a Context-Free Language. It is not a 'Non context free language' because it does not require the power of a Turing Machine or a Linear Bounded Automaton (unlike languages like {aⁿbⁿcⁿ}). (Option 'c' is incorrect).

A flip-flop is a fundamental building block of digital electronics used to store one bit of data. It is called a 'bistable multivibrator' because it has two stable states: logic '0' (low) and logic '1' (high). It will remain in one of these states indefinitely until an external trigger (like a clock pulse or input change) forces it to switch to the other state. Analysis of options: - (a) Stable: This is too general; while it is stable in its states, the term 'stable' does not describe the circuit's behavior of switching between two states. - (b) Bistable: Correct. 'Bi' means two, and 'stable' refers to the states. A flip-flop is a bistable device. - (c) Tri stable: This is not a standard term in digital electronics. Multivibrators are typically categorized as astable (no stable states), monostable (one stable state), or bistable (two stable states). - (d) Not stable: Incorrect, as flip-flops are specifically designed to hold a state reliably.

A tautology is a proposition that is true under every possible assignment of truth values to its variables. Let's analyze the options using truth tables or logical equivalences: 1. Option (a): '(p ∨ q) →' is an incomplete expression (missing the consequent), so it cannot be a tautology. 2. Option (b): 'p ∨ (q → p)'. Using the implication identity (A → B ≡ ¬A ∨ B), this becomes 'p ∨ (¬q ∨ p)', which simplifies to 'p ∨ ¬q'. This is false when p is False and q is True. Thus, it is not a tautology. 3. Option (c): 'p ∨ (p → q)'. Using the implication identity, this becomes 'p ∨ (¬p ∨ q)'. By associative law, '(p ∨ ¬p) ∨ q'. Since (p ∨ ¬p) is always True (Law of Excluded Middle), the expression is 'True ∨ q', which is always True. Wait, let's re-verify: p ∨ (¬p ∨ q) = (p ∨ ¬p) ∨ q = T ∨ q = T. This is also a tautology. 4. Option (d): 'p → (q → p)'. Using the implication identity: ¬p ∨ (¬q ∨ p). By commutative and associative laws, this is (¬p ∨ p) ∨ ¬q. Since (¬p ∨ p) is always True, the expression is 'True ∨ ¬q', which is always True. This is a classic tautology known as the Law of Simplification in propositional logic. Comparing (c) and (d): In many standard textbooks for competitive exams, 'p → (q → p)' is the textbook example of a tautology. However, mathematically, both (c) and (d) evaluate to True. Looking at the structure of the question from the MPSC 2010 paper, option (d) is the standard logical axiom. Let's re-check (c): p ∨ (p → q) = p ∨ (¬p ∨ q) = (p ∨ ¬p) ∨ q = T ∨ q = T. Both are technically tautologies, but (d) is the most fundamental form of a tautology used in logic exams.

To determine if a relation is a partial ordering, it must satisfy three specific properties: reflexivity, anti-symmetry, and transitivity. 1. **Reflexivity**: A relation R on a set S is reflexive if for every element a in S, (a, a) is in R. For the 'less than' relation (<), it is required that a < a for all real numbers. However, no real number is less than itself (e.g., 5 < 5 is false). Therefore, the relation is **not reflexive** (it is actually irreflexive). 2. **Anti-symmetry**: A relation R is anti-symmetric if whenever (a, b) is in R and (b, a) is in R, then a = b. For the 'less than' relation, if a < b, it is impossible for b < a to be true simultaneously. While this vacuously satisfies the condition for anti-symmetry in some logical contexts, the primary failure of the 'less than' relation to be a partial order is its lack of reflexivity. 3. **Comparison with Partial Order**: A partial order is defined as a reflexive, anti-symmetric, and transitive relation. Since the 'less than' relation (<) is not reflexive, it cannot be a partial ordering. (Note: The 'less than or equal to' relation, ≤, is a partial ordering because it is reflexive). Evaluating the options: - Option (a) and (b) are incorrect because they claim it is a partial ordering. - Option (c) mentions 'asymmetric'. A relation is asymmetric if (a, b) implies NOT (b, a). The 'less than' relation IS asymmetric. Therefore, saying it is 'not asymmetric' is incorrect. - Option (d) correctly identifies that it is not a partial ordering. While the 'less than' relation is technically anti-symmetric (vacuously), in the context of standard multiple-choice questions for this exam, the lack of reflexivity is the definitive reason it fails to be a partial order. Option (d) is the most accurate choice among the provided options to disqualify it as a partial ordering.

The question describes a scenario where a file is updated (corrected) immediately after a transaction is input. This is the definition of 'On-line updating' (also known as Real-time processing). 1. **On-line updating (Correct):** In this method, the database or file is updated instantly as soon as the transaction occurs. This ensures that the system always reflects the most current data. Examples include ATM withdrawals or airline ticket bookings. 2. **Off-line updating (Incorrect):** Also known as 'Batch processing', this method involves collecting transactions over a period of time and processing them all at once later (e.g., end-of-day processing). The file is not corrected immediately. 3. **Batching (Incorrect):** This is the process of grouping transactions together to be processed as a single unit (batch), which is the opposite of immediate updating. 4. **Sorting (Incorrect):** Sorting is the process of arranging data in a specific order (alphabetical or numerical) and is not a method of updating files based on transaction input.

To find the regular expression that denotes all possible strings over the alphabet Σ = {a, b}, we are looking for the definition of the Kleene closure (Σ*). 1. **Option (a) a* b*:** This denotes strings where any number of 'a's are followed by any number of 'b's. It cannot generate strings where 'a' follows 'b' (e.g., 'ba' is not possible). Therefore, it does not represent all possible strings. 2. **Option (b) (a | b):** This denotes a language containing only two strings: 'a' or 'b'. It does not allow for strings of length 0 (empty string) or length greater than 1. 3. **Option (c) (ab)+:** This denotes strings consisting of one or more repetitions of the sequence 'ab' (e.g., 'ab', 'abab', 'ababab'). It cannot generate strings like 'aa', 'bb', or 'a'. 4. **Option (d) (a | b)*:** The pipe symbol '|' (or '+') denotes the union (OR), meaning 'a' or 'b'. The asterisk '*' (Kleene star) denotes zero or more repetitions of the preceding element. Thus, (a | b)* generates any combination of 'a's and 'b's of any length, including the empty string (ε). This is the definition of Σ* for Σ = {a, b}.

To solve this question, we must analyze the behavior of impedance (Z) and admittance (Y) at resonance for both series and parallel circuits. 1. **Series Resonance:** At resonance, the inductive reactance (XL) and capacitive reactance (XC) cancel each other out (XL = XC). The total impedance Z = R + j(XL - XC) becomes Z = R. Since the reactive components cancel, the impedance is at its **minimum** value. Consequently, the admittance (Y = 1/Z) is at its **maximum** value. 2. **Parallel Resonance:** In an ideal parallel resonant circuit, the inductive and capacitive branches cancel each other's currents. This results in the total impedance Z reaching its **maximum** value (ideally infinite in a lossless circuit). Consequently, the admittance (Y = 1/Z) is at its **minimum** value. **Analysis of Options:** - Option (a) 'maximum' is only true for impedance in parallel resonance. - Option (b) 'minimum' is only true for impedance in series resonance. - Option (c) is technically incorrect as resonance represents extreme values (min/max), not medium values. Because the question asks for the impedance and admittance of *both* series and parallel circuits simultaneously, and the behaviors are opposite (Series: Z min, Y max; Parallel: Z max, Y min), no single option (a, b, or c) correctly describes both scenarios. Therefore, the correct choice is 'None of these'.