| Sumario: | Discrete mathematics remains at the heart of any contemporary study of computer science. Any understanding of how computers operate involves mathematics. Furthermore, many computing applications facilitate numerical and combinatorial computation. Our intention in writing this book is to offer concepts and methods of discrete mathematics in a precise and clear manner. We wish to give computer science students all the mathematical basics they need and to give mathematics students an insight into mathematical techniques and their importance for applications. The text will also help teachers to explain discrete mathematics in a more effective and appropriate manner. Teachers will find the style of presentation very useful as lecture material as it can provide the cues for a balanced amount of teacher-student dialogue. The book is intended for students of a one- or two-semester preliminary discrete mathematics course, including those pursuing basic mathematics, computer science, or engineering. The book is especially appropriate for BE (Computers/IT), BTech Computers/IT), MCA, MCM, MSc (Mathematics/Computer Science) students. The material in this book incorporates most of the recommendations of the Curriculum Committee on Computer Science/Engineering for the course in discrete mathematics. A discrete mathematics course has many objectives among which are that students should learn the essentials of mathematics and how to think mathematically. To accomplish these objectives, this book emphasizes mathematical reasoning and problem-solving techniques. There are no mathematical prerequisites beyond college algebra and no formal computer science prerequisite for almost all of this text. Each chapter begins at an easily understood and accessible level. Once basic mathematical concepts have been carefully developed, more complex material and applications are presented.
|
|---|
