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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Jenkyns, Tom (Autor), Stephenson, Ben (Autor)
Autor Corporativo: SpringerLink (Online service)
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:
Computer science > Mathematics.
Discrete mathematics.
Algorithms.
Discrete Mathematics in Computer Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares