Handbook of CGTA CGTA JOSIS CAVW

 




Comp 4202
Computational Aspects of Geographic Information Systems
This is a new course for UG students. You will learn about Geographic Information, its principles, techniques used and analysis of geographic/spatial data. You will be able to understand what is inside a GIS, underlying algorithms and be able to use a system. Having taking this course, you will be able to answer e.g., how do they visualize disease spread, how does Google determine the best route algorithmically, ...

Some sample chapers include: Data representations and their operations on raster and vector devices: e.g., quadtrees, grid files, digital elevation models, triangular irregular network models. Analysis and design of efficient algorithms for solving GIS problems: point location, shortest path, facility location.

Prerequisite: A 3rd year course in Data Structures and Algorithms or the equivalent.
Through recent advances in technology such as navigation systems, mobile devices, changing user demands and new software such as Mapquest and Google Earth, the field of GIS is becoming increasingly important and also very interesting from a CS perspective. Many aspects of our daily lives are effected, the commercial impact/potential of GIS is tremendous, and novel algorithmic and applied problems need to be solved. This course lays the foundations to understand, use and further this technology.

See the
Course Outline
My students can access the Course Material via cuLearn. The textbook is: Geographic Information Sciecne and Systems by Longley et al. Fourth edition, Wiley.


Comp 5204
Computational Aspects of Geographic Information Systems
This is a newly revamped Graduate Course on this topic. This course provides you will insights into how a Geographic Information System , how geographic or spatial data differ from other data, what the technqiues are to store, access and manipulate algorithmically such data. You will get a deeper understanding of how some GIS actually work, e.g., route planning. You will also be able to explore some aspect of GIS yourself through a project of your chosing (with my help).

Sample chapters include: Data representations and their operations on raster and vector devices: e.g., quadtrees, grid files, digital elevation models, triangular irregular network models. Analysis and design of efficient algorithms for solving GIS problems: point location, shortest path, facility location. (these are covered in more breadth and depth than in 4202).

Prerequisite: A 3rd year course in Data Structures and Algorithms or the equivalent.
Through recent advances in technology such as navigation systems, mobile devices, changing user demands and new software such as Mapquest and Google Earth, the field of GIS is becoming increasingly important and also very interesting from a CS perspective. Many aspects of our daily lives are effected, the commercial impact/potential of GIS is tremendous, and novel algorithmic and applied problems need to be solved. This course lays the foundations to understand, use and further this technology.
See the Course Outline
My students can access the Course Material via cuLearn.

Comp 2804
Discrete Stuctures II
A second course that is designed to give students a basic understanding of Discrete Mathematics and its role in Computer Science. Computers handle discrete data rather than continuous data. The course presents an overview of some of the major theoretical concepts needed to analyze this type of data.

Prerequisite: COMP 1805 or MATH 1800, with a minimum grade of C-.
Counting, sequences and sums, discrete probability, basic statistics, recurrence relations, randomized algorithms. Material is illustrated through examples from computing.
See the Course Outline
My students can access the Course Material via cuLearn.