Discrete Mathematics with Algorithms

✍ Scribed by M.O. Albertson, J.P. Hutchinson

Publisher: John Wiley and Sons Ltd
Year: 1988
Tongue: English
Leaves: 549
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving. All algorithms are presented in English, in a format compatible with the Pascal programming language. Contains many exercises, with answers at the back of the book (detailed solutions being supplied for difficult problems).

📜 SIMILAR VOLUMES

Discrete mathematics with algorithms

📁 Discrete mathematics with algorithms

✍ Michael O. Albertson, Joan P. Hutchinson 📂 Library 📅 1988 🏛 Wiley 🌐 English

Diskrete Mathematik (Discrete Mathematic

📁 Diskrete Mathematik (Discrete Mathematics)

✍ Ueli Maurer 📂 Library 📅 2020 🌐 English

Foundations of Discrete Mathematics with

📁 Foundations of Discrete Mathematics with Algorithms and Programming

✍ Sriraman Sridharan, R. Balakrishnan 📂 Library 📅 2019 🏛 CRC Press 🌐 English

Discrete Mathematics has permeated the whole of mathematics so much so it has now come to be taught even at the high school level. This book presents the basics of Discrete Mathematics and its applications to day-to-day problems in several areas. This book is intended for undergraduate students of C

Foundations of discrete mathematics with

📁 Foundations of discrete mathematics with algorithms and programming

✍ Balakrishnan, Rangaswami; Sridharan, Sriraman 📂 Library 📅 2019 🌐 English

Foundations of discrete mathematics with

📁 Foundations of discrete mathematics with algorithms and programming

✍ Balakrishnan, Rangaswami; Sridharan, Sriraman 📂 Library 📅 2019 🏛 CRC Press 🌐 English

Discrete algorithmic mathematics

📁 Discrete algorithmic mathematics

✍ Maurer S.B., Ralston A. 📂 Library 📅 1991 🏛 Addison Wesley 🌐 English

Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology.