Unit 1 - Fundamentals of Programming

Question 1

Define an algorithm

Answer 1

A sequence of instructions that can be followed to solve a problem

Question 2

Define pseudocode

Answer 2

A language which is a simplified coding language

Question 3

Why do we use pseudocode?

Answer 3

1. It can be easily understood by anybody unfamiliar with programming
2. It helps to lay out the design of the code

Question 4

What should you always keep in mind when writing pseudocode?

Answer 4

You need to keep the same rules throughout so that your program is consistent

Question 5

What is an identifier?

Answer 5

A name that indicates a memory location

Question 6

Define assignment

Answer 6

Assigning a piece of data to a memory location

Question 7

Define variable

Answer 7

A piece of data held within a memory location

Question 8

Define constant

Answer 8

A variable which does not change throughout the program

Question 9

What does modulus division do?

Answer 9

Returns the remainder of the division

Question 10

What does div division do?

Answer 10

Returns the integer part of the division

Question 11

How are assignment statements expressed in pseudocode?

Answer 11

= or <–

Question 12

How are input statements written in pseudocode?

Answer 12

1. OUPUT “Enter current mileage”
   currentMileage ← USERINPUT
2. currentMileage ← USERINPUT(”Enter current mileage”)

Question 13

List the 6 relational operators and their symbols

Answer 13

1. Equal to (==)
2. Less than (<)
3. Greater than (>)
4. Greater than or equal to (>=)
5. Less than or equal to (<=)
6. Not equal to (!=)

Question 14

List the three logical operators

Answer 14

1. AND
2. OR
3. NOT

Question 15

What happens during iteration?

Answer 15

A set of instructions is repeated multiple times

Question 16

Why is iteration used by programmers?

Answer 16

It is more efficient that writing out the same block of code multiple times

Question 17

Give a situation when an infinite loop is useful?

Answer 17

To continuously check the input a device is receiving once it is activated

Question 18

What is a data type?

Answer 18

A set of rules that dictate the range of values a variable can be and how that variable can be manipulated

Question 19

Define data structure

Answer 19

Different methods of storing data within a program

Question 20

Define subroutine

Answer 20

A set of instructions with a name that can referenced and applied to data throughout the program

Question 21

What are the two types of subroutines?

Answer 21

Procedures and functions

Question 22

What is the difference between the two types of subroutine?

Answer 22

A procedure does not return a value where as a function does

Question 23

What is the difference between a parameter and an argument?

Answer 23

Parameters appear in subroutine definitions where as arguments appear in subroutine calls

Question 24

Built in subroutines are contained in…

Answer 24

Libraries

Question 25

What do you need to do in order to access the subroutines contained within a library?

Answer 25

Import the library at the beginning of the program

Question 26

Where will the value returned by a function go?

Answer 26

It will be assigned to the same variable that the subroutine is assigned to

Question 27

What is a variable scope?

Answer 27

It defines the visibility of a variable and which parts of the program can access it

Question 28

What are local variables?

Answer 28

Variables which are defined and used within one subroutine

Question 29

What are global variables?

Answer 29

Variables that are defined in the main program and can be used anywhere

Question 30

What is the difference of variable scope between a local variable and a global variable?

Answer 30

A local variable can only be used within a subprogram where as a global variable can be used anywhere within the program

Question 31

Why are local variables a good resource for a programmer?

Answer 31

There is no chance of accidentally changing a local variable in the main program as it is completely self contained within the subroutine

Question 32

What is modular programming?

Answer 32

Breaking down a major task into smaller subtasks

Question 33

Why is modular programming beneficial?

Answer 33

1. Programs are more easily and quickly written 2. It makes a program easier to manage 3. Each module can be individually tested 4. Modules can be re-used 5. Smaller problems are easier to debug and maintain

Question 34

What are the two types of file?

Answer 34

A binary file or a text file

Question 35

Why do we use files?

Answer 35

They allow us to organise our data and preserve it between code runs. Files also contain multiple records which can hold different data types

Question 36

Why is it harder to use binary files?

Answer 36

Everything has to be in binary including commands and data

Question 37

Define deceleration

Answer 37

The process of defining variable and constants in terms of their name and data type

Question 38

Define debug

Answer 38

The process of finding and correcting errors in programs

Question 39

Define pointer

Answer 39

A data item that identifies a particular element in a data structure

Question 40

Define truncating

Answer 40

The process of cutting off a number after a certain number of characters

Question 41

Define rounding

Answer 41

The process of reducing the number of characters used to represent a number whilst maintaining approximately the same value

Question 42

Define pseudo-random number generator

Answer 42

A function that produces a random number that it not 100% random

Question 43

Define block interface

Answer 43

Code that describes the data being passed from one subroutine to another\

Question 44

What are naming conventions?

Answer 44

The process of giving meaningful names to elements used in a program

Question 45

What is a call stack?

Answer 45

An area of memory allocated to a program to help it track active subprograms

Question 46

What does a call stack broken down into?

Answer 46

Stack frames

Question 47

What does a stack frame consist of?

Answer 47

1. A pointer indicating where execution should return to (the return address) 2. Local variable 3. Argument parameters