GoConqr hat ein neues Design! Sag uns, wie es dir gefällt.

Karteikarten

Computer Science Paper 2 - Computational Thinking and Problem Solving

Haydn Warne Computing A2 Englisch 32 Karten

Karten in diesem Stapel (32)

  1. 1Abstraction is......an interpretation of real life so it can be modelled in a computer in order to solve a problem.
  2. 2The purpose of the cache is......to minimise the speed differential when instructions are sent (like between RAM and CPU). Algorithms work out which common instructions should be stored - can be performance drain.
  3. 3Concurrent Processing is......when multiple processors perform independent task simultaneously.
  4. 4Advantage(s) of Concurrent Processing?Increase system throughput, as tasks are completed simultaneously.
  5. 5Disadvantage(s) of Concurrent Processing?1) May waste time investigating inefficient solutions
    2) Difficult to program, especially for the processors to co-operate
    3) More memory intensive
  6. 6Advantage(s) of Modularity? (Hint: There are 6)1) Work is easily divided between a team
    2) Saves time, as team members can work in parallel
    3) Breaks problems into smaller and easier sections
    4) Easier to read, test and debug
    5) Subroutines can be tested in isolation
    6) Code can be reused in current or other projects
  7. 7Which always returns an output? Functions or Procedures?Functions.
  8. 8Difference between local and global variables?Local variables can only be accessed by the function which they were declared in. Global variables can be accessed anywhere within the program.
  9. 9Difference between passing a parameter to a function by value or by reference?Passing by value means a copy of the passed value is used within the function. Changes made are not reflected in the original value. Passing by reference passes a pointer to the original value, meaning changes made within are reflected in the original value.
  10. 10What is an IDE?An Integrated Development Environment. Programs used to write code.
  11. 11Features of an IDE? (Hint: There are 8)1) Breakpoints - Defining places where code should pause
    2) Stepping - Allowing programmers to run through execution line by line
    3) Variable Checks - Shows values of variables currently in use
    4) Run-time Environment - A testing environment to try code in, so it doesn't have to be constantly compiled
    5) Auto-documentation
    6) Highlights syntax errors
    7) Error diagnostics
    8) Intellisense - Attempts to auto-complete as you type, saving time
  12. 12Instantiation is......the creation of an object from a class. Each object can have properties (values or attributes) and methods (functions and procedures).
  13. 13Encapsulation is......when the properties of an object are made private and can only be changed through that object's methods.
  14. 14Inheritance is......when a 'derived class' inherits the properties and methods of it's parent/super class. Derived classes can still have properties and methods of their own.
  15. 15Polymorphism is......the alteration of methods inherited from the super class to suit the purpose of derived classes.
  16. 16A Recursive algorithm is......one that involves a function that calls itself. Each function declaration is put into a stack, with the results of each being called in reverse order once the point of termination is reached.
  17. 17Advantage(s) of Recursion over Iteration? (Hint: There are 3)1) Recursive algorithms are easier and more natural to read and write as some functions are naturally recursive
    2) Suited to certain problems, like tree diagrams
    3) Reduces size of problem with each call, divide and conquer style
  18. 18Disadvantage(s) of Recursion over Iteration? (Hint: There are 4)1) Stack space can run out, causing a stack overflow and a crash
    2) More difficult to trace/debug as each function has it's own set of variables
    3) Requires more memory than an iterative algorithm
    4) Usually slower than iteration, due to maintenance of the stack
  19. 19A problem is defined as computable when......it can be solved by an algorithm in a finite number of steps. Computers are good at solving problems that involve inputs, calculations and outputs.
  20. 20Enumeration is......solving a problem by trying every possible solution until the correct one is found.
  21. 21Simulation is......using a computer to model a real-life situation.
  22. 22Problem Recognition is......the clear definition of the problem at hand.
  23. 23Problem Decomposition is......the breaking down of a complex problem into smaller sub-problems. Makes it easier to solve and paves the way for modular programming.
  24. 24Divide and Conquer is......breaking a problem down by halving it each time. Not to be confused with Problem Decomposition - Divide and Conquer uses recursion. The problem is recursively broken down into smaller problems, with the solutions to each being combined to create a full solution.
  25. 25Backtracking is......a recursive method of solving problems. Entire paths are explored for answers, while backtracking on different possibilities.
  26. 26Data Mining is......the process of looking through vast quantities of data, searching for relationships within data. Pattern matching algorithms may be used. Used for business marketing or planning for future eventualities.
  27. 27Positives of Data Mining? (Hint: There are 2)1) Can improve marketing for businesses
    2) Can boost sales/profits
  28. 28Negatives of Data Mining? (Hint: There are 4)1) Needs powerful computers and has vast processing requirements
    2) Privacy concerns
    3) Opens to misuse of information
    4) Inaccurate information can produce fake results
  29. 29Heuristics is......a sort of 'rule of thumb' approach to solutions; when a problem is complex and difficult to solve, so finding a practical solution is more important than finding an optimal one (Sat Nav pathfinding is a good example).
  30. 30Performance Modelling is......testing how well an (often large) IT system will respond to heavy loads and traffic. Can be a great way to test for weakness and model scenarios, but can also be expensive.
  31. 31Pipelining is......an approach that sees a series of tasks completed concurrently so that another instruction can begin before a previous one finishes. Makes an efficient use of CPU time, but can be expensive to produce.
  32. 32Visualisation is......the visual representation of programs, data etc.

Informationen

Beschreibung
A2 Computing Karteikarten am Computer Science Paper 2 - Computational Thinking and Problem Solving, erstellt von Haydn Warne am 12/02/2018.
Erstellt von
Haydn Warne
Aufrufe
2
Bewertung

Feedback

Worum geht es?

Wie gefällt dir das neue Design?

Dein Eindruck