This course uses microeconomic analysis to examine economic relationships among countries. Issues addressed include why nations trade, the distributional effects of trade, economic growth, factor mobility, and protectionism. Also included are discussions of the special trade-related problems of developing countries and of the history of the international trading system.

Requisite: ECON 111/111E. Limited to 50 students. Fall and spring semesters.  Professor B. Yarbrough.

This course examines the determinants of and linkages between market structure, firm conduct, and industrial performance. Some of the questions that will be addressed include: Why do some markets have many sellers while others have only few? How and why do different market structures give rise to different prices and outputs? In what ways can firms behave strategically so as to prevent entry or induce exit of rival firms? Under what circumstances can collusion be successful? Why do firms price discriminate? Why do firms advertise?

Health care poses many pressing questions: Why do we spend so much on health care?  Does this spending actually produce better health?  How do health care institutions function?  What is the appropriate role of government? How are we to judge the efficiency and equity of health care policy?  By applying economic analysis to health, health care, and health care markets, health economics provides insight into these questions.

Independent reading.

Fall and spring semesters.

This course covers basic mathematical concepts that are essential in computer science, and then uses them to teach the theory of formal languages and machine models of languages. The notion of computability will be introduced in order to discuss undecidable problems. The topics covered include: regular, context-free and context-sensitive languages, finite state automata, Turing machines, decidability, and computational complexity. Offered in alternate years.

Requisite: None, although analytical aptitude is essential. Spring semester.  Professor L. McGeoch.

Independent reading.

Fall and spring semesters.

Computing networks have fundamentally changed the ways in which we use computers. The ubiquity of networks and their broad range of uses have created substantial challenges in the area of computer communication. Not only must data be delivered quickly and reliably from one computer to another, but in many cases that data must also be secure from eavesdroppers. Moreover, the recipient of the information often needs to be sure of the identity of the sender. Encryption can be used to achieve both security and authentication of information.

This course will examine the principles and design choices involved in creating the software and hardware systems on which ordinary computer programs rely. It will develop advanced topics in computer processor architecture, cover the design of operating systems and runtime systems, and provide an introduction to programming language compilers. Architectural topics will include pipelines, out-of-order execution, symmetric multithreading, and multi-core cache management.

This course is the first part of a two-semester sequence examining data structures (ways of organizing data so that it can be used effectively) and algorithms (the methods that can be used to manipulate data). The use of appropriate data structures and algorithms can often dramatically reduce the computational work needed to solve a problem. Topics examined in this course will include proof techniques, run-time analysis, heaps, hash tables, sorting, searching, and divide-and-conquer algorithms.

A continuation of COSC 111. This course will emphasize more complicated problems and their algorithmic solutions. The object-oriented programming paradigm will be discussed in detail, including data abstraction, inheritance and polymorphism. Other topics will include linked lists and trees and the use of finite-state machines in algorithm design. A laboratory section will meet once a week to give students practice with programming constructs. Two class hours and one one-hour laboratory per week.