Introduction to the principles and practices of international relations in the political, military, economic, and environmental realms. Study of the development of the contemporary system to explore the effects of the structure of the international system, the institutions through which states conduct their relations, and domestic characteristics on the relations among states. (Gen.Ed. SB)

Introduction to the principles and practices of international relations in the political, military, economic, and environmental realms. Study of the development of the contemporary system to explore the effects of the structure of the international system, the institutions through which states conduct their relations, and domestic characteristics on the relations among states. (Gen.Ed. SB)

Stochastic models including discrete time Markov chains, continuous time Markov processes, Markov decision processes, queuing theory, dynamic programming and their application to manufacturing and service sector engineering processes.

This course introduces and develops methods for designing and implementing abstract data types using the Java programming language. The main focus is on how to build and encapsulate data objects and their associated operations. Specific topics include linked structures, recursive structures and algorithms, binary trees, balanced trees, and hash tables. These topics are fundamental to programming and are essential to other courses in computer science.

A basic understanding of fluid mechanics through the study of the properties, stationary behavior, and flow characteristics of incompressible fluids. The fundamental constitutive relations and conservation equations governing the pressure, velocity, and free surface elevation of the fluid. Hydrostatic forces, pipe flow, and open channel flow as examples of hydraulic engineering. Prerequisites: CE-ENGIN 240 or M&I-ENG 210, MATH 331, and M&I-ENG 230.

The design and analysis of efficient algorithms for important computational problems. Emphasis on the relationships between algorithms and data structures and on measures of algorithmic efficiency. Sorting (heapsort, mergesort, quicksort), searching, graph algorithms. Experimental analysis of algorithms also emphasized. Use of computer required.

Not available at this time.