Recent activity by satendra / GATE Overflow for GATE CSE

1 answer

1

GATE Overflow | Mock GATE | Test 1 | Question: 41
Consider a Computer system with a single core CPU, a single level of cache of size $4 \text{MB}$, and main memory. It takes one CPU cycle to access a memory byte if it is in cache, and $145$ cycles if the memory access incurs a cache miss and must be fetched ... $B$ is read in sequence as follows: for (i=0;i<N;i++) { read A[i]; read B{i]; }

Consider a Computer system with a single core CPU, a single level of cache of size $4 \text{MB}$, and main memory. It takes one CPU cycle to access a memory byte if it is...

1.5k views

commented Jan 11, 2019

1 answer

2

GATE Overflow | Mock GATE | Test 1 | Question: 40
You are working on a laptop connected to a $100 \text{Mbps}$ Ethernet LAN. You need a $2 \text{GB}$ file that is on the server in the same LAN. The entire file is also on your pen drive but you have left ... and bring the pen drive, before the transfer on the LAN completes. Assume continuous data transmission on the LAN(no packetization required)).

You are working on a laptop connected to a $100 \text{Mbps}$ Ethernet LAN. You need a $2 \text{GB}$ file that is on the server in the same LAN. The entire file is also on...

1.7k views

commented Jan 11, 2019

0 answers

3

Generic Query
Has anyone applied to IIT hyderabad mtech RA (3-years course) 2019?Has anyone gotten the call?

Has anyone applied to IIT hyderabad mtech RA (3-years course) 2019?Has anyone gotten the call?

163 views

asked Nov 19, 2018

3 answers

4

Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 11
A system has $3$ levels of cache i.e., $L_1, L_2$ and $L_3.$ The access times of $L_1,L_2$ and $L_3$ cache memories are $100$ ns/word, $150$ ns/word and $250$ ns/word, respectively. $L_1, L_2$ ... until a complete memory block gets transferred, what is the average access time? $103$ ns $220$ ns $150$ ns $135$ ns

A system has $3$ levels of cache i.e., $L_1, L_2$ and $L_3.$ The access times of $L_1,L_2$ and $L_3$ cache memories are $100$ ns/word, $150$ ns/word and $250$ ns/word, re...

1.1k views

commented Nov 13, 2018

0 answers

5

Self-Doubt
How many number of ways are there to arrange the letters of the word "ARRANGEMENT" such that (i)there are exactly two pairs of consecutively identical letters? (ii)there are atleast three pairs of consecutively identical letters?

How many number of ways are there to arrange the letters of the word "ARRANGEMENT" such that(i)there are exactly two pairs of consecutively identical letters?(ii)there ar...

517 views

commented Nov 13, 2018

2 answers

6

GATE Overflow | Mathematics | Test 1 | Question: 1
A relation $R$ is defined as $xRy$ , if $x$ and $y$ are NOT equal. This relation $R$ is symmetric but not reflexive symmetric and transitive but not reflexive an equivalent relation none of reflexive or symmetric or transitive

A relation $R$ is defined as $xRy$ , if $x$ and $y$ are NOT equal. This relation $R$ issymmetric but not reflexivesymmetric and transitive but not reflexivean equivalent ...

692 views

commented Nov 10, 2018

2 answers

7

GATE CSE 1994 | Question: 24
An independent set in a graph is a subset of vertices such that no two vertices in the subset are connected by an edge. An incomplete scheme for a greedy algorithm to find a maximum independent set in a tree is given below: V: Set of all ... I); Complete the algorithm by specifying the property of vertex $u$ in each case. What is the time complexity of the algorithm?

An independent set in a graph is a subset of vertices such that no two vertices in the subset are connected by an edge. An incomplete scheme for a greedy algorithm to fin...

5.8k views

commented Nov 3, 2018

2 answers

8

CMI2017-B-7
Consider the following function that takes as input a sequence $A$ of integers with n elements,$A[1],A[2], \dots ,A[n]$ and an integer $k$ and returns an integer value. The function length$(S)$ returns the length of the sequence $S$. Comments ... complexity of this algorithm in terms of the length of the input sequence $A$? Give an example of a worst-case input for this algorithm.

Consider the following function that takes as input a sequence $A$ of integers with n elements,$A ,A , \dots ,A[n]$ and an integer $k$ and returns an integer value. The f...

1.5k views

commented Nov 1, 2018

0 answers

9

Self-doubt
Is this recurrence relation valid: N(h)=N(h-1)+1+(N(h-1)-2) where N(h) denotes minimum no. of nodes in a binary tree of height h. N(h-1) is used for left subtree and N(h-1)-2 is used for right subtree. This is in reference to this question: https://gateoverflow.in/3811/gate2005-it-50

Is this recurrence relation valid:N(h)=N(h-1)+1+(N(h-1)-2) where N(h) denotes minimum no. of nodes in a binary tree of height h.N(h-1) is used for left subtree and N(h-1)...

278 views

asked Oct 27, 2018

3 answers

10

GATE CSE 1995 | Question: 3
Consider the following high level programming segment. Give the contents of the memory locations for variables $W, X, Y$ and $Z$ after the execution of the program segment. The values of the variables $A$ and $B$ are $5CH$ and $92H$, respectively. Also indicate error conditions if ... integer is represented by two bytes) begin X :=A+B Y :=abs(A-B); W :=A-B Z :=A*B end;

Consider the following high level programming segment. Give the contents of the memory locations for variables $W, X, Y$ and $Z$ after the execution of the program segmen...

5.3k views

commented Oct 20, 2018

0 answers

11

Self-doubt
How many indexes of each of the following type can be present at maximum in a relation and why? i)Primary Indexing ii)Clustering indexing iii)Secondary Indexing

How many indexes of each of the following type can be present at maximum in a relation and why?i)Primary Indexingii)Clustering indexingiii)Secondary Indexing

136 views

asked Oct 16, 2018

1 answer

12

Self-Doubt
We say every bcnf is 3nf also but suppose in a bcnf relation the dependency is not preserved then how can we say that it is in 3nf since every 3nf must be dependency preserving.

We say every bcnf is 3nf also but suppose in a bcnf relation the dependency is not preserved then how can we say that it is in 3nf since every 3nf must be dependency pres...

302 views

asked Oct 16, 2018

0 answers

13

Gate2017
In the below question ,it is not mentioned as to how the relation R is associated with A and B.If i take A(M)---R---(1)B(A is related to B using many to one ) and A has total participation then option 3 is correct .If i take B(1)---R--- ... partial Relationship R is many-to-one and the participation of A in R is total Relationship R is many-to-one and the participation of A in R is partial

In the below question ,it is not mentioned as to how the relation R is associated with A and B.If i take A(M) -R -(1)B(A is related to B using many to one ) and A has tot...

288 views

asked Oct 15, 2018

6 answers

14

GATE CSE 2009 | Question: 56
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... $\text{2NF}$ but not in $\text{3NF}$ The schema is not in $\text{2NF}$

Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\tex...

28.2k views

commented Oct 15, 2018

0 answers

15

Self Doubt
Start T; Write(A); Checkpoint; Commit; System Crash; Consider the above transaction T. Suppose the system crashes after the performing the above transaction.Will the recovery manager keep the above transaction into Redo-list ,if yes then what statement will be kept into redo-list?

Start T;Write(A);Checkpoint;Commit;System Crash;Consider the above transaction T. Suppose the system crashes after the performing the above transaction.Will the recovery ...

354 views

commented Oct 13, 2018

5 answers

16

GATE CSE 2015 Set 3 | Question: 29
Consider the partial Schedule $S$ involving two transactions $T1$ and $T2$. Only the $\textit{read}$ and the $\textit{write}$ operations have been shown. The $\textit{read}$ operation on data item $P$ ... re-started to ensure transaction atomicity Schedule $S$ is recoverable and can ensure transaction atomicity and nothing else needs to be done

Consider the partial Schedule $S$ involving two transactions $T1$ and $T2$. Only the $\textit{read}$ and the $\textit{write}$ operations have been shown. The $\textit{rea...

14.4k views

commented Oct 13, 2018

0 answers

17

Self-Doubt
In B+ trees ,after splitting a node we copy the splitted key in the right subtree(leaf node) as per the standard procedure.Is it valid to copy the splitted key to left subtree(leaf node) instead of right subtree(leaf) ? Reference:https://gateoverflow.in/1330/gate2009-44

In B+ trees ,after splitting a node we copy the splitted key in the right subtree(leaf node) as per the standard procedure.Is it valid to copy the splitted key to left su...

173 views

asked Oct 12, 2018

2 answers

18

GATE CSE 1998 | Question: 1.27
Type checking is normally done during lexical analysis syntax analysis syntax directed translation code optimization

Type checking is normally done duringlexical analysissyntax analysissyntax directed translationcode optimization

13.9k views

commented Oct 7, 2018

1 answer

19

GATE CSE 1991 | Question: 10c
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol ... given production rules and adding at most one more production rule. Convert the grammar obtained above into one that is not left recursive.

Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative$E \rightarrow E -T\mid T$$T \rightarrow T/F\mid F$ ...

2.7k views

commented Oct 4, 2018

0 answers

20

Self Doubt
What is the difference between synchronous series counter and synchronous parallel counter? I searched everywhere but nowhere found any term like "synchronous series counter" . What i found was that the synchronous counter is known as parallel counter. If this is true, then how is the following question solved? Please help. https://gateoverflow.in/86195/me-test

What is the difference between synchronous series counter and synchronous parallel counter? I searched everywhere but nowhere found any term like "synchronous series coun...

287 views

commented Sep 25, 2018

1 answer

21

CMI2012-B-02a
For a binary string $x = a_0a_1 \dots a_{n−1}$ define $val(x)$ to be $\Sigma_{0 \leq i < n} 2^{n-1-i}.a_i$ Let $\Sigma = \{(0, 0),(0, 1),(1, 0),(1, 1)\}$. Construct a finite automaton that accepts the set of all strings $(a_0, b_0)(a_1, b_1) \dots (a_{n−1}, b_{n−1}) \in \: \Sigma^*$ such that $val(b_0b_1 \dots b_{n−1}) = 2 · val(a_0a_1 \dots a_{n−1})$.

For a binary string $x = a_0a_1 \dots a_{n−1}$ define $val(x)$ to be $\Sigma_{0 \leq i < n} 2^{n-1-i}.a_i$Let $\Sigma = \{(0, 0),(0, 1),(1, 0),(1, 1)\}$.Construct a fin...

1.8k views

commented Sep 24, 2018

0 answers

22

Computer_Network_Online

1.5k views

commented Jun 2, 2018

1 answer

23

Computer Architecture-Secondary Memory
Susheel is setting up a website. He bought a fancy new hard disk which advertises: an 8 ms average seek time. 10000 RPM or roughly 6 ms per rotation. a2 ms overhead for each disk operation. a transfer speed of 10,000,000 bytes per ... have an average size of 8000 bytes. How much time will it take on an average to read a random HTML file from the disk?

Susheel is setting up a website. He bought a fancy new hard disk which advertises:• an 8 ms average seek time.• 10000 RPM or roughly 6 ms per rotation.• a2 ms overh...

689 views

commented Apr 10, 2018

0 answers

24

Operating System By Harris
Assume the amount of memory on a system is inversely proportional to page fault rate. Each time when memory doubles the page fault rate is reduced by third. Currently system has 32mb of memory and page fault rate is 2% the main memory access time is ... is 300 μ sec. if the main memory is increased to 128 mb, then what would be the overall effective access time________.

Assume the amount of memory on a system is inversely proportional to page fault rate. Each time when memory doubles the page fault rate is reduced by third. Currently sys...

1.8k views

commented Apr 8, 2018

1 answer

25

Cache-Memory
If it takes 50ns to search associative registers and also about 100ns to get access to main memory then find out the % of slowdown in memory access time?(Given hit ratio 90%)- A)60 B)75 C)20 D)90

If it takes 50ns to search associative registers and also about 100ns to get access to main memory then find out the % of slowdown in memory access time?(Given hit ratio ...

1.3k views

closed Apr 8, 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