MaGE Training

This course is an introduction to theories and practices of collaborative learning for students in the Computer Science Megas and Gigas Educate (MaGE) peer mentoring program. We will draw on existing research, practice sessions, and class discussion to craft our philosophies of peer mentoring and to develop effective practical strategies.

Peer Mentoring

This course is an introduction to theories and practices of collaborative learning for students preparing to work as mentors in the Speaking, Arguing, and Writing Program (SAW). We will draw on existing research, practice sessions, class discussion, and our own writing and speaking to craft our philosophies of peer mentoring and to develop effective practical strategies.

Learning/Service/Social Action

Connecting community-based learning to social justice advocacy requires experience with asset-based community analysis, and skills for project planning, implementation, and assessment. Students will develop logic models for social change and participate in exercises and reflections that enhance their capacity to support organizational community partnership development. This course is designed to facilitate learning and impact for CBL Program student staff pursuing concurrent fellowships and mentorships. Students in C.A.U.S.E.

Writing, Revising, Comm.

This course is intended for students who are new to American academic writing or identify as non-native speakers of English. Students should also be enrolled in a writing-intensive course. Through discussion and analysis of their own writing and peer work, students evaluate the effectiveness of their written communication and writing process. A variety of strategies for strengthening written communication are applied to current writing projects.

Writing, Revising, Comm.

This course is intended for students who are new to American academic writing or identify as non-native speakers of English. Students should also be enrolled in a writing-intensive course. Through discussion and analysis of their own writing and peer work, students evaluate the effectiveness of their written communication and writing process. A variety of strategies for strengthening written communication are applied to current writing projects.

Speaking from Experience

Especially designed for seniors, this speaking-intensive two-credit course will help students reflect on, learn from, and speak about their unique Mount Holyoke experiences as they transition into their next steps after graduation. Using the same techniques that professional actors use to relax, focus their message and connect with their audience, students will improve their ability to communicate with confidence, express themselves authentically and inspire others.

Speaking from Experience

Especially designed for seniors, this speaking-intensive two-credit course will help students reflect on, learn from, and speak about their unique Mount Holyoke experiences as they transition into their next steps after graduation. Using the same techniques that professional actors use to relax, focus their message and connect with their audience, students will improve their ability to communicate with confidence, express themselves authentically and inspire others.

Engaging the Pioneer Valley

This course will equip students to enter communities effectively and responsibly as learners, researchers, volunteers, and citizens. Successful community-based learning depends on familiarity with communities and methods to study and assess conditions in them, and on familiarity with the history, politics, policies and practices of campus-community partnership. Students will analyze and interact with nonprofit and civic organizations, issues, and leaders to refine personal interests and skills for social justice advocacy.

Algorithms

How does Mapquest find the best route between two locations? How do computers help to decode the human genome? At the heart of these and other complex computer applications are nontrivial algorithms. While algorithms must be specialized to an application, there are some standard ways of approaching algorithmic problems that tend to be useful in many applications. Among other topics, we will explore graph algorithms, greedy algorithms, divide-and-conquer, dynamic programming, and network flow.
Subscribe to