Author: ignougroup

Problem Detail: If a graph with $v$ vertices is represented in the form of adjacency matrix . Then, adding a new vertex to the existing graph requires how much time ? Is it $O(v^2)$ or $O(2v)$ . We have the adjacency Read More …

Problem Detail: I try to find an approach to the following problem: Given the set of point $S$ and radius $r$, find the center point of circle, such that the circle contains the maximum number of points from the set. The Read More …

Problem Detail: There may be a large number of algorithms proposed for generating graphs satisfying some common properties (e.g., clustering coefficient, average shortest path length, degree distribution, etc). My question concerns a specific case: I want to generate a few undirected Read More …

Problem Detail: So, I know that testing if a regular language $R$ is a subset of regular language $S$ is decidable, since we can convert them both to DFAs, compute $R cap bar{S}$, and then test if this language is empty. Read More …

Problem Detail: What is the difference between encoding and modulation? I have seen these terms used sometimes inter-changeably and sometimes differently (the ratio is 50:50). Can somebody clearly explain this with some non-technical and technical examples both? I have searched this Read More …

Problem Detail: Will $L = {a^* b^*}$ be classified as a regular language? I am confused because I know that $L = {a^n b^n}$ is not regular. What difference does the kleene star make? Asked By : user6268553 Answered By : Yuval Filmus Read More …

Problem Detail: What bad things can occur when the lengths of the time slices in a multitasking system are too small? What can happen when they are too big? How should the length of the time slice be chosen? Asked By Read More …

Problem Detail: This is the recursive formula for which I’m trying to find an asymptotic closed form by the master theorem: $$T(n)=9T(n/27)+(n cdot lg(n))^{1/2}$$ I started with $a=9,b=27$ and $f(n)=(ncdot lg n)^{1/2}$ for using the master theorem by $n^{log_b(a)}$, and if Read More …

Problem Detail: This is a follow-up question of this one. In a previous question about exotic state machines, Alex ten Brink and Raphael addressed the computational capabilities of a peculiar kind of state machine: min-heap automata. They were able to show Read More …

Problem Detail: I’m trying to give a meaningful definition for NFAs with more than one initial state. I know from the formal definition in Wikipedia that it is possible to have more than one initial state, it mentions that “There is Read More …