3. Data types and data structures

Mind Map by , created over 5 years ago

A levels Computing Mind Map on 3. Data types and data structures, created by deepi1k73 on 04/03/2014.

Created by deepi1k73 over 5 years ago
Memory Key words
Sammy :P
Biological Psychology - Stress
Gurdev Manchanda
AS Biology Unit 1
Cell Parts & Genetics
Selam H
Computer Science Flash Cards For Section 1
Harman Rai
A level Computing Quiz
Zacchaeus Snape
Cells And Cell Techniques - Flashcards (AQA AS-Level Biology)
Henry Kitchen
PSYA1 - attachment, AQA psychology
Tess W
OCR Chemistry - Atoms, Bonds and Groups (Definitions)
3. Data types and data structures
1 Data types
1.1 Numeric
1.1.1 Advantages Calculations can be done Program can alter format
1.1.2 two types Integer- whole numbers readl/double/float- decimal numbers
1.2 Boolean- only has two options- yes or no
1.2.1 Advantages validated- less prone to errors easy to understand les storage space
1.2.2 Disadvantages limited options
1.3 text
1.3.1 two types String- texts or numbers that are stored in the ASCII code character- a string with 1 data size
1.3.2 advantages can store anything
1.3.3 disadvantages can't do calculations
2 Arrays
2.1 A data structure (group of data) of the same data type grouped under one identifier. All the data stayed contiguously in computer memory
2.2 Dimensions
2.2.1 1D- list of data Advanatges Easy to implement Disadvantages limited space same data type
2.2.2 2D- stores in a grid Advanatges good for games Simple to program Disadvantages limited in size same data type
2.2.3 can have up to 32D but most people go up to about 3D
2.3 declaring an array
2.3.1 initialise (give a name)- easy to access
2.3.2 size of the array- locations of the memory will be reserved
2.3.3 dimensions- allow position to have meaning
2.3.4 Data type- allow correct data to be stored
3 Record Format
3.1 file- large quantity of data (multiple records
3.1.1 To write:
3.1.2 To read:
3.2 Record- info. on one particular thing (multiple fields)
3.3 field- one type of information
3.4 Key field- unique field- used as an identifier
3.5 fixed length- each record has a certain assigned amount of space
3.5.1 quicker to search
3.5.2 easier for the computer to store things
4 Files
4.1 file access
4.1.1 Serial- stored in the order it arrives, To add- it just adds on, To delete- copy files to a separate tape leaving the one that needs to be deleted. Advantage- quick to store Disadvantage- inefficient to locate
4.1.2 Sequential- puts sorted order depending a key field, To add- copy files to a separate tape leaving the one that needs to be deleted. To delete- same as above just delete unwanted files Advantage- search time is quicker Disadvantage- longer to write
4.1.3 Random- has a space and the data is stored anywhere depending on the answer got by a hash calculation done on the key field, To delete- say that it is invalid and then overwrite it. Advantage- quick to read and write Disadvantage- inefficient when there is a large amount of data
4.1.4 Direct- finds data instantly by using its length Advantage-quick to search Disadvantage-only works with fixed length records
4.1.5 Index sequential-like sequential but has an index Advantages and disadvantages same as sequential but more quicker/ longer
4.2 files: store, retrieve and search,
4.2.1 1. define the stream (computers can know which stream using as a multiple streams are being used) 2. use the stream (read/write) 3. close the stream
4.2.2 end of file character- used to show where the end of the file is. allows location of files much easier.
4.3 estimate file sizes
4.3.1 1. consider the data types for each field and then the amount of space required for each type 2. record size- add up each individual field size 3. file size- multiply previous to the number of files 4.files have extra info.- add 10% on 5.ensure that it is in correct units
4.4 programing