Highest voted questions / GATE Overflow for GATE CSE

1 votes

1 answer

19941

Applied Course | Mock GATE | Test 1 | Question: 54
The common pattern in code for using cache systems looks like the following. In this example get_from_cache() returns zero when the data was not in the cache. int lookup(int key) { int data; data = get_from_cache(key); if (data == 0) { data = get_from_backing_store( ... $1 \: ms$ $6 \: ms$ $30 \: ms$ $95 \: ms$

The common pattern in code for using cache systems looks like the following. In this example get_from_cache() returns zero when the data was not in the cache.int lookup(i...

Applied Course

457 views

Applied Course asked Jan 16, 2019

1 votes

1 answer

19942

Applied Course | Mock GATE | Test 1 | Question: 55
Suppose a radix sort was done on the following set of numbers, in binary i.e,$[11, 10, 3, 14, 12, 2, 8, 15, 2]$. How many passes of counting sort would be performed ____________

Suppose a radix sort was done on the following set of numbers, in binary i.e,$[11, 10, 3, 14, 12, 2, 8, 15, 2]$. How many passes of counting sort would be performed _____...

Applied Course

542 views

Applied Course asked Jan 16, 2019

1 votes

1 answer

19943

Applied Course | Mock GATE | Test 1 | Question: 56
$\text{O}, \Omega,$ and $\Theta$ denote Big-Oh, Big-Omega and Big-Theta notations respectively. Which of the following statement is not correct? $n \: \log a = \Omega (\log ^2 (n)), \text{ where a is a constant >1}$ ... $4(n+k)^m = \text{O} (n^m), \text{ where m is a constant >1}$ $n+\log (n) = \Theta (n)$

$\text{O}, \Omega,$ and $\Theta$ denote Big-Oh, Big-Omega and Big-Theta notations respectively. Which of the following statement is not correct?$n \: \log a = \Omega (\lo...

Applied Course

598 views

Applied Course asked Jan 16, 2019

1 votes

1 answer

19944

Applied Course | Mock GATE | Test 1 | Question: 57
Insert the following keys in an array of size $17$ using the modulo division method. Use double hashing to resolve collisions. Take $h'(k) = (\text{key%}7)+1$ as the second hash function: $94, 37, 29, 40, 84, 88, 102, 63, 67, 120, 122$. What is the value present at location $7$ ____

Insert the following keys in an array of size $17$ using the modulo division method. Use double hashing to resolve collisions. Take $h'(k) = (\text{key%}7)+1$ as the seco...

Applied Course

1.4k views

Applied Course asked Jan 16, 2019

1 votes

1 answer

19945

Applied Course | Mock GATE | Test 1 | Question: 58
Consider the Knapsack Problem: Given a set of n items, each with a weight $w_i$ and the value $v_i$ determine a subset of items to include in a collection so that the total weight is $\leq W$ which is a given limit and the total ... subproblems is $O(nW)$. Which of the above statements is/are correct? I only II only Both I and II None of these

Consider the Knapsack Problem: Given a set of n items, each with a weight $w_i$ and the value $v_i$ determine a subset of items to include in a collection so that the tot...

Applied Course

597 views

Applied Course asked Jan 16, 2019

1 votes

1 answer

19946

Applied Course | Mock GATE | Test 1 | Question: 59
Consider the following interleaved schedule with two transactions T1 and T2. The Two-Phase Locking Protocol is followed for achieving concurrency control. Which of the following statements is true with respect to the given schedule? The ... ; T2 The schedule results in a deadlock The schedule is not permitted as per Two Phase Locking Protocol

Consider the following interleaved schedule with two transactions T1 and T2. The Two-Phase Locking Protocol is followed for achieving concurrency control. Which of the fo...

Applied Course

1.0k views

Applied Course asked Jan 16, 2019

1 votes

1 answer

19947

Applied Course | Mock GATE | Test 1 | Question: 60
The left-factoring of the given CFG is $S \rightarrow aBcD \mid aBD \mid daB \mid d$ $B \rightarrow b$ $D \rightarrow d$ $S \rightarrow aBB' \mid d$ $B' \rightarrow cD \mid D$ $B \rightarrow b$ $D \rightarrow d$ ... $B' \rightarrow aB$ $B \rightarrow b$ $D \rightarrow d$ None of them

The left-factoring of the given CFG is$S \rightarrow aBcD \mid aBD \mid daB \mid d$$B \rightarrow b$$D \rightarrow d$$S \rightarrow aBB' \mid d$$B' \rightarrow cD \mid D$...

Applied Course

693 views

Applied Course asked Jan 16, 2019

1 votes

1 answer

19948

Applied Course | Mock GATE | Test 1 | Question: 61
Consider a pipelined processor, which has $5$ stages Fetch, Decode, Execute, memory and Write back with latencies $300 \: ms$, $400 \: ms$, $350 \: ms$, $550 \: ms$ and $100 \: ms$ respectively. What is the latency of an instruction? (Assume ... $1700 \: ms$ $1720 \: ms$ $2750 \: ms$ $2850 \: ms$

Consider a pipelined processor, which has $5$ stages Fetch, Decode, Execute, memory and Write back with latencies $300 \: ms$, $400 \: ms$, $350 \: ms$, $550 \: ms$ and ...

Applied Course

523 views

Applied Course asked Jan 16, 2019

1 votes

3 answers

19949

Applied Course | Mock GATE | Test 1 | Question: 65
Let the following be addresses of IP networks: Network $1: \: 141.21.0.0/16$ Network $2: \: 141.22.0.0/16$ Network $3: \: 143.22.12.0/24$ Let the IP addresses of three hosts be given as follows: Host A: $141.21.12.19$ ... $141.21.21.21$ Host E: $143.22.21.21$ How many of these hosts do not belong to any of the networks?

Let the following be addresses of IP networks:Network $1: \: 141.21.0.0/16$Network $2: \: 141.22.0.0/16$Network $3: \: 143.22.12.0/24$Let the IP addresses of three hosts ...

Applied Course

728 views

Applied Course asked Jan 16, 2019

1 votes

1 answer

19950

Nested loop join
Let a relation R with n tuples occupying X blocks and relation S with m tuples occupying Y blocks. 5 blocks of main memory are allocated to store records of R and S to perform join. What will be the access cost of a) R join S b) S join R

Let a relation R with n tuples occupying X blocks and relation S with m tuples occupying Y blocks. 5 blocks of main memory are allocated to store records of R and S to pe...

Gaurangi Katiyar

388 views

Gaurangi Katiyar asked Jan 16, 2019

1 votes

0 answers

19951

made easy test series
Consider the following grammar G: The grammar G is A)LL (1) grammar and not LR (0) B)LL (1) and LR (0) C)Not LL (1) but LR (0) D)Neither LL (1) nor LR (0)

Consider the following grammar G:The grammar G isA)LL (1) grammar and not LR (0)B)LL (1) and LR (0)C)Not LL (1) but LR (0)D)Neither LL (1) nor LR (0)

pream sagar

286 views

pream sagar asked Jan 16, 2019

1 votes

1 answer

19952

#programming
#define lol(a) a+a*a int main(void) { int a=3; printf("%d",lol(a+2)); return 0; } what is the output ?

#define lol(a) a+a*aint main(void) { int a=3;printf("%d",lol(a+2)); return 0;}what is the output ?

Satbir

707 views

Satbir asked Jan 16, 2019

1 votes

3 answers

19953

Insertion in Hash table. (M.E.)
The number of different insertion sequences of numbers $\left \{ 7,20,32,50,66,77 \right \}$ on an initially empty hash table H of size $6$ and a hash function $h\left ( k \right )=k\mod6$ with linear probing scheme for collision resolution such that the hash table obtained ... ${\color{Blue} {2}}$ ${\color{Blue} {3}}$. ${\color{Blue} {4}}$ ${\color{Blue} {5}}$

The number of different insertion sequences of numbers $\left \{ 7,20,32,50,66,77 \right \}$ on an initially empty hash table H of size $6$ and a hash function $h\left ( ...

srestha

1.1k views

srestha asked Jan 16, 2019

1 votes

1 answer

19954

PIPELINING
Consider the following sequence of instructions executed on the five-stage pipelined processor: LW $1, 30($6) ADD $2, $4, $2 ADD $1, $3, $5 SW $2, 20($4) ADD $1, $1, $4 Assuming there is no forwarding, calculate the number of clock cycles needed to execute above program ?

Consider the following sequence of instructions executed on the five-stage pipelined processor:LW $1, 30($6)ADD $2, $4, $2ADD $1, $3, $5SW $2, 20($4)ADD $1, $1, $...

Himanshu Kashyap

781 views

Himanshu Kashyap asked Jan 16, 2019

1 votes

1 answer

19955

MadeEasy Full Length Test 2019: Graph Theory - Vertex Connectivity
The Vertex Connectivity of Graph is : 1 2 3 None

The Vertex Connectivity of Graph is :12 3None

Na462

742 views

Na462 asked Jan 16, 2019

1 votes

0 answers

19956

Made easy CBT-01
How to solve it?

How to solve it?

ghostman23111

317 views

ghostman23111 asked Jan 16, 2019

1 votes

0 answers

19957

Linked List
Which of the following algorithm is best suitable for sorting of linked list? Quick Sort Merge Sort Heap Sort None of these

Which of the following algorithm is best suitable for sorting of linked list?Quick SortMerge SortHeap SortNone of these

nandini gupta

371 views

nandini gupta asked Jan 16, 2019

1 votes

0 answers

19958

#madeeasy
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??

{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??

BHOJARAM

467 views

BHOJARAM asked Jan 16, 2019

1 votes

0 answers

19959

How to solve this question
If seven colors are used to paint 50 bicycles then which of the following statements need not be true? at least eight bicycles are of the same color at least seven bicycles are of the same color at least nine bicycles are of the same color at most eight bicycles are of the same color

If seven colors are used to paint 50 bicycles then which of the following statements need not be true?at least eight bicycles are of the same colorat least seven bicycles...

`JEET

4.6k views

`JEET asked Jan 16, 2019

1 votes

1 answer

19960

How to solve this question.
A schedule S contains three transactions $T_1$, $T_2$, $T_3$ and the oeprations sequence is given below: $T_1$: $Read$ $A$; $T_2$: $Write$ $A$; $T_3$: $Read$ $A$; $T_1$: $Write$ $A$; $T_3$: $Write$ $A$ and all ... above schedule is serializable or not? If yes it is equivalent to which serial schedule. Find the proper combination of the given alternatives from I to VII

A schedule S contains three transactions $T_1$, $T_2$, $T_3$ and the oeprations sequence is given below:$T_1$: $Read$ $A$; $T_2$: $Write$ $A$; $T_3$: $Read$ $A$; $T_1$: $...

`JEET

1.4k views

`JEET asked Jan 16, 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