CpSc 343 OutlineFile Processing – Updated 3/24/2004Catalog DescriptionAudienceLearning ActivitiesOutlineCpSc 343 OutlineFile Processing – Updated 3/24/2004Catalog DescriptionA practical study of information storage and retrieval using computer data files. Fundamental file structures and organization are emphasized and exemplified through a programming language on personal computers. Advanced file structures and organizations are discussed. Prerequisite: CpSc 140. (3 credits)Audience Required: IS for Allied Areas Elective: ITLearning ActivitiesTogether the student and professor will:1. Discuss the progression from single user to multi-user systems, and from historic to modern devices and operating systems.2. Discuss privacy and access control, including files that have been “deleted” or are stored on a shared medium such as a disk drive or RAM.3. Discuss data views and proper use of information accessed.4. Discuss methods of representing digital information on various media.5. Discuss methods of organizing information and the relative efficiency of each.6. Calculate the efficiency of specific file organizations for particular media.7. Contrast media in terms of cost and efficiency.8. Discuss the syntax and semantics of a programming language used for file access.OutlineI. Introduction to the history of computing and the evolution to the currentstate-of-the-art – 1 hour – LUN: 53II. Introduction to File Processing – 1 hour – LUN: 53a. The problem and trade-offs of File Processing b. A Short History of File ProcessingIII. Fundamentals of File Processing Operations – 5 hours – LUN: 53, 58a. The concept of physical as compared to logical filesb. File operations: Opening, closing, reading, writing, and seeking c. Specifics of files in representative operating systems: Unix and Windows CpSc 343 Outline Page 1 3/24/2004IV. Characteristics of, and Organization of Data on Secondary Storage Devices – 6 hours – LUN: 53a. Disks vs. tapesb. CD-ROMc. Comparison and storage hierarchyd. Layers of abstraction and buffer managementV. File Structure Concepts – 6 hours – LUN: 53a. Fields and records organizationb. Field, record and file accessc. Representation in a programming language of choiceVI. Organizations to Improve Space and Time Performance – 5 hours – LUN: 53, 57, 58a. Data compression and reclaiming space in filesb. Introduction to external sorting and comparison with Internal Sorting, using keysorting as an exampleVII. Indexing – 1 hour – LUN: 55, 57, 58a. The conceptb. Examples of indexed filesVIII. Cosequential Processing and Sorting – 2 hour – LUN: 55, 57, 58a. The concept of cosequential operations and processing modelb. Searching and sorting examples of cosequential operationsIX. Multi-Level Indexing and B-Trees – 7 hours – LUN: 55, 57, 58a. Historical perspectiveb. Set the stage: Goals and the inadequacy of indexing and binary search as a general solutionc. Multi-level indexing as a solution to access timed. B-Trees as a solution to both access time and dynamic changes in the file contente. B*-Trees as an extension of B-TreesX. Static Hashing – 6 hours – LUN: 55, 57, 58a. The concept; comparison with indexingb. Hashing function and record distribution; criteria of a good hashing function; address space and packing densityc. Collisions and methods of resolutiond. Effect of deletione. Extension to dynamic hashingTotal: 40 hoursCpSc 343 Outline Page 2