Give the state of the disjoint-sets data structure after the following sequence of operations, starting from singleton sets {1},...,{8}. Use path compression. In case of ties, always make the higher numbered root point to the lower numbered one. union(1, 2), union(3, 4), union(5, 6), union(4, 8), union(1, 5), find(3), union(2, 3), find(6)

The reset circuit used on the four 3-bit counters analyzed in this activity reset the counts to zero (000). it makes sense for the up-counters to start at zero (000), but the down-counters should start at seven (111). what would you need to change so that the 3-bit binary down counter with j/k flip-flops you just created would reset to seven (111)?

You need a reliable network for about twenty-five computers that will be distributed across a large building. it is important that the network be relatively cheap. which topology should you use?

Consider a byte-addressable computer with 16mb of main memory, a cache capable of storing a total of 64kb of data and block size of 32 bytes. (a) how many bits in the memory address? (b) how many blocks are in the cache? (c) specify the format of the memory address, including names and sizes, when the cache is: 1. direct-mapped 2. 4-way set associative 3. fully associative