| 000 | 01321camuu22003494a 4500 | |
| 001 | 000000794633 | |
| 005 | 20021125141056 | |
| 008 | 000926s2001 enka b 001 0 eng | |
| 010 | ▼a 00047759 | |
| 020 | ▼a 047189978X (pbk. : alk. paper) | |
| 040 | ▼a DLC ▼c DLC ▼d MUQ ▼d 211009 | |
| 042 | ▼a pcc | |
| 049 | 1 | ▼l 121067310 ▼f 과학 |
| 050 | 0 0 | ▼a QA76.73.J38 ▼b W384 2001 |
| 082 | 0 0 | ▼a 005.13/3 ▼2 21 |
| 090 | ▼a 005.133 ▼b W344j | |
| 100 | 1 | ▼a Watt, David A. ▼q (David Anthony) |
| 245 | 1 0 | ▼a Java collections : ▼b an introduction to abstract data types, data structures, and algorithms / ▼c David A. Watt, Deryck F. Brown. |
| 260 | ▼a Chichester [England] ; ▼a New York : ▼b John Wiley, ▼c c2001. | |
| 300 | ▼a xvi, 549 p. : ▼b ill. ; ▼c 24 cm. | |
| 504 | ▼a Includes bibliographical references and index. | |
| 650 | 0 | ▼a Java (Computer program language) |
| 650 | 0 | ▼a Abstract data types (Computer science) |
| 650 | 0 | ▼a Data structures (Computer science) |
| 650 | 0 | ▼a Computer algorithms. |
| 650 | 6 | ▼a Java (Langage de programmation) |
| 650 | 6 | ▼a Types abstraits de donn?es (Informatique) |
| 650 | 6 | ▼a Structures de donn?es (Informatique) |
| 650 | 6 | ▼a Algorithmes |
| 700 | 1 | ▼a Brown, Deryck F. |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 005.133 W344j | 등록번호 121067310 (2회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
Paying close attention to the Java 2 collection classes, this book is designed to give programmers the ability to choose the best collection classes for each application. The focus of the book is on abstract data types (ADTs) that turn up again and again in software design. It will use these ADTs to introduce the data structures required to implement them and the algorithms associated with the data structures.
Suitable for a first course in algorithms and data structures, or a second course in programming using Java, this text offers a unique angle by concentrating on the in-built collection classes in Java 2, enabling more emphasis on software design, and less on theory.
Primarily targetted at students of computer science or information technology, but also of interest to professional programmers and software engineers who are retraining to program in Java.
Mit diesem Buch lernen Java-Programmierer, Containerklassen auszuwahlen, die fur spezielle Applikationen optimal geeignet sind. Im Mittelpunkt stehen abstrakte Datentypen (ADT), die im Software-Design sehr haufig auftreten. Eingefuhrt werden sowohl Datenstrukturen als auch die Algorithmen zu deren Implementation, wobei ein besonderes Augenmerk auf die Java 2-Containerklassen gelegt wird. Die praktische Herangehensweise motiviert dazu, Strukturen und Algorithmen im Kontext zu studieren.
New feature
Java Collections is an introductory text on abstract data types, data structures, and algorithms using Java. Written at an appropriate level for a first course in algorithms and data structures, or a second course in programming using Java, this text concentrates on pratical matters like software design and the Jave Collections framework. Only essential supporting theory is included.The text focuses on abstract data types (ADTs) that turn up again and again in software design. It uses these ADTs to introduce and motivate the data structures required to implement them and the algorithms associated with the data structures. This approach helps Java programmers to choose the most suitable collection classes for their applications.
Not only undergraduate students but also professional programmers retraining the program in Java will benefit form this even-paced and example-led text.
Key features of the text:
* emphasizes good object-oriented software design and implementation
* presents algorithms both in English and in Java, and shows how to analyze their efficiency (with only light mathematics)
* introduces the concept of an abstract data type, shows how to use a "contract" to specify the abstract data type's contract and its implementation in terms of a suitbale data structure and algorithms
* covers a variety of abstract data types (stacks, queues, lists, sets, maps, priority queues, trees, and graphs), compares alternative implementations of these abstract types, and relates them to the Java collection classes
* features numerous examples and case studies showing how the abstract data types are used in practical applciaitons
* contains numerous graded exercises, offering opportunities to explore alternatives to the designs and implementations presented in the text
* includes appendices summarizing the mathematics of algorithm analysis, the relevant features of the Java programming language, and the Java collection classes.
정보제공 :
목차
Introduction 1
Part I: Ready, Set, Go with VMware Infrastructure 3 9
Chapter 1: Exploring VMware Infrastructure 3 as Your Virtual Solution 11
Chapter 2: Getting the Scoop on Capacity Planning 23
Chapter 3: Knowing Your Storage Options 39
Part II: Setting Up ESX Hosts 55
Chapter 4: ESX: The Brawn Behind the Brains 57
Chapter 5: ESX Installation — Now the Fun Begins 67
Part III: Connecting the Physical to Your Virtual Environment 81
Chapter 6: Embracing the Look and Feel of VMware Infrastructure Client 83
Chapter 7: Virtual Networking 95
Chapter 8: Connecting to Storage 119
Part IV: Fault Tolerance and Data Centers 137
Chapter 9: Getting VMware Virtual Center Running 139
Chapter 10: Making Virtual Machines 161
Chapter 11: Managing Virtual Machines 175
Chapter 12: Keeping Things Running with Virtual Clusters 193
Part V: Playing Virtual Adminstrator 209
Chapter 13: Securing Your System 211
Chapter 14: Swimming in Resource Pools 229
Chapter 15: Monitoring Your System 243
Chapter 16: Preparing for Disaster 259
Chapter 17: Troubleshooting 271
Part VI: The Part of Tens 281
Chapter 18: Ten Places to Discover More 283
Chapter 19: Ten Other VMware Products 295
Chapter 20: Ten Cool Virtual Appliances 307
Index 319
정보제공 :
