Time Left - 12:00 mins

BARC OCES 2022 Quiz 2

Attempt now to get your rank among 118 students!

Question 1

Any sorting algorithm that uses only comparisons between elements requires _____ comparisons.

Question 2

Which of the following is true?

Question 3

Consider the following program code.

Run (n)

{

if (n ≤ 2)

return 1;

else return run ((log (n)) + log (n));

}

Which of the following represents the running time for run (n) function?

Question 4

Consider the circuit shown in figure below:

If propagation delay of NOT gate is 10 nsec, AND gate is 20 nsec and X -OR gate is 10 nsec. If A is
connected to VCC at t = 0, then waveform for output Y is ?

Question 5

Consider G be a directed graph whose vertex set is a set number from 2 to 120. There is an edge from vertex a to vertex b if b = k * a. Where k is any natural number. Then the number of connected components are___________.

Question 6

If a TCP RTT is 60 msec, ACK comes in 42msec value of constant parameter

=0.9,
then find the value of Time out.

Question 7

An n -bit processor has

Question 8

Consider a non serial schedule S has executed in the following order.

, Commit3 (C), Rollback1.

The above given schedule is

Question 9

Let

Find

Question 10

A processor uses 36 bit physical addresses and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page table is used for virtual–to physical address translation, where the virtual address is used as follows
• bits 30–31 are used to index into the first level page table,
• bits 21–29 are used to index into the second level page table,
• bits 12–20 are used to index into the third level page table, and
• bits 0–11 are used as offset within the page.
The number of bits required for addressing the next level page table (or page frame) in the page table entry of the first, second and third level page tables are respectively

118 attempts
0 upvotes
0 comments

Tags :

GATE & PSU CS General

Mar 22GATE & PSU CS