For courses in Java Programming
Layered, Back-to-Basics Approach to Java Programming
Newly revised and updated, this Fourth Edition of Building Java Programs: A Back to Basics Approach uses a layered strategy to introduce Java programming, with the aim of overcoming the difficulty associated with introductory programming textbooks. The authors' proven and class-tested "back to basics" approach introduces programming fundamentals first, with new syntax and concepts added over multiple chapters, and object-oriented programming discussed only once readers have developed a basic understanding of Java programming. Previous editions have established the text's reputation as an excellent choice for thoroughly introducing the basics of computer science, and new material in theFourth Edition incorporates concepts related to Java 8, functional programming, and image manipulation.
Note: You are purchasing a standalone product; MyLab & Mastering does not come packaged with this content. Students, if interested in purchasing this title with MyLab & Mastering, ask your instructor for the correct package ISBN and Course ID. Instructors, contact your Pearson representative for more information.
If you would like to purchase both the physical text and MyLab & Mastering, search for:
0134448308 / 9780134448305 Building Java Programs: A Back to Basics Approach plus MyProgrammingLab with Pearson eText -- Access Card Package, 4/e
Package consists of:
Preface This book is a second in programming, using the Object Oriented paradigm. It provides an in depth and extensive coverage in programming techniques to a variety of problems. The material is more detailed than the previous course, and is supported with larger programs. Concepts Covered Program Design Principles - Cohesion & Coupling Inheritance & Polymorphism Exception and Exception Handling Files and Streams Elementary Data Structure Graphical User Interface Pre-requisite Knowledge of constructing a class Understand data types Knowledge of arithmetic, relational and logical expressions Knowledge of program control - sequence, selection, and iteration Knowledge of one and two dimensional arrays Searching and sorting. Overview Chapter 1 - Object Oriented Software Design In this chapter you will learn the principles of OOD using cohesion and coupling. You will learn about class relationship diagrams; how they are used to model solutions. Chapter 2 - Inheritance and Polymorphism In this chapter you will learn the concept of inheritance and polymorphism which are fundamental to Object Oriented Programming (OOP). Chapter 3- Exception and Exception Handling In this chapter you will learn about exception, how it can cause a program to terminate abnormally, and how you can write codes to prevent this from happening. Chapter 4 Files and Streams In this chapter you learn to read and write text files as well as image files. You learn about serial access files as well as random access files Chapter 5 Recursion In this chapter you will learn about a type of programming technique that causes, not only a statement or a block of statements to be executed repeatedly, but also an entire method calling itself repeatedly. Chapter 6 - An Introduction to Data Structure In this chapter you will learn about data structure - particular ways of organizing and storing data for efficient retrieved and manipulation in terms of processing time and hardware resources. In this chapter you learn about the Java Collections Framework that contains classes for this purpose. Chapter 7 - Specialized Lists - Stack Queue LinkedList HashMap In this chapter you will learn about four specialized data structures - Stack, Queue, LinkedList, and HashMap. Chapter 8 - Introduction to Graphical User Interface (GUI) GUI - a type of program that allows the user to interact with the computer via graphical symbols such as buttons and menus. In this chapter you will learn how to write such programs. Chapter 9 - Events and Event Handling The programs we have written so far, called widow base programs, were designed to run sequentially, as coded; hence the next statement to be executed is predictable. With GUI programs, they allow the user to interact with the computer; hence the next statement to be executed is not predictable. In this chapter we will learn how to develop such programs. Chapter 10 - Graphics All of the programs that we have written so far are text base programs. In this chapter you learn how to free hand draw onto component, or make static figures onto components."
Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.
As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.
Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.
Programmers Paradise Articles
Programmers Paradise Books