Recent activity by amitqy / GATE Overflow for GATE CSE

3 answers

1

GATE CSE 2017 Set 1 | Question: GA-10
A contour line joins locations having the same height above the mean sea level. The following is a contour plot of a geographical region. Contour lines are shown at $25$ m intervals in this plot. If in a flood, the water level rises to $525$ m, which of the villages $P, Q, R, S, T$ get submerged? $P, Q$ $P, Q, T$ $R, S, T$ $Q, R, S$

A contour line joins locations having the same height above the mean sea level. The following is a contour plot of a geographical region. Contour lines are shown at $25$ ...

7.8k views

commented Apr 22, 2019

1 answer

2

made easy test series - lossless join and dependency preserving
How is A answer?

How is A answer?

1.0k views

answer selected Apr 13, 2019

0 answers

3

M.tech placement
Looking for high paid jobs during my m.tech from iit ropar, what things should i do for getting into highly paid companies?

Looking for high paid jobs during my m.tech from iit ropar, what things should i do for getting into highly paid companies?

1.5k views

commented Apr 11, 2019

3 answers

4

UGC NET CSE | December 2018 | Part 2 | Question: 21
The solution of recurrence relation: $T(n) = 2T (\sqrt{n}) + \lg(n)$ is $O(\lg(n))$ $O(n \lg (n))$ $O(\lg (n) \lg (n))$ $O(\lg (n) \lg(\lg (n)))$

The solution of recurrence relation:$T(n) = 2T (\sqrt{n}) + \lg(n)$ is$O(\lg(n))$$O(n \lg (n))$$O(\lg (n) \lg (n))$$O(\lg (n) \lg(\lg (n)))$

885 views

commented Mar 31, 2019

2 answers

5

Allen Career Institute:General Aptitude
Select the best alternative Motorcycle : Battery : : Life : ? (1) Star (2) Moon (3) Sun (4) Earth I given answer as (4), but correct one is (3) why?

Select the best alternative Motorcycle : Battery : : Life : ?(1) Star(2) Moon(3) Sun(4) EarthI given answer as (4), but correct one is (3) why?

586 views

commented Mar 30, 2019

2 answers

6

Binary Search - Average Number of Comparisons.
Let you are given an array of nine elements in increasing order. If you want to implement binary search on the given array of element then the number of comparisons per successful search on an average will be: Average is 2.78, should I answer this question with or without rounding off 2.78, as number of comparisons is an integral value?

Let you are given an array of nine elements in increasing order. If you want to implement binary search on the given array of element then the number of comparisons per s...

2.4k views

commented Mar 30, 2019

3 answers

7

GATE CSE 2013 | Question: 15
An index is clustered, if it is on a set of fields that form a candidate key it is on a set of fields that include the primary key the data records of the file are organized in the same order as the data entries of the index the data records of the file are organized not in the same order as the data entries of the index

An index is clustered, ifit is on a set of fields that form a candidate keyit is on a set of fields that include the primary keythe data records of the file are organized...

16.0k views

commented Mar 25, 2019

4 answers

8

GATE CSE 2013 | Question: 12
The transport layer protocols used for real time multimedia, file transfer, $\textsf{DNS}$ and email, respectively are $\textsf{TCP, UDP, UDP}\; \text{and}\; \textsf{TCP}$ $\textsf{UDP, TCP, TCP}\; \text{and}\; \textsf{UDP}$ $\textsf{UDP, TCP, UDP}\; \text{and}\; \textsf{TCP}$ $\textsf{TCP, UDP, TCP}\;\text{and}\; \textsf{UDP}$

The transport layer protocols used for real time multimedia, file transfer, $\textsf{DNS}$ and email, respectively are$\textsf{TCP, UDP, UDP}\; \text{and}\; \textsf{TCP}$...

12.1k views

commented Mar 25, 2019

5 answers

9

GATE CSE 2013 | Question: 10
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates the process priorities every $T$ time units and decides the next process ... is equivalent to the shortest-job-first algorithm. This algorithm is equivalent to the shortest-remaining-time-first algorithm.

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates th...

29.0k views

commented Mar 25, 2019

5 answers

10

GATE CSE 2010 | Question: 30
Suppose the predicate $F(x, y, t)$ is used to represent the statement that person $x$ can fool person $y$ at time $t$. Which one of the statements below expresses best the meaning of the formula, $\qquad∀x∃y∃t(¬F(x,y,t))$ Everyone can ... time No one can fool everyone all the time Everyone cannot fool some person all the time No one can fool some person at some time

Suppose the predicate $F(x, y, t)$ is used to represent the statement that person $x$ can fool person $y$ at time $t$.Which one of the statements below expresses best the...

82.5k views

commented Mar 19, 2019

0 answers

11

Cache Memory and Arrays
Can someone please provide a link to an article or a video explaining cache and arrays concept. Im having a hard time understanding that concept.

Can someone please provide a link to an article or a video explaining cache and arrays concept. Im having a hard time understanding that concept.

313 views

asked Mar 16, 2019

7 answers

12

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.9k views

commented Mar 14, 2019

2 answers

13

GATE CSE 2009 | Question: 10
The essential content(s) in each entry of a page table is / are Virtual page number Page frame number Both virtual page number and page frame number Access right information

The essential content(s) in each entry of a page table is / areVirtual page numberPage frame numberBoth virtual page number and page frame numberAccess right information

11.9k views

commented Mar 14, 2019

4 answers

14

TCP-congestion control
Assume a scenario where the size of congestion window of a TCP connection be 40 KB when a timeout occurs. The maximum segment size (MSS) be 2 KB. Let the propagation delay be 200 msec. The time taken by the TCP connection to get back to 40 ... is 6000msec.I am taking MSS as 2KB.ls someone explain NOTE:same question also asked here https://gateoverflow.in/1794/gate2014-1-27

Assume a scenario where the size of congestion window of a TCP connection be 40 KB when a timeout occurs. The maximum segment size (MSS) be 2 KB. Let the propagation dela...

3.6k views

commented Mar 13, 2019

1 answer

15

Congestion control
Consider the effect of using slow start on a line with 10 msec round trip time. The receiver window and the size of congestion window are set to 38 KB and 36 KB respectively. Sender side threshold is set to 18 KB. After 8 transmission a timeout occurs, after time out, the time taken to send first full window of 18 KB is ________ (in msec).

Consider the effect of using slow start on a line with 10 msec round trip time. Thereceiver window and the size of congestion window are set to 38 KB and 36 KBrespectivel...

2.2k views

commented Mar 13, 2019

2 answers

16

GATE IT 2008 | Question: 68
Which of the following statements are TRUE? S1: TCP handles both congestion and flow control S2: UDP handles congestion but not flow control S3: Fast retransmit deals with congestion but not flow control S4: Slow start mechanism deals with both congestion and flow control $S1$, $S2$ and $S3$ only $S1$ and $S3$only $S3$and $S4$ only $S1$, $S3$ and $S4$ only

Which of the following statements are TRUE?S1: TCP handles both congestion and flow controlS2: UDP handles congestion but not flow controlS3: Fast retransmit deals wit...

16.1k views

commented Mar 12, 2019

1 answer

17

Programming in C: What is the output of program? Explain for all the statements
int main() { int m=44; int *p=&m; int &r=m; int n=(*p)++; int *q=p-1; r=--*(p)+1; ++*q; printf("m=%d n=%d r=%d",m,n,r); return 0; } Options: $m=44,\ n=46,\ r=45$ $m=45,\ n=44,\ r=45$ $m=46,\ n=44,\ r=46$ $m=46,\ n=43,\ r=46$

int main() { int m=44; int *p=&m; int &r=m; int n=(*p)++; int *q=p-1; r= *(p)+1; ++*q; printf("m=%d n=%d r=%d",m,n,r); return 0; } Options:$m=44,\ n=46,\ r=45$$m=45,\ n=4...

1.6k views

commented Mar 10, 2019

2 answers

18

Ace Test Series: Set Theory & Algebra - Relations
Ans:B Symmetric closure of R 1. It is symmetric 2. It contains R 3.Minimal relation satisfying 1 and 2 If we consider B, then condition 2 may be violated. Therefore I think the answer should be D.

Ans:BSymmetric closure of R1. It is symmetric2. It contains R3.Minimal relation satisfying 1 and 2If we consider B, then condition 2 may be violated. Therefore I think th...

1.3k views

commented Mar 10, 2019

2 answers

19

GATE CSE 2008 | Question: 53
Which of the following are regular sets? $\left\{a^nb^{2m} \mid n \geq 0, m \geq 0 \right\}$ $\left\{a^nb^m \mid n =2m \right\}$ $\left\{a^nb^m \mid n \neq m \right\}$ $\left\{xcy \mid x, y, \in \left\{a, b\right\} ^* \right\}$ I and IV only I and III only I only IV only

Which of the following are regular sets?$\left\{a^nb^{2m} \mid n \geq 0, m \geq 0 \right\}$$\left\{a^nb^m \mid n =2m \right\}$$\left\{a^nb^m \mid n \neq m \right\}$$\lef...

9.7k views

commented Mar 8, 2019

5 answers

20

GATE CSE 2008 | Question: 15
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$? $\neg \exists t \in r \left(P\left(t\right)\right)$ $\exists t \notin r \left(P\left(t\right)\right)$ ... $\exists t \notin r \left(\neg P\left(t\right)\right)$ I only II only III only III and IV only

Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$?$\neg \exists t \in r \left(P\left(t\ri...

14.3k views

commented Mar 7, 2019

1 answer

21

Delayed Branching
can some one tell me any good resource to study delayed branching in computer architecture ?? Especially numerical examples.

can some one tell me any good resource to study delayed branching in computer architecture ?? Especially numerical examples.

1.2k views

answered Mar 7, 2019

1 answer

22

Threads
According to me Answer is C, because Multithreading i.e. User application threads cannot use different processors because processor see all the thread of user process as part of one process so it wont execute on Different Processors. Am i right ? But answer given is (A)

According to me Answer is C, because Multithreading i.e. User application threads cannot use different processors because processor see all the thread of user process as ...

1.7k views

commented Mar 6, 2019

5 answers

23

GATE IT 2006 | Question: 12
In the working-set strategy, which of the following is done by the operating system to prevent thrashing? It initiates another process if there are enough extra frames. It selects a process to suspend if the sum of the sizes of the working-sets exceeds the total number of available frames. I only II only Neither I nor II Both I and II

In the working-set strategy, which of the following is done by the operating system to prevent thrashing?It initiates another process if there are enough extra frames.It ...

10.7k views

answered Mar 2, 2019

2 answers

24

GATE IT 2006 | Question: 8
Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O band-width? Transparent DMA and Polling interrupts Cycle-stealing and Vectored interrupts Block transfer and Vectored interrupts Block transfer and Polling interrupts

Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O band-width?Transparent DMA and Polling interruptsCycle-stealing an...

13.1k views

commented Mar 2, 2019

2 answers

25

Madeeasy_Subject_Test_digitalLogic
The difference between 201 and next larger double precision number is 2$^P$. If IEEE double precision format is used then the value of P is ______________________

The difference between 201 and next larger double precision number is 2$^P$.If IEEE double precision format is used then the value of P is ______________________

1.8k views

commented Feb 27, 2019

8 answers

26

GATE CSE 2007 | Question: 45
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$

What is the $\text{time complexity}$ of the following recursive function?int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); ...

32.2k views

commented Feb 26, 2019

6 answers

27

GATE IT 2004 | Question: 86
In the TCP/IP protocol suite, which one of the following is NOT part of the IP header? Fragment Offset Source IP address Destination IP address Destination port number

In the TCP/IP protocol suite, which one of the following is NOT part of the IP header?Fragment OffsetSource IP addressDestination IP addressDestination port number

6.3k views

commented Feb 21, 2019

1 answer

28

Self-Doubt Priority interrupts
Under the SOFTWARE METHOD – POLLING heading. What is the meaning of this line? “In this method, all interrupts are serviced by branching to the same service program”. https://www.geeksforgeeks.org/priority-interrupts-sw-polling-daisy-chaining/

Under the SOFTWARE METHOD – POLLING heading.What is the meaning of this line?“In this method, all interrupts are serviced by branching to the same service program”....

488 views

asked Feb 16, 2019

4 answers

29

GATE CSE 2005 | Question: 5
A program $P$ reads in $500$ integers in the range $[0, 100]$ representing the scores of $500$ students. It then prints the frequency of each score above $50$. What would be the best way for $P$ to store the frequencies? An array of $50$ numbers An array of $100$ numbers An array of $500$ numbers A dynamically allocated array of $550$ numbers

A program $P$ reads in $500$ integers in the range $[0, 100]$ representing the scores of $500$ students. It then prints the frequency of each score above $50$. What would...

20.9k views

commented Feb 16, 2019

9 answers

30

GATE CSE 2005 | Question: 61
Consider line number $3$ of the following C-program. int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ } Identify the compiler’s response about this line while creating the object-module: No compilation error Only a lexical error Only syntactic errors Both lexical and syntactic errors

Consider line number $3$ of the following C-program.int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ }Identify the compiler’s response ab...

22.0k views

commented Feb 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