DOC PREVIEW
UNL CSCE 235 - CSCE 235 – Discrete Mathematics Syllabus

This preview shows page 1 out of 3 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 3 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 3 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

CSCE 235 – Discrete MathematicsSpring 2006“Computer Science is no more about computers than astronomy is about telescopes.”–Edsger DijkstraCourse InfoLectures: Time & Venue MWF 12:30 – 1:20Avery 109Recitations: Time & Venue M 4:30 – 5:20Avery 118Prerequisites CSE 155 and Math 106Course Web Page http://www.cse.unl.edu/~cse235Textbook Discrete Mathematics and Its ApplicationsKenneth H. Rosen, McGraw Hill, 5th Edition, 2003Instructor Berthe Y. [email protected] Avery HallOffice hours: M/W 3:30 – 4:30TA Chris [email protected] Avery HallOffice hours: W/Th 2:30 – 3:30Also by appointmentCourse DescriptionComputer Science is not programming. Rather, Computer Science is the mathematical modeling and study ofwhat computation is—that is, what problems have a computational solution and how efficient that solutioncan be. Thus, a strong foundation in mathematics is essential to your success as a computer scientist.At the heart of computer science are fundamental, discrete structures which we will study in this course.Specifically, you will learn many of the mathematical definitions, techniques, and ways of thinking that willbe useful in Computer Science.Tentative ScheduleBelow is a list of topics I intend to cover along with the relevant sections of the text. This schedule istentative and may be changed or topics added/removed as time dictates. Furthermore, though we will followthe book, additional material may be introduced (with sufficient resources) while the depth of each topicmay vary.Topic SectionsProp os itional Logic 1.1 - 1.2Predicate Logic 1.3 - 1.4Proofs 1.5Sets 1.6 - 1.7Functions 1.8Relations 7.1, 7.3 - 7.6Algorithms 2.1 - 2.3Number Theory 2.4 - 2.6Induction 3.1 - 3.3Counting 4.1 - 4.2Combinatorics 4.3 - 4.5Recursion 6.1 - 6.2PIE 6.5Graphs 8.1 - 8.5Trees 9.1 - 9.3I intend to teach from a combination of slides and board work. I will make handouts of the slides available, butyou are ultimately responsible for the material, thus regular attendance is strongly encouraged. Furthermore,you will be expected to read the relevant sections of the text book before coming to class.The instructor for the recitations is Chris M. Bourke, a graduate teaching assistant (GTA). Recitation meetsevery Monday from 4:30 to 5:20 in Avery 118. Recitation will primarily serve as a question/answe r sessionand an opportunity for you to see more examples of concepts presented in lecture, therefore you should comeprepared with any questions or examples that you wish to see worked out. Regular (though not necessarilyannounced) quizzes will also be given during recitation. Since make-up quizzes will not be given, attendance,while not mandatory, is highly recommended.GradingGrading will be based on homework, quizzes and two exams with the following contributions.Homework 60%Quizzes 15%Midterm 10%Final 15%Homework: The GTA will assign about 6–7 homeworks, one about every other we ek. Homework mayconsist of selected exercises from the text as well as original problems and programming assignments. Youwill be expected to follow all instructions on the homework assignments. Clarity and legibility are of greatimportance. If homework is sloppy or unclear, points may be deducted. You are not required to typesetyour homework assignments, however, it is strongly recommended that you do so using LATEX or a similartypesetting system. Resources for LATEX are available on the course web page. Programming portions (ifassigned) of each assignment must be completed using C++ and must compile and run on CSE using theg++ compiler. Source code and all relevant files must b e handed in using the CSE web handin program(http://www.cse.unl.edu/~cse235/handin).Quizzes: There will be several pop quizzes (i.e. they may or may not be announced in advance) givenduring the recitation on Mondays. They will generally be short and will cover recent topics. There will beno make-up quizzes.Exams: There will be one midterm exam and one final given in class (see the schedule for dates). Thesemay or may not be open notes/book tests, such issues will be discussed closer to the exam dates. As of now,the final will be comprehensive.Grading policy: If you have questions about grading or believe that points were deducted unfairly, youmust first address the one who graded it to see if it can be resolved (as of now, Chris M. Bourke is the onlygrader). Such questions should be made within a reasonable amount of time after the graded assignmenthas been returned. No further consideration will be given to any assignment a week after it has been gradedand returned to you. It is important to e mphasize that the goal of grading is consistency. A grade on anygiven assignment, even if it is low for the entire class, should not matter that much. Rather, students whodo c omparable work should receive comparable grades (see the subsection on the scale used for this course).Late work: All homeworks will be due at the beginning of class each Friday. You are allowed to turn in oneand only one late assignment (without penalty) at the start of class the following Monday. No assignmentswill be accepted after this time. The web handin program that you will use enforces a strict handin timebased on the CSE server’s clock. Programs that are even a few minutes late will be marked as late so isextremely important that you handin your elec tronic files well within the time that they are due. In general,there will be no make-up exams or quizzes. Exceptions may be made in certain circumstances such as healthor emergency, but you must make every effort to get prior permission.Scale: Letter grades will be awarded based on the following scale. This scale may be adjusted upwardsif the instructor deems it necessary based on the final grades only. No scale will be made for individualassignments.A+ ≥ 97A ≥ 93A- ≥ 90B+ ≥ 87B ≥ 83B- ≥ 80C+ ≥ 77C ≥ 73C- ≥ 70D+ ≥ 67D ≥ 63D- ≥ 60F < 60Academic integrity: All homework assignments, programs, quizzes, and exams must be your own work.No collaboration with fellow students, past or current, is allowed. The Computer Science & Engineeringdepartment has an Academic Integrity Policy. All students enrolled in any computer science course arebound by this policy. You are expected to read, understand, and follow this policy. Violations will bedealt with on a case by case basis and may result in a failing assignment or a failing grade for the courseitself. The most recent version of


View Full Document

UNL CSCE 235 - CSCE 235 – Discrete Mathematics Syllabus

Documents in this Course
Logic

Logic

77 pages

Proofs

Proofs

82 pages

Induction

Induction

85 pages

Proofs

Proofs

52 pages

Sets

Sets

8 pages

Recursion

Recursion

16 pages

Proofs

Proofs

82 pages

Functions

Functions

71 pages

Recursion

Recursion

50 pages

Functions

Functions

54 pages

Graphs

Graphs

56 pages

Induction

Induction

32 pages

Relations

Relations

60 pages

Graphs

Graphs

10 pages

Recursion

Recursion

80 pages

Recursion

Recursion

81 pages

Functions

Functions

16 pages

Recursion

Recursion

16 pages

Sets

Sets

52 pages

Relations

Relations

60 pages

Load more
Download CSCE 235 – Discrete Mathematics Syllabus
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view CSCE 235 – Discrete Mathematics Syllabus and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view CSCE 235 – Discrete Mathematics Syllabus 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?