Introduction to Programming with C++
Autor Y. Daniel Liangen Limba Engleză Paperback – 13 ian 2013
Preț: 1100.89 lei
Preț vechi: 1429.73 lei
-23% Nou
Puncte Express: 1651
Preț estimativ în valută:
210.75€ • 216.75$ • 174.84£
210.75€ • 216.75$ • 174.84£
Carte indisponibilă temporar
Doresc să fiu notificat când acest titlu va fi disponibil:
Se trimite...
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780133252811
ISBN-10: 0133252817
Pagini: 720
Dimensiuni: 203 x 251 x 23 mm
Greutate: 1.11 kg
Ediția:Revised
Editura: Pearson
ISBN-10: 0133252817
Pagini: 720
Dimensiuni: 203 x 251 x 23 mm
Greutate: 1.11 kg
Ediția:Revised
Editura: Pearson
Notă biografică
Y. Daniel Liang is currently a Yamacraw professor of software engineering in the School of Computing at Armstrong Atlantic State University, Savannah, Georgia. Dr. Liang earned his Ph.D. in Computer Science from the University of Oklahoma in 1991, and an MS and BS in Computer Science from Fudan University in Shanghai, China, in 1986 and 1983. Prior to joining Armstrong, he was an associate professor in computer science at Purdue University in Fort Wayne, where he twice received the Excellence in Research award. Dr. Liang was trained in theoretical computer science. He has published in SIAM Journal on Computing, Discrete Applied Mathematics, Acta Informatics, and Information Processing Letters. He is the author of more than thirty books. His popular computer science texts are widely adopted in the world. Dr. Liang was elected a Java Champion in 2005 by Sun Microsystems. He has given lectures on Java internationally.
Cuprins
Part I Fundamentals of Programming Chapter 1 Introduction to Computers, Programming, and C++ Chapter 2 Elementary Programming Chapter 3 Selections Chapter 4 Mathematical Functions, Characters, and Strings Chapter 5 Loops Chapter 6 Functions Chapter 7 Single-Dimensional Arrays and C-Strings Chapter 8 Multidimensional Arrays Part II Object-Oriented Programming Chapter 9 Objects and Classes Chapter 10 Object-Oriented Thinking Chapter 11 Pointers and Dynamic Memory Management Chapter 12 Templates, Vectors, and Stacks Chapter 13 File Input and Output Chapter 14 Operator Overloading Chapter 15 Inheritance and Polymorphism Chapter 16 Exception Handling Part III Data Structures and Advanced Topics Chapter 17 Recursion Bonus Chapters Chapter 18 Developing Efficient Algorithms Chapter 19 Sorting Chapter 20 Linked Lists, Queues, and Priority Queues Chapter 21 Binary Search Trees Chapter 22 STL Containers Chapter 23 STL Algorithms Chapter 24 Graph Applications Chapter 25 Weighted Graph Applications Chapter 26 AVL Trees and Splay Trees Appendixes Chapters 18-26 are bonus chapters available from