archive-edu.com » EDU » H » HWS.EDU

Total: 727

Choose link from "Titles, links and description words view":

Or switch to "Titles and links view".
  • Javanotes 7.0, Chapter 3 -- Programming in the Small II: Control
    still working on the level of programming in the small in this chapter we are interested in the kind of complexity that can occur within a single subroutine On this level complexity is provided by control structures The two types of control structures loops and branches can be used to repeat a sequence of statements over and over or to choose among two or more possible courses of action Java includes several control structures of each type and we will look at each of them in some detail Program complexity can be seen not just in control structures but also in data structures A data structure is an organized collection of data chunked together so that it can be treated as a unit Section 3 8 in this chapter includes an introduction to one of the most common data structures arrays The chapter will also begin the study of program design Given a problem how can you come up with a program to solve that problem We ll look at a partial answer to this question in Section 3 2 Finally Section 3 9 is a very brief first look at GUI programming Contents of Chapter 3 Section 1 Blocks

    Original URL path: http://math.hws.edu/javanotes/c3/index.html (2016-02-07)
    Open archived version from archive


  • Javanotes 7.0, Chapter 4 -- Programming in the Large I: Subroutines
    associated with that subroutine Subroutines can be used over and over at different places in the program A subroutine can even be used inside another subroutine This allows you to write simple subroutines and then use them to help write more complex subroutines which can then be used in turn in other subroutines In this way very complex programs can be built up step by step where each step in

    Original URL path: http://math.hws.edu/javanotes/c4/index.html (2016-02-07)
    Open archived version from archive

  • Javanotes 7.0, Chapter 5 -- Programming in the Large II: Objects and Classes
    sections of this chapter introduce the basic things you need to know to work with objects and to define simple classes The remaining sections cover more advanced topics you might not understand them fully the first time through In particular Section 5 5 covers the most central ideas of object oriented programming inheritance and polymorphism However in this textbook we will generally use these ideas in a limited form by

    Original URL path: http://math.hws.edu/javanotes/c5/index.html (2016-02-07)
    Open archived version from archive

  • Javanotes 7.0, Chapter 6 -- Introduction to GUI Programming
    these events as they occur Event driven programming builds on all the skills you have learned in the first five chapters of this text You need to be able to write the methods that respond to events Inside those methods you are doing the kind of programming in the small that was covered in Chapter 2 and Chapter 3 And of course objects are everywhere in GUI programming Events are

    Original URL path: http://math.hws.edu/javanotes/c6/index.html (2016-02-07)
    Open archived version from archive

  • Javanotes 7.0, Chapter 7 -- Arrays and ArrayLists
    of data structure that is so important and so basic that it is built into every programming language the array You have already encountered arrays in Section 3 8 and Subsection 5 1 4 We continue the study of arrays in this chapter including some new details of their use and some additional array processing techniques In particular we will look at the important topic of algorithms for searching and

    Original URL path: http://math.hws.edu/javanotes/c7/index.html (2016-02-07)
    Open archived version from archive

  • Javanotes 7.0, Chapter 8 -- Correctness, Robustness, Efficiency
    chapter is a kind of turning point in which we look at the problem of getting such complex programs right Computer programs that fail are much too common Programs are fragile A tiny error can cause a program to misbehave or crash Most of us are familiar with this from our own experience with computers And we ve all heard stories about software glitches that cause spacecraft to crash telephone service to fail and in a few cases people to die Programs don t have to be as bad as they are It might well be impossible to guarantee that programs are problem free but careful programming and well designed programming tools can help keep the problems to a minimum This chapter will look at issues of correctness and robustness of programs It also looks more closely at exceptions and the try catch statement and it introduces assertions another of the tools that Java provides as an aid in writing correct programs We will also look at another issue that is important for programs in the real world efficiency Even a completely correct program is not very useful if it takes an unreasonable amount of time to run The last

    Original URL path: http://math.hws.edu/javanotes/c8/index.html (2016-02-07)
    Open archived version from archive

  • Javanotes 7.0, Chapter 9 -- Linked Data Structures and Recursion
    means is that the subroutine is used in its own definition Recursion can often be used to solve complex problems by reducing them to simpler problems of the same type A reference to one object can be stored in an instance variable of another object The objects are then said to be linked Complex data structures can be built by linking objects together An especially interesting case occurs when an

    Original URL path: http://math.hws.edu/javanotes/c9/index.html (2016-02-07)
    Open archived version from archive

  • Javanotes 7.0, Chapter 10 -- Generic Programming and Collection Classes
    a binary tree shouldn t have to re code these data structures from scratch They are well understood and have been programmed thousands of times before The problem is how to make pre written robust data structures available to programmers In this chapter we ll look at Java s attempt to address this problem You have already seen part of the solution in Section 7 3 That section introduced parameterized

    Original URL path: http://math.hws.edu/javanotes/c10/index.html (2016-02-07)
    Open archived version from archive