IB Computer Science Topic 4.1 - General Principles

Guess the terms of these definitions
Source: Core Computer Science
Quiz by KRQC2000
Rate:
Last updated: May 3, 2018
You have not attempted this quiz yet.
First submittedApril 12, 2018
Times taken107
Average score18.5%
Report this quizReport
4:30
Enter answer here
0
 / 27 guessed
The quiz is paused. You have remaining.
Scoring
You scored / = %
This beats or equals % of test takers also scored 100%
The average score is
Your high score is
Your fastest time is
Keep scrolling down for answers and more stats ...
Definition
Term
Needs attention and must be solved
Problem
Series of unambiguous, finite step-by-step instructions designed to solve above
Algorithm
Thinking Procedurally
Reduces solution to series of simple sequential steps in order to obtain desired output.
Procedure
Dividing problems or sub-problems into smaller sub-problems
Top-down design
Series of commands to solve specific sub-problem. Example: calculation of discriminant (b^2-4ac)
Sub-procedure
Thinking Logically
Repeating series of instructions within algorithm. Examples: for/from to loop, while loop
Iteration
Performs different instructions based on Boolean test
Conditional statement
What is evaluated in order to determine whether statements in "if" statement run. Examples: a>0, a==b
Boolean condition
Common sense in algorithmic thinking and programming. Examples: If it rains, wear raincoat.
Logical rules
Thinking Ahead
What is put into program
Input
Produced by program after process
Output
Planning in advance. Examples: Pre-ordering product, pre-heating oven
Pre-planning
Example of above. Consists of pre-formed elements and pre-written code, classes, procedures, methods, etc. that offer programmes additional and more efficient functionality to programs
Software library
Transferring data or instructions from memory to cache for when they are needed so that time is not wasted waiting for data from RAM.
Prefetching
Bar chart for project management that shows tasks, activities, and events in relation to time. One bar for task, length of bar represents timeframe.
Gantt chart
What must be true before sub-procedure is called; starting state before algorithm
Pre-condition
What will be true after sub-procedure; final state after algorithm
Post-condition
Event that disrupts anticipated flow of program's execution. Can be handled by most modern programming language features.
Exception
Thinking concurrently
Execution of different instructions simultaneously by multiple processors in order to achieve most efficient performance. Example: "Pasta with sauce"
Concurrent processing
Thinking Abstractly
Reflecting on events, ideas, attributes, and relationships, ignoring details irrelevant to accomplish a goal.
Abstract thinking
Example of above, based on principle that all everyday tasks can be considered entities.
Object-oriented programming (OOP)
Used by above. Describe data/properties and behaviours/methods of real objects, facilitating code reusability and abstraction. Examples: car1 and car2
Programming objects
Data structure/Abstract Data Type consisting of data and predefined methods that operate on data, i.e. add, store, manage, retrieve, manipulate, and communicate data using predefined methods.
Collection
Abstraction of reality showing spatial distribution and emphasizes particular theme, such as average income distribution in georgraphic area.
Thematic map
Abstracts three-dimensional features of real world into smaller two-dimensional representations, paper or screen.
Topographic map
Shows boundaries/borders of countries and states, as well as locations of cities and towns.
Political map
No comments yet