meta data for this page
Differences
This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
public:dugc:cs208-toc [2015/07/08 15:34] – created anupreet | public:dugc:cs208-toc [2020/06/05 02:36] (current) – external edit 127.0.0.1 | ||
---|---|---|---|
Line 3: | Line 3: | ||
There are three parts in this proposal. | There are three parts in this proposal. | ||
- | a) Syllabus for a new core course titled 'Logic for Program Correctness' | + | a) Syllabus for a new core course titled 'Logic for Program Correctness' |
b) Deletion of some of the related topics from the course CS 208 - | b) Deletion of some of the related topics from the course CS 208 - | ||
' | ' | ||
- | Computation' | + | Computation' |
c) Dropping 2 other courses titled " | c) Dropping 2 other courses titled " | ||
331. | 331. | ||
- | -------------------------------------------------------- | + | ---- |
As suggested by DUGC, Supratik, Bharat and Om came together to decide the | As suggested by DUGC, Supratik, Bharat and Om came together to decide the | ||
Line 26: | Line 26: | ||
I Title of the Course | I Title of the Course | ||
- | i | + | i |
- | | + | L |
+ | | ||
ii Prerequisite, | ii Prerequisite, | ||
- | Syllabus: | ||
+ | Syllabus: | ||
+ | < | ||
1 Propositional logic: | 1 Propositional logic: | ||
1.1 Declarative sentences | 1.1 Declarative sentences | ||
Line 74: | Line 76: | ||
3.3 Proof calculus for total correctness | 3.3 Proof calculus for total correctness | ||
3.4 Programming by contract | 3.4 Programming by contract | ||
+ | </ | ||
Time permitting, other possible applications and tools can be covered. | Time permitting, other possible applications and tools can be covered. | ||
Line 80: | Line 83: | ||
Press, 2004. | Press, 2004. | ||
- | --------------- | + | ---- |
Once this course is introduced, CS 208 - Automata Theory and Logic can be | Once this course is introduced, CS 208 - Automata Theory and Logic can be | ||
renamed " | renamed " | ||
Line 92: | Line 96: | ||
material is anyway not being covered in CS 208 due to lack of time. | material is anyway not being covered in CS 208 due to lack of time. | ||
- | The syllabus for revised CS 208 - Thoery | + | The syllabus for revised CS 208 - Theory |
Current curriculum: | Current curriculum: | ||
- | | + | I Title of the Course |
- | i | + | |
- | P C | + | L T P C\\ |
- | | + | |
- | 0 6 | + | |
- | ii Prerequisite, | + | |
- | | + | v |
- | v | + | Rudiments of formal languages. Finite state machines(DFA/ |
- | machines | + | enumerability, |
- | (DFA/ | + | |
- | Properties of | + | Texts/ |
- | regular languages. My hill-Nerode Theorem. | + | 1. Introduction to Automata Theory, Languages and Computation, |
- | Non-regularity. | + | by John. E. Hopcroft, Rajeev Motwani, J. D. Ullman,\\ |
- | Push down automata. Properties of context-free | + | published by Pearson Education Asia, 2006.\\ |
- | languages. Turing | + | 2. Elements of the Theory of Computation, |
- | machines: | + | published |
- | computability, | + | |
- | Nondeterministic, | + | ---- |
- | of Turing | + | |
- | machines. Church' | + | |
- | enumerable | + | |
- | sets and | + | |
- | Turing computability. Universal Turing | + | |
- | machines. | + | |
- | Unsolvability, | + | |
- | The halting problem, partial solvability, | + | |
- | Turing | + | |
- | enumerability, | + | |
- | acceptability and decidability, | + | |
- | problems about Turing | + | |
- | Machines. Post`s correspondence problem. | + | |
- | Texts/ | + | |
- | | + | |
- | and | + | |
- | Computation, | + | |
- | by John. E. Hopcroft, Rajeev Motwani, J. D. | + | |
- | Ullman, published | + | |
- | | + | |
- | | + | |
- | H.R. | + | |
- | Lewis and | + | |
- | | + | |
- | Hall | + | |
- | Inc, 1981. | + | |
- | ------------------------------------------------------ | + | |
Note that there are 2 other courses titled " | Note that there are 2 other courses titled " | ||
- | 319 and CS 331, which should be dropped. | + | 319 and CS 331, which should be dropped. |