Register
Filter

Recent activity by IamDRD

8 answers
2
GATE CSE 2013 | Question: 27
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$
What is the logical translation of the following statement?"None of my friends are perfect."$∃x(F (x)∧ ¬P(x))$$∃ x(¬ F (x)∧ P(x))$$ ∃x(¬F (x)∧¬P(x))$$ ¬�...
4 answers
3
GATE CSE 2020 | Question: 28
Consider the Boolean function $z(a,b,c)$. Which one of the following minterm lists represents the circuit given above? $z=\sum (0,1,3,7)$ $z=\sum (1,4,5,6,7)$ $z=\sum (2,4,5,6,7)$ $z=\sum (2,3,5)$
Consider the Boolean function $z(a,b,c)$. Which one of the following minterm lists represents the circuit given above?$z=\sum (0,1,3,7)$$z=\sum (1,4,5,6,7)$$z=\sum (2,4,5...
9 answers
4
GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order?$\Theta(n)$$\Theta(n...
2 answers
6
GATE CSE 2020 | Question: 6
What is the worst case time complexity of inserting $n^{2}$ elements into an AVL-tree with $n$ elements initially? $\Theta (n^{4})$ $\Theta (n^{2})$ $\Theta (n^{2}\log n)$ $\Theta (n^{3})$
What is the worst case time complexity of inserting $n^{2}$ elements into an AVL-tree with $n$ elements initially?$\Theta (n^{4})$$\Theta (n^{2})$$\Theta (n^{2}\log n)$$\...
3 answers
7
GATE CSE 2020 | Question: 1
Consider the functions $e^{-x}$ $x^{2}-\sin x$ $\sqrt{x^{3}+1}$ Which of the above functions is/are increasing everywhere in $[ 0,1]$? Ⅲ only Ⅱ only Ⅱ and Ⅲ only Ⅰ and Ⅲ only
Consider the functions $e^{-x}$$x^{2}-\sin x$$\sqrt{x^{3}+1}$Which of the above functions is/are increasing everywhere in $[ 0,1]$?Ⅲ onlyⅡ onlyⅡ and Ⅲ onlyⅠ a...
4 answers
8
GATE CSE 2020 | Question: GA-1
Raman is confident of speaking English _______six months as he has been practising regularly_______the last three weeks during, for for, since for, in within, for
Raman is confident of speaking English _______six months as he has been practising regularly_______the last three weeksduring, forfor, sincefor, inwithin, for
7 answers
9
GATE CSE 2019 | Question: GA-1
The expenditure on the project _____ as follows: equipment Rs.$20$ lakhs, salaries Rs.$12$ lakhs, and contingency Rs.$3$ lakhs. break down break breaks down breaks
The expenditure on the project _____ as follows: equipment Rs.$20$ lakhs, salaries Rs.$12$ lakhs, and contingency Rs.$3$ lakhs.break downbreakbreaks downbreaks
8 answers
16
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(\...
2 answers
20
Graph Connectivity
Consider the given statements S1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G. S2:In a simple graph G, if degree of each vertex is 3 then the graph G is connected. Which of the following is/are true?
Consider the given statementsS1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G.S2:In a simple graph G, if degree of e...