University Project

1.1 Reading and writing: streams Your merge sort implementation will need to read data from, and write data to disk. A rst step, therefore, is to develop stream classes that can sequentially read and write a le consisting of 32-bit integers. 1InputStream is = new FileInputStream( new File("input.data" ) ); DataInputStream ds = new DataInputStream(is); [login to view URL]() [login to view URL] and write is performed by mapping and unmapping a B element portion of the le into internal memory through memory mapping. Whenever you need to read/write outside of the mapped portion, the next B element portion of the le is mapped. 3.1.2 Multi-way merge Implement a d-way merging algorithm that, given d sorted input streams of 32-bit integers, creates a single output stream containing the elements from the input stream in sorted order. The merging should use a priority queue (e.g., a heap) to obtain the next element to be output at all times.