Sentences repository

In an environment where resources are being shared, even the same program can have varying performance characteristics at two different times. Second, many programs are extremely sensitive to their input data, and performance might fluctuate wildly depending on the input.

one may run much more efficiently on one particular kind of input and the second may run efficiently under other circumstances.

we can often use approximate analytic results in conjunction with empirical studies to predict performance accurately.

writing programs that exclusively process bits would be tiresome indeed

All of our data structures are comprised of objects and references to objects
All of our data structures consist of objects and references to objects

Our primary goal is to lay the groundwork for the development

the higher-level constructs that will serve as the basis for most of the algorithms

It is customary to refer to these basic types by their Java names

we defer consideration of character data to Section 3.6

We use a fixed number of bits to represent numbers

choosing from among the types int, long, short, or byte for integers and from among float or double for floating-point numbers

we think of the type of the data more in terms of the needs of the program than the capabilities of the machine

the operations that we perform on them

a list of sets of values (primitive or other types) and associated operations (methods).

Many of the operations associated with standard data types (for example, the arithmetic operations) are built into the Java language
All the methods associated with this Iterface are used to operate on Integer data.

These diagrams show examples of a binary tree (top left), a ternary tree (top right), a rooted tree (bottom left), and a free tree (bottom right).

A rooted tree is one where we designate one node as the root of a tree

even though this convention seems unnatural at first

father children sibling

That is, a binary tree is a special type of ordered tree, an ordered tree is a special type of rooted tree, and a rooted tree is a special type of free tree

The different types of trees arise naturally in various applications

This definition makes it plain that ...

we are working with just one concrete realization of that abstraction

This alternative is analogous to a doubly linked list

The binary-tree representation depicted in ...

Any one of these conditions is necessary and sufficient to prove the other three

 knowing different tree abstractions is often an essential ingredient in finding an efficient algorithm and corresponding data structure for a given problem
 
 we also often profit from working with the proper tree abstraction
 
 it serves as the basis for many basic algorithms for processing graphs
 
 inserting the element into the vacated position
 
 E-MAIL CONFIDENTIALITY NOTICE: This e-mail, including attachments, may include confidential patient health information and/or proprietary information, and is intended only for the use of the individual or entity to which it is addressed. If the reader of this e-mail is not the intended recipient or his or her authorized agent, the reader is hereby notified that any dissemination, distribution or copying of this e-mail is prohibited. If you have received this e-mail in error, please notify the sender by replying to this message and delete this e-mail immediately.

but there is a hidden cost that is interesting to consider

we defer considering the implementation in detail until Chapter 10

The main drawback to CGI is that it must run a new copy of the CGI-aware program
for each request. This is a relatively expensive process that can bog down
high-volume sites where thousands of requests are serviced per minute. Another
drawback is that CGI programs tend to be platform dependent. A CGI program
written for one operating system may not run on another./

Sun’s Java Servlet platform directly addresses the two main drawbacks of CGI programs.
First, servlets offer better performance and utilization of resources than
conventional CGI programs. Second, the write-once, run-anywhere nature of Java
means that servlets are portable between operating systems that have a Java Virtual
Machine (JVM).

Cookies and URL rewriting are two common ways to keep track of users between requests.

Once the servlet has been created, using it for additional requests incurs
very little overhead./
While Java servlets are a big step up from CGI programs, they are not a panacea.

This chapter explores the Struts framework in depth and highlights the benefits
Struts can bring to your development efforts.

Choosing a web application framework should not be a casual decision. Many
people will use this book, and especially this chapter, as part of evaluating Struts
for their project. Accordingly, we conclude this chapter with a candid look at the
strengths and weaknesses of the Struts framework and address concerns regarding
overall performance. Struts is designed for professional developers. To make
informed decisions, professionals need to be aware of both a tool’s capabilities
and its limitations./

Developing for the web, while rewarding, brings its own set of
challenges. Let’s take a quick look at what makes web development so challenging.

Input may even be hostile and contrived to harm the application.

Since there are so many obstacles
to writing robust web applications, using a framework is vital, lest your application
become an endless series of workarounds and kluges.

drawback shortcoming weakness

Struts has already outgrown its mailing list.

This tells us that the official reference copy of this document’s DTD can be found
at the indicated URL.