|
||||||||||||||||||||
|
||||||||||||||||||||
|
||||||||||||||||||||
| ||||||||||||||||||
Produktinformation
Möchten Sie die Produktinformationen aktualisieren oder Feedback zu den Produktabbildungen geben?
Ist der Verkauf dieses Produkts für Sie nicht akzeptabel? |
Mehr über den Autor
Entdecken Sie Bücher, lesen Sie über Autoren und mehr
› Besuchen Sie die Seite von Norman Biggs auf Amazon
› Besuchen Sie die Seite von Norman Biggs auf Amazon
Produktbeschreibungen
Pressestimmen
A well known definition says that a textbook is a book such that everybody thinks he can write a better one. Biggs' Discrete Mathematics is an exception - not only for its wide range of topics and its clear organization but notably for its excellent style of explanation. EMS
Kurzbeschreibung
The new edition of this text includes additional chapters on statements and proof, logical framework, and natural numbers and the integers. The updated chapters offer over 1000 tailored exercises, and an accompanying website contains hints and solutions to all exercises. The text is designed explicitly for mathematicians and computer scientists seeking a first approach to this important topic.
In diesem Buch
(Mehr dazu)
Nach einer anderen Ausgabe dieses Buches suchen.
Nach einer anderen Ausgabe dieses Buches suchen.
Einleitungssatz
The following statements are typical of the ones studied by mathematicians. Lesen Sie die erste Seite
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis | Rückseite
The following statements are typical of the ones studied by mathematicians. Lesen Sie die erste Seite
Mehr entdecken
Wortanzeiger
Ausgewählte Seiten ansehenWortanzeiger
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis | Rückseite
Vorgeschlagene Tags zu ähnlichen Produkten(Was ist das?)Setzen Sie den ersten relevanten Tag hinzu (ein Schlüsselwort, das mit diesem Produkt in engem Zusammenhang steht).
|
Eine digitale Version dieses Buchs im Kindle-Shop verkaufen
Wenn Sie ein Verleger oder Autor sind und die digitalen Rechte an einem Buch haben, können Sie die digitale Version des Buchs in unserem Kindle-Shop verkaufen.
Weitere Informationen
Kundenrezensionen
Die hilfreichsten Kundenrezensionen
1 von 1 Kunden fanden die folgende Rezension hilfreich
Format:Gebundene Ausgabe
Als ich eine Vorlesung zur diskreten Mathematik an der Uni besuchte, hat dieses Buch mich gerettet.
Unser Skript war sehr unanschaulich und konfus geschrieben, und jedes Mal, wenn ich etwas gar nicht verstehen konnte, hat dieses Buch mir geholfen. Der einzige Nachteil war, dass das Buch den Stoff manchmal in einer anderen Reihenfolge dargestellt hat als unsere Vorlesung. Aber am Ende stand zum Glück fast alles (95%) drin was wir in der Vorlesung auch hatten.
Ich habe während meines Studiums schon viele Mathematikbüchern kennen gelernt, und dieses ist neben Sipser: Introduction to Theory of Computation, bisher das beste überhaupt.
Unser Skript war sehr unanschaulich und konfus geschrieben, und jedes Mal, wenn ich etwas gar nicht verstehen konnte, hat dieses Buch mir geholfen. Der einzige Nachteil war, dass das Buch den Stoff manchmal in einer anderen Reihenfolge dargestellt hat als unsere Vorlesung. Aber am Ende stand zum Glück fast alles (95%) drin was wir in der Vorlesung auch hatten.
Ich habe während meines Studiums schon viele Mathematikbüchern kennen gelernt, und dieses ist neben Sipser: Introduction to Theory of Computation, bisher das beste überhaupt.
1 von 10 Kunden fanden die folgende Rezension hilfreich
Format:Taschenbuch
I like it, but I think there are better ways of teaching Discrete Maths. I can tell you that you discovered me the difference between Calculus and Discrete Maths. That's cool!!
Die hilfreichsten Kundenrezensionen auf Amazon.com (beta)
Amazon.com:
5 Rezensionen
15 von 16 Kunden fanden die folgende Rezension hilfreich
great book
25. April 2002
Format:Gebundene Ausgabe
Dr. Biggs' book is an excellent introduction to discrete maths--I used it for the first term and part of the second term of his "Introduction to Pure Maths". The book reads the same as he lectures, which, while sometimes creepy (it's like he's talking to you), is a very good thing. It is very well written and explains everything clearly. He has plenty of worked examples to illustrate how to use what he has taught as well as exercises (w/ answers in the back of the book) for students to work out for themselves.
1 von 1 Kunden fanden die folgende Rezension hilfreich
Interesting book
29. Oktober 2010
Format:Taschenbuch|Von Amazon bestätigter Kauf
I bought this book for my first year at university. It is a good book, clear and concise, and altought I bought a used one (second edition) it was like a new one, so I'm very happy. :)
4 von 6 Kunden fanden die folgende Rezension hilfreich
Unthorough, Inadequate for Early Learners
16. März 2010
Format:Taschenbuch
This was the required text in a course I just took in discrete mathematics, and it is very lacking. The descriptions are not detailed enough for first-time learners of the material. Biggs tries to cover very many topics, and as such, doesn't cover any given topic thoroughly. The book feels like random snapshots of various components of discrete mathematics, but not all of the snapshots are representative of the topics to which they belong.
For one group of chapters, Biggs discusses things which are only really relevant or applicable in computer science (or, at the very least, given a computer). This is to be expected - discrete mathematics and computer science go hand in hand. Unfortunately, though, it does not appear that he is a practicing computer scientist - he omits the names behind some of the famous algorithms, i.e. Dijkstra's shortest path algorithm and Prim's minimum spanning tree algorithm. He ditches the minimum spanning tree problem and proceeds to DFS without discussing Kruskal's algorithm. He also performs heap sort with a min order heap, sorting elements in ascending order, which, as most computer science students should be able to recognize, requirs linear-order extra space in order to copy the final array (as opposed to using a max-order heap, which requires only constant space). He uses a seemingly FORTRAN-based pseudocode, but omits symbols, adds more English words (as if FORTRAN didn't have enough), and uses no comments.
All in all, avoid this book if possible. For introductory-level discrete mathematics, I would recommend Discrete Mathematics and Its Applications, which still sits on my shelf and serves as a great quick reference. For introductory-level data structures and algorithms, I would *highly* recommend Data Structures and Algorithm Analysis in C++ (3rd Edition), which has extensive diagrams, examples, analyses, proofs, and even some fully coded implementations to help jump-start readers as they get more comfortable with ADT use (also available for C and Java). However, no book is ever a substitute for going to school :-P.
I hope the Biggs book is never mandatory for any of your classes.
Cheers!
For one group of chapters, Biggs discusses things which are only really relevant or applicable in computer science (or, at the very least, given a computer). This is to be expected - discrete mathematics and computer science go hand in hand. Unfortunately, though, it does not appear that he is a practicing computer scientist - he omits the names behind some of the famous algorithms, i.e. Dijkstra's shortest path algorithm and Prim's minimum spanning tree algorithm. He ditches the minimum spanning tree problem and proceeds to DFS without discussing Kruskal's algorithm. He also performs heap sort with a min order heap, sorting elements in ascending order, which, as most computer science students should be able to recognize, requirs linear-order extra space in order to copy the final array (as opposed to using a max-order heap, which requires only constant space). He uses a seemingly FORTRAN-based pseudocode, but omits symbols, adds more English words (as if FORTRAN didn't have enough), and uses no comments.
All in all, avoid this book if possible. For introductory-level discrete mathematics, I would recommend Discrete Mathematics and Its Applications, which still sits on my shelf and serves as a great quick reference. For introductory-level data structures and algorithms, I would *highly* recommend Data Structures and Algorithm Analysis in C++ (3rd Edition), which has extensive diagrams, examples, analyses, proofs, and even some fully coded implementations to help jump-start readers as they get more comfortable with ADT use (also available for C and Java). However, no book is ever a substitute for going to school :-P.
I hope the Biggs book is never mandatory for any of your classes.
Cheers!
Waren diese Rezensionen hilfreich?
Wir wollen von Ihnen hören.
Kunden diskutieren
|
Das Forum zu diesem Produkt
Fragen stellen, Meinungen austauschen, Einblicke gewinnen Aktive Diskussionen in ähnlichen Foren
Kundendiskussionen durchsuchen
|
Ähnliche Foren
|
||||||||||||||||||||||||||||||||||
Lieblingslisten
|
|
Ähnliche Artikel finden
Anhand des Sachgebietes nach ähnlichen Produkten suchen:
Ihr Kommentar
Möchten Sie die Produktinformationen aktualisieren oder Feedback zu den Produktabbildungen geben?
|
