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:

Question 2

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

100³Hertz
10^-2KHz
10^-3KHz
10⁵ Hertz

Question 3

The dotted-decimal notation of the following IPV4 address in binary notation is _________. 10000001 00001011 00001011 11101111

111.56.45.239
129.11.10.238
129.11.11.239
111.56.11.239

Question 4

Match the following:

List - I	List - 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)

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 ________.

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_________.

Question 7

Page information in memory is also called as Page Table. The essential contents in each entry of a page table is/are _________.

Page Access information
Virtual Page number
Page Frame number
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) and (b) only
(a) and (c) only
(b) and (c) only
(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) only
(b) only
(c) only
(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

Logarithmic
Linear
Quadratic
Exponential

Tags:

UGC-NET

There are 99 questions to complete.

Take a part in the ongoing discussion