Cargando…
Fundamentals of Discrete Math for Computer Science A Problem-Solving Primer /
An understanding of discrete mathematics is essential for students of computer science wishing to improve their programming competence. Fundamentals of Discrete Math for Computer Science provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner spe...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
London :
Springer London : Imprint: Springer,
2013.
|
| Edición: | 1st ed. 2013. |
| Colección: | Undergraduate Topics in Computer Science,
|
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-1-4471-4069-6 | ||
| 003 | DE-He213 | ||
| 005 | 20230810133129.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121026s2013 xxk| s |||| 0|eng d | ||
| 020 | |a 9781447140696 |9 978-1-4471-4069-6 | ||
| 024 | 7 | |a 10.1007/978-1-4471-4069-6 |2 doi | |
| 050 | 4 | |a QA76.9.M35 | |
| 050 | 4 | |a QA297.4 | |
| 072 | 7 | |a UYAM |2 bicssc | |
| 072 | 7 | |a PBD |2 bicssc | |
| 072 | 7 | |a COM018000 |2 bisacsh | |
| 072 | 7 | |a UYAM |2 thema | |
| 072 | 7 | |a PBD |2 thema | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 100 | 1 | |a Jenkyns, Tom. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Fundamentals of Discrete Math for Computer Science |h [electronic resource] : |b A Problem-Solving Primer / |c by Tom Jenkyns, Ben Stephenson. |
| 250 | |a 1st ed. 2013. | ||
| 264 | 1 | |a London : |b Springer London : |b Imprint: Springer, |c 2013. | |
| 300 | |a XII, 416 p. 143 illus. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Undergraduate Topics in Computer Science, |x 2197-1781 | |
| 505 | 0 | |a Algorithms, Numbers and Machines -- Sets, Sequences and Counting -- Boolean Expressions, Logic and Proof -- Searching and Sorting -- Graphs and Trees -- Relations: Especially on (Integer) Sequences -- Sequences and Series -- Generating Sequences and Subsets -- Discrete Probability and Average Case Complexity -- Turing Machines. | |
| 520 | |a An understanding of discrete mathematics is essential for students of computer science wishing to improve their programming competence. Fundamentals of Discrete Math for Computer Science provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions. Topics and features: Highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematics Ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations Describes mathematical processes in an algorithmic manner, often including a walk-through demonstrating how the algorithm performs the desired task as expected Contains examples and exercises throughout the text, and highlights the most important concepts in each section Selects examples that demonstrate a practical use for the concept in question This easy-to-understand and fun-to-read textbook is ideal for an introductory discrete mathematics course for computer science students at the beginning of their studies. The book assumes no prior mathematical knowledge, and discusses concepts in programming as needed, allowing it to be used in a mathematics course taken concurrently with a student's first programming course. | ||
| 650 | 0 | |a Computer science |x Mathematics. | |
| 650 | 0 | |a Discrete mathematics. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 1 | 4 | |a Discrete Mathematics in Computer Science. |
| 650 | 2 | 4 | |a Algorithms. |
| 700 | 1 | |a Stephenson, Ben. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9781447140689 |
| 776 | 0 | 8 | |i Printed edition: |z 9781447140702 |
| 830 | 0 | |a Undergraduate Topics in Computer Science, |x 2197-1781 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-1-4471-4069-6 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||