For a one- or two-term introductory course in discrete mathematics.
This best-selling book provides an accessible introduction to discrete mathematics, using an algorithmic approach that focuses on problem-solving techniques. The new edition weaves techniques of proofs into the text as a running theme. Each chapter has a special section dedicated to showing students how to attack and solve problems.
"synopsis" may belong to another edition of this title.
Richard Johnsonbaugh is Professor Emeritus of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago. Prior to his 20-year service at DePaul University, he was a member and sometime chair of the mathematics departments at Morehouse College and Chicago State University. He has a B.A. degree in mathematics from Yale University, M.A. and Ph.D. degrees in mathematics from the University of Oregon, and an M.S. degree in computer science from the University of Illinois, Chicago. His most recent research interests are in pattern recognition, programming languages, algorithms, and discrete mathematics. He is the author or co-author of numerous books and articles in these areas. Several of his books have been translated into various languages. He is a member of the Mathematical Association of America.
"About this title" may belong to another edition of this title.
Book Description PEARSON PROFESSIONAL EDUCATION. PAPERBACK. Book Condition: New. 0131277677 Brand new book. International Edition. Ship from multiple locations. 3-5 business days Express Delivery to USA/UK/Europe/Asia/Worldwide. Tracking number will be provided. Satisfaction guaranteed. Bookseller Inventory # SKU003695