Recent activity by blackcloud / GATE Overflow for GATE CSE

4 answers

1

GATE CSE 1999 | Question: 2.11
Which of the following is/are advantage(s) of virtual memory? Faster access to memory on an average. Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory. Program larger than the physical memory size can be run.

Which of the following is/are advantage(s) of virtual memory?Faster access to memory on an average.Processes can be given protected address spaces.Linker can assign addre...

13.9k views

answered Feb 4, 2020

19 answers

2

GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$

Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An avera...

63.7k views

commented Feb 3, 2020

5 answers

3

GATE IT 2007 | Question: 41
Following table indicates the latencies of operations between the instruction producing the result and instruction using the result. ... to execute the above code segment assuming each instruction takes one cycle to execute? $7$ $10$ $13$ $14$

Following table indicates the latencies of operations between the instruction producing the result and instruction using the result.$$\begin{array}{|l|l|c|} \hline \textb...

25.0k views

answered Feb 3, 2020

13 answers

4

GATE CSE 2016 Set 2 | Question: 50
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.

A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to...

15.0k views

answered Feb 2, 2020

6 answers

5

GATE CSE 2014 Set 3 | Question: 44
The memory access time is $1$ nanosecond for a read operation with a hit in cache, $5$ nanoseconds for a read operation with a miss in cache, $2$ nanoseconds for a write operation with a hit in cache and $10$ nanoseconds for a write ... cache hit-ratio is $0.9$. The average memory access time (in nanoseconds) in executing the sequence of instructions is ______.

The memory access time is $1$ nanosecond for a read operation with a hit in cache, $5$ nanoseconds for a read operation with a miss in cache, $2$ nanoseconds for a write ...

24.0k views

commented Feb 2, 2020

5 answers

6

GATE CSE 2007 | Question: 81
Consider a machine with a byte addressable main memory of $2^{16}$ bytes. Assume that a direct mapped data cache consisting of $32$ lines of $64$ bytes each is used in the system. A $50$ x $50$ two-dimensional array of bytes is stored in the main memory starting from memory ... time? line $4$ to line $11$ line $4$ to line $12$ line $0$ to line $7$ line $0$ to line $8$

Consider a machine with a byte addressable main memory of $2^{16}$ bytes. Assume that a direct mapped data cache consisting of $32$ lines of $64$ bytes each is used in th...

10.1k views

answer edited Feb 1, 2020

1 answer

7

Thomas write rule doubt
there is a schedule which is allowed in Thomas write rule so it is view serializable. Suppose at a point write operation of an older transaction is ignored. then the same operation will be ignored in its serial order?

there is a schedule which is allowed in Thomas write rule so it is view serializable. Suppose at a point write operation of an older transaction is ignored. then the same...

1.9k views

commented Jan 30, 2020

2 answers

8

ISRO2007-54
BCNF is not used for cases where a relation has Two (or more) candidate keys Two candidate keys and composite The candidate key overlap Two mutually exclusive foreign keys

BCNF is not used for cases where a relation hasTwo (or more) candidate keysTwo candidate keys and compositeThe candidate key overlapTwo mutually exclusive foreign keys

7.9k views

answered Jan 30, 2020

3 answers

9

Heapsort Comparisons
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they were initially in sorted order, initially in reverse sorted order?

How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they wereinitially in sorted order, initially in reverse sorted order?

3.4k views

answered Jan 29, 2020

2 answers

10

TIFR CSE 2012 | Part B | Question: 12
Let $A$ be a matrix such that $A^{k}=0$. What is the inverse of $I - A$? $0$ $I$ $A$ $1 + A + A^{2} + ...+ A^{k - 1}$ Inverse is not guaranteed to exist.

Let $A$ be a matrix such that $A^{k}=0$. What is the inverse of $I - A$?$0$$I$$A$$1 + A + A^{2} + ...+ A^{k - 1}$Inverse is not guaranteed to exist.

3.2k views

answer edited Jan 27, 2020

8 answers

11

GATE IT 2007 | Question: 2
Let $A$ be the matrix $\begin{bmatrix}3 &1 \\ 1&2\end{bmatrix}$. What is the maximum value of $x^TAx$ where the maximum is taken over all $x$ that are the unit eigenvectors of $A?$ $5$ $\frac{(5 + √5)}{2}$ $3$ $\frac{(5 - √5)}{2}$

Let $A$ be the matrix $\begin{bmatrix}3 &1 \\ 1&2\end{bmatrix}$. What is the maximum value of $x^TAx$ where the maximum is taken over all $x$ that are the unit eigenvect...

16.3k views

answered Jan 26, 2020

6 answers

12

GATE CSE 2000 | Question: 5
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetitions. What is the number of multisets of size $4$ that can be ... n distinct elements so that at least one element occurs exactly twice? How many multisets can be constructed from n distinct elements?

A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetiti...

8.0k views

answered Jan 25, 2020

12 answers

13

TIFR CSE 2018 | Part B | Question: 1
What is the remainder when $4444^{4444}$ is divided by $9?$ $1$ $2$ $5$ $7$ $8$

What is the remainder when $4444^{4444}$ is divided by $9?$$1$$2$$5$$7$$8$

3.3k views

answered Jan 25, 2020

4 answers

14

MadeEasy Subject Test: CO & Architecture - Dma
Consider $1 \text{ MBPS}$ hard disk is interfaced to the processor in a cycle stealing mode of $\text{DMA}$ whenever $64$ bytes of the data is available in the buffer then it is transferred to the main memory. Processor word length is $64$ bits ... $\text{CPU}$ time is consumed for the $\text{DMA}$ operation is ________ (in $\%$).

Consider $1 \text{ MBPS}$ hard disk is interfaced to the processor in a cycle stealing mode of $\text{DMA}$ whenever $64$ bytes of the data is available in the buffer the...

4.1k views

answered Jan 24, 2020

2 answers

15

Theory_of_computation
Q-1) What are the things that are not decidable about DCFL or DCFG? 2)How complexity theory is related to formal langauages ,I know that pure complexity lies in decidable region but question like this confuses me : 3) Apart from this this question : ... how we calculate the quotient and moreover question asks to draw the dfa for the same language,how to work with quotient .?

Q-1) What are the things that are not decidable about DCFL or DCFG? 2)How complexity theory is related to formal langauages ,I know that pure complexity lies in decidable...

735 views

commented Jan 22, 2020

0 answers

16

ECE GATE -2014 Matrix
Which one of the following statements is NOT true for a square matrix $A$? If $A$ is upper triangular, the eigenvalues of $A$ are the diagonal elements of it If $A$ is real symmetric, the eigenvalues of $A$ are always real and positive If $A$ is ... $A$ are positive, all the eigenvalues of $A$ are also positive

Which one of the following statements is NOT true for a square matrix $A$? If $A$ is upper triangular, the eigenvalues of $A$ are the diagonal elements of itIf $A$ is...

1.8k views

commented Jan 22, 2020

8 answers

17

GATE CSE 2005 | Question: 65
Consider a three word machine instruction $\text{ADD} A[R_0], @B$ The first operand (destination) $ A[R_0] $ uses indexed addressing mode with $R_0$ as the index register. The second operand (source) $ @B $ uses indirect addressing mode. $A$ and $B$ ... (first operand). The number of memory cycles needed during the execution cycle of the instruction is: $3$ $4$ $5$ $6$

Consider a three word machine instruction$\text{ADD} A[R_0], @B$The first operand (destination) $“A[R_0]”$ uses indexed addressing mode with $R_0$ as the index regist...

34.3k views

comment edited Jan 20, 2020

1 answer

18

Linear Ambiguous Context Free Grammar
Please post few examples of Linear Ambiguous Context Free Grammar. It would be helpful if you post grammars for famous languages.

Please post few examples of Linear Ambiguous Context Free Grammar.It would be helpful if you post grammars for famous languages.

1.4k views

answered Jan 15, 2020

2 answers

19

GATE Overflow | Mock GATE | Test 1 | Question: 46
Which of the following statements is/are not correct? (P) The class of all Turing Machines is countably infinite (Q) The class of all DCFL's is countably infinite (R) The class of all formal languages is uncountably infinite (S) The set of all primes is countably infinite Only R Only R and S All are incorrect except P None of the above

Which of the following statements is/are not correct?(P) The class of all Turing Machines is countably infinite(Q) The class of all DCFL's is countably infinite(R) The cl...

3.3k views

answered Jan 11, 2020

1 answer

20

GATE Overflow | Mock GATE | Test 1 | Question: 11
Which one of the following best expresses the generating function sequence $\{a_n\}$, for the given closed form representation? $F(x) = \frac{1}{1-x-x^2}$ $a_n=a_{n-1}+3, n>0, a_0=1$ $a_n=a_{n-1}+a_{n-2}, n>1, a_0=1, a_1=1$ $a_n=2n+3, n>1$ $a_n=2a_{n-1}+3, n>1, a_0=1$

Which one of the following best expresses the generating function sequence $\{a_n\}$, for the given closed form representation?$$F(x) = \frac{1}{1-x-x^2}$$$a_n=a_{n-1}+3,...

1.3k views

answered Jan 11, 2020

1 answer

21

GATE Overflow | Mock GATE | Test 1 | Question: 47
Which of the following statements is/are correct with respect to Djikstra Algorithm? (P) It always works perfectly for graphs with negative weight edges. (Q) It does not work perfectly for graphs with negative weight cycles. (R) It may or may not work for graphs ... , S, T and U are correct Only Q, R, T are correct Only Q, R, S, T and U are correct

Which of the following statements is/are correct with respect to Djikstra Algorithm?(P) It always works perfectly for graphs with negative weight edges.(Q) It does not wo...

1.6k views

answered Jan 11, 2020

9 answers

22

GATE CSE 2006 | Question: 25
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is the number of sets $X_j$ that contain the element $i.$ That is $f(i)=\left | \left\{j \mid i\in X_j \right\} \right|$ then $ \sum_{i=1}^{m} f(i)$ is: $3m$ $3n$ $2m+1$ $2n+1$

Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is...

11.1k views

answered Jan 11, 2020

7 answers

23

GATE CSE 2016 Set 2 | Question: 44
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$ ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive

Consider the following languages.$L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$,$L_{2} = \left\{\left\langl...

33.5k views

commented Jan 7, 2020

2 answers

24

pipeline_hazard
no of RAW,WAR and WAW ?

no of RAW,WAR and WAW ?

10.2k views

commented Jan 2, 2020

5 answers

25

MadeEasy Subject Test: CO & Architecture - Io Handling
A device with data transfer rate of 8 KBps is connected to a CPU. Data is transferred bytewise. Let interrupt overhead be 2 μsec. The byte transfer time between the device interface register and CPU or memory is ... the device under interrupt mode over operating it under program-controlled mode is __________ . (Upto 1 decimal places)

A device with data transfer rate of 8 KBps is connected to a CPU. Data is transferred bytewise. Let interrupt overhead be 2 μsec. The byte transfer time between the devi...

2.8k views

commented Jan 1, 2020

6 answers

26

In how many ways can the entrepreneur assign 5 different tasks to 3 employees if each should get atleast 1 task ?

For this I considered cases1. 1 job each to 2 people and then jobs to a single person2. 2 jobs each to 2 people and then 1 job to a single person For the first case I di...

5.9k views

commented Jan 1, 2020

2 answers

27

MadeEasy Subject Test: Programming & DS - Hashing
True Or False.....? Explain...?

True Or False.....? Explain...?

560 views

answered Dec 27, 2019

1 answer

28

MadeEasy Subject Test: Programming & DS - Hashing

504 views

answered Dec 27, 2019

1 answer

29

regular languages
If L1, L2 be two arbitrary language, Choose incorrect statement(s) (i) If L1.L2 is regular, then L2.L1 is also regular. (ii) L1 = L2 iﬀ L1 \ L2 = ∅ and L2 \ L1 = ∅. (iii) If L ⊆ Σ∗ and L is ﬁnite, then Σ∗ \ L is regular.(\=set difference) (A) Only (i) (B) (i) and (ii) (C) (ii) and (iii) (D) All

If L1, L2 be two arbitrary language, Choose incorrect statement(s)(i) If L1.L2 is regular, then L2.L1 is also regular.(ii) L1 = L2 iﬀ L1 \ L2 = ∅ and L2 \ L1 = ∅.(i...

2.2k views

answered Dec 26, 2019

1 answer

30

Number of BFS traversals.
Maximum number of BFS traversals possible on a binary tree with height 3 ?

Maximum number of BFS traversals possible on a binary tree with height 3 ?

3.4k views

answered Dec 24, 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