Discrete Mathematics Sherwood Washburn Answers
Syllabus for IST 230:
Language, Logic, and Discrete Math
Language, Logic, and Discrete Math
512 Rider Bld
865-4453
School of IST
ritter@ist.psu.edu
M 3-4
W 4-5 pm 512 Rider
and by appointment
Please note, this is a live document. Changes announced in class and on the list server will be incorporated from time to time. Announcements in class and their mirror here are the definative version.
COURSE OVERVIEW
Introduction to formal languages, mathematical logic, and discrete mathematics, with applications to information sciences and technology. The course will consist of a number of modules, each introducing a group of mathematical concepts and presenting applications of those concepts to problems of information storage, information retrieval, information management, etc. in both computers and humans.
IST 230 is one of the five introductory core courses for the Baccalaureate degree program in Information Sciences and Technology. The purpose of IST 230 is to provide students with an understanding of an array of mathematical concepts and methods that form the foundation of modern information science, in a form that will be relevant and useful for IST students. Exams and assignments will be used to assess that understanding.
IST 230 will draw some of its material from several mathematical disciplines: formal language theory, mathematical logic, and discrete mathematics. In-depth treatments of each of these subjects are offered elsewhere in the University as advanced mathematics and computer science courses. The difference is that IST 230 will present these concepts in a more elementary way than CSE260, with much more emphasis on IST applications. Understanding of these concepts will be tested through assignments and examinations.
IST 230 can be viewed as a small number of modules. Each module will introduce a group of mathematical concepts and present applications of those concepts to problems of information storage, information retrieval, information management, in both humans and machines. These include: Module 1: induction and recursion; Module 2: set, relations, functions, numbers; Module 3: graphs and trees; Module 4: logic and boolean algebra; Module 5: combinatorics and probability; Module 6:grammars, languages and finite state. These vary slightly from the text, which we will follow for convenience.
We will explore these topics through in-class presentations, homework sets, discussions (both face-to-face and online), readings (from both text and on-line sources), exercises (both individual and done in pairs ), and tests.
COURSE OBJECTIVES
At the conclusion of this course, students will be able to:
- Define in a quantitative way aspects of information and information technology.
- Be familiar with mathematical theories, problems, and terms in the information sciences and technology.
- Define and illustrate the underlying theory in such concepts as computability, algorithms, HCI, social informatics and relate these to the planning, development, and use of information technologies in organizations.
Note to students with disabilities: It is Penn State's policy to not discriminate against qualified students with documented disabilities in its educational programs. If you have a disability-related need for modifications in your testing situation, your instructor should be notified during the first week of classes so that your needs can be accommodated. You will be asked to present documentation from the Office of Disability Services (located in 105 Boucke Building) that describes the nature of your disability and the recommended remedy. You may refer to the Nondiscrimination Policy in the Student Guide to University Policies and Rules 1999.
Americans with Disabilities Act: The School of Information Sciences and Technology (IST) welcomes persons with disabilities to all of its classes, programs, and events. If you need accommodations, or have questions about access to buildings where IST activities are held, please contact the Dean's Office (814) 865-3528 in advance of your participation or visit. If you need assistance during a class, program, or event, please contact any member of our staff or faculty in charge.
COURSE ORGANIZATION
Teaching Staff and Structure. Dr. Frank Ritte ris the course coordinator. There are also a teaching assistant (TA). The TA for our sections is Dr. David Mudgett (email: drm1@psu.edu , phone 865-4455).
The IST 230 Web Site. This course has an active web page that contains the syllabus, assignments, links to useful sites, and other valuable material (such as how to correctly prepare assignments, citations templates, and other academic and recreational information). We will post late-breaking information and updates to the web page. This page can currently be found at uniform resource locator (URL) ritter.ist.psu.edu/ist230, and later will be available through links from the IST home page via course listings.
The IST 230 Listserv. Each section has a mandatory listserv that we will use to post course and class information, conduct on-line discussions, and share information.
If you are in Section1 you need to subscribe to l-ist230-1@lists.psu.edu .
If you are in Section2 you need to subscribe to l-ist230-2@lists.psu.edu .
Instructions on how to subscribe are available at cac.psu.edu/~santoro/110sp00/conf.htm . Please note that (a) you must use your PSU account, and (b) the web server accepting confirmations is sometimes down. If the server is down, read the email and use the reply option to confirm your subscription. This appears to always work. (c) The instructions are for IST110. Replace 230 for 110 where appropriate!
We also have a chat room, http://volano.cac.psu.edu/classes/IST230 User name and password will be mailed to you. A short tutorial is available at http://cac.psu.edu/ets/projects/modules/laurie/vc/vc1-1-0.htm
Transcripts are recorded in the room. I will get an email every night with any room discussions included from the previous day. If they are found to be particularly useful, I'll put them onto the web site.
Required Texts (available at the PSU Bookstore)
(W) Discrete Mathematics, Washburn, Marlowe, Ryan Addison-Wesley, ISBN 0-201-88336-8
Papers and online references will be available as supplements. List of errata
Previously unreported mistakes in the text are worth 0.1 points (out of 2 on a homework). Reports should come at the beginning of class.
Optional Texts and Interesting Online Resources
Student's solutions manual to accompany Discrete Mathematics, Sherwood � Washburn, Thomas Marlowe, Charles Ryan. / Paul Lorczak ; solutions to � computer exercises provided by Atanas Rountev and Matthew Arnold. Reading, � Mass., Addison-Wesley, 2000.�Call#: QA39.2.W369 2000 ��� 4th Floor Paterno QA39.2.W369 2000 -4th Floor Paterno- � Now in Reserve Reading Room. 2 Available. ISBN - 0-201-61925-3
Forum for Advancing Software engineering Education Wolfram Research seems to have a nice online library
http://www.counterpane.com A newsletter on cryptography that illustrates math occasionally.
Grimaldi, Discrete and Combinatorial Mathematics, is another, longer, more detailed textbook. The library has returned my copy and has replaced it with 2 copies available in Patee reference. IST230 books in reference library
Maxfield, Clive. Bebop to the Boolean Boogie, An Unconventional Guide to Electronics Fundamentals, Components & Processes.� TK7868.D5M323 1995.
PSU STATEMENT ON ACADEMIC INTEGRITY
According to the University Advising Handbook: "Academic integrity is the pursuit of scholarly activity free from fraud and deception, and is the educational objective of this institution. Academic dishonesty includes, but is not limited to cheating, plagiarism, fabrication of information or citations, facilitating acts of academic dishonesty by others, unauthorized possession of examinations, submitting work of another person, or work previously used without informing the instructor, or tampering with the academic work of other students. Any violation of academic integrity will be thoroughly investigated, and where warranted, punitive action will be taken." Students should be aware that standards for documentation and intellectual contribution may depend on the course content and method of teaching, and should consult instructors for guidance.
EVALUATION
You earn your grade but it will be assigned by me. The criteria for each assignment will be discussed in detail, as will the grading scheme. Each written assignment will be evaluated on how well it addresses the questions posed, the clarity of thinking, the organization and presentation of the material, the quality of writing, and its timeliness.
Your grade will be based on 100 possible points. You earn points with each assignment (see below). As a maximum scale (i.e., cutoffs may be lowered): A: 100-74, A-: 73-70, B+ 69- 67, B: 66- 64, B-: 63- 60, C+: 59- 57, C: 56- 50, D: 49- 40, F: 39- 0.
There are written assignments, in class exercises, two midterms, and a final exam. Please consult the schedule to see when papers/ assignments are due and exams scheduled. You will receive more written instructions for each assignment well in advance of the due date. Here is a brief summary of each:
| Assignment | Weight | Due Date | |
| Current Affairs and Additional Readings Assignment Schedule | 5% | Once during the semester you will be asked to find an additional resource that addresses or relies upon topics covered that week in class. In one page or less, you will comment on how that article relates to the current class discussion/ topic. You will share both the article and your comments with the class. | Once, varies by student |
| Homework sets Tips on doing them | 25% | You will do a varietyof homework sets. Each set nominally 2 points, with maximum allowed of 25%. They are finalised the week prior to their due date. | Fridays |
| Mid-Term Exam 1 Example questions Example Probs from HW6 | 20% | Solutions Note that problem 8, while covered, was missed by most, so exam marked out of 67, not 70. | 2 Oct 2000 |
| Mid-Term Exam 2 Example questions Example midterm Example midterm answers | 20% | Solutions | 8 Nov 2000 |
| In class exercises | 5% | These will be held at various times, in class. | Various |
| Final Examination Review Example questions | 25% | This will be a comprehensive examination that incorporates both class and lab material. | December 2000 |
| | 100% |
COURSE CONDUCT
- Classes will start on time and end as scheduled. Please take your seat prior to the start of class.
- You will attend each class and actively participate in the discussions during class. If you are uncomfortable with public speaking, or if English is not your native language, we must meet in the first two weeks of school to establish ways to make you more comfortable in speaking and interacting with your peers.
- For every hour of lecture, I anticipate that you will need to budget about 3 hours of out-of-class time. This implies that you need to budget about 140 hours of out-of-class time over the course of the semester. This time estimate is a guide and you may need to budget more. For example, if the material is new to you or difficult to comprehend, it will require more of your time.
- You are responsible for all the readings, even if the material is not explicitly covered in class. You should read the class materials prior to class and be prepared to discuss and ask questions about the readings and assignments. You should also re-read the material after class as not every topic will be covered during class time. Many passages in the text may need to be read several times to gain clarity. Also, taking notes on the material you are reading and reflecting on the reading and these notes will help you better understand the issues, concepts and techniques that are being presented.
- All work must be completed and turned in at the start of class on the assigned date. No late work will be accepted. Late means after the class has begun. Note that a computer's failure is not an excuse (it represents poor planning on your part). If you miss a deadline, a written explanation of a university recognized excuse and written documentation (e.g. a doctor's note) must be handed to me at the end of a lecture. Assignments that are simply late can be turned in for feedback but 0 marks.
- All assignment should be double-spaced, on 8.5"x 11" paper. All pages should have 1" margins. Papers should be stapled and collated. Please do not use report covers; they will not be returned.
- Carefully proofread your work. Mistakes include spelling, grammatical errors, and typos. You should assume that your reader is about as smart as you, not smarter, but adviserial, they want to know that you know.
- I expect individual work should be just that -- it should be done by you, alone.
- I expect group work should be just that -- from all of the group. If I become aware that you are not contributing to your group equally, I will intervene.
- Students who participate in University-sanctioned events (such as athletics) must make prior arrangements and give ample notice. Missing class for unannounced practice is not advised.
- The official language of this course is English.
- Requests for regrading must be turned in with this form.
IST 230 CLASS SCHEDULE (subject to revisions)
| Date | Focus | In Class | Read/Prepare | Due | |
|---|---|---|---|---|---|
| 1* | 23/Aug/00 | Introduction, start of initial exercise | Course overview, Introductions, big factorial problem | Review of algebra | nil |
| 2* | 25/Aug/00 | Logs | Overview of computer systems: Fitts law, Shannon's H, plots, Short log review1 Examples of H wrt Boston Harbour and | Get on listserver | HW: (ready) Get on listserver Project due at end of class. Ritter's answer Survey due at end of day |
| 3* | 28/Aug/00 | Pascal's Triangle, simple recursion, binomial coefficients | Washburn 1.1 | ||
| 4* | 30/Aug/00 | Induction | Review of Hwk2 warmup | W 1.2 | |
| 5* | 1/Sep/00 | Induction | Example proof from Leonard | HW2: (ready) Shannon's H Exp growth Fitts law p.9#2 (AE or CE) | |
| 4/Sep/00 | Labour Day | ||||
| 6* | 6/Sep/00 | Sets, Subsets, Binary strings | W 1.3 Binary web site | ||
| 7* | 8/Sep/00 | Sets, Subsets, Binary strings | Canadian Set Site | HW3 (ready) p16#2,4,6,8, 9 Petite binary problems | |
| 8* | 11/Sep/00 | Set Operations | W 1.4 | ||
| 9* | 13/Sep/00 | Recursions | Factorial, etc. | W 1.5 | |
| 10* | 15/Sep/00 | Recursions | HW4 (ready) p. 26 p. 28#2,4 (AE or CE) p. 36 #2,4,6,8,12,18,22,24 | ||
| 11* | 18/Sep/00 | Integers, primes, gcd, lcm, Euclidean algorithm, unique factorization, Fermat Factorization | Explanation of Euclidian algorithm Notes on Hamming and Fibbonaci | W 2.1 | |
| 12* | 20/Sep/00 | continued | GCD calculator | ||
| 13* | 22/Sep/00 | Integers mod n, examples mod 2, exponentials RSA RSA-more Intro to encryption | Application: UPCs Multiplicative Inverse in modular arithm. Finding inverses | W 2.3 | HW5 (ready) p.60#2,4 |
| 14* | 25/Sep/00 | Functions and Relations, composition of functions, injective, surjective, bijective, equivalence relations | W3.1 | ||
| 15* | 27/Sep/00 | Counting, pigeonhole principle, permutations, combinations | W3.2 | ||
| 16* | 29/Sep/00 | Review | HW6 (revised 25/9) | ||
| 17* | 2/Oct/00 | Review, PH, Perm/comb | |||
| 18* | 2/Oct/00 | ** Class Midterm Examination on | 630-745 pm, 111 and 112 Boucke | ||
| 19* | 4/Oct/00 | Graphs, directed, complete, matrix representations, planar graphs | W4.1 | ||
| 20* | 6/Oct/00 | Eulerian cycle, circuit, More on Eulerian, Hamiltonian circuit, TS | 4.2 | (There is no HWK this week) | |
| 9/Oct/00 FB | Fall Break | ||||
| 21* | 11/Oct/00 | Trees, spanning trees, Breadth first, depth first, traversals of binary trees | Carley's work | 4.3 | |
| 22* | 13/Oct/00 | Proof techniques | 5.1 | ||
| 23* | 16/Oct/00 | Logic, prepositional calculus, truth tables | 5.3 | HW7 (ready) | |
| 24* | 18/Oct/00 | continued | |||
| 25* | 20/Oct/00 | Boolean algebra, functions, and gates | 6.1 | HW8 (ready) HW8 answers | |
| 26* | 23/Oct/00 | Disjunctive and conjunctive normal forms,production rules | 6.2 | ||
| 27* | 25/Oct/00 | continued, Karnaugh maps1 and here | |||
| 28* | 27/Oct/00 | Predicate calculus talk translating it | 6.3 | HW9 (ready) HWK9 answers | |
| 29* | 30/Oct/00 | Algorithms, Euclidean, Merge Sort, Quicksort, Binary Search, | 8.1 | ||
| 30* | 1/Nov/00 | continued | |||
| 31* | 3/Nov/00 | Review | HW10 (ready) HWK10 - Example web problem (ready) HWK10 answers | ||
| 32* | 6/Nov/00 | Graph, Network Algorithms, spanning trees, Dijkstra's 1, Dijkstra2, D3, network flows | Kruskal's algorithm | 8.2 | |
| 33* | 8/Nov/00 | (continued) | ** Class exam II ** Chapters 4,5,6 | Room 112 Chambers Bldg 6:30 - 7:45 pm | |
| 34* | 10/Nov/00 | Algorithm complexity | 8.3 | ||
| 35* | 13/Nov/00 | continued | HW11 (ready) HWK11 answers | ||
| 36* | 15/Nov/00 | Probability random.org | Binomials | 9.2 | |
| 37* | 17/Nov/00 | continued | with networks | Probability in monoply! | |
| 38* | 20/Nov/00 | continued | HW12 (ready) HKW12 answers | ||
| 39* | 22/Nov/00 | Careers/review | |||
| 24/Nov/00 TB | Thanksgiving break | ||||
| 40* | 27/Nov/00 | Language, grammars, regular expressions | 10.1 | ||
| 41* | 29/Nov/00 | continued | Petri networks: reading1 reading2 BNF forms | ||
| 42* | 1/Dec/00 | Finite state machines | 10.2 | HW13 (ready) HKW13 answers | |
| 43* | 4/Dec/00 | Applications | semantic networks Example: used in search engines | ||
| 44* | 6/Dec/00 | Applications/Overflow | Compression Markov models | ||
| 45* | 8/Dec/00 | The Future / Review | HW14 (ready) HWK14 answers | ||
| (Task modelling languages not yet covered) |
Section 2: Joint with section 1.
Homework for IST 230 and Teaching assistant
| Instructor | Office | Office Hours | Phone | |
|---|---|---|---|---|
| David Mudget t | ACS Lab near 512 Rider 1 Bld. | Tues 1230-1430 Thurs 1130-1330 and by appointment | 865-4455 | drm1@psu.edu |
Homework OVERVIEW
The laboratory/homework portion of IST 230 provides students with the chance to become familiar with using the concepts. It is absolutely essential for understanding the material and will be useful for passing the exams.
You have been put into pairs or small groups to do your homework because we believe this generally leads to better learning. That means that you can turn in one homework set per pair or group. That you can turn in your own if you prefer. That confering within your pair is not a violation of academic policy or of ethics.
As we explore these topics, we will also practice skills in working together, analytical skills, and information problem-solving approaches.
Discrete Mathematics Sherwood Washburn Answers
Source: http://acs.ist.psu.edu/courses/ist230-fall2000/
Posted by: branhamfars1969.blogspot.com
0 Response to "Discrete Mathematics Sherwood Washburn Answers"
Post a Comment