This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.

This groundbreaking work explores the powerful role of communities in mathematics. It introduces readers to twenty-six different mathematical communities and addresses important questions about how they form, how they thrive, and how they advance individuals and the group as a whole. The chapters celebrate how diversity and sameness bind colleagues together, showing how geography, gender, or graph theory can create spaces for colleagues to establish connections in the discipline. They celebrate outcomes measured by mathematical results and by increased interest in studying mathematics. They highlight the value of relationships with peers and colleagues at various stages of their careers. Together, these stories offer a guide—rather than a template—for building and sustaining a mathematical community. They call attention to critical strategies of rotating leadership and regular assessment and evaluation of goals and programs, and promote an ongoing awareness of the responsibilities of life that impinge on mathematical creativity and contributions. Whether you are giving thought to starting a group, joining one already in existence, or encouraging a colleague to participate in the broader mathematical community, this book will meet you where you are—and move you beyond. It contains a plethora of ideas to foster a sense of belonging in the exciting discipline of mathematics.

Popular among university applicants and their advisers alike, these guides presents a wide range of information on a specific degree discipline, laid out in tabular format enabling at-a-glance course comparison.

Stein/Drysdale/Bogart's Discrete Mathematics for Computer Scientists is ideal for computer science students taking the discrete math course. Written specifically for computer science students, this unique textbook directly addresses their needs by providing a foundation in discrete math while using motivating, relevant CS applications. This text takes an active-learning approach where activities are presented as exercises and the material is then fleshed out through explanations and extensions of the exercises.

Biological sciences have been revolutionized, not only in the way research is conductedâ€"with the introduction of techniques such as recombinant DNA and digital technologyâ€"but also in how research findings are communicated among professionals and to the public. Yet, the undergraduate programs that train biology researchers remain much the same as they were before these fundamental changes came on the scene. This new volume provides a blueprint for bringing undergraduate biology education up to the speed of today's research fast track. It includes recommendations for teaching the next generation of life science investigators, through: Building a strong interdisciplinary curriculum that includes physical science, information technology, and mathematics. Eliminating the administrative and financial barriers to cross-departmental collaboration. Evaluating the impact of medical college admissions testing on undergraduate biology education. Creating early opportunities for independent research. Designing meaningful laboratory experiences into the curriculum. The committee presents a dozen brief case studies of exemplary programs at leading institutions and lists many resources for biology educators. This volume will be important to biology faculty, administrators, practitioners, professional societies, research and education funders, and the biotechnology industry.

This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions. Features: no university-level background in mathematics required; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner; contains examples and exercises throughout the text, and highlights the most important concepts in each section; selects examples that demonstrate a practical use for the concept in question.