Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

UGC NET Computer Science Previous Year Questions (PYQs)

UGC NET Computer Science Computer Codes PYQ


UGC NET Computer Science PYQ
The representation of $4$ bit code $1101$ into $7$ bit, even parity Hamming code is





Go to Discussion

UGC NET Computer Science UGC NET PYQ UGC NET Computer Science UGC NET Computer Science Sep 2022 (Paper II) PYQ

Solution

For $7$ bit Hamming code, parity positions are

$1,2,4$

Data positions are

$3,5,6,7$

Given data bits are

$1101$

So,

$D_1=1,\ D_2=1,\ D_3=0,\ D_4=1$

Arrange them as:

$P_1\ P_2\ D_1\ P_4\ D_2\ D_3\ D_4$

$=P_1\ P_2\ 1\ P_4\ 1\ 0\ 1$

For even parity,

$P_1$ checks positions $1,3,5,7$

$P_1+1+1+1=\text{even}$

$P_1=1$

$P_2$ checks positions $2,3,6,7$

$P_2+1+0+1=\text{even}$

$P_2=0$

$P_4$ checks positions $4,5,6,7$

$P_4+1+0+1=\text{even}$

$P_4=0$

Therefore, Hamming code is

$1010101$


UGC NET Computer Science PYQ

Which of the following binary codes for decimal digits are self complementing?

(a) $8421$ code
(b) $2421$ code
(c) excess-$3$ code
(d) excess-$3$ gray code

Choose the correct option:






Go to Discussion

UGC NET Computer Science UGC NET PYQ UGC NET Computer Science UGC NET Computer Science Dec 2019 (Paper II) PYQ

Solution

A self-complementing code is a code in which the $9$'s complement of a decimal digit is obtained by complementing all bits.

$8421$ code is not self-complementing.

$2421$ code is self-complementing.

Excess-$3$ code is also self-complementing.

So, correct codes are:

(b) and (c)


UGC NET Computer Science PYQ
Consider a code with only four valid code words:

$0000000000,\ 0000011111,\ 1111100000,\ 1111111111$

This code has distance $5$. If the code word arrived is $0000000111$, then the original code word must be _____





Go to Discussion

UGC NET Computer Science UGC NET PYQ UGC NET Computer Science UGC NET Computer Science Nov 2020 (Paper II) PYQ

Solution

Find Hamming distance from received word $0000000111$.

Distance from $0000011111$ is $2$.

Distance from $0000000000$ is $3$.

Distance from $1111100000$ is $8$.

Distance from $1111111111$ is $7$.

Minimum distance is with $0000011111$.

Hence, the original code word must be $0000011111$.


UGC NET Computer Science


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

UGC NET Computer Science


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Limited Seats
× Aspire MCA Promotion

Game Changer NIMCET Test Series 2026

Boost your preparation with mock tests, analysis and rank-focused practice.

JOIN NOW
Ask Your Question or Put Your Review.

loading...