IgnouGroup Social Campus
Problem Detail: This is a beginners question. I and reading the book “Introduction to Computer Theory” by Daniel Cohen. But I end up with confusion regarding simplification of regular expressions and finite automata. I want to create an FA for the Read More …
Problem Detail: Counting all possible paths, or all possible paths with a given length, between a couple of nodes in a directed or undirected graph is a classical problem. Attention should be given to what all means, due to the possibles Read More …
Problem Detail: Simply put, if one were to build a quantum computing device with the power of, say, 20 qubits, could such a computer be used to make any kind of modern hashing algorithm useless? Would it even be possible to Read More …
Problem Detail: I’ve been reading Linear Algebra and its Applications to help understand computer science material (mainly machine learning), but I’m concerned that a lot of the information isn’t useful to CS. For example, knowing how to efficiently solve systems of Read More …
Problem Detail: I was just thinking today that the best approach to find two smallest numbers in any array would be to first sort(ascending order) it with some efficient algorithm like Quicksort(Average case complexity: nlogn) and then access the first two Read More …
Problem Detail: I’ve created a diagram that depicts what I’m trying to accomplish. Full-size Image In the input sequence, the nodes are as close together as possible. But I want the white nodes to be as close to their respective black Read More …
Problem Detail: Note that by “two-way pushdown automaton”, I mean a pushdown automaton that can move its reading head both ways on the input tape. I recently had the question of determining the computational power of two-way PDAs in the Chomsky Read More …
Problem Detail: Is Dijkstra’s algorithm used in modern route-finding systems such as Google maps or the satnav in your car? If not, then what is? Asked By : chopper draw lion4 Answered By : TinyProton Yes, Dijkstra’s algorithm is used in modern maps Read More …
Problem Detail: A Fibonnaci Heap supports the following operations: insert(key, data) : adds a new element to the data structure find-min() : returns a pointer to the element with minimum key delete-min() : removes the element with minimum key delete(node) : Read More …
Problem Detail: Define the language $L$ as $L = {a, b}^* – {wwmid w in {a, b}^*}$. In other words, $L$ contains the words that cannot be expressed as some word repeated twice. Is $L$ context-free or not? I’ve tried to Read More …
