1.2.4 Types of Programming Language Flashcards

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

Programming Paradigm

A

The word ‘paradigm’ means to describe an example or pattern. In a Computing context, this means to describe a computational way of doing things. So a Programming Paradigm is a style or way of programming. E.g. Low-Level languages, High-Level languages, Declarative languages are all examples of different programming paradigms.

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

Procedural Language

A

Any high level language in which program statements can be grouped in self-contained blocks called procedures and functions. These procedures have their own variables, not accessible outside the procedure.

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

Assembly Language

A

A language which is related very closely to the computer’s own machine code.

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

Machine Code

A

Set of all possible instructions made available by the hardware design of a particular processor. Closest to pure binary.

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

Low Level Language

A

A language which is close to machine code. Related closely to the design of the machine.
A one-to-one language

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

High Level Language

A

A language designed to help a programmer express a computer program in a way that reflects the problem that is being solved, rather than the details of how the computer will produce the solution.
One-to-many language.

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

Little Man Computer

A

An instructional model of a computer, created by Dr. Stuart Madnick in 1965. The LMC is generally used to teach students, because it models a simple von Neumann architecture computer - which has all of the basic features of a modern computer. It can be programmed in machine code or assembly code

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

Immediate Addressing

A

Uses the data in the address field, not as an address, but as a constant that is needed by the program. An example is a routine counting up to 10, which may have the constant ‘10’ supplied in the address field of an instruction. Although the address field cannot hold numbers as large as those that can be stored as data in a memory location, because space has to be left for the operation code field, this is a particularly convenient method of loading constants into the accumulator.

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

Direct Addressing

A

Uses the data in the address field without alteration. This is the simplest method of addressing and also the most common.

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

Indirect Addressing

A

Uses the address field to hold the address of a location that contains the required address.

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

Indexed Addressing

A

Modifies the address (either a direct or an indirect address) in the address field by the addition of a number held in a special-purpose registers, called an index register, before the address is used. Index registers are quickly and easily altered providing an efficient way of accessing a range of memory locations, such as in an array.

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

Object Orientation

A

Looking at systems by classifying them into real world objects

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

Object Oriented Programming

A

A method of programming which classifies real world objects into classes and encapsulates those objects attributes and behaviors.

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

Class

A

A type definition of an object

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

Object

A

An instance of a class.

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

Base Class

A

Base class contains attributes and methods. It is the highest class and does not inherit from any other class.

17
Q

Superclass

A

A class that has been extended by another class. It allows the extending class to inherit its attributes and methods.

18
Q

Subclass

A

A class that extends another class. The subclass inherits the methods and attributes of the class it extends.

19
Q

Derived Class

A

A derived class is any class that inherits attributes and methods from any other derived class or base class.

20
Q

Instantiation

A

The process of creating an actual named instance of class. The instantiated named copy of the class in an object of that class.

21
Q

Overriding

A

A method in a subclass or derived class which has the same name as a method in one or more of its superclass’s. The method supersedes all other versions of the method above it in the inheritance tree.

22
Q

Method

A

A program routine contained within an object designed to perform a particular task on the data within the object. A method can broadly be thought of as a procedure / function from more traditional procedural programming languages

23
Q

Attribute

A

A single bit of data within a record

24
Q

Inheritance

A

When a derived class is defined it also has all the attributes and methods of the base class.

25
Q

Encapsulation

A

All of the object’s attributes are contained and hidden in the object and access to them is restricted to operations of that class.

26
Q

Polymorphism

A

A specialised form of overloading which allows us to create very general object structures, which can be used with a wide range of data types.