Computer Science Questions, Problems & Solutions : TransWikia.com ~ Page 10

Clique vs Complete Graph

Is there a difference between a complete graph and a clique topology? As far as I understand, both refer to graphs in which every possible edge between any two vertices...

Asked on 10/21/2021 by Ninja Bug

2 answer

Why does the GS1 DataMatrix encode diagonally instead of vertically or horizontally?

Perhaps this is the wrong exchange, so if there is a better place to post this please tell me! The DataMatrix encodes diagonally in a sort of zig zag pattern,...

Asked on 10/21/2021 by KITTENDESTROYER-9000

1 answer

How to design a formal grammar to convert EBNF description to a list of CFG production rules

I would like to write a grammar to convert EBNF description to a list of CFG production rules, instead of an algorithm. Can CFG production rules is generated from an...

Asked on 10/21/2021 by phamsodiep

1 answer

Is protein folding really NP-hard and how to show that?

This question has two facets that are related. Is the general problem of protein folding really NP-hard? The hydrophobic-polar protein folding model (Ken Dill et al., 1985) stated the problem...

Asked on 10/21/2021

1 answer

Why is the Halting problem decidable for Goto languages limited on the highest value of constants and variables?

This is taken from an old exam of my university that I am using to prepare myself for the coming exam: Given is a language $text{Goto}_{17}^c subseteq text{Goto}$. This...

Asked on 10/21/2021 by Vladis Becker

1 answer

Enumerator for Word and Halting Problem

in theoretical computer science I learned for every recursive enumerable language there would be an enumerator and a grammar. So since word problem and halting problem are recursively enumerable, I...

Asked on 10/21/2021 by FelixOuttaSpace

1 answer

Is there a way to simplify redundant conditionals?

For example if I've this:if a == false then return true elseif a == true and b == false return true elseif a == true and b == true...

Asked on 10/21/2021

0 answer

algorithm to find shortest path connecting EVERY node

I have received a problem to solve and I am not sure what algorithm to use. TLDR; Find the shortest path to get to every node in a undirected graph...

Asked on 10/21/2021 by Peter S

1 answer

Range search in a max-heap

I am having trouble with coming up for a suitable algorithm for this question. A max-heap is essentially visualized as a binary tree not a binary search tree. Also the...

Asked on 02/27/2021

1 answer

Is deletion and insertion easier in B+ trees compared to B trees?

I saw this question in test. It says that insertion and deletion is easier in B+ tree compared to B tree. The given reason for this was the key to...

Asked on 02/26/2021 by Ayush

0 answer

Ask a Question

Get help from others!

Computer Science : Recent Questions and Answers (Page 10)

Ask a Question