Introduction to Programming Using Java - Department of ...

More documents

Recommendations

Info

$Math 131 PracTest 1$

$MATH 131-01, Spring 2011 Lab #14, April 28 1. The power series ...$

CHAPTER 1. THE MENTAL LANDSCAPE 6multitasking altogether. However, threads have become increasingly important as computershave become more powerful and as they have begun to make more use of multitasking. Indeed,threads are built into the Java programming language as a fundamental programming concept.Just as important in Java and in modern programming in general is the basic concept ofasynchronous events. While programmers don’t actually deal with interrupts directly, theydo often find themselves writing event handlers, which, like interrupt handlers, are calledasynchronously when specified events occur. Such “event-driven programming” has a verydifferent feel from the more traditional straight-though, synchronous programming. We willbegin with the more traditional type of programming, which is still used for programmingindividual tasks, but we will return to threads and events later in the text.∗ ∗ ∗By the way, the software that does all the interrupt handling and the communication withthe user and with hardware devices is called the operating system. The operating system isthe basic, essential software without which a computer would not be able to function. Otherprograms, such as word processors and World Wide Web browsers, are dependent upon theoperating system. Common operating systems include Linux, DOS, Windows 2000, WindowsXP, and the Macintosh OS.1.3 The Java Virtual MachineMachine language consists of very simple instructions that can be executed directly bythe CPU of a computer. Almost all programs, though, are written in high-level programminglanguages such as Java, Pascal, or C++. A program written in a high-level language cannotbe run directly on any computer. First, it has to be translated into machine language. Thistranslation can be done by a program called a compiler. A compiler takes a high-level-languageprogram and translates it into an executable machine-language program. Once the translationis done, the machine-language program can be run any number of times, but of course it can onlybe run on one type of computer (since each type of computer has its own individual machinelanguage). If the program is to run on another type of computer it has to be re-translated,using a different compiler, into the appropriate machine language.There is an alternative to compiling a high-level language program. Instead of using acompiler, which translates the program all at once, you can use an interpreter, which translatesit instruction-by-instruction, as necessary. An interpreter is a program that acts much like aCPU, with a kind of fetch-and-execute cycle. In order to execute a program, the interpreterruns in a loop in which it repeatedly reads one instruction from the program, decides what isnecessary to carry out that instruction, and then performs the appropriate machine-languagecommands to do so.One use of interpreters is to execute high-level language programs. For example, the programminglanguage Lisp is usually executed by an interpreter rather than a compiler. However,interpreters have another purpose: they can let you use a machine-language program meant forone type of computer on a completely different type of computer. For example, there is a programcalled “Virtual PC” that runs on Macintosh computers. Virtual PC is an interpreter thatexecutes machine-language programs written for IBM-PC-clone computers. If you run VirtualPC on your Macintosh, you can run any PC program, including programs written for Windows.(Unfortunately, a PC program will run much more slowly than it would on an actual IBM clone.The problem is that Virtual PC executes several Macintosh machine-language instructions for(online)
forMacOS JavaInterpreterCHAPTER 1. THE MENTAL LANDSCAPE 7each PC machine-language instruction in the program it is interpreting. Compiled programsare inherently faster than interpreted programs.)∗ ∗ ∗The designers of Java chose to use a combination of compilation and interpretation. Programswritten in Java are compiled into machine language, but it is a machine language fora computer that doesn’t really exist. This so-called “virtual” computer is known as the Javavirtual machine. The machine language for the Java virtual machine is called Java bytecode.There is no reason why Java bytecode could not be used as the machine language of areal computer, rather than a virtual computer.However, one of the main selling points of Java is that it can actually be used on anycomputer. All that the computer needs is an interpreter for Java bytecode. Such an interpretersimulates the Java virtual machine in the same way that Virtual PC simulates a PC computer.Of course, a different Jave bytecode interpreter is needed for each type of computer, butonce a computer has a Java bytecode interpreter, it can run any Java bytecode program. Andthe same Java bytecode program can be run on any computer that has such an interpreter.This is one of the essential features of Java: the same compiled program can be run on manydifferent types of computers.forLinuxWhy, you might wonder, use the intermediate Java bytecode at all? Why not just distributethe original Java program and let each person compile it into the machine language of whatevercomputer they want to run it on? There are many reasons. First of all, a compiler has tounderstand Java, a complex high-level language. The compiler is itself a complex program. AJava bytecode interpreter, on the other hand, is a fairly small, simple program. This makes iteasy to write a bytecode interpreter for a new type of computer; once that is done, that computercan run any compiled Java program. It would be much harder to write a Java compiler for thesame computer.Furthermore, many Java programs are meant to be downloaded over a network. This leadsto obvious security concerns: you don’t want to download and run a program that will damageyour computer or your files. The bytecode interpreter acts as a buffer between you and theprogram you download. You are really running the interpreter, which runs the downloadedprogram indirectly. The interpreter can protect you from potentially dangerous actions on thepart of that program.I should note that there is no necessary connection between Java and Java bytecode. A programwritten in Java could certainly be compiled into the machine language of a real computer.And programs written in other languages could be compiled into Java bytecode. However, it isthe combination of Java and Java bytecode that is platform-independent, secure, and networkcompatiblewhile allowing you to program in a modern high-level object-oriented language.Program Compiler Java Bytecode Program JavaforWindows JavaInterpreterJavaInterpreter
Page 1 and 2: Introduction to Programming Using J
Page 3 and 4: ContentsPrefacex1 The Mental Landsc
Page 6 and 7: CONTENTSiv5.5 Inheritance and Polym
Page 8 and 9: CONTENTSvi7.5 Multi-dimensional Arr
Page 10 and 11: CONTENTSviii11.1.5 The Scanner Clas
Page 12 and 13: PrefaceIntroduction to Programming
Page 14 and 15: Prefacexii• Post an unmodified co
Page 16 and 17: CHAPTER 1. THE MENTAL LANDSCAPE 2lo
Page 18 and 19: CHAPTER 1. THE MENTAL LANDSCAPE 4
Page 22 and 23: CHAPTER 1. THE MENTAL LANDSCAPE 8
Page 24 and 25: CHAPTER 1. THE MENTAL LANDSCAPE 10p
Page 26 and 27: DrawableObjectTwoPointObject Multip
Page 28 and 29: JComponentJAbstractButton JComboBox
Page 30 and 31: CHAPTER 1. THE MENTAL LANDSCAPE 16i
Page 32 and 33: Chapter 2Programming in the Small I
Page 34 and 35: CHAPTER 2. NAMES AND THINGS 20now:/
Page 36 and 37: CHAPTER 2. NAMES AND THINGS 22No sp
Page 38 and 39: CHAPTER 2. NAMES AND THINGS 24Any d
Page 40 and 41: CHAPTER 2. NAMES AND THINGS 262.2.3
Page 44 and 45: CHAPTER 2. NAMES AND THINGS 30lengt
Page 46 and 47: CHAPTER 2. NAMES AND THINGS 32Then
Page 48: CHAPTER 2. NAMES AND THINGS 34An en
Page 51 and 52: CHAPTER 2. NAMES AND THINGS 37When
Page 53 and 54: CHAPTER 2. NAMES AND THINGS 39than
Page 55 and 56: CHAPTER 2. NAMES AND THINGS 41are t
Page 57 and 58: CHAPTER 2. NAMES AND THINGS 43}}Str
Page 59 and 60: CHAPTER 2. NAMES AND THINGS 45For e
Page 61 and 62: CHAPTER 2. NAMES AND THINGS 47Suppo
Page 69 and 70: CHAPTER 2. NAMES AND THINGS 55error
Page 71 and 72:
Exercises 57Exercises for Chapter 2
Page 73 and 74:
Quiz 59Quiz on Chapter 2(answers)1.
Page 75 and 76:
CHAPTER 3. CONTROL 61That is, it co
Page 77 and 78:
CHAPTER 3. CONTROL 63public class I
Page 79 and 80:
CHAPTER 3. CONTROL 65System.out.pri
Page 81 and 82:
CHAPTER 3. CONTROL 67time we proces
Page 83 and 84:
CHAPTER 3. CONTROL 69In order to co
Page 85 and 86:
CHAPTER 3. CONTROL 71TextIO.putln(N
Page 87 and 88:
CHAPTER 3. CONTROL 73that were intr
Page 89 and 90:
CHAPTER 3. CONTROL 75count = 0;/* R
Page 91 and 92:
CHAPTER 3. CONTROL 77Similarly,〈d
Page 93 and 94:
CHAPTER 3. CONTROL 793.4.1 For Loop
Page 95 and 96:
CHAPTER 3. CONTROL 81(1) // There a
Page 97 and 98:
CHAPTER 3. CONTROL 83Finally, we ca
Page 99 and 100:
CHAPTER 3. CONTROL 85}System.out.pr
Page 101 and 102:
CHAPTER 3. CONTROL 87The enhanced f
Page 103 and 104:
CHAPTER 3. CONTROL 89if (〈boolean
Page 105 and 106:
CHAPTER 3. CONTROL 91}System.out.pr
Page 107 and 108:
CHAPTER 3. CONTROL 93TextIO.putln("
Page 109 and 110:
CHAPTER 3. CONTROL 95Why? Because t
Page 111 and 112:
CHAPTER 3. CONTROL 97TextIO.putln("
Page 113 and 114:
CHAPTER 3. CONTROL 99to replace the
Page 115 and 116:
CHAPTER 3. CONTROL 101As an example
Page 117 and 118:
CHAPTER 3. CONTROL 103}}count = 0;t
Page 119 and 120:
CHAPTER 3. CONTROL 105of the class)
Page 121 and 122:
CHAPTER 3. CONTROL 107rectHeight =
Page 123 and 124:
CHAPTER 3. CONTROL 109height = getH
Page 125 and 126:
Exercises 1115. Suppose that a file
Page 127 and 128:
Quiz 113Quiz on Chapter 31. What is
Page 129 and 130:
Chapter 4Programming in the Large I
Page 131 and 132:
CHAPTER 4. SUBROUTINES 117The contr
Page 133 and 134:
CHAPTER 4. SUBROUTINES 119}// param
Page 135 and 136:
CHAPTER 4. SUBROUTINES 121Tell the
Page 137 and 138:
CHAPTER 4. SUBROUTINES 123distingui
Page 139 and 140:
CHAPTER 4. SUBROUTINES 125TextIO.pu
Page 141 and 142:
CHAPTER 4. SUBROUTINES 127A formal
Page 143 and 144:
CHAPTER 4. SUBROUTINES 129break the
Page 145 and 146:
CHAPTER 4. SUBROUTINES 131parameter
Page 147 and 148:
CHAPTER 4. SUBROUTINES 133return ty
Page 149 and 150:
CHAPTER 4. SUBROUTINES 135return
Page 151 and 152:
CHAPTER 4. SUBROUTINES 137* startin
Page 153 and 154:
CHAPTER 4. SUBROUTINES 139The Java
Page 155 and 156:
CHAPTER 4. SUBROUTINES 141line come
Page 157 and 158:
CHAPTER 4. SUBROUTINES 143comments
Page 159 and 160:
CHAPTER 4. SUBROUTINES 145of the su
Page 161 and 162:
CHAPTER 4. SUBROUTINES 147* Inserts
Page 163 and 164:
CHAPTER 4. SUBROUTINES 149}mosaic.s
Page 165 and 166:
CHAPTER 4. SUBROUTINES 151Mosaic.se
Page 167 and 168:
CHAPTER 4. SUBROUTINES 153}.. // Mo
Page 169 and 170:
CHAPTER 4. SUBROUTINES 155final sta
Page 171 and 172:
CHAPTER 4. SUBROUTINES 157.. // Mor
Page 173 and 174:
Exercises 159Exercises for Chapter
Page 175 and 176:
Exercises 161will call Mosaic.setCo
Page 177 and 178:
Chapter 5Programming in the Large I
Page 179 and 180:
CHAPTER 5. OBJECTS AND CLASSES 165a
Page 181 and 182:
CHAPTER 5. OBJECTS AND CLASSES 167b
Page 183 and 184:
CHAPTER 5. OBJECTS AND CLASSES 169i
Page 185 and 186:
CHAPTER 5. OBJECTS AND CLASSES 171p
Page 187 and 188:
CHAPTER 5. OBJECTS AND CLASSES 173t
Page 189 and 190:
CHAPTER 5. OBJECTS AND CLASSES 175c
Page 191 and 192:
CHAPTER 5. OBJECTS AND CLASSES 1775
Page 193 and 194:
CHAPTER 5. OBJECTS AND CLASSES 179M
Page 195 and 196:
CHAPTER 5. OBJECTS AND CLASSES 181s
Page 197 and 198:
CHAPTER 5. OBJECTS AND CLASSES 183a
Page 199 and 200:
Page 201 and 202:
CHAPTER 5. OBJECTS AND CLASSES 187*
Page 203 and 204:
CHAPTER 5. OBJECTS AND CLASSES 189*
Page 205 and 206:
CHAPTER 5. OBJECTS AND CLASSES 191T
Page 207 and 208:
Page 209 and 210:
CHAPTER 5. OBJECTS AND CLASSES 195I
Page 211 and 212:
CHAPTER 5. OBJECTS AND CLASSES 197A
Page 213 and 214:
CHAPTER 5. OBJECTS AND CLASSES 199}
Page 215 and 216:
CHAPTER 5. OBJECTS AND CLASSES 201e
Page 217 and 218:
CHAPTER 5. OBJECTS AND CLASSES 203t
Page 219:
CHAPTER 5. OBJECTS AND CLASSES 205x
Page 222 and 223:
CHAPTER 5. OBJECTS AND CLASSES 208S
Page 224 and 225:
CHAPTER 5. OBJECTS AND CLASSES 210l
Page 226 and 227:
CHAPTER 5. OBJECTS AND CLASSES 212n
Page 228 and 229:
CHAPTER 5. OBJECTS AND CLASSES 214}
Page 230 and 231:
CHAPTER 5. OBJECTS AND CLASSES 216A
Page 232 and 233:
Page 234 and 235:
Exercises 220which means to add ano
Page 236 and 237:
Quiz 222Counter headCount, tailCoun
Page 238 and 239:
CHAPTER 6. INTRODUCTION TO GUI PROG
Page 240 and 241:
Page 242 and 243:
Page 244 and 245:
Page 246 and 247:
Page 248 and 249:
Page 250 and 251:
Page 252 and 253:
Page 254 and 255:
Page 256 and 257:
Page 258 and 259:
Page 260 and 261:
Page 262 and 263:
Page 264 and 265:
Page 266 and 267:
Page 268 and 269:
Page 270 and 271:
Page 272 and 273:
Page 274 and 275:
Page 276 and 277:
Page 278 and 279:
Page 280 and 281:
Page 282 and 283:
Page 284 and 285:
Page 286 and 287:
Page 288 and 289:
Page 290 and 291:
Page 292 and 293:
Page 294 and 295:
Page 296 and 297:
Page 298 and 299:
Page 300 and 301:
Page 302 and 303:
Page 304 and 305:
Page 306 and 307:
Page 308 and 309:
Page 310 and 311:
Page 312 and 313:
Page 314 and 315:
Page 316 and 317:
Page 318 and 319:
Page 320 and 321:
Exercises 3068. Write a panel with
Page 322 and 323:
Exercises 308
Page 324 and 325:
Quiz 31011. Explain how Timers are
Page 326 and 327:
CHAPTER 7. ARRAYS 312}int id number
Page 328 and 329:
CHAPTER 7. ARRAYS 314Note that the
Page 330 and 331:
CHAPTER 7. ARRAYS 316int[] primes =
Page 332 and 333:
CHAPTER 7. ARRAYS 318(There is one
Page 334 and 335:
CHAPTER 7. ARRAYS 320}return null;d
Page 336 and 337:
CHAPTER 7. ARRAYS 322} // end birth
Page 338 and 339:
CHAPTER 7. ARRAYS 324public void pa
Page 340 and 341:
CHAPTER 7. ARRAYS 326variable arity
Page 342 and 343:
CHAPTER 7. ARRAYS 328order. (This i
Page 344 and 345:
shapes.length shapes[0] shapesCHAPT
Page 346 and 347:
CHAPTER 7. ARRAYS 332*/public int g
Page 348 and 349:
CHAPTER 7. ARRAYS 334• list.size(
Page 350 and 351:
CHAPTER 7. ARRAYS 336If g is a vari
Page 352 and 353:
CHAPTER 7. ARRAYS 338type ArrayList
Page 354 and 355:
CHAPTER 7. ARRAYS 340// Draw a line
Page 356 and 357:
CHAPTER 7. ARRAYS 342* Searches the
Page 358 and 359:
CHAPTER 7. ARRAYS 344associates a p
Page 360 and 361:
CHAPTER 7. ARRAYS 346it’s really
Page 362 and 363:
CHAPTER 7. ARRAYS 348static void se
Page 364 and 365:
CHAPTER 7. ARRAYS 350}for (int last
Page 366 and 367:
CHAPTER 7. ARRAYS 352follow the sam
Page 368 and 369:
CHAPTER 7. ARRAYS 354double totalPr
Page 370 and 371:
BLACK BLACK BLACK BLACK 1 BLACK BLA
Page 372 and 373:
CHAPTER 7. ARRAYS 358/*** Return an
Page 374 and 375:
CHAPTER 7. ARRAYS 360*/private bool
Page 376 and 377:
Page 378 and 379:
Exercises 364If ball is a variable
Page 380 and 381:
Exercises 366}word += "\’" + Text
Page 382 and 383:
Quiz 368Quiz on Chapter 7(answers)1
Page 384 and 385:
Chapter 8Correctness and Robustness
Page 386 and 387:
CHAPTER 8. CORRECTNESS AND ROBUSTNE
Page 388 and 389:
Page 390 and 391:
Page 392 and 393:
Page 394 and 395:
Page 396 and 397:
Page 398 and 399:
Throwable ErrorSocketException EOFE
Page 400 and 401:
Page 402 and 403:
Page 404 and 405:
Page 406 and 407:
Page 408 and 409:
Page 410 and 411:
Page 412 and 413:
Page 414 and 415:
Page 416 and 417:
Page 418 and 419:
Page 420 and 421:
Page 422 and 423:
Page 424 and 425:
Page 426 and 427:
Page 428 and 429:
Page 430 and 431:
Page 432 and 433:
Exercises 418L 50XL 40Write a class
Page 434 and 435:
Exercises 420number of divisors. No
Page 436 and 437:
Quiz 422Theincrement() method is sy
Page 438 and 439:
CHAPTER 9. LINKED DATA STRUCTURES A
Page 440 and 441:
Page 442 and 443:
Page 444 and 445:
Page 446 and 447:
Page 448 and 449:
Page 450 and 451:
Whenanobjectcontainsareferencetoano
Page 452 and 453:
Page 454 and 455:
Page 456 and 457:
Page 458 and 459:
Page 460 and 461:
Page 462 and 463:
ortheother.The"enqueue"operationadd
Page 464 and 465:
Page 466 and 467:
Page 468 and 469:
Page 470 and 471:
RootNode412 3 null 56CHAPTER 9. LIN
Page 472 and 473:
Page 474 and 475:
Page 476 and 477:
Page 478 and 479:
Page 480 and 481:
Page 482 and 483:
Page 484 and 485:
Page 486 and 487:
Page 488 and 489:
Page 490 and 491:
Exercises 476Write a subroutine tha
Page 492 and 493:
Quiz 478Quiz on Chapter 9(answers)1
Page 494 and 495:
Chapter 10Generic Programming andCo
Page 496 and 497:
CHAPTER 10. GENERIC PROGRAMMING AND
Page 498 and 499:
Page 500 and 501:
Page 502 and 503:
Page 504 and 505:
Page 506 and 507:
Page 508 and 509:
Page 510 and 511:
Page 512 and 513:
Page 514 and 515:
Page 516 and 517:
Page 518 and 519:
Page 520 and 521:
Page 522 and 523:
Page 524 and 525:
Page 526 and 527:
Page 528 and 529:
Page 530 and 531:
Page 532 and 533:
Page 534 and 535:
Page 536 and 537:
Page 538 and 539:
Page 540 and 541:
Page 542 and 543:
Exercises 528program WordCount.java
Page 544 and 545:
Quiz 530Quiz on Chapter 10(answers)
Page 546 and 547:
CHAPTER 11. FILES AND NETWORKING 53
Page 548 and 549:
Page 550 and 551:
Page 552 and 553:
Page 554 and 555:
Page 556 and 557:
Page 558 and 559:
Page 560 and 561:
Page 562 and 563:
Page 564 and 565:
Page 566 and 567:
Page 568 and 569:
Page 570 and 571:
Page 572 and 573:
Page 574 and 575:
Page 576 and 577:
Page 578 and 579:
Page 580 and 581:
Page 582 and 583:
Page 584 and 585:
Page 586 and 587:
Page 588 and 589:
Page 590 and 591:
Page 592 and 593:
Page 594 and 595:
Page 596 and 597:
Page 598 and 599:
Page 600 and 601:
Page 602 and 603:
Page 604 and 605:
Page 606 and 607:
Page 608 and 609:
Page 610 and 611:
Page 612 and 613:
Page 614 and 615:
Page 616 and 617:
Exercises 602board = newBoard; // S
Page 618 and 619:
Chapter 12Advanced GUI ProgrammingI
Page 620 and 621:
CHAPTER 12. ADVANCED GUI PROGRAMMIN
Page 622 and 623:
Page 624 and 625:
Page 626 and 627:
Page 628 and 629:
Page 630 and 631:
Page 632 and 633:
illustration:AscentLeading DescentL
Page 634 and 635:
Page 636 and 637:
Page 638 and 639:
Page 640 and 641:
Page 642 and 643:
Page 644 and 645:
Page 646 and 647:
Page 648 and 649:
Page 650 and 651:
Page 652 and 653:
Page 654 and 655:
Page 656 and 657:
Page 658 and 659:
Page 660 and 661:
Page 662 and 663:
Page 664 and 665:
Page 666 and 667:
Page 668 and 669:
Page 670 and 671:
Page 672 and 673:
Page 674 and 675:
Page 676 and 677:
Page 678 and 679:
Page 680 and 681:
Exercises 666This method must also
Page 682 and 683:
Appendix: Source FilesThis section
Page 684 and 685:
Source Code Listing 670• ReverseW
Page 686 and 687:
Source Code Listing 672• RandomSt
Page 688 and 689:
Source Code Listing 674the document
Page 690:
Source Code Listing 676general enou
show all

Introduction to Programming Using Java - Department of ...

Create successful ePaper yourself

Delete template?

Save as template?