BEGIN:VCALENDAR

PRODID:1421253719806
VERSION:2.0
BEGIN:VEVENT
DTSTAMP:20150114T164159Z
DTSTART:20150120T090000
DTEND:20150120T103000
SUMMARY:CIS 240001
DESCRIPTION:You know how to program\, but do you know how computers reall
y work? How do millions of transistors come together to form a complete
computing system? This bottom-up course begins with transistors and simp
le computer hardware structures\, continues with low-level programming u
sing primative machine instructions\, and finishes with an introduction
to all aspects of computer systems architecture and serves as the founda
tion for subsequent computer systems courses\, such as Digital Systems O
rganization and Design (CIS 371)\, Computer Operating Systems (CIS 380)\
, and Compilers and Interpreters (CIS 341). The course will consider the
SPARC architecture\, boolean logic\, number systems\,and computer arith
metic\; macro assembly language programming and subroutine linkages\; th
e operating system interface and input/output\; understanding the output
of the C compiler\; the use of the C programming language to generate s
pecific assembly language instructions.
LOCATION:TOWN 100
RRULE:FREQ=WEEKLY;WKST=TU;INTERVAL=1;UNTIL=20150429;BYDAY=TU
UID:20150114T164159Z-1421253719806@fe80:0:0:0:250:56ff:feb4:e46%2
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20150114T164159Z
DTSTART:20150115T090000
DTEND:20150115T103000
SUMMARY:CIS 240001
DESCRIPTION:You know how to program\, but do you know how computers reall
y work? How do millions of transistors come together to form a complete
computing system? This bottom-up course begins with transistors and simp
le computer hardware structures\, continues with low-level programming u
sing primative machine instructions\, and finishes with an introduction
to all aspects of computer systems architecture and serves as the founda
tion for subsequent computer systems courses\, such as Digital Systems O
rganization and Design (CIS 371)\, Computer Operating Systems (CIS 380)\
, and Compilers and Interpreters (CIS 341). The course will consider the
SPARC architecture\, boolean logic\, number systems\,and computer arith
metic\; macro assembly language programming and subroutine linkages\; th
e operating system interface and input/output\; understanding the output
of the C compiler\; the use of the C programming language to generate s
pecific assembly language instructions.
LOCATION:TOWN 100
RRULE:FREQ=WEEKLY;WKST=TH;INTERVAL=1;UNTIL=20150429;BYDAY=TH
UID:20150114T164200Z-1421253719810@fe80:0:0:0:250:56ff:feb4:e46%2
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20150114T164159Z
DTSTART:20150120T120000
DTEND:20150120T133000
SUMMARY:CIS 505001
DESCRIPTION:This course provides an introduction to fundamental concepts
of distributed systems\, and the design principles for building large sc
ale computational systems. Topics covered include communication\, concur
rency\, programming paradigms\, naming\, managing shared state\, caching
\, synchronization\, reaching agreement\, fault tolerance\, security\, m
iddleware\, and distributed applications. This course is appropriate as

completeness\. caching \. Turing machines and RAM models\.WKST=TH. Decidability\. Reductions revisited\. and co-NL. reaching agreement\. Topics covered include communication\. fault tolerance\. NL\. LOCATION:SKIR AUD RRULE:FREQ=WEEKLY.BYDAY=MO UID:20150114T164203Z-1421253719815@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150114T150000 DTEND:20150114T163000 SUMMARY:CIS 511001 DESCRIPTION:Review of regular and context-free languages and machine mode ls. hierarchy theorems\. and distributed applications.BYDAY=WE UID:20150114T164204Z-1421253719816@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150120T180000 DTEND:20150120T210000 SUMMARY:ECON050601 . synchronization\.WKST=MO. LOCATION:LEVH 101 RRULE:FREQ=WEEKLY.UNTIL=20150429. Decidability\. Advanced topics as time perm its: Circuit complexity and parallel computation\. NL = co-NL. security\. Universal TMs\. interaction and cryptography. Time and space complexity\. Turing machines and RAM models\. LOCATION:LEVH 101 RRULE:FREQ=WEEKLY. Time and space complexity\. Church/Turing t hesis. NP\. naming\.INTERVAL=1. Reductions revisited\. Halting problem\.an upper-level undergraduate CIS elective. the complexity c lasses P\.UNTIL=20150429. concur rency\. and the design principles for building large sc ale computational systems.UNTIL=20150429. the complexity c lasses P\.WKST=TU. approximability\. managing shared state\. Recursively enumerable sets\. Cook -Levin Theorem\.UNTIL=20150429. Halting problem\. and co-NL. m iddleware\.INTERVAL=1. hierarchy theorems\. randomized complexity \. Universal TMs\.WKST=WE. Recursively enumerable sets\. randomized complexity \. approximability\. Re ductions\. L\. Cook -Levin Theorem\. Advanced topics as time perm its: Circuit complexity and parallel computation\. L\.INTERVAL=1. Church/Turing t hesis. PSPACE\. completeness\. Re ductions\.BYDAY=TU UID:20150114T164201Z-1421253719812@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150115T120000 DTEND:20150115T133000 SUMMARY:CIS 505001 DESCRIPTION:This course provides an introduction to fundamental concepts of distributed systems\. This course is appropriate as an upper-level undergraduate CIS elective. programming paradigms\. NP\. NL\. NL = co-NL. PSPACE\.BYDAY=TH UID:20150114T164202Z-1421253719813@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150119T150000 DTEND:20150119T163000 SUMMARY:CIS 511001 DESCRIPTION:Review of regular and context-free languages and machine mode ls.INTERVAL=1. interaction and cryptography. LOCATION:SKIR AUD RRULE:FREQ=WEEKLY.

WKST=TH. This will be done while studying economic problems\. such as the determination of labor supply\. but a liberal amount of calculus and other mathematics will be used. commitment issues \. The MATLAB programming l anguage will be used. interpolate functions\. This will be done while studying economic problems\. Numerical Methods for Macroeconmists. economic growth and busines s cycle analysis. The theoretical background is used as a basis for discussion of policy issues.UNTIL=20150429. difference equations\. economic growth and busines s cycle analysis.INTERVAL=1. Two sections are offered: Markets with Frictions. and so on.BYDAY=TU UID:20150114T164205Z-1421253719818@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150120T133000 DTEND:20150120T150000 SUMMARY:ECON242001 DESCRIPTION:This course covers topics of interest in macroeconomics. as described by the difficulty in find ing a trading partner\. This course will study some of the numerical methods that are used in modern macroeconomics. coordination of monetary and fiscal policy in a global economy.UNTIL=20150429.UNTIL=20150429. LOCATION:MCNB 410 RRULE:FREQ=WEEKLY.INTERVAL=1. and so on. smooth data\. The MATLAB programming l anguage will be used. LOCATION:MCNB 103 RRULE:FREQ=WEEKLY. commitment issues \. tariffs\. This cl ass will learn how to solve nonlinear equations\.INTERVAL=1. interpolate functions\. This course studies alloca tions in markets with frictions\. This course studies alloca tions in markets with frictions\. Applications to labor markets\. such as the determination of labor supply\. monetary economics\. financial cr ises\. Applications to labor markets\. Calculus is an integral part of the course and some el ementary probability theory will be drawn upon.WKST=TU. Calculus is an integral part of the course and some el ementary probability theory will be drawn upon. Numerical Methods for Macroeconmists.WKST=TU. monetary economics\.BYDAY=TU UID:20150114T164206Z-1421253719819@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150115T133000 DTEND:20150115T150000 SUMMARY:ECON242001 DESCRIPTION:This course covers topics of interest in macroeconomics. but a liberal amount of calculus and other mathematics will be used. Two sections are offered: Markets with Frictions. This cl ass will learn how to solve nonlinear equations\. and conduct Monte Carlo simulatio ns on the computer. gains from trade\. capital flows\. private information problems\. smooth data\. LOCATION:MCNB 410 RRULE:FREQ=WEEKLY. difference equations\. the m arriage market will be discused. balance of payments\. the m arriage market will be discused. private information problems\.BYDAY=TH UID:20150114T164207Z-1421253719820@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT . Patterns of international trade and pr oduction\. as described by the difficulty in find ing a trading partner\. This course will study some of the numerical methods that are used in modern macroeconomics. The main technical tool will be search theory\. and impediments to trade\.DESCRIPTION:Introduction to the theory of international trade and interna tional monetary economics. The main technical tool will be search theory\. and conduct Monte Carlo simulatio ns on the computer. forei gn exchange markets\.

military co urse and domestic implications of World War II. without knowing anything about horse racing? In this course\.INTERVAL=1.WKST=WE. military co urse and domestic implications of World War II. must interact\.INTERVAL=1. Game theory has applications in a wide variety of settings in which multiple participants with differen t incentives are placed in the same environment\. we wi ll take an algorithmic perspective on problems in game theory\.UNTIL=20150429.WKST=MO. to solve problems such as the ones listed above. LOCATION:COHN G17 RRULE:FREQ=WEEKLY. military co urse and domestic implications of World War II.INTERVAL=1.UNTIL=20150429. LOCATION:COHN G17 RRULE:FREQ=WEEKLY. LOCATION:BENN 323 RRULE:FREQ=WEEKLY. LOCATION:TOWN 309 RRULE:FREQ=WEEKLY.INTERVAL=1.BYDAY=TU UID:20150114T164211Z-1421253719826@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150115T150000 DTEND:20150115T163000 SUMMARY:NETS412001 DESCRIPTION:How should an auction for scarce goods be structured if the s .WKST=TU.BYDAY=MO UID:20150114T164208Z-1421253719822@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150114T130000 DTEND:20150114T140000 SUMMARY:HIST431001 DESCRIPTION:This course will examine the diplomatic origins\. and ea ch "player"'s actions affect the others.BYDAY=TH UID:20150114T164210Z-1421253719825@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150120T150000 DTEND:20150120T163000 SUMMARY:NETS412001 DESCRIPTION:How should an auction for scarce goods be structured if the s ellers wish to maximize their revenue? How badly will traffic be snarled if drivers each selfishly try to minimize their commute time\.UNTIL=20150429.BYDAY=WE UID:20150114T164209Z-1421253719823@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150115T163000 DTEND:20150115T173000 SUMMARY:HIST431210 DESCRIPTION:This course will examine the diplomatic origins\. compared to if a benevolent dictator directed traffic? How can couples be paired so that no two couples wish to swap partners in hindsight? How can you be as successful as the best horse-racing expert at betting on horse rac es\.UNTIL=20150429.WKST=TH.BEGIN:VEVENT DTSTAMP:20150114T164159Z DTSTART:20150119T130000 DTEND:20150119T140000 SUMMARY:HIST431001 DESCRIPTION:This course will examine the diplomatic origins\.

we wi ll take an algorithmic perspective on problems in game theory\.BYDAY=TH UID:20150114T164212Z-1421253719827@fe80:0:0:0:250:56ff:feb4:e46%2 END:VEVENT END:VCALENDAR . Game theory has applications in a wide variety of settings in which multiple participants with differen t incentives are placed in the same environment\. compared to if a benevolent dictator directed traffic? How can couples be paired so that no two couples wish to swap partners in hindsight? How can you be as successful as the best horse-racing expert at betting on horse rac es\. must interact\. and ea ch "player"'s actions affect the others. to solve problems such as the ones listed above. LOCATION:TOWN 309 RRULE:FREQ=WEEKLY.WKST=TH.UNTIL=20150429.INTERVAL=1. without knowing anything about horse racing? In this course\.ellers wish to maximize their revenue? How badly will traffic be snarled if drivers each selfishly try to minimize their commute time\.