Log In

Recent posts tagged gateoverflow

False : Consider $E: \{1,2,3,4\}$, $F:\{3,4,5,6\}$ $f(E) = \{5,6,7,8\}$ $f(F)=\{7,8,11,6\}$ $f(E \cap F) = \{7,8\}$ where as, $f(E) \cap f(F) = \{6,7,8\}$ Becomes TRUE only when $f$ ... $ f(E \cap F) \subseteq f(E) \cap f(F)$ $\subseteq$ becomes $=$ only when $f$ is one-one - when the mappings are unique for each element.
posted May 10 in From GO Admins gatecse 3,926 views
For answering there is no need to execute the query, we can directly answer this as $2$ How? Group by Student_Names It means all name that are same should be kept in one row. There are $3$ names. But in that there is a duplicate with Raj being repeated $\implies$ Raj produces ...
posted Jun 30, 2019 in 2019 Astitva Srivastava 1,895 views
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having all edges of maximum ... in $G$ having all edges of maximum weight. Edge $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
posted Mar 18, 2018 in 2018 Rishabh Gupta 2 38,572 views
One of the header fields in an IP datagram is the Time-to-Live (TTL) field. Which of the following statements best explains the need for this field? It can be used to prioritize packets. It can be used to reduce delays. It can be used to optimize throughput. It can be used to prevent packet looping.
posted Jul 20, 2017 in Preparation Experience Ritwik Mishra 1 2,383 views
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$. which one of the following statements is true? There must exist a vertex $w$ adjacent to ... There must exist a cycle in $G$ containing $u$ and $ν$ There must exist a cycle in $G$ containing $u$ and all its neighbours in $G$
posted May 7, 2017 in Others Arjun 8,784 views
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$ ... $L$ can take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation
posted Apr 29, 2017 in Others gatecse 230 views
To see more, click for the full list of questions or popular tags.