Upgrade to remove ads
Computer Science GCSE
Perse Year 10 AfterSchool
Terms in this set (95)
Stored Program Concept
Program must be resident in memory to be executed. Memory shared for programs and data.
Machine code fetched one by one
A computer system with a dedicated function within a larger electrical or mechanical system. For example a computer system in a car controlling the lights based on sensors.
Representation that is arrived at by removing unnecessary details.
The difference between the actual number and the nearest representable value.
A sequence of unambiguous instructions for solving a problem. It can be represented as a Turing machine program.
Web technology that allows only the part of a web page that needs updating to be fetched from the web server.
Application programming interface (API)
A layer of software that allows application programs to call on the services of the operating system.
A property or characteristic of an object (OOP).
Turning an abstraction into a form that can be processed by a computer.
For a transmission medium, the range of signal frequencies it may transmit.
A value that has a solution which does not involve any reference to the general case solution.
A system that uses a single data channel system in which the whole bandwidth of the transmission medium is dedicated to one data channel at a time.
The operation which contributes most to the total running time.
The rate at which signals on a wire may change.
The functions of the object or what the object does.
The number of bits transmitted per second.
A multiple data channel system in which the bandwidth of the transmission medium carries several data streams at the same time.
A sorting algorithm where during a pass, neighbouring values are compared and swapped. Passes are made until no further swaps are needed.
Message data after it has been encrypted.
When the array element with the largest possible index has been used, the next element to join the queue reuses the vacated location at the beginning of the array.
A template that can be used to create objects of that class.
A computer that uses the services provided by a server.
A system in which some computers (the clients), request services provided by other computers, the servers.
A sequence of edges that start and end at the same vertex and such that any two successive edges in the sequence share a vertex.
A set of agreed signals, codes and rules to be used for data and information exchange between computers.
Complexity of a problem
Taken to be the worst case complexity of the most efficient algorithm which solves the problem.
A combination of attributes that uniquely identifies a tuple/record.
A measure of how economical an algorithm is with time and space.
A type of association where the composite object has ownership of the objects within it. The objects that are part of the composite objects have a lifecycle determined by the composite object. If the composite object ceases to exist then they too will cease to exist.
The science of designing cipher systems.
A representation of the data requirements of an organisation constructed in a way that is independent of any software that is used to construct the database.
A method of trying to find the plain text from the cipher text without the decryption key.
A closed path in which all the edges are different and all the intermediate vertices are different.
A method of describing the data, it's structure, the way it is interrelated and the constraints that apply to it for a given system or organisation.
Movement of data.
A structured collection of data.
Database management system
A software system that enables the definition, creation and maintenance of a database and which provides controlled access to this database.
Using an algorithm and a key to convert encrypted message data into its plain text equivalent.
Degree (of a vertex)
The number of neighbours for that vertex.
Degree of relationship
Between two entities, it refers to the number of entity occurrences of one entity which are associated with just one entity occurrence of the other and vice versa.
Deterministic finite state machine (FSM)
An FSM that has just one next state for each pair of state and input symbols.
A diagram consisting of vertices, joined by directed edges.
Memory space is only allocated when required at runtime.
Dynamic data structure
The memory taken up by the data structure varies at run time.
Dynamic web page content
Content that is generated when the web browser request is received.
Embedded computer system
A dedicated computer system with a limited or non-existent user interface and designed to operate completely, or largely, autonomously from within other machinery.
Combining a record with the procedures and functions that manipulate it to form a new data type; a class in OOP.
Using an algorithm and a key to convert message data into a form that is not understandable without that key.
An object, person, event or thing of interest to an organisation and about which data are recorded.
A systematic assessment of whether something meets its objectives or specifications and how well it meets the latter in terms of effectiveness, usability, maintainability.
The solution finds a route that traverses each road exactly once before returning to the starting point.
Growth that has the form kn, e.g. 2n where k = 2 and n = 1, 2, 3, etc.
A study that investigates the potential of a new system.
Finite state machine
A finite state machine is a model of computation for a machine that is always in one of a fixed number of states. The state of the machine can be changed according to transition rules based upon the input that it receives and its current state. Some finite state machines produce output as they carry out transitions whilst others simply produce a yes/no response at the end of processing their inputFloating point notation
Floating point notation
A real number represented by a sign, some significant digits (the mantissa) and a power of 2 (the exponent).
A small program that exploits a network security weakness (security hole) to replicate itself through computer networks.
Where two object types share some of another's properties or behaviours
An operation applies to a binary number to shift the bits either left or right a specific number of places.
Used for signed binary numbers. When performing a right shift the bits at the left are replaced by copies of the most significant bit.
utility that rearranges files to be stored in contiguous clusters
The physical and logical design of a computer network; examples include mesh, bus, ring and star; the physical layout of the network devices and the cabling, and how all the components communicate with each other
A topology with one central node that has each computer or network device attached to the central node. All data first goes into the central node and then is sent out to its destination. (Think of it like a bicycle wheel with spokes.)
Devices are connected with many redundant interconnections between network nodes.
A network layout in which there is one main trunk, or backbone, that all the various computers and network devices are connected to.
Data that is entered into the computer system via an input or storage device.
Data that has been processed into a useful format.
robustness is the ability of a computer system to cope with errors during execution and cope with bad inputs.
Methods of representing algorithms
Flowchart, Plain English, Pseudocode, Program language
The defined block of information consisting of header, data, and trailer that serves as the information exchange method on the network.
A type of computer that forwards data across a network
Connects devices to a network. Hub sends data to all nodes, switch send to specific destination.
A value that does not change
A convention for naming variables that capitalizes the first letter of every word without spaces.
Boolean operators - two valid states
perform mathematical calculations like addition subtraction multiplication etc.
Wide Area Network (WAN)
A network that connects devices in geographically separated areas.
Local Area Network (LAN)
Connects a group of computers in close proximity, such as in an office building, school, or home
Person responsible for ensuring that applicable devices are linked to the organization's networks and that the networks operate properly.
Cables, telephone lines, cellular radio networks, and satellites.
A global network connecting millions of computers, making it possible to exchange information. The internet is a mesh network
ISP (Internet Service Provider)
company that offers Internet connections at monthly rates depending on the kind and amount of access needed
A number that uniquely identifies each computer or device connected to the Internet.
No central controlling device. Data traffic "hops" from one node to another
Hybrid Network Topology
Hybrid networks use a combination of any two or more topologies, in such a way that the resulting network does not exhibit one of the standard topologies (e.g., bus, star, ring, etc.).
The internet is an example of this
the fraudulent practice of sending emails purporting to be from reputable companies in order to induce individuals to reveal personal information, such as passwords and credit card numbers.
Reroutes requests for legitimate websites to false websites
Refers to how well a system can adapt to increased demands
the repetition of a process
Term for a type of programming statement (usually an if-statement) that uses a Boolean condition to determine, or select, whether or not to run a certain block of statements.
CPU (Central Processing Unit)
The internal operating unit or "brain" of a computer.
Control Unit (CU)
Processor component that manages the execution of instructions during the fetch-execute cycle.
Arithmetic Logic Unit (ALU)
The part of the central processing unit that performs arithmetic computations and logical operations.
This is the process that all Stored Program Computers follow in order to run instructions within the machine.
Instructions are stored within main memory as a combination of both instruction & data.
a form of computer data storage. A random-access memory device allows data items to be read and written in approximately the same amount of time regardless of the order in which data items are accessed.
Small, very quick memory because it stores copies of information and data from the most regularly used parts of main memory.
YOU MIGHT ALSO LIKE...
AP CS Principles Vocab
OTHER QUIZLET SETS
Spárgalégy - Platyparea poeciloptera
Intro to Art: Chapter 16
C172 POH: Section 3, Emergency Procedures