Category: Uncategorized

Problem Detail: There is a saying by Computer Science Professor’s everywhere : PDA Checks the intelligence of Students, as certainly there is no approach except power and imagination of mind to solve problems and design PDA… While thinking today i thought Read More …

Problem Detail: I’m trying to reproduce the synthetic networks (graphs) described in some papers. The topic is the same as a previous question of mine, but with a different focus. It is stated that the Erdos-Renyi model was used to create Read More …

Problem Detail: I came across the following dynamic subtraction game: There is one pile of n chips. The first player to move may remove as many chips as desired, at least one chip but not the whole pile. Thereafter, the players Read More …

Problem Detail: I’m learning Dynamic Programming (By myself) and in the textbook there is this question: Given two undirected graphs $G_1=(V,E_1)$ and $G_2=(V,E_2)$ over the same set of Vertices $V$ and a weight function $w: E_1 cup E_2 rightarrow mathbb{R}$, let Read More …

Problem Detail: I’ve been trying to efficiently solve this problem : given a integer p > 0 and a directed graph whose nodes are 0, …, N-1, enumerate (not simply count) all the paths (not necessarily elementary) from a node i Read More …

Problem Detail: Robert Sedgewick, at his Algorithms – Part 1 course in Coursera, states that people usually misunderstand the big-O notation when using it to show the order of growth of algorithms. Instead, he advocates for the tilde notation. I understand Read More …

Problem Detail: If A and B are Turing recognizable, is A – B Turing recognizable? I think that A – B would be Turing recognizable because they’re both in the space of Turing recognizability. For example, if A is context free Read More …

Problem Detail: In a course of computer science it is common to study the hierarchy of formal languages, grammars, automata and Turing machines. I wonder what is the relationship of these objects with formal systems. For example, lambda calculus is said Read More …

Problem Detail: I need an algorithm to search for substrings. I checked different resources, and it seems that the most known algorithms are the Boyer–Moore and the Knuth–Morris–Pratt. However, as far as I understand, these operate on “regular” strings, but what Read More …

Problem Detail: $1+3+5+…+(2n+3)=n^2+4n$ For this series using induction proof. Base case 1,2,3,.. not working. But induction step works well. Base case is not given in question. Asked By : user5507 Answered By : yuanshang First of all, the right hand side should be Read More …