The first edition of this book sold more than 100,000 copies-and this new edition will show you why! Schaum's Outline of Discrete Mathematics shows you step by step how to solve the kind of problems you're going to find on your exams. And this new edition features all the latest applications of discrete mathematics to computer science! This guide can be used as a supplement, to reinforce and strengthen the work you do with your class text. (It works well with virtually any discrete mathematics textbook.) But it is so comprehensive that it can even be used alone as a text in discrete mathematics or as independent study tool!
From the Back Cover
Master discrete mathematics and ace your exams with this easy-to-use guide that reinforces problem-solving skills and reduces your study time! Students of discrete mathematics love Schaum's----the first edition of this book was a major bestseller----and this edition will show you why!
Schaum's Outline of Discrete Mathematics lets you focus on the problems that are at the heart of the subject. It cuts your study time by eliminating the extraneous material that clutters up so many textbooks.
As you study at your own pace, this guide shows you step by step how to solve the kind of problems you're going to find on your exams. It gives you hundreds of completely worked problems with full solutions. Hundreds of additional problems let you test your skills, then check the answers. And this edition features all the latest applicatio Read more...
A revision of the market leader, Kreyszig is known for its comprehensive coverage, careful and correct mathematics, outstanding exercises, helpful worked examples, and self-contained subject-matter parts for maximum teaching flexibility. The new edition provides invitations - not requirements - to use technology, as well as new conceptual problems, and new projects that focus on writing and working in teams.
This is an absolutely great book. At over 1000 pages it's a real opus - covering everything from ordinary differential equations, linear algebra, vector calculus, fourier analysis, complex analysis and probability. It's exceptionally well written - with plenty of clear examples, diagrams and exercises - constantly cross referencing back to the particular idea or formula that an example is employing. It presupposes only elementary calculus - and so makes an excellent university textbook to accompany study, or as a self-study book to further your maths knowledge. Read more...
A revision of the market leader, Kreyszig is known for its comprehensive coverage, careful and correct mathematics, outstanding exercises, helpful worked examples, and self-contained subject-matter parts for maximum teaching flexibility. The new edition provides invitations - not requirements - to use technology, as well as new conceptual problems, and new projects that focus on writing and working in teams.
This is an absolutely great book. At over 1000 pages it's a real opus - covering everything from ordinary differential equations, linear algebra, vector calculus, fourier analysis, complex analysis and probability. It's exceptionally well written - with plenty of clear examples, diagrams and exercises - constantly cross referencing back to the particular idea or formula that an example is employing. It presupposes only elementary calculus - and so makes an excellent university textbook to accompany study, or as a self-study book to further your maths knowledge. Read more...
This book treats the Mathematics of many important areas in digital information processing.
It covers, in a unified presentation, five topics: Data Compression, Cryptography, Sampling (Signal Theory), Error Control Codes, Data Reduction. The thematic choices are practice-oriented. So, the important final part of the book deals with the Discrete Cosine Transform and the Discrete Wavelet Transform, acting in image compression. The presentation is dense, the examples and numerous exercises are concrete. The pedagogic architecture follows increasing mathematical complexity. A read-and-learn book on Concrete Mathematics, for teachers, students and practitioners in Electronic Engineering, Computer Science and Mathematics.
Contents
1 Data Compaction
1.1 Entropy Coding
1.1.1 Discrete Sources and Their Entropy
1.1.2 Towards Huffman Coding
1.1.3 Arithmetic Coding
1.2 Universal Codes: The Example LZW
1.2.1 LZW Coding
1.2.2 The LZW Decoder
2 Cryptography
2.1 The Data Encryption Standard
2.1.1 The DES Scheme
2.1.2 The Cipher DES in Detail
2.2 The Advanced Encryption Standard: The Cipher Rijndael
2.2.1 Some Elementary Arithmetic
2.2.2 Specification of Rijndael
2.2.3 The Key Schedule
2.2.4 Decryption with Rijndael
2.3 The Public Key Paradigm and the Cryptosystem RSA
2.3.1 Encryption and Decryption via Exponentiation
2.3.2 The Cryptosystem RSA
2.4 Digital Signatures
2.4.1 Message Digests via SHA-1
2.4.2 DSA: Digital Signature Algorithm
2.4.3 Auxiliary Algori Read more...
This text is designed for the sophomore/junior level introduction to discrete mathematics taken by students preparing for future coursework in areas such as math, computer science and engineering. Rosen has become a bestseller largely due to how effectively it addresses the main portion of the discrete market, which is typically characterized as the mid to upper level in rigor. The strength of Rosen's approach has been the effective balance of theory with relevant applications, as well as the overall comprehensive nature of the topic coverage.
Reviews:
Summary: Great buy
Rating: 5
Purchased for computer science course since it was required. Great price, good book.
Summary: A good book
Rating: 5
I like this book and use it for teaching my students. As a teacher, you have the opportunity to select similar problems for class activity and homework assignment. Also, you can find not only simple and middle-level problems but also high-level problems to provide a good source for active students. Unfortunately, the author uses the letters "F" and "T" in the truth tables instead of much easier and perspective "0" and "1", which correspond to the real needs, e.g., in computer science. That's the most essential lack, which I've found by this time.
Summary: This book is interesting
Rating: 4
I like the exclamations and the concepts/problem solving this book teaches. Maybe I am being swayed by the subject because I enjoy it, however, in comparison to other math boo Read more...
This text is designed for the sophomore/junior level introduction to discrete mathematics taken by students preparing for future coursework in areas such as math, computer science and engineering. Rosen has become a bestseller largely due to how effectively it addresses the main portion of the discrete market, which is typically characterized as the mid to upper level in rigor. The strength of Rosen's approach has been the effective balance of theory with relevant applications, as well as the overall comprehensive nature of the topic coverage.
Reviews:
Summary: Great buy
Rating: 5
Purchased for computer science course since it was required. Great price, good book.
Summary: A good book
Rating: 5
I like this book and use it for teaching my students. As a teacher, you have the opportunity to select similar problems for class activity and homework assignment. Also, you can find not only simple and middle-level problems but also high-level problems to provide a good source for active students. Unfortunately, the author uses the letters "F" and "T" in the truth tables instead of much easier and perspective "0" and "1", which correspond to the real needs, e.g., in computer science. That's the most essential lack, which I've found by this time.
Summary: This book is interesting
Rating: 4
I like the exclamations and the concepts/problem solving this book teaches. Maybe I am being swayed by the subject because I enjoy it, however, in comparison to other math boo Read more...
 30.09.2007 0_00_00.jpg)
Draft of "Mathematics of the Discrete Fourier Transform (DFT)," by J.O. Smith, CCRMA, Stanford, Winter 2002. The latest draft as linked HTML version are available on-line at http://www-ccrma.stanford.edu/~jos/mdft/.
Book Excerpts:
The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier Transform. However, the DFT has its own exact Fourier theory, which is the main focus of this book. The DFT is normally encountered in practice as the Fast Fourier Transform (FFT) -- a high-speed algorithm for computing the DFT. The FFT is used extensively in a wide range of digital signal processing applications, including spectrum analysis, high-speed convolution (linear filtering), filter banks, signal detection and estimation, system identification, audio compression (e.g., MPEG-II AAC), spectral modeling sound synthesis, and many other applications; some of these will be discussed in Chapter 8.
This book chooses to discuss DFT over the FT since the FT demands readers to use calculus right off the bat, while the DFT, on the other hand, replaces the infinite integral with a finite sum of various quantities. Calculus is not needed to define the DFT (or its inverse, as this book will show), and with finite summation limits, readers cannot encounter difficulties with infinities. Moreover, in the field of digital signal processing, signals and spectra are processed only in sampled form, so that the DFT is what readers really need anyway. In s Read more...
