Information Theory And Coding MCQ Questions & Answers

Information Theory And Coding MCQ Questions & Answers | ECE

Learn Information Theory And Coding MCQ questions & answers are available for a Electronics and Communications Engineering(ECE) students to clear GATE exams, various technical interview, competitive examination, and another entrance exam. Information Theory And Coding MCQ question is the important chapter for a Electronics and Communications Engineering(ECE) and GATE students. Page-10 section-2

The information capacity (bits/sec) of a channel with bandwidth W MHz and transmission time T is given by

A) WT B) W²T C) W/T D) T/W

Discuss

Answer & Solution

Answer: Option A

No explanation is given for this question. Let's Discuss on Board

A binary source in which 0's occurs 3 times as often as 1's. Then its entropy in bits/symbol will be

A) 0.75 bits/symbol B) 0.25 bits/symbol C) 0.81 bits/symbol D) 0.85 bits/symbol

Discuss

Answer & Solution

Answer: Option C

No explanation is given for this question. Let's Discuss on Board

Match List-I with List-II and select the correct answer using the options given below the lists:

List-I (Theorem/law)	List-II (Specified Quantity)
a. Shannon source theorem	1. Channel capacity coding
b. Dimensionality theorem	2. Storage space of a signal
c. Wiener-Kintchine theorem	3. Power spectral density of random process
d. Shannon-Hartley law	4. Optimum code length

A) a-1, b-2, c-3, d-4 B) a-4, b-3, c-2, d-1 C) a-1, b-3, c-2, d-4 D) a-4, b-2, c-3, d-1

Discuss

Answer & Solution

Answer: Option D

No explanation is given for this question. Let's Discuss on Board

An image uses 512 × 512 picture elements. Each of the picture elements can take any of the 8 distinguishable intensity levels. The maximum entropy in the above image will be

A) 2097152 bits B) 786432 bits C) 648 bits D) 144 bits

Discuss

Answer & Solution

Answer: Option B

No explanation is given for this question. Let's Discuss on Board

Shannon Hartley law

A) refers to noise B) defines bandwidth C) describes signaling rate D) refers to distortion

Discuss

Answer & Solution

Answer: Option A

No explanation is given for this question. Let's Discuss on Board

A source produces 4 symbols with probabilities $$\frac{1}{2}$$, $$\frac{1}{4}$$, $$\frac{1}{8}$$ and $$\frac{1}{8}$$. For this source, a practical coding scheme has an average code word length of 2 bits/symbol. The efficiency of the code is:

A) 1 B) $$\frac{7}{8}$$ C) $$\frac{1}{2}$$ D) $$\frac{1}{4}$$

Discuss

Answer & Solution

Answer: Option B

No explanation is given for this question. Let's Discuss on Board

A source generates four messages m₁, m₂, m₃ and m₄, with probabilities 0.5, 0.25, 0.125 and 0.125 respectively. The messages are generated independently of each other. A source coder assigns binary code to each message. Which of the following codes has minimum average length and is also uniquely decodable (sequence as per m₁, m₂, m₃, m₄)?

A) 00, 01, 10, 11 B) 0, 1, 10, 11 C) 110, 111, 10, 0 D) 0, 10, 110, 111

Discuss

Answer & Solution

Answer: Option D

No explanation is given for this question. Let's Discuss on Board

If the minimum possible length and average length of a coding scheme are 2.418 and 2.45 bits respectively. Then its code efficiency and redundancy are

A) 1.01 and 0.013 B) 0.986 and 0.024 C) 0.976 and 0.024 D) 0.986 and 0.014

Discuss

Answer & Solution

Answer: Option D

No explanation is given for this question. Let's Discuss on Board

The purpose of source coding is to

A) increase the information transmission rate B) decrease the information transmission rate C) decrease the S/N rate D) decrease the probability error

Discuss

Answer & Solution

Answer: Option A

No explanation is given for this question. Let's Discuss on Board

100

Data rate R and information rate Rt are different because of

A) channel capacity C, being high B) equivocation C) entropy h(x) D) none of these

Discuss

Answer & Solution

Answer: Option A

No explanation is given for this question. Let's Discuss on Board