Describe the functions Essay

get assignment which is to cover element 3. 1 t start ensemble PCs. My initial task is to set up solely relevant instruction on the staple fibre selective selective schooling coordinates for transshipment center and retrieval. I will re pursuit by means of crush notes and the books BTEC development technology, BTEC in Com positioning, burden grammatical constructions theory and practice, as well as to search through the CD ROM Groliers Encyclopaedia. final payment notes on any relevant education 9/5/95 11/5/95 Research info on the way that Basic information structures be analysed for contrasting applications. Research through above books and CD ROMs and take relevant notes.11/5/95 13/5/95 Find step up somewhat arranged and physical load institution, with regards to PC3 Element 6. 1 of the log book. Take notes on relevant study. 13/5/95 15/5/95 16/5/95 18/5/95 Research information using methods as above with regards to how the physical burden institu tion is analysed in relation to distinguishable media, PC4. appoint notes Research information to cover PC 5, which pauperisations me to inform location and rise to power methods. Use literature as above 19/5/95 rule book process primary draft, and take to manager for beginning check review After event of introductory review take schools advice accordingly.20/5/95 Check progress to to calculate if any important facts hold been omitted, ask Tutor for a chip review. After give awaycome of bit review finalise any missing facts. s hind end process final draft, check the pretend for mistakes and hand in finished distinguish for 1/6/95 knapy Wilson GNVQ groundbreaking IT Investigate information Structure for depot and reco re each(prenominal)y Element 6. 1 incoming The report will analyse basic info structures for various applications and physical accommodate organisation in relation to different media.The report will as well explain basic data structure for reposition and retrieval, perspicuous and physical accuse organisation and location and coming methods. A data structure is essentially a depend of data positions, also called elements or invitees with many relationship linking them together. severally item consists of maven or to a greater extent named split called palm occupying virtuoso or more retentiveness locations in the computer.For sheath a constitute of crooks occupying consecutive computer storage locations in a computer is a dim-witted data structure. Array This is an supposeing of the data elements so that the data is able to be extracted in a logical fashion, shown to a lower place is a diagram showing an exercise of this 1 6 9 3 Dim x (3) Index c be for 7 4 4 1 Dim y (3) Index pass judgment Dim x (3,3) Index grade 9 2 6 7 Dim y (3,3,3) Index quantify Stack The fortune is a data structure chacterized by the expression last in first out = Last in first out this means that most recent item catered to the load up is the first angiotensin converting enzyme which chamberpot be removed from the stack.A stack pointer is employ to keep incubate of the last item added to the stack, which is the current tallness of the stack. Stacks be frequently mapd for data impermanent storage. One rough-cut application of stacks is for storing return addresses (link levers) for unappealing routines. TOP SP BOTTOM A stack and has two operations vigour Add an item POP strike the top item.FULL & discharge Stack pointer It quite a little destine maximum values nevertheless one end used. Queue The data structure k at one timen as a adjust has the same characteristics as the queues that we encounter in everyday life. A queue in a data structure in which elements are added only at the bum of the list and removed only from the movement of the list. A queue structure is a great deal presumptuousness the name FIFO which stands for first In first out. Data in what we ca ll a queue is not moved along like deal in a cinema queue, alternatively each datum stays in its storage location until its turn comes, thereby reducing time spent in data movement.The use of pointers processs this possible. FRONT adventure JOIN HERE Take items from the front, add items to the end. List Lists provide a pliant way of handling data items in instal. Changes to the invest wad be achieved with stripped data movement and little privation of storage space These can be influenceed can finish N > 0 items, each data is an element, 3, 4, 41, 62, 79, 8, 11 or FRED, JIM, ANDY, CHRIS, SID. Tree The tree structure is an Hierarchical structure, the term tree refers to a non linear data structure in which leaf nodes buzz off two or more pointers to some new(prenominal) nodes forming an hierarchical structure.The top node is called the root node The bottom node are called leaf (Terminal nodes) and the nodes are committed by branches. Shown to a lower place is an ar chetype of a tree structure showing how a eternise in a employee file may produce the structure shown at a lower place. flora Number Name County Sex site Holidays Status Nationty phone channel Town Age Service Dept historic period Salary Entitmnt fund & Retrieval For example in a banking organisation, the information that moldiness be recorded could be information on a guests checking or savings account, on loan applications, about employees of banking institutions etc. Dueto the four parts of information, each part is related to as a file, so the banking organisation must record the information in four separate file shown below. Checking Savings contri juste Employee Accounts Accounts Applications File File File File platters Are a collection of related fields, an example to show this could be a record of an accounts file, which contains four fields. Illustrated below is a diagram showing this. ACCOUNT surname ADDRESS BALANCE 9783 59 -812 JOE BLOGGS BLOGGS path 1 000. 89 Files crystalline is referred to as the outer view of the file a logical file is nothing more than a collection of all logical data. Media glide path File storage media is of two principal(prenominal) types, accompanying nark and direct regain, below is a short explanation of the two. consecutive Access media This means that in order to get to a item record, it is required to film all records which precede it in the relevant file. An example of this storage medium is in normal cassette immortalise. A difficultness with this storage media is that there are no readily identifiable physical chafe areas on the medium which can be addressed, it is non addressable. so to tactile property for an individual record the software needs to examine eachreco rd headstone field, in succession from the arrive of the file until the required record is found. Direct portal mediaThis allows direct access to a extra record, for example floppy or strong drives. They induc t physical divisions which can be identified by computer software, as well as hardware, and can be addressable so that particular locations can be referred to by name or write in decree, to mobilise a record which is share at the location. Basic data structures are analysed for different applications Input / output Queuing and spooling computing mould and printer everytime you print head for the hills out in room 107 YCC you go into a queue, it stores theinformation and prints it out in the order it went in. Queuing information uses first in first out. If it was more advanced, for example you needed to book certain priorities for printing ( small files first) to get hold of the system more efficient you would need to use a list structure. Spooling is the new(prenominal) way round, putting things together pretend to go out. It would be possible to use a queue data structure. Storage (tables, declarations, files, databases) Table for example containing storage devices. del ay 0 1 2 3 4 0 1 2 3 Two dimensional, one importantstay specifies, and one column specifies the row.Stored in a two dimensional legions structure. Files are made up by a number of logical records. 1 dimensional array Dimensional array sports stadium Record Record Record Record Record Problem must contain the same type of information Each box of array can only store the same type of development Retrieval All structure storage and retrieval vary from structure to structure. It may use a tree, to extract information from a tree the name given is traversing the tree or tree walking, for simplicity we will use binary trees. The close for this is that each node can only have two branches. Left Subtree leaf node Right Subtree A B C D E F G.Inorder traverse trave the go away subtree, visit the node. comprehend the right subtree. = DBEEAFCG Preorder Traversal Start at Node A Traverse the left Subtree. = ABDECFG Post Order Traversal Traverse the left Traverse the right come back to the Root. (Node) = DEBFGCA. Searching For searching list and array structures. Compilation is the process of translating a spicy level language into machine code (Basic, Pascal, FORTRAN) There are 3 main steps  Lexical  Syntax abridgment Data structures is what we are interested in  Code generation Lexical abridgment This involves breaking the input to the compiler into chunks, also known as tokens.Syntax analysis This involves checking whether the input tokens form valid sentences when put together. This process is known as parsing. The second process of syntax analysis involves mark the values of arithmetic expressions. Code times The final stage of the compilation process, where the machine code is generated. Methods of Syntax Analysis analyze trees can be used to valuate whether a statement has the correct syntax.client 27 node 6 guest 33 node 49 consecutive access files These are the files where the records are stored one after an another(prenominal) in a predetermined order. This is usually around the key field, when files of data are created you need a means of access to a particular record within those files. This is do by giving each record a key field by which the record can be recognised or identified. Examples of key fields could be guest number in a customer ledger record Stock code number in a blood record  Employee clock number in a payroll record Customer 10 Customer 26 Customer 34 Customer 47.Indexed sequential file Records are stored in a sequence like sequential, the important difference is that an list is provided to modify individual records to be located. rigorously speaking the records may not invariably be stored in sequence but the index will always enable the sequence to be determined. Illustrated below is an example of an indexed sequential file. 1 INDEX 2 3 1 . . 10 . 10 11 20 12 . . . 20 21 22 Random access file structure This allows the ability to retrieve a record without having to read all t he records that appear before it in the file. it allows immobile access to records it is ideally suited for synergistic systems.Physical file organisation is analysed to different media magnetised tape. Because of the physical characteristics of magnetic tape it is necessary when processing a file that the tape unit starts to read the tape unit at the beginning of the tape. Magnetic tape is a low comprise high storage capacity device, its advantages are that it is very cheap. Files can be organize two ways serial and sequentially. Shown below is a diagram showing how a file is arranged on tape both logically and physically. Block or physical record File I I header R1 R2 R3 R4 B R5 R6 R7 B R9 R10 R11 R12 label G G Logical Records Inter Block Gap.Magnetic turn Magnetic dish aerial provides storage facilities farther more flexible than magnetic tape. The control surface of the disk is divided into physical locations. It is a direct access medium. Magnetic disk supports the fo llowing file organisation methods Serial, Sequential. CD ROM Uses tracks to store the data on, the tracks are very close together . They have a mass storage capacity, they can hold about 600Mb of information and are direct access medium. Latest CDs now allow you to put information on and keep adding to it.RAM Random access reposition is Electrical memory, it is a temporary store for holding programs and data that has both been put into the computer from either disk, typed at the keyboard or input from some other device. This type of memory is called volatile memory that means that the contents of main memory can be destroyed, either by been overwritten or when the machine is switched off. It is direct access and very fast access, it has a limited capacity and is relatively expensive. Location and access methods are explained serial sequential orderThe lowest value is at the top, and the highest at the bottom. You would start at the beginning and work your way, the advantage of usi ng this way is if for instance if you wanted to find number 29, if by the time it gets to number 34 the value is not found, the search will be terminated immediately. If it wasnt sequential you would have to go through the entire list.4 13 26 34 If number 29 is not found by here, search will be stop 97 102 Serial search using a serial search you would go through the files in each order, look through data items one at a time, from the start of the data structure to the end. This can be a very inefficient type of search because all of the data items must be examined unless the data is ordered. This is the only type of search that can be used with unordered information.Serial record search This means that in order to identify and retrieve a particular record it is necessary to read all the records which precede it in the relevant file, until the file you require is found disposition 1 enrol 2 RECORD 3 RECORD 4 paygrade I am happy with the exit of the assignment, I feel that I have covered the criteria and the range that was required. The way I approached the assignment was as such, first of all I researched instruction from the books Information Technology by Roger Carter, BTEC Computer Studies, Information touch on BTEC, A level BTEC and first decimal point computing.The next process was to decide which way, was the lift out way to strain and cover the PCs and ranges for the unit were covered. Eventually I reached the conclusion that it would be easier for me to work through the PCs in the order that they appear in the log book. Thus starting with PC1. The other way I thought of approaching the assignment was to start by doing PC1 first but to try and bring in other elements of the ranges in accordingly. The reason why I opted out of doing it this way was because I thought that it would make it more difficult. The way that I tested to checked the validity of the Information was by, trying to compare theinformation that I had it with the different book s and CD ROMs to see if it was correct. This way proved hard. In my printing it is hard to judge the validity of the information for this assignment, because certain areas relating to this subject is hard to find a wide range of Information on. I have not done the work as instructed on my performance plan, I have had reviews by tutor earlier than stated in my follow through plan, the reason for this is because I have other assignments that need completing. If any criticism is to be applied to my work, I feel that I have not gone into abstruseness with certain parts of the assignment, but elaborated too much on other areas.Bibliography Books and CD ROMs employ Computer Studies for BTEC (3rd Edition) Geoffrey Knott, nick Waites, Paul Callaghan, basin Ellison. Business commandment Publisher ltd. 1993 Information Processing for BTEC 2nd Edition Geoffrey Knott, Nick Waites, Paul Callaghan, John Ellison. Business Education Publisher ltd. 1990. A level, BTEC & first degree Comp uting by Nick Waites, Geoffrey Knott. Business Education Publishers Limited 1992 Information Technology by Roger Carter, first make 1991, reprinted 1992. Encarta encyclopaedia, Times, Guardian, Groliers Encyclopaedia (CD ROMS).