ITCS 2175-003: Logics and Algorithms
Fall 2014 (August 18th – December 12th)
Instructor: Dr. Ann Aksut
Office: Woodward 230A
Office Hours: By appointment only
Email: aaksut@uncc.edu
COURSE:
Description
Prerequisites:
Assessment:
This course is an introduction to propositional calculus, predicate calculus, algorithms, logic
functions, finite-state machines; logic design.
ITCS 1212, and MATH 1120 or MATH 1241.
All homework, quizzes, exams are done in Moodle2.
TEXT / REQUIRED MATERIAL / SOFTWARE:

Discrete Mathematics and its Applications, by Kenneth H. Rosen, 7 th edition.

Moodle 2

Fast internet access to download and view lectures, complete assignments, exams, etc.
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.
GRADING POLICY:
Grades are assigned using a 10-point grading scale.
Category
Homework (8)
Quizzes (20)
Tests (3)
Letter Grade
A
B
C
D
F
Points
45 pts each
12 pts each
200 pts each
%
90% or above
80%-89.9%
70%-79.9%
60%-69.9%
59.9% or below
Prepared by: Dr. Ann Aksut
Total
360 pts
240 pts
600 pts
1200 pts
Weight
30%
20%
50%
Points
1080 or above
between 960 and 1079
between 840 and 959
between 720 and 839
719 or below
Page 1
COURSE SCHEDULE:
Due Date
Chapter
Section
1
1-1
1-2
1-3
Wed. Sept. 3
1-4
2
2-1
2-2
2-3
Wed. Sept. 17
2-4
Wed. Sept. 24
3
3-1
3-2
Wed. Oct. 1
5
5-1
5-3
Wed. Oct. 15
6
6-1
6-2
Wed. Oct. 29
6-3
Wed. Nov. 5
9
9-1
9-3
Wed. Nov. 12
12
12-1
13
13-2
Wed. Nov. 26
Wed. Dec. 3
Wed. Dec. 10
Prepared by: Dr. Ann Aksut
13-3
Topics
Propositional Logic
Practice Quiz-1
Applications of Propositional Logic
Practice Quiz-2
Propositional Equivalences
Practice Quiz-3
Predicates and Quantifiers
Practice Quiz-4
Homework 1
Sets
Practice Quiz-5
Set Operations
Practice Quiz-6
Functions
Practice Quiz-7
Sequences
Practice Quiz-8
Homework 2
TEST 1
Algorithms
Practice Quiz-9
The Growth of Functions-Big O
Practice Quiz-10
Homework 3
Inductions
Practice Quiz-11
Recursive Definitions
Practice Quiz-12
Homework 4
Basics of Counting
Practice Quiz-13
Pigeonhole Principle
Practice Quiz-14
Permutations and Combinations
Practice Quiz-15
Homework 5
TEST 2
Relations and Their Properties
Practice Quiz-16
Representing Relations
Practice Quiz-17
Homework 6
Boolean Functions
Practice Quiz-18
Homework 7
Finite-State Machines with Output
Practice Quiz-19
Finite-State Machine without Output
Practice Quiz-20
Homework 8
TEST 3 (Final Exam)
Page 2