UGC NET CS 2018 July - II

Last Updated :
Discuss
Comments

Question 1

At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and “x” V operations were performed on this semaphore. If the final value of semaphore is 7, x will be:
  • A
    8
  • B
    9
  • C
    10
  • D
    11

Question 2

The period of a signal is 100 ms. Its frequency is _________.
  • A

    1003Hertz

  • B

    10-2KHz

  • C

    10-3KHz

  • D

    105 Hertz

Question 3

The dotted-decimal notation of the following IPV4 address in binary notation is _________. 10000001 00001011 00001011 11101111
  • A
    111.56.45.239
  • B
    129.11.10.238
  • C
    129.11.11.239
  • D
    111.56.11.239

Question 4

Match the following:

List - IList - II 
(a) The 8-Queen’s problem(i)Dynamic programming 
(b) Single-Source shortest paths(ii) Divide and conquer 
(c)STRASSEN’s Matrix multiplication(iii)Greedy approach 
(d)Optimal binary search trees(iv)Backtracking 
 (a)(b)(c)(d)
(1)(iv)(i)(iii)(ii)
(2)(iv)(iii)(i)(ii)
(3)(iii)(iv)(i)(ii)
(4)(iv)(iii)(ii)(i)
  • A

    (1)

  • B

    (2)

  • C

    (3)

  • D

    (4)

Question 5

In a paged memory, the page hit ratio is 0.40. The time required to access a page in secondary memory is equal to 120 ns. The time required to access a page in primary memory is 15 ns. The average time required to access a page is ________.
  • A
    105
  • B
    68
  • C
    75
  • D
    78

Question 6

Consider a virtual page reference string 1, 2, 3, 2, 4, 2, 5, 2, 3, 4. Suppose LRU page replacement algorithm is implemented with 3 page frames in main memory. Then the number of page faults are_________.
  • A
    5
  • B
    7
  • C
    9
  • D
    10

Question 7

Page information in memory is also called as Page Table. The essential contents in each entry of a page table is/are _________.
  • A
    Page Access information
  • B
    Virtual Page number
  • C
    Page Frame number
  • D
    Both virtual page number and Page Frame Number

Question 8

Which of the following statements are true ? (a) External Fragmentation exists when there is enough total memory space to satisfy a request but the available space is contiguous. (b) Memory Fragmentation can be internal as well as external. (c) One solution to external Fragmentation is compaction. Code:
  • A
    (a) and (b) only
  • B
    (a) and (c) only
  • C
    (b) and (c) only
  • D
    (a), (b) and (c)

Question 9

Given below are three implementations of the swap( ) function in C++: (a)
void swap (int a, int b)
{
int temp;
temp = a;
a = b;
b = temp;
}
int main( )
{
int p = 0, q = 1;
swap (p, q);
}
(b)
void swap (int &a, int &b)
{
int temp;
temp = a;
a = b;
b = temp;
}
int main( )
{
int p = 0, q = 1;
swap (p, q);
}
(c)
void swap (int * a, int * b)
{
int * temp;
temp = a;
a = b;
b = temp;
}
int main( )
{
int p = 0, q = 1;
swap (&p, &q);
}
Which of these would actually swap the contents of the two integer variables p and q?
  • A
    (a) only
  • B
    (b) only
  • C
    (c) only
  • D
    (b) and (c) only

Question 10

Consider a Boolean function of ‘n’ variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is
  • A
    Logarithmic
  • B
    Linear
  • C
    Quadratic
  • D
    Exponential
Tags:

There are 99 questions to complete.

Take a part in the ongoing discussion