Recent activity by Danish / GATE Overflow for GATE CSE

6 answers

1

TIFR CSE 2010 | Part B | Question: 32
Consider the following solution (expressed in Dijkstra's guarded command notation) to the mutual exclusion problem. process P1 is begin loop Non_critical_section; while not (Turn=1) do skip od; Critical_section_1; Turn:=2; end loop end process P2 is begin ... ), but does not satisfies the requirement (2). Satisfies all the requirement (1), (2), and (3).

Consider the following solution (expressed in Dijkstra's guarded command notation) to the mutual exclusion problem.process P1 is begin loop Non_critical_section; while no...

4.8k views

answered Nov 26, 2015

1 answer

2

TIFR CSE 2010 | Part B | Question: 40
Which of the following statement is FALSE? All recursive sets are recursively enumerable. The complement of every recursively enumerable sets is recursively enumerable. Every Non-empty recursively enumerable set is the range of some totally recursive function. All finite sets are recursive. The complement of every recursive set is recursive.

Which of the following statement is FALSE?All recursive sets are recursively enumerable.The complement of every recursively enumerable sets is recursively enumerable.Ever...

2.5k views

commented Nov 25, 2015

11 answers

3

GATE CSE 2014 Set 1 | Question: 12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.

Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is...

24.8k views

answered Aug 30, 2015

6 answers

4

GATE CSE 2015 Set 1 | Question: 53
Suppose that the stop-and-wait protocol is used on a link with a bit rate of $64$ $\text{kilobits}$ per second and $20$ $\text{milliseconds}$ propagation delay. Assume that the transmission time for the acknowledgment and the processing time ... . Then the minimum frame size in bytes to achieve a link utilization of at least $50$ $\text{%}$ is_________________.

Suppose that the stop-and-wait protocol is used on a link with a bit rate of $64$ $\text{kilobits}$ per second and $20$ $\text{milliseconds}$ propagation delay. Assume th...

26.7k views

commented Jul 29, 2015

4 answers

5

GATE CSE 2015 Set 1 | Question: 51
Consider the NPDA ... follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$

Consider the NPDA $$ \left \langle Q= \left \{ q_{0}, q_{1}, q_{2} \right \},\Sigma = \left \{ 0, 1 \right \}, \Gamma = \left \{ 0, 1, \perp \right \}, \delta, q_{0}, \p...

24.0k views

commented Jul 29, 2015

7 answers

6

GATE CSE 2015 Set 1 | Question: 55
The least number of temporary variables required to create a three-address code in static single assignment form for the expression $q + r / 3 + s - t * 5 + u * v/w$ is__________________.

The least number of temporary variables required to create a three-address code in static single assignment form for the expression $q + r / 3 + s - t * 5 + u * v/w$ is_...

29.3k views

commented Jul 29, 2015

3 answers

7

GATE CSE 1994 | Question: 3.3
State True or False with one line explanation A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).

State True or False with one line explanationA FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).

15.1k views

commented Jun 30, 2015

10 answers

8

GATE CSE 2015 Set 2 | Question: 23
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$

A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could l...

34.6k views

commented Feb 15, 2015

4 answers

9

GATE CSE 2015 Set 2 | Question: 44
Consider the sequence of machine instruction given below: ... forwarding from the PO stage to the OF stage. The number of clock cycles taken for the execution of the above sequence of instruction is _________.

Consider the sequence of machine instruction given below:$$\begin{array}{ll} \text{MUL} & \text{R5, R0, R1} \\ \text{DIV} & \text{R6, R2, R3} \\ \text{ADD} & \text{R7,...

26.5k views

commented Feb 13, 2015

7 answers

10

GATE CSE 2015 Set 2 | Question: 26
Let $f(x)=x^{-\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the X-axis, when $x$ varies from $-1$ to $1$. Which of the following statements is/are TRUE? $f$ is continuous in $[-1, 1]$ $f$ is not bounded in $[-1, 1]$ $A$ is nonzero and finite II only III only II and III only I, II and III

Let $f(x)=x^{-\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the X-axis, when $x$ varies from $-1$ to $1$. Which of the following stat...

17.5k views

commented Feb 12, 2015

1 answer

11

GATE CSE 2015 Set 2 | Question: 4
A software requirements specification (SRS) document should avoid discussing which one of the following? User interface issues Non-functional requirements Design specification Interfaces with third party software

A software requirements specification (SRS) document should avoid discussing which one of the following?User interface issuesNon-functional requirementsDesign specificati...

7.7k views

commented Feb 12, 2015

3 answers

12

GATE CSE 2015 Set 2 | Question: 6
With reference to the B+ tree index of order $1$ shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query. "Get all records with a search key greater than or equal to $7$ and less than $15$ " is ______.

With reference to the B+ tree index of order $1$ shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following...

13.5k views

commented Feb 12, 2015

3 answers

13

GATE CSE 2006 | Question: 30
For $s\in (0+1)^{*}$ let $d(s)$ denote the decimal value of $s ($e.g. $d (101) = 5 ).$ Let $L=\left \{ s\in (0+1)^*\mid d(s) \text{ mod } 5=2 \text{ and }d(s) \text{ mod } 7\neq 4 \right \}$Which ... following statements is true? $L$ is recursively enumerable, but not recursive $L$ is recursive, but not context-free $L$ is context-free, but not regular $L$ is regular

For $s\in (0+1)^{*}$ let $d(s)$ denote the decimal value of $s ($e.g. $d (101) = 5 ).$ Let$$L=\left \{ s\in (0+1)^*\mid d(s) \text{ mod } 5=2 \text{ and }d(s) \text{ mod ...

7.8k views

commented Feb 4, 2015

10 answers

14

GATE CSE 2013 | Question: 45
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$

Consider an instruction pipeline with five stages without any branch prediction:Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (...

48.4k views

commented Jan 24, 2015

2 answers

15

GATE IT 2008 | Question: 68
Which of the following statements are TRUE? S1: TCP handles both congestion and flow control S2: UDP handles congestion but not flow control S3: Fast retransmit deals with congestion but not flow control S4: Slow start mechanism deals with both congestion and flow control $S1$, $S2$ and $S3$ only $S1$ and $S3$only $S3$and $S4$ only $S1$, $S3$ and $S4$ only

Which of the following statements are TRUE?S1: TCP handles both congestion and flow controlS2: UDP handles congestion but not flow controlS3: Fast retransmit deals wit...

16.1k views

answered Jan 21, 2015

2 answers

16

GATE IT 2006 | Question: 48
The characters $a$ to $h$ have the set of frequencies based on the first $8$ Fibonacci numbers as follows $a : 1$, $b : 1$, $c : 2$, $d : 3$, $e : 5$, $f : 8$, $g : 13$, $h : 21$ A Huffman code is used to represent the characters. What is the sequence of characters corresponding to the following code? $110111100111010$ $fdheg$ $ecgdf$ $dchfg$ $fehdg$

The characters $a$ to $h$ have the set of frequencies based on the first $8$ Fibonacci numbers as follows$a : 1$, $b : 1$, $c : 2$, $d : 3$, $e : 5$, $f : 8$, $g : 13$, $...

13.2k views

commented Jan 20, 2015

5 answers

17

GATE IT 2006 | Question: 12
In the working-set strategy, which of the following is done by the operating system to prevent thrashing? It initiates another process if there are enough extra frames. It selects a process to suspend if the sum of the sizes of the working-sets exceeds the total number of available frames. I only II only Neither I nor II Both I and II

In the working-set strategy, which of the following is done by the operating system to prevent thrashing?It initiates another process if there are enough extra frames.It ...

10.7k views

answered Jan 19, 2015

2 answers

18

GATE CSE 2006 | Question: 33
Let $L_1$ be a regular language, $L_2$ be a deterministic context-free language and $L_3$ a recursively enumerable, but not recursive, language. Which one of the following statements is false? $L_1 \cap L_2$ is a deterministic CFL $L_3 \cap L_1$ is recursive $L_1 \cup L_2$ is context free $L_1 \cap L_2 \cap L_3$ is recursively enumerable

Let $L_1$ be a regular language, $L_2$ be a deterministic context-free language and $L_3$ a recursively enumerable, but not recursive, language. Which one of the followi...

12.7k views

answered Jan 19, 2015

3 answers

19

GATE CSE 2011 | Question: 48
Consider the following recursive C function that takes two arguments. unsigned int foo(unsigned int n, unsigned int r) { if (n>0) return ((n%r) + foo(n/r, r)); else return 0; } What is the return value of the function $\text{foo}$ when it is called as $\text{foo(345, 10)}$? $345$ $12$ $5$ $3$

Consider the following recursive C function that takes two arguments.unsigned int foo(unsigned int n, unsigned int r) { if (n>0) return ((n%r) + foo(n/r, r)); else return...

9.0k views

answered Jan 17, 2015

10 answers

20

GATE CSE 2011 | Question: 54
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. ... spanning tree (MST) of such a graph with $n$ nodes? $\frac{1}{12} (11n^2 - 5 n)$ $n^2-n+1$ $6n-11$ $2n+1$

An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each ...

17.4k views

answered Jan 17, 2015

2 answers

21

GATE IT 2004 | Question: 61
Consider the following C program: #include <stdio.h> typedef struct { char *a; char *b; } t; void f1 (t s); void f2 (t *p); main() { static t s = {"A", "B"}; printf ("%s %s\n", s.a, s.b); f1(s); printf ("%s %s\n", s.a, s.b); f2(&s); } void ... $A \ B$ $V \ W$ $A \ B$ $U \ V$ $U \ V$ $V \ W$ $A \ B$ $U \ V$ $V \ W$ $U \ V$

Consider the following C program:#include <stdio.h typedef struct { char *a; char *b; } t; void f1 (t s); void f2 (t *p); main() { static t s = {"A", "B"}; printf ("%s %s...

10.1k views

commented Jan 17, 2015

9 answers

22

GATE CSE 2006 | Question: 80
A CPU has a $32 KB$ direct mapped cache with $128$ byte-block size. Suppose A is two dimensional array of size $512 \times512$ with elements that occupy $8$-bytes each. Consider the following two C code segments, $P1$ and $P2$. P1: for (i=0; i<512; i++) { for (j=0; ... $P1$ be $M_{1}$and that for $P2$ be $M_{2}$. The value of $M_{1}$ is: $0$ $2048$ $16384$ $262144$

A CPU has a $32 KB$ direct mapped cache with $128$ byte-block size. Suppose A is two dimensional array of size $512 \times512$ with elements that occupy $8$-bytes each. C...

17.0k views

commented Jan 17, 2015

5 answers

23

GATE CSE 2002 | Question: 16
For relation R = (L, M, N, O, P), the following dependencies hold: $ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$ R is decomposed into R1 = (L, M, N, P) and R2 = ( ... above decomposition dependency-preserving? If not, list all the dependencies that are not preserved. What is the highest normal form satisfied by the above decomposition?

For relation R = (L, M, N, O, P), the following dependencies hold:$ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$R is decomposed into R1 ...

16.8k views

commented Jan 16, 2015

2 answers

24

GATE CSE 2006 | Question: 66
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $x_i$ instances of a resource $R$, $ 1\leq i\leq n$ . Currently, all instances of $R$ are occupied. Further, for all $i$, process $i$ has placed a request for an additional $y_i$ instances while ... $ \max(x_{p},x_{q})>1$ $ \min(x_{p},x_{q})>1$

Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $x_i$ instances of a resource $R$, $ 1\leq i\leq n$ . Currently, all instances ...

16.7k views

commented Jan 15, 2015

8 answers

25

GATE CSE 2010 | Question: 48
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2$ ... $L1$ cache. What is the time taken for this transfer? $2$ nanoseconds $20$ nanoseconds $22$ nanoseconds $88$ nanoseconds

A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cac...

42.9k views

commented Jan 15, 2015

3 answers

26

GATE CSE 2001 | Question: 8
Consider a disk with the following specifications: 20 surfaces, 1000 tracks/surface, 16 sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating system initiates the transfer between the disk and the memory sector-wise. Once the head ... What is the maximum percentage of time the CPU is held up for this disk I/O for cycle-stealing DMA transfer?

Consider a disk with the following specifications: 20 surfaces, 1000 tracks/surface, 16 sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating sy...

10.2k views

answer edited Jan 14, 2015

3 answers

27

GATE IT 2007 | Question: 57
In a multi-user operating system on an average, $20$ requests are made to use a particular resource per hour. The arrival of requests follows a Poisson distribution. The probability that either one, three or five requests are made in $45$ ... $6.9 \times 10^3 \times e^{-20}$ $1.02 \times 10^3 \times e^{-20}$

In a multi-user operating system on an average, $20$ requests are made to use a particular resource per hour. The arrival of requests follows a Poisson distribution. The ...

9.7k views

commented Jan 12, 2015

5 answers

28

GATE IT 2007 | Question: 44, ISRO2015-34
A hard disk system has the following parameters : Number of tracks $= 500$ Number of sectors/track $= 100$ Number of bytes /sector $= 500$ Time taken by the head to move from one track to adjacent track $= 1 \ ms$ Rotation speed $= 600 \ rpm$. What is ... time taken for transferring $250$ bytes from the disk ? $300.5 \ ms$ $255.5 \ ms$ $255 \ ms$ $300 \ ms$

A hard disk system has the following parameters :Number of tracks $= 500$Number of sectors/track $= 100$Number of bytes /sector $= 500$Time taken by the head to move from...

23.2k views

commented Jan 11, 2015

6 answers

29

GATE IT 2008 | Question: 64
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/s}.$ What should be the packet size for a channel utilization of $25\%$ for ... there are no errors during communication. $120\;\text{bytes}$ $60\;\text{bytes}$ $240\;\text{bytes}$ $90\;\text{bytes}$

A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/...

25.0k views

answered Jan 10, 2015

2 answers

30

GATE IT 2008 | Question: 59
A software engineer is required to implement two sets of algorithms for a single set of matrix operations in an object oriented programming language; the two sets of algorithms are to provide precisions of 10-3 and 10-6, respectively. She decides to ... from Low Precision Matrix. S4: One class should be derived from the other; the hierarchy is immaterial. S1 S2 S3 S4

A software engineer is required to implement two sets of algorithms for a single set of matrix operations in an object oriented programming language; the two sets of algo...

1.6k views

commented Jan 10, 2015

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