The records for this database will be stored on discs which have an average access time of 2.5ms to read a block of 4Kbytes. Each disc uses a 32-bit integer to address blocks within the disc. The database spreads over multiple discs, so a 16-bit disc identifier has to be added to each block address. It takes 150ns to read a word from the computer's main memory. Work out the minimum and maximum values for the space - in either disc blocks or bytes.
Many compilers align fields on to word boundaries for efficiency.
Work out which of the algorithms that you have studied so far will produce stable sorts. You are given an array containing n integers. You are asked to determine if the list contains two numbers that sum to some arbitrary integer, k . Dynamically Balanced Trees Show that any AVL tree can be coloured as a red-black tree. Dynamic Memory Allocation Modern object-oriented software makes extensive use of the malloc and free operations.