Problem Detail: I’m writing a research paper and I have to basically say that one microcontroller is slower than an other microprocessor. However, I’m worried that simply saying that it’s ‘slower’ wouldn’t be appropriate in a research paper. Am I right? Read More …
Author: ignougroup
Why is non-determinism useful concept?
Problem Detail: An automaton is an abstract model of a digital computer. Digital computers are completely deterministic; their state at any time is uniquely predictable from the input and the initial state. When we are trying to model real systems, why Read More …
Rectangle Coverage by Sweep Line
Problem Detail: I am given an exercise unfortunately I didn’t succeed by myself. There is a set of rectangles $R_{1}..R_{n}$ and a rectangle $R_{0}$. Using plane sweeping algorithm determine if $R_{0}$ is completely covered by the set of $R_{1}..R_{n}$. For more Read More …
Constructing a PDA for the language ${a^m b^n : m < 2n < 3m }$
Problem Detail: I’m having a lot of trouble constructing a PDA for the language: begin{equation*} {a^m b^n : m < 2n < 3m } end{equation*} I know if I push a symbol for each $a$ I see, then pop 2 symbols Read More …
What is the difference between a scripting language and a normal programming language?
Problem Detail: What is the difference between programming language and a scripting language? For example, consider C versus Perl. Is the only difference that scripting languages require only the interpreter and don’t require compile and linking? Asked By : SS Hegde Answered Read More …
Generate scale-free networks with power-law degree distributions using Barabasi-Albert
Problem Detail: I’m trying to reproduce the synthetic networks (graphs) described in some papers. It is stated that the Barabasi-Albert model was used to create “scale-free networks with power-law degree distributions, $P_A(k) ∝ k^{-λ}$”. $P_A$ is a probability distribution that returns Read More …
Checking Feasibility of Linear Program in Polynomial Time
Problem Detail: Given a linear system of the form: $$begin{array}{c} x_r = a quad x_j = b c_1x_1 + c_2x_2 + ldots + c_nx_n = N x_1+x_2 + x_3 + ldots + x_n = k 0 le a,b,x_1,x_2,x_3…x_n le 1 k Read More …
Data compression using prime numbers
Problem Detail: I have recently stumbled upon the following interesting article which claims to efficiently compress random data sets by always more than 50%, regardless of the type and format of the data. Basically it uses prime numbers to uniquely construct Read More …
How to determine likely connections in a social network?
Problem Detail: I am curious in determining an approach to tackling a “suggested friends” algorithm. Facebook has a feature in which it will recommended individuals to you which it thinks you may be acquainted with. These users normally (excluding the edge Read More …
Why does heapsort run in $Theta(n log n)$ instead of $Theta(n^2 log n)$ time?
Problem Detail: I am reading section 6.4 on Heapsort algorithm in CLRS, page 160. HEAPSORT(A) 1 BUILD-MAX-HEAP(A) 2 for i to A.length downto 2 3 exchange A[i] with A[i] 4 A.heap-size = A.heap-size-1 5 MAX-HEAPIFY(A,1) Why is the running time, according Read More …
