6. Algorithms and Code Design

Syllabus Points Covered

Programming fundamentals

Software development

• Explore fundamental software development steps used by programmers when designing software

  • requirements definition

  • determining specifications

  • design

  • development

  • integration

  • testing and debugging

  • installation

  • maintenance

• Research and evaluate the prevalence and use of online code collaboration tools

Designing algorithms

• Apply computational thinking and algorithmic design by defining the key features of standard algorithms, including sequence, selection, iteration and identifying data that should be stored

• Apply divide and conquer and backtracking as algorithmic design strategies

• Develop structured algorithms using pseudocode and flowcharts, including the use of subprograms

  • Pseudocode

  • Flowcharts

• Use modelling tools including structure charts, abstraction and refinement diagrams to support top-down and bottom-up design

• Analyse the logic and structure of written algorithms

  • determining inputs and outputs

  • determining the purpose of the algorithm

  • desk checking and peer checking

  • determining connections of written algorithms to other subroutines or functions

Data for software engineering

• Create data dictionaries as a tool to describe data and data types, structure data, and record relationships

Developing solutions with code

• Compare the execution of the Waterfall and Agile project management models as applied to software development

• Test and evaluate solutions, considering key aspects including functionality, performance, readability of code, quality of documentation

The object-oriented paradigm

Understanding OOP

• Use data flow diagrams, structure charts and class diagrams to represent a system

  • Structure charts

Chapter Contents

• 6.1. Algorithms
  • 6.1.1. Sequence
  • 6.1.2. Selection
  • 6.1.3. Iteration
  • 6.1.4. Subroutines
• 6.2. Draw a Box: Algorithm
  • 6.2.1. Problem Description
  • 6.2.2. Class/Homework Exercises
• 6.3. Desk Checking
  • 6.3.1. Example 1
  • 6.3.2. Example 2
• 6.4. Draw a Box: Desk Check
• 6.5. Draw a Box: Code
• 6.6. Backtracking Algorithms: Maze Example
  • 6.6.1. Maze Example
• 6.7. Backtracking Algorithms: 8 Queens
  • 6.7.1. Problem Description
  • 6.7.2. 4 Queens Problem
• 6.8. Representing and Storing Data: 8 Queens
• 6.9. Divide and Conquer: Merge Sort
  • 6.9.1. Divide and Conquer Algorithms
  • 6.9.2. Merge Sort
  • 6.9.3. Merge subroutine
  • 6.9.4. Merge Sort
• 6.10. Applying Divide and Conquer Algorithms
• 6.11. Understanding Algorithms
• 6.12. Peer Review: Tic Tac Toe (Naughts and Crosses)
  • 6.12.1. Tic Tac Toe
    • Introduction
    • Demonstration of the program
    • Implementation
    • Code Submission
• 6.13. Developing Software: Tic Tac Toe Example
  • 6.13.1. Requirements Definition
  • 6.13.2. Determining Specifications
  • 6.13.3. Design
    • Development
    • Integration
    • Testing and Debugging
    • Installation
    • Maintenance
• 6.14. Top-down and Bottom-up Design
  • 6.14.1. Top-Down Design
  • 6.14.2. Bottom-Up Design
  • 6.14.3. When to Choose Which Approach?
• 6.15. Structure Charts
  • 6.15.1. Symbols
  • 6.15.2. Top-Down and Bottom-Up Design
  • 6.15.3. Examples
    • Library Borrowing System
    • String Preprocessor
• 6.16. Online Code and Collaboration Tools
  • 6.16.1. Why It Is Useful?
  • 6.16.2. Examples
  • 6.16.3. Advantages and Opportunities
• 6.17. Waterfall vs Agile Project Management
  • 6.17.1. Waterfall
  • 6.17.2. Phases of Waterfall
  • 6.17.3. Advantages
  • 6.17.4. Disadvantages
  • 6.17.5. Agile
  • 6.17.6. Phases of Agile
  • 6.17.7. Advantages
  • 6.17.8. Disadvantages