Blog

Question Detail: I’m confused as to why the MIPS designers would include 5 bits dedicated to shifting and have separate opcode and function bits. Because MIPS is so RISC I assume that only shifting would be done in a few instructions, Read More …

Question Detail: I teach computing to 18 year olds. After having reverse polish notation explained to them one asked why is it significant enough to be in the public exam. I explained the historical significance of 70s calculators but this failed Read More …

Question Detail: This a problem in a computer architecture course that’s giving me some trouble: You have an application whose memory access pattern is a stream and its entire data set is 128kB. The data cache in your machine has a Read More …

Question Detail: Seemingly, a byte has established itself to be 8bit (is that correct?). RAM and NOR-flash can be normally accessed on a quite granular level, but it is up to the system architecture to determine if the smallest addressable unit Read More …

Question Detail: I’m studying shortest paths in directed graphs currently. There are many efficient algorithms for finding the shortest path in a network, like dijkstra’s or bellman-ford’s. But what if the graph is dynamic? By saying dynamic I mean that we Read More …

Question Detail: I’ve been struggling with this problem for quite a while now and every explanation I have managed to find doesn’t seem to correctly solve it. We have the language L = {$ { a^{2^n} | n ge 0 } Read More …

Question Detail: I have this question: Input: G(V, E) = an undirected graph, V={v1, v2, …, vn} (V = set of nodes, E = set of edges) where there is a path connecting from v1 to vn. Question: What is the Read More …

Question Detail: As a software engineer, I write a lot of code for industrial products. Relatively complicated stuff with classes, threads, some design efforts, but also some compromises for performance. I do a lot of testing, and I am tired of Read More …

Question Detail: Note: I moved this question from stackoverflow.com I have an algorithmic problem where I would like to see if it can be solved in better than $O(n)$: I have given a table $T$ of $n$ elements where each element Read More …

Question Detail: I am looking for practical applications of Finite State Machines like DFA, NFA, Moore, Mealy machines… It would be helpful if someone point to examples from Linux Kernel. I know that DFA is used in string matching like KMP Read More …