This course continues the exploration of data structures and algorithms that is begun in COSC 201. Topics include balanced search trees, amortized algorithms, graph data structures and algorithms, greedy algorithms, dynamic programming algorithms, NP completeness, and case studies in algorithm design.

Requisite: COSC 112 and 201. Fall semester.  Professor L. McGeoch.

The main purpose of a programming language is to provide a natural way to express algorithms and computational structures. The meaning of “natural” here is controversial and has produced several distinct language paradigms; furthermore the languages themselves have shaped our understanding of the nature of computation and of human thought processes. We will explore some of these paradigms and discuss the major ideas underlying language design. Several languages will be introduced to illustrate ideas developed in the course.

This course will provide an introduction to computer systems, stressing how computers work. Beginning with Boolean logic and the design of combinational and sequential circuits, the course will discuss the design of computer hardware components, microprocessing and the interpretation of machine instructions, assembly languages, and basic machine architecture. The course will also introduce operating systems topics, basic memory management, and topics in network communication.

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.

This course introduces ideas and techniques that are fundamental to computer science. The course emphasizes procedural abstraction, algorithmic methods, and structured design techniques. Students will gain a working knowledge of a block-structured programming language and will use the language to solve a variety of problems illustrating ideas in computer science. A selection of other elementary topics will be presented, for example: the historical development of computers, comparison and evaluation of programming languages, and artificial intelligence.

The authors read in LATI 441 and 442 vary from year to year, the selection being made according to the interests and needs of the students. Both 441 and 442 may be repeated for credit, providing only that the topic is not the same. In 2012-13 LATI 441 will read literature in the last generation of the Roman Republic. Three class hours per week. Seminar course.

Requisite: LATI 215 or 316 or equivalent.  Fall semester.   Professor Grillo.

This course will examine Catullus’ poetic technique, as well as his place in the literary history of Rome. Extensive reading of Catullus in Latin, together with other lyric poets of Greece and Rome in English. Three class hours per week.

Requisite: LATI 202 or equivalent.  Fall semester.  Visiting Professor McCutcheon.

This course prepares students to read classical Latin. No prior knowledge of Latin is required. Three class hours per week.

Fall semester. Professor McCutcheon.

The authors read in GREE 441 and 442 vary from year to year, but as a general practice are chosen from a list including Homer, choral and lyric poetry, historians, tragedians, and Plato, depending upon the interests and needs of the students. GREE 441 and 442 may be elected any number of times by a student, providing only that the topic is not the same. In 2012-13 GREE 441 will read Hesiod and the Homeric Hymns. Three class hours per week. Seminar course.

This course offers an introduction to New Testament Greek. We will read selections from the Gospels and Epistles and will discuss the social and philosophical context as well as the content of the texts. Three class hours per week.

Requisite: GREE 111 or equivalent.  Fall semester.   Professor D. Sinos.