Dark Mode

Recent activity by tamil93

1 answer

1

GATE Overflow | Data Structures | Test 1 | Question: 15
The following numbers are inserted into an empty binary search tree in the given order: 1000, 452, 131, 15, 85, 75. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

commented in DS Jan 16, 2017

303 views

1 answer

2

Recurrence
Solve the Recurrence $\begin{align} T(n) &= T \left ( \frac n 2 -1 \right ) + T \left ( n- \frac n 2 \right ) + \Theta(n) \end{align}$

commented in Algorithms Dec 30, 2016

341 views

3 answers

3

How many DFA's exist with three states over the input alphabet {0,1}
Is there any procedure to generalize these types of problems ? Thanks in advance

commented in Theory of Computation Oct 25, 2016

16.5k views

1 answer

4

Theory of computation
Set of all strings over {0,1} containing at most one pair of consecutive 1's. Give regular expression and equivalent minimized DFA.

commented in Unknown Category Oct 5, 2016

607 views

1 answer

5

simplify Boolean expression minimuum literal mano 2.4 b
(x'y' + z)' + z + xy + wz

commented in Digital Logic Jun 22, 2016

3.0k views

1 answer

6

Maximum number of nodes in binary tree

asked in DS Feb 3, 2016

812 views

0 answers

7

schedule serializable

closed in Databases Jan 30, 2016

147 views

1 answer

8

SQL
Can Foreign key value can be null??

asked in Databases Jan 26, 2016

308 views

1 answer

9

Asympotic notations
T(n)=16T(n/4)+n! how to take k value for master therom by using n!???

asked in Programming in C Jan 21, 2016

286 views

2 answers

10

TIFR CSE 2011 | Part B | Question: 21
Let $S=\left \{ x_{1},....,x_{n} \right \}$ be a set of $n$ numbers. Consider the problem of storing the elements of $S$ in an array $A\left [ 1...n \right ]$ ... time. This problem can be solved in $O \left ( n^{2} \right )$ time but not in $O(n\log n)$ time. None of the above.

commented in Algorithms Jan 20, 2016

2.1k views

2 answers

11

Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s.What will be the time complexity???????

answered in Algorithms Jan 20, 2016

3.3k views