EDEXCEL Computer SCienCe
EDEXCEL ComputEr SCiEnCE for GCSEComputerSCienCeSAMPLECHAPTERSSteve Cushing
Meet the challenges of the new GCSE specification with print and digital resourcesto support your planning, teaching and assessment needs alongside specialist-led CPDevents to help inspire and create confidence in the classroom.We will be seeking endorsement for the following textbook :Edexcel GCSE Computer Science Student Book 9781471866227 June 2016 19.99Visit xcel to pre-order your classsets, or to sign up for your Inspection Copies or eInspection Copies.Also available:Edexcel GCSE Computer Science Dynamic LearningDynamic Learning is an innovative online subscription service with interactive resources, lesson planning tools, selfmarking tests, a variety of assessment options and eTextbook elements that all work together to create the ultimate classroomand homework resource.“I’d have no time left to teach if I collected all these resources. It’s a great time saver.”Caroline Ellis, Newquay Tretherras9781471886621 February 2017 8.99To sign up for a free 30-day trial, visit www.hoddereducation.co.uk/dynamiclearningMy Revision Notes: Edexcel GCSE Computer ScienceEnsure your students have the knowledge and skills needed to unlock their full potential with this revision guide from ourbest-selling series.Prices from 9.99Pub date: January 2017To sign up for Inspection Copies visit xcelPhilip Allan EventsEnsure that you are fully prepared for the upcoming changes by attending our specialist-led CPD courses.For more information and to book your place visit www.hoddereducation.co.uk/Events
EDEXCEL Computer Science for GCSEComputerScienceSteve Cushing
Although every effort has been made to ensure that website addresses are correct at time of goingto press, Hodder Education cannot be held responsible for the content of any website mentioned. Itis sometimes possible to find a relocated web page by typing in the address of the home page for awebsite in the URL window of your browser.Hachette UK’s policy is to use papers that are natural, renewable and recyclable products and madefrom wood grown in sustainable forests. The logging and manufacturing processes are expected toconform to the environmental regulations of the country of origin.Orders: please contact Bookpoint Ltd, 130 Milton Park, Abingdon, Oxon OX14 4SB. Telephone:(44) 01235 827720. Fax: (44) 01235 400454. Lines are open 9.00–17.00, Monday to Saturday, with a24-hour message answering service. Visit our website at www.hoddereducation.co.uk Steve Cushing 2016First published in 2016 byHodder EducationAn Hachette UK Company,Carmelite House50 Victoria EmbankmentLondon EC4Y 0DZAll rights reserved. Apart from any use permitted under UK copyright law, no part of this publicationmay be reproduced or transmitted in any form or by any means, electronic or mechanical, includingphotocopying and recording, or held within any information storage and retrieval system, withoutpermission in writing from the publisher or under licence from the Copyright Licensing AgencyLimited. Further details of such licences (for reprographic reproduction) may be obtained from theCopyright Licensing Agency Limited, Saffron House, 6–10 Kirby Street, London EC1N 8TS.Cover photo Antonis Papantoniou – Thinkstock.com
ContentsContentsSection one: Problem solving123Computational thinkingUsing flowchartsPseudo-codeSection two: Programming4567891011121314Mathematical skills in computer scienceLoops and mathematical operationsVariables and constantsProgramming in codeIteration and selectionBoolean and logic gatesStructuring programs in a modular waySubroutinesTesting your codeAlgorithm efficiencyComparing pseudo-code, flowcharts and codeSection three: Data15161718192021222324256The language computers actually useBinary and hexadecimal numbersComputing and data representationData types and structuresData structuresData and program validation and verificationData size, storage and compressionDatabasesReading and writing to a text fileEncryptionUnderstanding search and sort algorithms
Section four: Computers262728293031The computer systems architectureMemorySecondary storageCloud computingFetch-Decode-Execute cycleSoftwareSection five: Communication and the Internet3233NetworksNetwork data transferSection Six: Emerging trends, issues and impact34353637Personal vulnerabilitiesSocial engineering and cyber securityEthics and the lawEmbedded systemsSection seven: Set practical project38Project7
2 Using flowchartsSpecification referencesYou should:1.1.1 understand what an algorithm is, whatalgorithms are used for and be able to interpretalgorithms (flowcharts, pseudo-code, writtendescriptions, program code)1.1.2 understand how to create an algorithm tosolve a particular problem, making use ofprogramming constructs (sequence, selection,Key pointsA flowchart is a diagramrepresentation of an algorithm. For the examination, you willneed to be able to interpretflowcharts. Flowcharts are a graphicalmethod of designingprograms. A well-drawn flowchart is easyto read. iteration) and using appropriate conventions(flowchart, pseudo-code, written description,draft program code)1.1.3 understand the purpose of a given algorithmand how an algorithm works1.1.4 understand how to determine the correctoutput of an algorithm for a given set of data2.4.1 understand how to write code that accepts andresponds appropriately to user inputThere are a lot of different design procedures and techniques forbuilding large software projects. The technique discussed in thischapter, however, is for smaller coding projects and is referred toby the term ‘top down, structured flowchart methodology’. Wewill explore how to take a task and represent it using a flowchart.A flowchart puts the sentences from a sequence into shapedboxes. The shapes indicate the action.You will know from the last chapter that a sequence is where a setof instructions or actions are ordered, meaning that each actionfollows the previous action.Key pointIn a flowchart the lines expressthe order of execution.8Figure 2.1 A sequence
General rules for flowchartsFlowchart advantages Flowcharts are a graphical way of writing pseudo-code.They are all standardised: we all pretty much agree on thesymbols and their meaning.They are very visual.Flowchart disadvantages Flowcharts can be time consuming and difficult to modify.They need special software for symbols although some softwarehas these built in.The structured design elements are not all implemented.General rules for flowchartsKey pointsFlowcharts must have flowlines with arrows to show theorder of execution. An algorithm is a sequence ofsteps that can be followed tocomplete a task. A sequence is where a setof instructions or actions areordered, meaning that eachaction follows the previousaction. All symbols of the flowchart are connected by flow lines(these must be arrows not lines to show direction).Flow lines enter the top of the symbol and exit out the bottom,except for the Decision symbol, which can have flow linesexiting from the bottom or the sides.Flowcharts are drawn so flow generally goes from the top tothe bottom of the page.The beginning and the end of the flowchart is indicated usingthe Terminal symbol.Let’s look at a simple sequence. Say we want to calculate A plus B,where A 200 and B 400.StartA 200 B 400StartAdd 200 400Output 600EndWe could create the simple flow chart shown in Figure 2.2.Task1 Produce a sequence to showhow to brush your teeth.Questions1 What is a Terminator?2 What is a Sequence?3 What is an Input/Output?Let's look at a another sequence,for example the sequence you carryout each morning in the bathroom.This sequence could be: Brush teeth Wash face Comb hair.Action 1EndFigure 2.2 A simple flowchartAs you can see, sequences are a useful tool for showing whathappens and in what logical order, but each step, for example‘brush teeth’, needs to be defined in more detail to be carried out.9
2 Using flowchartsOnce we have picked up our toothbrush, turned on the tap andadded the toothpaste we can put the toothbrush in our mouth andbrush. The act of actually brushing your teeth could be recordedin a linear way (press, brush up, brush down, brush up, brushdown, etc.), but it would be much simpler to explain the brushingonce and then tell the user to repeat the same action x times. Wewill explore this later when we consider looping (iteration), but fornow let us explore how we can use a flowchart to represent simplesequences. First we need a few more elements.Key pointCleaning your teeth is called a procedure in coding. You perform thesame action every day, for example: pick up brush, put toothpaste onbrush, brush teeth for two minutes, spit out, clean brush. These actionscould be given a procedure name: ‘Brushing Teeth’.Key pointsYou use a PROCESS symbolfor an OPERATION or ACTIONSTEP. You use a TERMINATORsymbol for a START or END ina PROCESS. You use a DECISION symbolfor a QUESTION or BRANCH ofa process. Flowchart symbols contain textcalled labels. For the examination, you willneed to understand how tocreate an algorithm using aflowchart. Basic elements of flowchartsThe flowchart symbols denoting the basic building blocks ofprogramming are shown in Figure 2.3 below. Text inside a symbolis called a ROCESSSymbolDECISIONSymbolFigure 2.3 Basic elements of a flowchartThe START symbol represents the start of a process.The process symbol is labelled with a brief description of theprocess carried out by the flowchart. The END symbol representsthe end of a process. It contains either ‘End’ or ‘Return’ dependingon its function in the overall process of the flowchart.Representing a processA PROCESS symbol is representative of some operation that iscarried out on an element of data. It usually contains a briefdescription of the process being carried out on the data. It ispossible that the process could be even further broken down into10
Basic elements of flowchartsKey pointsAll flowcharts must have aSTART and an END symbol. The DECISION symbol willhave exactly one input and twooutputs. simpler steps by another complete flowchart representing thatprocess. If this is the case, the flowchart that represents theprocess will have the same label in the ‘Start’ symbol as thedescription in the ‘Process’ symbol at the higher level. A processalways has exactly one input arrow and one output arrow.In practice, sequences are not a simple line. Often the next actiondepends on the last decision. This is called selection. In selection,one statement within a set of program statements is executeddepending on the state of the program at that instance. We ask aquestion and choose one of two possible actions based upon thatdecision.Representing a decisionKey pointsOne of the most confusingthings in a flowchart is tellingthe loops apart from theselections. This is becauseboth use the diamond shapeas their control symbol. Markthem clearly. A ‘Decision’ symbol alwaysmakes a Boolean choice. A DECISION/SELECTION symbol always makes a Boolean choice.We will explore Booleans in more detail later in the book. Thelabel in a decision symbol should be a question that clearly hasonly two possible answers to select from.Conditiontrue?NoYesFigure 2.4 How to represent a decisionThe DECISION symbol will have exactly one input arrow and twooutput arrows. The two outputs will be labelled with the twoanswers to the question, in order to show the direction of thelogic flow depending upon the selection made.Selections are usually expressed as decision key words, such as ‘if. then . else . endif, switch or case’. They are at the heart of allprogramming.YesThenAction 1Conditiontrue?NoElseAction 2Questions4 What is a flowchart?5 What is a Selection?Figure 2.5 A flowchart representing a selection11
2 Using flowchartsFlowcharts can use the following symbols:SymbolStartDelaySet for5 minsAlarmringsReady toget up?NoHit SnoozebuttonYesClimb outof bedEndPurposeUseFlow lineThe lines show thesequence of operations.Terminal(Start/Stop)Denotes the start and endof an algorithm.ProcessingDenotes a process to becarried out.DecisionUsed to represent theoperation in which thereare two alternatives, trueand false.We can use a decision to create a flowchart of what happens inthe morning on school days, as shown in Figure 2.6.We also explored selections when we looked at the sequenceof making tea. We explored using IF someone wants sugar andIF someone wants milk. The process of making the tea differedaccording to their answer to these questions.The flowchart below shows a different process for making tea andadds two decision boxes.StartBoil kettleFigure 2.6 A flowchart showing whathappens on a school morningMilk?YesAdd milkNoFind mugPour waterin mugSugar?FindteabagYesAdd SugarNoStirDrink teaPut teabagin mugRemoveteabagEndFigure 2.7 A flowchart showing a difference process for making tea12
Basic elements of flowchartsKey pointRepetition is used when thesame bit of code is neededseveral times. Instead of writing itover and over again, you can usethe REPEAT command. Repetitioncan also be called iteration(looping).If we wanted to show how to play the game of snakes and ladderswe could explain how to play the game in English as follows:Start gameThrow the dice: the number indicated by dice is x.Move your counter x squares on the board and check:Have you landed on snakes head?: no/yesIf yes slide down snake to its tail.If no check next statementHave you landed on the bottom of the ladder?: no/yesIf yes move up the ladder.If no check next statementHave you reached the last block of the game?: no/yesIf yesOutput “you are the winner”If noGive the dice to the next playerRepeat until someone reaches the last block of the game.EndWe have more decisions in this example and could show the gamewith the following flowchart.Give dice tonext playerStartThrow diceLandedon snakehead?YesSlide downtail of snakeNoMove counternumber of placesshown on diceYesLandedon bottom ofladder?Move upladderNoNoReachedlast square ofgame?YesOutput ‘You arethe winner’EndFigure 2.8 A flowchart showing the game of snakes and ladders13
2 Using flowchartsOther structures we will use in this book include:SEQUENCEStructureSELECTION(IF THEN ELSE)StructureINTERATION(WHILE)StructureFigure 2.9 Other structures we will use in this bookOn-page and off-page connectors may also appear in someflowcharts. This occurs when a flowchart goes over more thanone page. For the purposes of this chapter we will only exploreflowcharts that can be represented on a single page. If a flowchartis so big it needs to go onto another page, you should split it intosub-processesSubprocessesWe can also use subprocesses in flowcharts using the symbolbelow.SubprocessFigure 2.10 The subprocess symbolSubprocesses are useful because: they help with the modularisation of complex programs; they provide a way of simplifying programs by making commonprocesses available to a wide number of programs; they lead to more reliable programs since once a process istested and works it can be made a subprocess and need not betested again.In flowcharts subprocesses are also useful in sticking to the rulethat a flowchart should fit on a single page.14
Basic elements of cript2Print sumFigure 2.11 shows an example of the main page of a flowchart.It contains two subprocess symbols. Each subprocess symbolcontains text which describes briefly what the subprocess does.Each subprocess symbol also contains a page reference where theflowchart for the subprocess will exist.Chapter reviewIn this chapter we built upon the last chapter to explore sequences inmore detail and established how we can show these using flowcharts.We looked at the basic elements of flowcharts and introduced theconcept of decisions and how these can be represented.Remember, before tackling any computer science task or examinationquestion on this topic you must: understand what an algorithm is and what algorithms are used for,and be able to interpret algorithms in the form of flowcharts Understand and be able to explain and create algorithms to solve aEndparticular problem, making use of programming constructs such assequence, selection and iterationFigure 2.11 The subprocess understand and be able to use appropriate conventions in flowcharts understand and be able to explain the purpose of a given algorithmand explain how it works understand and be able to explain and determine the correct outputof an algorithm for a given set of data.15
3 Pseudo-codeSpecification referencesYou should:1.1.1 understand what an algorithm is, whatalgorithms are used for and be able to interpretalgorithms (flowcharts, pseudo-code, writtendescriptions, program code)1.1.2 understand how to create an algorithm tosolve a particular problem, making use ofprogramming constructs (sequence, selection,iteration) and using appropriate conventions(flowchart, pseudo-code, written description,draft program code)1.1.3 understand the purpose of a given algorithmand how an algorithm works1.1.4 understand how to determine the correctoutput of an algorithm for a given set of data2.1.2 understand the benefit of producingprograms that are easy to read and be ableto use techniques (comments, descriptivenames (variables, constants, subprograms),indentation) to improve readability and toexplain how the code works2.2.1 understand the structural components ofa program (variable and type declarations,command sequences, selection, iteration, datastructures, subprograms)2.2.2 be able to use sequencing, selection anditeration constructs in their programs2.4.1 understand how to write code that accepts andresponds appropriately to user inputBasic elements of pseudo-codePseudo-code is another way to develop an algorithm. It consistsof natural language-like statements that precisely describe thesteps required.Pseudo-code must:contain statements which describe actions; focus on the logic of the algorithm or program; avoid language-specific elements; be written at a level so that the desired programming code canbe generated with little effort from each statement; contain steps, subordinate numbers and/or indentation usedto show dependent statements in selection and repetitionstructures. Key pointsPseudo-code is a languagedesigned to express algorithmsin an easy to follow form. Pseudo-code is an easy toread language to help withthe development of codedsolutions. When writing in pseudo-coderesist the urge to write inwhatever language you aremost comfortable with. 16Pseudo-code advantages Pseudo-code is similar to everyday English.It helps programmers to plan an algorithm.It can be done easily on a word processor.It is easily modified.It implements structured concepts well.
The importance of syntaxPseudo-code disadvantages Question1 What is pseudo-code? Pseudo-code is not visual like flowcharts.There is no accepted standard, so it varies widely.It is not an actual programming language.It is an artificial and informal language.Some people have a tendency to put actual code in. This makesit harder to understand.The importance of syntaxSyntax is the set of rules, principles, and processes that enable usto understand a language. The syntax rules of a language definethe spelling and grammar and as with natural human languageseach language has its own rules. Computers are very inflexibleand understand what you write only if you state what you wantin the exact syntax that the computer expects and understands.Key pointFor the examination you will needto understand how to createan algorithm using appropriateconventions (flowchart, pseudocode, written description, draftprogram code).Each programming language has its own rules and specialistsyntax including the words that the computer understands, whichcombinations of words are meaningful, and what punctuation isnecessary for the code to be correctly structured. Whilst pseudocode does not have a fixed syntax, you will need to understandthe syntax used in the examination papers. Understanding theimportance of syntax is also vital when you start using aprogramming language.SymbolsWhen we write code in English we also use symbols in the form ofpunctuation. Symbols are used because they are human-readable.The symbols you use are important as they have an effect in yourcode.these-words-are-seperated-by-a-symbol #the – is the symbol used herethere is also a symbol in this sentence #here the space is the symbol usedSymbols can also be used as what are called identifiers. In someprogramming languages, they are also called atoms rather thansymbols.Key pointThe symbols , , , –, are often used to representthe assignment operator inprogramming languages.The symbols , , , –, and are often used as what are calledoperators.In pseudo-code, you use the following syntax to receive data froma device. The red brackets are only to show where you addsomething; you don’t need to put them in your code.SyntaxRECEIVE add identifier here FROM (type) add device here 17
3 Pseudo-codeExamplesRECEIVE Name FROM (STRING) KEYBOARDorRECEIVE LengthOfJourney FROM (INTEGER) CARD READERorRECEIVE YesNo FROM (CHARACTER) CARD READERCommon action keywordsSeveral keywords are often used to indicate common input,output, and processing operations. Input: READ, OBTAIN, GET Output: PRINT, DISPLAY, SHOW Process/compute: COMPUTE, CALCULATE, DETERMINE Initialise: SET, INIT Add one: INCREMENTIn pseudo-code, you use the following syntax to send output tothe screen. The red brackets are only to show where you addsomething; you don’t need to put them in your code.Key pointFor the examination, you willneed to be able to interpretprogram code.SyntaxSEND add expression here TO DISPLAYExampleSEND ‘Have a good day.’ TO DISPLAYWhilst there is no common way of writing pseudo-code, inthis book we have written the commands in capital letters todifferentiate them from the examples in Python and to help youunderstand what the command words are.Questions in the Edexcel written examination that involve codewill use the following pseudo-code command words alongsideother words:ELSEEND FOREND IFEND WHILEFORIFINPUTOUTPUTREPEATRETURNTHENWHILE18
Commenting on your codeCommenting on your codeKey pointA comment is explanatory text forthe human reader.Key pointsGood code is well written andwell annotated. For the examination, you willneed to understand the benefitof producing programs thatare easy to read, and be ableto use techniques (such ascomments, descriptive namesand indentation) to improvereadability and to explain howthe code works. For the examination, you willneed to understand how tocreate an algorithm makinguse of programming constructssuch as sequence, selectionand iteration. QuestionGood code is not only well written, but should also be wellannotated. There are programmers who argue that commentsare not necessary if the code is written well, but you areundertaking an examination and it will be useful to explain whatyour code does and why.You will find many examples of commented code in this book.Comments are shown using either // or #. Different programminglanguages have different ways to tell the computer that this is acomment NOT the code. You can make all the code you write inpseudo-code a comment when you write the actual code usingyour chosen language. This is considered good practice whenlearning to code. You can also comment out bits of code to finderrors, but we will explore this later.Questions in the Edexcel written examination that involve codewill use the following pseudo-code syntax for comments:# some textMultiline comments will show the hash # for each separatecomment line.# some text# some more text on a new lineComments remind you and the examiner why you includedcertain functions. They also make maintenance easier for youlater.Have you ever tried to work with someone else’s complexspreadsheet or database? It’s not easy. Now imagine how difficultit is if you’re looking at someone else’s programming code.TaskWhen you fully document your code with comment tags, you’reanswering (at least) three questions: Where is it? Why did I do that? What does this code do?1 Describe the main reasonswhy a programmer would wishto annotate or add commentsto their code.No matter how simple, concise, and clear your code may end upbeing, it’s impossible for code to be completely self-documenting.Even with very good code it can only tell the viewer how theprogram works; comments can also say why it works.2 What is a comment?Adding selectionAs we discovered in the last chapter on flowcharts, anotherimportant aspect of programming is selection. If we want towrite pseudo-code that tells a user to enter a number to a variable,19
3 Pseudo-codeand then we want the code to see if the number they entered is a 3or a 4 we could write a selection algorithm in pseudo-code thatcould look like this:RECIEVE inputNumber FROM (int) KEYBOARD#InputIF inputNumber 3 #Selection (Process)SEND “your number is 3” TO DISPLAY #OutputELSE IF inputNumber 4SEND “your number is 4” TO DISPLAYELSESEND “your number is not 3 or 4” TO DISPLAYEND IFWe could also write the code a different way:Key pointsThe IF statement is used tocreate a decision structure,which allows a program tohave more than one path ofexecution. The IF statement causesone or more statements toexecute only when a Booleanexpression is true. An IF-ELSE statementwill execute one block ofstatements if its condition istrue, or another block if itscondition is false. 20RECIEVE inputNumber FROM (int) KEYBOARDIF inputNumber 3THEN SEND “Your number is a 3” TO DISPLAYELSE IF inputNumber 4THEN SEND “Your number is a 4” TO DISPLAYELSE SEND “Your number is not a 3 or a 4” TO DISPLAYEND IFTask2 Use this book and other sources such as the Internet to research howto identify and correct errors in algorithms.3 Use this book and other sources such as the Internet to research howstandard algorithms (bubble sort, merge sort, linear search, binarysearch) work.
Commenting on your codeChapter reviewIn this chapter we have explored pseudo-code andhow to use it to show program flow and decisionmaking.We also explored the importance of syntax and how tocomment on your code.Remember, before tackling any computer science taskor examination question on this topic you must: understand and be able to explain what algorithmsare used for be able to interpret and write algorithms in pseudocode understand and be able to explain and createalgorithms to solve a particular problem, makinguse of programming constructs (such as sequence,selection, iteration) understand and be able to explain and apply the understand how to determine the correct output ofan algorithm for a given set of data understand and be able to use appropriateconventions in pseudo-code understand and be able to explain the benefit ofproducing programs that are easy to read and beable to use techniques such as comments anddescriptive names for variables, constants, andsubprograms alongside indentation to improvereadability and to explain how the code works be able to use sequencing, selection and iterationconstructs in your programs understand and be able to apply structuralcomponents of a program including variable andtype declarations and sequences, selection,iteration, data structures, and subprograms.purpose of a given algorithm and how an algorithmworks21
Summary of features2 Using flowchartsEach chapter clearly referencesthe understanding and skillsstudents will need to practiseand exhibit in their examsSpecification referencesiteration) and using appropriate conventionsYou should:1.1.1 understand what an algorithm is, whatalgorithms are used for and be able to interpretdescriptions, program code)1.1.2understand how to create an algorithm toKey points clarifysignificantsolveinformation for students toa particular problem, making use ofprogrammingconstructs (sequence, selection,be able to process andrecalleasilyKey pointsAis a diagramrepresentation of an algorithm. For the examination, you willneed to be able to interpret Flowcharts are a graphicalmethod of designingprograms.draft program code)1.1.3 understand the purpose of a given algorithmand how an algorithm works1.1.4 understand how to determine the correctoutput of an algorithm for a given set of data2.4.1 understand how to write code that accepts andresponds appropriately to user inputThere are a lot of different design procedures and techniques forbuilding large software projects. The technique discussed in thischapter, however, is for smaller coding projects and is referred toby the term ‘top down, structured flowchart methodology’. Wewill explore how to take a task and represent it using a flowchart.A flowchart puts the sentences from a sequence into shapedboxes. The shapes indicate the action.You will know from the last chapter that a sequence is where a setof instructions or actions are ordered, meaning that each actionfollows the previous action. to read.Key terms will help studentsdevelop computing languageskills to facilitate greatersubject understandingKey termFor the examination, you willneed to be able to interpretKey pointthe order of execution.222Figure 2.1 A sequence
Edexcel Computer Science for GCSEGeneral rules for flowchartsGeneral rules for flowchartsKey points lines with arrows to show theorder of execution. An algorithm is a sequence ofsteps that can be followed tocomplete a task. A sequence is where a setof instructions or actions areordered, meaning that eachaction follows the previousaction.Practice tasks willhelp build students’coding, programmingand problem-solvingskills All symbols of the flowchart are connected by flow lines(these must be
GCSE Steve Cushing EDEXCEL ComputEr SCiEnCE for GCSE Steve Cushing SAMPLE CHAPTERS 9781471866227 Edexcel Computer Science CV Final.indd 3 28/10/2015 16:36. . Hodder Education cannot be held
Target Grade 7 Edexcel GCSE (9-1) Chemistry Intervention Workbook (Pearson) Target Grade 7 Edexcel GCSE (9-1) Physics Intervention Workbook (Pearson) Revise Edexcel GCSE (9-1) Combined Science Foundation Revision Guide. Revise Edexcel GCSE (9-1) Combined Science Higher Revision Guide. Revise Edexcel GCSE (9-1) Combined Science Higher Revision Guide
IGCSE ARABIC for Native Arabic Speakers - Edexcel 11 GCSE ART & DESIGN - Edexcel 13 IGCSE BUSINESS STUDIES - Cambridge 15 IGCSE ECONOMICS - Cambridge 17 IGCSE COMPUTER SCIENCE - Cambridge 19 GCSE DRAMA - Edexcel 20 IGCSE ENGLISH LANGUAGE - Cambridge 22 IGCSE ENGLISH LITERATURE - Edexcel 22 IGCSE GEOGRAPHY - Edexcel 25
Pearson Edexcel Price List January 2020 Bangladesh . IGCSE Subject Name Unit Code Bangladesh Edexcel Pricing (Standard) (BDT) Bangladesh Edexcel Pricing (Low late fee) (BDT) Bangladesh Edexcel Pricing (High late fee) (BDT) ACCOUNTING 4AC1 13,100.00 22,300.00 31,600.00 BANGLA 4BA0 10,100.00 19,300.00 28,600.00 . STATISTICS 1 WST01 6,500.00 .
Edexcel GCSE June 2014 . Understanding our Edexcel GCSE grade boundaries This document shows the grade boundaries for our Edexcel GCSE qualifications. For each set of grade boundaries, the maximum number of available marks is also shown. For our Edexcel GCSE Mathematics A specification, the maximum mark and raw mark grade boundaries are shown for the overall qualification. This means that the .
Pearson Edexcel GCE in Core Mathematics C2 (6664/01) Edexcel and BTEC Qualifications Edexcel and BTEC qualifications are awarded by Pearson, the UK’s largest awarding body. We provide a wide range of qualifications including academic, vocational, occupational and specific programmes for employers. For further information visit our qualifications websites at www.edexcel.com or www.btec.co.uk .
webpage on the Edexcel website. More past papers can be found by searching the Edexcel website under the term ‘past papers’. You will also find lots of tips on preparing for your exam in the student area of the Edexcel website. Edexcel’s Scheme of Assessment (specification 4HI1) This Edexcel International GCSE in History comprises two .
Pearson Edexcel Price List June 2020 Bangladesh . IGCSE Subject Name Subject / Unit Name Unit Code Bangladesh Edexcel Pricing (Standard) (BDT) Bangladesh Edexcel Pricing (Low late fee) (BDT) Bangladesh Edexcel Pricing . MATHEMATICS B MATHEMATICS B 4MB1 13,400.00 22,600.00 31,800.00
wellness tourism visit coastaltourismacademy.co.uk What could it mean for coastal resorts? Globally, the health and wellness market is worth an eye-popping 494 billion ( 314.8 billion). And it’s growing rapidly. However relatively little is known about the size and scope of the market in the UK, particularly in a coastal context. We commissioned new research, surveying a nationally .
