GISCI knowledge category 6 of 10

Analytical Methods: GISP practice questions

Analytical Methods on the GISP exam covers overlay, proximity, network analysis, interpolation, terrain analysis, spatial statistics, suitability modelling and map algebra. Here are five sample questions from our bank of 40 on this category, each with the answer and a short explanation.

Question 1 · Easy · Conceptual

Tobler's First Law of Geography states that:

  1. All spatial data must be projected before analysis
  2. Map scale is inversely proportional to the level of detail shown
  3. The shortest distance between two points follows a great circle
  4. Everything is related to everything else, but near things are more related than distant things
Show answer and explanation

Answer: D. Tobler's First Law captures the principle of spatial dependence: near things are more related than distant things. This underpins concepts like spatial autocorrelation and interpolation. The other statements describe projection, geodesy, and cartographic generalization respectively.

Question 2 · Easy · Conceptual

In a semivariogram used for kriging, the nugget represents:

  1. Variance at very short distances caused by measurement error or variation finer than the sample spacing
  2. The distance beyond which sample values are no longer spatially correlated
  3. The maximum semivariance reached by the model
  4. The number of sample pairs used in each distance bin
Show answer and explanation

Answer: A. The nugget is the semivariogram's intercept at zero distance, representing measurement error and microscale variability below the sampling resolution. The distance at which correlation ceases is the range, and the plateau semivariance is the sill.

Question 3 · Medium · Conceptual

Inverse Distance Weighting (IDW) interpolation assumes that:

  1. Sample points have no spatial relationship to one another
  2. All predicted values must equal the global mean of the samples
  3. The surface can only be estimated where samples already exist
  4. The influence of a measured point on an unknown location decreases as distance increases
Show answer and explanation

Answer: D. IDW is a deterministic method in which nearby samples are weighted more heavily than distant ones, reflecting distance-decay. It does not assume spatial independence, does not force values to the mean, and produces estimates at unsampled locations.

Question 4 · Medium · Conceptual

Kernel density estimation differs from a simple point count per cell because it:

  1. Requires a network dataset to compute distances
  2. Produces a smooth continuous density surface by spreading each point's influence over a defined search radius (bandwidth)
  3. Returns only the count of points in each non-overlapping bin with no smoothing
  4. Can only be applied to line features, not points
Show answer and explanation

Answer: B. Kernel density spreads each feature's influence outward within a bandwidth using a kernel function, yielding a smooth continuous surface that peaks at point concentrations. Simple binning counts points per cell without smoothing, and KDE works on points or lines without requiring a network.

Question 5 · Hard · Conceptual

What distinguishes a least-cost path from a simple straight-line (Euclidean) shortest path?

  1. A least-cost path minimizes accumulated cost across a cost surface, so it may be longer in distance but cheaper to traverse
  2. A least-cost path is always shorter in ground distance than the Euclidean path
  3. A least-cost path can only be computed on a vector network, never on a raster
  4. A least-cost path ignores terrain and barriers entirely
Show answer and explanation

Answer: A. Least-cost path uses a cost (friction) surface and finds the route minimizing accumulated cost, which may detour around expensive terrain and thus be longer in distance than a straight line. It is typically computed over a raster cost-distance surface and explicitly accounts for barriers and friction.

Want the other 35 Analytical Methods questions?

All 400 questions are free to practice in your browser or in the iPhone app. Timed mock exams, analytics and the full flashcard library are a one-time unlock — no subscription.

Practice online, freeGet the iPhone appRead the study guide

What this category tests

Analytical Methods is one of the ten knowledge categories in the official GISCI exam blueprint. Questions are vendor-neutral: they test concepts and professional judgement rather than the menus of one software package, and they come as conceptual, application, scenario and data-interpretation items. Expect the exam to mix easy recall with harder scenario questions where you must choose the best course of action.

Other categories

Conceptual FoundationsGeospatial Data FundamentalsCartography & VisualizationData AcquisitionsData ManipulationDatabase Design & ManagementApplication DevelopmentSystems Design & ManagementProfessional Practice

How to study for the GISP exam: a complete guide →