Correspondence Directory

Majors and Courses of InstructionMathematics and Computer Science491. Directed Readings (Staff)Reading in advanced mathematics under the guidance of a faculty member. Individually arranged.498. Student Seminar (0.5 unit; Jackson)A student-lead discussion of advanced topics of interest to the students and the instructor. Studentswill complete an independent or group project on the selected topic, write a paper on their findings,and present their results to the class. Intended for junior and senior mathematics majors; otherstudents may be admitted with the consent of the instructor. Grading for the course is S/U. Thecourse may be repeated for credit on a different topic. Prerequisite: 250.499. Seminar (Staff)Intensive study of a topic selected by the faculty member in charge with presentations by students.Recent topics have included chaos, stochastic processes, combinatorics, experimental design,number theory, and curves and singularities. S.Computer Science (CS) 103. Exploring Computer Science (Staff)A survey of the many sub-fields of computer science, which will provide an introduction towhat computer science is and what computer scientists do. Topics will range from the theoretical(mathematical foundations of computing, design algorithms) to the practical (components of thecomputer, how the Internet works). No credit will be given for this course if a student has previouscredit for CS110 or any computer science course with a higher number than 110. Students cannotreceive credit for both this course and CS 102. F, S.110. Introduction to Computer Science and Programming (Staff)An introduction to the fundamental concepts and abstractions of computer science, using a studyof algorithms and computer programming as a vehicle. Topics include: the design, implementation,and application of algorithms; the uses of abstraction; the modelling and representation of valuesand entities; control flow and modularity. A high-level programming language is introduced andused. F, S.210. Intermediate Computer Science and Data Structures (Zaring)A continuation of the study of abstraction, algorithms, and computer science. Concepts related tothe design, analysis, and implementation of more advanced abstract data types (lists, stacks, queues,trees, graphs, etc.) are covered in detail. Prerequisite: 110. S.255. Computer Organization (McCulloch)The organization and inner-workings of computer systems are covered in some detail, with anemphasis on the relationships among the various levels of hardware and software found in suchsystems. Attention is focused both on general concepts and on case studies of specific systems. Assemblylanguage programming is introduced. Prerequisites: 110 and 210 or consent of instructor. F.270. Paradigms of Computation (Zaring)An introduction to the fundamental and emergent paradigms, both formal and pragmatic, ofalgorithms and computation. Topics include basic automata theory, functional programming,object-oriented design, and concurrent/parallel programming. The Scheme programming languageis introduced. This course cannot be taken for credit after receiving credit for CS380. Prerequisites:210, 255, MATH 250. S.180