Learning Outcomes - The learner will:

1. Understand the basic principles of algorithms.
   Assessment Criteria - The learner can:
   1. Explain the concept of an algorithm.
   2. Describe common algorithmic techniques and solutions.
   3. Create a flowchart from an algorithm.
      
      
2. Understand the basic principles of computer programming.
   Assessment Criteria - The learner can:
   1. Describe computer programming principles.
   2. Summarise the historical development of computer programming.
   3. Explain major components of a programming language.
   4. Compare the strengths and limitations of modern computer programming languages.
      
      
3. Understand the basics of an Object-oriented Programming language.
   Assessment Criteria - The learner can:
   1. Explain the benefits of object-oriented design.
   2. Evaluate when to use Object-oriented design methodology.
   3. Explain how objects are used in Object-oriented programming.
   4. Explain the steps in creating an Object-oriented program.
   5. Explain how to compile a program and debug codes.
      
      
4. Be able to code and compile software using a choice of object-oriented Programming language.
   Assessment Criteria - The learner can:
   1. Design object-oriented programs involving multiple objects.
   2. Explain the impact of style on developing and maintaining programs.
   3. Develop programs using best practice.
   4. Implement, test and debug solutions.
      
      

Learning Outcome 1

• History of Algorithms.
• Definition of algorithms

• Input
• Output
• Definiteness
• Finiteness
• Effectiveness.

• Brute Force.
• Greedy Algorithms: "take what you can get now" strategy.
• Divide-and-Conquer.
• Decrease-and-Conquer.
• Dynamic Programming.
• Transform-and-Conquer.
• Backtracking and branch-and-bound: generate and test methods.
• Flowchart symbols.

Learning Outcome 2

• Definition, principles of programming

• Abstraction
• KISS
• Open/Closed entities
• Coupling
• Cohesion.

• Programming history

• Charles Babbage's Analytical Engine
• the concept of storing data in machine-readable form
• low & high-level languages (COBOL, FORTRAN, and Lisp)
• Moore’s law
• Procedural
• OO
• Languages (COBOL, FORTRAN, Java, JavaScript, C#, C++, Python, PHP, Ruby on Rails)

• The main () Function
• The #include and #define directives
• The Variable Definition
• The Function Prototype
• Program Statements
• The Function Definition
• Program Comments
• SQL, Java, JavaScript, C#, C++, Python, PHP, Ruby on Rails.
• Compare; use error handling, ease of use.

Learning Outcome 3

• Code Reuse and Recycling
• Encapsulation
• Design Benefits
• Software Maintenance
• Classes and objects
• Arrays
• Lists
• Stacks
• Queues
• Trees
• Intermediate representations and their purpose.
• Arrays (1- and 2-dimensions)
• Implementation of queues
• Stacks and lists
• Debugger
• Breakpoints
• commands
• Use of IDEs
• data structure display/verification
• Use of debugging tools.

Learning Outcome 4

• Design using SQL, Java, JavaScript, C#, C++, Python, PHP, Ruby on Rails.
• Use Debugger, breakpoints, commands in the chosen language, C ++/JAVA/Python/or similar an OOPL.
• Code writing standards, comments, documentation
• Use of IDEs, test plan