Acest site necesită browser-ul să fie activat JavaScript.
Vă rugăm să activați JavaScript și să reîncărcați această pagină.
Site-ul necesită browser-ul pentru a activa cookie-urile pentru a se autentifica.
Vă rugăm să activați cookie-urile și reîncărcați această pagină.
Carte romana
Carte rusa
Carte engleza
Vezi toate cartile
Top branduri cosmetica
Cosmetica Coreeana
Machiaj
Ingrijire ten
Ingrijire par
Ingrijire corp
Produse de baie
Igiena orala
Igiena intima
Igiena sexuala
Cosmetice barbati
Seturi cadou
Naturale si organice
Vezi toate cosmeticele
Top branduri dermatocosmetica
Protectie solara
Seturi cadou si pachete promo
Parfumuri pentru femei
Top branduri femei
Premium brands femei
Parfumuri unisex
Vezi toate parfumurile
Parfumuri pentru barbati
Top branduri barbati
Premium brands barbati
Jucarii si jocuri
Hrana si articole copii
Scutece si servetele
Rechizite si papetarie
Vezi toate produsele
Nutritie & Suplimente
Branduri
Tom JenkynsFundamentals of Discrete Math for Computer Science: A Problem-Solving Primer, Paperback
în Pickup Point de la 599.99 MDL
în 14 de zile
înainte de plată
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.
Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
Dr. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.
Am aprecia părerea ta! Evaluați acest produs
Nu există comentarii de la alți utilizatori.