ITCS 2175-052: Logic and Algorithms
Department of Computer Science
University of North Carolina Charlotte
Fall 2015 (August 24th – December 18th)
Instructor: Dr. Ann Aksut
Office: Woodward 230A
Office Hours: By appointment only
Email: aaksut@uncc.edu
COURSE:
Description
This course is an introduction to propositional calculus, predicate calculus, algorithms, logic
functions, finite-state machines; logic design.
Objective:
The objective of this course is to equip students with mathematical concepts and techniques
essential to computer science: (a) logic, (b) sets, (c) algorithms, (d) induction and recursion, (e)
simple counting techniques, (f) relations, (g) graph theory, (h) Boolean algebra, (i) finite-state
machines.
Prerequisites:
ITCS-1212 or ITIS-1212 or ITCS-1214 (Minimum Grade of D)
and
MATH-1120 or MATH-1241 or ENGR 1241 (Minimum Grade of D)
Textbook:
Discrete Math, zyBook. (This textbook is REQUIRED and is used for homework assignments,
practice quizzes, extra problems, reading, and as a reference).
ACADEMIC INTEGRITY:
Please read the Academic Integrity Code http://www.legal.uncc.edu/policies/ps-105.html
Academic honesty and integrity are essential to the existence and growth of an academic community. Without
maintenance of high standards of honesty, members of the instructional faculty are defrauded, students are unfairly
treated, and society itself is poorly served. Maintaining the academic standards of honesty and integrity is ultimately
the formal responsibility of the instructional faculty; and this responsibility is shared by all members of the academic
community. UNC Charlotte strives to create an academic climate in which the dignity of all individuals is respected and
maintained. Therefore, we celebrate diversity that includes, but is not limited to ability/disability, age, culture, ethnicity,
gender, language, race, religion, sexual orientation, and socio-economic status.
Students have the responsibility to know and observe the requirements of The UNCC Code of Student Academic
Integrity (Catalog p. 275). This code forbids cheating, fabrication or falsification of information, multiple submissions
of academic work, plagiarism, abuse of academic materials, and complicity in academic dishonesty. Any special
requirements or permission regarding academic integrity in this course will be stated by the instructor, and are binding
on the students. Academic evaluations in this course include a judgment that the student’s work is free from academic
dishonesty of any type; and grades in this course therefore should be and will be adversely affected for academic
dishonesty. Students who violate the code can be expelled from UNCC. The normal penalty for first offense is zero
credit on the work involving dishonesty and further substantial reduction of the course grade. In almost all cases the
course grade is reduced to F. Students are expected to report cases of academic dishonesty to the course instructor.
ASSIGNMENT DUE DATES:
All assignments have a due date. Requests for assistance with completing assignments (including assignment
questions) must be submitted via email by one week prior the assignment is due. Computer and Internet connectivity
issues are not acceptable excuses for missing assignments. It is the student's responsibility to ensure that personal
computers are functioning and that Internet connectivity is available. Students are also responsible for having a
backup plan if something should happen to their computer or Internet connectivity during the semester. Late
assignments will not be accepted.
MAKE-UP POLICY
To protect a student’s privacy, doctor and employer notes are not accepted as reasons for missing assignments.
Start assignments early to avoid missing deadlines. Extra credit is not available in this class. Exceptions to the above
Prepared by: Dr. Ann Aksut
Page 1
policy: governmental requirements such as military assignments or jury duty (valid documentation must be provided).
Family emergencies such as deaths, extended illness, and hospitalizations will be reviewed on a case-by-case basis.
Make up for quizzes and exams will only be granted under exceptional under exceptional circumstances. Instructor
reserves the right to deny requests for make-up. Homework due dates may be extended for special circumstances.
Be sure to request these, if needed, before the due date.
COMMUNICATION
Your UNCC email account is the main communication tool used in this course. You should check your UNCC email
daily. Emails from a non-UNCC email address will not be answered in this class. Emails should include your course
and section number in the subject line (example: ITCS-2175-52). I may not answer your email if the above email
format is not followed.
Failing to read emails or announcements will not be an acceptable excuse for missing critical information.
Emails sent after 4:00 p.m. will usually be answered the following day (with the exception of holidays, meetings or
mandatory college travel such as seminars or training). Please note: Emails sent over the weekends will be answered
on Mondays (with the exception of holidays, meetings or mandatory college travel such as seminars or training).
Resubmit your email if you do not hear from your instructor within 48 hours (with the exceptions listed above).
GRADING POLICY:
Grades are assigned using a 10-point grading scale.
Category
Homework (8)
Practice Quizzes (43)
Tests (3)
Letter Grade
A
B
C
D
F
%
90% or above
80%-89.9%
70%-79.9%
60%-69.9%
59.9% or below
Points
50 pts each
5 pts each
195 pts each
Total
400 pts
215 pts
585 pts
1200 pts
Weight
33%
18%
49%
Points
1080 or above
between 960 and 1079
between 840 and 959
between 720 and 839
719 or below
LECTURE MATERIALS:
Course materials will be made available from the class website: https://moodle2.uncc.edu
Prepared by: Dr. Ann Aksut
Page 2
COURSE SCHEDULE:
Due Date
Wed. Sept. 2
Wed. Sept. 16
Wed. Sept. 30
Sections
1-Logic and Algorithms
2-Sets
3-Functions and
Sequences
Thur. Oct. 1
Wed. Oct. 14
Prepared by: Dr. Ann Aksut
4-Algorithms
Topics
Propositions / Operations
Practice Quiz-1
Compound propositions
Practice Quiz-2
Conditional statements
Practice Quiz-3
Logical equivalence
Practice Quiz-4
Predicates and quantifiers
Practice Quiz-5
Quantified statements
Practice Quiz-6
De Morgan quant statements
Practice Quiz-7
Homework 1
Sets and subsets
Practice Quiz-8
Sets of sets
Practice Quiz-9
Union and intersection
Practice Quiz-10
More set operations
Practice Quiz-11
Set identities
Practice Quiz-12
Homework 2
Definition of functions
Practice Quiz-13
Floor and ceiling
Practice Quiz-14
Properties of functions
Practice Quiz-15
Inverse of a function
Practice Quiz-16
Composition of functions
Practice Quiz-17
Sequences
Practice Quiz-18
Recurrence relations
Practice Quiz-19
Summations
Practice Quiz-20
Homework 3
TEST 1
Algorithms
Practice Quiz-21
The Growth of functions
Practice Quiz-22
Analysis of algorithms
Practice Quiz-23
Homework 4
Page 3
Wed. Oct. 28
5-Induction and Recursion
Wed. Nov. 11
6-Counting
Thur. Nov. 12
Wed. Nov. 25
7-Relations
Wed. Dec. 9
8-Boolean Algebra
Mon. Dec. 14
Prepared by: Dr. Ann Aksut
Mathematical induction
Practice Quiz-24
Recursive Definitions
Practice Quiz-25
Structural induction
Practice Quiz-26
Homework 5
Sum and product rules
Practice Quiz-27
Bijection rule
Practice Quiz-28
Generalized product rule
Practice Quiz-29
Counting permutations
Practice Quiz-30
Inclusion and exclusion principle
Practice Quiz-31
Generating permutations and combinations
Practice Quiz-32
Pigeonhole principle
Practice Quiz-33
Homework 6
TEST 2
Intro to binary relations
Practice Quiz-34
Properties of binary relations
Practice Quiz-35
Directed graphs, paths, and cycles
Practice Quiz-36
Composition of relations
Practice Quiz-37
Transitive closure
Practice Quiz-38
Matrix multiplication
Practice Quiz-39
N-ary relations
Practice Quiz-40
Homework 7
Intro to Boolean algebra
Practice Quiz-41
Boolean functions
Practice Quiz-42
Gates and circuits
Practice Quiz-43
Homework 8
TEST 3 (Final Exam)
Page 4