User Sagnik

6 votes

Accepted

Why don't 2 GPUs double the graphics performance of a computer compared to a single GPU?

answered Jul 23, 2015 at 6:21

5 votes

Where is Program Counter (PC) stored?

answered Jul 16, 2015 at 14:15

3 votes

What is this data structure/concept where a plot of points defines a partition to a space

answered Jan 22, 2019 at 5:52

3 votes

How do binary trees use memory to store its data?

answered Aug 2, 2015 at 15:26

3 votes

Calculating the set field of associative cache

answered Jul 15, 2018 at 6:09

2 votes

Difference between Row Major Order and Column Major order

answered Aug 20, 2018 at 7:03

2 votes

how does cpu read 32 bit word from memory

answered Feb 16, 2018 at 9:59

2 votes

Why do OS and DBMS have their own synchronisation mechanisms, when OS can alone do it and it sits at the bottom of DB?

answered Apr 10, 2019 at 16:43

2 votes

Why is the sequence, "1,3,2,4", not a bitonic sequence?

answered Aug 22, 2018 at 3:51

1 vote

Variant of the Knapsack Problem

answered Oct 10, 2018 at 5:11

1 vote

Are there strings which get accepted only by PDA by empty stack and not by PDA by final state, and vice versa?

answered Dec 22, 2018 at 12:05

1 vote

Accepted

Chomsky Classification of Languages

answered Jan 22, 2019 at 5:47

1 vote

Accepted

How to decide which bytes will form a packet ?(computer networks)

answered Jan 22, 2019 at 16:36

1 vote

Fastest nth root algorithm to a lot of digits?

answered Aug 2, 2015 at 14:24

1 vote

Accepted

For AVL Trees why is keeping a trit (left heavy, right heavy or balanced) sufficient?

answered Aug 2, 2015 at 15:04

1 vote

Complexity of numerical operations

answered Apr 20, 2018 at 4:52

1 vote

Accepted

Advantages (from a mathematical perspective) of representing data as symmetric matrices

answered Apr 21, 2018 at 3:16

1 vote

Can an algorithm that yields $O(n^2)$ answers run in $O(n)$ time?

answered Sep 5, 2015 at 13:29

1 vote

Accepted

Implementing SUM(i,j) and CHANGE(i,j) in O(log(n)) using a datastructure with O(n) space complexity

answered Feb 12, 2018 at 4:27

1 vote

Accepted

Please explain a greedy algorithm in a naive manner

answered Jul 24, 2015 at 17:29

1 vote

Is my understanding of what an algorithm is correct?

answered Jul 16, 2015 at 9:20

1 vote

Help Understanding the Type and Complexity of my Programming Task

answered Jul 16, 2015 at 9:37

0 votes

Calculating the number of multiplications necessary to evaluate a polynomial

answered Jul 16, 2015 at 9:54

0 votes

Turing machine that accepts when a string of x's is followed by the same number of y's

answered Aug 1, 2015 at 18:59

0 votes

How do NFA's make program design any better when converted DFA form can't remember original states?

answered Feb 16, 2018 at 6:21

0 votes

What fraction of all combinations is guaranteed to be deadlock free?

answered Aug 20, 2018 at 9:47

0 votes

Can a PDA guess more than once? L = {aⁿ bⁱ aⁿ | i,n > 0 }

answered Feb 27, 2018 at 9:18

0 votes

Is the set of all strings over $\Sigma$ countably infinite or not?

answered Sep 12, 2023 at 13:37

Stack Exchange Network

28 Answers

Why don't 2 GPUs double the graphics performance of a computer compared to a single GPU?

Where is Program Counter (PC) stored?

What is this data structure/concept where a plot of points defines a partition to a space

How do binary trees use memory to store its data?

Calculating the set field of associative cache

Difference between Row Major Order and Column Major order

how does cpu read 32 bit word from memory

Why do OS and DBMS have their own synchronisation mechanisms, when OS can alone do it and it sits at the bottom of DB?

Why is the sequence, "1,3,2,4", not a bitonic sequence?

Variant of the Knapsack Problem

Are there strings which get accepted only by PDA by empty stack and not by PDA by final state, and vice versa?

Chomsky Classification of Languages

How to decide which bytes will form a packet ?(computer networks)

Fastest nth root algorithm to a lot of digits?

For AVL Trees why is keeping a trit (left heavy, right heavy or balanced) sufficient?

Complexity of numerical operations

Advantages (from a mathematical perspective) of representing data as symmetric matrices

Can an algorithm that yields $O(n^2)$ answers run in $O(n)$ time?

Implementing SUM(i,j) and CHANGE(i,j) in O(log(n)) using a datastructure with O(n) space complexity

Please explain a greedy algorithm in a naive manner

Is my understanding of what an algorithm is correct?

Help Understanding the Type and Complexity of my Programming Task

Calculating the number of multiplications necessary to evaluate a polynomial

Turing machine that accepts when a string of x's is followed by the same number of y's

How do NFA's make program design any better when converted DFA form can't remember original states?

What fraction of all combinations is guaranteed to be deadlock free?

Can a PDA guess more than once? L = {aⁿ bⁱ aⁿ | i,n > 0 }

Is the set of all strings over $\Sigma$ countably infinite or not?