Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
adithya_nayak
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by adithya_nayak
8
answers
1
GATE CSE 2007 | Question: 43
A complete $n-ary$ tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complete $n-ary$ tree. If $L = 41$ and $I = 10$, what is the value of $n$? $3$ $4$ $5$ $6$
A complete $n-ary$ tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complet...
25.8k
views
answered
Nov 23, 2022
DS
gatecse-2007
data-structures
tree
normal
+
–
4
answers
2
GATE2014 AG: GA-9
$X$ is $1$ km northeast of $Y$. $Y$ is $1$ km southeast of $Z$. $W$ is $1$ km west of $Z$. $P$ is $1$ km south of $W$. $Q$ is $1$ km east of $P$. What is the distance between $X$ and $Q$ in km? $1$ $\sqrt{2}$ $\sqrt{3}$ $2$
$X$ is $1$ km northeast of $Y$. $Y$ is $1$ km southeast of $Z$. $W$ is $1$ km west of $Z$. $P$ is $1$ km south of $W$. $Q$ is $1$ km east of $P$. What is the distance bet...
2.6k
views
answered
Nov 16, 2022
Analytical Aptitude
gate2014-ag
analytical-aptitude
direction-sense
normal
+
–
15
answers
3
GATE CSE 2003 | Question: 78
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addres...
47.1k
views
commented
Oct 26, 2022
Operating System
gatecse-2003
operating-system
normal
virtual-memory
+
–
2
answers
4
Cormen Edition 3 Exercise 3.1 Question 3 (Page No. 53)
Explain why the statement, “The running time of algorithm A is at least $O(n^2),$” is meaningless.
Explain why the statement, “The running time of algorithm A is at least $O(n^2),$” is meaningless.
586
views
comment edited
Sep 13, 2022
Algorithms
cormen
algorithms
asymptotic-notation
descriptive
+
–
5
answers
5
GATE CSE 2022 | Question: 46
Consider the relational database with the following four schemas and their respective instances. Student(sNo, sName, dNo) Dept(dNo, dName) Course(cNo, cName, dNo) Register(sNo, cNo) ... SELECT cNo FROM Register WHERE sNo = S.sNo) The number of rows returned by the above $\text{SQL}$ query is ____________.
Consider the relational database with the following four schemas and their respective instances.Student(sNo, sName, dNo) Dept(dNo, dName)Course(cNo, cName, dNo) Register(...
12.4k
views
answer edited
Sep 12, 2022
Databases
gatecse-2022
numerical-answers
databases
sql
2-marks
+
–
3
answers
6
GATE CSE 2012 | Question: 47
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudo-code below is invoked as height (root) to compute the height of a binary tree rooted at the tree pointer root. int height(treeptr n) { if(n == NULL) return -1 ... ; B2: $\max(h1, h2) $ B1: $(1+ \text{height}(n \to \text{ right}))$ ; B2: $\max(h1, h2)$
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudo-code below is invoked as height (root) to compute...
11.0k
views
comment edited
Jul 30, 2022
DS
gatecse-2012
data-structures
binary-tree
normal
+
–
3
answers
7
GATE IT 2007 | Question: 79
Consider the following expression $a\bar d + \bar a \bar c + b\bar cd$ Which of the following expressions does not correspond to the Karnaugh Map obtained for the given expression? $\bar c \bar d+ a\bar d + ab\bar c + \bar a \bar cd$ ... $\bar b\bar c \bar d + ac\bar d + \bar a \bar c + ab\bar c$
Consider the following expression$a\bar d + \bar a \bar c + b\bar cd$Which of the following expressions does not correspond to the Karnaugh Map obtained for the given exp...
5.6k
views
answered
Jun 30, 2022
Digital Logic
gateit-2007
digital-logic
k-map
normal
+
–
6
answers
8
GATE CSE 2000 | Question: 2.11
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$ $xy + yw$ $(w + x) (\bar{w} + y) (\bar{x} + y)$ None of the above
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$$xy + yw$$(w + x) (\bar{w} + y) (\bar{x} + y)$None of t...
7.0k
views
answered
Jun 30, 2022
Digital Logic
gatecse-2000
digital-logic
k-map
normal
+
–
7
answers
9
GATE CSE 2014 Set 3 | Question: 55
Let $\oplus$ denote the exclusive OR (XOR) operation. Let '$1$' and '$0$' denote the binary constants. Consider the following Boolean expression for $F$ over two variables $P$ and $Q$ ... $F$ is $P+Q$ $\overline{P+Q}$ $P \oplus Q$ $\overline {P \oplus Q}$
Let $\oplus$ denote the exclusive OR (XOR) operation. Let '$1$' and '$0$' denote the binary constants. Consider the following Boolean expression for $F$ over two variable...
10.6k
views
answered
Jun 17, 2022
Digital Logic
gatecse-2014-set3
digital-logic
normal
boolean-algebra
+
–
12
answers
10
GATE CSE 2015 Set 2 | Question: 37
The number of min-terms after minimizing the following Boolean expression is _______. $[D'+AB'+A'C+AC'D+A'C'D]'$
The number of min-terms after minimizing the following Boolean expression is _______.$[D'+AB'+A'C+AC'D+A'C'D]'$
18.7k
views
answered
Jun 17, 2022
Digital Logic
gatecse-2015-set2
digital-logic
boolean-algebra
normal
numerical-answers
+
–
16
answers
11
GATE CSE 2012 | Question: 33
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of values that turn up is at least $6$ ? $\dfrac{10}{21}$ $\dfrac{5}{12}$ $\dfrac{2}{3}$ $\dfrac{1}{6}$
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of val...
21.8k
views
answered
Jun 2, 2022
Probability
gatecse-2012
probability
conditional-probability
normal
+
–
4
answers
12
GATE CSE 1998 | Question: 10b
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m < n$ and $R^m = R^n$.
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m <...
4.1k
views
commented
May 13, 2022
Set Theory & Algebra
gate1998
descriptive
set-theory&algebra
relations
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register