121

Department of Courses of Study: Minor Major (B.A./B.S.) Computer Science Post-Baccalaureate Combined B.A./M.A. Master of Arts Doctor of Philosophy

Objectives How to Become an Undergraduate Major

Undergraduate Major Previous experience in computer programming is helpful, but not The undergraduate program in computer science teaches the necessary (students lacking such knowledge may take COSI 11a fundamentals of theoretical and practical aspects of computing, [Programming in Java and C] in their first year). As a rule, our course preparing students for creative jobs in the computer industry sequence should not be started later than the sophomore year. and/or for graduate school. In addition, our curriculum is a stimulating and useful preparation for a number of indirectly related professions, such as law, medicine, and economics. How to Be Admitted to the Graduate Program

Post-Baccalaureate Program in Computer Science The computer science department offers a post-baccalauareate The general requirements for admission to the Graduate School, given certificate program for students with a bachelor’s degree in a in an earlier section of the Bulletin, apply here. Applicants for different field who wish to prepare for graduate school or a career admission to the computer science program must submit three letters in computer science. Students who complete the program may of recommendation and are encouraged to take the Graduate Record apply to the combined post-baccalaureate/M.A. program. Examination, and the advanced test in computer science. Funds from research grants and fellowships are available to provide financial Graduate Program in Computer Science support for well-qualified students. The Graduate Program in Computer Science is concerned with the fundamental concepts arising in the development and use of computing systems, including the study of computational complexity and information theory, the design and analysis of serial and parallel algorithms, the design of programming languages, systems, and artificial intelligence.

A normal program of study in computer science at Brandeis starts with two years of basic graduate course work. At the completion of this course work, students are eligible for a master’s degree. During this initial two-year period, candidates for the degree of Doctor of Philosophy select a thesis topic and advisor. Dissertation research typically requires two to three additional years.

Faculty Jacques Cohen Jordan Pollack Compiler design. Analysis of parallel Artificial intelligence. Neural networks. algorithms. Logic programming. Data Machine learning. Evolutionary Timothy Hickey, Chair; Undergraduate structures. computation. Dynamical systems. Advising Head Analysis of algorithms. Logic programming Martin Cohn James Pustejovsky, Graduate Advising Head and parallel processing. Symbolic Information theory. Codes. Sequences. Data Artificial intelligence. Computational manipulation. compression. linguistics. Machine learning.

Richard Alterman Ira Gessel Liuba Shrira Artificial intelligence. Cognitive modeling. Combinatorics. Operating systems. Distributed systems. Natural language processing. Memory-based Multi-cache computing. reasoning and everyday activity. Harry Mairson Logic in computer science. James Storer Mitch Cherniack and functional programming. Data compression and image processing. Databases. Software engineering. and constructive mathematics. Complexity Computational geometry. Parallel Programming languages. theory. Algorithmics. computing. Algorithms.

Requirements for the Undergraduate Major C. Electives: At least four additional COSI courses, excluding 2a, 11a, and 99d. At most two electives can be cross-listed courses.

Degree of Bachelor of Arts Degree of Bachelor of Science The minimum requirements for the computer science major are The minimum requirement for the computer science major are 17 full 12 full courses plus two half-credit lab courses: courses and two half-credit lab courses:

A. Core courses: COSI 21a and 22a, 21b and 22b, 29a, 30a, 31a, A. Core courses: COSI 21a and 22a, 21b and 22b, 29a, 30a, 31a, and 35a. and 35a.

B. Mathematics courses: MATH 10a, 15a. B. Mathematics courses: MATH 10a, 10b, and 15a. 122 Computer Science

CC. Two cross-listed courses from other departments (students to take the introductory and mathematics courses in Summer School should consult the individual course entries for prerequisites, and then complete the remaining core and elective courses during the corequisites, and special notes) following academic year.

D. Electives: At least six additional COSI courses, excluding COSI 2a, 11a, and 99d. At most two of these can be cross-listed Requirements for the Degree of Master of Arts courses.

Honors Course Requirements Graduation with honors in computer science requires completion Satisfactory completion of an approved schedule of nine courses and defense of a Senior Honors Thesis; students considering this numbered 100 or above, which generally must include at least two option should take note of the prerequisites for enrollment in courses from each of the following groups: COSI 99d (Senior Research). A. AI Group: COSI 111a, 112a, 113b, 114b, 120a, 125a, 200a, 200b, 210a, 210b, 215a, 216a, 217a, 300a, 300b. Combined B.A./M.A. Program B. Languages and Systems Group: COSI 120a, 127b, 140a, 146a, 147a, 150a, 155b, 200a, 200b, 210a, 210b, 220a, 227b, 300a, 300b. Available only to Brandeis students who have completed all requirements for the undergraduate B.A. degree and have C. Algorithms and Theory Group: COSI 120a, 160a, 170a, 171a, 175a, performed well in the computer science major. Students should 180a, 188a, 190a, 200a, 200b, 210a, 210b, 240b, 300a, 300b. apply in their senior year, at which time they should propose a course of study for the fifth year that typically consists of six Residence Requirement graduate-level courses, which may include independent study. The minimum residency requirement is one and a half years.

Language Requirement Requirements for the Minor in Computer Science There is no foreign language requirement.

A. A. Demonstrated ability to program in C, or COSI 11a. Requirements for the Degree of Doctor of Philosophy B. COSI 21a and 22a.

C. COSI 21b and 22b. Advisor By the end of the first year the student must obtain the consent of a D. COSI 31a. computer science faculty member to serve as advisor and dissertation committee chair. E. One elective in computer science numbered higher than 20. Course Requirements The same as that for the Master of Arts. Special Notes Relating to Undergraduates Teaching Requirement The mentoring, training, and evaluation of teaching fellows is an Students may submit a written request to count a course from ongoing and important component of the Graduate Program in another department to satisfy one of the required computer Computer Science. Students normally teach one course per year, science electives. Approval of such a request is based on the beginning as graders of problem sets and assignments and move relationship of this course to the student’s other computer progressively to higher levels of involvement with teaching in courses science electives. across the curriculum. They participate in the design and delivery of course lectures and each year, under the guidance of their faculty, they present several lectures. Whether students are preparing for an Requirements for the Post-Baccalaureate Certificate in academic and research career, or an industry position, the teaching fellow experience is valuable training in course preparation and Computer Science technical communication.

Thesis Committee and Proposal A. Introductory courses: COSI 11a, 21a 1. Establishment by the advisor and the director of graduate studies of a thesis committee consisting of the advisor, two other Brandeis B. Core courses: COSI 21b, 22b, 29a, 30a, and 31a. faculty, and one appropriate external member from outside Brandeis.

C. Electives: At least four additional COSI courses, excluding 2a 2. An approved, written thesis proposal by the candidate that surveys and 99d. At most two electives can be cross-listed courses. the relevant literature and states the goals of the dissertation and topics to be investigated (including aspects already completed or Combined Post-Baccalaureate/M.A. Program under way), along with an oral presentation to the thesis committee Available only to Brandeis students who have completed all that is open to computer science faculty who wish to attend. requirements for the Post-Baccalaureate certificate. Students should propose a course of study that typically consists of six Thesis Defense graduate-level courses, which may include independent study. Public defense of a completed dissertation will be announced three weeks in advance. Copies of the complete thesis will be available to Special Notes Relating to Post-Baccalaureate Students the faculty during these three weeks. Post-baccalaureate students with a programming background may ask to be exempted from the introductory courses: COSI Residence Requirement 11a, 21a. They may also submit a petition to replace core courses The minimum residency requirement is three years. (in which they have previous work experience or study) with electives. Students with no previous background are encouraged Language Requirement There is no foreign language requirement. Computer Science 123

Courses of Instruction abstraction, and logic programming. The COSI 31a Computer Structures and associated laboratory course is COSI 22b. Organization Usually offered every year. Will be offered [ sn ] (1-99) Primarily for Undergraduate in the spring of 2004. Prerequisites: COSI 21a,b; COSI 22a,b. Students Mr. Mairson Processors, memories, and peripherals and their interactions. Fundamental structures COSI 22a Fundamentals of Programming of computers from logic gates and circuits, COSI 2a Introduction to Computers Corequisite: COSI 21a. May yield half- through machines and assembly language, [ sn ] course credit toward rate of work and to the overall structure of operating An introduction to the basic principles graduation. Two semester hour credits. systems. Usually offered every year. Will be underlying computer hardware and software An introduction to the tools and techniques offered in the fall of 2003. and to the implications of the wider use of needed to design, construct, verify, analyze, Ms. Shrira computers in society. Topics will include and maintain programs. One afternoon a hardware, software, Web page design, applet week and one, one-hour lecture a week. COSI 33b Internet and Society and servlet programming, the Internet, Usually offered every year. Will be offered [ sn ] privacy and security issues, as well as a in the fall of 2003. Prerequisite: COSI 2a or COSI 21a. survey of current research directions, Mr. Storer Enrollment limited to 300. A library including artificial intelligence and parallel intensive course. computing. Usually offered every year. Will COSI 22b Programming Paradigms An interdisciplinary survey of the Internet. be offered in the fall of 2003. Prerequisites: COSI 21a, COSI 22a. Taught by a team of professors from several Mr. Hickey Corequisite: COSI 21b. May yield half- different departments, the course content course credit toward rate of work and will vary from year to year. Some particular COSI 11a Programming in Java and C graduation. Two semester hour credits. topics to be covered are the architecture of [ sn ] A practical introduction to the use of the Internet (and the implications this has This course may be repeated for credit by appropriate computational paradigms and on its regulation), intellectual property, students who have taken COSI 11a before programming methodologies to solve privacy, censorship, e-commerce, online spring 1998. complex problems. Problem domains vary education, and research. Usually offered A general introduction to structured from year to year but typically include every year. Will be offered in the spring of programming and problem solving using C numerical programming, symbolic 2004. and Java, in the context of the World Wide computation, natural language processing, Mr. Hickey Web. Students also learn GUI programming simulation of physical systems, and advanced HTML authoring. There are interpretation and compilation of COSI 35a Fundamentals of Artificial weekly programming assignments. programming languages. One afternoon a Intelligence Computer science majors with adequate week and one, one-hour lecture a week. [ sn ] programming skills may wish to take COSI Usually offered every year. Will be offered Prerequisites: COSI 21a,b; 22a,b; COSI 29a. 21a directly. Usually offered every year. in the spring of 2004. Survey course in artificial intelligence. Will be offered in the spring of 2004. Mr. Mairson Introduction to Lisp and heuristic Staff programming techniques. Topics include COSI 29a Discrete Structures problem solving, planning natural language COSI 21a Data Structures and the [ sn ] processing, knowledge representation, and Fundamentals of Computing Covers topics in discrete mathematics with computer vision. Usually offered every year. [ qr sn ] applications within computer science. Some Will be offered in the spring of 2004. Prerequisite: COSI 11a or programming of the topics to be covered include graphs Mr. Pollack facility in C. Corequisite: COSI 22a. This and matrices; principles of logic and course satisfies the quantitative reasoning induction; number theory; counting, COSI 98a Independent Study requirement only when taken with the summation, and recurrence relations; Signature of the instructor required. corresponding lab. discrete probability. Usually offered every Open to exceptional students who wish to An introduction to the fundamental year. Will be offered in the fall of 2003. study an area of computer science not concepts of computation: discrete Mr. Gessel covered in the standard curriculum. Usually structures (sets, relations, functions, offered every year. sequences, graphs), the fundamental data COSI 30a Introduction to the Theory of Staff structures and algorithms for sorting and Computation searching (lists, queues, dequeues, heaps, [ sn ] COSI 98b Independent Study hashing, binary trees, tries), and the Prerequisites: COSI 21a,b; COSI 22a,b; Signature of the instructor required. analysis of algorithms (predicate logic, COSI 29a. Open to exceptional students who wish to termination and correctness proofs, Formal treatment of models of study an area of computer science not computational complexity). The associated computation: finite automata and regular covered in the standard curriculum. Usually laboratory course is COSI 22a. Usually languages, pushdown automata and context- offered every year. offered every year. Will be offered in the fall free languages, Turing machines and Staff of 2003. recursive enumerability. Church’s thesis Mr. Storer and the invariance thesis. Halting problem COSI 99d Senior Research and undecidability, Rice’s theorem, Prerequisites: Open only to seniors. A grade COSI 21b Structure and Interpretation of recursion theorem. Usually offered every point average of 3.50 or higher in the major Computer Programs year. Will be offered in the spring of 2004. after completing spring semester of the [ qr sn ] Mr. Mairson junior year. Submission of a thesis proposal Prerequisites: COSI 21a, 22a. Corequisite: during the spring semester of the junior COSI 22b. This course satisfies the year. This proposal must be signed by a quantitative reasoning requirement only faculty member who has agreed to supervise when taken with the corresponding lab. the thesis. An introduction to the fundamental models Research assignments and preparation of a of computation: functional programming, report under the direction of an instructor. abstract data types, imperative Usually offered every year. programming, object-oriented programming, Staff data-driven programming, meta-linguistic 124 Computer Science

(100-199) For Both Undergraduate COSI 117a Languages and Complexity COSI 140a Logic Programming [ sn ] [ sn ] and Graduate Students Prerequisites: COSI 21b and COSI 30a. Prerequisite: COSI 31a Enrollment is limited to 20. Studies the relationship of Prolog to An introduction to how complexity theory predicate calculus, horn clauses, unification COSI 111a Topics in Computational and programming languages are linked. algorithms, intelligent backtracking, Cognitive Science Studies are compilers analyze the infinite trees, inequalities, implementation [ sn ] complexity of programs. How various issues, and concurrent Prolog. Usually Prerequisite: COSI 35a. constructs add to the expressibility of offered every second year. Last offered in Focuses on the cognitive aspects of prgramming languages is studies in detail the fall of 2001. computer-mediated group problem-solving. also. Special one-time offering. Will be Mr. Cohen Topics include computer-supported offered in the fall of 2003. cooperative work, the role of convention in Mr. Neergaard COSI 146a Fundamentals of Operating the coordination of activity, problem- Systems solving and skill acquisition, adaptive COSI 120a Topics in Computer Systems (formerly COSI 46a) systems, distributed cognition, and [ sn ] [ sn ] discourse. The laboratory work is designed Prerequisite: COSI 21a. Prerequisites: COSI 21a,b; 22a,b; 31a; to give the student practice with the ideas Content will vary from year to year. May be MATH 10a (MATH 10b recommended). and techniques under discussion. Usually repeated for credit. Prerequisites may vary This course may not be repeated for credit offered every year. Last offered in the spring with the topic area; check with instructor by students who have taken COSI 46a in of 2002. for details. Usually offered every third year. previous years. Mr. Alterman Last offered in the fall of 2000. Design of systems that share resources. Staff Specific topics: naming, binding, protection, COSI 112a Theory and Models of Intelligent reliability, synchronization, scheduling, Behavior COSI 125a Human Computer Interaction storage allocation, interprocess [ sn ] [ sn ] communication. Usually offered every Prerequisites; COSI 21b or 29a; COSI 35a. Prerequisite: COSI 21b. second year. Last offered in the spring of Topics include logics for world modeling, Covers the basic theory and concepts of 2001. representation of goals and plans, action human-computer interaction. Topics Staff theory, models of shared knowledge, include methodologies for designing and learning theories for environmental testing user interfaces, interaction styles COSI 147a Networks and Distributed modeling, and the social construction of and techniques, design guidelines, Computing concepts. Usually offered every third year. intelligent user interfaces, hypermedia, [ sn ] Last offered in the spring of 2000. adaptive systems, information search and Prerequisite: COSI 31a or the equivalent, Mr. Pustejovsky visualization, and computer supported 146a, C/C++/UNIX programming skills. cooperative work. The laboratory work is Introduces state-of-the-art networking COSI 113b Machine Learning designed to give the student practice in a technologies, architectures, and protocols, [ sn ] set of basic techniques used in the area of with an emphasis on the Internet and the Prerequisite: COSI 35a. human-computer interaction. Usually World Wide Web. Specific topics include A seminar on genetic algorithms, genetic offered every second year. Last offered in naming and RPC at the application level, programming, evolutionary programming, the fall of 2002. TCP/IP and UDP/IP at the transport/ blind watchmaking, and related topics, Mr. Alterman network levels, and Ethernet, ATM, FDDI, ultimately focusing on co-evolutionary and wireless technologies at the physical spirals and the automatic construction of COSI 127b Database Management Systems level. Usually offered every second year. agents with complex strategies for games. [ sn ] Last offered in the spring of 2002. Usually offered every second year. Last Prerequisites: COSI 21a, 22a, and 29a. Ms. Shrira offered in the fall of 2002. Introduces database structure, organization, Mr. Pollack and languages. Studies relational and COSI 155b Computer Graphics object-oriented models, query languages, [ sn ] COSI 114b Topics in Computational optimization, normalization, file structures An introduction to the art of displaying Linguistics and indexes, concurrency control and computer-generated images and to the [ sn ] recovery algorithms, and distributed design of graphical user interfaces. Topics Prerequisites: COSI 21b or 29a; COSI 35a. databases. Usually offered every second include graphic primitives; representations Provides a fundamental understanding of year. Last offered in the fall of 2002. of curves, surfaces, and solids; and the the problems in natural language Mr. Cherniak mathematics of two- and three-dimensional understanding by computers, and the theory transformations. Usually offered every third and practice of current computational COSI 128a Modern Database Systems year. Will be offered in the fall of 2003. linguistic systems. Of interest to students [ sn ] Staff of artificial intelligence, algorithms, and Prerequisite COSI 127b. the computational processes of Covers advanced topics in database systems COSI 160a Parallel Computing and comprehension and understanding. Usually such as concurrency control, recovery, Programming offered every year. Will be offered in the fall security, and data mining. Usually offered [ sn ] of 2003. every fourth year. Last offered in the spring Prerequisites: COSI 29a and 31a. Mr. Pustejovsky of 2002. An introduction to parallel computation at Mr. Cherniak the levels of architecture, communication, data structures, algorithms, analysis, programming models, and programming languages. Usually offered every second year. Last offered in the spring of 2001. Staff Computer Science 125

COSI 170a Information Theory and Coding COSI 190a Introduction to Programming COSI 227b Advanced Topics in Database [ sn ] Language Theory Systems Prerequisites: COSI 29a and 30a, MATH [ sn ] Prerequisite: COSI 127b. 10a. Prerequisite: COSI 21a or familiarity with a An in-depth treatment of advanced topics in Information theory as applied to the functional , set database management systems. Topics vary problems of rewriting digital data to be theory, and logic. from year to year and may include more concise, more error-resistant, or more Lambda calculus and combinatory logic: distributed databases, query processing, appropriate to physical environments. Church-Rosser theorem, continuity and transaction processing, and Web-based data Usually offered every second year. Last computability, denotational semantics, management. Usually offered every second offered in the spring of 2002. model theory. Typed lambda calculi: strong year. Last offered in the spring of 2001. Mr. Cohn normalization, representability, Mr. Cherniack completeness of equational reasoning, COSI 171a Cryptology: Cryptography and Curry-Howard isomorphism. Introduction COSI 240b Computational Logic Cryptanalysis to ML: polymorphism and , Prerequisite: Some previous exposure to [ sn ] module system. Category theory: logic, computation theory, and functional Prerequisites: COSI 21a and 29a. categorical combinators and compilation, programming. The study of data secrecy, privacy, and continuations, monads. Usually offered An introduction to logic in computer security. How can information be encoded every second year. Last offered in the fall of science. Propositional and first-order logic: so that an adversary can neither alter it, 2001. completeness, compactness, unification and forge it, nor gain any knowledge of it? Mr. Mairson resolution theorem proving, and circuit and Usually offered every second year. Last query complexity. Intuitionistic logic: offered in the fall of 2002. Curry-Howard isomorphism, normalization, Mr. Cohn (200 and above) Primarily for Kripke models, and double-negation Graduate Students embeddings. Higher-order logic: Godel’s COSI 175a Data Compression and “dialectica” theorem, program synthesis, Multimedia Processing and decision problems. Usually offered [ sn ] COSI 200a and b Readings every second year. Last offered in the fall of Prerequisites: COSI 21a, 29a, 30a, and 31a. Specific sections for individual faculty 2002. Selected topics in data compression and members as requested. Mr. Mairson image and video processing, including Staff adaptive lossless compression, lossy image COSI 300a and b Master’s Project and video compression, transformations on COSI 210a Independent Study Offered every year. image and video, multimedia retrieval Signature of the instructor required. Staff problems, parallel algorithms. Usually Usually offered every year. offered every second year. Last offered in Staff COSI 310a Seminar in Artificial the fall of 2002. Intelligence Mr. Storer COSI 215a Advanced Topics in Artificial Usually offered every second year. Intelligence Staff COSI 178a Computational Molecular Topics vary from year to year. The course Biology may be repeated with the approval of the COSI 310b Seminar in Artificial [ sn ] instructor. Usually offered every second Intelligence Prerequisites: COSI 11 and COSI 30a. COSI year. Last offered in the fall of 2001. Usually offered every second year. 30a must be taken before or concurrently Staff Staff with this course. An overview of basic concepts in molecular COSI 216a Topics in Natural Language COSI 315b Current Topics in Learning and biology, algorithmic coverage of pattern Processing Neural Nets matching, strings, graphs, fragment Prerequisite: COSI 35a Usually offered every second year. assembly of DNA, physical mapping of Reviews recent trends in computational Staff DNA, phylogenetic tree reconstruction, approaches to linguistics, semantics, detection of introns and exons, formal knowledge representation for language, and COSI 340a Seminar in Programming language view of DNA, and biological issues in parsing and inferences. Usually Languages computers. Usually offered every third year. offered every fourth year. Last offered in the Usually offered every second year. Last offered in the fall of 2000. fall of 1999. Staff Mr. Cohen Mr. Pustejovksy COSI 390a Seminar in Theory of COSI 180a Algorithms COSI 217a Topics in Adaptive Systems Computation [ sn ] Prerequisite: COSI 35a. Usually offered every second year. Prerequisites: COSI 21a,b, and 29a. This In nature, systems with greater complexity Staff course may not be repeated for credit by than any designed by humans arise without students who have taken COSI 30b in a designer. The central question explored is: COSI 400d Dissertation Research previous years. How can complex modular organization Specific sections for individual faculty Basic concepts in the theory of algorithm arise without an intelligent designer? Class members as requested. design and analysis, including advanced reads about theories of organization in Staff data structures and algorithms, parallel different settings and scales (cells, brains, algorithms, and specialized topics. Usually minds, behavior, society, economies), and offered every second year. Last offered in study papers, models, and algorithms from a the fall of 2001. variety of fields that might shed light on Mr. Cohn the issue. Usually offered every third year. Last offered in the spring of 2000. Mr. Pollack 126 East Asian Studies

Cross-Listed Courses MATH 30a NBIO 136b Introduction to Algebra Computational Neuroscience

BCHM 170b MATH 30b NPSY 137b Bioinformatics Introduction to Algebra Cognitive Modeling

BCHM 171b MATH 36a PHYS 29a Protein X-Ray Crystallography Probability Electronics Laboratory I

CHEM 111a MATH 38b PHYS 29b Computational Chemistry Number Theory Electronics Laboratory II

LING 130a MATH 39a PHYS 32b Semantics: The Structure of Concepts Introduction to Combinatorics Microprocessor Laboratory

An interdepartmental program Courses of Study: Minor East Asian Studies Major (B.A.)

Objectives How to Become a Major or a Minor

East Asian studies is an interdisciplinary program that seeks to To enroll in the program, either as a major or a minor, students must give the student broad yet intimate knowledge of East Asian see the program chair. Together they will select as an advisor a civilization. It can be taken either as a major or a minor. At the faculty member who seems best suited to that student’s interest and crux of the program is the language requirement of an East Asian area of future work. language, providing the basis for postgraduate study or careers dealing with East Asia.

Committee Richard Lyman Isabel Seliger (History) (Romance and Comparative Literature)

Chair Ellen Schattschneider Mireya Solis TBA (Anthropology) (Politics)

Qun Ao John Schrecker Ralph Thaxton (German, Russian, and East Asian (History) (Politics) Languages and Literature) Hiroko Sekino Aida-Yuen Wong Donald Hindley (German, Russian, and East Asian (Fine Arts) (Politics) Languages and Literature)

Gary Jefferson (Economics)

Requirements for the Major C. The EAS core course, HIST 80a (Introduction to East Asian Civilization).

A. Satisfactory completion of at least 10 semester courses from D. From the EAS or cross-listed offerings: among the EAS and cross-listed offerings. No course with a grade below C- can count towards the major requirement of 10 courses. At least one course in the social sciences (in addition to HIST 80a) It is expected that at least five of the courses used to fulfill the and at least one course in the humanities or creative arts. major will be taken in residence at Brandeis. An additional course in either the social sciences (other than HIST B. Completion of the 40 level or its equivalent in Chinese or 80a) or in the humanities or creative arts. Japanese. Students who can demonstrate this level of competence in another East Asian language may use it to fulfill the E. Candidates for honors are required to register for EAS 99d or for a requirement. Note that in a student’s first East Asian language, 99d in an appropriate department and to prepare an honors thesis on a no course below the 40 level may count toward the 10 required topic relating to East Asia. If completed successfully, the 99d (a year- courses for the major. However, if a student has achieved the 40 long two-semester course) can be counted as two of the 10 courses of level in one language, courses in additional East Asian languages the major. at or above the 20 level may count toward the 10. For further information on these language requirements, see the undergraduate advising head. East Asian Studies 127

Requirements for the Minor B. The EAS core course, HIST 80a (Introduction to East Asian Civilization).

A. Completion of the 40 level or its equivalent in Chinese or C. At least three additional courses from the EAS or cross-listed Japanese. Students who can demonstrate this level of competence offerings. These three courses must be in at least two different in another East Asian language may use it to fulfill the departments. requirement. For further information on these language requirements, see the undergraduate advising head.

Courses of Instruction CHIN 20b FA 12a Continuing Chinese History of Asian Art

(1-99) Primarily for Undergraduate CHIN 30a FA 13b Students Intermediate Chinese Buddhist Art CHIN 40b FA 15b EAS 98a Independent Study Advanced Intermediate Chinese Arts of the Ming Dynasty Signature of the instructor required. Usually offered every year. JAPN 10a FA 181b Staff Beginning Japanese The Art of Japan

EAS 98b Independent Study JAPN 20b FA 182a Signature of the instructor required. Continuing Japanese The Art of China Usually offered every year. Staff JAPN 30a FA 184a Intermediate Japanese Studies in Asian Art EAS 99d Senior Research Signature of the instructor required. JAPN 40b HIST 80b Seniors who are candidates for degrees with Advanced Intermediate Japanese East Asia: Nineteenth Century to the honors in East Asian studies must register Present (China and Japan) for this course and, under the direction of a HIST 80a faculty member, prepare an honors thesis Introduction to East Asian Civilization HIST 176a on a suitable topic. Usually offered every The Emergence of Modern Japan year. Elective Courses HIST 180b Staff The following courses are approved for the HIST 180b program. Not all are given in any one year. Topics in Modern Chinese History Please consult the Course Schedule each HIST 181a (100-199) For Both Undergraduate semester. HIST 181a and Graduate Students Seminar on Traditional Chinese Thought CHIN 98a JAPN 98a and b Readings in Modern Chinese JAPN 98a and b EAS 175a Masterpieces of Chinese Readings in Japanese Literature CHIN 98b JAPN 105a (formerly COML 175a) Readings in Modern Chinese JAPN 105a [ hum ] Advanced Conversation and Composition I This course may not be repeated for credit CHIN 105a PHIL 119b by students who have taken COML 175a in Advanced Conversation and Composition I PHIL 119b previous years. Chinese Philosophy Surveys Chinese literature from the COML 125a POL 133a classical era through the 18th century. Introduction to East Asian Literature POL 133a Readings are in English translation and Japanese Political Economy include a wide range of genres, with COML 150b POL 147a particular emphasis on the great Chinese Japanese Women Writers POL 147a novels. Usually offered every third year. The Government and Politics of China Last offered in the fall of 2000. EAS 175a POL 148a Staff Masterpieces of Chinese Fiction POL 148a Seminar: Contemporary Chinese Politics ECON 165a Core Courses POL 150a The Economy of China POL 150a Politics of Southeast Asia CHIN 10a Beginning Chinese ECON 175a Introduction to the Economics of Development