GIS second year exam Flashcards

1
Q

Attribute selection selects a subset of features by preforming a select operation using…

A

Structured Query Language (SQL)

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

In vector analysis attributes can be created…

A

using existing functionality and adding item values to empty attributes

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

Spatial selections selects features on the basis of spatial relationships to other features and requires … input features

A

two

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

Buffering

A

The process of creating areas of calculated distance from a point, polyline or polygon

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

Polygon buffers can be…

A

outside, inside the line segment or both

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

A doughnut polygon buffer…

A

has a predefined range

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

Buffers can express suitability gradients but cause confusion when…

A

overlapping boundaries have not been resolved

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

Overlay operations allow the process of…

A

comparing features between multiple feature classes to allow spatial relationships between geographical coincident but different geographical phenomena to be studied

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

Set theory uses Boolean operations to allow overlays such as…

A

union, intersection and erase

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

Overlays can cause sliver polygons due to differences in data. They can be resolved by…

A

generalisation

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

Raster distance can be measured in a different ways such as…

A

Euclidean, Manhattan, proximity, proximity maps (buffering) and cost surfaces

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

How can proximity maps create buffers?

A

The proximity map measures distance as concentric equidistant zones and shows shortest straight line distance from cell to feature. Use the required buffer distance from feature and reclassify the proximity map

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

Reclassification…

A

replaces a cell of a particular value with a new one to simplify the raster data

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

Raster can also be overlayed - true or false?

A

True

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

In a local function…

A

the output value of each cell is a function of the corresponding input at each location. Value not location dependent

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

Local functions include…

A

exponential, reclassification and logarithmic

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

The output value of each cell is a function of the value of the input cells is a specified neighbourhood (e.g. 3x3) in a…

A

focal function

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

Focal and zonal functions include…

A

mean, stdev and sum etc

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

The output value at each location depends on the values of all input cells in an input value grid that shares the same input zone in a…

A

zonal function

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

In a global function…

A

output value of each location is potentially a function of all cells in the input grid

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

Global functions used for…

A

distance functions, surfaces and interpolation

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

An example of raster overlap mapematics is…

A

rainfall-evaporation=potential runoff

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

Spatial interpolation

A

Making an estimate of the value of an unsampled location using measurements made at locations in the same area

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

Spatial interpolation can be…

A

global/local, linear/non-linear and exact/inexact

25
Q

The three methods of interpolation are

A

inverse distance weighted, triangular irregular network and global trend surfaces

26
Q

Inverse distance weighted interpolation is calculated by…

A

using known values and weights based on distance (know the equation)

27
Q

TINs calculate things like elevation by…

A

breaking area into a series of triangles and calculating each point based on the vertices

28
Q

Global trend surfaces model unknowns using smooth mathematical functions (equivalent to polynomial regression) to produce interpolated general trends. It can be…

A

1st, 2nd or 3rd order and can derive trend for existing surfaces or for points

29
Q

Interpolation approach for broad geographical trends?

A

Trend surfaces when being aware of generalisation

30
Q

Interpolation method for complex spatial variation?

A

Inverse distance weighted or TIN

31
Q

What are four things to consider in interpolation?

A

Representation, no. and location of points, boundary problems and parametrisation

32
Q

In surface analysis, slope mapping calculates…

A

the maximum rate of change from each grid cell

33
Q

What are the two components of slope?

A

Gradient and direction

34
Q

What secondary features can be derived from a DEM surface?

A

profile curvature and plan curvature

35
Q

Local Drainage Direction (LDD) Network is calculated to derive surface topology. What is this process?

A

Calculate steepest downhill slope within a 3*3 window and assign direction vector. This creates a raster where each cell contains the direction to the next cell

36
Q

DEMSs can contain localised depressions called sinks (natural or DEM errors) that are removed when modelling hydrology. What are these?

A

They contain no output flow direction

37
Q

How is flow accumulation calculated (also used to derive streams)?

A

By calculating the accumulated upstream cells of each cell which is based on flow direction grid (LDD)

38
Q

How are watersheds calculated?

A

By calculating the upstream area that contributes flow to location from LDD network

39
Q

What are two drawbacks of traditional Boolean land suitability approaches?

A

It’s too binary as assumes land always suitable and you cannot show which criteria are most important

40
Q

MCE is the process of…

A

using multiple weighted criteria to quantitively evaluate the suitability of locations for a particular activity

41
Q

What are the steps in a MCE?

A

Criterion preparation, standardisation, weights and constraints

42
Q

Why do some data sets have to be prepared?

in MCE

A

Attributes like proximity to features have to be derived

43
Q

What are constraints in MCE?

A

Boolean data-sets that represent areas that regardless of all other criteria considered are unsuitable for the problem being addressed

44
Q

Why is criteria standardisation completed?

A

The unsure all criteria are expressed on the same measurement and scale

45
Q

It is important that weights sum to 1 in MCE, what are two weight methods?

A

DIY and pairwise comparison

46
Q

In a network model, what represents locations and connections?

A

Nodes and edges (or links)

47
Q

What defines the connectivity of the network?/

A

Topology

48
Q

Three uses of network analysis

A

fault-finding in utilities, hydrological modelling, transport route planning

49
Q

Examples of weights in a network model

A

demand for nodes and travel time for edges

50
Q

Directed networks are used for unidirectional things like waste water pipes and these models have some weights as bidirectional and some unidirectional. How to create a directed network?

A

Use the Utility Analysis tool to assign sinks and sources. Then set the flow direction to determine direction of edges in network so analysis can be performed

51
Q

Additional network features

A

Centres (supply/demand maximum), stopes (transfer and costs), barriers (no movement) and turns (restrict direction)

52
Q

The four network types.

A

undirectional/unweighted, undirectional/weighted, directional/unweighted,directional/weighted

53
Q

The three network path analysis types.

A

shortest path analysis, origin destination analysis and location allocation analysis

54
Q

shortest path analysis uses Dijkstra’s algorithm to…

A

find the shortest cost of moving across the network

55
Q

Shortest path analysis can’t do travelling salesman problem but can do…

A

route by minimising topological edges, route by attribute weight and tour by attribute weight

56
Q

Origin destination matrix uses origins and destinations to derive shortest path between all possible pair-wise combinations. It’s common to…

A

generate origins and destinations as centroids and then create link to real network during analysis

57
Q

Location allocation analysis…

A

assigns locations via an analysis of their connectivity. Can be used for vehicle routing or classic allocation. Can be seeing how much of a network can access service or find closest service station

58
Q

First part of Dijkstra’s algorithm.

A

Assigns initial distance of 0 for distance from origin to origin. Set distance to all other nodes as infinity. Set origin node as current node and other unvisted.

59
Q
A