Free UGC NET Paper 2 CS Mock Test 11 – Mixed Practice (Unit 7)

0 / 13 answered 00:00

Q1. A problem of size n requires n² bit operations. What is the largest size instance that can be solved in 1 second, if each bit operation is carried out in 10⁻⁹ second?

A10⁹ B3.16×10⁴ C3.96×10⁷ D2^(10⁹)

Q2. Which of the following is NOT a palindromic subsequence of the string "ababcdabba"?

Aabcba Babba Cabbbba Dadba

Q3. How much time does an algorithm using 2⁵⁰ bit operations need if each bit operation takes 2⁻³⁸ seconds?

A1 hour B10 minutes C30 minutes D1.5 hours

Q4. FFTs are ______ techniques used to encode digital video and audio information and help analyse the signal in the ____ domain.

AEncryption, time BEncryption, frequency CCompression, time DCompression, frequency

Q5. Let n denote a positive integer. A function f is defined as
f(n) = 0, if n = 1
f(n) = f(⌊n/2⌋) + 1, if n > 1
What is f(25), and what does this function find?

A4, ⌊log₂ n⌋ B14, ⌊log₂ n⌋ C4, ⌊n/2⌋ D14, ⌊n/2⌋

Q6. Which of the following is used to determine the cost performance index?

ABudgeted cost of work performed − budget at completion BBudgeted cost of work performed ÷ budget at completion CBudgeted cost of work performed ÷ Actual cost of work performed DBudgeted cost of work performed − Actual cost of work performed

Q7. Software project manager is responsible for the following task:
(A) Project planning
(B) Project status tracking
(C) Resources management
(D) Risk management
(E) Project delivery within time & budget

AAll the statements are correct BOnly (B) & (C) are correct COnly (A) & (D) are correct DOnly (A) & (D) are correct

Q8. Which one of the following is a highly associated activity of project planning?
(1) Keep track of the project progress.
(2) Compare actual and planned progress and costs.
(3) Identify the activities, milestones and deliverables produced by a project.

AKeep track of the project progress BCompare actual and planned progress and costs CIdentify the activities, milestones and deliverables produced by a project DBoth (2) and (3)

Q9.

How much time does an algorithm using 2⁵⁰ bit operations need if each bit operation takes 2⁻³⁸ seconds?

A1 hour B10 minutes C30 minutes D1.5 hour

Q10.

Let n be a positive integer and f(n) = 0 if n = 1, and f(n) = f(⌊n/2⌋) + 1 if n > 1. What is f(25), and what does the function compute?

A4, ⌊log₂ n⌋ B14, ⌊log₂ n⌋ C4, ⌊n/2⌋ D14, ⌊n/2⌋

Q11.

If algorithm A and another algorithm B take −− log (n) √n 2 and microseconds, respectively, to n solve a problem, then the largest size of a problem these algorithms can solve, respectively, in one second are ___ and _____

A2^(10⁶) and 10⁶ B2^(10⁶) and 10¹² C2^(10⁶) and 6·10⁶ D2^(10⁶) and 6·10¹²

Q12.

Consider the pseudo-code fragment, where m is a non-negative integer that has been initialized:

p = 0;
k = 0;
while (k < m)
    p = p + 2^k;
    k = k + 1;
end while

Which of the following is a loop invariant for the while statement? (A loop invariant is an assertion that is true each time the guard is evaluated.)

Ap = 2^k − 1 and 0 ≤ k < m Bp = 2^(k+1) − 1 and 0 ≤ k < m Cp = 2^k − 1 and 0 ≤ k ≤ m Dp = 2^(k+1) − 1 and 0 ≤ k ≤ m

Q13.

Consider a Boolean function of ‘n’ variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is :

ALogarithmic BLinear CQuadratic DExponential

Mock 11 – Mixed Practice