Recent activity by HeadShot / GATE Overflow for GATE CSE

5 answers

1

GATE IT 2005 | Question: 81-b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$

A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $...

13.8k views

commented Jan 24, 2020

0 answers

2

Google foo-bar
Hi guys , I got Google's invitation for foo-bar challenge. I think i can go for one or two level but not further with current level of practice. So without requesting for the problem , does anyone know how long I can keep it logged in ?

Hi guys ,I got Google's invitation for foo-bar challenge.I think i can go for one or two level but not further with current level of practice.So without requesting for th...

246 views

asked May 30, 2019

0 answers

3

Allen Career Institute: Algorithm
Identify the algorithm which works on the principle that locally optimal solutions are globally optimal. $\left ( A \right )$ Divide and Conquer $\left ( B \right )$ Greedy $\left ( C \right )$ Dynamic Programming $\left ( D \right )$ All of the above

Identify the algorithm which works on the principle that locally optimal solutions are globally optimal.$\left ( A \right )$ Divide and Conquer$\left ( B \right )$ Greedy...

1.3k views

commented Apr 5, 2019

0 answers

4

Kenneth Rosen Edition 7 Exercise 2.1 Question 17 (Page No. 126)
Suppose that $A, B,$ and $C$ are sets such that $A \subseteq B$ and $B \subseteq C.$ show that $A \subseteq C.$

Suppose that $A, B,$ and $C$ are sets such that $A \subseteq B$ and $B \subseteq C.$ show that $A \subseteq C.$

214 views

commented Apr 5, 2019

13 answers

5

Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?

How many minimum relations required for given ER diagram ?

8.8k views

commented Jan 29, 2019

4 answers

6

GATE CSE 2014 Set 2 | Question: 16
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE? If $A\: \leq_m B$ and $B$ is recursive then $A$ ... then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.

Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE?If $A\: \leq_...

17.5k views

commented Jan 27, 2019

1 answer

7

Test by Bikram | Mock GATE | Test 2 | Question: 9
Consider these three grammars. ... by $G2$, then it can be generated by $G1$. If w can be generated by $G3$, then it can be generated by $G1$.

Consider these three grammars.$$\begin{array}{|c|c|c|} \hline \textbf{Grammar G1:} & \textbf{Grammar G2:} & \textbf{Grammar G3:} \\ \hline E\rightarrow E+T \mid T & E\r...

831 views

commented Jan 17, 2019

4 answers

8

GATE CSE 2011 | Question: 52
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ ... $N3$? $(3, 2, 0, 2, 5)$ $(3, 2, 0, 2, 6)$ $(7, 2, 0, 2, 5)$ $(7, 2, 0, 2, 6)$

Consider a network with five nodes, $N1$ to $N5$, as shown as below.The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distanc...

23.7k views

commented Jan 14, 2019

4 answers

9

GATE CSE 2011 | Question: 33
Consider a finite sequence of random values $X=[x_1,x_2,\dots x_n]$. Let $\mu_x$ be the mean and $\sigma_x$ be the standard deviation of $X$. Let another finite sequence $Y$ of equal length be derived from this as $y_i=a*x_i+b$, where $a$ and $b$ are positive ... $Y$ in $Y$ $\mu_y=a \mu_x + b$ $\sigma_y=a \sigma_x + b$

Consider a finite sequence of random values $X=[x_1,x_2,\dots x_n]$. Let $\mu_x$ be the mean and $\sigma_x$ be the standard deviation of $X$. Let another finite sequence ...

8.3k views

commented Jan 14, 2019

2 answers

10

Test by Bikram | Mock GATE | Test 2 | Question: 30
Which of the following statements are true? Every totally ordered set is a lattice Every lattice has a least element and a greatest element All totally ordered posets are also well ordered posets. i only ii and iiii only ii only i, ii and iii

Which of the following statements are true?Every totally ordered set is a latticeEvery lattice has a least element and a greatest elementAll totally ordered posets are al...

805 views

commented Jan 13, 2019

7 answers

11

GATE CSE 2009 | Question: 13
Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm? P: Always finds a negative weighted cycle, if one exists. Q: Finds whether any negative weighted cycle is reachable from the source. $P$ only $Q$ only Both $P$ and $Q$ Neither $P$ nor $Q$

Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm?P: Always finds a negative weighted cycle, if one exists.Q: Finds whethe...

16.6k views

commented Jan 12, 2019

4 answers

12

GATE IT 2007 | Question: 3, UGCNET-June2012-III: 34
Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u$ has weight 53 and the shortest path from $s$ to $v$ has weight 65. Which one of the ... $(u,v) \leq 12$ Weight $(u,v) = 12$ Weight $(u,v) \geq 12$ Weight $(u,v) > 12$

Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u...

11.4k views

commented Jan 12, 2019

3 answers

13

GATE CSE 1991 | Question: 01,vii
The minimum number of comparisons required to sort $5$ elements is ______

The minimum number of comparisons required to sort $5$ elements is ______

8.7k views

commented Jan 11, 2019

1 answer

14

Graph
Also let me know the approach to find back edges, cross edges, forward edges, How to solve these questions

Also let me know the approach to find back edges, cross edges, forward edges,How to solve these questions

2.5k views

commented Jan 11, 2019

0 answers

15

ME OTS : TCP timers
Assume in TCP client is sending segment to server. After successfully receiving segments from client, server is waiting for next segments and clients is also waiting for acknowledgment from the server and this lead to deadlock situation. Which timer is used and ... , client C. Persistenttimer, client D. Keep alive timer, client Answer given : C It should be B right ?

Assume in TCP client is sending segment toserver. After successfully receiving segmentsfrom client, server is waiting for next segments and clients is also waiting for ac...

623 views

commented Jan 11, 2019

0 answers

16

Doubt : Indexing (Test By Bikram Sir )
I used multilevel indexing and got 5+1 i e 6 block transfers. answer given is 18+1 i.e 19 how to know which method to be used ? ( is that 19 bcoz of 'BST' ? )

I used multilevel indexing and got 5+1 i e 6 block transfers.answer given is 18+1 i.e 19 how to know which method to be used ? ( is that 19 bcoz of 'BST' ? )

466 views

commented Jan 10, 2019

1 answer

17

Probability
Suppose we want to pick two numbers from {1,2……,100} randomly . The probability that sum of the two numbers is divisible by 5 is _________________

Suppose we want to pick two numbers from {1,2……,100} randomly . The probability that sum of the two numbers is divisible by 5 is _________________

2.7k views

commented Jan 10, 2019

1 answer

18

Test by Bikram | Mock GATE | Test 1 | Question: 32
Fill in the blanks in the procedure: void Prod (Element Type X, Priority Queue H) { int i; if (IsFull(H)) { Error ("Priority queue is full"); return; } for (i=++H -> size; H -> Elements [i/2]>X; i/=2) _________________ } ... 2]=H$\rightarrow$ Elements $[i/2]$; $H$\rightarrow$ Elements $[i^2 ]=X;$ $H$\rightarrow$ Elements $[i]=X;$

Fill in the blanks in the procedure:void Prod (Element Type X, Priority Queue H) { int i; if (IsFull(H)) { Error ("Priority queue is full"); return; } for (i=++H - size; ...

1.1k views

commented Jan 10, 2019

3 answers

19

Test by Bikram | Mock GATE | Test 1 | Question: 18
Which of the following is not a Boolean algebra under the operation '\'? \: is a divisor, $D_{p}$: divisor of $p$ $\left \{ D18; \ \right \}$ $\left \{ D21; \ \right \}$ $\left \{ D110; \ \right \}$ $\left \{ D91; \ \right \}$

Which of the following is not a Boolean algebra under the operation '\'? \: is a divisor, $D_{p}$: divisor of $p$$\left \{ D18; \ \right \}$$\left \{ D21; \ \right \}$$...

1.9k views

commented Jan 10, 2019

2 answers

20

Test by Bikram | Mock GATE | Test 1 | Question: 9
Consider the following program fragment : int foo(int ,int ); int a; int ar[4] = { 1,0, 2,3}; main() { a = 0; foo(ar[a], ar[ar[a]]); printf("%d,%d ,%d,%d ", ar[0] , ar[1] ,ar[2] , ar[3]); } foo(int x, int y) { x= x+1; y ... be printed by the program if parameter passed by call by name? $1, 50, 2, 3$ $3, 50, 2, 3$ $3, 50, 3, 4$ $3, 2, 2, 3$

Consider the following program fragment :int foo(int ,int ); int a; int ar[4] = { 1,0, 2,3}; main() { a = 0; foo(ar[a], ar[ar[a]]); printf("%d,%d ,%d,%d ", ar[0] , ar ,a...

1.6k views

commented Jan 10, 2019

2 answers

21

GATE CSE 2013 | Question: 42
What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f (int &x, int c) { c = c - 1; if (c==0) return 1; x = x + 1; return f(x,c) * x; }

What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second ...

21.2k views

commented Jan 9, 2019

0 answers

22

Site Feedback
Just a small tweak. Probably on mobile browser ( i use chrome and found the same when I switched to desktop site on phone itself) when we use "$" with just a single space left and type further context, things get overlapped. Snapshot :

Just a small tweak.Probably on mobile browser ( i use chrome and found the same when I switched to desktop site on phone itself) when we use "$" with just a single spac...

445 views

commented Jan 8, 2019

0 answers

23

Set Theory Doubt
Approach : 1. Select given number say 1, then find combination of rest of the elements. e.g select 1 , now remaining 4 elements, make subsets of 2 elements and add "1" in each subsets ie C(4,2) = 6. Suggest any another method please.

Approach : 1.Select given number say 1, then find combination of rest of the elements. e.g select 1 , now remaining 4 elements, make subsets of 2 elements and add "1" i...

395 views

commented Jan 8, 2019

0 answers

24

Doubt : Recursion ( snippet by testbook )
Its always a confusion how Recursion works with for loop. Explain a brief.

Its always a confusion how Recursion works with for loop. Explain a brief.

265 views

commented Jan 7, 2019

0 answers

25

Digital Logic made easy
Consider the circuit given below: MSB and LSB of mod 10 ripple counter act as clock to ripple down and up counter respectively. Initially all the counters were cleared and output of comparator was A=B. The clock pulse is applied. Find the minimum no of clock pulses required to make A=B again.

Consider the circuit given below:MSB and LSB of mod 10 ripple counter act as clock to ripple down and up counter respectively. Initially all the counters were cleared and...

2.6k views

comment edited Jan 7, 2019

0 answers

26

ME OTS : Pipelining
Consider the following statements (I) Execution time for single instruction on six stage pipelined CPU is less than or equal to identical non- pipelined CPU. (ii) In a uniform delay pipeline execution time for a single instruction is equal to the ... if stage delay exist then for single execution, pipeline time will not be equal. Hence 2nd statement wont be true always.

Consider the following statements(I) Execution time for single instruction on six stagepipelined CPU is less than or equal to identical non-pipelined CPU.(ii) In a unifor...

1.2k views

commented Jan 6, 2019

0 answers

27

Doubt : GBN packet retransmission
Station A wants to send 10 packets to station B using Go Back N ARQ, where N = 4. Moreover consider every 3 rd packet lost while transmission (ACK's from B never get lost). Calculate the number of transmissions that A has to make in GBN respectively to ensure safe delivery to B. ( This has been already asked but need some clarification ) Approach :

Station A wants to send 10 packets to station B using Go Back N ARQ, where N = 4. Moreover consider every 3 rd packet lost while transmission (ACK's from B never get lost...

566 views

commented Jan 5, 2019

2 answers

28

ME OTS 1 : Finite Automata
Doubt: ( Even if we take compliment , its wont satisfy it )

Doubt: ( Even if we take compliment , its wont satisfy it )

603 views

commented Jan 5, 2019

1 answer

29

ME OTS : Memory Mapped I/O
Which of the following best characterizes about memory mapped I/O? A.Additional hardware for bus is required to control the 1/0 bus and memory bus. B.Some of the address space is separated from the memory space and assigned them to II/0 ... differentiate between memory and I/O different control signals is used for memory and I/0. Please explain the options in short.

Which of the following best characterizes about memory mapped I/O?A.Additional hardware for bus is required to control the 1/0 bus and memory bus.B.Some of the address sp...

838 views

asked Jan 5, 2019

0 answers

30

Group Theory : Lagrange's Theorem
Please explain me with simple 1-2 examples how order of a subgroup divide order of a group and why it is always true.

Please explain me with simple 1-2 examples how order of a subgroup divide order of a group and why it is always true.

341 views

asked Jan 5, 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