RTU Kota B.Tech CSE 5th Semester Information Theory and Coding Question Paper 2019

RTU Computer Science Information Theory and Coding 2019 Paper Review

Preparing for the Rajasthan Technical University B.Tech Information Theory and Coding exam requires a firm mathematical understanding of probability, data compression limits, and error correction mechanisms. For Computer Science Engineering students, this subject provides the strict theoretical foundation for network data transmission, cryptography, and efficient digital storage. You cannot fully understand how computers reliably transfer data over noisy internet links without grasping Shannon capacity theorems and mutual information boundaries. The 2019 paper tests your capability to calculate entropy bounds, construct optimal Huffman coding trees, and formulate generator matrices for cyclic codes. Reviewing this specific branch paper on exam-support.in shows exactly how examiners frame mathematical problems and allocate marks across the discrete and continuous modules. This systematic preparation helps you approach your fifth semester exam confidently, Jaiprakash.

Understanding the CSE Branch Exam Pattern

The RTU theory examination is a three hour paper worth 70 marks. The paper features three distinct sections designed to evaluate both foundational definitions and quantitative algorithmic execution.

• Part A: This section contains ten compulsory questions worth two marks each. You must state definitions like conditional entropy, define Kraft inequality, differentiate between systematic and non systematic codes, or write the formula for channel efficiency under 30 words.
• Part B: You will find seven questions here. You must answer five of them. Each question is worth four marks. Your answers require proving simple entropy relationships, calculating the information capacity of a voice grade channel using specific bandwidth and signal to noise ratios, or extracting generator polynomials over a Galois field.
• Part C: This section offers five major questions. You need to answer three. Each question carries ten marks. These require you to execute multi step Shannon Fano or Huffman coding algorithms, compute marginal and joint entropies from a given discrete channel probability matrix, or draw the complete state and trellis diagrams for a convolutional encoder.

Core Topics Evaluated in the CSE Paper

The 2019 question paper covers several critical modules that establish the mathematical rules for data compression and error detection. Focus your study time on these specific areas to maximize your score.

Information Measure and Entropy

This module evaluates your understanding of basic probability in data. You must master the calculations for self information, Shannon entropy, joint entropy, conditional entropy, and mutual information. Practice proving the mathematical properties of entropy. The paper heavily tests your ability to compute these values given a joint probability matrix $P(X,Y)$ for a transmitter and receiver. You must know the entropy formula:

$$H(X) = -\sum_{i=1}^{n} p(x_i) \log_2 p(x_i)$$

Source Coding Algorithms

Source coding focuses on removing structural data redundancy. You must be able to calculate coding efficiency and redundancy for any given algorithm. Practice executing the Shannon Fano coding and Huffman coding algorithms step by step for a given set of message probabilities. The 2019 paper features major questions asking you to build the coding tree, list the final binary codewords, and compute the average codeword length.

Channel Capacity and Continuous Channels

This module bridges discrete probability with physical channel limits. Study the transition probability matrices for the Binary Symmetric Channel and Binary Erasure Channel. You must understand Shannon Channel Coding Theorem. Practice numerical problems calculating the maximum theoretical capacity using the Shannon Hartley theorem for continuous channels:

$$C = B \log_2\left(1 + \frac{S}{N}\right)$$

Linear Block and Cyclic Codes

Error control coding requires logical matrix execution. You must understand how to construct a Generator Matrix and a Parity Check Matrix for an $(n, k)$ block code. Practice encoding a message vector into a codeword and executing standard array or syndrome decoding to detect and correct errors. For cyclic codes, you must know how to generate codewords using generator polynomials instead of matrices, finding the exact remainder via modulo 2 polynomial division.

Convolutional Codes

Convolutional codes represent advanced continuous error correction methods. Study the shift register implementation of encoders. Expect questions asking you to draw the state transition diagram, tree diagram, or trellis diagram for a given encoder rate and constraint length. You should also review the foundational logic of maximum likelihood decoding using the Viterbi algorithm.

Answer Writing Strategy for High Marks

RTU evaluators look for clean probability matrices, properly structured coding trees, and logical mathematical proofs. Use a blue pen for your general text and calculation steps. Use a black pen and ruler for drawing Huffman trees, communication channel diagrams, and block matrices.

In Part A, answer directly. If a question asks for the definition of mutual information, state clearly that it is a measure of the amount of information that one random variable contains about another random variable, and write its mathematical notation.

In Part B, use clear probability tables. When calculating the information capacity of a telephone channel, explicitly write down the bandwidth and convert the signal to noise ratio from decibels to a linear scale before substituting the variables into the formula.

In Part C, precision in calculation is critical. When solving a ten mark Huffman coding problem, arrange the probabilities in strictly descending order. Draw the tree clearly, label every branch with its correct binary assignment, and list the final codewords in a summary table. Box your final coding efficiency percentage.

Time Management During the Exam

Allocate exactly 20 minutes to Part A. Spend 40 minutes addressing the five short answer questions in Part B. Reserve the remaining 120 minutes for the three long answer questions in Part C. Executing polynomial divisions for cyclic codes, computing logarithmic entropy values, and drawing large trellis diagrams requires steady focus and significant time to prevent arithmetic mistakes. This plan guarantees you 40 minutes per major question, giving you time to cross verify your matrix additions and probability summations. Use the final 10 minutes to verify your question numbering, ensure all matrix dimensions align correctly, and check that you have not skipped any intermediate division steps.