Algorithm Design And Problem-solving
Visão Geral
Before a single line of code is written, a good programmer has a plan: they break the problem into parts, design each part as an algorithm, decide how to test it, and check it works by tracing it by hand. This topic is the toolkit every programmer uses to turn a vague problem into a working, reliable solution.
You will learn the program development life cycle, how to decompose a problem into sub-systems, the standard methods such as totalling, counting and finding the maximum and minimum, validation and verification checks, how to choose good test data, how to complete a trace table for a dry run, and how to find and fix errors in algorithms. Pseudocode here follows the Cambridge 0478 conventions. By the end you should be able to write, trace and correct algorithms with confidence.
Objetivos
- 1 Understand the program development life cycle, limited to: analysis, design, coding and testing
- 2 (a) Understand that every computer system is made up of sub-systems, which are made up of further sub-systems (b) Understand how a problem can be decomposed into its component parts (c) Use different methods to design and construct a solution to a problem
- 3 Explain the purpose of a given algorithm
- 4 Understand standard methods of solution
- 5 (a) Understand the need for validation checks to be made on input data and the different types of validation check (b) Understand the need for verification checks to be made on input data and the different types of verification check
- 6 Suggest and apply suitable test data
- 7 Complete a trace table to document a dry-run of an algorithm
- 8 Identify errors in given algorithms and suggest ways of correcting these errors
- 9 Write and amend algorithms for given problems or scenarios, using: pseudocode, program code and flowcharts
Licao em audio
Ouca esta licao na aplicacao
Mapa mental
Este tema esta mapeado para mostrar como as ideias se ligam.
Abra o mapa mental na aplicacao
Cartoes
Pratica rapida de memoria sobre o que e avaliado neste tema.
Pratique estes cartoes na aplicacao
Nota de Aula
Apontamento completo disponivel na aplicacao Green Bridge
Instale a aplicacao Green Bridge CBT no telemovel ou computador para aceder a biblioteca IGCSE completa: exames anteriores, criterios de correcao, mapas mentais, cartoes de estudo e licoes em audio.
Avaliação da Lição
Parabéns por concluir a lição em Algorithm Design And Problem-solving. Agora que você explorou o conceitos e ideias-chave, é hora de colocar seu conhecimento à prova. Esta seção oferece uma variedade de práticas perguntas destinadas a reforçar sua compreensão e ajudá-lo a avaliar sua compreensão do material.
Irá encontrar uma mistura de tipos de perguntas, incluindo perguntas de escolha múltipla, perguntas de resposta curta e perguntas de redação. Cada pergunta é cuidadosamente elaborada para avaliar diferentes aspetos do seu conhecimento e competências de pensamento crítico.
Use esta secção de avaliação como uma oportunidade para reforçar a tua compreensão do tema e identificar quaisquer áreas onde possas precisar de estudo adicional. Não te deixes desencorajar pelos desafios que encontrares; em vez disso, vê-os como oportunidades de crescimento e melhoria.
- Which is NOT one of the four stages of the program development life cycle? A. analysis B. design C. marketing D. testing Answer: C
- Splitting a system into smaller sub-systems is called: A. validation B. decomposition C. iteration D. verification Answer: B
- A check that an age entered is between 0 and 100 is which type of validation? A. presence check B. length check C. range check D. format check Answer: C
- For a value that must be between 10 and 100, which pair is boundary test data? A. 50 and 60 B. 9 and 10 C. "ten" and 5 D. 200 and 300 Answer: B
- Which tool is used to dry-run an algorithm by hand, recording each variable as it changes? A. structure diagram B. flowchart C. trace table D. firewall Answer: C
Resolva estas questoes na aplicacao
Resolva estas questoes na aplicacao
Livros Recomendados
Para aprender mais, fontes abertas
-
Secção do manual
Algorithm Design and Discovery
"Introduction to Computer Science: Algorithm Design and Discovery" by OpenStax, OpenStax, Rice University, licensed under CC BY-NC-SA 4.0 (https://creativecommons.org/licenses/by-nc-sa/4.0/). Source: https://openstax.org/books/introduction-computer-science/pages/3-2-algorithm-design-and-discovery. Access for free at https://openstax.org/books/introduction-computer-science/pages/1-introduction
-
Secção do manual
Computational Thinking
"Introduction to Computer Science: Computational Thinking" by OpenStax, OpenStax, Rice University, licensed under CC BY-NC-SA 4.0 (https://creativecommons.org/licenses/by-nc-sa/4.0/). Source: https://openstax.org/books/introduction-computer-science/pages/2-1-computational-thinking. Access for free at https://openstax.org/books/introduction-computer-science/pages/1-introduction
Publicados por outras organizações com licenças abertas e creditados como pedem. As ligações abrem os seus sites.
Pratique Questões Simuladas
Quer praticar questões simuladas sobre Algorithm Design And Problem-solving? Descarregue a aplicação Green Bridge CBT para aceder a questões simuladas e avaliações completas sobre este tópico.
Descarregar a aplicação na Google Play Store
Tudo o que precisas para te destacares no JAMB, WAEC e NECO.
