User Mahesha999

34 votes

5 answers

70k views

What threads share in general?

asked Oct 17, 2015 at 8:02

9 votes

3 answers

6k views

DFA for accepting all binary strings of form power of $n$ (not divisible by $n$) i.e. $n^k$ for given $n$

asked Jan 22, 2016 at 14:25

7 votes

2 answers

13k views

Understanding N process Peterson's algorithm

asked Jul 22, 2016 at 4:15

7 votes

2 answers

3k views

Why is $\emptyset L = L\emptyset = \emptyset$ correct?

asked May 16, 2015 at 10:46

7 votes

1 answer

37k views

Steps to convert regular expressions directly to regular grammars and vice versa

asked Jan 11, 2017 at 18:54

6 votes

1 answer

11k views

Space complexity analysis of binary recursive sum algorithm

asked Aug 14, 2014 at 20:44

5 votes

2 answers

3k views

How is $\emptyset^* = \{\epsilon\}$?

asked Dec 24, 2015 at 13:19

5 votes

3 answers

2k views

When do deadlocks occur?

asked Nov 25, 2015 at 15:55

5 votes

1 answer

28k views

How many number of different binary trees are possible for a given postorder (or preorder) traversal

asked Apr 8, 2016 at 11:06

5 votes

1 answer

1k views

Why can't linear bounded automata accept an empty string?

asked Nov 19, 2016 at 16:44

4 votes

2 answers

3k views

Why do we need double-rotations to rebalance AVL trees?

asked Apr 9, 2016 at 8:26

4 votes

2 answers

37k views

Perfect matching in a graph and complete matching in bipartite graph

asked Dec 6, 2015 at 14:21

3 votes

4 answers

3k views

Non planarity of K3,3

asked Dec 12, 2015 at 13:33

3 votes

1 answer

1k views

Variations of Depth First Travesal

asked Dec 18, 2015 at 20:36

3 votes

4 answers

4k views

Confusion in CLRS's version of Prim's algorithm

asked Dec 20, 2015 at 10:18

3 votes

3 answers

492 views

why DFA to regex by two different methods differ

asked Jan 16, 2016 at 16:33

3 votes

1 answer

11k views

When is relation in 3NF but not in BCNF?

asked Aug 13, 2016 at 19:25

3 votes

2 answers

2k views

Is bounded waiting ensured in given version of Dekker's solution for critical section problem?

asked Jul 2, 2016 at 14:31

3 votes

1 answer

725 views

Binary Search Tree Traversal output validity and unique BST construction

asked Mar 23, 2016 at 19:47

3 votes

1 answer

233 views

How the closure properties of the formal languages dictate decidability of their problem

asked Dec 24, 2016 at 11:34

2 votes

2 answers

795 views

How these two Turing machine problems are different in terms of their decidability?

asked Dec 19, 2016 at 20:36

2 votes

1 answer

786 views

When will deadlock occur in this producer-consumer code

asked Jan 15, 2017 at 17:22

2 votes

1 answer

6k views

Polynomial generator required to detect single bit error in Cyclic Redundancy Check codes

asked Jan 21, 2017 at 17:43

2 votes

1 answer

4k views

Facts about internal and external path lengths of binary tree

asked Apr 24, 2016 at 11:49

2 votes

1 answer

2k views

Should all internal node keys in B+ tree also be in the leaves?

asked Apr 27, 2016 at 20:30

2 votes

1 answer

515 views

Result of ANDing & ORing functions expressed as CDNF & CCNF

asked Jan 8, 2016 at 19:51

2 votes

1 answer

264 views

Operating Systems TestAndSet instruction

asked Oct 11, 2015 at 13:12

1 vote

2 answers

796 views

Is this language regular [duplicate]

asked Jan 20, 2015 at 12:39

1 vote

1 answer

1k views

Proving number of calls made in cut-rod algorithm [duplicate]

asked Sep 4, 2014 at 12:16

1 vote

1 answer

977 views

How can I translate this quantified logical expression into english

asked Oct 11, 2014 at 10:27

Stack Exchange Network

52 Questions

What threads share in general?

DFA for accepting all binary strings of form power of $n$ (not divisible by $n$) i.e. $n^k$ for given $n$

Understanding N process Peterson's algorithm

Why is $\emptyset L = L\emptyset = \emptyset$ correct?

Steps to convert regular expressions directly to regular grammars and vice versa

Space complexity analysis of binary recursive sum algorithm

How is $\emptyset^* = \{\epsilon\}$?

When do deadlocks occur?

How many number of different binary trees are possible for a given postorder (or preorder) traversal

Why can't linear bounded automata accept an empty string?

Why do we need double-rotations to rebalance AVL trees?

Perfect matching in a graph and complete matching in bipartite graph

Non planarity of K3,3

Variations of Depth First Travesal

Confusion in CLRS's version of Prim's algorithm

why DFA to regex by two different methods differ

When is relation in 3NF but not in BCNF?

Is bounded waiting ensured in given version of Dekker's solution for critical section problem?

Binary Search Tree Traversal output validity and unique BST construction

How the closure properties of the formal languages dictate decidability of their problem

How these two Turing machine problems are different in terms of their decidability?

When will deadlock occur in this producer-consumer code

Polynomial generator required to detect single bit error in Cyclic Redundancy Check codes

Facts about internal and external path lengths of binary tree

Should all internal node keys in B+ tree also be in the leaves?

Result of ANDing & ORing functions expressed as CDNF & CCNF

Operating Systems TestAndSet instruction

Is this language regular [duplicate]

Proving number of calls made in cut-rod algorithm [duplicate]

How can I translate this quantified logical expression into english