Question 1
Question
Which is NOT a type of location-allocation problem type?
Answer
-
Minimize Impedance
-
Optimize Cost
-
Maximize Coverage
-
Minimize Facilities
Question 2
Question
costdf = e(λ * impedancedf)
This equation represents which impedance transformation in location-allocation?
Answer
-
Linear
-
Power
-
Exponential
-
None of the Above
Question 3
Question
In some location-allocation problems one must locate a new facility amongst existing, non competing facilities that provide the same service. These existing facilities are referred to as _____ in the model.
Answer
-
Candidate facilities
-
Required facilities
-
Competitor facilities
-
Chosen facilities
Question 4
Question
A Network Dataset is ideal but not required to run a location-allocation model.
Question 5
Question
Competitor facilities are specific to the maximize market share and target market share problem types.
Question 6
Question
The Huff Model is an established business tool used to describe the interaction between consumer and facility.
Question 7
Question
Which type of problem type can be used to locate candidate facilities that are near competitor facilities.
Answer
-
Minimize Impedance
-
Maximize Coverage
-
Minimize Facilities
-
Maximize Market Share
Question 8
Question
People or things that require a facility are termed
Answer
-
Candidate Facilities
-
Chosen Facilities
-
Demand Points
-
Competitor Facilities
Question 9
Question
There are at least two iterations within the Teitz and Bart Heuristic. The first iteration…
Answer
-
Assigns each demand point to its nearest chosen facility
-
Assigns the chosen facility as the required facility
-
Assigns the competitor facility as the chosen facility
-
Assigns the demand point class to the nearest competitor facility
Question 10
Question
Spatial Autocorrelation gives a measure of dispersion and how data is distributed
Question 11
Question
Moran’s I is based on a connectivity matrix and a proximity matrix
Question 12
Question
Rook’s method of determining adjacency used diagonal connectivity
Question 13
Question
All spatial autocorrelation measures are based on cross product statistics
Question 14
Question
Which is an alternative to Moran’s I?
Question 15
Question
What does n represent?
Answer
-
proximity between cells
-
continuity between cells
-
number of cells
-
number of variables
Question 16
Question
After performing the Moran’s I calculation, you will have:
Question 17
Question
What does this image indicate?
Answer
-
A positive spatial autocorrelation
-
A negative spatial autocorrelation
-
A random spatial autocorrelation
-
None of the above
Question 18
Question
Who’s first law forms the basis of spatial autocorrelation?
Question 19
Question
What is one of the primary limitations of Moran’s I
Answer
-
It relies on too much hard math
-
It is not good for highly variable data
-
Not everyone plays chess and terms like rook, bishop, and queen are confusing
-
You need a super powerful computer to properly run the algorithm
Question 20
Question
The GRASS algorithm is an example of a probability analysis tool
Question 21
Question
Fuzzy Viewshed Tools return a raster of exclusively 1’s and 0’s
Question 22
Question
Intervisibility assumes that if an object is in the viewshed of a tower, the tower is also in that object’s viewshed.
Question 23
Question
The quality of a probability analysis improves with more input binary rasters.
Question 24
Question
The Following is NOT a type of Viewshed Analysis:
Answer
-
Binary
-
Fuzzy
-
Divergent
-
Probability
Question 25
Question
Which of the following fields does NOT use Viewshed:
Answer
-
Archaeology
-
Military Science
-
Urban Planning
-
Spelunking
Question 26
Question
What does a Probable Viewshed Analysis take into account?:
Question 27
Question
What does a Fuzzy Viewshed Analysis take into account?
Question 28
Question
Fuzzy Viewshed Analysis does NOT require this as an input:
Answer
-
Binary Viewshed Raster
-
Slope Raster
-
Euclidian Distance
-
Distance Decay Function
Question 29
Question
What is NOT a limitation of a Binary viewshed
Question 30
Question
You are safe from tracking if you turn off the GPS in your phone.
Question 31
Question
The three techniques of using Wi-fi positioning system is cell identification and forward link
Question 32
Question
What are not the concerns of geotagging?
Question 33
Question
What is not a way to geotag a location?
Question 34
Question
We used FME Workbench to extract geotagged data as point?
Question 35
Question
The full power of ArcGIS can be used on extracted geotagged photos?
Question 36
Question
How accurate is the location information of geotagged photos?
Answer
-
30 - 40m
-
10 - 40 cm
-
10m - 20m
Question 37
Question
What tool was used to extract the points from the geotagged photos?
Question 38
Question
In AGPS which technique has the receiver still communicating with the satellites?
Answer
-
Mobile station assisted
-
Mobile station based
-
Mobile station helper
Question 39
Question
GeoServer is open source.
Question 40
Question
GeoServer is OGC compliant.
Question 41
Question
Secured Socket Layer utilizes port #443.
Question 42
Question
GeoServer can only be installed on a virtual server.
Question 43
Question
Which of the following ports are not neccessary for a PostGIS enabled database and GeoServer system?
Answer
-
22 (SSH)
-
80 (httpd)
-
5432 (postgresql)
-
8443(SSL)
-
110(POP3)
Question 44
Question
What is the Debian command that corresponds to Linux command-line command ‘yum’?
Answer
-
wget
-
rpm
-
sudo
-
apt-get
-
make
Question 45
Question
What file has to be modified to allow remote access to the PostgreSQL database?
Answer
-
pg_hba.conf
-
iptables
-
postgresql.conf
-
httpd.conf
-
workers.properties
Question 46
Question
Which one of the following formats can NOT be used with GeoServer?
Answer
-
KML
-
GML
-
SHP
-
GeoTIFF
-
MrSID
-
WAR
Question 47
Question
Which one of the following must be up and running before you install Tomcat?
Question 48
Question
Which one of the following is not a strength of GeoServer?
Answer
-
Integrate with existing map APIs
-
Equipped with proprietary spatial engine
-
Compatible with popular GIS formats
-
Capable of tile caching
-
Customizable layout templates
Question 49
Question
Which is a source of error
Answer
-
Undershoot
-
Instrument Inaccuracy
-
Changes over time
-
All of the above
Question 50
Question
The accuracy of the Monte Carlo method is inversely related to the square root of the number of runs N?
Question 51
Question
What does ‘g’ represent in the following formula?
Answer
-
Output
-
Attribute
-
GIS operation
-
None of the above
Question 52
Question
Which error propagation technique is an approximation of things based on samples?
Question 53
Question
Uncertainty cascades through a sequence of operations in spatial GIS data
Question 54
Question
Error propagation can only be used once the input errors to the analysis are available
Question 55
Question
What is the most important thing to take into account when running a Monte Carlo method?
Answer
-
Randomly generated numbers
-
Approximation of the GIS operation
-
Numbers fall within 1 standard deviation from mean
-
All of the above
Question 56
Question
What is the aim of the Taylor series approximation method?
Question 57
Question
Which of the following is not a cause of errors in GIS
Answer
-
Collection
-
Classification
-
Digitization
-
Measurement
-
None of the above
Question 58
Question
When no record is kept of the accuracy of intermediate results, it become extremely difficult to evaluate the accuracy of the final results.
Question 59
Question
In Step 1 of Dijkstra’s algorithm, when setting tentative distances, the source node should be set to zero and all other nodes to infinity
Question 60
Question
The CCRP method is MORE ACCURATE that the linear programming algorithm
Question 61
Question
What is the name of the set.list created after the source node is set as "current"?
Answer
-
Unmarked Set
-
Unvisited Set
-
Unnamed Set
-
Network Set
-
None
Question 62
Question
Which of the following is NOT true of the Game Theory approach to Dijkstra’s algorithm?
Answer
-
finds the most efficient path
-
algorithms can handle unexpected events
-
can't be used for prediction
-
can account for congestion
Question 63
Question
What is the basic purpose of Dijkstra’s algorithm?
Question 64
Question
During the algorithms calculation, each node in the network is continuously revisited
Question 65
Question
Dijkstra’s algorithm was formulated in 1956 and published in 1958
Question 66
Question
Which of the following are variants of Dijkstra’s algorithm?
Answer
-
Common
-
Priority Queue
-
Uniform cost search
-
All of the Above
Question 67
Question
Why can a game theory approach to routing provide better results for each traveller compared to a naive approach?
Answer
-
Every traveller takes other's choices into account
-
Making better use of the entire network
-
Not focussing on the shortest path only
-
All of the above
-
None of the above
Question 68
Question
What is a real life application of Game theory approach to routing?
Question 69
Question
R is an implementation of which language ?
Answer
-
C
-
Python
-
Greek
-
S
-
None of the above
Question 70
Question
R is best suited for
Question 71
Question
Which package was used to read in a shapefile?
Answer
-
readShapePoly()
-
maptools
-
CoolTips
-
DPLYR
-
All of the above
Question 72
Question
Which R package provides the left_join() function?
Answer
-
dplyr
-
postgis
-
RStudio
-
maptools
Question 73
Question
Which publications is using R to create award winning data visualizations?
Answer
-
Der Spiegel
-
Washington Post
-
New York Times
-
None of the above
Question 74
Question
How many packages are available for R?
Question 75
Question
R supports 3-Dimensional Arrays
Question 76
Question
You can use <= to assign variable values.
Question 77
Question
R can be run with single commands in the console.
Question 78
Question
One can implement Colorbrewer palettes within R.
Question 79
Question
The two main sections of Lidar data are Airborne and Terrestrial
Question 80
Question
All of these can process Lidar data except:
Answer
-
GRASS
-
ArcGIS
-
ENVI
-
GlobalMapper
-
None of the above
Question 81
Question
A user can import .las files from the “add data tool” in ArcMap
Question 82
Question
Which of the following is not included in the UG survey Lidar rules:
Question 83
Question
Sources of uncertainty in extracting vector features from LIDAR data can be found in…
Question 84
Question
How many returns does a LIDAR pulse produce?
Question 85
Question
From the 31 classifications in the American Society for Photogrammetry and Remote Sensing, many of them are placeholders for future classifications
Question 86
Question
ArcToolbox in ArcGIS has a Change Vector Analysis tool.
Question 87
Question
CVA is a change detection technique that can be used on multispectral datasets.
Question 88
Question
Sector codes may be used to interpret what type of change is occurring.
Question 89
Question
The algorithms used within CVA are based on the Pythagorean Theorem and the cosine function.
Question 90
Question
Before CVA can be conducted, what needs to be done to the input images?
Question 91
Question
What is a limitation of using CVA for change detection?
Answer
-
It can’t be used to detect change in multispectral datasets
-
It is difficult to determine threshold value
-
It produces poor results when applied to forestry applications
-
None of the above
Question 92
Question
Which of the following is not a common change detection technique?
Answer
-
Change Vector Analysis
-
Post-classification
-
Image differencing
-
Image multiplication
Question 93
Question
What datasets are appropriate for CVA?
Answer
-
Feature classes
-
Raster datasets
-
Tables
-
All of the above
Question 94
Question
Which of the following is an output of CVA?
Answer
-
Change direction
-
Change rotation
-
Change ratio
-
Change integration
Question 95
Question
If change magnitude = 0, what does this indicate?
Answer
-
NoData
-
At least one band has an input pixel DN value of 0
-
No change in DN value in at least one band
-
No change in DN value over all bands
Question 96
Question
What is NOT a method of calculating a Voronoi Diagram?
Answer
-
Fortunes Algorithm
-
Divide and Conquer
-
Construction Algorithm
-
Dijkstra’s Algorithm
Question 97
Question
When could you use a Voronoi Diagram?
Answer
-
To create a rainfall surface
-
To determine the nearest pub to BCIT
-
To determine paths of least resistance
-
All of the above
Question 98
Question
What method of Voronoi Diagram calculation is more time efficient?
Answer
-
Fortunes Algorithm
-
Divide and Conquer
-
Construction Algorithm
-
Dijkstra’s Algorithm
Question 99
Question
A Voronoi diagram divides the drawing into regions around each point that are shaped so that the borders of the regions are equidistant from the two nearest points.
Question 100
Question
Voronoi Diagrams first use was linked to Peter Gustav Lejeune Dirichlet in 1705
Question 101
Question
What is euclidean geometry?
Answer
-
a way of dividing space where objects in an area are more related to each other than the area that surrounds them
-
a type of analytic geometry, which uses coordinates
-
a type of synthetic geometry, which does not use coordinates
-
a way of dividing space where objects in that space are closer to the object it surrounds than any other object
-
Both A and B
-
Both C and D
Question 102
Question
A half-space is:
Answer
-
a closed space
-
a open or closed space
-
a concave space
-
one dimensional space
Question 103
Question
Convex polygons:
Answer
-
have internal angles greater than 180 degrees
-
are an open space with angles less than 180 degrees
-
are entirely contained, defined by each of its edges
-
can only be strict convex polygons
Question 104
Question
Sweep line algorithms can be used for generating Voronoi Diagrams
Question 105
Question
The point between three Voronoi points is a vertices or node
Question 106
Question
Which is NOT the type of geometries that form a multipatch?
Answer
-
Rings
-
Triangle Fans
-
Pyramids
-
Triangle Strips
Question 107
Question
ArcScene and ArcGlobe can be used display and analyse 3D models
Question 108
Question
Which tool is used for storing Multipatch data?
Question 109
Question
ArcGIS does not have tools for applying Multipatch textures
Question 110
Question
Which of the following is not true?
Answer
-
Multipatch is a 3D geometry data type
-
Retain Multipatch textures by storing in a Geodatabase
-
Multipatch is viewable in 3D on ArcMap
-
Rings are 3D polygons defined by a bounded area
Question 111
Question
What is the data type of this structure? (0, 1, 2), (0, 2, 3), (0, 3, 4), (0, 4, 5)?
Answer
-
Triangle strips
-
Triangle fans
-
Rings
-
lines
Question 112
Question
5 points can form triangle-structured a multipatch
Question 113
Question
Inner ring-structure should be counter-clockwise direction
Question 114
Question
What feature class is needed for executing Intersect 3D analysis?
Answer
-
Multipatch
-
Polygon
-
Line
-
Point
Question 115
Question
What attributes can be added with Add Z Information tool?
Answer
-
Height values
-
Surface area
-
Volume
-
All of above
Question 116
Question
What data format is not recommended for
temporal Data?
Answer
-
Date
-
String
-
Double
-
Integer
Question 117
Question
A model that uses 12 layers representing Saskatchewan's monthly precipitation values in 2010 is an example of which data model?
Question 118
Question
What is the difference between real time and
near real time data?
Question 119
Question
What toolbar is used to create Keyframes?
Answer
-
COGO
-
Raster Planning
-
Animation
-
Spatial Analyst
Question 120
Question
What needs to be enabled in order to use the Time Slider?
Answer
-
Symbology
-
Topology
-
Animation Tools
-
None of the Above
Question 121
Question
A model that uses 1 layer with a Date field
within the attributes is an example of which
data model.
Question 122
Question
Event Based Spatiotemporal Data Model best
represents Vector Data.
Question 123
Question
The Snapshot Data Model, which timestamps
layers, has issues with data redundancy
Question 124
Question
ArcGIS has the ability to convert Strings into
Date field types
Question 125
Question
Weather Stations are a good example of
discrete temporal entity.
Question 126
Question
What is NOT an example of a fractal mathematical set?
Answer
-
Mandelbrot Set
-
Kalender Set
-
Koch Curve Set
-
Cantor Set
Question 127
Question
As the length of a measuring stick is scaled smaller, the measured perimeter of a coastline decreases
Question 128
Question
Benoit coined the term fractal
Question 129
Question
What does the diamond step of the diamond-square algorithm do?
Answer
-
Assigns a midpoint between the corner points
-
Assigns the first corner point
-
Assigns a mean value for the mid points
-
Assigns a center value for the square
Question 130
Question
What does the square step of the diamond square algorithm do?
Answer
-
Assigns a midpoint between the corner points
-
Assigns the first corner point
-
Assigns a mean value for the mid points
-
Assigns a center value for the square
Question 131
Question
In GRASS GIS, which of the following is NOT a parameter that can be specified when running r.surf.fractal?
Answer
-
output raster name
-
number of topological dimensions
-
number of intermediate images to save
-
number of fractal dimensions
Question 132
Question
A theoretical ideal cube has how many fractal dimensions?
Question 133
Question
With the correct parameters set, r.surf.fractal can produce an aspect raster.
Question 134
Question
The rougher a surface is, the fewer fractal dimensions the surface has.
Question 135
Question
GRASS GIS uses the following method to create a fractal surface
Question 136
Question
What is self-similarity
Answer
-
an object looks like another object
-
an objects subset looks like the whole object
-
an object looks like a fractals subset
-
a fractals subset looks like the whole
Question 137
Question
The diamond square algorithm was introduced at the Special Interest Group on Graphics and Interactive Techniques (SIGGRAPH)