Description
Book SynopsisY. Daniel Liang earned his Ph.D. in Computer Science from the University of Oklahoma, USA in 1991, and an MS and BS in Computer Science from Fudan University, China, in 1986 and 1983. Prior to joining Armstrong, he was Associate Professor of 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 was active in graph algorithms from 1990 to 1995 and published more than ten papers in several established journals such as SIAM Journal on Computing, Discrete Applied Mathematics, Acta Informatics, and Information Processing Letters. Since 1996, he has devoted to writing texts and published more than thirty books with Prentice Hall. His popular computer science texts are widely adopted in the world.
Dr. Liang was elected a Java Champion in 2005 by Sun Microsystems and has given lectures on Java internationally.
Table of Contents
- Introduction to Computers, Programs, and Python
- Elementary Programming
- Selections
- Mathematical Functions, Strings, and Objects
- Loops
- Functions
- Lists
- Multidimensional Lists
- Objects and Classes
- Basic GUI Programming Using Tkinter
- Advanced GUI Programming Using Tkinter
- Inheritance and Polymorphism
- Files and Exception Handling
- Tuples, Sets, and Dictionaries
- Recursion
- Developing Efficient Algorithms
- Sorting
- Linked Lists, Stacks, Queues, and Priority Queues
- Binary Search Trees
- AVL Trees
- Hashing
- Graphs and Applications
- Weighted Graphs and Applications
- Appendix A. Python Keywords
- Appendix B. The ASCII Character Set
- Appendix C. Number Systems
- Appendix D. Command Line Arguments
- Appendix E. Regular Expressions
- Appendix F. Bitwise Operations
- Appendix G. The Big-O, Big-Omega, and Big-Theta Notations
- Appendix H. Operator Precedence Chart
- Symbol Index
- Supplemental Material
- Glossary
