U.G.C. NET Exam. December 2022 Paper II (COMPUTER SCIENCE) And Applicatation.

Total Questions: 100

21. Which of the following is not a Non functional requirement?

Correct Answer: (d) User interaction
Solution:

Non function requirement or NFRs are a set of specification that describe the system's operation capabilities and constraints and attempt to improve its functionality. These are basically the requirements that outline how well it will operate including thing like speed, security, reliability, data integrity, scalability etc. But user interaction is not NFRs.

22. COCOMO stands for _____

Correct Answer: (b) Constructive cost model
Solution:

COCOMO (Constructions Cost Model) is a regression model based on LOC, i.e. Number Lines of Code. It is a procedural cost estimate model for software projects and is often use as a process of reliably predicting the various parameters associated with making a project such as size, effort cost, time and quality.

23. Modifying the software to match changes in the ever changing environment is called as

Correct Answer: (a) Adaptive maintenance
Solution:

Type of software maintenance corrective maintenance Corrective maintenance aims to correct any remaining errors regardless of where they may cause specifications, design, coding testing and documentation etc.

24. For a function of two variables, boundary value analysis yields,

Correct Answer: (b) 4n+1 test cases
Solution:

A program of n variables Boundary value analysis yields 4n + 1 test cases Robustness testing yields 6n + 1 test cases worst case testing yields 5n. So option (b) is correct.

25. How many different trees are possible with 'n' nodes?

Correct Answer: (e)
Solution:Different tree are possible with n nodes, there exist (2n)!/(n+1)!

26. Let 'n' denote a positive integer. Suppose a function F is defined as

Correct Answer: (a)
Solution:

given function

27. Given the FFT we can have ___ time procedure for multiplying two polynomials A(x) and B(x) of degree bound n where input and output representations are in coefficient form, assuming n is a power of 2.

Correct Answer: (b)
Solution:

1. Double degree-bound : Create coefficient representations of A(x) and B(x) as degree-bounded polynomial by adding n high-order zero coefficients to each.
2. Evaluate : Compute point-value representation of A(x) and B(x) of length 2n through two applications of the FFT of order 2n. These represents contain the values of the two polynomials at the (2n)th roots of unity.
3. Pointwise multiply : Compute a point value representation for the polynomial C(x) = A(x) B(x) by multiplying these values together pointwise. This representation contains the value of c(x) and each (2n)th root unity.
4. Interpolate : Create the coefficient representation of the polynomial c(x) through a single application of an FFT on 2n point value pairs to compute the inverse DFT.
Step (1) and (3) take time O(n) and Step (2) and (4) take time O (nlgn). Thus, once we show how to use the FFT, we will have proven the following.
So the product of two polynomials of degree-bound n can be computed in time O (nlgn), with both the input and output representations in coefficient form. So option (b) is correct.

28. Consider the Graph below:

Correct Answer: (d) 8
Solution:

29. The transition function 'δ' in multi-tape Turing machine is defined as:

Correct Answer: (c)
Solution:

The transition function for a multi-tape Turing Machine has the form

30. In Pumping Lemma for regular languages, to say a language is satisfying pumping lemma, what is the minimum length of 'y' if you consider the string as 'xyz'.

Correct Answer: (c) 1
Solution:

Let L be a regular language.