Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

Computer Science > XTRA 2 > Flashcards

XTRA 2 Flashcards

(56 cards)

Start Studying
1
Q

What is problem recognition

A

Identify there is a problem to be solved // what the
problem is

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

Data mining has to be

A

Large quantities of data

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

What does data mining do

A

Turn large quantities of data into useful information

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

Why is performance modelling used

A

Simulate/test the behaviour of the system before it is used …

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

Type of testing

A

Stress testing

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

Can trees be directed/undirected like graphs

A

No

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

Advantages of visualisation

A

 Visualisations benefit humans rather than computers
 Visualisations present the information in a simpler
form to understand
 Visualisations can best explain complex situations

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

Heuristics produce a solution in a

A

Faster time

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

Scaling problems pathfinding

A

A* will matter more bigger problems and should be a lot quicker

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

Syntax errors are

A

Underlined dynamically so they can be corrected before running which save rimes

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

Traces in IDE

A

Print outs of variable values for each statement

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

Crash dump

A

Shows state of variables when error occurs

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

Cross referencers in IDE

A

Identifies where variables/constants are used in a
program to avoid duplications

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

Why would a value b passed by alue

A

 If the value is sent by value, num1 will not be overridden
/ it is a copy of the parameter that is used (1) and this
will produce the correct output (1)
 if the parameter had been passed by reference it would
not produce the correct result (1) as num1 would be
overridden / because it is a pointer to the address of the
variable (1

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

What is gobal same as

A

Reference

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

Global takes more

A

Memory

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

What do parameters and local allow

A

Memory t obe reallocated

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

Ae more memory spaces needed for local

A

Yes in recursion

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

Why do recirsion use more memory

A

 Each recursive call stores the current state on the stack // creates new variables
 Iteration reuses the same variables

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

Flags and

A

lowerbound greater than or equal to upperbound

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

Same and differences between records and classes

A

Record is a data structure…
 …A class is a template for making data structures (objects)
 Class also has methods (which describes functionality)
 Both store data of different types
 Which can be accessed by their names
 But classes can make them accessible via methods
 Both can have multiple ‘instances’
 Class can include visibility of properties / private

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

Does date need speech marks

A

Yes

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

How do private attributes remain integrity

Study These Flashcards
A

Properties (are encapsulated) and can only be accessed through their methods
 Enforce validation through the method // inappropriate data can be caught before entered
 Cannot be changed/accessed accidentally

24
Q

What does caching rely on

Study These Flashcards
A

…Relies on same item being searched for multiple
times
…Kamran needs to decide how feasible this is
based on the number of item

25
can binary or linear be done concrrently
Linea ys binary no
26
concurrent processing in a game
Game could have large number of requests to the server at a time ... server needs to respond in reasonable time ... having multiple processors handling the different requests would increase response time Users could override each other’s changes ... e.g. needs to handle if someone updates their circus while someone else is visiting ...use record locking to stop edits if someone else has access to data Different users will have different response times ...therefore the processor can still handle other requests ...so that the performance for other users is not affected
27
Why abstraction would be used
Reduced development time (1) as factors that can detract from the program can be ignored (1) Program more likely to solve the problem (1) as unnecessary aspects will not detract from the main purpose of the program (1) Reduces complexity of programming code (1) therefore can run on lower spec computers(1)
28
Features for WRITING code
Autocomplete (1) which will predict variable / built-in functions (1) Auto indent (1) to automatically indent code when selection / iterative statements are used (1) Colour coding (1) to be able to distinguish between the different parts of each statement/line (1)
29
RAD how is development time reduced
Reduced development time (1) due to time boxing / each subtask being given a strict time limit (1)
30
Increased user involvement so
Increased user involvement (1) so issues can be identified and fixed early / more likely to meet client
31
Why is RAD more flexible
The requirements do not all need to be stated at the start (1) so therefore it is more flexible (1)
32
Does white box or black box require programming skills
White
33
When would by value be used for recursion
By Value  … the original values do not need to be modified  … byRef would not work / would cause the routine to crash
34
Decomposition
Can tackle each sub problem independently
35
What else can you do with IDE
Can write subroutines for the program and it will tell you what parameters are needed  Allow you to run the program without exiting the software / having to load a separate compiler  Integrates other tools such as version control. User friendly for novices  Increase speed of writing  Fewer mistakes  Increase speed of testing / finding errors  Collaborative team working facilitated
36
Why would an insertion sort use less memory than merge sort
Merge sort might create a new array each time it splits and merges / often implemented recursively which places additional data on the stack  Insertion sort does not use any additional arrays//Insertion sort is an in-place algorithm
37
Extra points for abstraction application
 Reduce memory/processing requirements  Could involve a large number of images that would take excessive memory  Reality contains things that aren’t relevant to a computer program
38
What are hte lines in trees called
Branches
39
What do you HAVE TO SAY FOR STUFF
DATA STRUCTURE
40
What makes something solvable by computationa, methods
* Involves calculations * Has inputs, processes and outputs * Involves logical reasoning
41
What is quick sort ideal for
Parralel processing
42
benefits of global variables
Variable doesn’t need passing as a parameter (byref) * You don’t need to return a value * Can be accessed from any function / anywhere in the program
43
Drawbacks of global variables
Increases memory usage (as it is used until full program execution is over) * Alterations within the function may have unwanted side effects elsewhere in the program.
44
Where can reusable components be used
Program libraries and reduces testing requirements
45
When does depth return values
Depth first goes to the left node, this becomes a new tree. It continues going to the left until a leaf. It then returns this, then goes right and repeats from the start. Follow left, follow right, take root.
46
Which generally has a better complexity timne breadth or depth
breadth
47
When may depth never return a value
Large trees
48
When is breadth more fficient
When data searched for is closer to root
49
Which can be written recursivelt
Depth to aid undestanding
50
Why would an array be used
Can refer to all 50 only using one identifier // all values can be indexed in one array * The numbers can be passed as a single parameter * Does not need 50 variables to be declared/passed
51
Insertion SIMPLE
makes first value sorted list then inserts each item into sorted list
52
Abstarction to
Reduce processing requirements or jiustr say simplify
53
Three other differences between trees and grapghs
More than one path is allowed in a graph * Graphs do not have a root node * Graphs can be weighted
54
WHY would performance modelling be used
Test with large and small values * e.g. largest number of deliveries * e.g. largest number of possible routes * Model how well the system scales with increasing use.
55
What does OOP define objects as
defines an object as an independent entity
56

Computer Science (33 decks)

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