1 / 7

File Structures CIS 256

File Structures CIS 256. Chapter 0 Summer 2011 Dr. Ahmad Saifan. General Information. CIS 256 File Structures (Not Data Structures). Prerequisite: CS 250 (Data Structures). Office Hours : 12 – 1 (All days, Maq 304). Course on the web: http://faculty.yu.edu.jo/ahmads/cis256.aspx

emily
Download Presentation

File Structures CIS 256

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. File StructuresCIS 256 Chapter 0 Summer 2011 Dr. Ahmad Saifan

  2. General Information • CIS 256 File Structures (Not Data Structures). • Prerequisite: CS 250 (Data Structures). • Office Hours: 12 – 1 (All days, Maq 304). • Course on the web: http://faculty.yu.edu.jo/ahmads/cis256.aspx • E-mail Address: ahmads@yu.edu.jo

  3. Evaluation Methods • First exam: 20% • Second exam: 20% • Others: (Quiz (1 >), Attendance): 10%. • Final Exam: 50%.

  4. Analytical Examples and Important notes will be given in the class. No slides for such materials.

  5. Course Objective • Objective of Data Structures (CS250) was to teach ways of efficiently organizing and manipulating data in main memory. • In CIS256, you will learn equivalent techniques for organization and manipulation of data in secondary storage. • In the first part of the course, you will learn about "low level" aspects of file manipulation (basic file operations, secondary storage devices and system software). • In the second part of the course, you will learn the most important high-level file structure tools (indexing, co-sequential processing, B trees, Hashing, etc). • You will apply these concepts in the design of C++ programs for solving various file management problems

  6. Outline • Introduction to file management. • Fundamental File Processing Operations. • Managing Files of Records: Sequential and direct access. • Secondary Storage, physical storage devices: disks, tapes and CD-ROM. • System software: I/O system, file system, buffering. • File compression: Huffman code.

  7. Outline • Reclaiming space in files: Internal sorting, binary searching, keysorting. • Indexing • Consequential processing and external sorting • Multilevel indexing and B trees • Indexed sequential files and B+ trees13. • Hashing

More Related