In oder to supplying the better references to students, lecturers and researchers; FPT Library and Information Center delighted to inform you about the subject guide for this subject: Discrete Mathematics.

*Main books *

**Discrete mathematics and its applications **

Call number: 511 R813

Author: Kenneth H. Rosen.

6th ed. – Boston, Mass. ; London : McGraw-Hill, 2007. – xxii, 843 p., [140] p. : ill. ; 26 cm

ISBN: 0071244743, 9780071244749

Library code: FSE

Discrete Mathematics and its Applications, Sixth Edition”, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide variety of real-world applications…from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields.

**Data structures and algorithms in Java**

Author: Adam Drozdek

Cambridge, Mass. : Course Technology, 2004

ISBN: 0534492525

Library code: FSE

Using Java, author Adam Drozdek highlights three important aspects of data structures and algorithms. First, the book places special emphasis on the connection between data structures and their algorithms, including an analysis of the algorithms’ complexity. Second, the book presents data structures in the context of object-oriented program design, stressing the principle of information hiding in its treatment of encapsulation and decomposition. Finally, the book closely examines data structure implementation. Overall, this practical and theoretical book prepares students with a solid foundation in data structures for future courses and work in design implementation, testing, or maintenance of virtually any software system.

** **

**Toán học rời rạc ứng dụng trong Tin học = Discrete Mathematics and Its Applications**

Author: Kenneth H.Rosen; Phạm Văn Thiều, Đặng Hữu Thịnh dịch.

H.: Giáo dục, 2007. – 858tr.; 29cm

Library code: FSE

*Reference books *

**Combinatorics and Graph Theory **

Author: John M. Harris, Jeffry L. Hirst, Micheal J. Mossinghoff.

Springer. – 225tr(. – )

Library code: FSE (10 photos)

This book covers a wide variety of topics in combinatorics and graph theory. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. In addition, recent results appear in the text, illustrating the fact that mathematics is a living discipline. The second edition includes many new topics and features: (1) New sections in graph theory on distance, Eulerian trails, and hamiltonian paths. (2) New material on partitions, multinomial coefficients, and the pigeonhole principle. (3) Expanded coverage of Pólya Theory to include de Bruijn?s method for counting arrangements when a second symmetry group acts on the set of allowed colors. (4) Topics in combinatorial geometry, including Erdos and Szekeres? development of Ramsey Theory in a problem about convex polygons determined by sets of points. (5) Expanded coverage of stable marriage problems, and new sections on marriage problems for infinite sets, both countable and uncountable. (6) Numerous new exercises throughout the book. About the First Edition: ?. . . this is what a textbook should be! The book is comprehensive without being overwhelming, the proofs are elegant, clear and short, and the examples are well picked.? ? Ioana Mihaila, MAA Reviews.

**Data structures and Algorithms in Java **

Author: Michael T. Goodrich

New York : John Wiley & Son, 2001

ISBN: 0471383678, 9780471383673

Library code: FAT1 (5).

Using the power of technology to go beyond the borders of the printed page, Goodrich and Tamassia have created a book that is conceptually elegant and innovative. It incorporates the object-oriented design paradigm, using Java as the implementation language while also providing the fundamental intuition and analysis of each data structure studied.

**Discrete Mathematics and Its Applications : Student’s Solutions Guide to accompany **

Author: Kenneth H.Rosen

Boston, Mass. ; London : McGraw-Hill, 2007

ISBN: 0071244743

Library code: FSE (10+17 photos)

“Discrete Mathematics and its Applications”, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide variety of real-world applications…from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields.

** **

**Discrete mathematics for computer science**

Author: Gary Haggard, John Schlipf, Sue Whitesides Belmont

CA : Brooks/Cole – Thomson Learning, 2005, xxiii, 600 p. : ill. ; 25 cm. + 1 CD-ROM

ISBN: 053449501X, 9780534495015

Library code: FSE (1)

Master the fundamentals of discrete mathematics with DISCRETE MATHEMATICS FOR COMPUTER SCIENCE with Student Solutions Manual CD-ROM! An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language. Through a wealth of exercises and examples, you will learn how mastering discrete mathematics will help you develop important reasoning skills that will continue to be useful throughout your career.

**Elementary number theory & its applications **

Author: Kenneth H. Rosen.

6th ed. – Boston : Addison-Wesley, 2011. – xv, 752 p. : ill. ; 24 cm

ISBN: 0321500318, 9780321500311

Library code: FSE (01)

Call number: 512.7/2

Elementary Number Theory, Sixth Edition, blends classical theory with modern applications and is notable for its outstanding exercise sets. A full range of exercises, from basic to challenging, helps readers explore key concepts and push their understanding to new heights. Computational exercises and computer projects are also available. Reflecting many years of professors’ feedback, this edition offers new examples, exercises, and applications, while incorporating advancements and discoveries in number theory made in the past few years.

**Elements of Discrete Mathematics**

Author: C.L.Liu [kd].

McGraw – Hill Book Company

Library code: FSE (10 photos)

**Instructor’s Resource Guide to accompany = Discrete Mathematics and Its Applications**

Author: Kenneth H. Rosen, Jerrold Grossmanus

Mc Graw Hill Higher Education, 2007

ISBN: 0073107816, 9780073107813

Library code: FSE (01)

**Mathematics for Computer Scientists : Solutions to Selected Exercises from. Volume II, Number Theory, Modular Arithmetic amd Graph Theory**

Author: Rankin, S.A.

Fourth Edition. – 135tr. ; 29cm

Library code: FSE (10 photos)

**Mathematics for Computer Scientists. Volume II, Number Theory, Modular Arithmetic, and Graph Theory**.

Seventh Edition. – 233tr. ; 29cm

Library: FSE (10 photos)

**Mở đầu về lý thuyết xác suất**

Author: Đặng Hùng Thắng

Giáo Dục, 2008

Library code: FSE (1)

Call number: 519 T367

**Theory and problems of discrete mathematics**

Author: Seymour Lipschutz, Marc Lars Lipson

New York : McGraw-Hill, 2007, xi, 474 p. : ill. ; 27 cm

ISBN: 0071470387, 9780071470384

Library code: FSE (2)

Confusing Textbooks? Missed Lectures? Not Enough Time? Fortunately for you, there’s Schaum’s Outlines. More than 40 million students have trusted Schaum’s to help them succeed in the classroom and on exams. Schaum’s is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills. This Schaum’s Outline gives you Practice problems with full explanations that reinforce knowledge Coverage of the most up-to-date developments in your course field In-depth review of practices and applications Fully compatible with your classroom text, Schaum’s highlights all the important facts you need to know. Use Schaum’s to shorten your study time-and get your best test scores! Schaum’s Outlines-Problem Solved.

**Toán rời rạc**

Author: Nguyễn Đức Nghĩa, Nguyễn Tô Thành.

In lần thứ sáu. – H.: Đại học Quốc gia Hà Nội, 2003. – 290tr.; 27cm

Library code: FSE (22)

*Reference Ebooks *

How to log in Books24x7 databases:

http://fptlibrary.wordpress.com/d%E1%BB%8Bch-v%E1%BB%A5/books24x7-guide/

**Discrete Structures **

Author: Gupta, Satinder Bal

Laxmi Publications. © 2010. Books24x7.

<http://common.books24x7.com/toc.aspx?bookid=33251> (accessed September 7, 2011)

This edition of the book “Discrete Mathematics and Structures” is the outcome of author’s continuous discussions with his colleagues and students. Unlike other books, this book helps the readers to develop mathematical maturity and understand the basic concepts of Discrete Mathematics and Structures. Extensive in its coverage, each new concept is gently introduced and then reinforced by a lot of solved examples. Questions from various examinations have been incorporated to enable the students to understand the latest trends in paper-setting.

**Advanced Discrete Mathematics**

Author: Sharma, G.C., and Madhu Jain.

Laxmi Publications. © 2009. Books24x7.

<http://common.books24x7.com/toc.aspx?bookid=33253> (accessed September 7, 2011)

Advance discrete structure is a compulsory paper in most of computing programs (M.Tech, MCA, M.Sc, B.Tech, BCA, B.Sc etc.). This book has been written to fulfill the requirements of graduate and postgraduate students pursuing courses in mathematics as well as in computer engineering. This book covers the topics from Sets, Relations, Functions, Propositional logic, Techniques of proof, Lattice, Algebraic structures, Boolean algebra Combinatorics, Discrete numeric function, generating function and recurrence relation and Graph theory. In this book each chapter starts with a clear statement of pertinent definitions, principles and theorems with illustrative and descriptive material. A large number of solved examples help to illustrate and amplify the material and also include proof of the theorems.

**Discrete Structures, Logic, and Computability**

Hein, James L.

Second Edition; Jones and Bartlett Publishers. © 2002. Books24x7.

<http://common.books24x7.com/toc.aspx?bookid=3950> (accessed September 7, 2011)

Thoroughly Updated, The New Third Edition Of Discrete Structures, Logic, And Computability Introduces Beginning Computer Science And Computer Engineering Students To The Fundamental Techniques And Ideas Used By Computer Scientists Today, Focusing On Topics From The Fields Of Mathematics, Logic, And Computer Science Itself. Dr. Hein Provides Elementary Introductions To Those Ideas And Techniques That Are Necessary To Understand And Practice The Art And Science Of Computing. The Text Contains All The Topics For Discrete Structures In The Reports Of The IEEE/ACM Joint Task Force On Computing Curricula For Computer Science Programs And For Computer Engineering Programs.

**Data Compression: The Complete Reference**

Salomon, David, and et al.

Fourth Edition. Springer. © 2007. Books24x7.

<http://common.books24x7.com/toc.aspx?bookid=16217> (accessed September 8, 2011)

Data compression is one of the most important fields and tools in modern computing. From archiving data, to CD ROMs, and from coding theory to image analysis, many facets of modern computing rely upon data compression.

Data Compression provides a comprehensive reference for the many different types and methods of compression. Included are a detailed and helpful taxonomy, analysis of most common methods, and discussions on the use and comparative benefits of methods and description of “how to” use them. The presentation is organized into the main branches of the field of data compression: run length encoding, statistical methods, dictionary-based methods, image compression, audio compression, and video compression. Detailed descriptions and explanations of the most well-known and frequently used compression methods are covered in a self-contained fashion, with an accessible style and technical level for specialists and nonspecialists. Topics and features: coverage of video compression, including MPEG-1 and H.261; thorough coverage of wavelets methods, including CWT, DWT, EZW and the new Lifting Scheme technique; complete audio compression; QM coder used in JPEG and JBIG, including new JPEG 200 standard; image transformations and detailed coverage of discrete cosine transform and Haar transform; coverage of EIDAC method for compressing simple images; prefix image compression; ACB and FHM curve compression; geometric compression and edgebreaker technique.

Data Compression provides an invaluable reference and guide for all computer scientists, computer engineers, electrical engineers, signal/image processing engineers and other scientists needing a comprehensive compilation for abroad range of compression methods.