Problem Detail: I was reading the ADA 95 reference manual. I came across these two words in annexes Normative and informative . I couldnt find the difference between those. Your help will be much appreciated. Asked By : Proton Boss Answered By Read More …
Blog
Can someone show me step-by-step how to calculate the primitive operations of this algorithm?
Problem Detail: See the example algorithm below from my course notes, I don’t follow the operation counting in the inner loop. Can someone walk me through this step-by-step? Here’s the algorithm: Algorithm PrefixAverages1(A, n): Input: An integer array A of size Read More …
Are there inherently ambiguous and deterministic context-free languages?
Problem Detail: Let us call a context-free language deterministic if and only if it can be accepted by a deterministic push-down automaton, and nondeterministic otherwise. Let us call a context-free language inherently ambiguous if and only if all context-free grammars which Read More …
If all edges are of equal weight, can one use BFS to obtain a minimal spanning tree?
Problem Detail: If given that all edges in a graph $G$ are of equal weight $c$, can one use breadth-first search (BFS) in order to produce a minimal spanning tree in linear time? Intuitively this sounds correct, as BFS does not Read More …
Data structure with search, insert and delete in amortised time $O(1)$?
Problem Detail: Is there a data structure to maintain an ordered list that supports the following operations in $O(1)$ amortized time? GetElement(k): Return the $k$th element of the list. InsertAfter(x,y): Insert the new element y into the list immediately after x. Read More …
Not all Red-Black trees are balanced?
Problem Detail: Intuitively, “balanced trees” should be trees where left and right sub-trees at each node must have “approximately the same” number of nodes. Of course, when we talk about red-black trees*(see definition at the end) being balanced, we actually mean Read More …
Are algorithms (and efficiency in general) getting less important?
Problem Detail: Since buying computation power is much affordable than in the past, are the knowledge of algorithms and being efficient getting less important? It’s clear that you would want to avoid an infinite loop, so, not everything goes. But if Read More …
If A is mapping reducible to B then the complement of A is mapping reducible to the complement of B
Problem Detail: I’m studying for my final in theory of computation, and I’m struggling with the proper way of answering whether this statement is true of false. By the definition of $leq_m$ we can construct the following statement, $w in A Read More …
Trigonometry in computer science
Problem Detail: What’s the use of studying trigonometry in computer science? I mean, is it essential? Does it have a specific application in computer science? Because I can’t seem to muster enough motivation for learning it. Asked By : The Double-Jointed Prince Read More …
Efficiently calculating minimum edit distance of a smaller string at each position in a larger one
Problem Detail: Given two strings, $r$ and $s$, where $n = |r|$, $m = |s|$ and $m ll n$, find the minimum edit distance between $s$ for each beginning position in $r$ efficiently. That is, for each suffix of $r$ beginning Read More …
