Recent questions tagged virtual-gate-test-series

Virtual Gate Test Series: Calculus - Linear Approximation
How to solve this?

776 views

Purple asked Feb 1, 2016

0 votes

1 answer

160

How to solve this?

Virtual Gate Test Series: Calculus - Function
The function $f(x)=ax+b$ is strictly increasing iff $(A)a>0$ $(B)a<0$ $(C)a\geq 0$ $(D)a \leq 0$ Why not $C?$ $a\geq0?$

2.0k views

Purple asked Feb 1, 2016

0 votes

1 answer

161

The function $f(x)=ax+b$ is strictly increasing iff$(A)a>0$$(B)a<0$$(C)a\geq 0$$(D)a \leq 0$Why not $C?$ $a\geq0?$

Virtual Gate Test Series: Databases - Query Interpretation
The inner query in Q1 will select the employee having max salary from all other employees in all departments(this will return the max salaried employee in the entire company which belongs to dept 5), and outer query will select all ... from entire company who have salary greater than anyone in dept 5. Why is the answer Q1 and not Q2?

414 views

Purple asked Feb 1, 2016

0 votes

1 answer

162

The inner query in Q1 will select the employee having max salary from all other employees in all departments(this will return the max salaried employee in the entire comp...

Virtual Gate Test Series: CO & Architecture - Pipelining Comparision
For D1 1st instruction will take 3+2+4+2+3 = 16ns rest 99 instruction will take 99*4=396 Hence total: 16+396=412 For D2 1st instruction will take 2+2+2+2+2+2+2+2 = 16ns rest 99 instruction will take 99*2=198 Hence total: 16+198=214 Hence, 412-214=198 according to me Where am I going wrong?

388 views

Purple asked Jan 30, 2016

0 votes

4 answers

163

For D11st instruction will take 3+2+4+2+3 = 16nsrest 99 instruction will take 99*4=396Hence total: 16+396=412For D21st instruction will take 2+2+2+2+2+2+2+2 = 16nsrest 99...

Virtual Gate Test Series: Linear Algebra - Matrix(Number Of Solutions)
$1)$ If the row reduced the form of a matrix has more than two non-zero entries in any row, then the corresponding system of equations has Infinitely many solutions. $2)$ If the row reduced the form of a matrix has more ... 2 non zero, then it's good, because then we will have more number of equations? How is the answer C?

681 views

Purple asked Jan 30, 2016

0 votes

1 answer

164

$1)$ If the row reduced the form of a matrix has more than two non-zero entries in any row, then the corresponding system of equations has Infinitely many solutions.$2)$ ...

Virtual Gate Test Series: Numerical Ability - Birthday Problem
Vivek and Rishabh just become friend with Suchita , and they want to know when her birthday is Suchita gives them a list of $10$ possible options? $May \ 15 \quad May \ 16 \quad May \ 19$ $June \ 17 \quad June \ 18$ ... (B). $June \ 17$ (C). $July \ 16$ (D). Data insufficient How to solve? The answer is C, but how?

1.4k views

Purple asked Jan 30, 2016

1 votes

0 answers

165

Vivek and Rishabh just become friend with Suchita , and they want to know when her birthday is Suchita gives them a list of $10$ possible options? $May \ 15 \quad May \ 1...

Virtual Gate Test Series: Numerical Ability - LCM & HCF
A natural number n is such that $120≤ n ≤ 240.$ If HCF of $n$ and $240$ is $1,$ how many values of $n$ are possible? $A)24$ $B)32$ $C)36$ $D)40$

447 views

Purple asked Jan 30, 2016

1 votes

1 answer

166

A natural number n is such that $120≤ n ≤ 240.$ If HCF of $n$ and $240$ is $1,$ how many values of $n$ are possible?$A)24$ $B)32$ ...

Virtual Gate Test Series: Theory Of Computation - Decidable Language
$L$ is surely decidable if (A) both $L$ and its complement are not recognizable (B) $L \subseteq \{0\}^*$ (C) $L \leq_m \{0^n1^n\;\mid\;n\geq0\}$ (D) $L^R$ is decidable

1.9k views

Purple asked Jan 30, 2016

0 votes

1 answer

167

$L$ is surely decidable if (A) both $L$ and its complement are not recognizable (B) $L \subseteq \{0\}^*$(C) $L \leq_m \{0^n1^n\;\mid\;n\geq0\}$(D) $L^R$ is decidable

Virtual Gate Test Series: Databases - Aggregation
Which of the following is not true? Generalization is the result of taking the union of two or more disjoint entity sets to produce a higher level entity set. Specialization is an abstraction in which ... condition. The concurrency control management component of the database is responsible for handling the concurrency control policies.

832 views

learncp asked Jan 26, 2016

2 votes

1 answer

168

Which of the following is not true?Generalization is the result of taking the union of two or more disjoint entity sets to produce a higher level entity set.Specializatio...

Virtual Gate Test Series: Programming & DS - AVL Tree
Insert the given values in the order in initially empty $\text{AVL}$ tree. $\text{34,21,10,27,24,43,15,6}$ What is the value at the root of the tree$?$

535 views

learncp asked Jan 26, 2016

2 votes

3 answers

169

Insert the given values in the order in initially empty $\text{AVL}$ tree.$\text{34,21,10,27,24,43,15,6}$What is the value at the root of the tree$?$

Virtual Gate Test Series: Discrete Mathematics - Graph Theory (Matching Number)
Find the matching number for the given graph-

802 views

learncp asked Jan 26, 2016

6 votes

3 answers

170

Find the matching number for the given graph-

Virtual Gate Test Series: Theory Of Computation - Decidability
Here My explanation is : I. We run TM for 1,2,3,4,5....n if it stops in any of these then yes otherwise no II. We run TM for n steps if it stops yes otherwise no III. We run TM for n, n+1, n+2.... ... can say yes but if do not halt we can't say anything because we have to run it infinite number of times Is my explanation correct?

932 views

learncp asked Jan 26, 2016

2 votes

2 answers

171

Here My explanation is :I. We run TM for 1,2,3,4,5....n if it stops in any of these then yes otherwise noII. We run TM for n steps if it stops yes otherwise noIII. We run...

Sumit1311

858 views

Sumit1311 asked Jan 22, 2016

0 votes

1 answer

172

Virtual Gate Test Series: Operating System - Safety Algorithm

Virtual Gate Test Series: Operating System - Demand Paging
A demand paging system,with page table held in integer,takes $5ms$ to service a page fault if an empty page is available,or if the page to be replaced is not dirty.It takes $15ms$ if the replaced page is dirty. Memory ... acceptable page fault rate to meet this time requirement will be______$\%?$ $\text{(Correct to two decimal places).}$

552 views

khushtak asked Jan 13, 2016

1 votes

2 answers

173

A demand paging system,with page table held in integer,takes $5ms$ to service a page fault if an empty page is available,or if the page to be replaced is not dirty.It ta...

Virtual Gate Test Series: Operating System - Address Translations

777 views

khushtak asked Jan 13, 2016

0 votes

0 answers

174

Virtual Gate Test Series: Operating System - Thrashing

322 views

khushtak asked Jan 13, 2016

0 votes

0 answers

175

Virtual Gate Test Series: Operating System - I/O Operation
Suppose that a process spends a fraction of time P performing CPU activity. With n processes in memory at once, the probability that all n processes are performing I/O operation. $P^{n}$ $1-P^{n}$ $(1-P)^{n}$ $1-(1-P)^{n}$

414 views

khushtak asked Jan 13, 2016

1 votes

1 answer

176

Suppose that a process spends a fraction of time P performing CPU activity. With n processes in memory at once, the probability that all n processes are performing I/O op...

Virtual Gate Test Series: CO & Architecture - Cache Memory
Consider a $256k$ $4$- way set associative cache with block size $64$ Bytes. Main memory is $2Gb.$ The number of bits used for tag,set and word will be respectively? $10,15,6$ $9,16,6$ $8,17,6$ $7,18,6$ I think answer is $15,10,6 $ $\text{(tag,set,word)}$

324 views

khushtak asked Jan 13, 2016

0 votes

1 answer

177

Consider a $256k$ $4$- way set associative cache with block size $64$ Bytes. Main memory is $2Gb.$ The number of bits used for tag,set and word will be respectively?$10...

Topology
How many topological sorts of the following directed graph are possible?

466 views

khushtak asked Jan 13, 2016

2 votes

2 answers

178

How many topological sorts of the following directed graph are possible?

shivanisrivarshini

1.4k views

shivanisrivarshini asked Jan 7, 2016

1 votes

1 answer

179

Virtual Gate Test Series: CO & Architecture - Pipelining Cycle Time
An unpipelined processor has got the cycle time of 15 ns. Now the processor is pipelined into three stages and 15 ns is divided among three stages as Stage 1: 6 ns Stage 2: 5 ns Stage 3: 4 ns The latch latency is 2 ns ... ns (integer value only). I think cycle time should be 6 ns. Latch latency should not be added in cycle time.

An unpipelined processor has got the cycle time of 15 ns. Now the processor is pipelined into three stages and 15 ns is divided among three stages asStage 1: 6 nsStage 2:...

Virtual Gate Test Series: CO & Architecture - Unpipelined Processor With Evenly Divided Stages
Suppose there is an unpipelined processor with a cycle time $30 ns$ which is evenly divided into $5$ pipeline stages. The total latch latency of the pipeline will be _______________ $ns$(integer value only)

551 views

khushtak asked Jan 7, 2016

0 votes

1 answer

180

Suppose there is an unpipelined processor with a cycle time $30 ns$ which is evenly divided into $5$ pipeline stages. The total latch latency of the pipeline will be ____...