Home-Adhar

Formal Languages and Computability (csc360)

Grading Policy

Home works (5-6) : 30%

Midterm Exam 1:                    20%

Midterm Exam 2:                    20%

Final Exam (Comprehensive):                        30%

	Home works						Test 1	Test 2	Final
Course Learning Outcomes	1	2	3	4	5	6			X
Students develop knowledge of the mathematical foundations of computer science including set theory, relations, functions, recursion, and mathematical induction.	X						X		X
Students develop knowledge of languages and the ability to express regular languages using regular sets, regular expressions, and context-free grammars.		X					X		X
Students learn how to perform transformations of context-free grammars to normal forms.			X				X	X	X
Students develop knowledge of and an ability to create finite state automata that can accept regular languages. Further students, can remove non-determinism and produce minimal deterministic finite automata.				X				X	X
Students develop knowledge of and an ability to create pushdown automata that can accept context-free languages.					X			X	X
Students can determine whether a given language is regular, context-free, or neither by application of closure properties and the Pumping Lemmas.						X			X
Students can effectively communicate the concepts of this course by employing acceptable standard nomenclature and symbols of mathematics, proofs, sets, relations, functions, and graph theory.	X	X	X	X	X	X

Course grade: A = 90-100, B = 80-89, C = 70-79, D = 60-69, F = below 60.
Within a course grade the grade modifier -/+ will be assigned as follows:

A > 95

A-                    >= 90

B+                   >=  86

B                     >=  83

B-                    >= 80

C+                   >=  76

C                     >=  73

C-                    >= 70

D+                  >=  66

D                     >=  63

D-                   >= 60