Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Nit9
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;
what is the meaning of following query:select R.* from R,S where R.a = S.a and is unique R;
535
views
answered
Dec 15, 2017
Databases
sql
databases
+
–
0
votes
2
Memory Management
Reply with solution as soon as possible...
Reply with solution as soon as possible...
533
views
answered
Feb 4, 2017
1
votes
3
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??
Q. consider the following problem:a) Eulerian pathb) 2- SATc) Constraint reachibiltyd)graph coloringnumber of problem which is polynomial solvable?? i am get only b (2-SA...
426
views
answered
Dec 20, 2016
Theory of Computation
made-easy-test-series
algorithms
p-np-npc-nph
+
–
1
votes
4
GATE CSE 2007 | Question: 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? ... immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.
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 ...
23.5k
views
answered
Dec 15, 2016
Databases
gatecse-2007
databases
relational-calculus
normal
+
–
0
votes
5
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?
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...
355
views
answered
Dec 3, 2016
DS
binary-heap
+
–
0
votes
6
ace test dbms
351
views
answered
Dec 3, 2016
0
votes
7
gate 1999
RAM is combinational circuit and PLA is Sequential circuit ?
RAM is combinational circuit and PLA is Sequential circuit ?
340
views
answered
Nov 30, 2016
0
votes
8
Record Route
457
views
answered
Jan 29, 2016
Computer Networks
computer-networks
+
–
3
votes
9
GATE CSE 2004 | Question: 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 ... $\{1\}, \{1, 3\}$ $\{1\}, \{1, 3\}, \{1, 2, 3, 4\}, \{1, 2, 3, 5\}$
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,...
12.9k
views
answered
Dec 28, 2015
Set Theory & Algebra
gatecse-2004
set-theory&algebra
partial-order
normal
+
–
9
votes
10
GATE CSE 1998 | Question: 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 ... $\left\langle\left\{\Pi_1, \Pi_2, \Pi_3, \Pi_4\right\}, \text{ refines } \right\rangle$.
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 equiv...
11.5k
views
answered
Dec 27, 2015
Set Theory & Algebra
gate1998
set-theory&algebra
normal
partial-order
descriptive
+
–
2
votes
11
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 ... ? Please give exact book name you are suggesting. 3. Are there any good FREE video lectures available ?
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 Ab...
4.6k
views
answered
Dec 1, 2015
Verbal Aptitude
verbal-aptitude
+
–
6
votes
12
GATE IT 2006 | Question: 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$
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...
6.4k
views
answered
Nov 25, 2015
Databases
gateit-2006
databases
database-normalization
normal
+
–
39
votes
13
GATE CSE 2003 | Question: 9
Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$? $11100111$ $11100100$ $11010111$ $11011011$
Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$?$11100111$$11100100$$11010111$$11011011$
10.4k
views
answered
Nov 8, 2015
Digital Logic
gatecse-2003
digital-logic
number-representation
normal
+
–
15
votes
14
GATE IT 2004 | Question: 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 ... P(empty), V(full) P(empty), V(full), P(empty), V(full) P(empty), V(full), P(full), V(empty)
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$, an...
7.1k
views
answered
Oct 18, 2015
Operating System
gateit-2004
operating-system
process-synchronization
normal
+
–
4
votes
15
GATE CSE 2007 | Question: 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})$
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(\...
26.6k
views
answered
Oct 6, 2015
Algorithms
gatecse-2007
algorithms
recursion
time-complexity
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register