Just be sure to explain at least once in some detail what the term means.

If the question is not from a standard source then it's pointless to waste time on trivial mistakes.

Under normal circumstances we would convert the hexadecimal number to binary and then pick out the tag, index and offset. If your physical memory address is 20 bit long, how are you going to have a 32 bit address in the first place?

@DavidRicherby it seems that I interpreted the question a bit differently than what was intended. OP asked how he could find all vertices in a graph that are part of a cycle. I thought he meant to find all vertices on all cycles of the graph. To do that you would need to find the cycles first and only then you can move onto finding the vertices.

Finding all vertices in a graph that are part of a cycle is the same as finding all elementary cycles in a graph. This is an NP-Hard problem. A standard way of detecting cycles in a directed graph is Tarjan's algorithm.

Could you add if & while clauses to the first and last statements? It's a bit confusing.

Have a look at this: physics.utah.edu/~detar/phys6720/handouts/IEEE.txt

I don't think that's going to work since the IEEE representation with mantissa and exponent only applies to floating point numbers. Here you are talking about integers.

There you go. Added a new section on symmetric matrices.