Find answers to your questions about Computer Science or help others by answering their Computer Science questions.
I need to create a graph generator for my next project. Generally algorithms are trying to find a Hamiltonian path in a graph. So I can create a graph generator,...
Asked on 02/21/2021 by Always Newbie
3 answerI have a problem which i don't know how to calculate or more specifically what am I missing. The subject is about 802.11 (wifi) The selected PHY rate is 54Mbit/s,...
Asked on 02/20/2021 by Copsa
1 answerI want to search many times, not identical elements but similar, for something a similar image or fingerprint without having to search the whole space.When I have a 1D...
Asked on 02/20/2021 by Saku
1 answerI have sections 1,2,3...44. We can group only adjacent ones and create groups of maximum size S = 4. There are two possible variations of this problem:can not overlap at...
Asked on 02/20/2021 by Rossko_DCA
1 answerI have a problem with creating an algorithm to predict a winner of thirty-one game. Players from a deck of cards, take the Ace, 2, 3, 4, 5, and 6...
Asked on 02/17/2021 by DonVitoMarco
1 answermay I kindly ask you to give an overview of the conventional solutions to the Firing squad synchronization problem with number of states etc. I want to get into the...
Asked on 02/16/2021 by von spotz
0 answerI have a graph that looks like this The highlights nodes must be visited, and the blue node must be...
Asked on 02/13/2021 by Adam Cole
0 answerYou are given two algorithms $A$ and $B$, with worst-case time complexity $f_A(n)$ and $f_B(n)$, respectively. Assume: (i) For each $n$ there exists an input...
Asked on 02/13/2021 by aviv barel
1 answerGiven a directed acyclic graph $G$ and a start vertex $s$ and an end vertex $e$, consider a coloring of the edges valid if, for every path...
Asked on 02/10/2021 by Gizmo
5 answerConsider a list of full binary trees of heights $(h_0, h_1, ldots, h_{n-1})$ where a tree with a single leaf is deemed to have height 0. The list has...
Asked on 02/10/2021 by Arthur B
0 answerGet help from others!
Recent Answers
Recent Questions
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP