Book by Dossey John A Otto Albert D Spence Lawrence E Vand
"Sinopsis" puede pertenecer a otra edición de este libro.
For one or two term introductory courses in discrete mathematics. This book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem-solving techniques with woven techniques of proofs into the text as a running theme. Each chapter has a problem-solving corner that shows students how to attack and solve problems. The topics are based upon the recommendations of various professional organizations, including those of the MAAs Panel on Discrete Mathematics in the First Two Years, the NCTMs Principles and Standards for School Mathematics, and the CBMSs recommendations for the mathematical education of teachers. Although designed for a one-semester course, the book contains more material then can be covered in either one semester or two quarters. Consequently, instructors will have freedom to choose topics tailored to the particular needs and interests of their students. The sequence of chapters allows considerable flexibility in teaching a course from this book. Although this book assumes only the familiarity with logic and proofs ordinarily gained in high-school geometry, Appendix A is provided for those who prefer a more formal treatment. If this appendix is covered, it may be taught at any time as an independent unit or in combination with Chapter 9. The exercise sets in this book have been designed for flexibility. Many straightforward computational and algorithmic exercises are included after each section. These exercises give students hands-on practice with the concepts and algorithms of discrete mathematics and are especially important for students whose mathematical backgrounds are weak. Other exercises extend the material in the text or introduce new concepts not treated there. At the end of each chapter, a set of supplementary exercises is provided. Historical comments have been also added and enhanced to put the material in context. These are included at the end of each chapter. Chapters 3 and 4 have been rewritten so as to give the breadth-first search algorithm a more prominent role. Many examples in these chapters have been rewritten to be more useful to instructors who do not wish to discuss the details of the formal presentations of the algorithms. Each chapter ends with a set of computer projects related to its content, algorithmic or otherwise. These are purposely stated in general terms, so as to be appropriate to students using various computing systems and languages.
"Sobre este título" puede pertenecer a otra edición de este libro.
Gastos de envío:
GRATIS
A Estados Unidos de America
Gastos de envío:
EUR 3,80
A Estados Unidos de America
Librería: SecondSale, Montgomery, IL, Estados Unidos de America
Condición: USED_GOOD. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Nº de ref. del artículo: 00067327523
Cantidad disponible: 1 disponibles
Librería: ZBK Books, Carlstadt, NJ, Estados Unidos de America
Condición: USED_FAIR. Used book - May contain writing, notes, highlighting, bends or folds. Text is readable, book is clean, and pages and cover mostly intact. May show normal wear and tear. Item may be missing CD. May include library marks. Fast Shipping. Nº de ref. del artículo: ZBM.1IBO4
Cantidad disponible: 1 disponibles
Librería: ThriftBooks-Atlanta, AUSTELL, GA, Estados Unidos de America
Hardcover. Condición: USED_ASNEW. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less 2.55. Nº de ref. del artículo: G0321079124I2N00
Cantidad disponible: 1 disponibles
Librería: ThriftBooks-Atlanta, AUSTELL, GA, Estados Unidos de America
Hardcover. Condición: USED_GOOD. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 2.55. Nº de ref. del artículo: G0321079124I3N00
Cantidad disponible: 1 disponibles
Librería: ThriftBooks-Atlanta, AUSTELL, GA, Estados Unidos de America
Hardcover. Condición: USED_VERYGOOD. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.55. Nº de ref. del artículo: G0321079124I4N00
Cantidad disponible: 1 disponibles
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
Hardcover. Condición: USED_VERYGOOD. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.55. Nº de ref. del artículo: G0321079124I4N00
Cantidad disponible: 1 disponibles
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Condición: USED_GOOD. 4th Edition. Used book that is in clean, average condition without any missing pages. Nº de ref. del artículo: 4836393-6
Cantidad disponible: 1 disponibles
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
hardcover. Condición: USED_GOOD. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!. Nº de ref. del artículo: S_388934061
Cantidad disponible: 1 disponibles
Librería: BooksRun, Philadelphia, PA, Estados Unidos de America
Hardcover. Condición: USED_GOOD. 4. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Nº de ref. del artículo: 0321079124-11-1
Cantidad disponible: 1 disponibles
Librería: 369 Bookstore _[~ 369 Pyramid Inc ~]_, Dover, DE, Estados Unidos de America
Hardcover. Condición: USED_GOOD. The strong algorithmic emphasis of Discrete Mathematics is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students.Algorithms are presented in English, eliminating the need for knowledge of a particular programming language. Computational and algorithmic exercise sets follow each chapter section and supplementary exercises and computer projects are included in the end-of-chapter material. This Fifth Edition features a new Chapter 3 covering matrix codes, error correcting codes, congruence, Euclidean algorithm and Diophantine equations, and the RSA algorithm.MARKET: Intended for use in a one-semester introductory course in discrete mathematics. Nº de ref. del artículo: AMPLE0321079124
Cantidad disponible: 1 disponibles