Page 1 (Finlayson syllabus)
a) Prerequisites:
Are these relevant?
1. COT 3541 Logic for Computer Science
2. MAD 3512 Theory of Algorithms
3. STA 3033 Probability and Statistics for Computer Science
b) Prerequisite Topics
Could this be more specific in terms of basic programming and fundamental data structures?
What broad topics from discrete structures do students need coming in to this course?
c) Course Outcomes
2. …. “and so forth”
d) Page 3 (Finlayson syllabus)
The lecture hour total 22 is insufficient. This number is normally approximately 36 (12 weeks x 3 hours).
Suggested Lecture Hour distribution:
Topic
Linguistic Phenomena
Formal representations
Formal Methods
End Applications
Total Lecture Hours
Lecture
Hours
Course
Outcome
10
10
10
6
36
1
2
3
4
NB: This would mean corresponding adjustments in the Knowledge Units table (below)
e) Page 5 (Finlayson syllabus)
Credit Hours should sum to 3 (3 credit course) – may be allocated as multiples of 0.5
Fundamental CS Area
Core Hours
Advanced Hours
Algorithms
2
2
Software Design
-
-
Computer Organization and
Architecture
-
-
Data Structures
2
-
Concepts of Programming
Languages
-
-
f)
Re: Coverage of Knowledge Units (Finlayson page 6)
Knowledge Area
Knowledge Unit
Algorithms and Complexity (AL)
AL/Fundamental Data Structures and
Algorithms
AL/Basic Automata, Computability and
Complexity
IS/Fundamental Issues
IS/Basic Knowledge Representation and
Reasoning
IS/Natural Language Processing
IS/Basic Machine Learning
Algorithms and Complexity (AL)
Intelligent Systems (IS)
Intelligent Systems (IS)
Intelligent Systems (IS)
Intelligent Systems (IS)
Level
Lecture
Hours
Core Tier-?
Core Tier-?
Core Tier-2
Elective
Elective
Elective
Total Lecture Hours
Reference: ACM 2013 recommendations http://www.acm.org/education/CS2013-final-report.pdf


Algorithms and Complexity (AL)
ACM 2013 page 53
Intelligent systems (IS)
ACM 2013 page 121