Brainscape's Knowledge GenomeTM

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


See full index

Advanced Higher Computing Science > Prelim > Flashcards

Prelim Flashcards

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

Scope and Constraints

A

Scope - What is to included

Constraints - The limitations

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

Examples of Intellectual Property rights

A

Protects visual website design
Copyright - Creator has right to all artwork used
Trademarks - Use of trademarks is a breech of IPR

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

How usability testing can be used to evaluate a sites accessibility

A

Test group given a test case and asked to carry out task
Test group required to use alternatives
Developers can make notes on difficulties
This would give them feedback regarding the accessibility of that page

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

SQL statement to display certain data

A

SELECT attribute
FROM Entity
WHERE entity.foreignkey = entity.foreignkey
AND Attribute = ‘value’ ;

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

Suitability of design with smartphone/tablet devices

A

Accuracy - Text Input gives flexibility but the chance of misspelling
Selection of data is fiddly but more accurate
Less Strain on resources - Users complete tasks quicker and free up servers etc quicker

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

The difference between an object and a class

A

Class is a template which defines methods and attributes

Object is an instance of a class

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

Encapsulation

A 
Access to attributes, operations and class can be limited
Eg attributes only being available to a certain class
Out with this class must be accessed via use of that classes methods
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Instance variable

A

Data values which every instance of the class will have

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

Class variable

A

Available to all instances and defined inside the class definition

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

The difference between an object and a class

A

Class is a template which defines methods and attributes

Object is an instance of a class

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

Encapsulation

A 
Access to attributes, operations and class can be limited
Eg attributes only being available to a certain class
Out with this class must be accessed via use of that classes methods
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Inheritance

A 
When a new subclass inherits all of the methods and attributes from the parent class
It can have methods/attributes of its own
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Instance variable

A

Data values which every instance of the class will have

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

Class variable

A

Available to all instances and defined inside the class definition

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

SQL statement to create a table

A 
CREATE TABLE table name
(
Field name datatype NOT NULL
PRIMARY KEY (field1, field2)
FOREIGN KEY (Fieldname) REFERENCES originaltable(samefieldname)
);
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Inheritance

A 
When a new subclass inherits all of the methods and attributes from the parent class
It can have methods/attributes of its own
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

HTML to generate forms

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

Button element for creating buttons

A

Sign Up

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

Description of insertion sort

A

Field and field compared, swap/no swap

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

Algorithm to remove data from the top of a queue

A

IF front=back THEN

ELSE

SET front to front-1
END IF

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

Code to instantiate a class object

A 
DECLARE identifier (team1) INITIALLY Team
("Value", "Value", "Value")
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Code to create an array of objects

A

DECLARE arrayname as ARRAY OF objectname * dimension required eg 32

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

Describing a procedure call using OO terminology

A 
Since subclass name inherits methods and properties from parentclassname
The method name method in the subclassname class overrides the method name method in the parentclassname
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Sequence of stack operations required to produce a new table

A

Pop data to be moved

Push data to be added, push data just moved

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

Describe the addition of data into a linked list

A

New node added to store data and pointer set to the address of the node following it
Pointer of preceding node would be updated to store the new node address

26
Q

Benefits of using analytics

A
  • Provide insights and patterns which aid decision making
  • Eg analysis of given data benefits committee by providing information about…
  • This could help them to…
27
Q

Pseudo code to create top level design of a program

A

RECORD recordname IS {datatype Fieldname}
DECLARE arrayname AS ARRAY OF recordname * size INITIALLY [ ]

Binary search part ; importdata (arrayname[ ])
search(arrayname[ ])

28
Q

Initialisation of a binary search in pseudocode

A

SET lower to 0
SET upper to numrecords - 1 (As index begins at 0)
SET found to false

29
Q

Pseudocode to edit required details of an external database file

A

< connect to database server>
SET query TO “update tablename
set fieldname= ‘’ where
Condition (eg fieldname= ‘’

Single quotations required for string values
No quotations for integer values

30
Q

Type of sort algorithm which keeps going around until no swaps occur

A

Bubble Sort

31
Q

Condition for swap when sorting into ascending order

A

IF tablename [counter-1] > tablename[counter] THEN

32
Q

Explain why a quick sort is more appropriate when sorting large files

A

Quicker as fewer comparisons needed

33
Q

Component Testing

A

Modules of the program are tested independently of eachother
Can occur during development
Better as avoids several errors being together, making them difficult to spot and giving off unpredictable results

34
Q

Stub

A

A dummy function or procedure used in place of one yet to be written
Used to indicate when sub program will be called and if it was successful
Ensures code will still function without sub program

35
Q

Driver

A

Code to test a function/procedure which has been written when rest of program has not

36
Q

Integration Testing

A 
Tests modules either individually or together (In smaller projects) to ensure that they all work together
Advantage is that it tests how modules work together, tests features which would otherwise be impossible to test at individual module level
37
Q

Alpha Testing

A

Carried out by developers or by a team selected by the developers

38
Q

Integration Test Plan identifies;

A

Original software specification
Test documentation from component testing
List of test data to be used
List of conditions in place prior to testing

39
Q

Acceptance (Beta) Testing

A

Carried out by client on software or potential customers on commercial software
Client accepts delivery of software and that it is fit for purpose

40
Q

Disadvantage of Alpha testing

A

Programmers associated with the project may not see difficulties of a novice user and can be unintentionally biased

41
Q

Advantage of beta testing

A

People who may actually use the software can spot errors and bugs which might have not been noticed during Alpha testing
Companies gain key information about their errors in software which may be fixed before release

42
Q

Beta Testers

A

Computer journalists or users of previous versions of the software
They receive it for free/at a discount and earlier than the rest of the public in return for recording any errors they find

43
Q

Usability Testing

A

Used to ensure software is as easy to use/understand as possible

44
Q

Appropriate

A

Designed with user and tasks they will be carrying out in mind
Use of language and concepts familiar to the user
Skeuomorphism - Some interfaces try to mimic their physical counterparts eg Radio app with turning knobs and switches

45
Q

Customisable

A

Interface should be changeable without compromising on functionality

46
Q

Accessibility Testing

A

Carried out to see how well a piece of software or information system caters for those with disabilities

47
Q

Conditions which should be considered during accessibility testing

A 
Impaired motor control
Blindness/Impaired vision
Colour blindness
Deafness
Epilepsy
Dyslexia
48
Q

Solutions to disabilities

A

Impaired motor control - Keyboard alternative
Blind users - Screen readers, Text descriptions on images, text placed at the top
Colour blind - Avoidance of certain colour combinations which appear the same
Epilepsy - Flashing colours or flickering images avoided
Dyslexia - Ability to create a 3rd party ‘skin’

49
Q

Evaluating accessibility

A 
Text alternatives
Navigation
Keyboard accessibility
Readability
Availability of help
50
Q

Thread (Concurrent Programming)

A

A stream/sequence of instructions

Can be given levels of priority meaning that less important threads get very little processor time

51
Q

Concurrent Programming

A

Several streams of operations may execute simultaneously
Relevant to programs running on systems with more than one processor
Streams can communicate and interfere with each other
Programmer develops code but translation software is used to deal with threading

52
Q

Deadlock (Concurrent programming)

A

When two threads are waiting for each other to finish and neither does
Both enter a waiting state because the resource which they require is in use by the other

53
Q

Race Condition (Concurrent programming)

A

Two threads both try to change the value of the same variable - they are ‘racing’ eachother to access/update a variable

54
Q

Race Condition - ‘Check then act’

A

IF X = 5 THEN - This is the check
Set y TO X * 2 - The act
If another thread changed X in between the check
Then y will not have the correct value - 10 in this example
END IF

55
Q

‘Lock’ to prevent race condition occurring

A 
#Lock is placed to ensure only one thread may access it at a time #
If X = 5 THEN - The Check
SET y to X * 2 - Act successful as X cannot be changed until lock removed
END IF
# Remove lock#
56
Q

Resource Starvation (Concurrent programming)

A

Thread priority results in some threads accessing resources required by another Therefore the ‘starved’ thread never manages to complete
This is usually as a result of poor scheduling or higher priority threads taking priority over lower ones

57
Q

Concurrency Control (Concurrent programming)

A

The ability to correctly sequence interactions between threads
Resource access shared among operations according to their priority

58
Q

Concurrent Programming Advantages

A

User can interact with applications whilst tasks are running
- Eg Stopping file download in a web browser
Long Running Tasks do not delay short ones
- Eg Web Server may serve a web page whilst processing a query
Complex programs make better use of multiple resources in new multi-core processor architectures

59
Q

Number of comparisons required in a binary search

A

Half the total number (n) of items in a list

60
Q

Number of comparisons required in a linear search

A

Finding the power of 2 greater than the number of items in a list eg list of size 3 = 2^2 as this equals 4

61
Q

Linear search 4 features

A

Simple Algorithm
Data may be unsorted
N/2 = comparisons
Slow for large lists

62
Q

Binary Search 4 features

A

Complex
Data sorted
2^x>n = comparisons
Fast for large lists

Advanced Higher Computing Science (8 decks)

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