Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Gangani_Son
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Gangani_Son
0
votes
1
ISRO2008-25
In the expression $\overline{\text{A}}(\overline{\text{A}}+\overline{\text{B}})$ by writing the first term $\text{A}$ as $\text{A + 0}$, the expression is best simplified as $\text{A+AB}$ $\text{AB}$ $\text{A}$ $\text{A+B}$
In the expression $\overline{\text{A}}(\overline{\text{A}}+\overline{\text{B}})$ by writing the first term $\text{A}$ as $\text{A + 0}$, the expression is best simplified...
4.8k
views
answered
Dec 18, 2018
Digital Logic
isro2008
digital-logic
boolean-algebra
+
–
0
votes
2
GATE CSE 2003 | Question: 88
In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\geqslant 3$, and TwoLog_n is initialized to the value of $2^*\lceil \log_2(n) \rceil$ for (k = 3; k ... $\left\{m \mid m \leq n, \text{m is prime} \right\}$ { }
In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\...
12.1k
views
answered
Dec 14, 2018
Algorithms
gatecse-2003
algorithms
identify-function
normal
+
–
0
votes
3
GATE IT 2005 | Question: 51
Let $T(n)$ be a function defined by the recurrence $T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and $T(1) = 1$ Which of the following statements is TRUE? $T(n) = \Theta(\log n)$ $T(n) = \Theta(\sqrt n)$ $T(n) = \Theta(n)$ $T(n) = \Theta(n \log n)$
Let $T(n)$ be a function defined by the recurrence$T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and$T(1) = 1$Which of the following statements is TRUE?$T(n) = \Theta(\log n)$...
9.2k
views
answered
Dec 6, 2018
Algorithms
gateit-2005
algorithms
recurrence-relation
easy
+
–
0
votes
4
graph
You are given a graph containing n vertices and m edges and given that the graph doesn’t contain cycle of odd length. Time Complexity of the best known algorithm to find out whether the graph is bipartite or not is ? A O(m+n) B O(1) C O(mn) D O(n2 plz explain this question
You are given a graph containing n vertices and m edges and given that the graph doesn’t contain cycle of odd length. Time Complexity of the best known algorithm to fin...
2.9k
views
answered
Dec 4, 2018
Algorithms
algorithm-design
time-complexity
+
–
1
votes
5
GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512$ bytes, and index pointers are of size $4$ bytes. Given the scenario, what ... of the degree (i.e. number of pointers per node) of the $B^+$ - tree? $16$ $42$ $43$ $44$
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512...
14.0k
views
answered
Nov 30, 2018
Databases
gatecse-2002
databases
b-tree
normal
ugcnetcse-june2012-paper2
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register