Extra

Question 1

What is linear probing

Answer 1

Can be used in hash tables to move through the structure one space at a time to find the next free space

Question 2

What is chaining in relation to hahs

Answer 2

Each location points to start of a linked list the new item is added to the end of the linked list

Question 3

ACID what is the A references to

Answer 3

Partially procesed thingy

Question 4

Head html

Answer 4

Where you add meta data and link style sheet

Question 5

Are arrays contiguous

Answer 5

Yes

Question 6

What is a hash tables

Answer 6

Uses a hash function to compute an index into an array. Data is in the form of keys/values. A hash function is applied to the key. The hash is used to compute an index in the array where the data can be stored or read. “Random access” because it allows direct, “indexed” access to individual members in constant time.

Question 7

What is a record

Answer 7

Group or collection of related fields under a single identifier.
Each field (variable) can have a different data type (unlike arrays).
Used in conjunction with arrays or lists e.g. a list of students.

Question 8

What gets put onto the system stack when an interrupt is called

Answer 8

Contents of registers including program counter

Question 9

Pieplining in the production line sense

Answer 9

The result from one process feeds into the next

Question 10

How do do super.new

Answer 10

super.new(pName,Pheight)

Question 11

Harvardf

Answer 11

small embedded computers and signal processing (DSP).

Question 12

Von nueman

Answer 12

Desktop pc

Question 13

CISC

Answer 13

laoptops pc

Question 14

RISC

Answer 14

phones tablets

Question 15

,value

Answer 15

return what is stored and innrer html to change

Question 16

Polymorphism

Answer 16

Polymorphism is a property of OOP that means objects can behave differently depending on their class. This can result in the same method producing different outputs depending on the object involved. There are two categories of polymorphism: overriding and overloading.

Question 17

What can concurrent also be

Answer 17

Havinfg multiple processors each carrying out a different process

Question 18

Parralel

Answer 18

Breaking down single job into sub jopbs that are procesed in parrralel

Question 19

Other uses of client side

Answer 19

Reduces load on server, manipulates user interface elements and reduces amount of web traffic

Question 20

Server side uses

Answer 20

Further validation, queeries and updates server database, performs complex calcualtions, keeps organisation data secure

Question 21

Polymorphism

Answer 21

Methods behave dif depending on the object they called on

Question 22

Where do you add internal css

Answer 22

Just inside html tags

Question 23

harvard

Answer 23

embedded, signal process

Question 24

Risc

Answer 24

Phones tablets

Question 25

Cisc

Answer 25

laptop, micro and embdded

Question 26

Disadvantages of insertion soret

Answer 26

Does not scale well and is not good for large data sets

Question 27

Advantages of insertion sort

Answer 27

Easy to implement
Good for small data sets that are almost sorted
Insertion sort generally performs quicker than bubble sort and is therefore preferable.

Question 28

Why is insertion sort faster than bubble sort

Answer 28

With bubble sort, after the first pass with 4 comparisons (resulting in 1 swaps), 8 has bubbled to the top and the data set is sorted. However, as we have made some swaps a further pass must be made. This takes 3 comparisons giving a total of 7 comparisons.

With insertion sort, only 5 comparisons are needed in total.