Question Detail: Possible Duplicate: Is the k-clique problem NP-complete? I’ve been lately reading about the clique problem, specifically, the variety of the clique problem of deciding whether a given graph $G$ with $n$ nodes has a clique of at least Read More …
Blog
Is there anything that MUST be done on a multi-core CPU?
Question Detail: When considering how multi-thread-friendly our program must be, my team puzzled about whether there’s anything that absolutely cannot be done on a single-core CPU. I posited that graphics processing requires massively parallel processing, but they argue that things like Read More …
How does increasing the page size affect the number of page faults?
Question Detail: If we let the physical memory size remain constant, What effect does the size of the page have on the number of frames? What effect does the number of frames have on the number of page faults? Also, please Read More …
What is pass-by-value-result and its advantage and disadvantage?
Question Detail: I have searched on Google, but I can’t quite understand what is pass-by-value-result. What is the advantage and disadvantage of using pass-by-value-result? If I have a program code like this, what will be the result when parameters are passed Read More …
Normalizing the mantissa in floating point representation
Question Detail: How to represent $0.148 * 2^{14}$ in normalized floating point arithmetic with the format 1 – Sign bit 7 – Exponent in Excess-64 form 8 – Mantissa $(0.148)_{10} = (0.00100101;111…)_2$ We shift it 3 bits to left to make Read More …
What is the fastest algorithm for finding all shortest paths in a sparse graph?
Question Detail: In an unweighted, undirected graph with $V$ vertices and $E$ edges such that $2V gt E$, what is the fastest way to find all shortest paths in a graph? Can it be done in faster than Floyd-Warshall which is Read More …
Cache Direct Map (Index, tag, hit/miss)
Question Detail: Alright, I thought I understood this concept but now I am confused. I looked up similar problems and their solutions to practice, and that’s what threw me off. The question is a homework problem which says: Below is a Read More …
Why does Dijkstra’s algorithm fail on a negative weighted graphs?
Question Detail: I know this is probably very basic, I just can’t wrap my head around it. We recently studied about Dijkstra’s algorithm for finding the shortest path between two vertices on a weighted graph. My professor said this algorithm will Read More …
Why is binary search faster than ternary search?
Question Detail: Searching an array of $N$ elements using binary search takes, in the worst case $log_2 N$ iterations because, at each step we trim half of our search space. If, instead, we used ‘ternary search’, we’d cut away two-thirds of Read More …
Is a push-down automaton with two stacks equivalent to a turing machine?
Question Detail: In this answer it is mentioned A regular language can be recognized by a finite automaton. A context-free language requires a stack, and a context sensitive language requires two stacks (which is equivalent to saying it requires a full Read More …
