[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-657283-105":59,"doc-detail-657283-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","algorithms-and-flowcharts-chapter-1-learning-intentions-and-practical-tasks","Algorithms and flowcharts - Chapter 1 - Learning Intentions and Practical Tasks","","Chapter 1 explains algorithms as step-by-step instructions and shows how they are used in everyday life and computing. It introduces how algorithms can be represented using written text, flowcharts, and pseudocode, describing pseudocode as structured English transferable to programming languages. The worked example demonstrates creating an algorithm and flowchart for password entry with limited attempts, including input, output, decisions, processing, variables, and start/end symbols. Practical tasks then guide learners to build algorithms for rectangle area, convert them to pseudocode, and create flowcharts for summing ten numbers and a dice game.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":20,"@type":76,"position":81},"https://docshare.wps.com/document/exam/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/algorithms-and-flowcharts-chapter-1-learning-intentions-and-practical-tasks/657283/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/algorithms-and-flowcharts-chapter-1-learning-intentions-and-practical-tasks/657283.png","ImageObject",300,407,{"name":92,"@type":93},"asda1da","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-29","2026-10-26",true,{"@type":102,"interactionType":103,"userInteractionCount":8},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What is an algorithm and why are algorithms important in computing?","Question",{"text":112,"@type":113},"An algorithm is a set of step-by-step instructions for solving a problem. Algorithms are widely used to decide what action to take, and computers can consider many possibilities much faster than humans.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"How can algorithms be represented according to the chapter?",{"text":117,"@type":113},"Algorithms can be displayed as written text, more formally using flowcharts, or (for use with computers) using pseudocode.",{"name":119,"@type":110,"acceptedAnswer":120},"What key elements must be included in the password worked-example algorithm?",{"text":121,"@type":113},"The algorithm includes input (password), output (whether it is recognised), decisions (whether the password is correct), process (counting attempts), variables to store attempts, and start/end symbols, using conditional branching and a loop up to three tries.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},657283,1792976874,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":19,"category_name":20,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":8,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":52,"language":139,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":140,"faqs":141,"seo_title":142,"seo_description":67,"update_tm":129,"read_time":143},3985747861852,"https://ap-avatar.wpscdn.com/davatar_155a257f0dc6eb9ab79c44ca47cae57d","| |  |  |\n| --- | --- | --- |\n| Cambridge University Press\u003Cbr>978-1-108-78256-2—Cambridge International AS & A Level IT Practical Skills Workbook with Digital Access (2 Years) David Waller\u003Cbr>Excerpt\u003Cbr>More Information |  |  |\n| \u003Cbr>Chapter 1\u003Cbr>Algorithms andowcharts\u003Cbr>This chapter relates to Chapter 4 in the Coursebook.\u003Cbr>The software used in this chapter is Word (Mac version) .\u003Cbr>LEARNING INTENTIONS\u003Cbr>In this chapter you will learn how to:\u003Cbr>• create an algorithm to solve a particular problem that demonstrates a decision-making process\u003Cbr>• edit a given algorithm\u003Cbr>• write an algorithm using pseudocode to solve a given problem\u003Cbr>• edit a given flowchart\u003Cbr>• draw a flowchart to solve a given problem. |  |  |\n| Introduction |  | \u003Cbr>KEY WORDS |\n| Algorithms are step-by-step instructions for solving a problem. In every area, algorithms are used to decide what action should be taken in a particular circumstance. As computers can consider all the possibilities far more quickly than a human brain, algorithms are becoming more important to the running of the world. |  | algorithm: a set of\u003Cbr>instructions or steps\u003Cbr>to be followed to\u003Cbr>achieve a certain |\n| For example, in a game of chess, when each player has made three moves, there are |  | outcome |\n| over nine million possible moves available; after four moves there are over 288 billion possible moves. Computers have the ability to consider all these possible moves far more quickly than humans. That is why no chess grandmaster has beaten a top computer chess algorithm since 2005. |  | procedure: a type of\u003Cbr>subroutine that does\u003Cbr>not return a value to\u003Cbr>the main program |\n| We use algorithms to carry out everyday tasks, often without thinking about them. For example, we use an algorithm or set of procedures to solve the complex problem of getting up and getting ready for school or college.\u003Cbr>Algorithms can be displayed simply as written text or more formally using flowcharts or, when they are being designed to be used for a computer, as pseudocode. Pseudocode is a kind of structured English for describing algorithms. It is a generic, code-like language that can be easily translated into any programming language. |  | flowchart: a set of symbols put together with commands that are followed to solve a problem\u003Cbr>pseudocode: a language that is used to display an algorithm |\n|  |  |  |\n| 1  |  |  |\n\n© in this web service Cambridge University Press [www.cambridge.org](www.cambridge.org)  \nCambridge University Press  \n978-1-108-78256-2—Cambridge International AS & A Level IT Practical Skills Workbook with Digital Access (2 Years) David Waller  \nExcerpt  \nMore Information  \nCAMBRIDGE INTERNATIONAL AS & A LEVEL IT: PRACTICAL SKILLS WORKBOOK  \nWORKED EXAMPLE  \nAs a security measure, users are required to enter their password before accessing a computer system. They are allowed three attempts before password entry is locked. Create an algorithm for doing this and display it as a flowchart.  \nThe algorithm will contain:  \n• Input, e.g. the password. (Red)  \n• Output, e.g. informing the user if the password is recognised or not. (Blue)  \n• Decisions, [e.g. is](e.g. is) the password correct. (Green)  \n• Process, e.g. keeping count of the number of attempts that have been made. (Purple)  \n• A variable, e.g. to store the number of attempts that have been made. After each incorrect attempt it must be incremented by 1.  \n• Start and end symbols. (Black)  \nThe algorithm will use conditional branching. There will be different branches when the password is recognised or not.  \nIt will use a loop, which may need to be repeated up to a maximum of three times.  \nStart  \nKEY WORDS  \ninput: putting data into an algorithm  \noutput: displaying data from an algorithm to the user  \nprocess: an action performed to some data to make a change  \nvariable: a space in the memory of a computer, that has an identifier, where you can store data. This data can be changed  \nloop: code that is repeated ","cbCaicUHPDcfvOJT","https://ap.wps.com/l/cbCaicUHPDcfvOJT","pdf",135030,"English","# Introduction\n## Key words\n# Worked example\n## Password entry algorithm\n# Practical tasks\n## Task 1: Rectangle area\n## Task 2: Pseudocode conversion\n## Task 3: Sum of ten numbers","[{\"question\":\"What is an algorithm and why are algorithms important in computing?\",\"answer\":\"An algorithm is a set of step-by-step instructions for solving a problem. Algorithms are widely used to decide what action to take, and computers can consider many possibilities much faster than humans.\"},{\"question\":\"How can algorithms be represented according to the chapter?\",\"answer\":\"Algorithms can be displayed as written text, more formally using flowcharts, or (for use with computers) using pseudocode.\"},{\"question\":\"What key elements must be included in the password worked-example algorithm?\",\"answer\":\"The algorithm includes input (password), output (whether it is recognised), decisions (whether the password is correct), process (counting attempts), variables to store attempts, and start/end symbols, using conditional branching and a loop up to three tries.\"}]","Algorithms and flowcharts - Chapter 1 - Learning Intentions and Practical Tasks | PDF",25]