Critical Race Theory
This course examines the discursive relationship between race and law in contemporary U.S. society. Readings examine the ways in which racial bodies are constituted in the cultural and political economy of American society. The main objective is to explore the rules and social practices that govern the relationship of race to gender, nationality, sexuality, and class in U.S. courts and other cultural institutions. Thinkers covered include W.E.B. DuBois, Kimberle Crenshaw, Derrick Bell, and Richard Delgado, among others.
Critical Race Theory
This course examines the discursive relationship between race, power and law in contemporary U.S. society. Readings examine the ways in which racial bodies are constituted in the cultural economy of American society where citizens of African descent dwell. We explore the rules and social practices that govern the relationship of race to gender, nationality, sexuality, and class in U.S. courts and other cultural institutions. Thinkers covered include W.E.B. DuBois, Kimberle Crenshaw, Derrick Bell, and Richard Delgado, among others.
Intro to Analysis
Completeness of the real numbers; topology of n-space including the Bolzano-Weierstrass and Heine-Borel theorems; sequences, properties of continuous functions on sets; infinite series, uniform convergence. The course may also study the Gamma function, Stirling’s formula, or Fourier series. Four class hours per week.
Fall 2020 sections of MATH 355 will be online-only, in which case the course’s full syllabus will be covered through a combination of synchronous meetings for each section and asynchronous lectures supported by an ample number of Zoom office hours.
Groups, Rings and Fields
A brief consideration of properties of sets, mappings, and the system of integers, followed by an introduction to the theory of groups and rings including the principal theorems on homomorphisms and the related quotient structures; integral domains, fields, polynomial rings. Four class hours per week.
Requisite: MATH 211 and either MATH 271 or 272, or consent of the instructor. Students with a grade of B+ or lower in linear algebra are encouraged to take another 200-level course with proofs before taking MATH 350.
Algorithms
This course addresses the design and analysis of computer algorithms. Topics include: set algorithms such as sorting and searching, graph algorithms, string algorithms, and matrix algorithms. Algorithm design paradigms, including the divide-and-conquer, dynamic programming, and greedy paradigms, will be emphasized. The course will end with a discussion of the theory of NP-completeness and its implications.
This course will be conducted online, with occasional in-person discussion as circumstances allow.
Requisite: COSC 112 and COSC 211. Fall semester. Professor Gardner.
Kael Miyata
Primary Title:
Senior Assistant Director
Institution:
UMASS Amherst
Department:
Enrollment Management
Email Address:
kmiyata@umass.edu
Telephone:
413-545-0801
Office Building:
Whitmore Admin Building