cs351_f11_pa1 - CS 351 Data Organization and Management...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CS 351 Data Organization and Management FALL 2011 - Programming Project #1 Union of Sequential Files Due: November 3, 2011 at 11:59 PM In this project you are asked to implement a Java console application which aims to find the union of two piles (F1 and F2) and write it to an output text file (F12). For this purpose, you must think as if you have limited memory so that you are able to understand the intuition behind processing block-by-block reading and writing in a practical way. Therefore, the memory capacity is much less than the sizes of input files. You are not given any particular algorithm for finding the union; however, you are expected to write an algorithm which efficiently finds the union (i.e. as minimum read/write operations as possible). You are also supposed to write a short report which explains your algorithm. Moreover, record your execution time for finding the union, and state it in the report. Look at “How to time your Execution?” section to record your time. Please read the following specifications carefully before starting to your implementation. 1. File Structures
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

cs351_f11_pa1 - CS 351 Data Organization and Management...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online