Top new questions this week:
|
|
$A$ is an array of length $n$
$B$ is an $n\times n$ matrix \
I want to return an array C of size n such that:
$$C_{i} = \sum_{j=1}^{n} \max(0, a_i - b_{ij}) $$
In pseudocode it could be like ...
|
|
I'm wondering about the optimal complexity - or at the very least, some way of achieving non-terrible complexity - of a particular stack variant, that I'm calling a 'nonrepetitive stack'.
A ...
|
|
I'm preparing some material for students about greedy algorithms, and there is one point that confuses me: how Dijkstra's algorithm fits into the greedy framework.
I would like to say that we have ...
|
|
Given a data structure with 2 operations: insert and
extract almost min. Extract almost min operation outputs either the first minimum or a
second minimum item from the current structure randomly.
How ...
|
|
I have a matrix with three possible elements: A, B and C. The size of the matrix could be a maximum of 15x16.
$$
\begin{bmatrix}
A & A & C & A\\
A & C & B & C\\
A & C & ...
|
|
I have run $k$-means on a large set of high-dimensional data, and now I want to find the distance from a point $x$ to the Voronoi cell associated with one of the $k$ centroids. (In a previous version ...
|
|
Is there any proof or reference or intuition for the following theorem related to AAD:
Any function f of n variables f(x1,...,xn) can be differentiated with respect to every variable xi at a ...
|
Greatest hits from previous weeks:
|
|
As I understand the convoy effect, in the context of vehicular traffic in a road system. A slow moving group of vehicles passes through the system, slowing traffic even in areas which were not ...
|
|
I know that Euclid’s algorithm is the best algorithm for getting the GCD (great common divisor) of a list of positive integers.
But in practice you can code this algorithm in various ways. (In my case,...
|
|
If I have a list of key values from 1 to 100 and I want to organize them in an array of 11 buckets, I've been taught to form a mod function
$$ H = k \bmod \ 11$$
Now all the values will be placed ...
|
|
From what I have understood :
A Flip Flop is a clocked latch i.e. flip flop = latch + clock
Latch continuously checks for inputs & changes the output whenever there is a change in input
Flip Flop ...
|
|
How are computers able to tell the correct time and date every time?
Whenever I close the computer (shut it down) all connections and processes inside stop. How is it that when I open the computer ...
|
|
In a standard algorithms course we are taught that quicksort is $O(n \log n)$ on average and $O(n^2)$ in the worst case. At the same time, other sorting algorithms are studied which are $O(n \log n)$ ...
|
|
For the following jobs:
The average wait time would be using a FCFS algorithm:
(6-6)+(7-2)+(11-5)+(17-5)+(14-1) -> 0+5+6+10+13 -> 34/5 = 7 (6.8)
What would the average turnaround time be?
|
Can you answer these questions?
|
|
Let $P$ be a indexable set(array) of points in $\mathbb{R}^3$ s.t. $P = \{p_0,p_1,p_2,...,p_n\}, p_i \in\mathbb{R}^3$.
I want to sort $P$ so that every 4 consecutive points forms a non-coplanar ...
|
|
I'd like to know if there's a non-recursively computable language that can be accepted by the Turing machine.
From the following definition of the recursively enumerable language:
and from the fact ...
|
|
Suppose there are n Arithmetic Progressions :
Example :
$$
AP1: a_1 = 1, d = 14 \\
AP2: a_1 = 8, d = 21 \\
:\\
:\\
APn: a_1 = X, d = X \\
$$
a1 = first term d = common difference
and for each AP'...
|
