TransWikia.com
  1. All Categories
  2. Computer Science

Computer Science : Recent Questions and Answers (Page 4)

Find answers to your questions about Computer Science or help others by answering their Computer Science questions.

Bit times and propagation delay

Nodes A and B are accessing a shared medium using CSMA/CD, with a propagation delayof 245-bit times between them (i.e., propagation delay equals the amount of time to transmit...

Asked on 12/06/2021 by brazen

1 answer

Enumerate all valid orders of subset sums

Given an positive integer $n$, we define an order of subset sums (or simply, an order, when there is no ambiguity) to be a sequence of all subsets of...

Asked on 12/06/2021 by xskxzr

1 answer

"Knapsack problem" with repetition, "lesser or equal" constraint, and recording all valid combinations

In a game I am developing I came across an interesting problem, that seems like it could be solved using some modified variant of the knapsack problem, but it's a...

Asked on 12/06/2021

1 answer

How do compilers assure stability?

Suppose you need a c compiler. It would be preferable to write that compiler in a c-like language, given the complexity of a compiler of that degree. At best, the...

Asked on 12/04/2021

4 answer

If we prove that there is an NP-complete problem that is P, Can we consider that P=NP?

I discover this in All NP problems reduce to NP-complete problems: so how can NP problems not be NP-complete?If problem B is in P and A reduces to B,...

Asked on 12/04/2021 by mwit30 room8

2 answer

Is it possible to uniformly shuffle N items into a deque of size N where you can only modify the first or last elements?

I had a question about random shuffling. Given a sorted list, is it possible to design an algorithm to return a uniformly random arrangement of the items in a deque...

Asked on 12/04/2021

1 answer

Spanning tree in a graph of intersecting sets

Consider $n$ sets, $X_i$, each having $n$ elements or fewer, drawn among a set of at most $m gt n$ elements. In other words$$forall...

Asked on 12/04/2021

2 answer

Is the two-color leapfrog problem in P?

My question is whether a specific decision problem is in P or not. It's straightforwardly in NP. The decision problem is a specific case of the general $k$-color leapfrog...

Asked on 12/02/2021

0 answer

Problem with proving that $RP subseteq NP$ : a non-deterministic TM for a language $L in RP$

I'm having a small issue with wikipedia's proof that $RP subseteq NP$:An alternative characterization of RP that is sometimes easier to use is the set of problems recognizable by...

Asked on 11/30/2021 by Pedro Costa

1 answer

A monad is just a monoid in the category of endofunctors, what's the enlightenment?

Pardon the word play. I'm a little confused about the implication of the claim and hence the question. Background: I ventured into Category Theory to understand the theoretical underpinnings of...

Asked on 11/30/2021

1 answer

Ask a Question

Get help from others!

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP