Mr. Sigma.'s user avatar
Mr. Sigma.'s user avatar
Mr. Sigma.'s user avatar
Mr. Sigma.
  • Member for 6 years
  • Last seen more than 1 year ago
  • Lost city of Atlantis
4 votes

Language of all strings that has exactly 1 triple b

3 votes

Do any two spanning trees of a simple graph always have some common edges?

3 votes

Bottom-Up Evaluation of Inherited Attributes

3 votes

What is the asymptotic bound for $1n + 2(n-1) + 3(n-2) + ... + (n-1)2 + n$?

3 votes

Closed form solution of $T(n) = 5T(n-1) + n^2$

2 votes
Accepted

Finding an element in array, whose index number and element value same

2 votes

Why is Binary Heap never unbalanced?

2 votes
Accepted

"Mathematical Physics"'s equivalent for Computer Science

2 votes

How does a computer remember the address of a data variable in a program, in the main memory?

2 votes

Shortest distance from multiple points to one point

1 vote

Is it possible to write a program that calculates an algorithm's time complexity?

1 vote

First Sets: If $A \to Ad\ |\ c$, what is $First(A)$?

1 vote
Accepted

Prove key of leaf is larger or smaller than key of parent if leaf is largest key in smaller tree or smallest in larger tree with respect to parent

1 vote
Accepted

Algorithm to calculate numbers of 10^x smaller than given one

1 vote
Accepted

what is the meaning of hit time?

1 vote

Why do you need at least ln(n!) many comparison to sort a list?

1 vote
Accepted

Data Hazard in Pipelining

1 vote

Are $A$ and $B$ necessarily be decidable if $(A∩\overline{B})∪(\overline{A}∩B)$ is decidable and $A$ & $B$ being exhaustive?

1 vote

Circular Queue using Dynamic Array

1 vote

Difficulty understanding the solution of heap problem in CLRS book?

1 vote

Binary heap: prove that number of nodes of height h is not bigger than $\lceil \frac{n}{2^{h+1}} \rceil$

0 votes

Confusion in CLRS's version of Prim's algorithm

0 votes
Accepted

Find a recurrence relation for merging of sublists of an array

0 votes

Is {a^i b^j c^k | i≤j or (k=j≤i)} context sensitive?

0 votes

How do you solve a recurrence relation with multiple subproblems of different sizes?

0 votes

Can a 3 Color DFS be used to identify cycles (not just detect them)?

0 votes

Given $k$ sorted lists, $O(n \log k)$ complexity, Mergesort rather than Heapsort

0 votes

The difference between compiler and interpreter

-1 votes

Effectiveness of TLB

-1 votes

Can we remove duplicates faster than we can sort?