Recent posts tagged gateoverflow

1
As Arjun sir explains it, $\Sigma$ is a set. $\Sigma^*$ is a language, that is, a set of strings.Let $\Sigma = \{a,b\}$,Then, $\Sigma^* = \Bigl \{\epsilon,a,b,aa,ab,ba,bb...
4
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 w...
6
For answering there is no need to execute the query, we can directly answer this as $2$How?Group by Student_NamesIt means all name that are same should be kept in one row...
7
Why 6 bits for addresses for 11 address instruction?
8
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 ...
9
Choose the most appropriate word from the options given below to complete the following sentence:If we manage to __________ our natural resources, we would leave a better...
10
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 prio...
11
The roots are $x=1, x=2$, and $x=3.$So, polynomial is $f(x) = (x-1)(x-2)(x-3)$$f(0) = -6, f(4) = 6$So, $f(0)f(4) < 0$.Correct Answer: $A$
12
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 $...
13
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...
14
Let $(A, *)$ be a semigroup, Furthermore, for every $a$ and $b$ in $A$, if $a \neq b$, then $a*b \neq b*a$.Show that for every $a$ in $A$, $a*a=a$Show that for every $a$,...
To see more, click for the full list of questions or popular tags.