Recent activity by Milicevic3306 / GATE Overflow for GATE CSE

3 answers

1

GATE CSE 2014 Set 1 | Question: 20
Which one of the following is FALSE? User level threads are not scheduled by the kernel. When a user level thread is blocked, all other threads of its process are blocked. Context switching between user level threads is faster than context switching between kernel level threads. Kernel level threads cannot share the code segment.

Which one of the following is FALSE?User level threads are not scheduled by the kernel.When a user level thread is blocked, all other threads of its process are blocked.C...

24.9k views

answer edited Jun 29, 2018

2 answers

2

CMI2012-A-10
Consider the following functions $f$ and $g$. f(){ x = x-50; y = y+50; } g( ) { a = a+x; a = a+y; } Suppose we start with initial values of $100$ for $x, 200$ for $y$, and $0$ for $a$, and then execute $f$ and $g$ in parallel - that ... either execute one statement from $f$ or one statement from $g$. Which of the following is not a possible final value of $a$? $300$ $250$ $350$ $200$

Consider the following functions $f$ and $g$. f(){ x = x-50; y = y+50; }g( ) { a = a+x; a = a+y; }Suppose we start with initial values of $100$ for $x, 200$ for $y$, and ...

1.3k views

answer edited Jun 29, 2018

1 answer

3

GATE CSE 1990 | Question: 1-vi
The highest-response ratio next scheduling policy favours ___________ jobs, but it also limits the waiting time of _________ jobs.

The highest-response ratio next scheduling policy favours ___________ jobs, but it also limits the waiting time of _________ jobs.

5.7k views

answer edited Jun 29, 2018

5 answers

4

GATE CSE 2017 Set 1 | Question: 40
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: $S_1$: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's ... is true, $S_2$ is false $S_1$ is false, $S_2$ is true $S_1$ is false, $S_2$ is false

Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements:$S_1$: Random pa...

15.3k views

answer edited Jun 29, 2018

7 answers

5

GATE CSE 2005 | Question: 19
Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line? Neither vectored interrupt nor multiple interrupting devices are possible Vectored interrupts are not possible ... and multiple interrupting devices are both possible Vectored interrupts are possible but multiple interrupting devices are not possible

Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line?Neither vectored interrupt nor multiple interrupting...

21.2k views

answer edited Jun 29, 2018

4 answers

6

GATE CSE 2005 | Question: 20
Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instruction privileged. In a CPU with memory mapped I/ ... /O protection is ensured by a hardware trap I/O protection is ensured during system configuration I/O protection is not possible

Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by ...

11.5k views

answer edited Jun 29, 2018

3 answers

7

GATE CSE 2008 | Question: 66
A process executes the following code for(i=0; i<n; i++) fork(); The total number of child processes created is $n$ $2^n-1$ $2^n$ $2^{n+1} - 1$

A process executes the following codefor(i=0; i<n; i++) fork();The total number of child processes created is$n$$2^n-1$$2^n$$2^{n+1} - 1$

17.2k views

answer edited Jun 29, 2018

4 answers

8

GATE CSE 2015 Set 2 | Question: 49
Consider a typical disk that rotates at $15000$ rotations per minute (RPM) and has a transfer rate of $50 \times 10^6$ bytes/sec. If the average seek time of the disk is twice the average rotational delay and the controller's transfer time ... the disk transfer time, the average time (in milliseconds) to read or write a $512$-byte sector of the disk is _____

Consider a typical disk that rotates at $15000$ rotations per minute (RPM) and has a transfer rate of $50 \times 10^6$ bytes/sec. If the average seek time of the disk is ...

17.9k views

answer edited Jun 29, 2018

4 answers

9

GATE CSE 2008 | Question: 32
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to non-uniform distribution of requests arm starting and stopping inertia higher capacity of tracks on the periphery of the platter use of unfair arm scheduling policies

For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due tonon-uniform distribution of requestsarm star...

13.5k views

answer edited Jun 29, 2018

5 answers

10

GATE CSE 2004 | Question: 17
A Boolean function $x’y’ + xy + x’y$ is equivalent to $x' + y'$ $x + y$ $x + y'$ $x' + y$

A Boolean function $x’y’ + xy + x’y$ is equivalent to$x' + y'$$x + y$$x + y'$$x' + y$

7.9k views

answer edited Jun 29, 2018

5 answers

11

GATE CSE 2017 Set 1 | Question: 41
Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relation EMP. Consider the following queries on the database expressed in tuple relational calculus. { ... Which of the above queries are safe? I and II only I and III only II and III only I, II and III

Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relatio...

25.7k views

answer edited Jun 29, 2018

5 answers

12

GATE IT 2008 | Question: 75
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ ... schools with a pass percentage above $35\%$ over all exams taken together schools with a pass percentage above $35\%$ over each exam

Consider the following relational schema:$\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$$\text{School} (\underline{\tex...

15.3k views

answer edited Jun 29, 2018

1 answer

13

GATE CSE 2004 | Question: 13
Let $R_1 \left(\underline{A}, B, C\right)$ and $R_2\left(\underline{D}, E \right) $ be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in $R_1$ referring to $R_2$. Suppose there is no violation of the above ... $\Pi_D \left(r_1 \bowtie_{C \neq D}r_2\right)$ $\Pi_C \left(r_1 \bowtie_{C = D}r_2\right)$

Let $R_1 \left(\underline{A}, B, C\right)$ and $R_2\left(\underline{D}, E \right) $ be two relation schema, where the primary keys are shown underlined, and let C be a fo...

7.2k views

answer edited Jun 29, 2018

4 answers

14

ISI2011-PCB-CS-5b
Suppose we have a relation $R(A, B, C, D, E)$ with the functional dependencies: $A \rightarrow D, B \rightarrow C, D \rightarrow E, CE \rightarrow B$. If we project $R$ and therefore its functional dependencies onto the schema $ABC$, what will the key(s) for $ABC$ be?

Suppose we have a relation $R(A, B, C, D, E)$ with the functional dependencies:$A \rightarrow D, B \rightarrow C, D \rightarrow E, CE \rightarrow B$.If we project $R$ and...

2.1k views

answer edited Jun 29, 2018

5 answers

15

GATE CSE 2005 | Question: 23
Packets of the same session may be routed through different paths in: TCP, but not UDP TCP and UDP UDP, but not TCP Neither TCP nor UDP

Packets of the same session may be routed through different paths in:TCP, but not UDPTCP and UDPUDP, but not TCPNeither TCP nor UDP

19.7k views

answer edited Jun 29, 2018

3 answers

16

GATE CSE 2015 Set 1 | Question: 21
Suppose that everyone in a group on $N$ people wants to communicate secretly with the $(\text{N - 1})$ others using symmetric Key cryptographic system. The communication between any two person should not be decodable by the others in the group. The numbers of keys required ... satisfy the confidentiality requirement is $2N$ $N(N-1)$ $\dfrac{N(N-1)}{2}$ $(N-1)^{2}$

Suppose that everyone in a group on $N$ people wants to communicate secretly with the $(\text{N - 1})$ others using symmetric Key cryptographic system. The communication ...

7.7k views

answer edited Jun 29, 2018

6 answers

17

GATE CSE 1996 | Question: 2.25
A micro program control unit is required to generate a total of $25$ control signals. Assume that during any micro instruction, at most two control signals are active. Minimum number of bits required in the control word to generate the required control signals will be: $2$ $2.5$ $10$ $12$

A micro program control unit is required to generate a total of $25$ control signals. Assume that during any micro instruction, at most two control signals are active. Mi...

24.9k views

answer edited Jun 29, 2018

3 answers

18

GATE CSE 2008 | Question: 34
Which of the following must be true for the RFE (Return From Exception) instruction on a general purpose processor? It must be a trap instruction It must be a privileged instruction An exception cannot be allowed to occur during execution of an RFE instruction I only II only I and II only I, II and III only

Which of the following must be true for the RFE (Return From Exception) instruction on a general purpose processor?It must be a trap instructionIt must be a privileged in...

12.0k views

answer edited Jun 29, 2018

4 answers

19

GATE CSE 2016 Set 2 | Question: 32
The width of the physical address on a machine is $40$ bits. The width of the tag field in a $512$ KB $8$-way set associative cache is ________ bits.

The width of the physical address on a machine is $40$ bits. The width of the tag field in a $512$ KB $8$-way set associative cache is ________ bits.

17.8k views

answer edited Jun 29, 2018

4 answers

20

GATE CSE 2008 | Question: 71
Consider a machine with a $2$-way set associative data cache of size $64\text{Kbytes}$ and block size $16\text{bytes}$. The cache is managed using $32\;\text{bit}$ virtual addresses and the page size is $4\text{Kbytes}$. A program to be run on this ... total size of the tags in the cache directory is: $32\text{Kbits}$ $34\text{Kbits}$ $64\text{Kbits}$ $68\text{Kbits}$

Consider a machine with a $2$-way set associative data cache of size $64\text{Kbytes}$ and block size $16\text{bytes}$. The cache is managed using $32\;\text{bit}$ virtua...

18.8k views

answer edited Jun 29, 2018

4 answers

21

GATE CSE 1989 | Question: 12a
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B^+$ tree. Obtain the modified $B^+$ tree after insertion.

The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted...

8.4k views

answer edited Jun 27, 2018

5 answers

22

GATE IT 2005 | Question: 47
$(34.4)_{8} × \left ( 23.4 \right )_{8}$ evaluates to $(1053.6)_{8}$ $(1053.2)_{8}$ $(1024.2)_{8}$ None of these

$(34.4)_{8} × \left ( 23.4 \right )_{8}$ evaluates to$(1053.6)_{8}$$(1053.2)_{8}$$(1024.2)_{8}$None of these

8.2k views

edited Jun 27, 2018

6 answers

23

GATE CSE 1998 | Question: 2.19
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is incorrect? R1 and R2 are relations, C1 and C2 are selection conditions and A1 and A2 are attributes of R1. ... $\pi_{A_1} \left(\sigma_{C_1}\left(R_1\right)\right) \to \sigma_{C_1} \left(\pi_{A_1}\left(R_1\right)\right)$

Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is incorrect? R1 and R2 are relations, C1 and C2 are selectio...

17.4k views

answer edited Jun 26, 2018

10 answers

24

GATE CSE 2016 Set 2 | Question: 49
Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _______

Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)...

15.9k views

answer edited Jun 26, 2018

6 answers

25

GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free

In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...

13.5k views

answer edited Jun 26, 2018

4 answers

26

GATE CSE 1989 | Question: 11a
A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ ... What strategies can be used to prevent deadlocks in a system of concurrent processes using shared resources if preemption of granted resources is not allowed?

A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ request and release res...

3.3k views

answer edited Jun 26, 2018

10 answers

27

GATE CSE 2007 | Question: 58
Two processes, $P1$ and $P2$, need to access a critical section of code. Consider the following synchronization construct used by the processes: /* P1 */ while (true) { wants1 = true; while (wants2 == true); /* Critical ... waiting. It requires that processes enter the critical section in strict alteration. It does not prevent deadlocks, but ensures mutual exclusion.

Two processes, $P1$ and $P2$, need to access a critical section of code. Consider the following synchronization construct used by the processes:/* P1 */ while (true) { wa...

27.8k views

answer edited Jun 26, 2018

11 answers

28

GATE IT 2005 | Question: 41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false

Given below is a program which when executed spawns two concurrent processes :semaphore $X : = 0 ;$/* Process now forks into concurrent processes $P1$ & $P2$ */$\begin{ar...

24.1k views

answer edited Jun 26, 2018

1 answer

29

GATE CSE 1996 | Question: 21
The concurrent programming constructs fork and join are as below: Fork <label> which creates a new process executing from the specified label Join <variable> which decrements the specified synchronization variable (by $1$) and terminates the process if the new value is not $0$. Show ... $N$ $S3$ $L2$ : join $M$ $S5$ $L3:S2$ Goto $L1$ $L4:S4$ Goto $L2$ Next:

The concurrent programming constructs fork and join are as below:Fork <label which creates a new process executing from the specified labelJoin <variable which decrements...

6.3k views

edited Jun 26, 2018

9 answers

30

GATE CSE 2004 | Question: 21, ISRO2007-44
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by the instruction set architecture page size number of processes in memory physical memory size

The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined bythe instruction set architecturepage sizenum...

23.9k views

answer edited Jun 26, 2018

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