2.2

• What is branching in programming?


  A programming control structure that selects alternative paths based on a boolean expression.
• What is a function in programming?

  A subroutine that performs a task or calculation and always returns a value.
• How can functions be utilized in programming?

  Functions can be called in an expression or assigned to a variable.
• What are global variables?

  Variables declared in the main program that can be used anywhere in the program.
• What is an Integrated Development Environment (IDE)?

  A software package that facilitates code development and implementation with features like editing and debugging.
• What are iterations in programming?

  A control structure where a set of statements is repeated until a condition is met or for a fixed number of times.
• What are local variables?

  Variables declared within a subroutine that can only be used within that subroutine.
• What is modularity in programming?


  The technique of breaking down a complex problem into simpler, self-contained components called modules.
• What is Object Oriented Programming?

  A programming paradigm where the system is viewed as a set of objects with their own data and procedures.
• What is parameter passing by reference?

  Passing the address or pointer of the required value into a procedure.
• What is parameter passing by value?

  Creating a temporary local copy of the actual value of a variable and passing it into the procedure.
• What are parameters in programming?

  The data structures required to be passed into a subroutine.
• What are procedures in programming?

  A subroutine that is called by writing its name in the code and does not have to return a value.
• What is recursion in programming?

  A subroutine that calls itself until a base case is met to avoid infinite loops.
• What are sequences in programming?

  A control structure where statements are executed one after another as they appear in the script.
• What are subroutines in programming?


  A uniquely named section of code that performs a specific task within a program.
• What is backtracking in algorithms?

  An algorithm that incrementally finds a solution by trying different sequences and abandoning paths that cannot lead to a valid solution.
• What are computable problems?

  Problems for which every instance can be solved in a finite number of steps by means of an algorithm.
• What are computational methods?


  Methods of solving problems through computation by devising and implementing algorithms.
• What is data mining?


  An algorithm that analyzes large data sets to uncover trends and relationships between variables.
• What is the divide and conquer algorithm design technique?

  An algorithm design technique that decomposes and solves problems by reducing the problem size with each iteration.
• What are heuristics in algorithms?

  A 'rule of thumb' algorithm that produces a valid but sub-optimal solution for hard problems as an approximation.
• What is performance modeling?

  The process of simulating the behavior of a model under different virtual user and system loads using mathematical approximation.
• What is pipelining in computing?

  The process of splitting a task into parts and searching for subtasks that can be processed simultaneously.
• What is problem decomposition?

  The process of splitting a given problem into smaller, solvable sub-problems that are easier to manage.
• What is problem recognition?

  The ability to recognize the most effective strategy to solve a problem.
• What is visualization in computing?

  The use of a visual representation of an algorithm or data structure to make a problem and its solution more understandable.
• What are the key programming techniques covered in the study material?

  • Branching
  • Functions
  • Global Variables
  • Integrated Development Environment (IDE)
  • Iterations
  • Local Variables
  • Modularity
  • Object Oriented Programming
  • Parameter passing by reference
  • Parameter passing by value
  • Parameters
  • Procedures
  • Recursion
  • Sequences
  • Subroutines
• What are the computational methods discussed in the study material?

  • Backtracking
  • Computable Problems
  • Computational Methods
  • Data Mining
  • Divide and Conquer
  • Heuristics
  • Performance Modelling
  • Pipelining
  • Problem Decomposition
  • Problem Recognition
  • Visualisation