User Mr. Sigma.

4 votes

Language of all strings that has exactly 1 triple b

answered Dec 2, 2018 at 11:37

3 votes

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

graphs spanning-trees

answered Dec 6, 2018 at 5:04

3 votes

Bottom-Up Evaluation of Inherited Attributes

formal-grammars compilers parsers attribute-grammars

answered Jul 21, 2017 at 6:45

3 votes

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

asymptotics

answered Apr 18, 2019 at 4:49

3 votes

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

recurrence-relation

answered Apr 25, 2019 at 4:22

2 votes

Accepted

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

algorithms

answered Apr 28, 2019 at 8:02

2 votes

Why is Binary Heap never unbalanced?

data-structures binary-trees heaps binary-search-trees

answered May 2, 2019 at 6:55

2 votes

Accepted

"Mathematical Physics"'s equivalent for Computer Science

mathematical-foundations

answered Jan 11, 2019 at 4:21

2 votes

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

memory-allocation

answered Dec 2, 2018 at 15:19

2 votes

Shortest distance from multiple points to one point

algorithms graphs shortest-path

answered Dec 7, 2018 at 13:02

1 vote

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

algorithms complexity-theory halting-problem

answered Dec 10, 2018 at 16:28

1 vote

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

context-free formal-grammars compilers parsers

answered Dec 7, 2018 at 6:37

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

trees binary-trees

answered Oct 27, 2017 at 0:42

1 vote

Accepted

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

algorithms

answered Jan 3, 2018 at 13:58

1 vote

Accepted

what is the meaning of hit time?

cpu-cache memory-access

answered Nov 22, 2018 at 13:10

1 vote

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

complexity-theory algorithm-analysis sorting lower-bounds

answered Nov 24, 2018 at 4:53

1 vote

Accepted

Data Hazard in Pipelining

cpu-pipelines

answered Jan 11, 2019 at 2:02

1 vote

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

turing-machines undecidability

answered Jan 30, 2019 at 10:04

1 vote

Circular Queue using Dynamic Array

algorithms data-structures queues

answered Apr 15, 2019 at 4:37

1 vote

Difficulty understanding the solution of heap problem in CLRS book?

binary-trees heaps

answered Apr 17, 2019 at 8:18

1 vote

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

algorithms data-structures binary-trees

answered Apr 17, 2019 at 8:36

0 votes

Confusion in CLRS's version of Prim's algorithm

graphs greedy-algorithms prims-algorithm

answered Jan 26, 2019 at 11:08

0 votes

Accepted

Find a recurrence relation for merging of sublists of an array

algorithms sorting recurrence-relation arrays divide-and-conquer

answered Oct 16, 2018 at 5:24

0 votes

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

formal-languages context-sensitive

answered Sep 17, 2016 at 3:40

0 votes

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

recurrence-relation

answered Feb 13, 2017 at 3:53

0 votes

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

algorithms graphs graph-traversal

answered Jan 3, 2018 at 12:56

0 votes

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

algorithms sorting

answered Dec 16, 2018 at 9:15

0 votes

The difference between compiler and interpreter

programming-languages compilers

answered Dec 6, 2018 at 14:09

-1 votes

Effectiveness of TLB

operating-systems memory-management paging

answered Nov 27, 2017 at 10:33

-1 votes

Can we remove duplicates faster than we can sort?

time-complexity sorting hashing

answered Dec 1, 2018 at 0:51

Stack Exchange Network

current community

your communities

more stack exchange communities

31 Answers

Language of all strings that has exactly 1 triple b

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

Bottom-Up Evaluation of Inherited Attributes

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

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

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

Why is Binary Heap never unbalanced?

"Mathematical Physics"'s equivalent for Computer Science

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

Shortest distance from multiple points to one point

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

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

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

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

what is the meaning of hit time?

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

Data Hazard in Pipelining

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

Circular Queue using Dynamic Array

Difficulty understanding the solution of heap problem in CLRS book?

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

Confusion in CLRS's version of Prim's algorithm

Find a recurrence relation for merging of sublists of an array

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

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

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

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

The difference between compiler and interpreter

Effectiveness of TLB

Can we remove duplicates faster than we can sort?