0% found this document useful (0 votes)
30 views4 pages

Syllabus Automata

The document is a course syllabus for 'Automata Theory and Formal Language' at Metro Dumaguete College, detailing course objectives, content, and assessment methods. It outlines the learning outcomes, including understanding finite automata, formal languages, and their applications. Additionally, it includes class policies, grading systems, and references for further reading.

Uploaded by

Titian Lavador
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views4 pages

Syllabus Automata

The document is a course syllabus for 'Automata Theory and Formal Language' at Metro Dumaguete College, detailing course objectives, content, and assessment methods. It outlines the learning outcomes, including understanding finite automata, formal languages, and their applications. Additionally, it includes class policies, grading systems, and references for further reading.

Uploaded by

Titian Lavador
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Metro Dumaguete College, Inc.

INSTITUTE OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (ICSIT)


E.J. Blanco Extension Road, Brgy. Daro, Dumaguete City, Philippines 6200
Telephone Nos. (035) 420-9801, 420-9728 or 422-4605
Website: [Link]

COURSE SYLLABUS
COURSE DETAILS
Course Descriptive
AUTOMATA THEORY AND FORMAL LANGUAGE Type Lecture
Title
Course Code CPAF 31 Total No. of Hours 54 Hours
Credit Units 3 Units Prerequisites

Deterministic Finite automata and Non-Deterministic Finite Automata.


Course Description Finite State Machines (FSM).
Context free languages and Regular languages.

At the end of this course, the students should be able to:

1. Define and understand the difference between Deterministic Finite Automata and Non-Deterministic Finite Automata
Course Intended
2. Identify the relationship between hierarchy of formal machines and the classes of formal languages.
Learning Outcomes
3. Determine the language generated by a given grammar and to construct the corresponding grammar or automaton for a
given language
4. Identify common applications of automatons and formulate automatons that can be applied.
COURSE CONTENT
Duration Intended Learning Teaching and Learning Outcome-based
Performance Indicator Content / Topics
Week/s Outcomes (ILO) Activities (TLAs) Assessment (OBA)
Learners will be able to
understand different
Sets, Graphs, Trees, Functions
1-2 Mathematical Foundations CILO 1 1. Lecture/ Discussion Laboratory Exercise
and Relations

Learners will be able to


execute Different
Alphabets, Strings, Operation Laboratory Exercise
3-4 Languages CILO 2 1. Lecture/ Discussion
of Languages Quiz
Learners will be able to
differentiate Deterministic 1. Lecture/Discussion
Laboratory Exercise
5-6 Finite Automata From Non- CILO 1 NFA/DFA 2. Demonstration
Activity
Deterministic Finite
Automata
Learners will be able to
perform
Conversion from NFA to DFA Conversion of NFA to DFA 1. Lecture/ Discussion Laboratory Exercise
7-8 CILO 3
and vice Versa Conversion of DFA to NFA 2. Demonstration Quiz

9 Midterm Examination

Learners will be able to 1. Lecture/Discussion


Regular Expression, Regular Laboratory Exercise
10-11 understand the properties of CILO 2 2. Demonstration
Languages Activity
regular languages
Learners will be able to 1. Lecture/Discussion
12-13 understand and design PDA CILO 2 Push Down Automata 2. Demonstration Quiz
(Push Down Automata)
Learners will be able to
design Context Free Context Free Grammars and 1. Lecture/ Discussion Laboratory Exercise
14-15 CILO 1
Grammars for Context Free Context Free Languages 2. Demonstration Activity
Languages
16 Finals Examination

COURSE REQUIREMENTS, CLASS POLICY, AND GRADING SYSTEM


Course
Requirements Written long exam (Midterm and Finals)

Class Policy Uniform and Dress Code

a. Students should be in proper uniform/attire, wear school ID and appropriate shoes except during laboratory class.
b. PE Uniform should be worn only during PE class.
c. Wearing of shorts, slippers, earrings for males, spaghetti strap, etc. are not allowed.

Attendance, tardiness and absenteeism

a. Minimum of 80% attendance of the total contact hours in the subject is required (checking is done every meeting).
b. A minimum of 3 consecutive absences without justifiable reasons requires a promissory note from the college guidance coordinator.
c. 6 consecutive absences in the class mean a “drop” in the subject.
d. Failure to take the prelim exam preceded by absences means a “drop” in the subject.
e. Failure to attend regular classes after taking prelim exam means a grade of 5.0 in the subject.

a. Cheating and copying are strictly prohibited.


b. Borrowing of exam paraphernalia is NOT allowed during exams.
c. During midterm and final exams, only answer sheets, permits, calculators, pens, pencils and erasers are allowed on the desk; other
things should be deposited on a place designated by the teacher/instructor.
d. Other policies will be imposed as deemed necessary and agreed upon between the students and the subject professor.

Other Policies

a. Cell phones should be shut-off during class hours.


b. Vandalism is strictly prohibited and punishable.,
c. No smoking within the school premises.
d. Students under the influence of liquor are not allowed inside the school compound.
e. Proper grooming should be observed.
f. Other policies will be strictly imposed as contained in the student handbook.

Grading System Midterm (40%)


40%- Written (Summative test)
60%- Performance (Project and Research, Demo and Laboratories, Attendance and Behavior)

Finals (60%)
40%- Written (Summative test)
60%- Performance (Project and Research, Demo and Laboratories, Attendance and Behavior)

References
1. Kim, D & Solomon M. (2018). Fundamentals of information systems security (3 rd ed.). Massachusets: Jones & Barlett Learning.
2. Aleroud, A, Alsmadim I., Al-Omari, A., Al-Qudah, M., Burdwell, R., & Wahbeh, A. (2018). Practical information security -A competency-bases education course.
Switzeland: Springer Nature.
3. Death, D. (2017). Information security handbook. Birmingham: Packt Publishing
4. Vacca, J. (2017). Computer and Information security handbook (3 rd ed.). Massachusets: Elseviers-Morgan Kaufmann.

Prepared by:

JUFHEM V. AYCARDO

Check by:

Approved:

You might also like