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 ashishji
0
votes
1
merge sort no. of levels when input is n ??
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1
743
views
answered
Aug 9, 2017
Algorithms
algorithms
sorting
merge-sort
+
–
–1
votes
2
GATE CSE 1989 | Question: 5-a
Find values of Boolean variables $A, B, C$ which satisfy the following equations: A+ B = 1 AC = BC A + C = 1 AB = 0
Find values of Boolean variables $A, B, C$ which satisfy the following equations:A+ B = 1AC = BCA + C = 1AB = 0
3.6k
views
answered
Jul 31, 2017
Digital Logic
gate1989
descriptive
digital-logic
boolean-algebra
+
–
0
votes
3
GATE CSE 1990 | Question: 3-iv
The total external path length, $\text{EPL},$ of a binary tree with $n$ external nodes is, $\text{EPL}= \displaystyle \sum_{w} I_w$, where $I_{w}$ is the path length of external node $w$), $\leq n^{2}$ always. $\geq n \log_{2} n$ always. Equal to $n^{2}$ always. $O(n)$ for some special trees.
The total external path length, $\text{EPL},$ of a binary tree with $n$ external nodes is, $\text{EPL}= \displaystyle \sum_{w} I_w$, where $I_{w}$ is the path length of e...
6.4k
views
answered
Jul 31, 2017
DS
gate1990
normal
data-structures
binary-tree
multiple-selects
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register