Scribd
Upload
14 views1 page

Cormen Lin Lee-Introduction To Algorithms (Solutions) - En-8

The preface outlines the origins of the lecture notes, which are derived from various undergraduate algorithms courses and are designed to be more informal than the textbook. It highlights differences in pseudocode presentation between the lecture notes and the text, such as the absence of line numbers and the handling of array lengths. Additionally, it describes the solutions section, which is more formal than the lecture notes and includes an index of exercises and problems with solutions.

Uploaded by

designer.mar.44
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views1 page

Cormen Lin Lee-Introduction To Algorithms (Solutions) - En-8

The preface outlines the origins of the lecture notes, which are derived from various undergraduate algorithms courses and are designed to be more informal than the textbook. It highlights differences in pseudocode presentation between the lecture notes and the text, such as the absence of line numbers and the handling of array lengths. Additionally, it describes the solutions section, which is more formal than the lecture notes and includes an index of exercises and problems with solutions.

Uploaded by

designer.mar.44
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

P-2 Preface

• Some are from the Þrst-edition manual, and so they correspond to Charles Leis-
erson’s lectures in MIT’s undergraduate algorithms course, 6.046.
• Some are from Tom Cormen’s lectures in Dartmouth College’s undergraduate
algorithms course, CS 25.
• Some are written just for this manual.
You will Þnd that the lecture notes are more informal than the text, as is appro-
priate for a lecture situation. In some places, we have simpliÞed the material for
lecture presentation or even omitted certain considerations. Some sections of the
text—usually starred—are omitted from the lecture notes. (We have included lec-
ture notes for one starred section: 12.4, on randomly built binary search trees,
which we cover in an optional CS 25 lecture.)
In several places in the lecture notes, we have included “asides” to the instruc-
tor. The asides are typeset in a slanted font and are enclosed in square brack-
ets. [Here is an aside.] Some of the asides suggest leaving certain material on the
board, since you will be coming back to it later. If you are projecting a presenta-
tion rather than writing on a blackboard or whiteboard, you might want to mark
slides containing this material so that you can easily come back to them later in the
lecture.
We have chosen not to indicate how long it takes to cover material, as the time nec-
essary to cover a topic depends on the instructor, the students, the class schedule,
and other variables.
There are two differences in how we write pseudocode in the lecture notes and the
text:
• Lines are not numbered in the lecture notes. We Þnd them inconvenient to
number when writing pseudocode on the board.
• We avoid using the length attribute of an array. Instead, we pass the array
length as a parameter to the procedure. This change makes the pseudocode
more concise, as well as matching better with the description of what it does.
We have also minimized the use of shading in Þgures within lecture notes, since
drawing a Þgure with shading on a blackboard or whiteboard is difÞcult.

The solutions

The solutions are based on the same sources as the lecture notes. They are written
a bit more formally than the lecture notes, though a bit less formally than the text.
We do not number lines of pseudocode, but we do use the length attribute (on the
assumption that you will want your students to write pseudocode as it appears in
the text).
The index lists all the exercises and problems for which this manual provides solu-
tions, along with the number of the page on which each solution starts.
Asides appear in a handful of places throughout the solutions. Also, we are less
reluctant to use shading in Þgures within solutions, since these Þgures are more
likely to be reproduced than to be drawn on a board.

You might also like