Rating:
Author: Y. Daniel Liang
ISBN : B007O10Z3A
New from $98.64
Format: PDF, EPUB
Free download Free Introduction to Java Programming, Comprehensive Version for everyone book with Mediafire Link Download Link
This is the eBook of the printed book and may not include any media, website access codes, or print supplements that may come packaged with the bound book.
Introduction to Java Programming, Comprehensive, 9e, features comprehensive coverage ideal for a one-, two-, or three-semester CS1 course sequence.
Daniel Liang teaches concepts of problem-solving and object-oriented programming using a fundamentals-first approach. Beginning programmers learn critical problem-solving techniques then move on to grasp the key concepts of object-oriented, GUI programming, advanced GUI and Web programming using Java.
Direct download links available for Free Introduction to Java Programming, Comprehensive Version (2-download) (9th Edition) [Print Replica] [Kindle Edition]
- File Size: 26416 KB
- Print Length: 1344 pages
- Simultaneous Device Usage: Up to 2 simultaneous devices, per publisher limits
- Publisher: Prentice Hall; 9 edition (April 26, 2012)
- Sold by: Amazon Digital Services, Inc.
- Language: English
- ASIN: B007O10Z3A
- Text-to-Speech: Not enabled
X-Ray:
- Lending: Not Enabled
- Amazon Best Sellers Rank: #390,411 Paid in Kindle Store (See Top 100 Paid in Kindle Store)
Free Introduction to Java Programming, Comprehensive Version
/**
* @Use: Used for a college programming course.
* @Class: Java Programming I
* @Other: Experience in C++/C, PHP, JavaScript, Perl, SQL [MySQL, Oracle PL/SQL, SQL Server]
*
* =============================================
** This Book is meant to be used in an academia
* =============================================
*; not ideal book for self study
*/
This book was required for a Java Programming I course that I took which had a basic CS Programming course (in java or in my case c++) as a prerequisite. When used in an academic setting, the book is accompanied by very useful powerpoint slides and other material including 15 additional chapters(#35 - #50).
/**
* book@review:~$ ./Math -required
*
* Reader should have passed a college
* algebra and/or discrete math course.
* Discrete math preferred but not
* required.
*
* Continue? (Y/N) Y
*
* Reader should know how to perform oper-
* -ations on matrices (add, mult, etc).
*
* Continue? (Y/N) Y
*
* Reader should have a solid understanding
* of logic, possibly with knowledge of
* basic logic gates.
*
* Continue? (Y/N) N
*
* Goodbye.
* book@review:~$ exit
*/
// Why the math requirement?
The reason that you should have satisfactory college mathematics experience is because the author
explains language constructs using simple mathematical algorithms. This seems to be popular in comp-
-uter science and most good CS books should include algorithms such as Monte Carlo's Pi Simulation,
Fibonacci Sequence (Recursion), Calculating Primes, Trees(Application of Discrete Math),
Graphs(Application Discrete Math), Towers of Hanoi, etc.