A Level Computing#BristolMet Session Objectives#U2 S7 MUST understand the difference between an array and record SHOULD be able to estimate the size of.

Slides:



Advertisements
Similar presentations
DT266/2 Information Systems COBOL Revision. Chapters 1 & 2 Hutty & Spence Divisions of a Cobol Program Identification Division Program-ID. Environment.
Advertisements

Content 15.1 Basic features Types of database Data structures 15.2 Creating a database Screen layout Entering data Editing data 15.3 Displaying data Searching.
Indexing Large Data COMP # 22
Using a database to organize information
Methods of Access Serial Sequential Indexed Sequential Random Access
Introduction to Database Systems1 Records and Files Storage Technology: Topic 3.
A Level Computing#BristolMet Session Objectives#U2 S8 MUST identify the difference between a procedure and a function SHOULD explain the need for parameters.
Data Structures: A Pseudocode Approach with C
Session Objectives# 24 COULD code the solution for an algorithm
Files  File organisation and usage A record is a group of logically related fields A file is a group of logically related records Files are used to store.
Alford Academy Business Education and Computing1 Advanced Higher Computing Based on Heriot-Watt University Scholar Materials File Handling.
Page 13 1.a) A block is a group of records. A block is referred to as the UNIT of TRANSFER In computer files as when a record is searched / updated the.
23/05/20151 Data Structures Random Access Files. 223/05/2015 Learning Objectives Explain Random Access Searches. Explain the purpose and operation of.
Database Design Concepts Info 1408 Lecture 2 An Introduction to Data Storage.
Database Design Concepts Info 1408 Lecture 2 An Introduction to Data Storage.
A-Level Computing#BristolMet Session Objectives#4 MUST describe the differences between the main types of primary memory SHOULD describe the function and.
School of Engineering and Computer Science Victoria University of Wellington Copyright: Xiaoying Gao, Peter Andreae, VUW Indexing Large Data COMP
File Organization Techniques
Bits and Bytes in a computers memory Inside the computer are millions of electronic switches. These are grouped together in bundles of 8. A switch can.
Chapter 13 File Structures. Understand the file access methods. Describe the characteristics of a sequential file. After reading this chapter, the reader.
A Level Computing#BristolMet Session Objectives U2#S6 MUST identify different data types used in programming aka variable types SHOULD describe each data.
A Level Computing#BristolMet Session ObjectivesU2#S10 MUST describe the difference between constants, local and global variables SHOULD explain why constants.
Computers Data Representation Chapter 3, SA. Data Representation and Processing Data and information processors must be able to: Recognize external data.
The Fun That Is File Structures Pages By: Christine Zeitschel.
A Level Computing#BristolMet Session Objectives U2#S9 MUST identify operators and operands SHOULD describe different types of operator COULD Create an.
Cis303a_chapt03-2a.ppt Range Overflow Fixed length of bits to hold numeric data Can hold a maximum positive number (unsigned) X X X X X X X X X X X X X.
Data and its manifestations. Storage and Retrieval techniques.
Extended Prelude to Programming Concepts & Design, 3/e by Stewart Venit and Elizabeth Drake Chapter 6: Sequential Data Files.
Comparing AlgorithmsCSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Complexity Reading: Kolman, Sections 4.6, 5.2, and 5.3.
1 3 Computing System Fundamentals 3.2 Computer Architecture.
Session 8: Databases Teaching Computing to GCSE Level with Python.
External data structures
Databases. What is a database?  A database is used to store data. The word DATA is actually Latin for FACTS. A database is, therefore, a place, or thing.
INFORMATION MANAGEMENT Unit 2 SO 4 Explain the advantages of using a database approach compared to using traditional file processing; Advantages including.
Storage Structures. Memory Hierarchies Primary Storage –Registers –Cache memory –RAM Secondary Storage –Magnetic disks –Magnetic tape –CDROM (read-only.
A Level Computing#BristolMet Session ObjectivesU2#S12 MUST describe the terms modal and pretty printing in term of input and output facilities. SHOULD.
3 Data. Software And Data Data Data element – a single, meaningful unit of data. Name Social Security Number Data structure – a set of related data elements.
Computer Science Projects Internal Assessment. Mastery Item Claimed Justification Where Listed Random Access File – Searching Lines P. 53 Random.
Database Management Systems (DBMS)
Database Indexing 1 After this lecture, you should be able to:  Understand why we need database indexing.  Define indexes for your tables in MySQL. 
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall Chapter 9 Designing Databases 9.1.
GCSE Computing#BristolMet Session Objectives#8 MUST add two 8-bit binary integers SHOULD explain overflow errors COULD provide solutions to limit overflow.
A Level Computing#BristolMet Session Objectives#U2 S3 MUST use/read programme flow charts accurately SHOULD adapt the calculator programme to include a.
CSCI 6962: Server-side Design and Programming Shopping Carts and Databases.
GCSE Computing#BristolMet Session Objectives #23 MUST understand what is meant by the programming term iteration SHOULD describe methods of looping used.
VSAM ESDS and RRDS Department of Computer Science Northern Illinois University September 2005 Some of the illustrations are from VSAM: Access Method Services.
A Level Computing#BristolMet Session Objectives#U2S11 MUST identify built-in string manipulation functions SHOULD correctly use string manipulation functions.
11-1 © Prentice Hall, 2004 Chapter 11: Physical Database Design Object-Oriented Systems Analysis and Design Joey F. George, Dinesh Batra, Joseph S. Valacich,
Linking Loader untuk SIC/XE Machine. Lebih Lanjut mengenai Absolute Loader Shortcoming of an absolute loader –Programmer needs to specify the actual address.
DATA MANAGEMENT 1) File StructureFile Structure 2) Physical OrganisationPhysical Organisation 3) Logical OrganisationLogical Organisation 4) File OrganisationFile.
B065: PROGRAMMING WRITING TO CSVFILES. Starter  Quick task:  Write a program which asks for the name and age of 3 students and writes these details.
What is a Computer An electronic, digital device that stores and processes information. A machine that accepts input, processes it according to specified.
CSC 143T 1 CSC 143 Highlights of Tables and Hashing [Chapter 11 p (Tables)] [Chapter 12 p (Hashing)]
GCSE ICT How data is stored. How is data stored? Data can be stored in paper-based systems including: –Reference books –Dictionaries –Encyclopaedias –Directories.
SVBIT SUBJECT:- Operating System TOPICS:- File Management
OCR Computing GCSE © Hodder Education 2013 Slide 1 OCR GCSE Computing Python programming 10: Files.
Chapter 9: Data types and data structures OCR Computing for A Level © Hodder Education 2009.
( ) 1 Chapter # 8 How Data is stored DATABASE.
The Data Types and Data Structures
3.2.3 Data types and data structures
LEARNING OBJECTIVES O(1), O(N) and O(LogN) access times. Hashing:
Database Management System
M3 - Estimating the size of a database
Chapter 11: File System Implementation
Fill the screen challenge!
Databases Lesson 2.
Learning to Program in Python
Files [Computing] Computing.
Random Access Files / Direct Access Files
Presentation transcript:

A Level Computing#BristolMet Session Objectives#U2 S7 MUST understand the difference between an array and record SHOULD be able to estimate the size of a file COULD explain different methods of organising files in programming terms. Code programmes which will read and write data to an external files in Python.

A Level Computing#BristolMet Key Words

A Level Computing#BristolMet File Organisation When programme files are created, the data used in that file is stored in different ways. Serial file – the data is stored in the order which it arrives. New data is added to the end, which is called appending. (e.g like a shopping list, would be a non computerised serial file) Sequential file – data is stored according to a key field in the data that can be used to identify each individual record, like an ID field. Adding new items requires the file to be recreated as the new data needs to be inserted in the correct position with the records and not simply added to the end. (e.g a class register would be a non computerised sequential file) Indexed Sequential – are sequential but have an index which allows records to be found directly. Random files – In all of the above examples, records are stored next to each other. A random file allows the data to be stored anywhere in a dedicated section of the disk. The location of the field is decided by a calculation called a hash algorithm. Finding these files is very quick, if you know the algorithm and key field, therefore random files are useful for large databases.

A Level Computing#BristolMet File Handling Operations It is often useful to programme data in an external file, this requires the use of file operations to prepare, read and write to file Preparing a file – most languages use the OPEN command and specify file name/path. Read data from file – commands differ from among languages but simplest way is to read one line at a time from a serial/sequential files. For random files, lines are read from specific address given in the code. Writing data: This can merging (combining in new and old) as in sequential files, or appending (adding to the end) as in serial files.

A Level Computing#BristolMet File Writing Operations TASK: Use the writetofile program and experiment creating different text files with different lines of text by changing the commands. TASK 2: Create an external text file, with a suitable filename, containing the first 2 verses of a song or poem. NB Make sure you have a line break between the 2 verses. EXT: Extend your calculator programmes so that the answers are written to an external file. (The file should contain some explanatory text, ie The Answer = …

A Level Computing#BristolMet Estimating File Sizes It is possible to estimate the size of a file by calculating the following: The size (in bytes) of each field in the record (for a string use the largest size allowed) Add the field sizes to calculate the size of one record. Multiply the size of one record by the number of records in the file Add 10% to the result, for additional storage that will be needed to manage the file on disk (this is call an overhead). TASK: Attempt Q2 on p.97 of the Hodder book.