Brainscape's Knowledge GenomeTM

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


See full index

Computer Science > XTRA 2 > Flashcards

XTRA 2 Flashcards

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

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

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
Q

can binary or linear be done concrrently

A

Linea ys binary no

26
Q

concurrent processing in a game

A

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
Q

Why abstraction would be used

A

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
Q

Features for WRITING code

A

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
Q

RAD how is development time reduced

A

Reduced development time (1) due to
time boxing / each subtask being given
a strict time limit (1)

30
Q

Increased user involvement so

A

Increased user involvement (1) so
issues can be identified and fixed early
/ more likely to meet client

31
Q

Why is RAD more flexible

A

The requirements do not all need to be
stated at the start (1) so therefore it is
more flexible (1)

32
Q

Does white box or black box require programming skills

A

White

33
Q

When would by value be used for recursion

A

By Value
 … the original values do not need to be modified
 … byRef would not work / would cause the routine to crash

34
Q

Decomposition

A

Can tackle each sub problem independently

35
Q

What else can you do with IDE

A

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
Q

Why would an insertion sort use less memory than merge sort

A

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
Q

Extra points for abstraction application

A

 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
Q

What are hte lines in trees called

A

Branches

39
Q

What do you HAVE TO SAY FOR STUFF

A

DATA STRUCTURE

40
Q

What makes something solvable by computationa, methods

A
  • Involves calculations
  • Has inputs, processes and outputs
  • Involves logical reasoning
41
Q

What is quick sort ideal for

A

Parralel processing

42
Q

benefits of global variables

A

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
Q

Drawbacks of global variables

A

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
Q

Where can reusable components be used

A

Program libraries and reduces testing requirements

45
Q

When does depth return values

A

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
Q

Which generally has a better complexity timne breadth or depth

A

breadth

47
Q

When may depth never return a value

A

Large trees

48
Q

When is breadth more fficient

A

When data searched for is closer to root

49
Q

Which can be written recursivelt

A

Depth to aid undestanding

50
Q

Why would an array be used

A

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
Q

Insertion SIMPLE

A

makes first value sorted list then inserts each item into sorted list

52
Q

Abstarction to

A

Reduce processing requirements or jiustr say simplify

53
Q

Three other differences between trees and grapghs

A

More than one path is allowed in a graph
* Graphs do not have a root node
* Graphs can be weighted

54
Q

WHY would performance modelling be used

A

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
Q

What does OOP define objects as

A

defines an object as an independent
entity

56
Q
A

Computer Science (31 decks)

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