Computer Science Stack Exchange

Popular pages

• Computer Science Stack Exchange

  Q&A for students, researchers and practitioners of computer science

• computability - Prove that the set of recursive languages is infinite - Computer Science Stack

  I know that set of all deciders is countable. I am wondering whether it is infinite.In other words can we prove that the set of recursive languages is infinite ? Edit : The above question has small

• operating systems - Determine page number and offsets for address references - Computer Science

  I'm working on learning operating systems and I've come across a strange question that I don't know how to answer. The question is: Assuming a 1-KB page size, what are the page numbers and offs...

• computer architecture - How to determine the bits of the address used to access the cache

  Given a non-associative, direct-mapped cache and its cache capacity, block size, and address size, how would I go about determining what bits of the address are used to access to cache? Is there a

• algorithms - What is the space complexity of quicksort? - Computer Science Stack Exchange

  What is the space complexity of quicksort? I was doing some research and found some saying it is $O(1)$, some saying it's $O(\log n)$, and some saying $O(n)$. Not sure what to believe, even though ...

• computer architecture - How to calculate the number of tag, index and offset bits of different

  Specifically: 1) A direct-mapped cache with 4096 blocks/lines in which each block has 8 32-bit words. How many bits are needed for the tag and index fields, assuming a 32-bit address? 2) Same que...