Register
Filter

Recent activity by taurus05

0 answers
4
Testbook Test Series
1 answer
5
Made Easy Mock Test
1 answer
8
Testbook Test Series
1 answer
9
Testbook Test Series
1 answer
10
Testbook Test Series
Consider the following C program: #include <stdio.h> int r( ){ static int num = 7; return num--; } int main ( ) { for (r( ) ;r ( ) ;r ( ) ) printf(“ % d”, r( ) ); return 0; } Which one of the following values will be displayed on execution of the programs? 41 52 63 630
Consider the following C program:#include <stdio.h>int r( ){static int num = 7;return num ;}int main ( ) {for (r( ) ;r ( ) ;r ( ) )printf(“ % d”, r( ) );return 0;}Whi...
2 answers
11
Is network security topic in CN part of GATE 2022?
I read the PDF but couldn't find anything mentioned about it. Kindly confirm.
I read the PDF but couldn't find anything mentioned about it. Kindly confirm.
8 answers
15
GATE CSE 2008 | Question: 2
If $P, Q, R$ are subsets of the universal set U, then $(P\cap Q\cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c$ is $Q^c \cup R^c$ $P \cup Q^c \cup R^c$ $P^c \cup Q^c \cup R^c$ U
If $P, Q, R$ are subsets of the universal set U, then $$(P\cap Q\cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c$$ is$Q^c \cup R^c$$P \cup Q^c \cup R^c$$P^c \cup Q^c \c...
6 answers
16
GATE CSE 1995 | Question: 1.19
Let $R$ be a symmetric and transitive relation on a set $A$. Then $R$ is reflexive and hence an equivalence relation $R$ is reflexive and hence a partial order $R$ is reflexive and hence not an equivalence relation None of the above
Let $R$ be a symmetric and transitive relation on a set $A$. Then$R$ is reflexive and hence an equivalence relation$R$ is reflexive and hence a partial order$R$ is reflex...
1 answer
17
GATE2013 AE: GA-5
Select the pair that best expresses a relationship similar to that expressed in the pair: water: pipe:: cart: road electricity: wire sea: beach music: instrument
Select the pair that best expresses a relationship similar to that expressed in the pair:water: pipe::cart: roadelectricity: wiresea: beachmusic: instrument
8 answers
18
GATE IT 2004 | Question: 5
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices? $n-1$ $n$ $n+1$ $2n-1$
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices?$n-1$$n$$n+1$$2n-1$
6 answers
19
GATE CSE 2002 | Question: 1.4
The minimum number of colours required to colour the vertices of a cycle with $n$ nodes in such a way that no two adjacent nodes have the same colour is $2$ $3$ $4$ $n-2 \left \lfloor \frac{n}{2} \right \rfloor+2$
The minimum number of colours required to colour the vertices of a cycle with $n$ nodes in such a way that no two adjacent nodes have the same colour is$2$$3$$4$$n-2 \lef...