Recent activity by dileepbhagat2196 / GATE Overflow for GATE CSE

12 answers

1

GATE CSE 2016 Set 2 | Question: 30
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two instances of $U_{G}$, it is required to implement ... $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.

Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two...

22.6k views

commented Oct 14, 2019

1 answer

2

UPPCL AE 2018:68
Which of the following circuits are equivalent (i.e., they produce the same output for all inputs)? $\text{F} = ab + bc + ca$ $\text{G} = (a+b)(b+c)(c+a)$ $\text{H} = \text{NAND(NAND(a,b), NAND(b,c),NAND(c,a))} $ $\text{F}$ and $\text{H}$ $\text{F}$ and $\text{G}$ $\text{F, G}$ and $\text{H}$ $\text{G}$ and $\text{H}$

Which of the following circuits are equivalent (i.e., they produce the same output for all inputs)?$\text{F} = ab + bc + ca$$\text{G} = (a+b)(b+c)(c+a)$$\text{H} = \text{...

434 views

commented Sep 30, 2019

2 answers

3

Test-Series
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% Memory access time = 75 ns Swap page time = 500,000 ns 50% of pages are dirty OS uses a single level page table What is the effective access time (EAT) if we assume the page fault rate is 10%? Assume the cost toupdate the TLB, the page table, and the frame table (if needed) is negligible. 1. 3777.5ns 2. 30220ns 3. 15110ns 4. 7555ns

Suppose: TLB lookup time = 20 nsTLB hit ratio = 80%Memory access time = 75 nsSwap page time = 500,000 ns50% of pages are dirtyOS uses a single level page tableWhat is the...

3.5k views

commented Sep 17, 2019

1 answer

4

GATE CSE 2015 Set 3 | Question: 48
Consider the following C program: #include<stdio.h> int main() { int i, j, k = 0; j=2 * 3 / 4 + 2.0 / 5 + 8 / 5; k-=--j; for (i=0; i<5; i++) { switch(i+k) { case 1: case 2: printf("\n%d", i+k); ... : printf("\n%d", i+k); default: printf("\n%d", i+k); } } return 0; } The number of times printf statement is executed is _______.

Consider the following C program:#include<stdio.h int main() { int i, j, k = 0; j=2 * 3 / 4 + 2.0 / 5 + 8 / 5; k-= j; for (i=0; i<5; i++) { switch(i+k) { case 1: case 2: ...

22.5k views

commented Sep 15, 2019

0 answers

5

Access link vs Control Link
Access Link : 1) An access link from record A points to the record of the closest enclosing block in the program. 2) The chain of access links traces the static structure (think: scopes) of the program. 3) Refers to non-local data in other ... execution of the program. 3) Refers to non-local data in other activation record. (NOT CLEAR) Can anyone explain this line ?

Access Link :1) An access link from record A points to the record of the closest enclosing block in the program.2) The chain of access links traces the static structure (...

9.6k views

commented Sep 15, 2019

4 answers

6

GATE CSE 2012 | Question: 36
Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted. Program main; Var ... Procedure A1; Var ... Call A2; End A1 Procedure A2; Var ... Procedure A21; Var ... Call ... The correct set of activation records along with their access links is given by:

Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted.Program main; Var ... Procedure A1; Var ....

13.0k views

commented Sep 15, 2019

1 answer

7

GATE CSE 1987 | Question: 8a
Consider the following proposal to the "readers and writers problem." Shared variables and semaphores: aw, ar, rw, rr : interger; mutex, reading, writing: semaphore: initial values of variables and states of semaphores: ar=rr=aw ... group of readers make waiting writers starve? Can writers starve readers? Explain in two sentences why the solution is incorrect.

Consider the following proposal to the "readers and writers problem."Shared variables and semaphores:aw, ar, rw, rr : interger; mutex, reading, writing: semaphore: initia...

3.1k views

commented Sep 14, 2019

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true