gate 2018 GATE 2019 gate 2016 gate 2016 set 1 GATE 2017 SET 1 GATE 2017 SET2 GATE 2015 SET 1 GATE 2015 SET 2 GATE 2015 SET3 GATE 2014 SET 1 GATE 2014 SET 2 GATE 2013 gate 2009 GATE 2012 gate 2010 GATE 2019 GATE 2014 SET 3 gate 2011 GATE 2008 CS GATE 2008 IT GATE 2007 CS GATE 2007 IT GATE 2006 CS GATE 2006 IT GATE 2005 CS GATE 2005 IT GATE 2004 CS

Data Structures Algorithms operating systems computer organization Computer Networks DBMS Graph Theory

typedef struct node
{
    int data;
    node* next ;
} node;

void join(node* m, node* n)
{
    node* p = n;
    while (p->next != NULL)
    {
        p = p->next;
    }
    p–>next = m;
}

I. Minimum Spanning Tree of G is always unique.
II. Shortest path between any two vertices of G is always unique.

Bit rate of the transmission channel = 1Mbps

Propagation delay from sender to receiver = 0.75 ms
 
Time to process a frame = 0.25ms
 
Number of bytes in the information frame = 1980
   
Number of bytes in the acknowledge frame = 20
 
Number of overhead bytes in the information frame = 20 

(0,128,256,128,0,128,256,128,1,129,257,129,1,129,257,129) 

I. A connected UDP socket can be used to communicate
   with multiple peers simultaneously.
II. A process can successfully call connect function
    again for an already connected UDP socket.

I. Next pointer of front node points to the rear node.
II. Next pointer of rear node points to the front node.

SELECT ta.player FROM top_scorer AS ta
WHERE ta.goals > ALL ( SELECT tb.goals
		       FROM top_scorer AS tb
		       WHERE tb.country = 'Spain' )
      AND ta.goals > ANY (SELECT tc.goals
	       	        FROM top_scorer AS tc
		        WHERE tc.country = 'Germany')