U.G.C. NET Exam. December 2022 Paper-II (COMPUTER SCIENCE) and Applicatations.

Total Questions: 100

21. Which of the following is not one of the principles of good coding?

Correct Answer: (d) Write self-documenting code not program documentation.
Solution:

22. If P is the risk probability, L is the loss, then Risk exposure (RE) is computed as _____

Correct Answer: (c) RE = P * L
Solution:

The correct formula to calculate Risk Exposure (RE) based on the risk probability (P) and loss (L) is RE = P * L
This formula multiplies the risk probability (P) by the loss (L) to determine the Risk Exposure (RE). It takes into account both the likelihood of an event occurring (Risk probability) and the potential impact or loss associated with that event.

23. Which of the following is a technique used for component wrapping?

Correct Answer: (b) Clear-box wrapping
Solution:

24. The cyclomatic complexity metric provides the designer with information regarding the number of _____

Correct Answer: (c) Independent logic paths in the program
Solution:

The cyclomatic metric provides the designer with information regarding the number of linearly independent paths through a program's source code. It is a quantitative measure of the complexity of the complexity of a program is controlflow.
The formula to calculate cyclomatic complexity is as
follows.
Cyclomatic complexity (V) = E – N + 2
Where
E = the number of edges in the control flow graph
N = the number of nodes in the control flow graph.

25. In a ______ the left and right sub trees for any given node, differ in height by more than one.

Correct Answer: (e) *
Solution:

an unplaced binary tree is a type of binary tree where the height of the left and right sub trees for any given node given differs by more than one level. UGC has drop this question.

26. FFTs are ______ techniques used to encode digital video and audio information and helps analyse the signal in _____ domain.

Correct Answer: (d) Compression, frequency
Solution:

Fourier Transform is a mathematical concept that can covert a continuous signal from time - domain to frequency - domain. FFTs are compression techniques used to analyze digital video and audio information and help analyze the signal in the frequency domain. So the correct answer is compression, frequency.

27. Given six weights 4, 15, 25, 5, 8, 16 construct a 2-T tree. What is the minimum weighted path length?

Correct Answer: (b) 172
Solution:

Minimum weighted path length
=15 × 2 + 16 × 2 + 8 × 3 + 4 × 4 + 5 ×4 + 25 × 2
= 30 + 32 + 24 + 16 + 20 + 50
= 172
So option (b) is correct.

28. Suppose we store n keys in a hash table of size m=n² using a has function h randomly chosen from a universal class of hash functions. Then the probability is _____ that there are any collisions.

Correct Answer: (c) less than 1/2
Solution:

29. In Pumping Lemma for context free languages, to say a language is satisfying pumping lemma, what is the minimum length of 'vx' together, if you consider the string as 'uvwxy'?

Correct Answer: (a) 0
Solution:

The pumping Lemma for context free languages that for any context - free language L, there exists a constant 'n' (called the pumping length) such that any string S in L, with length at least 'n' can be divded into five pieces u, v, w, x, y satisfying the following conditions.
1. For each i ≥ 0 the string uv w xy is also in L.
2. |vwx| ≥ 1 (i.e. the combined length of v and x is at least 1)
3. |vwx| ≤ n (i.e. the combined length of v and x is at most the pumping length.)
So in this context, the minimum length of 'vx' to gather (i.e. |vwx|) for a language to satisfy the pumping Lemma is 1. So option (b) is correct.

30. Which of the following is ε-free grammar?

Correct Answer: (b) Type-1
Solution:

ε - Free grammar is also known as context sensitive grammar.
S → ∈ it is allow to the starting symbol.
So option (b) is correct by Chomsky hierarachy.