Past Questions

In network theory and system analysis, the 'input' refers to the external signal or energy source applied to a system to produce a result. This input is technically referred to as the 'stimulus' or the 'excitation'. 1. Stimulus: This is a general term used in systems theory to describe the external influence that triggers a reaction from the system. 2. Excitation: In electrical engineering, this term specifically refers to the application of a voltage or current source to a network to 'excite' the components and create a measurable output. 3. Response: This is the 'output' of the network (e.g., the resulting current or voltage) in reaction to the input. Therefore, option (c) is the opposite of the input. Since both 'stimulus' and 'excitation' are synonymous with 'input' in the context of network analysis, the correct choice is 'either (a) or (b)'.

In graph theory, an Eulerian graph (or Euler graph) is a graph that contains an Eulerian circuit—a closed trail that visits every edge of the graph exactly once and returns to the starting vertex. According to Euler's Theorem (first proved by Leonhard Euler in 1736), a connected graph G has an Eulerian circuit if and only if every vertex in the graph has an even degree. Reasoning for options: - (a) Same degree: This describes a 'regular graph'. While a regular graph with even degrees is Eulerian, not all regular graphs are Eulerian (e.g., a 3-regular graph is not), and not all Eulerian graphs are regular. - (b) Even degree: This is the necessary and sufficient condition for a connected graph to be Eulerian. If a vertex has an odd degree, any path entering and leaving that vertex will eventually leave it 'stranded' or require it to be a start/end point, making a closed circuit impossible. - (c) Odd degree: If a connected graph has exactly two vertices of odd degree, it has an Eulerian path (but not a circuit). If all vertices are of odd degree, it cannot be an Euler graph. - (d) Different degree: This is not a requirement for any specific standard graph type related to Eulerian circuits.

A linear network is defined by the property of linearity, which consists of two main principles: Homogeneity (Scaling) and Superposition. 1. Homogeneity Principle: If an input x(t) produces an output y(t), then a scaled input αx(t) will produce a scaled output αy(t). 2. In this specific problem, the input is 'tripled', meaning the scaling factor α = 3. 3. According to the property of linearity, if the input is multiplied by 3, the output must also be multiplied by 3 (tripled). Evaluating the options: - Option (a) 'reduced to one-third' is incorrect as it describes an inverse relationship. - Option (b) 'doubled' is incorrect as the scaling factor is 3, not 2. - Option (c) 'halved' is incorrect as it describes a reduction. Since the correct result (tripled) is not listed among options a, b, or c, the correct choice is 'none of these'.

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.

To determine the correct answer, we must analyze the definitions of the mathematical structures provided in the options: 1. **Set (Option c):** By definition in standard set theory, a set is an unordered collection of distinct elements. This means that an element cannot occur more than once; if you try to add an existing element to a set, the set remains unchanged. 2. **Ordered set (Option b):** An ordered set (or a sequence/tuple) is a collection where the order of elements matters. The question specifically asks for an 'unordered collection', which disqualifies this option. 3. **Multiset (Option a):** A multiset (also known as a bag) is a generalization of the concept of a set. Like a set, it is unordered, but unlike a set, it allows for multiple instances of the same element. The number of times an element appears is called its multiplicity. Since the question specifies that the collection is 'unordered' and that 'an element can occur as a member more than once', it perfectly describes a Multiset.

A Band-Pass Filter (BPF) is a type of electronic filter that allows a specific range of frequencies (a 'band') to pass through while blocking (attenuating) frequencies outside that range. 1. **Lower Cut-off Frequency (fL):** The frequency below which signals are attenuated. 2. **Upper Cut-off Frequency (fH):** The frequency above which signals are attenuated. 3. **Passband:** The range between fL and fH where the signal is allowed to pass. Analysis of options: - Option (a) describes a High-Pass Filter (HPF). - Option (b) describes a Band-Stop Filter (BSF), also known as a Notch Filter, which rejects a specific band and passes everything else. - Option (c) accurately describes the fundamental operation of a Band-Pass Filter.

In mathematics and digital electronics, when performing a subtraction operation (A - B), the two numbers involved have specific names: 1. The Minuend (A) is the number from which another number is to be subtracted. 2. The Subtrahend (B) is the number that is being subtracted from the minuend. In the context of 1st Complement (or 2nd Complement) subtraction in digital systems, the subtraction is typically performed by adding the complement of the subtrahend to the minuend. Regardless of the method used (direct subtraction or complement addition), the number to be subtracted is always referred to as the 'Subtrahend'. Analysis of options: - Option (a) Subtrahend: Correct. This is the standard term for the number being subtracted. - Option (b) Minuend: Incorrect. This is the number from which the subtraction starts. - Option (c) Carry: Incorrect. A carry is a digit transferred to the next higher column during addition or a result of an overflow in complement arithmetic; it is not a number being subtracted.

In the Theory of Computation, a Context-Free Language (CFL) is defined as 'inherently ambiguous' if every possible Context-Free Grammar (CFG) that generates that language is ambiguous. 1. **Definition of Ambiguity in CFG**: A grammar is ambiguous if there exists at least one string in the language it generates that has more than one leftmost derivation or more than one parse tree. 2. **Definition of Inherently Ambiguous CFL**: While some ambiguous grammars can be rewritten into unambiguous grammars for the same language, an 'inherently ambiguous' language is one for which no such unambiguous grammar exists. Evaluating the options: - **Option (a)**: While it is true that at least one ambiguous CFG exists, this is a property of all ambiguous languages, not the defining characteristic of 'inherently' ambiguous ones. - **Option (b)**: This contradicts the definition of inherent ambiguity. If an unambiguous CFG existed, the language would not be inherently ambiguous. - **Option (c)**: This is incorrect because by definition, a CFL must be generated by at least one CFG. - **Option (d)**: This is the correct definition. For an inherently ambiguous CFL, it is impossible to construct any CFG that is unambiguous.

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}.

A band-stop filter (also known as a notch filter or band-rejection filter) is a type of filter that allows most frequencies to pass through while blocking (attenuating) a specific range of frequencies. 1. **Analysis of Option (a):** This is the definition of a band-stop filter. It has two cutoff frequencies, f1 (lower) and f2 (upper). Frequencies below f1 and above f2 are passed, while frequencies between f1 and f2 are attenuated. This is correct. 2. **Analysis of Option (b):** A filter that attenuates all frequencies less than a certain cutoff frequency is called a High-Pass Filter (HPF). 3. **Analysis of Option (c):** A filter that attenuates all frequencies above a certain cutoff frequency is called a Low-Pass Filter (LPF). 4. **Analysis of Option (d):** A filter that passes only frequencies between two cutoff frequencies and attenuates everything else is called a Band-Pass Filter (BPF).

A substring is defined as a contiguous sequence of characters within a string. To determine the total number of substrings of a string of length n, we can count them based on their length: 1. Substrings of length 1: There are n such substrings (each individual character). 2. Substrings of length 2: There are (n - 1) such substrings. 3. Substrings of length 3: There are (n - 2) such substrings. ... n. Substrings of length n: There is 1 such substring (the string itself). The total number of substrings is the sum of this arithmetic progression: Total = n + (n - 1) + (n - 2) + ... + 1. Using the formula for the sum of the first n natural numbers, Sum = n(n + 1)/2. Alternatively, a substring is uniquely defined by its start position and end position. There are n choices for the start position and n choices for the end position, but since the start must be less than or equal to the end, this is equivalent to choosing 2 positions out of n+1 (the boundaries between characters) to define the substring: Combination(n+1, 2) = (n+1)! / (2! * (n-1)!) = (n+1)n / 2. Comparing this to the options: - Option a (n) only counts substrings of length 1. - Option b (n^2) is incorrect. - Option c (n(n-1)/2) counts substrings of length > 1 only (excluding single characters). - Option d (n(n+1)/2) is the correct mathematical derivation.

In network theory, 'steady-state condition' for a DC circuit refers to the state reached after a long period of time where the voltages and currents have stabilized (transients have decayed). 1. Inductor (L): The voltage across an inductor is given by V = L(di/dt). In DC steady state, the current (i) becomes constant, meaning the rate of change of current (di/dt) is zero. Therefore, V = 0. A component with zero voltage drop across it while carrying current behaves as a short circuit. 2. Capacitor (C): The current through a capacitor is given by I = C(dv/dt). In DC steady state, the voltage (v) across the capacitor becomes constant, meaning the rate of change of voltage (dv/dt) is zero. Therefore, I = 0. A component that allows no current to flow through it behaves as an open circuit. Thus, during DC steady-state, the inductor behaves as a short circuit and the capacitor behaves as an open circuit.

Even-zero count: an=2*an-1 (end 1/2) + (3^{n-1}-an-1) (end 0 makes odd even) = an-1+3^{n-1}.

In the two-wattmeter method for measuring power in a balanced three-phase system, the readings of the two wattmeters (W1 and W2) are given by: W1 = V_L I_L cos(30° + φ) W2 = V_L I_L cos(30° - φ) where φ is the phase angle of the load. Given the ratio W1 : W2 = 1 : 2, we have: (cos(30° + φ)) / (cos(30° - φ)) = 1 / 2 Using the trigonometric identity cos(A ± B) = cos A cos B ∓ sin A sin B: [cos 30° cos φ - sin 30° sin φ] / [cos 30° cos φ + sin 30° sin φ] = 1 / 2 Substituting the values cos 30° = √3/2 and sin 30° = 1/2: [(√3/2) cos φ - (1/2) sin φ] / [(√3/2) cos φ + (1/2) sin φ] = 1 / 2 Cross-multiplying: 2[(√3/2) cos φ - (1/2) sin φ] = (√3/2) cos φ + (1/2) sin φ √3 cos φ - sin φ = (√3/2) cos φ + (1/2) sin φ Rearranging the terms to group cos φ and sin φ: √3 cos φ - (√3/2) cos φ = sin φ + (1/2) sin φ (√3/2) cos φ = (3/2) sin φ Solving for tan φ: tan φ = (√3/2) / (3/2) = √3 / 3 = 1 / √3 Since tan φ = 1/√3, the phase angle φ = 30°. The power factor (pf) is defined as cos φ: pf = cos(30°) = √3/2 Therefore, the circuit power factor is √3/2.

y=ABCD+ABC'=ABC(D+D')=ABC*1=ABC.

Thevenin's and Norton's theorems are fundamental tools in network analysis used to simplify a linear circuit into a single source and a single impedance. 1. **Linearity Requirement**: The primary requirement for these theorems to apply is that the network must be 'linear'. A linear network is one where the components (resistors, capacitors, inductors) have constant values and the sources are independent or dependent linear sources. 2. **Independent Sources**: The theorems obviously apply to networks containing only independent voltage or current sources. 3. **Dependent Sources**: The theorems also apply to networks containing dependent (controlled) sources. The only difference is in the method of calculating the equivalent resistance (Thevenin resistance, Rth). While for independent sources we can simply 'kill' the sources (short voltage, open current), for dependent sources, we must either: - Use the Open Circuit Voltage (Voc) and Short Circuit Current (Isc) method: Rth = Voc / Isc. - Apply an external test voltage or current source at the terminals and calculate the resulting response. Therefore, the presence of dependent sources does not invalidate the theorem; it only changes the procedure for finding the equivalent resistance. Options a, b, and c are too restrictive, as they suggest the theorems only work under specific subsets of linear components.

Step-by-step reasoning: 1. **Definition of Context-Sensitive Grammar (CSG):** A grammar is context-sensitive if all its production rules are of the form αAβ → αγβ, where A is a non-terminal and γ is a non-empty string. A key property of CSGs is that they are 'non-contracting,' meaning the length of the string on the right side of a production is always greater than or equal to the length of the string on the left side (|α| ≤ |β|). 2. **Automata Correspondence:** Context-sensitive languages (CSLs) are exactly the languages accepted by Linear Bounded Automata (LBA). An LBA is a non-deterministic Turing machine whose tape is limited to the portion occupied by the input string. 3. **Decidability (Recursiveness):** A language is 'Recursive' if there exists a Turing machine that halts on all inputs (it accepts strings in the language and rejects strings not in the language). 4. **The Membership Problem for CSLs:** For any context-sensitive language L and a string w, we can determine if w ∈ L by exploring all possible derivations. Because the grammar is non-contracting, there are only a finite number of possible strings of length ≤ |w| that can be derived. Therefore, an algorithm (or an LBA) can check all possibilities and guaranteed to halt with a 'Yes' or 'No' answer. 5. **Conclusion:** Since the membership problem for any context-sensitive language is decidable, every context-sensitive language is a Recursive language. Comparison with options: - (a) Always Recursive: Correct, as proven above. - (b) Recursively enumerable but non-recursive: Incorrect. This describes Type-0 languages (Unrestricted Grammars) that are not Type-1. - (c) May be recursive: Incorrect. It is not just a possibility; it is a mathematical certainty for all CSGs. - (d) None of the above: Incorrect.

In discrete mathematics, there is a fundamental one-to-one correspondence between the number of equivalence relations on a set and the number of partitions of that set. The number of ways to partition a set of n elements is given by the Bell number, denoted as B_n. For a set with n = 4 elements {1, 2, 3, 4}, we can calculate the Bell numbers using the Bell triangle or the recurrence relation B_{n+1} = Σ (k=0 to n) [C(n, k) * B_k], where B_0 = 1. Step-by-step calculation: 1. B_0 = 1 2. B_1 = C(0,0) * B_0 = 1 * 1 = 1 3. B_2 = C(1,0)*B_0 + C(1,1)*B_1 = (1*1) + (1*1) = 2 4. B_3 = C(2,0)*B_0 + C(2,1)*B_1 + C(2,2)*B_2 = (1*1) + (2*1) + (1*2) = 1 + 2 + 2 = 5 5. B_4 = C(3,0)*B_0 + C(3,1)*B_1 + C(3,2)*B_2 + C(3,3)*B_3 = (1*1) + (3*1) + (3*2) + (1*5) = 1 + 3 + 6 + 5 = 15. Alternatively, we can list the partition types for n=4: - {4}: 1 way (all in one block) - {3, 1}: 4 ways (choosing 1 element to be alone) - {2, 2}: 3 ways (pairing elements: {12,34}, {13,24}, {14,23}) - {2, 1, 1}: 6 ways (choosing 2 elements to be together) - {1, 1, 1, 1}: 1 way (all elements separate) Total = 1 + 4 + 3 + 6 + 1 = 15. Therefore, the number of equivalence relations is 15.

Thevenin's and Norton's theorems are used to simplify a linear, bilateral network into a single source and a single impedance. For these theorems to be applicable, the network must be 'self-contained'—meaning all sources and dependencies must exist within the network being simplified. 1. Options (a) and (b) are incorrect because Thevenin/Norton equivalents are specifically designed to handle independent voltage and current sources. 2. Option (c) is incorrect because dependent sources (controlled sources) located *within* the network can be handled using the test-source method (applying a voltage or current source at the terminals to find the equivalent resistance). 3. Option (d) is correct because if a source or a component within the network depends on a variable (voltage or current) located *outside* the network (in another network or the load), the network is no longer linear or independent. The equivalent circuit would change depending on what is connected to the terminals, violating the fundamental premise of Thevenin's theorem, which states that the equivalent circuit remains constant regardless of the load connected.

A Full Adder is a combinational circuit used in digital electronics to perform the addition of three binary digits (bits). Specifically, it adds two significant bits (A and B) and a carry bit (Cin) generated from a previous less-significant stage. 1. Input Analysis: A full adder has three inputs: Input A, Input B, and Carry-in (Cin). 2. Output Analysis: It produces two outputs: Sum (S) and Carry-out (Cout). 3. Comparison with Half Adder: A Half Adder can only add 2 bits (A and B) and cannot handle a carry from a previous stage. To handle the carry, a Full Adder is required, which effectively adds 3 bits at a time. Therefore, the correct number of digits added by a full adder circuit is 3.

A complete graph, denoted as K_n, is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. Step-by-step derivation: 1. Let 'n' be the number of vertices in the graph. 2. Each vertex must be connected to every other vertex. Since there are 'n' vertices, each vertex is connected to (n - 1) other vertices. 3. If we multiply the number of vertices (n) by the number of edges connected to each vertex (n - 1), we get n(n - 1). 4. However, in an undirected graph, the edge connecting vertex A to vertex B is the same as the edge connecting vertex B to vertex A. Therefore, every edge has been counted twice. 5. To find the actual number of unique edges, we divide by 2: Total Edges = n(n - 1) / 2. Alternatively, this can be viewed as a combination problem: we are choosing 2 distinct vertices out of n to form an edge. The number of ways to do this is 'n choose 2', which is calculated as: C(n, 2) = n! / [2!(n - 2)!] = [n * (n - 1)] / 2. Analysis of options: - Option (a) n: This is the number of vertices, not edges. - Option (b) n/2: This does not represent a standard graph property for complete graphs. - Option (c) n^2 - 1: This is incorrect and grows much faster than the actual number of edges. - Option (d) n(n-1)/2: This matches the derived formula.

In filter design, a 'prototype filter' (usually a low-pass prototype) is a normalized filter where the component values are chosen such that the characteristic impedance (Z0) is normalized to a specific value, typically 1 Ohm or a standard resistive value (like 50 or 600 Ohms). The purpose of the prototype is to define the mathematical transfer function and attenuation characteristics. For the filter to effectively pass signals in the passband without introducing phase distortion or reflection, the image impedance (Z0) must be purely resistive. If Z0 were inductive or capacitive in the passband, it would cause impedance mismatching and frequency-dependent phase shifts, which contradicts the goal of a normalized prototype filter. Therefore, Z0 is designed to be purely resistive in the passband to ensure maximum power transfer and a flat response.

Bandwidth in the context of optical fibers refers to the range of frequencies (or the data rate) that the fiber can transmit without significant signal degradation. Optical fibers use light waves, which operate at extremely high frequencies (typically in the terahertz range). Because of this massive available spectrum, the achievable bandwidth (the capacity to carry data) is exceptionally high. While modern high-end fibers can reach Terabits per second (Tbps), the 'typical' bandwidth capability discussed in fundamental computer networking and telecommunications textbooks is characterized as being in the order of Gigahertz (GHz). Comparing the options: - Option (b) KHz (Kilohertz) and Option (c) Hz (Hertz) are far too low; these are typical of very basic analog signals or low-frequency radio, not high-speed data transmission. - Option (a) GHz (Gigahertz) correctly identifies the high-capacity nature of optical fiber communication, which allows for the transmission of billions of bits per second.

To determine which statement is true, we must check if the given sets satisfy the four group axioms under the specified operation: Closure, Associativity, Identity, and Inverse. 1. **Analysis of Option (a):** The set of all rational negative numbers under multiplication. - **Closure:** If we multiply two negative rational numbers (e.g., -1 * -1), the result is a positive rational number (1). Since the result is not a negative number, the set is not closed under multiplication. Therefore, it cannot be a group. 2. **Analysis of Option (b):** The set of all non-singular matrices (matrices with a non-zero determinant) under multiplication. - **Closure:** The product of two non-singular matrices $A$ and $B$ is also non-singular because $\det(AB) = \det(A)\det(B)$. Since $\det(A) \neq 0$ and $\det(B) \neq 0$, their product is non-zero. - **Associativity:** Matrix multiplication is inherently associative. - **Identity:** The identity matrix $I$ is non-singular ($\det(I) = 1$) and acts as the identity element. - **Inverse:** By definition, a non-singular matrix has a multiplicative inverse $A^{-1}$ such that $AA^{-1} = I$, and $A^{-1}$ is also non-singular. Since all four axioms are satisfied, this is a group (known as the General Linear Group $GL(n, F)$). 3. **Analysis of Option (c):** The set of all matrices under multiplication. - **Inverse:** For a set to be a group, every element must have an inverse. Singular matrices (matrices with determinant 0) do not have multiplicative inverses. Therefore, the set of all matrices cannot form a group under multiplication. 4. **Analysis of Option (d):** Since (c) is false, (d) must also be false. Conclusion: Only option (b) is mathematically correct.

A Half Adder is a combinational circuit used to add two single-bit binary numbers (A and B). It has two outputs: the Sum (S) and the Carry (C). 1. The Sum (S) is the result of the addition of the two bits. According to the truth table for binary addition: - 0 + 0 = 0 - 0 + 1 = 1 - 1 + 0 = 1 - 1 + 1 = 0 (with a carry of 1) This logic corresponds exactly to the Exclusive-OR (EX-OR) gate, where the output is high only when the inputs are different. Therefore, Sum = A ⊕ B. 2. The Carry (C) is generated only when both inputs are 1 (1 + 1 = 10 in binary). This logic corresponds to the AND gate. Therefore, Carry = A · B. Since the question asks for the output of the EX-OR gate in a half adder, the correct answer is the Sum.