[SOLVED] CS代考 CSI 2101B Discrete Structures

CSI 2101B Discrete Structures
University of Ottawa, Winter 2022, Online Mode Lectures: Wednesday 10:00-11:20 and Friday 08:30-09:50 Tutorial: Thursday 17:30-18:50
Instructor: Dr.
Calendar Description: Discrete structures as they apply to computer science, algorithm analysis and design. Predicate logic. Review of proof techniques; application of induction to computing problems. Graph theory applications in information technology. Program cor- rectness, preconditions, postconditions and invariants. Analysis of recursive programs using recurrence relations. Properties of integers and basic cryptographical applications.

Copyright By PowCoder代写加微信 assignmentchef

Prerequisite(s): MAT 1348. Textbook:
• Discrete Mathematics and its Applications by K. Rosen, 7th or 8th edition, McGraw Hill Education.
Grade Distribution:
Quizzes (closed-book online) Midterm 1 (closed-book online) Midterm 2 (closed-book online) Final Exam (closed-book online)
Quizzes and Attendance:
20% (5×4%) 20%
There will be six pop quizzes during the lecture sessions. A quiz may consist of multi- ple choices, true/false, and short (one word) answers. The syllabus for a pop quiz is just the topics from previous three lectures. The best five out of six quizzes will be counted. No makeup or weight transfer is possible for a missed quiz. As a result, the score will be zero. Exceptional circumstances should be reported immediately by an email. The instructor may ask for a doctor’s note when a medical issue is reported. The attendance is mandatory. At least 80% attendance is required to continue this course.
Note: Zoom meeting reports will be used to calculate the attendance.

Brightspace LMS:
This course is managed through the Brightspace LMS. All course materials and announce- ments will be posted in Brightspace. It is students’ responsibility to keep themselves updated. For a Brightspace training, please contact the TLSS or visit https://uottawa.saea-tlss. ca/en/students-tlss.
Midterms and Final Exam:
Exams are managed through Brightspace.
• Midterm 1, March 02 (50 min) • Midterm 2, April 01 (50 min) • Final Exam 3 hours
Midterm Absence and Travel:
An absence with a valid reason is required to be reported within 24 hours. Otherwise the score will be zero. If you are planning to travel during the midterm exams, you should get an approval from the program director. No weight transfer is possible.
Excessive Number of Doctor’s Notes and Excuses:
In such a case, the program director will be asked to review the case.
Assessment:
All major course components (midterms and final) must be participated, otherwise an EIN will be given (equivalent to an F). Moreover, a student will not be allowed to write the final exam, if the attendance goes below 80% or the average grade goes below the minimum passing grade (55%).
Communications and Office Hours:
Emails can be sent to the instructor. The standard response time is one business day. An online appointment can be scheduled when it is necessary.
TA Contacts: Students can contact a TA for office hours. An email will be sent regarding the TA’s contact information.

Academic Integrity:
Visit the University of Ottawa’s academic integrity policy:
https://www.uottawa.ca/vice-president-academic/academic-integrity
Academic Accommodation:
Services are available for the students who have a disability or functional limitation and who need adaptive measures:
https://sass.uottawa.ca/en/access/adapted-exams https://sassit.uottawa.ca/ventus/student/?lang=en-CA
Other Important Link:
• Visit https://it.uottawa.ca/servicedesk for IT support.
Tentative Sequence of Lecture Topics:
• Course Introduction
• Propositional Logic (Textbook Chapter 1)
• Predicate Logic (Textbook Chapter 1)
• Inference Rules and Proofs (Textbook Chapter 1) • Number Theory (Textbook Chapter 4)
• Induction (Textbook Chapter 5)
• Recurrence Relations (Textbook Chapter 8)
• Graphs (Textbook Chapters 10 and 11)

程序代写 CS代考加微信: assignmentchef QQ: 1823890830 Email: [email protected]