Q8
(a)(i) Prove that the minimum distance of any linear (n, k) block code satisfies dmin ≤ 1 + n – k. (5 marks) (a)(ii) Show that the minimum Hamming distance of a linear block code is equal to the minimum number of columns of its parity check matrix that are linearly dependent. From this conclude that the minimum Hamming distance of a Hamming code is always equal to 3. (15 marks) (b) A commercial interface unit uses different names for the handshake lines associated with the transfer of data from the I/O device into the interface unit. The interface input handshake line is labelled STB (strobe), and the interface output handshake line is labelled IBF (input buffer full). A low-level signal on STB loads data from the I/O bus into the interface data register. A high-level signal on IBF indicates that the data item has been accepted by the interface. IBF goes low after an I/O read signal from the CPU when it reads the content of the data register. (i) Draw the block diagram showing the CPU, the interface, and the I/O device together with the pertinent interconnections among the three units. (ii) Draw a timing diagram for the handshaking transfer. (iii) Obtain a sequence of events flowchart for the transfer from the device to the interface and from the interface to the CPU. (20 marks) (c) For a 3-bus power system, assume Voltage at bus – 1 : V₁ = (1·05 + j 0) pu, Voltage at bus – 2 : V₂ = (0·9812 – j 0·0522) pu and Voltage at bus – 3 : V₃ = (0·999 – j 0·0468) pu. The line impedances are shown below : Bus code Impedances (in p.u.) 1 – 2 (0·02 + j 0·04) 1 – 3 (0·01 + j 0·03) 2 – 3 (0·0125 + j 0·025) Compute Real and Reactive power loss in all the lines and also compute total system loss. (10 marks)
हिंदी में प्रश्न पढ़ें
(a)(i) सिद्ध करें कि किसी रैखिक (n, k) खंड कूट (कोड) की न्यूनतम दूरी का मान dmin ≤ 1 + n – k को संतुष्ट करता है | (5 अंक) (a)(ii) दर्शाइए कि एक रैखिक खंड कूट की न्यूनतम हैमिंग दूरी इसकी पैरिटी चेक मैट्रिक्स जो कि रेखीय आधारित (आश्रित) है के न्यूनतम स्तंभों की संख्या के बराबर है | उपरोक्त से निष्कर्ष निकालिए कि हैमिंग कूट की न्यूनतम हैमिंग दूरी हमेशा 3 होती है | (15 अंक) (b) एक वाणिज्य अंतःप्रेष्ट इकाई द्वारा I/O युक्ति से अंतःप्रेष्ट इकाई में डाटा स्थानांतरित करने हेतु संबद्ध हैंडशेक लाइनों के लिए भिन्न नामों का उपयोग होता है | अंतःप्रेष्ट निवेशक हैंडशेक लाइन पर STB (स्ट्रोब) अंकित किया गया है व निर्गत हैंडशेक लाइन पर IBF (इनपुट बफर फुल) अंकित किया गया है | निम्नतर संकेत अवस्था में STB डाटा को I/O बस से अंतःप्रेष्ट डाटा पंजी में भारित (लोड) किया जाता है | STB पर उपस्थित उच्च स्तर संकेत दर्शित करता है कि अंतःप्रेष्ट ने डाटा को ग्रहण कर लिया है | CPU से संकेतों को I/O द्वारा पढ़ने के बाद IBF का मान निम्न हो जाता है, जब यह डाटा पंजी के कंटेंट को पढ़ लेता है | (i) खंड आलेख की सहायता से CPU, अंतःप्रेष्ट व I/O युक्ति को दर्शाते हुए आरेखण करें | साथ ही तीनों इकाइयों के मध्य उपयुक्त अंतरसंयोजनों को भी आलेख में प्रदर्शित करें | (ii) हैंडशेकिंग स्थानांतरण के लिए समय-आलेख का आरेखण करें | (iii) युक्ति से अंतःप्रेष्ट व अंतःप्रेष्ट से CPU में स्थानांतरण की क्रमबद्ध घटनाओं का प्रवाह चार्ट बनायें | (20 अंक) (c) एक 3-बस शक्ति तंत्र के लिए माने कि बस न. 1 पर बोल्टता : V₁ = (1·05 + j 0) pu, बस न. 2 पर बोल्टता : V₂ = (0·9812 – j 0·0522) pu बस न. 3 पर बोल्टता : V₃ = (0·999 – j 0·0468) pu. है | लाइनों की प्रतिबाधा निम्नलिखित है : बस कोड प्रतिबाधा (p.u. में) 1 – 2 (0·02 + j 0·04) 1 – 3 (0·01 + j 0·03) 2 – 3 (0·0125 + j 0·025) सभी लाइनों में वास्तविक व प्रतिघाती शक्ति की हानि (ह्रास) की गणना करें व तंत्र की संपूर्ण शक्ति हानि की गणना करें | (10 अंक)
Directive word: Prove
This question asks you to prove. The directive word signals the depth of analysis expected, the structure of your answer, and the weight of evidence you must bring.
See our UPSC directive words guide for a full breakdown of how to respond to each command word.
How this answer will be evaluated
Approach
Begin with rigorous mathematical proofs for (a)(i)-(ii) establishing the Singleton bound and Hamming code properties using parity check matrix concepts. For (b), construct clear block diagrams, timing diagrams, and flowcharts showing the STB-IBF handshake protocol between CPU, interface, and I/O device. Conclude with systematic power flow calculations for (c), computing complex power injections and line losses using the given 3-bus voltages and impedances. Allocate approximately 40% time to part (a), 40% to part (b), and 20% to part (c) based on mark distribution.
Key points expected
- Proof of Singleton bound dmin ≤ 1 + n – k using linear code properties and dimension arguments
- Demonstration that dmin equals minimum number of linearly dependent columns in parity check matrix H
- Conclusion that Hamming codes have dmin = 3 based on H having distinct non-zero columns
- Block diagram showing CPU, interface unit, and I/O device with STB, IBF, data bus, and control signal interconnections
- Timing diagram with correct sequence: STB low → data loaded → IBF high → CPU read → IBF low
- Flowchart distinguishing device-to-interface transfer (STB-driven) from interface-to-CPU transfer (read-driven)
- Calculation of line currents using Iij = (Vi - Vj)/Zij for all three lines in the power system
- Computation of complex power loss Sloss = |Iij|² × Zij and separation into real (P) and reactive (Q) components for each line
Evaluation rubric
| Dimension | Weight | Max marks | Excellent | Average | Poor |
|---|---|---|---|---|---|
| Concept correctness | 20% | 10 | Correctly applies coding theory concepts (Singleton bound, parity check matrix rank, Hamming code construction), accurately describes asynchronous handshaking protocols, and properly uses power system analysis fundamentals (per-unit system, complex power flow); no conceptual errors in any sub-part | Generally correct concepts with minor errors in one sub-part, such as incomplete proof justification or slightly mischaracterized handshake timing relationships | Fundamental misconceptions evident, such as confusing minimum distance with code rate, misunderstanding STB/IBF signal directions, or incorrect power flow equation application |
| Numerical accuracy | 15% | 7.5 | Precise calculations for part (c): correct complex arithmetic for line currents, accurate |I|²Z computations, proper separation of real and reactive losses, and correct total system loss summation with appropriate significant figures | Correct methodology with minor arithmetic errors or sign mistakes in complex number operations, leading to partially correct final values | Major calculation errors, incorrect formula application (e.g., using voltage magnitude instead of phasor difference), or missing numerical work for line losses |
| Diagram quality | 20% | 10 | Clear, labeled block diagram with all three units and signal directions; precise timing diagram showing STB pulse, data valid period, IBF assertion, and CPU read timing; systematic flowchart with decision diamonds and process boxes for both transfer phases | Generally understandable diagrams with minor labeling omissions or timing sequence ambiguities, or flowchart missing some decision points | Missing or seriously flawed diagrams, incorrect signal directions, timing violations (e.g., IBF going low before CPU read), or unstructured flowcharts |
| Step-by-step derivation | 25% | 12.5 | Rigorous proof structure for (a)(i) showing dmin ≤ n-k+1 via generator matrix row reduction; complete derivation connecting linear dependence of H columns to non-zero codeword weight; systematic power flow derivation showing current, power injection, and loss calculations with clear intermediate steps | Correct overall approach with gaps in logical rigor, such as asserting without proving the column dependence property, or skipping intermediate steps in power calculations | Missing proofs, circular reasoning, or purely numerical approach without theoretical foundation; no derivation shown for key results |
| Practical interpretation | 20% | 10 | Explains practical significance: Singleton bound as fundamental limit on error correction capability, Hamming code's single-error correction in communication systems, handshake protocol ensuring reliable data transfer in microprocessor systems like 8085/8086, and line loss computation relevance for Indian power grid efficiency analysis | Brief mention of practical relevance without elaboration, or generic statements not tied to specific applications in the three topic areas | No practical context provided; purely theoretical treatment without connecting to real-world coding applications, computer interfacing standards, or power system operations |
Practice this exact question
Write your answer, then get a detailed evaluation from our AI trained on UPSC's answer-writing standards. Free first evaluation — no signup needed to start.
Evaluate my answer →More from Electrical Engineering 2021 Paper II
- Q1 (a) A system is described by the following state equations : $$\dot{x}_1 = x_1 + x_2 + 3x_3$$ $$\dot{x}_2 = 2x_1 + 3x_2 + u_1$$ $$\dot{x}_3…
- Q2 (a) Draw the sequence networks and calculate the load sequence impedances of a load circuit as shown in figure. The load circuit is connect…
- Q3 3.(a) A solidly earthed 400 KV, 3 phase busbar system is connected with two incoming and four outgoing lines (feeders). A differential prot…
- Q4 4.(a)(i) The configuration of a 400 KV 3 phase line is shown in figure. The radius of each sub-conductor is 2 cm. Calculate the charging me…
- Q5 (a) Explain the ratio error and phase angle error of current transformer. 10 marks (b) The two top rows of a Routh table of a characteristi…
- Q6 (a) A synchronous machine is connected to an infinite bus through a transformer and a double circuit line as shown in figure. The infinite…
- Q7 (a) Discuss the percentage differential Relay with harmonic restraint with the help of diagram and also draw the conceptual representation…
- Q8 (a)(i) Prove that the minimum distance of any linear (n, k) block code satisfies dmin ≤ 1 + n – k. (5 marks) (a)(ii) Show that the minimum…