Java Foundations
Introduction to Program Design and Data Structures: International Version
av John Lewis
- Format:
- Mixed media product
- Utgiven:
- 2010-04-16
- Språk:
- Engelska
CourseSmart
Save money. Lighten your backpack. Access your textbooks anytime, from anywhere.
This title is available as an eTextbook from CourseSmart. Purchase your assigned textbook as a CourseSmart eTextbook, and stop lugging books around campus! You can also access CourseSmart eTextbooks from your iPhone.
Instructors, request your exam copies online and get instant access. Learn more at coursesmart.com.
(Pearson)
Passar bra ihop
|
De som köpt den här boken har ofta också köpt Object-Oriented Systems Analysis and Design (häftad) av Simon Bennett | |||
|
Pris för båda:
1091:-Köp
|
Fler böcker av John Lewis
Java Software Solutions with MyProgrammingLab 7th Ed...John Lewis, William Loftus |
Java Software SolutionsJohn Lewis (häftad) |
Java Software StructuresJohn Lewis (häftad) |
C# Software SolutionsJohn Lewis | |||
|
517:- Köp
|
848:- Köp
|
730:- Köp
|
694:- Köp
|
Kundrecensioner
Bloggat om Java Foundations
Övrig information
John Lewis is the co-author of the Java Software Structures textbooks used for AP computer science classes, the Java Software Solutions textbook, Java Software Structures, and Programming with Alice and Java. He teaches courses at both Virginia Tech and Radford University. He received his Ph.D. degree from Virginia Tech. Peter DePasquale is an assistant professor of computer science at the College of New Jersey (TCNJ). He is the author of Addison-Wesley's Java Backpack Reference Guide and Addison-Wesley's C++ Backpack Reference Guide. Joe Chase is an associate professor of computer science at Radford University. He is the co-author of Java Software Structures and Java Software Structures for AP* Computer Science AB.
(Pearson)
Innehållsförteckning
1. Introduction
2. Data and Expressions
3. Using Classes and Objects
4. Conditionals and Loops
5. Writing Classes
6. Graphical User Interfaces
7. Arrays
8. Inheritance
9. Polymorphism
10. Exceptions
11. Recursion
12. Analysis of Algorithms
13. Searching and Sorting
14. Stacks
15. Queues
16. Trees
17. Binary Search Trees
18. Heaps and Priority Queues
19. Graphs
20. Hashing
21. Databases
(Pearson)