Full Download Test Bank Get the Latest Study Materials at testbankfan.

com

C++ Programming From Problem Analysis to Program

Design 7th Edition Malik Solutions Manual

https://testbankfan.com/product/c-programming-from-problem-
analysis-to-program-design-7th-edition-malik-solutions-
manual/

OR CLICK HERE

DOWLOAD NOW

Download More Test Banks for All Subjects at https://testbankfan.com

 Recommended digital products (PDF, EPUB, MOBI) that
you can download immediately if you are interested.

C++ Programming From Problem Analysis to Program Design

7th Edition Malik Test Bank

https://testbankfan.com/product/c-programming-from-problem-analysis-
to-program-design-7th-edition-malik-test-bank/

testbankfan.com

C++ Programming From Problem Analysis to Program Design

6th Edition Malik Solutions Manual

https://testbankfan.com/product/c-programming-from-problem-analysis-
to-program-design-6th-edition-malik-solutions-manual/

testbankfan.com

C++ Programming From Problem Analysis to Program Design

8th Edition Malik Solutions Manual

https://testbankfan.com/product/c-programming-from-problem-analysis-
to-program-design-8th-edition-malik-solutions-manual/

testbankfan.com

Marketing Canadian 10th Edition Crane Solutions Manual

https://testbankfan.com/product/marketing-canadian-10th-edition-crane-
solutions-manual/

testbankfan.com
Experiencing the Lifespan 4th Edition Belsky Test Bank

https://testbankfan.com/product/experiencing-the-lifespan-4th-edition-
belsky-test-bank/

testbankfan.com

Investment Analysis and Portfolio Management Canadian 1st

Edition Reilly Test Bank

https://testbankfan.com/product/investment-analysis-and-portfolio-
management-canadian-1st-edition-reilly-test-bank/

testbankfan.com

Seeleys Anatomy and Physiology 10th Edition VanPutte Test

Bank

https://testbankfan.com/product/seeleys-anatomy-and-physiology-10th-
edition-vanputte-test-bank/

testbankfan.com

Foundations of Social Policy Social Justice in Human

Perspective 6th Edition Barusch Test Bank

https://testbankfan.com/product/foundations-of-social-policy-social-
justice-in-human-perspective-6th-edition-barusch-test-bank/

testbankfan.com

Strategic Management Concepts and Cases 1st Edition Ali

Solutions Manual

https://testbankfan.com/product/strategic-management-concepts-and-
cases-1st-edition-ali-solutions-manual/

testbankfan.com
Physical Chemistry Quantum Chemistry and Molecular
Interactions 1st Edition Andrew Cooksy Solutions Manual

https://testbankfan.com/product/physical-chemistry-quantum-chemistry-
and-molecular-interactions-1st-edition-andrew-cooksy-solutions-manual/

testbankfan.com
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-1

Chapter 8
Arrays and Strings
A Guide to this Instructor’s Manual:

We have designed this Instructor’s Manual to supplement and enhance your teaching
experience through classroom activities and a cohesive chapter summary.

This document is organized chronologically, using the same headings that you see in the
textbook. Under the headings you will find: lecture notes that summarize the section, Teacher
Tips, Classroom Activities, and Lab Activities. Pay special attention to teaching tips and
activities geared towards quizzing your students and enhancing their critical thinking skills.

In addition to this Instructor’s Manual, our Instructor’s Resources also contain PowerPoint
Presentations, Test Banks, and other supplements to aid in your teaching experience.

At a Glance

Instructor’s Manual Table of Contents

• Overview

• Objectives

• Teaching Tips

• Quick Quizzes

• Class Discussion Topics

• Additional Projects

• Additional Resources

• Key Terms

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-2

Lecture Notes

Overview
The next few chapters will introduce and focus on structured data types. Chapter 8
discusses the array data type in detail. Students will become familiar with declaring and
manipulating arrays, as well as using arrays as parameters. They will also learn about
the limitations of arrays. Students will examine character arrays and learn how to
process them using string functions. Finally, this chapter examines more complex array
types, including parallel and multidimensional arrays.

Objectives
In this chapter, the student will:
• Learn the reasons for arrays
• Explore how to declare and manipulate data into arrays
• Understand the meaning of ‘‘array index out of bounds’’
• Learn how to declare and initialize arrays
• Become familiar with the restrictions on array processing
• Discover how to pass an array as a parameter to a function
• Learn how to search an array
• Learn how to sort an array
• Become aware of auto declarations
• Learn about range-based for loops
• Learn about C-strings
• Examine the use of string functions to process C-strings
• Discover how to input data into—and output data from—a C-string
• Learn about parallel arrays
• Discover how to manipulate data in a two-dimensional array
• Learn about multidimensional arrays

Teaching Tips
Introduction
1. Review the concept of a simple data type, and introduce the concept of a structured data
type.

2. Describe the need for an array when processing items that are the same data type and
represent the same conceptual item.

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-3

Arrays
1. Define the array data type and describe its uses. In particular, discuss the syntax of one-
dimensional arrays. Illustrate with Example 8-1.

Introduce your students to arrays by emphasizing that an array can only store
elements that are all of the same data type; in other words, they are not an all-
Teaching
purpose storage container. Point out that they will learn about more complex data
Tip
types later in the text – such as containers that hold generic data types or
complex data types with multiple variables and operations.

Accessing Array Components

1. Discuss the syntax involved in accessing array components. Review the use of the array
subscripting operator with the code snippets in this section.

Students might be confused when looking at code that performs arithmetic

operations on elements that are accessed by the array subscripting operator. Note
Teaching that students have already had experience with the array subscripting operator
Tip when they manipulated characters in a string. Stress that the operations that are
allowed on the values stored in an array can also be performed when accessing
the element with the array subscripting operator.

Processing One-Dimensional Arrays

1. Describe some common operations typically performed on arrays, such as initialization,

input/output, and finding the largest/smallest element.

2. Explain how to process an array using a for loop. Step through Example 8-3 to
illustrate how a for loop can be used to perform the operations described above.

Array Index Out of Bounds

1. Explain the consequences of using an array index that is out of bounds.

Discuss some common coding errors that can result in an out of bounds array
Teaching
index. Stress that it is the programmer’s responsibility to verify that a program is
Tip
not attempting to access an array outside of its limits.

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-4

Array Initialization During Declaration

1. Describe the syntax involved with initializing an array during its declaration.

Partial Initialization of Arrays During Declaration

1. Explain how to partially initialize an array. Note that the non-initialized elements are
initialized to a default value; for example, elements of data type int are initialized to
zero.

Discuss situations where it might be useful to partially initialize arrays, e.g.,

Teaching
when you have some information available before execution time that will be
Tip
necessary for proper processing.

Some Restrictions on Array Processing

1. Emphasize that C++ does not allow aggregate operations on arrays. Explain that
therefore, arrays must be processed one element at a time, which is usually done with a
loop.

Arrays as Parameters to Functions

1. Explain that C++ arrays are passed by reference only. Illustrate how this is
accomplished using Example 8-5.

2. Mention the usefulness of passing an additional parameter that specifies how many
elements a function should process.

Constant Arrays as Formal Parameters

1. Discuss the use of constant arrays as parameters when the contents of the array should
not be modified. Use Example 8-6 to illustrate parameter passing using both non-
constant and constant arrays.

Explain in more detail why C++ only allows arrays to be passed as reference
parameters. Discuss issues such as memory management. Ask your students if
Teaching
there are any disadvantages to this approach. For example, how would they
Tip
handle a situation in which they would like an array to be modifiable in the
calling function but not in the called function?

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-5

Base Address of an Array and Array in Computer Memory

1. Explain that the base address of an array is the address of the first element. Using
Figure 8-7, discuss how arrays are stored in memory.

2. Explain how the base address is used when passing arrays as parameters.

Students may find that the details of manipulating memory are complicated. Note
Teaching that C and C++ programmers are more accustomed to manipulating memory than
Tip programmers in some other programming languages, particularly with respect to
arrays.

Functions Cannot Return a Value of the Type Array

1. Note that functions cannot return a value of the type array. Illustrate how arrays are
processed in a function while being returned using Example 8-7.

Ask students why they think C++ does not allow functions to return a value of
Teaching
the type array. Relate this requirement to the requirement of passing arrays as
Tip
reference parameters.

Integral Data Type and Array Indices

1. Explain that C++ allows any integral type to be used as an array index. Therefore,
although the int type is most often associated with array indices, the enum type can
also be used effectively with array indices. Demonstrate with an example from this
section.

Other Ways to Declare Arrays

1. Discuss the use of a constant value to declare the size of an array. Also, describe how a
typedef statement can be used to declare an array.

Discuss the advantages of using a named constant for sizing an array. Stress that
Teaching
changing the size of an array is much easier and less error-prone when only one
Tip
value needs to be modified at the beginning of the program.

Quick Quiz 1
1. Define an array.
© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-6

Answer: An array is a collection of fixed number components all of the same data type.

2. The ____________________ value specifies the position of an element of a component

in an array.
Answer: index

3. True or False: In C++, the array index starts at 1.

Answer: False

4. Define an aggregate operation as it relates to arrays.

Answer: An aggregate operation on an array is any operation that manipulates the entire
array as a single unit.

Searching an Array for a Specific Item

1. Introduce the sequential (or linear) search algorithm using the example in Figure 8-8.
Review the seqSearch() function on Page 543 and in Example 8-8.

Sorting

1. Introduce the selection sort algorithm. Use Figures 8-9 through 8-11 to illustrate this
algorithm. Review the code in Example 8-9.

Auto Declaration and Range-Based for Loops

1. Explain that C++11 allows auto declaration, which allows you to declare and initialize a
variable without specifying its type.

2. Review the example of finding the sum of the elements of a list.

C-strings (Character Arrays)

1. Define a character array.

2. Define a C++ C-string. Explain the similarities and differences between a character
array and a C-string. In particular, note the use of the null character to terminate C-
strings.

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-7

Spend some additional time discussing the differences and similarities between
C-strings and character arrays. Students may wonder why C-strings are necessary
Teaching
at all. Explain that the C-string was originally a part of the C programming
Tip
language. Also, reiterate that the string data type is provided in the C++
library, but that it is not part of the language.

3. Discuss some common C-string functions, as listed in Table 8-1.

String Comparison

1. Explain how C-strings are compared. Demonstrate how the strcmp function works
using Example 8-10.

Reading and Writing Strings

1. Emphasize that although aggregate functions are not allowed on most C-string
operations (just as with the array type), the exception to this rule is input/output
operations.

String Input

1. Provide an example of how to input a C-string into a variable. Then discuss how to
input a C-string with blanks using the get function.

Teaching Note that the get function is overloaded to provide aggregate input operations
Tip for C-strings.

String Output

1. Briefly illustrate how to output C-strings using an output stream variable.

Specifying Input/Output Files at Execution Time

1. Discuss how a program can allow a user to specify an input or output file at execution
time. Note the syntax involved in using a character array to retrieve the filename.

string Type and Input/Output Files

1. Review the differences between strings and C-strings and explain how to convert a
string into a C-string using the c_str method.

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-8

Note that the use of c_str function is required to convert strings into a null-
Teaching terminated form. This is because the open function is compatible with C-strings,
Tip not with the programmer-defined string type. Mention that this is an example
of maintaining compatibility with the C language and older C++ compilers.

Quick Quiz 2
1. Define a character array.
Answer: an array whose components are of type char

2. How is the null character represented in C++?

Answer: '\0'

3. The header file ____________________ provides functions for manipulating C-strings.

Answer: <cstring>
cstring

4. True or False: C++ does not allow any aggregate operations on C-strings.
Answer: False

Parallel Arrays
1. Define parallel arrays and describe situations in which parallel arrays are useful.
Illustrate with the code snippet in this section.

Two- and Multidimensional Arrays

1. Explain the concept of two-dimensional arrays by comparing them to tables. Use Figure
8-12 to illustrate.

2. Discuss the syntax for declaring a two-dimensional array, and use Figure 8-13 to
demonstrate this.

Provide some more examples of how a two-dimensional array resembles a table.

Teaching Point out one difference: all of the elements in both the rows and columns must
Tip be of the same data type in a two-dimensional array. This is not a requirement in
conventional tables.

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-9

Accessing Array Components

1. Give some examples of how to access elements in a two-dimensional array. Use Figure
8-14 to illustrate.

Two-Dimensional Array Initialization During Declaration

1. Explain the syntax involved in initializing a two-dimensional array during declaration.

2. Use the example presented in the book along with Figure 8-15 to illustrate this.

Two-Dimensional Arrays and Enumeration Types

1. Explain how to use enumeration types as indices in a two-dimensional array. Discuss

situations in which this might be useful, using Figures 8-16 and 8-17.

Teaching Note that the enum type for indices in a two-dimensional array may be different
Tip for rows and columns.

2. Explain how to process a two-dimensional array using nested loops.

3. Define row and column processing. Use the code snippets in this section to illustrate
two-dimensional array processing of an entire array, a row of an array, and a column of
an array.

Verify that your students understand array processing using nested loops because
Teaching
the operations that are discussed in the following sections all rely on this
Tip
processing algorithm.

Initialization

1. Explain how to initialize specific rows of an array, as well as how to initialize an entire
array.

Print

1. Describe how to use a nested loop to print out the components of an array.

Input

1. Explain how to input data into specific components of an array and into an entire array.

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-10

Sum by Row

1. Describe how to use nested loops to find the sum of the components in each row of a
two-dimensional array.

Sum by Column

1. Describe how to use nested loops to find the sum of the components in each column of
a two-dimensional array.

Largest Element in Each Row and Each Column

1. Use the code snippets in this section to discuss how to determine the largest element in
each row and column.

Passing Two-Dimensional Arrays as Parameters to Functions

1. Discuss how a two-dimensional array is stored in memory using row order form.

2. Explain how to pass two-dimensional arrays as parameters using Example 8-11.

Emphasize why the second dimension of an array must have a size value when
Teaching
passing the array as a parameter. Ask your students if they think there are any
Tip
advantages to specifying the first dimension as well.

Arrays of Strings

1. Explain how using an array to store strings has many useful applications.

2. Note that strings can be stored in arrays either as a string type or as a character array.

Arrays of Strings and the string Type

1. Describe how to perform operations on an array of strings.

Arrays of Strings and C-Strings (Character Arrays)

1. Using Figures 8-19 and 8-20, explain how a two-dimensional array of strings can be
created using character arrays.

2. Describe the operations available for an array of character arrays.

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-11

Teaching Ask your students if they prefer using arrays of strings or arrays of character
Tip arrays. What are the advantages and disadvantages of each?

Another Way to Declare a Two-Dimensional Array

1. Explain how to declare a two-dimensional array with the typedef statement.

Multidimensional Arrays

1. Define n-dimensional arrays. Discuss the general syntax for declaring an array of n
dimensions.

2. Describe how to process n-dimensional arrays with nested loops.

3. Encourage students to walk through the Programming Examples at the end of this
chapter with a partner to consolidate their understanding of arrays.

Quick Quiz 3
1. Define a two-dimensional array.
Answer: A collection of a fixed number of components arranged in rows and columns,
wherein all components are of the same type.

2. True or False: To access a component of a two-dimensional array, you need a pair of

indices.
Answer: True

3. You can output the contents of a two-dimensional array by using ____ loops.
Answer: nested

4. When storing a two-dimensional array in computer memory, C++ uses the ____ form.
Answer: row order

Class Discussion Topics

1. What are some possible reasons for not permitting aggregate processing on arrays in
C++?

2. What are some ways to prevent out of bounds errors when reading input into C-strings?

3. Discuss some useful applications for n-dimensional arrays, such as graphical 3-D or
biotechnology applications.

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-12

Additional Projects
1. Ask your students to write a program that keeps track of important birthdays. They may
implement it with a one-dimensional array with enumeration type indices, with a two-
dimensional array, or with parallel arrays. The user inputs the name and date
information in a menu-driven function. The data is displayed in a tabular format at the
end of the program execution.

2. Ask your students to write a program that lists European, Middle-Eastern, or Asian
countries and their capitals. The program retrieves this information from an input file
that the user specifies during program execution. The data can be stored in a one-
dimensional array with enumeration type indices, a two-dimensional array, or a parallel
array. The data is displayed in a tabular format at the end of the program execution.

Additional Resources
1. Arrays:
www.cplusplus.com

2. Introduction to C++ Arrays:

http://www.functionx.com

3. C Strings:
www.cprogramming.com

Key Terms
 Aggregate operation: any operation on an array that manipulates the entire array as a
single unit
 Array: a collection of a fixed number of elements (called components) in which all of
the elements must be of the same data type
 Array index in bounds: the index is in bounds if it is >= 0 and <= ARRAY_SIZE –
1
 Array index out of bounds: the index is out of bounds if it is < 0 or >
ARRAY_SIZE – 1
 Array subscripting operator [ ]: used to access the array element at the position
number contained within the square brackets
 Base address: the memory address of the first component in an array
 Character array: an array whose components are of the type char
 Column processing: processing of a particular column of a two-dimensional array
 Dynamic arrays: arrays that are created during program execution using pointers
 Finding the sum and average of an array: code that finds the sum and average of the
values in the array

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
C++ Programming: From Problem Analysis to Program Design, Seventh Edition 8-13

 Index: any expression whose value is a nonnegative integer and which is used for
accessing an array component
 Initializing: the process of using a loop to initialize every component of the array
 n-dimensional array: a collection of a fixed number of components arranged in n
dimensions (n >= 1)
 One-dimensional array: an array in which the components are arranged in a list form
 Parallel arrays: two (or more) arrays with corresponding components holding related
information
 Row order form: refers to the manner in which a two-dimensional array is stored; the
first row is stored first, followed by the second row, followed by the third row, and so
on
 Row processing: processing of a particular row of a two-dimensional array
 Selection sort: a search method in which the array is searched for the smallest value,
which is swapped with the value at the top of the array; then repeated for the next
smallest value, and so on
 Sequential or linear search: searches an array sequentially starting with the first
element; continues until the item is found or there are no more elements
 Simple data type: signifies that a variable can store only one value at a time
 Structured data type: each data item is a collection of other data items
 Two-dimensional array: a collection of a fixed number of components arranged in
rows and columns (that is, in two dimensions), wherein all components are of the same
type

© 2015 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part, except for use as permitted in a
license distributed with a certain product or service or otherwise on a password-protected website for classroom use.
Other documents randomly have
different content
be lesse than ours. Furthermore, wheras our intercalation for the
leape yere is somewhat too much by certeine minuts, which in 115
yeares amount vnto about an whole day, if one intercalation in so
manie were omitted, our calender would be the more perfect: and I
would wish that the same yeare wherein the said intercalation trulie
found out should be ouerpassed, might be obserued and called
Annus magnus Elizabethæ, in perpetuall remembrance of our noble
and souereigne princesse now reigning amongst vs.

I might here saie somewhat also of the prime and hir alteration,
which is risen higher by fiue daies in our common calender than it
was placed by Iulius Cæsar: and in seauen thousand yeares some
writer would grow to an error of an whole, if the world should last so
long. But for somuch as in some calenders of ours it is reduced
againe to the daie of euerie change, it shall suffice to saie no more
therof. The pope also hath made a generall correction of the
calender, wherein he hath reduced it to the same that it was or
should haue beene at the councell of Nice. Howbeit as he hath
abolished the vse of the golden number, so hath he continued the
epact, applieng it vnto such generall vse, as dooth now serue both
the turnes, whose reformation had also yer this time béene admitted
into England, if it had not procéeded from him, against whom and all
whose ordinances we haue so faithfullie sworne and set our hands.

Certes the next omission is to be performed if all princes would

agrée thereto in the leape yeare that shall be about the yeare of
Grace 1668: if it shall please God that the world may last so long,
and then may our calender also stand without anie alteration as it
dooth alreadie. By this also it appeareth how the defect of our
calender may be supplied from the creation, wherein the first
equinoctiall is séene higher toward the beginning of March than
Cæsars calender now extant dooth yéeld vnto by seauen daies. For
as in Cæsars time the true equinoctiall was pointed out to happen
(as Stadius also noteth) either vpon or about the sixtéenth or
seauentéenth of March, albeit the manifest apperance thereof was
not found vntill the fiue and twentith of that moneth in their dials or
by eie-sight: so at the beginning of the world the said entrance of
the sunne into the ram, must néeds fall out to be about the twentith
or one & twentith of Aprill, as the calender now standeth, if I faile
not in my numbers. Aboue the yeare we haue no more parts of time,
that carie anie seuerall names with them, except you will affirme the
word age to be one, which is taken for a hundred yeares, and
signifieth in English so much as Seculum or Æuum dooth in Latine;
neither is it néedfull to remember that some of my countrimen doo
reckon their times not by years but by summers and winters, which
is verie common among vs. Wherefore to shut vp this chapiter
withall, you shall haue a table of the names of the daies of the
wéeke, after the old Saxon and Scotish maner, which I haue
borowed from amongst our ancient writers, as I haue perused their
volumes.

The present names.

Monday. Wednesday. Fridaie. Sunday, or the

Tuesday. Thursday. Saturdaie. Lords daie.

The old Saxon names.

Monendeg. Wodnesdeg. Frigesdeg. Sunnandeg.

Tuesdeg. Thunresdeg. Saterdeg.

The Scotish vsage.

 Diu Luna. Diu Yath. Diu Friach. Diu Seroll.
Diu Mart. Diu Ethamon. Diu Satur.

OF OUR PRINCIPALL FAIRES AND MARKETS.

CHAP. XV.

I haue heretofore said sufficientlie of our faires, in the chapter of

fairs and markets; and now to performe my promise there made, I
set downe here so manie of our faires as I haue found out by mine
owne obseruation, and helpe of others in this behalfe. Certes it is
impossible for me to come by all, sith there is almost no towne in
England, but hath one or more such marts holden yearelie in the
same, although some of them (I must needs confesse) be scarse
comparable to Lowse faire, and little else bought or sold in them
more than good drinke, pies, and some pedlerie trash: wherefore it
were no losse if diuerse of them were abolished. Neither doo I see
wherevnto this number of paltrie fairs tendeth, so much as to the
corruption of youth, who (all other businesse set apart) must néeds
repaire vnto them, whereby they often spend not onelie the weeke
daies, but also the Lords sabbaoth in great vanitie and riot. But such
hath béene the iniquitie of ancient times. God grant therefore that
ignorance being now abolished, and a further insight into things
growne into the minds of magistrates, these old errors may be
considered of, and so farre reformed, as that thereby neither God
may be dishonored, nor the common wealth of our countrie anie
thing diminished. In the meane time, take this table here insuing in
stead of a calender of the greatest, sith that I cannot, or at the least
wise care not to come by the names of the lesse, whose knowledge
cannot be so profitable to them that be farre off, as they are oft
preiudiciall to such as dwell néere hand to the places where they be
holden and kept, by pilferers that resort vnto the same.
 Faires in Ianuarie.

The sixt day being Twelfe day at Salisburie, the fiue and twentith
being saint Paules day, at Bristow, at Grauesend, at Churchingford,
at Northalerton in Yorkeshire, where is kept a faire euerie
wednesday from Christmasse vntill Iune.

Faires in Februarie.

The first day at Bromleie. The second at Lin, at Bath, at Maidstone,

at Bickleswoorth, at Budwoorth. The fourtéenth at Feuersham. On
Ashwednesday at Lichfield, at Tamwoorth, at Roiston, at Excester, at
Abington, at Cicester. The foure and twentith at Henlie vpon
Thames, at Tewkesburie.

Faires in March.

On the twelth day, at Stamford, Sappesford, and at Sudburie. The

thirtéenth day at Wie, at the Mount, & at Bodmin in Cornewall. The
fift sunday in Lent, at Grantham, at Salisburie. On monday before
our ladie day in Lent, at Wisbich, at Kendall, Denbigh in Wales. On
palmesunday éeuen, at Pumfret. On palmesunday, at Worcester. The
twentith day at Durham. On our ladie day in Lent at Northamton, at
Malden, at great Chart, at Newcastell. And all the ladie daies at
Huntington. And at Saffron Walden on midlentsunday.

Faires in Aprill.

The fift day at Wallingford. The seuenth at Darbie. The ninth at

Bickleswoorth, at Belinswoorth. On monday after, at Euesham in
Worcestershire. On tuesday in Easter wéeke at Northfléet, at
Rochford, at Hitchin. The third sunday after Easter, at Louth. The
two and twentith at Stabford. On saint Georges day, at Charing, at
Ipswich, at Tamworth, at Ampthill, at Hinninham, at Gilford, at saint
Pombes in Cornewall. On saint Markes day at Darbie, at Dunmow in
Essex. The six and twentith at Tenderden in Kent.

Faires in Maie.

On Maie daie at Rippon, at Perin in Cornwall, at Osestrie in Wales, at

Lexfield in Suffolke, at Stow the old, at Reading, at Leicester, at
Chensford, at Maidstone, at Brickehill, at Blackeborne, at Cogilton, at
Stokeneie land. The third at Bramyard, at Henningham, at Elstow,
Waltham, Holicrosse, and Hedningham castell. The seuenth at
Beuerleie, at Newton, at Oxford. On Ascension day at Newcastell, at
Yerne, at Brimechame, at saint Edes, at Bishopstratford, at Wicham,
at Middlewich, at Stopford, at Chappell frith. On Whitsunéeuen, at
Skipton vpon Crauen. On Whitsunday, at Richell, at Gribbie, and
euerie wednesday fortnight at Kingston vpon Thames, at Ratesdale,
at Kirbistephin in Westmerland. On monday in Whitsunwéeke, at
Darington, at Excester, at Bradford, at Rigate, at Burton, at Salforth,
at Whitechurch, at Cockermouth, at Applebie, at Bicklesworth, at
Stokeclare. On tuesday in Whitsunwéeke, at Lewse, at Rochford, at
Canturburie, at Ormeskirke, at Perith, at long Milford. On wednesday
in Whitsunwéeke, at Sandbarre, at Raiston. On Trinitie sunday, at
Kendall, and at Rowell. On thursday after Trinitie sunday, at
Prescote, at Stapford, at saint Annes, at Newburie, at Couentrie, at
saint Edes, at Bishop storford, at Rosse. The ninth at Lochester, at
Dunstable. The twentie seuenth day, at Lenham. The twentie ninth
at Crambrooke. On monday in Rogation wéeke at Rech, and sunday
after Ascension day, at Thaxsted.

Faires in Iune.
The ninth day at Maidstone. The xj, at Okingham, at Newbourgh, at
Bardfield, at Maxfield, & Holt. The seuenteenth at Hadstocke. The
twentie thrée at Shrewsburie, at saint Albans. The twentie fourth
day, at Horsham, at Bedell, at Strackstocke, at saint Annes, at
Wakefield, at Colchester, at Reading, at Bedford, at Barnewell beside
Cambridge, at Woollerhampton, at Crambrooke, at Glocester, at
Lincolne, at Peterborow, at Windsor, at Harstone, at Lancaster, at
Westchester, at Halifax, at Ashborne. The twentie seuenth, at
Folkestone. The twentie eight, at Hetcorne, at saint Pombes. The
twentie ninth, at Woodhurst, at Marleborough, at Hollesworth, at
Woollerhampton, at Peterfield, at Lempster, at Sudburie, at
Gargrainge, at Bromleie.

Faires in Iulie.

The second at Congreton, at Ashton vnder line. The sunday after the
third of Iulie, at Raiston. The eleuenth at Partneie, and at Lid. The
fifteenth, at Pichbacke. The seuentéenth, at Winchcombe. The
twentith, at Vxbridge, at Catesbie, at Bolton. The twentie two, at
Marleborow, at Winchester, at Colchester, at Tetburie, at Cooling, at
Yealdon, at Bridgenorth, at Clitherall, at Norwich in Cheshire, at
Cheswike, at Battelfield, at Bicklewoorth. The twentie fift, at Bristow,
at Douer, at Chilham, at Darbie, at Ipswich, at Northampton, at
Dudleie in Staffordshire, at saint Iames beside London, at Reading,
at Ereth in the Ile, at Walden, at Thremhall, at Baldocke, at Louth, at
Malmesburie, at Bromeleie, at Chichester, at Liuerpoole, at Altergam,
at Rauenglasse in the north. The twentie sixt, at Tiptrie. The twentie
seuenth at Canturburie, at Horsham, at Richmund in the north, at
Warington, at Chappell Frith.

Faires in August.
The first day at Excester, at Feuersham, at Dunstable, at saint Edes,
at Bedford, at Northam church, at Wisbich, at Yorke, at Rumneie, at
Newton, at Yeland. The fourth at Linton. The tenth at Waltham, at
Thaxsted, at Blackemoore, at Hungerford, at Bedford, at Stroides, at
Fernam, at S. Laurence by Bodmin, at Walton, at Croileie, at Seddell,
at new Brainford. The xv, at Cambridge, at Dunmow, at Caerleill, at
Preston in Andall, at Wakefield on the two ladie daies, and vpon the
Sunday after the fiftéenth day of August, at Hauerhull. On
Bartholomew day, at London, at Beggers bush beside Rie, at
Teukesburie, at Sudburie, at Rie, at Nantwich, at Pagets, at
Bromleie, at Norwich, at Northalerton, at Douer. On the sunday after
Bartholomew day, at Sandwich. The twentie seuenth, and at
Ashford.

Faires in September.

The first day at S. Giles at the Bush. The eight day at Woolfpit, at
Wakefield, at Sturbridge, in Southwarke at London, at Snide, at
Recoluer, at Gisbourgh both the ladie daies, at Partneie. The thrée
ladie daies at Blackeburne, at Gisborne in Yorkeshire, at Chalton, at
Vtcester. On Holiroode day, at Richmond in Yorkeshire, at Rippond a
horse faire, at Penhad, at Bersleie, at Waltam abbeie, at Wotton
vnder hedge, at Smalding, at Chesterfield, at Denbigh in Wales. On
saint Mathies day, at Marleborough, at Bedford, at Croidon, at
Holden in Holdernes, at saint Edmundsburie, at Malton, at saint
Iues, at Shrewesburie, at Laneham, at Witnall, at Sittingborne, at
Brainetrie, at Baldocke, at Katharine hill beside Gilford, at Douer, at
Eastrie. The twentie ninth day being Michaelmas day, at Canturburie,
at Malton a noble horsse faire, at Lancaster, at Blackeborne, at
Westchester, at Cokermouth, at Ashborne, at Hadleie, at Malden an
horsse faire, at Waie hill, at Newburie, and at Leicester.

Faires in October.
The fourth day at Michell. The sixt day at saint Faiths beside
Norwich, at Maidstone. The eight at Harborough, at Hereford, at
Bishop Storford. On S. Edwards day, at Roiston, at Grauesend, at
Windsor, at Marshfield. The ninth day at Colchester. On saint Lukes
eeuen, at Elie, at Wrickle, at Vpane, at Thirst, at Bridgenorth, at
Stanton, at Charing, at Burton vpon Trent, at Charleton, at Wigan, at
Friswides in Oxford, at Tisdale, at Middlewich, at Holt in Wales. The
twentie one day at Saffron Walden, at Newmarket, at Hertford, at
Cicester, at Stokesleie. The twentie third, at Preston, at Bikelsworth,
at Ritchdale, at Whitechurch. The twentie eight, at Newmarket, and
Hertford. On all saints eeuen, at Wakefield, and at Rithen.

Faires in Nouember.

The second at Blechinglie, at Kingston, at Maxfield, at Epping. The

sixt day at Newport pond, at Stanleie, at Tregnie, at Salford, at
Lesford, and Wetshod faire at Hertford. The tenth, at Leuton. The
eleuenth, at Marleborough, at Douer. The thirtenth, at saint
Edmundsburie, at Gilford. The seventeenth day, at Low, at Hide. The
ninéetenth, at Horsham. On saint Edmunds day, at Hith, at
Ingerstone. The twentie third day, at Sandwich. On saint Andrews
day at Colingbourgh, at Rochester, at Peterfield, at Maidenhed, at
Bewdleie, at Warington in Lancashire, at Bedford in Yorkeshire, at
Osestrie in Wales, and at Powles Belcham.

Faires in December.

On the fift day, at Pluckeleie. On the sixt, at Cased, at Hedningham,

at Spalding, at Excester, at Sinocke, at Arnedale, and at Northwich in
Chesshire. The seuenth day at Sandhurst. The eight day being the
conception of our ladie, at Clitherall in Lancashire, at Malpas in
Cheshire. The twentie ninth, at Canturburie, and at Salisburie.
 OF OUR INNES AND THOROWFAIRES.

CHAP. XVI.

Those townes that we call thorowfaires haue great and sumptuous

innes builded in them, for the receiuing of such trauellers and
strangers as passe to and fro. The manner of harbouring wherein, is
not like to that of some other countries, in which the host or
goodman of the house dooth chalenge a lordlie authoritie ouer his
ghests, but cleane otherwise, sith euerie man may vse his inne as
his owne house in England, and haue for his monie how great or
little varietie of vittels, and what other seruice himselfe shall thinke
expedient to call for. Our innes are also verie well furnished with
naperie, bedding, and tapisserie, especiallie with naperie: for beside
the linnen vsed at the tables, which is commonlie washed dailie, is
such and so much as belongeth vnto the estate and calling of the
ghest. Ech commer is sure to lie in cleane sheets, wherein no man
hath béene lodged since they came from the landresse, or out of the
water wherein they were last washed. If the traueller haue an
horsse, his bed dooth cost him nothing, but if he go on foot he is
sure to paie a penie for the same: but whether he be horsseman or
footman if his chamber be once appointed he may carie the kaie
with him, as of his owne house so long as he lodgeth there. If he
loose oughts whilest he abideth in the inne, the host is bound by a
generall custome to restore the damage, so that there is no greater
securitie anie where for trauellers than in the gretest ins of England.
Their horsses in like sort are walked, dressed and looked vnto by
certeine hostelers or hired seruants, appointed at the charges of the
goodman of the house, who in hope of extraodinarie reward will
deale verie diligentlie after outward appéerance in this their function
and calling. Herein neuerthelesse are manie of them blameworthie,
in that they doo not onelie deceiue the beast oftentimes of his
allowance by sundrie meanes, except their owners looke well to
them; but also make such packs with slipper merchants which hunt
after preie (for what place is sure from euill & wicked persons) that
manie an honest man is spoiled of his goods as he trauelleth to and
fro, in which feat also the counsell of the tapsters or drawers of
drinke, and chamberleins is not seldome behind or wanting. Certes I
beleeue not that chapman or traueller in England is robbed by the
waie without the knowledge of some of them, for when he commeth
into the inne, & alighteth from his horsse, the hostler forthwith is
verie busie to take downe his budget or capcase in the yard from his
sadle bow, which he peiseth slilie in his hand to féele the weight
thereof: or if he misse of this pitch, when the ghest hath taken vp
his chamber, the chamberleine that looketh to the making of the
beds, will be sure to remooue it from the place where the owner
hath set it as if it were to set it more conuenientlie some where else,
whereby he getteth an inkling whether it be monie or other short
wares, & therof giueth warning to such od ghests as hant the house
and are of his confederacie, to the vtter vndoing of manie an honest
yeoman as he iournieth by the waie. The tapster in like sort for his
part dooth marke his behauiour, and what plentie of monie he
draweth when he paieth the shot, to the like end: so that it shall be
an hard matter to escape all their subtile practises. Some thinke it a
gay matter to commit their budgets at their comming to the
goodman of the house: but thereby they oft bewraie themselues.
For albeit their monie be safe for the time that it is in his hands (for
you shall not heare that a man is robbed in his inne) yet after their
departure the host can make no warrantise of the same, sith his
protection extendeth no further than the gate of his owne house:
and there cannot be a surer token vnto such as prie and watch for
those booties, than to sée anie ghest deliuer his capcase in such
maner. In all our innes we haue plentie of ale, béere, and sundrie
kinds of wine, and such is the capacitie of some of them that they
are able to lodge two hundred or three hundred persons, and their
horsses at ease, & therto with a verie short warning make such
prouision for their diet, as to him that is vnacquainted withall may
seeme to be incredible. Howbeit of all in England there are no worse
ins than in London, and yet manie are there far better than the best
that I haue heard of in anie forren countrie, if all circumstances be
dulie considered. But to leaue this & go in hand with my purpose. I
will here set downe a table of the best thorowfaires and townes of
greatest trauell of England, in some of which there are twelue or
sixtéene such innes at the least, as I before did speake of. And it is a
world to sée how ech owner of them contendeth with other for
goodnesse of interteinement of their ghests, as about finesse &
change of linnen, furniture of bedding, beautie of roomes, seruice at
the table, costlinesse of plate, strength of drinke, varietie of wines,
or well vsing of horsses. Finallie there is not so much omitted among
them as the gorgeousnes of their verie signes at their doores,
wherein some doo consume thirtie or fortie pounds, a méere vanitie
in mine opinion, but so vaine will they néeds be, and that not onelie
to giue some outward token of the inne kéepers welth, but also to
procure good ghests to the frequenting of their houses in hope there
to be well vsed. Lo here the table now at hand, for more of our
innes I shall not néed to speake.

The waie from Walsingham to London.

From Walsingham to Picknam 12.miles

From Picknam to Brandonferie 10.miles
From Brandonfarie to Newmarket 10.miles
From Newmarket to Brabram 10.miles
From Brabram to Barkewaie 20.miles
From Barkewaie to Puchrich 7.miles
From Puchrich to Ware 5.miles
From Ware to Waltham 8.miles
From Waltham to London 12.miles

The waie from Barwike to Yorke, and so to London.

From Barwike to Belford 12.miles
From Belford to Anwike 12.miles
From Anwike to Morpit 12.miles
From Morpit to Newcastell 12.miles
From Newcastell to Durham 12.miles
From Durham to Darington 13.miles
From Darington to Northalerton 14.miles
From Northalerton to Toplife 7.miles
From Toplife to Yorke 16.miles
From Yorke to Tadcaster 8.miles
From Tadcaster to Wantbridge 12.miles
From Wantbridge to Dancaster 8.miles
From Dancaster to Tutford 18.miles
From Tutford to Newarke 10.miles
From Newarke to Grantham 10.miles
From Grantham to Stanford 16.miles
From Stanford to Stilton 12.miles
From Stilton to Huntington 9.miles
From Huntington to Roiston 15.miles
From Roiston to Ware 12.miles
From Ware to Waltham 8.miles
From Waltham to London 12.miles

The waie from Carnaruan to Chester, and so to London.

From Carnaruan to Conwaie 24.miles

From Conwaie to Denbigh 12.miles
From Denbigh to Flint 12.miles
From Flint to Chester 10.miles
From Chester to Wich 14.miles
From Wich to Stone 15.miles
From Stone to Lichfield 16.miles
From Lichfield to Colsill 12.miles
From Colsill to Couentrie 8.miles
And so from Couentrie to London, as hereafter followeth.

The waie from Cockermouth to Lancaster, and so to London.

From Cockermouth to Kiswike 6.miles

From Kiswike to Grocener 8.miles
From Grocener to Kendale 14.miles
From Kendale to Burton 7.miles
From Burton to Lancaster 8.miles
From Lancaster to Preston 20.miles
From Preston to Wigam 14.miles
From Wigam to Warington 20.miles
From Warington to Newcastell 20.miles
From Newcastell to Lichfield 20.miles
From Lichfield to Couentrie 20.miles
From Couentrie to Daintrie 14.miles
From Daintrie to Tocester 10.miles
From Tocester to Stonistratford 6.miles
From Stonistratford to Brichill 7.miles
From Brichill to Dunstable 7.miles
From Dunstable to saint Albons 10.miles
From saint Albons to Barnet 10.miles
From Barnet to London 10.miles

The waie from Yarmouth to Colchester, and so to London.

From Yarmouth to Becclis 8.miles

From Becclis to Blibour 7.miles
From Blibour to Snapbridge 8.miles
From Snapbridge to Woodbridge 8.miles
From Woodbridge to Ipswich 5.miles
From Ipswich to Colchester 12.miles
From Colchester to Eastford 8.miles
From Eastford to Chelmesford 10.miles
From Chelmesford to Brentwood 10.miles
From Brentwood to London 15.miles

The waie from Douer to London.

From Douer to Canturburie 12.miles

From Canturburie to Sittingborne 12.miles
From Sittingborne to Rochester 8.miles
From Rochester to Grauesend 5.miles
From Grauesend to Datford 6.miles
From Datford to London 12.miles

The waie from saint Burien in Cornewall to London.

From S. Burien to the Mount 20.miles

From the Mount to Thurie 12.miles
From saint Thurie to Bodman 20.miles
From Bodman to Launstone 20.miles
From Launstone to Ocomton 15.miles
From Ocomton to Crokehornewell 10.miles
From Crokehornewell to Excester 10.miles
From Excester to Honiton 12.miles
From Honiton to Chard 10.miles
From Chard to Crokehorne 7.miles
From Crokehorne to Shirborne 10.miles
From Shirborne to Shaftsburie 10.miles
From Shaftsburie to Salisburie 18.miles
From Salisburie to Andeuor 15.miles
From Andeuor to Basingstocke 18.miles
From Basingstocke to Hartford 8.miles
From Hartford to Bagshot 8.miles
From Bagshot to Stanes 8.miles
From Stanes to London 15.miles

The waie from Bristowe to London.

From Bristow to Maxfield 10.miles

From Maxfield to Chipnam 10.miles
From Chipnam to Marleborough 15.miles
From Marleborough to Hungerford 8.miles
From Hungerford to Newburie 7.miles
From Newburie to Reading 15.miles
From Reading to Maidenhead 10.miles
From Maidenhead to Colbrooke 7.miles
From Colbrooke to London 15.miles

The waie from saint Dauids to London.

From saint Dauids to Axford 20.miles

From Axford to Carmarden 10.miles
From Carmarden to Newton 10.miles
From Newton to Lanburie 10.miles
From Lanburie to Brechnocke 16.miles
From Brechnocke to Haie 10.miles
From Haie to Harford 14.miles
From Harford to Roso 9.miles
From Roso to Glocester 12.miles
From Glocester to Cicester 15.miles
From Cicester to Farington 16.miles
From Farington to Habington 7.miles
From Habington to Dorchester 7.miles
From Dorchester to Henleie 12.miles
From Henleie to Maidenhead 7.miles
From Maidenhead to Colbrooke 7.miles
From Colbrooke to London 15.miles

Of thorowfares from Douer to Cambridge.

From Douer to Canturburie 12.miles

From Canturburie to Rofchester 20.miles
From Rofchester to Grauesend 5.miles
From Grauesend ouer the Thames to Hornedon 4.miles
From Hornedon to Chelmesford 12.miles
From Chelmesford to Dunmow 10.miles
From Dunmow to Thaxsted 5.miles
From Thaxsted to Radwinter 3.miles
From Radwinter to Linton 5.miles
From Linton to Babrenham 3.miles
From Babrenham to Cambridge 4.miles

From Canturburie to Oxford.

From Canturburie to London 43.miles

From London to Vxbridge or Colbrooke 15.miles
From Vxbridge to Baccansfield 7.miles
From Baccansfield to east Wickham 5.miles
From Wickham to Stocking church 5.miles
From Stocking church to Thetisford 5.miles
From Thetisford to Whatleie 6.miles
From Whatleie to Oxford 4.miles

From London to Cambridge.

From London to Edmonton 6.miles

From Edmonton to Waltham 6.miles
From Waltham to Hoddesdon 5.miles
From Hoddesdon to Ware 3.miles
From Ware to Pulcherchurch 5.miles
From Pulcherchurch to Barkewaie 7.miles
From Barkewaie to Fulmere 6.miles
From Fulmere to Cambridge 6.miles

Or thus better waie.

From London to Hoddesdon 17.miles

From Hoddesdon to Hadham 7.miles
From Hadham to Saffron Walden 12.miles
From Saffron Walden to Cambridge 10.miles

OF CERTEINE WAIES IN SCOTLAND,

OUT OF REGINALD WOLFES HIS ANNOTATIONS.
 From Barwijc to Edenborow.

From Barwijc to Chirneside 10.miles

From Chirneside to Coldingham 3.miles
From Coldingham to Pinketon 6.miles
From Pinketon to Dunbarre 6.miles
From Dunbarre to Linton 6.miles
From Linton to Haddington 6.miles
From Haddington to Seaton 4.miles
From Seaton to Aberladie or Muskelborow 8.miles
From thence to Edenborow 8.miles

From Edenborow to Barwijc another waie.

From Edenborow to Dalketh 5.miles

From Dalketh to new Battell & Lander 5.miles
From Lander to Vrsildon 6.miles
From Vrsildon to Driburg 5.miles
From Driburg to Cariton 6.miles
From Cariton to Barwijc 14.miles

From Edenborow to Dunbrittaine westward.

From Edenborow to Kirkelifton 6.miles

From Kirkelifton to Lithco 6.miles
From Lithco to Farekirke ouer Forth 6.miles
From thence to Striuelin vpon Forth 6.miles
From Striuelin to Dunbrittaine 24.miles
 From Striuelin to Kinghorne eastward.

From Striuelin to Downe in Menketh 3.miles

From Downe to Campskenell 3.miles
From Campskenell to Alwie vpon Forth 4.miles
From Alwie to Culrose on Fiffe 10.miles
From Culrose to Dunfermelin 2.miles
From Dunfermelin to Euerkennin 2.miles
From Euerkennin to Aberdore on Forth 3.miles
From Aberdore to Kinghorne vpon Forth 3.miles

From Kinghorne to Taimouth.

From Kinghorne to Dissard in Fiffe 3.miles

From Dissard to Cowper 8.miles
From Cowper to S. Andrews 14.miles
From S. Andrews to the Taimouth 6.miles

From Taimouth to Stockeford.

From Taimouth to Balmerinoth abbeie 4.miles

From thence to Londores abbeie 4.miles
From Londores to S. Iohns towne 12.miles
From S. Iohns to Schone 5.miles
From thence to Abernithie, where the Erne runneth
into the Taie 15.miles
From Abernithie to Dundée 15.miles
From Dundee to Arbroth and Muros 24.miles
 From Muros to Aberden 20.miles
From Aberden to the water of Doneie 20.miles
From thense to the riuer of Spaie 30.miles
From thence to Stockeford in Rosse, and so
to the Nesse of Haben, a famous point on the west side 30.miles

From Carleill to Whitehorne westward.

From Carleill ouer the Ferie against Redkirke 4.miles

From thence to Dunfrées 20.miles
From Dunfrées to the Ferie of Cre 40.miles
From thence to Wigton 3.miles
From thence to Whitherne 12.miles

Hitherto of the common waies of England and Scotland, wherevnto I

will adioine the old thorowfaires ascribed to Antoninus, to the end
that by their conference the diligent reader may haue further
consideration of the same than my leisure will permit me. In setting
foorth also thereof, I haue noted such diuersitie of reading, as hath
happened in the sight of such written and printed copies, as I haue
séene in my time. Notwithstanding I must confesse the same to be
much corrupted in the rehearsall of the miles.

Britannia.