NIMCET Computer Previous Year Questions (PYQs) – Page 17 of 23
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Showing 226 questions
For reproducing sound, a CD audio player uses a
1
2
3
4
Solution
A CD audio player uses a laser beam to read digital data encoded on the disc surface, which is then converted into sound.
When we open an internet site, we see www. What does www stand for?
1
2
3
4
Solution
WWW stands for World Wide Web, a system of interlinked hypertext documents accessed through the internet.
The answer of the operation $(10111)2 \times (1110)2 in hex equivalent is
1
2
3
4
Solution
(10111)2 = 2310,
(1110)2 = 1410,
23 × 14 = 32210 = (142)16.
The minimum number of bits to represent a character from ASCII code set is
1
2
3
4
Solution
Answer: 7 bits
Explanation: ASCII has 128 characters (0–127). To represent 128 unique codes, we need 27 = 128 combinations. Hence, 7 bits are sufficient.
The maximum and minimum value represented in signed
16 bit 2's complement representations are
1
2
3
4
Solution
Range of 2's complement $-2^{n-1}$ to $2^{n-1}+1$
Range for 16 bits = $-2^{16-1}$ to $2^{16-1}+1$
Range for 16 bits = $-2^{15}$ to $2^{25}+1$
Range for 16 bits = $-32768$ to $32767$
The minimum number of NAND gates required for implementing the Boolean expression $AB+A\, \overline{B}C+A\, \overline{B}\, \overline{C}$
1
2
3
4
Solution
$AB+A\, \overline{B}C+A\, \overline{B}\, \overline{C}$
=$AB+AB'C+AB'C'$
=$AB+AB'(C+C')$
=$AB+AB'$
=$A(B+B')$
=A
Which of the following is equivalent to the Boolean expression:
$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$
1
2
3
4
Solution
$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$
=$(X+Y)(X+Y')(X'+Y)$
=$(XX+XY+YX+YY')(X'+Y)$
=$(X+XY)(X'+Y)$
=$X(1+Y)(X'+Y)$
=$X(X'+Y)$
=$XX'+XY$
=$XY$
Suppose the largest n bit number requires ‘d’ digits in decimal representation. Which of the following relations between ‘n’ and ‘d’ is approximately correct
1
2
3
4
Solution
n bits binary number required d -decimal digits.
So, ${10}^d{\gt}{2}^n$
Take on both side
$\log _{10}({10}^d)\gt{\log _{10}({2}^n)}^{}$
$d{\gt}n\log _{10}(2)$
If a processor clock is rated as 2500 million cycles per second, then its clock period is:
1
2
3
4
Solution
we know that Frequency is defined as the number of cycles in one second
Number of cycle in 1 sec = 2500 million
=> Frequency = 2500 Mhz
we know that time period is the inverse of frequency and is defined as the time taken by one cycle.
$T = \frac{1}{F}$
$T = \frac{1}{2500 \times 10^{-6}}$
$T=4 \times 10^{-10} $ sec
Write the simplified form of the Boolean expression
(A+C)(AD+AD')+AC+C
1
2
3
4
Solution
(A+C)(AD+AD')+AC+C
=(A+C)A(D+D')+C(A+1)
=(A+C)+C
=A+C
NIMCET
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
NIMCET
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
