Answers by Nit9 - GATE Overflow

0 votes

1

SQL QUERY
what is the meaning of following query: select R.* from R,S where R.a = S.a and is unique R;

answered Dec 15, 2017 in Databases | 203 views

0 votes

2

toc decidability
CS4820 Spring 2013 Notes on Turing Machines 19/26 (e) ever moves its head more than 481 tape cells away from the left endmarker on input ε ? (f) accepts the null string ε ? (g) accepts any string at all?(h) accepts every string?(i) accepts a ﬁnite set?(j) accepts a recursive set? (k) is equivalent to a Turing machine with a shorter description???

answered Dec 3, 2017 in Theory of Computation | 47 views

0 votes

3

Memory Management
Reply with solution as soon as possible...

answered Feb 4, 2017 in Operating System | 159 views

+1 vote

4

MadeEasy Test Series: Algorithms - P Np Npc Nph
Q. consider the following problem: a) Eulerian path b) 2- SAT c) Constraint reachibilty d)graph coloring number of problem which is polynomial solvable?? i am get only b (2-SAT) somy answer is 1 but answer given 2 here also eulerian path ?? how to appraoch these type of question Plz explain??

answered Dec 20, 2016 in Theory of Computation | 99 views

+1 vote

5

GATE2007-60
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? ... no immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.

answered Dec 15, 2016 in Databases | 7.5k views

0 votes

6

Self Made
Suppose we are given a set of elements to be inserted in a Max Heap. What is the approach to follow from the following? 1.Insert an element, apply HEAPIFY, insert the next element, again apply HEAPIFY, and so on. 2. Insert all the elements and once done, apply BUILD-MAX-HEAP. What is the correct approach?

answered Dec 3, 2016 in DS | 68 views

0 votes

7

answered Dec 3, 2016 in Databases | 89 views

0 votes

8

gate 1999
RAM is combinational circuit and PLA is Sequential circuit ?

answered Nov 30, 2016 in Digital Logic | 182 views

0 votes

9

answered Jan 29, 2016 in Computer Networks | 113 views

+3 votes

10

GATE2004-73
The inclusion of which of the following sets into $S = \left\{ \left\{1, 2\right\}, \left\{1, 2, 3\right\}, \left\{1, 3, 5\right\}, \left\{1, 2, 4\right\}, \left\{1, 2, 3, 4, 5\right\} \right\} $ is necessary and sufficient to make $S$ a complete lattice under the partial order defined by set containment ... $\{1\}, \{1, 3\}$ $\{1\}, \{1, 3\}, \{1, 2, 3, 4\}, \{1, 2, 3, 5\}$

answered Dec 28, 2015 in Set Theory & Algebra | 2.8k views

+9 votes

11

GATE1998-11
Suppose $A = \{a, b, c, d\}$ and $\Pi_1$ is the following partition of A $\Pi_1 = \left\{\left\{a, b, c\right\}\left\{d\right\}\right\}$ List the ordered pairs of the equivalence relations induced by $\Pi_1$. Draw the graph of the above equivalence relation ... $\left\langle\left\{\Pi_1, \Pi_2, \Pi_3, \Pi_4\right\}, \text{ refines } \right\rangle$.

answered Dec 28, 2015 in Set Theory & Algebra | 2k views

+2 votes

12

How To prepare For English- Verbal Ability
I've realized that Answering Verbal questions in GATE without any preparation will mostly lead to negative marks ! So trying to improve if I could ! Syllabus for Verbal Ability: English grammar, sentence completion, verbal analogies, word groups ... view ? Please give exact book name you are suggesting. 3. Are there any good FREE video lectures available ?

answered Dec 2, 2015 in Verbal Ability | 2.7k views

+5 votes

13

GATE2006-IT-60
Consider a relation R with five attributes V, W, X, Y, and Z. The following functional dependencies hold: VY→ W, WX → Z, and ZY → V. Which of the following is a candidate key for R? VXZ VXY VWXY VWXYZ

answered Nov 26, 2015 in Databases | 760 views

+24 votes

14

GATE2003-9
Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$? $11100111$ $11100100$ $11010111$ $11011011$

answered Nov 8, 2015 in Digital Logic | 2.4k views

+15 votes

15

GATE2004-IT-65
The semaphore variables full, empty and mutex are initialized to $0$, $n$ and $1$, respectively. Process P1 repeatedly adds one item at a time to a buffer of size $n$, and process P2 repeatedly removes one item at a time from the same buffer using the programs given below. In the ... , P(empty), V(full) P(empty), V(full), P(empty), V(full) P(empty), V(full), P(full), V(empty)

answered Oct 18, 2015 in Operating System | 2.2k views

+4 votes

16

GATE2007-44
In the following C function, let $n \geq m$. int gcd(n,m) { if (n%m == 0) return m; n = n%m; return gcd(m,n); } How many recursive calls are made by this function? $\Theta(\log_2n)$ $\Omega(n)$ $\Theta(\log_2\log_2n)$ $\Theta(\sqrt{n})$

answered Oct 7, 2015 in Algorithms | 6.4k views

50,645 questions

56,542 answers

195,692 comments

101,528 users