Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

ocr computer science a level > definitions 1.2 > Flashcards

definitions 1.2 Flashcards

You may prefer our related Brainscape-certified flashcards:
Biology 101 flashcards
1
Q

basic input-output system

A

a program that initialises and tests whether system hardware is functional and then loads the operating system from the hard disk into ram when the computer is turned on

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

device driver

A

A program supplied with a peripheral device that allows the os to control and communicate with the devices

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

distributed operating system

A

the operating system is spread over multiple computer servers on a network, acting as a single system to parallel process a job

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

embedded operating system

A

a specialised operating system with limited resources and functionality, built-in to control a single machine

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

First come first served

A

a scheduling algorithm where processes are dealt with in the order they arrive (a queue)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

intermediate code

A

code partly transferred between high-level and machine language produced by a compiler

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

interrupts

A

a signal from hardware, software or the clock to alert the CPU. in the interrupts is a higher priority than the current task, the current routine pauses and resumes after the interrupts is executed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

interrupts service routines

A

if an interrupt is a higher priority than the current task, register contents are temporarily transferred onto the system stack at the end of the current FDE cycle and the interrupts is handled

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Memory management

A

The efficient organisation and allocation of main memory to the program in use

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Multi-level Feedback queues

A

A scheduling algorithm that uses multiple queues, each with a different priority. jobs can be moved between queues.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Multi-tasking operating systems

A

an operating system capable of running multiple tasks simultaneously

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Multi-user operating systems

A

an operating system consisting of one mainframe computer with multiple terminals that allow multiple users to access the computer’s resources. each user is given a time slice of the mainframe processor

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

operating systems

A

a set of programs managing the operation of the computer that is loaded into RAM every time the computer is turned on. it bridges the user to the hardware

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

paging

A

partitioning memory into fixed-sized physical divisions called pages. processors in memory will be assigned an appropriate number of pages.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Real-time operating system

A

an operating system where data is processed as it comes, with responses generated with a guaranteed timeframe

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Round-Robin

A

a scheduling algorithm where each process is given an equal time slice and is dealt with on a first-in-first-out basis. if a process does not finish within a time slice it joins the end of the queue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

scheduling

A

allocating processor time to each application to ensure processor time is used as efficiently as possible when multi-tasking

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Segmentation

A

partitioning memory into variable-sized logical divisions called segments. A large program can be executed by consecutively running its segments

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Shortest job first

A

A scheduling algorithm that picks the process with the shortest estimated running time and runs it until its finished

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Shortest Remaining time

A

A scheduling algorithm that picks the process with the shortest estimated time remaining to finish. if a process with a shorter time is added, the scheduler switches processor

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Virtual machines

A

Any instance where software is used to take on the function of a machine, including intermediate code or running an operating system within another

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Virtual Memory

A

an allocated area of secondary storage where pages of inactive jobs are swapped to free up enough RAM for the current job

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Applications

A

A program that can be run on a computer, allowing the user to carry out specific tasks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Assembler

A

A translator in a low-level language converts the assembly language into, machine code

25
Q

Closed Source

A

Proprietary software is sold with a license and restrictions on how and how many users can use it. The source code is not available to users

26
Q

Code generation

A

The third and final stage of compilation, where an equivalent machine code program is produced

27
Q

Compilation

A

The process of analysing high-level language source code and converting it into machine code.

28
Q

Compiler

A

A translator that converts high-level language to machine code

29
Q

interpreters

A

A translator checks a source program for syntax errors line by line translates it to machine code and executes the line.

30
Q

Lexical Analysis

A

The first complication stage is where extra spaces and comments are removed from the source code and searched for simple errors. Keywords, constants and variables are replaced by tokens. Variable names are loaded into the symbol table.

31
Q

Libraries

A

a collection of programs wich are already compiled and can be loaded into a program and run whenever required.

32
Q

Linkers

A

A program which places the appropriate machine addresses in the call and returns instructions of a compiled program so all the other required object code files and modules are linked together.

33
Q

Loaders

A

A program that loads the executable object program and it is associated libraries into memory before it is run.

34
Q

Open sources

A

Software whose source code is freely available to view, redistribute or modify

35
Q

optimisation

A

During code generation, the object code is made as efficiently as possible by removing redundancies to produce code that gives the same result

36
Q

syntax analysis

A

The second stage of complication, where statements, expressions and tokens are checked for syntax errors using syntax diagrams

37
Q

Translators

A

A program which converts code from one computer language to another

38
Q

Utilities

A

System software with a specific purpose is usually related to maintenance such as optimising the performance of the computer, diagnosing issues, backing up files, setting up firewalls etc.

39
Q

Agile methodologies

A

An iterative process that produces incremental prototypes of software over short, fast-paced sprints. Each prototype is user-tested and any feedback and changes in requirements will be accounted for in future sprints

40
Q

Extreme programming

A

A type of Agile methodology that is more responsive to changing user needs with a short development cycle and very frequent software releases. Checkpoints are incorporated to change or add new user requirements

41
Q

Rapid application development

A

A method capable of speedy responses to changes in technologies and user requirements through repeated prototyping, continual evaluations, and strict time limits. the user will quickly receive a reduced-functionality mock-up of the program.

42
Q

spiral model

A

an iterative version of the waterfall model where stages are refined and repeated until the final product is complete. The first cycle works towards an initial prototype, and each successive cycle produces a refined prototype

43
Q

Waterfall lifecycle

A

Each stage of development is completed one at a time in linear order. Results from a completed stage are input into the next. Any previous stage can be returned to in light of feedback, however the stages that follow need to be worked trough again.

44
Q

Assembly language

A

A low-level language closely related to but more advanced than machine code. it uses descriptive names and mnemonics for instructions, and is related to the design of the computer.

45
Q

attributes

A

data recorded as a variable associated with an object

46
Q

classes

A

A template defining the attributes and methods that can be used to create a type of data known as an object

47
Q

Direct addressing

A

The simplest addressing mode in assembly language is where the operand stores the memory address of the value to be operated on by the operator

48
Q

encapsulation

A

A method of maintaining data integrity by only allowing class methods to access data in an objects attributes

49
Q

immediate addressing

A

an addressing mode in assembly language where the data in the address field is constant and the operand is the value to be operated on by the operator.

50
Q

indexed addressing

A

An addressing mode in assembly language where the address of the operand required is calculated by adding a constant from the index register to the absolute address in the instruction

51
Q

indirect addressing

A

an addressing mode in assembly language where the operand stores the address of the location holding the memory address of the required data

52
Q

inheritance

A

the concept of subclasses inheriting the methods and attributes of its parent class(a.k.a its superclass)

53
Q

Methods

A

a program subroutine that represents an action an object can perform

54
Q

object-oriented languages

A

programming languages where the code is made of units called objects, which are instances of a class. objects have their own attributes and behaviour and can interact with each other

55
Q

objects

A

an instance of a class. the behaviour of this data item depends on how its attributes where defined

56
Q

Polymorphism

A

objects of a different classes can use the same methods to perform an action

57
Q

procedural languages

A

A high-level language where statements are grouped into self-contained blacks is known as functions and procedures. they have built-in data types and data structures

58
Q

programming paradigms

A

A style of computation and programming. chosen according to the problem at hand

ocr computer science a level (2 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions