Get Data Structures And Algorithm Analysis In C++ 4th Edition Weiss Solutions Manual Free All Chapters Available
Get Data Structures And Algorithm Analysis In C++ 4th Edition Weiss Solutions Manual Free All Chapters Available
https://testbankdeal.com/product/data-structures-and-algorithm-
analysis-in-java-3rd-edition-weiss-solutions-manual/
https://testbankdeal.com/product/data-structures-and-algorithms-
in-c-2nd-edition-goodrich-solutions-manual/
https://testbankdeal.com/product/introduction-to-c-programming-and-
data-structures-4th-edition-liang-solutions-manual/
https://testbankdeal.com/product/pharmacology-for-nurses-a-
pathophysiologic-approach-5th-edition-adams-test-bank/
Business Communication Developing Leaders for a Networked
World 1st Edition Cardon Solutions Manual
https://testbankdeal.com/product/business-communication-developing-
leaders-for-a-networked-world-1st-edition-cardon-solutions-manual/
https://testbankdeal.com/product/financial-accounting-the-impact-on-
decision-makers-8th-edition-porter-solutions-manual/
https://testbankdeal.com/product/byrd-and-chens-canadian-tax-
principles-2018-2019-1st-edition-byrd-test-bank/
https://testbankdeal.com/product/contemporary-accounting-a-strategic-
approach-for-users-9th-edition-hancock-solutions-manual/
https://testbankdeal.com/product/microeconomics-2nd-edition-bernheim-
solutions-manual/
Molecular Biology of The Cell 5th edition Alberts Test
Bank
https://testbankdeal.com/product/molecular-biology-of-the-cell-5th-
edition-alberts-test-bank/
CHAPTER 6
6.2
6.3 The result of three deleteMins, starting with both of the heaps in Exercise 6.2, is as follows:
6.4 (a) 4N
(b) O(N2)
(c) O(N4.1)
(d) O(2N)
6.5
/**
* Insert item x, allowing duplicates.
*/
void insert( const Comparable & x )
{
if( currentSize == array.size( ) - 1 )
array.resize( array.size( ) * 2 );
// Percolate up
int hole = ++currentSize;
for( ; hole > 1 && x < array[ hole / 2 ]; hole /= 2 )
array[ hole ] = array[ hole / 2 ];
array[0] = array[ hole ] = x;
}
6.6 225. To see this, start with i = 1 and position at the root. Follow the path toward the last node, doubling i
when taking a left child, and doubling i and adding one when taking a right child.
6.7 (a) We show that H(N), which is the sum of the heights of nodes in a complete binary tree of N nodes, is
N − b(N), where b(N) is the number of ones in the binary representation of N. Observe that for N = 0 and
N = 1, the claim is true. Assume that it is true for values of k up to and including N − 1. Suppose the left and
right subtrees have L and R nodes, respectively. Since the root has height log N , we have
H (N ) = log N + H (L) + H (R )
= log N + L − b(L) + R − b(R)
= N − 1 + ( Log N − b(L) − b(R) )
The second line follows from the inductive hypothesis, and the third follows because L + R = N − 1. Now the
last node in the tree is in either the left subtree or the right subtree. If it is in the left subtree, then the right
subtree is a perfect tree, and b(R) = log N − 1 . Further, the binary representation of N and L are identical,
with the exception that the leading 10 in N becomes 1 in L. (For instance, if N = 37 = 100101, L = 10101.) It
is clear that the second digit of N must be zero if the last node is in the left subtree. Thus in this case,
H(N) = N − b(N)
If the last node is in the right subtree, then b(L) = log N . The binary representation of R is identical to
N, except that the leading 1 is not present. (For instance, if N = 27 = 101011, L = 01011.) Thus
H(N) = N − b(N)
(b) Run a single-elimination tournament among eight elements. This requires seven comparisons and
The eighth comparison is between b and c. If c is less than b, then b is made a child of c. Otherwise, both
(c) A recursive strategy is used. Assume that N = 2k. A binomial tree is built for the N elements as in part (b).
The largest subtree of the root is then recursively converted into a binary heap of 2 k − 1 elements. The last
element in the heap (which is the only one on an extra level) is then inserted into the binomial queue
consisting of the remaining binomial trees, thus forming another binomial tree of 2 k − 1 elements. At that
point, the root has a subtree that is a heap of 2 k − 1 − 1 elements and another subtree that is a binomial tree of
2k−1 elements. Recursively convert that subtree into a heap; now the whole structure is a binary heap. The
running time for N = 2k satisfies T(N) = 2T(N/2) + log N. The base case is T(8) = 8.
6.8 a) Since each element in a min heap has children whose elements are greater than the value in the
element itself, the maximum element has no children and is a leaf.
c) Since the maximum element can be any leaf (the position of a node is determined entirely by the
value of its parent and children), all leaves must be examined to find the maximum value in a min
heap.
6.9 Let D1, D2, . . . ,Dk be random variables representing the depth of the smallest, second smallest, and kth
smallest elements, respectively. We are interested in calculating E(Dk). In what follows, we assume that the
heap size N is one less than a power of two (that is, the bottom level is completely filled) but sufficiently
large so that terms bounded by O(1/N) are negligible. Without loss of generality, we may assume that the kth
smallest element is in the left subheap of the root. Let pj, k be the probability that this element is the jth
Lemma.
k −1
For k > 1, E (Dk ) = p j ,k (E (D j ) + 1) .
j =1
Proof.
An element that is at depth d in the left subheap is at depth d + 1 in the entire subheap. Since
Since by assumption, the bottom level of the heap is full, each of second, third, . . . , k − 1th smallest
elements are in the left subheap with probability of 0.5. (Technically, the probability should be half − 1/(N −
1) of being in the right subheap and half + 1/(N − 1) of being in the left, since we have already placed the kth
smallest in the right. Recall that we have assumed that terms of size O(1/N) can be ignored.) Thus
1 k − 2
p j ,k = pk − j ,k = k −2
2 j −1
Theorem.
E(Dk) log k.
Proof.
The proof is by induction. The theorem clearly holds for k = 1 and k = 2. We then show that it holds for
arbitrary k > 2 on the assumption that it holds for all smaller k. Now, by the inductive hypothesis, for any
1 j k − 1,
Thus
Thus
k −1
E ( Dk ) 1 + p j , k log ( k 2)
j =1
k −1
1 + log ( k 2) p j , k
j =1
1 + log ( k 2)
log k
(b) Works for leftist and skew heaps. The running time is O(Kd) for d-heaps.
6.12 Simulations show that the linear time algorithm is the faster, not only on worst-case inputs, but also on
random data.
6.13 (a) If the heap is organized as a (min) heap, then starting at the hole at the root, find a path down to a leaf by
taking the minimum child. The requires roughly log N comparisons. To find the correct place where to move
the hole, perform a binary search on the log N elements. This takes O(log log N) comparisons.
(b) Find a path of minimum children, stopping after log N − log log N levels. At this point, it is easy to
determine if the hole should be placed above or below the stopping point. If it goes below, then continue
finding the path, but perform the binary search on only the last log log N elements on the path, for a total of
log N + log log log N comparisons. Otherwise, perform a binary search on the first log N − log log N
elements. The binary search takes at most log log N comparisons, and the path finding took only log N − log
log N, so the total in this case is log N. So the worst case is the first case.
(c) The bound can be improved to log N + log*N + O(1), where log*N is the inverse Ackerman function (see
6.14 The parent is at position (i + d − 2) d . The children are in positions (i − 1)d + 2, . . . , id + 1.
(d) d = max(2, M/N). (See the related discussion at the end of Section 11.4.)
6.16 Starting from the second most signficant digit in i, and going toward the least significant digit, branch left for
6.17 (a) Place negative infinity as a root with the two heaps as subtrees. Then do a deleteMin.
(b) Place negative infinity as a root with the larger heap as the left subheap, and the smaller heap as the right
(c) SKETCH: Split the larger subheap into smaller heaps as follows: on the left-most path, remove two
subheaps of height r − 1, then one of height r, r + 1, and so one, until l − 2. Then merge the trees, going
smaller to higher, using the results of parts (a) and (b), with the extra nodes on the left path substituting for
6.18 a. The minimum element will be the root. The maximum element will be one of the two children of the root.
b. Place the new element in the last open position (as in a regular heap). Now compare it to its parent. Now if
the new element was inserted into a max(min) row and was less (greater) than its parent. Then swap it with
its parent and now it need only be compared to other min elements and bubbled up min elements. If it is
greater (less) than its parent it need only be compared to other max elements bubbled up using the max
elements.
c) For a min deletion, remove the root . Let the last element in the heap be x . If the root has no children, then
x becomes the root. If find m the minimum child or grandchild of the root. If k Y m, then x becomes the
root. Other wise if m is the child of the root the m becomes the root and x is inserted in place of m. Finally if
m is the grandchild of the root, then m is moved to the root and if p is the parent of m, then if x > is p, then p
and x are interchanged.
d) yes. (see Atkinson et al., Min-Max Heaps and Generalized Priority Queues, Programming Techniques
and Data Structures, Vol 29, No. 10, pp. 996 - 1000, 1986.)
6.20
6.21 This theorem is true, and the proof is very much along the same lines as Exercise 4.20.
6.22 If elements are inserted in decreasing order, a leftist heap consisting of a chain of left children is formed. This
6.23 (a) If a decreaseKey is performed on a node that is very deep (very left), the time to percolate up would be
prohibitive. Thus the obvious solution doesn’t work. However, we can still do the operation efficiently by a
combination of remove and insert. To remove an arbitrary node x in the heap, replace x by the merge of its
left and right subheaps. This might create an imbalance for nodes on the path from x’s parent to the root that
would need to be fixed by a child swap. However, it is easy to show that at most logN nodes can be affected,
6.24 Lazy deletion in leftist heaps is discussed in the paper by Cheriton and Tarjan [10]. The general idea is that if
the root is marked deleted, then a preorder traversal of the heap is formed, and the frontier of marked nodes is
removed, leaving a collection of heaps. These can be merged two at a time by placing all the heaps on a
queue, removing two, merging them, and placing the result at the end of the queue, terminating when only
6.25 (a) The standard way to do this is to divide the work into passes. A new pass begins when the first element
reappears in a heap that is dequeued. The first pass takes roughly 2*1*(N/2) time units because there are N/2
merges of trees with one node each on the right path. The next pass takes 2*2*(N/4) time units because of the
roughly N/4 merges of trees with no more than two nodes on the right path. The third pass takes 2*3*(N/8)
6.27
6.28 This claim is also true, and the proof is similar in spirit to Exercise 4.20 or 6.21.
6.29 Yes. All the single operation estimates in Exercise 6.25 become amortized instead of worst-case, but by the
definition of amortized analysis, the sum of these estimates is a worst-case bound for the sequence.
6.30 Clearly the claim is true for k = 1. Suppose it is true for all values i = 1, 2, . . . , k. A Bk + 1 tree is formed by
attaching a Bk tree to the root of a Bk tree. Thus by induction, it contains a B0 through Bk − 1 tree, as well as the
6.31 Proof is by induction. Clearly the claim is true for k = 1. Assume true for all values i = 1, 2, . . . ,k. A Bk + 1
k
tree is formed by attaching a Bk tree to the original Bk tree. The original thus had nodes at depth d. The
d
k
attached tree had nodes at depth d−1, which are now at depth d. Adding these two terms and using a
d − 1
6.34
template<typename Comparable>
struct BiQueNode
{
Comparable item;
vector<BiQueNode *> pointers;
BiQueNode<Comparable> (Comparable e) : item(e) {}
};
template <typename Comparable>
class BinomalQue
{
private:
vector<BiQueNode<Comparable>> biQue;
};
6.37
/*
Bin packing
*/
#include <vector>
#include <queue>
using namespace std;
const double Cap = 1.0;
class Bins
{
private:
vector<double> bins;
priority_queue<double> heapBins;
public:
Bins(int size = 0)
{bins.resize(size);
for (int i = 0; i < size; i++)
bins[i] = 0;
}
void clear() {bins.clear();}
int size(){ return bins.size();}
void insertFirstFit(double item) // a.
{
for (int i = 0; i < bins.size(); i++)
if (bins[i] + item < Cap)
{
bins[i] += item;
return;
}
bins.push_back(item);
}
int insertWorstFit(double item) // b
{
static int size = 0;
double maxRoom;
if (heapBins.empty())
heapBins.push(Cap - item);
else
{
maxRoom = heapBins.top();
if (maxRoom > item) // there is room
{
Visit https://testbankdead.com
now to explore a rich
collection of testbank,
solution manual and enjoy
exciting offers!
heapBins.pop();
heapBins.push(maxRoom - item);
}
else
{heapBins.push(Cap - item);
size++;
}
}
return size;
}
void insertBestFit(double item) // c
{
double gap =Cap;
int gapIndex = -1;
if (bins.size() == 0)
bins.push_back(item);
else
{
for (int i = 0; i < bins.size(); i++)
if (bins[i]+item < Cap && bins[i]+item < gap)
{
gap = Cap - bins[i] - item;
gapIndex = i;
}
if (gapIndex < 0)
bins.push_back(item);
else
bins[gapIndex] += item;
}
}
};
d. yes
6.38 Don’t keep the key values in the heap, but keep only the difference between the value of the key in a node
6.39 O(N + k log N) is a better bound than O(N log k). The first bound is O(N) if k = O(N/log N). The second
bound is more than this as soon as k grows faster than a constant. For the other values (N/log N) = k = (N),
the first bound is better. When k = (N), the bounds are identical.
Exploring the Variety of Random
Documents with Different Content
shown at o f. When the knife-edges are suitably placed the frame is
balanced, so that a small piece of paper laid at a will cause that side
to descend.
Fig. 24.
77. We suspend two small hooks from the points a and b: these
are made of fine wire, so that their weight may be left out of
consideration. With this apparatus we can in the first place verify the
principle of equality of moments: for example, if I place the hook a
at a distance of 9" from the centre o and load it with 1 lb., I find that
when b is laden with 0·5 lb. it must be at a distance of 18" from o in
order to counterbalance a; the moment in the one case is 9 × 1, in
the other 18 × 0·5, and these are obviously equal.
78. Let a weight of 1 lb. be placed on each of the hooks, the
frame will only be in equilibrium when the hooks are at precisely the
same distance from the centre. A familiar application of this principle
is found in the ordinary weighing scales; the frame, which in this
case is called a beam, is sustained by two knife-edges, smaller,
however, than those represented in the figure. The pans p, p are
suspended from the extremities of the beam, and should be at equal
distances from its centre. These scale-pans must be of equal weight,
and then, when equal weights are placed in them, the beam will
remain horizontal. If the weight in one slightly exceed that in the
other, the pan containing the heavier weight will of course descend.
79. That a pair of scales should weigh accurately, it is necessary
that the weights be correct; but even with correct weights, a balance
of defective construction will give an inaccurate result. The error
frequently arises from some inequality in the lengths of the arms of
the beam. When this is the case, the two weights which really
balance are not equal. Supposing, for instance, that with an
imperfect balance I endeavour to weigh a pound of shot. If I put the
weight on the short side, then the quantity of shot balanced is less
than 1 lb.; while if the 1 lb. weight be placed at the long side, it will
require more than 1 lb. of shot to produce equilibrium. The mode of
testing a pair of scales is then evident. Let weights be placed in the
pans which balance each other; if the weights be interchanged and
the balance still remains horizontal, it is correct.
80. Suppose, for example, that the two arms be 10 inches and 11
inches long, then, if 1 lb. weight be placed in the pan of the 10-inch
end, its moment is 10; and if ¹⁰/₁₁ of 1 lb. be placed in the pan
belonging to the 11-inch end, its moment is also 10: hence 1 lb. at
the short end balances ¹⁰/₁₁ of 1 lb. at the long end; and therefore,
if the shopkeeper placed his weight in the short arm, his customers
would lose ¹/₁₁ part of each pound for which they paid; on the other
hand, if the shopkeeper placed his 1 lb. weight on the long arm,
then not less than ¹¹/₁₀ lb. would be required in the pan belonging
to the short arm. Hence in this case the customer would get ¹/₁₀ lb.
too much. It follows, that if a shopman placed his weights and his
goods alternately in the one scale and in the other he would be a
loser on the whole; for, though every second customer gets ¹/₁₁ lb.
less than he ought, yet the others get ¹/₁₀ lb. more than they have
paid for.
LECTURE IV.
THE FORCE OF GRAVITY.
INTRODUCTION.
81. In the last three lectures we considered forces in the
abstract; we saw how they are to be represented by straight lines,
how compounded together and how decomposed into others; we
have explained what is meant by forces being in equilibrium, and we
have shown instances where the forces lie in the same plane or in
different planes, and where they intersect or are parallel to each
other. These subjects are the elements of mechanics; they form the
framework which in this and subsequent lectures we shall try to
present in a more attractive garb. We shall commence by studying
the most remarkable force in nature, a force constantly in action,
and one to which all bodies are subject, a force which distance
cannot annihilate, and one the properties of which have led to the
most sublime discoveries of human intellect. This is the force of
gravity.
82. If I drop a stone from my hand, it falls to the ground. That
which produces motion is a force: hence the stone must have been
acted upon by a force which drew it to the ground. On every part of
the earth’s surface experience shows that a body tends to fall. This
fact proves that there is an attractive force in the earth tending to
draw all bodies towards it.
Fig. 25.
83. Let a b c d (Fig. 25) be points from which stones are let fall,
and let the circle represent the section of the earth; let p q r s be the
points at the surface of the earth upon which the stones will drop
when allowed to do so. The four stones will move in the directions of
the arrows: from a to p the stone moves in an opposite direction to
the motion from c to r; from b to q it moves from right to left, while
from d to s it moves from left to right. The movements are in
different directions; but if I produce these directions, as indicated by
the dotted lines, they each pass through the centre o.
84. Hence each stone in falling moves towards the centre of the
earth, and this is consequently the direction of the force. We
therefore assert that the earth has an attraction for the stone, in
consequence of which it tries to get as near the earth’s centre as
possible, and this attraction is called the force of gravitation.
85. We are so excessively familiar with the phenomenon of
seeing bodies fall that it does not excite our astonishment or arouse
our curiosity. A clap of thunder, which every one notices, because
much less frequent, is not really more remarkable. We often look
with attention at the attraction of a piece of iron by a magnet, and
justly so, for the phenomenon is very interesting, and yet the falling
of a stone is produced by a far grander and more important force
than the force of magnetism.
86. It is gravity which causes the weight of bodies. I hold a
piece of lead in my hand: gravity tends to pull it downwards, thus
producing a pressure on my hand which I call weight. Gravity acts
with slightly varying intensity at various parts of the earth’s surface.
This is due to two distinct causes, one of which may be mentioned
here, while the other will be subsequently referred to. The earth is
not perfectly spherical; it is flattened a little at the poles;
consequently a body at the pole is nearer the general mass of the
earth than a body at the equator; therefore the body at the pole is
more attracted, and seems heavier. A mass which weighs 200 lbs. at
the equator would weigh one pound more at the pole: about one-
third of this increase is due to the cause here pointed out. (See
Lecture XVII.)
87. Gravity is a force which attracts every particle of matter; it
acts not merely on those parts of a body which lie on the surface,
but it equally affects those in the interior. This is proved by observing
that a body has the same weight, however its shape be altered: for
example, suppose I take a ball of putty which weighs 1 lb., I shall
find that its weight remains unchanged when the ball is flattened
into a thin plate, though in the latter case the surface, and therefore
the number of superficial particles, is larger than it was in the
former.
SPECIFIC GRAVITY.
88. Gravity produces different effects upon different substances.
This is commonly expressed by saying that some substances are
heavier than others; for example, I have here a piece of wood and a
piece of lead of equal bulk. The lead is drawn to the earth with a
greater force than the wood. Substances are usually termed heavy
when they sink in water, and light when they float upon it. But a
body sinks in water if it weighs more than an equal bulk of water,
and floats if it weigh less. Hence it is natural to take water as a
standard with which the weights of other substances may be
compared.
89. I take a certain volume, say a cubic inch of cast iron such as
this I hold in my hand, and which has been accurately shaped for
the purpose. This cube is heavier than one cubic inch of water, but I
shall find that a certain quantity of water is equal to it in weight;
that is to say, a certain number of cubic inches of water, and it may
be fractional parts of a cubic inch, are precisely of the same weight.
This number is called the specific gravity of cast iron.
90. It would be impossible to counterpoise water with the iron
without holding the water in a vessel, and the weight of the vessel
must then be allowed for. I adopt the following plan. I have here a
number of inch cubes of wood (Fig. 26), which would each be lighter
than a cubic inch of water, but I have weighted the wooden cubes
by placing grains of shot into holes bored into the wood. The weight
of each cube has thus been accurately adjusted to be equal to that
of a cubic inch of water. This may be tested by actual weighing. I
weigh one of the cubes and find it to be 252 grains, which is well
known to be the weight of a cubic inch of water.
Fig. 26.
91. But the cubes may be shown to be identical in weight with
the same bulk of water by a simpler method. One of them placed in
water should have no tendency to sink, since it is not heavier than
water, nor on the other hand, since it is not lighter, should it have
any tendency to float. It should then remain in the water in
whatever position it may be placed. It is difficult to prepare one of
these cubes so accurately that this result should be attained, and it
is impossible to ensure its continuance for any time owing to
changes of temperature and the absorption of water by the wood.
We can, however, by a slight modification, prove that one of these
cubes is at all events nearly equal in weight to the same bulk of
water. In Fig. 26 is shown a tall glass jar filled with a fluid in
appearance like plain water, but it is really composed in the following
manner. I first poured into the jar a very weak solution of salt and
water, which partially filled it; I then poured gently upon this a little
pure water, and finally filled up the jar with water containing a little
spirits of wine: the salt and water is a little heavier than pure water,
while the spirit and water is a little lighter. I take one of the cubes
and drop it gently into the glass; it falls through the spirit and water,
and after making a few oscillations settles itself at rest in the
stratum shown in the figure. This shows that our prepared cube is a
little heavier than spirit and water, and a little lighter than salt and
water, and hence we infer that it must at all events be very near the
weight of pure water which lies between the two. We have also a
number of half cubes, quarter cubes, and half-quarter cubes, which
have been similarly prepared to be of equal weight with an equal
bulk of water.
92. We shall now be able to measure the specific gravity of a
substance. In one pan of the scales I place the inch cube of cast
iron, and I find that 7¼ of the wooden cubes, which we may call
cubes of water, will balance it. We therefore say that the specific
gravity of iron is 7¼. The exact number found by more accurate
methods is 7·2. It is often convenient to remember that 23 cubic
inches of cast iron weigh 6 lbs., and that therefore one cubic inch
weighs very nearly ¼ lb.
93. I have also cubes of brass, lead, and ivory; by counterpoising
them with the cubes of water, we can easily find their specific
gravities; they are shown together with that of cast iron in the
following table:—
Substance. Specific Gravity.
Cast Iron 7·2
Brass 8·1
Lead 11·3
Ivory 1·8
94. The mode here adopted of finding specific gravities is entirely
different from the far more accurate methods which are commonly
used, but the explanation of the latter involve more difficult
principles than those we have been considering. Our method rather
offers an explanation of the nature of specific gravity than a good
means of determining it, though, as we have seen, it gives a result
sufficiently near the truth for many purposes.
Fig. 31.
113. The nature of friction may be understood by Fig. 31, which
represents a section of the top of a table of wood or any other
substance levelled so that c d is horizontal; on the table rests a block
a of wood or any other substance. To a a cord is attached, which,
after passing over a pulley p, is stretched by a suspended weight b.
If the magnitude of b exceeds a certain limit, then a is pulled along
the table and b descends; but if b be smaller than this limit, both a
and b remain at rest. When b is not heavy enough to produce motion
it is supported by the tension of the cord, which is itself neutralized
by the friction produced by a certain coherence between a and the
table. Friction is by this experiment proved to be a force, because it
prevents the motion of b. Indeed friction is generally manifested as a
force by destroying motion, though sometimes indirectly producing
it.
114. The true source of the force lies in the inevitable roughness
of all known surfaces, no matter how they may have been wrought.
The minute asperities on one surface are detained in corresponding
hollows in the other, and consequently force must be exerted to
make one surface slide upon the other. By care in polishing the
surfaces the amount of friction may be diminished; but it can only be
decreased to a certain limit, beyond which no amount of polishing
seems to produce much difference.
115. The law of friction under different conditions must be
inquired into, in order that we may make allowance when its effect is
of importance. The discussion of the experiments is sometimes a
little difficult, and the truths arrived at are principally numerical, but
we shall find that some interesting laws of nature will appear.
Table I.—Friction.
Smooth horizontal surface of pine 72" × 11";
slide also of pine 9" × 9"; grain crosswise;
slide is not started; force acting on slide is
gradually increased until motion
commences.
Load on
Force Force
slide
necessary necessary
Number of in lbs., Mean
to move to move
Experiment. including values.
slide. slide.
weight
1st Series. 2nd Series.
of slide
1 14 5 8 6·5
2 28 15 16 15·5
3 42 20 15 17·5
4 56 29 24 26·5
5 70 33 31 32·0
6 84 43 33 38·0
7 98 42 38 40·0
8 112 50 33 41·5
Table II.—Friction.
Smooth horizontal surface of pine 72" × 11";
slide also of pine 9" × 9"; grain crosswise;
slide started; force applied is sufficient to
maintain uniform motion of the slide.
Load on
Force Force
slide
necessary to necessary to
Number of in lbs., Mean
maintain maintain
Experiment. including values.
motion. motion.
weight
1st Series. 2nd Series.
of slide
1 14 4·9 4·9 4·9
2 28 8·5 8·6 8·5
3 42 12·6 12·4 12·5
4 56 16·3 16·2 16·2
5 70 19·7 20·0 19·8
6 84 23·7 23·0 23·4
7 98 26·5 26·1 26·3
8 112 29·7 29·9 29·8
FRICTION IS PROPORTIONAL TO
THE PRESSURE.
130. Having ascertained the values of the force of friction for
eight different weights, we proceed to inquire into the laws which
may be founded on our results. It is evident that the friction
increases with the load, of which it is always greater than a fourth,
and less than a third. It is natural to surmise that the friction (F) is
really a constant fraction of the load (R)—in other words, that
F = kR, where k is a constant number.
131. To test this supposition we must try to determine k; it may
be ascertained by dividing any value of F by the corresponding value
of R. If this be done, we shall find that each of the experiments
yields a different quotient; the first gives 0·336, and the last 0·262,
while the other experiments give results between these extreme
values. These numbers are tolerably close together, but there is still
sufficient discrepancy to show that it is not strictly true to assert that
the friction is proportional to the load.
132. But the law that the friction varies proportionally to the
pressure is so approximately true as to be sufficient for most
practical purposes, and the question then arises, which of the
different values of k shall we adopt? By a method which is described
in the Appendix we can determine a value for k which, while it does
not represent any one of the experiments precisely, yet represents
them collectively better than it is possible for any other value to do.
The number thus found is 0·27. It is intermediate between the two
values already stated to be extreme. The character of this result is
determined by an inspection of Table III.
The fourth column of this table has been calculated from the
formula F = 0·27 R. Thus, for example, in experiment 5, the friction
of a load of 70 lbs. is 19·4 lbs., and the product of 70 and 0·27 is
18·9, which is 0·5 lb. less than the true amount. In the last column
of this table the discrepancies between the observed and the
calculated values are recorded, for facility of comparison. It will be
observed that the greatest difference is under 1 lb.
Table III.—Friction.
Friction of pine upon pine; the mean values of
the friction given in Table II. (corrected for
the friction of the pulley) compared with
the formula F = 0·27 R.
R.
Discrepancies
Total Corrected F.
between the
Number of load mean Calculated
observed and
Experiment. on value of value
calculated
slide in friction. of friction.
frictions.
lbs.
1 14 4·7 3·8 -0·9
2 28 8·2 7·6 -0·6
3 42 12·2 11·3 -0·9
4 56 15·8 15·1 -0·7
5 70 19·4 18·9 -0·5
6 84 23·0 22·7 -0·3
7 98 25·8 26·5 +0·7
8 112 29·3 30·2 +0·9
F = 1·44 + 0·252 R.
This formula is compared with the experiments in Table IV.
Table IV.—Friction.
Friction of pine upon pine; the mean values of
the friction given in Table II. (corrected for
the friction of the pulley) compared with
the formula F = 1·44 + 0·252 R.
R.
Discrepancies
Total Corrected F.
between the
Number of load mean Calculated
observed and
Experiment. on value of value
calculated
slide in friction. of friction.
frictions.
lbs.
1 14 4·7 5·0 +0·3
2 28 8·2 8·5 +0·3
3 42 12·2 12·0 -0·2
4 56 15·8 15·6 -0·2
5 70 19·4 19·1 -0·3
6 84 23·0 22·6 -0·4
7 98 25·8 26·1 +0·3
8 112 29·3 29·7 +0·4
Table V.—Friction.
Friction of pine upon pine; the mean values of
the friction given in Table II. (corrected for
the friction of the pulley) compared with
the formula F = 0·288 R
R.
Discrepancies
Total Corrected F.
between the
Number of load mean Calculated
observed and
Experiment. on value of value
calculated
slide in friction. of friction.
frictions.
lbs.
1 14 4·7 4·0 -0·7
2 28 8·2 8·1 -0·1
3 42 12·2 12·1 -0·1
4 56 15·8 16·1 +0·3
Table VI.—Friction.
Friction of pine upon pine; the mean values of
the friction given in Table II. (corrected for
the friction of the pulley) compared with
the formula F = 0·9 + 0·266 R.
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
testbankdeal.com