Adrian Guin’s Profile Student Toggle navigation

This laboratory course is a co-requisite for General Chemistry – 1110. One three hour laboratory meeting per week and a total of 15 meetings per semester.

This laboratory course is a co-requisite for General Chemistry – 1110. One three hour laboratory meeting per week and a total of 15 meetings per semester.

This course is designed to prepare students for the study of Calculus. Topics include an in-depth study of functions such as polynomial functions, inverse functions, radical functions, rational functions, trigonometric functions, exponential and logarithmic functions; solving inequalities; elements of vectors and complex numbers; solving trigonometric equations and identities involving sum, double and half-angle formulas; Binomial Theorem; and progressions. A graphing calculator is required.

This course is designed to prepare students for the study of Calculus. Topics include an in-depth study of functions such as polynomial functions, inverse functions, radical functions, rational functions, trigonometric functions, exponential and logarithmic functions; solving inequalities; elements of vectors and complex numbers; solving trigonometric equations and identities involving sum, double and half-angle formulas; Binomial Theorem; and progressions. A graphing calculator is required.

This introductory course aims to engage and help you develop your creative voice through discussions of craft and technique, readings aimed to build critical reading and workshopping skills, writing exercises, and discussion of language and style.

This introductory course aims to engage and help you develop your creative voice through discussions of craft and technique, readings aimed to build critical reading and workshopping skills, writing exercises, and discussion of language and style.

This course introduces the foundations of discrete mathematics as they apply to computer science, focusing on providing a solid theoretical foundation for further work. Topics include functions, relations, sets, simple proof techniques, Boolean algebra, propositional logic, elementary number theory, writing, analyzing and testing algorithms.

This course introduces the foundations of discrete mathematics as they apply to computer science, focusing on providing a solid theoretical foundation for further work. Topics include functions, relations, sets, simple proof techniques, Boolean algebra, propositional logic, elementary number theory, writing, analyzing and testing algorithms.