Skip to content

Fix typo: thne -> then #20

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
8dcc wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fix typo: thne -> then #20

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions src/XC1.xml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,13 +13,13 @@
<line>But his best efforts failed,</line>
<line>And at Betty he railed:</line>
<line>"Your insights? A true <term>empty set</term>!"</line>
</stanza>
</stanza>
</poem>
<p>Many of the topics in this book are defined in terms of sets. It is essential to understand basic set theory and how it is use to define basic structures such as relation, functions, graphs and algebraic structures. We begin this chapter with some of the basic set language and notation that will be used throughout the text. We thne consider basic set operations. Venn diagrams will be introduced in order to give the reader a clear picture of these operations. In addition, we will review the binary representation of positive integers and introduce summation notation and its generalizations.</p>
</introduction>
<p>Many of the topics in this book are defined in terms of sets. It is essential to understand basic set theory and how it is use to define basic structures such as relation, functions, graphs and algebraic structures. We begin this chapter with some of the basic set language and notation that will be used throughout the text. We then consider basic set operations. Venn diagrams will be introduced in order to give the reader a clear picture of these operations. In addition, we will review the binary representation of positive integers and introduce summation notation and its generalizations.</p>
</introduction>
<xi:include href="./S11.xml" />
<xi:include href="./S12.xml" />
<xi:include href="./S13.xml" />
<xi:include href="./S14.xml" />
<xi:include href="./S15.xml" />
</chapter>
</chapter>
10 changes: 5 additions & 5 deletions src/XC1_stub.xml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,14 +4,14 @@
<introduction>
<title>Goals for Chapter 1</title>
<p>This is a stub for Part 2 of Applied Discrete Structures. To see the whole chapter, visit our web page at http://faculty.uml.edu/klevasseur/ADS2.</p>
<p>Many of the topics in this book are defined in terms of sets. It is essential to understand basic set theory and how it is use to define basic structures such as relation, functions, graphs and algebraic structures. We begin this chapter with some of the basic set language and notation that will be used throughout the text. We thne consider basic set operations. Venn diagrams will be introduced in order to give the reader a clear picture of these operations. In addition, we will review the binary representation of positive integers and introduce summation notation and its generalizations.</p>
</introduction>
<p>Many of the topics in this book are defined in terms of sets. It is essential to understand basic set theory and how it is use to define basic structures such as relation, functions, graphs and algebraic structures. We begin this chapter with some of the basic set language and notation that will be used throughout the text. We then consider basic set operations. Venn diagrams will be introduced in order to give the reader a clear picture of these operations. In addition, we will review the binary representation of positive integers and introduce summation notation and its generalizations.</p>
</introduction>

<algorithm xml:id="binary-conversion-algorithm">
<title>Binary Conversion Algorithm</title><idx>Binary Conversion Algorithm</idx><statement>
<p> An algorithm for determining the binary representation of a positive integer.</p>
<p>Input: a positive integer n.</p>
<p>Output: the binary representation of n in the form of a list of bits, with units bit last, twos bit next to last, etc.</p>
<p>Input: a positive integer n.</p>
<p>Output: the binary representation of n in the form of a list of bits, with units bit last, twos bit next to last, etc.</p>
<p><ol marker="(1)">
<li><p>k := n <m>\qquad </m> //initialize k</p></li>
<li><p>L := { } <m>\qquad </m> //initialize L to an empty list</p></li>
Expand All @@ -26,4 +26,4 @@
</statement>
</algorithm>

</chapter>
</chapter>