UGC NET Computer Science Computer Previous Year Questions (PYQs) – Page 1 of 111
Study Stuff for MCA Examinations
Solution
Nyquist Sampling Theorem states:
Sampling frequency must be at least twice the maximum frequency present in the signal.
$ f_s \ge 2f_{max} $
Solution
Solution
Frequency:
$f=\frac{1}{T}=\frac{1}{0.1}=10\ Hz$
Now convert into kHz:
$10\ Hz=\frac{10}{1000}\ kHz=0.01\ kHz=10^{-2}\ kHz$
| List-I (Boolean Expression) | List-II (Dual of Boolean Expression) |
| A. $x(y+0)$ | I. $(x+0)(y\cdot z)$ |
| B. $\bar{x}+(\bar{y}+z)$ | II. $x+y\cdot1$ |
| C. $\bar{x}(y+0)$ | III. $\bar{x}+\bar{y}\cdot1$ |
| D. $x+(\bar{y}+z)$ | IV. $(x+0)(y\cdot \bar{z})$ |
Solution
Dual is obtained by interchanging:
$+$ ↔ $\cdot$
$0$ ↔ $1$
Applying dual rule:
A → III
B → IV
C → II
D → I
Solution
Solution
So, removing details from a state representation is called abstraction.
The number of tokens in the following line:
for i in range(begin : end : step) :
Solution
Tokens are the smallest meaningful units of a program.
Break the statement:
for | i | in | range | ( | begin | : | end | : | step | ) | :
Tokens:
for
i
in
range
(
begin
:
end
:
step
)
:
Total tokens = 12
Solution
Solution
In AI, solution steps may not always be explicit, and knowledge may be imprecise.
Repetition mechanism is mainly a feature of conventional algorithmic programming, not a special feature of AI problem solving.
For the given two machines which of the following is correct?
Solution
From the diagrams:
• Both machines are deterministic (each state has exactly one transition for each input symbol).
• The first machine has states A and B with transitions on a and b.
• The second machine has states A, B, C, but the accepted language behavior matches the first machine.
Both machines accept the same language, even though the number of states differs.
Thus they are equivalent machines.
UGC NET Computer Science
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
UGC NET Computer Science
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
