Intended for one or two term introductory courses in discrete mathematics, this book offers an introduction through an algorithmic approach that focuses on problem-solving techniques. It stresses the importance of reading and doing proofs, and presents a discussion of algorithms, recursive algorithms, and the analysis of algorithms.
"synopsis" may belong to another edition of this title.
Richard Johnsonbaugh has a Ph.D. from the University of Oregon. He is professor of Computer Science and Information Systems, at DePaul University. He has 25 years of experience in teaching and research, including programming in general and in the C language. Dr. Johnsonbaugh specializes in programming languages, compilers, data structures, and pattern recognition. He is the author of two very successful books on Discrete Mathematics.
"About this title" may belong to another edition of this title.
Book Description Macmillan USA, 1984. Hardcover. Book Condition: New. book. Bookseller Inventory # 0023609001