{"id":689,"date":"2014-09-04T16:25:20","date_gmt":"2014-09-04T08:25:20","guid":{"rendered":"http:\/\/people.utm.my\/sitizaiton\/?page_id=689"},"modified":"2015-01-20T14:20:47","modified_gmt":"2015-01-20T06:20:47","slug":"theory-of-computer-science","status":"publish","type":"page","link":"https:\/\/people.utm.my\/sitizaiton\/theory-of-computer-science\/","title":{"rendered":"Theory of Computer Science"},"content":{"rendered":"<p style=\"text-align: center\"><strong>2014\/2015 <\/strong><\/p>\n<p style=\"text-align: center\"><strong>SEMESTER 1 <\/strong><\/p>\n<p style=\"text-align: center\"><strong>THEORY OF COMPUTER SCIENCE<br \/>\n<\/strong><\/p>\n<table style=\"height: 2812px\" border=\"1\" width=\"445\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td valign=\"top\" width=\"23%\"><b>Lecturer<\/b><\/td>\n<td valign=\"top\" width=\"2%\">:<\/td>\n<td valign=\"top\" width=\"73%\"><b>PM Dr Siti Zaiton Mohd Hashim<\/b><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"23%\"><b>Room No.<\/b><\/td>\n<td valign=\"top\" width=\"2%\">:<\/td>\n<td valign=\"top\" width=\"73%\"><b>Academic Office, Level 3, N28a<\/b><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"23%\"><b>Telephone No.<\/b><\/td>\n<td valign=\"top\" width=\"2%\">:<\/td>\n<td valign=\"top\" width=\"73%\"><b>0197726248<\/b><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"23%\"><b>E-mail<\/b><\/td>\n<td valign=\"top\" width=\"2%\">:<\/td>\n<td valign=\"top\" width=\"73%\"><b>sitizaiton@utm.my<\/b><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"23%\"><b>Synopsis<\/b><\/td>\n<td valign=\"top\" width=\"2%\">:<\/td>\n<td valign=\"top\" width=\"73%\">This course introduces students to formal languages and automata theory. It will emphasize on grammar, language and abstract machine such as Regular Grammar, Context Free Grammar, Finite Automata, Push Down Automata, and Turing Machine. The course will also provide practice on the acceptability of data by these machines. At the end of the course, students should be able to apply the theory in constructing this abstract machine and testing them with the right data.<\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"23%\"><b>Learning Outcome<\/b><\/td>\n<td valign=\"top\" width=\"2%\">:<\/td>\n<td valign=\"top\" width=\"73%\">\u00a0At the end of the course, students should be able to :<\/p>\n<ul>\n<ul>\n<li>Describe the theory of Computer Science.<\/li>\n<li>Apply and explain the theory in solving the given problems.<\/li>\n<li>Discuss and make decision to solve problems related to computer science theory.<\/li>\n<li>Work collaboratively in a team to solve problems using current information related to computer science theory<\/li>\n<\/ul>\n<\/ul>\n<p><img loading=\"lazy\" decoding=\"async\" src=\"\/sitizaiton\/files\/2014\/09\/1.png\" alt=\"\" width=\"423\" height=\"290\" border=\"0\" \/><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"23%\"><strong>Student Learning Time <\/strong><\/td>\n<td valign=\"top\" width=\"2%\">:<\/td>\n<td valign=\"top\" width=\"73%\">\u00a0<img loading=\"lazy\" decoding=\"async\" src=\"\/sitizaiton\/files\/2014\/09\/2.png\" alt=\"\" width=\"423\" height=\"375\" border=\"0\" \/><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"23%\"><b>Reminder<\/b><\/td>\n<td valign=\"top\" width=\"2%\">:<\/td>\n<td valign=\"top\" width=\"73%\">\n<ul>\n<li><strong>ATTENDANCE is compulsory.<\/strong> Students with less than 80% attendance will be prohibited from sitting the final exam.<\/li>\n<li><strong>Students MUST DRESS respectably (<em>SOPAN in malay<\/em>) when attending the lecture, please follow the dress code required.<\/strong><\/li>\n<li>Students must abide by the rules set by University at all times in the lectures, laboratories and exams.<\/li>\n<li><strong>CHEATING<\/strong> in any form is <strong>PROHIBITED.<\/strong> Gred F is automatically given if the student is caught cheating during the exam. Zero mark is given if the student is found copying\/plagiarizing other\u2019s work.<\/li>\n<li><strong>Quizzes and EXAMs ARE NOT REDONE <\/strong>unless the student is sick and certified by UTM Medical panels, to be done within a week after the exam.<\/li>\n<li>LATE assignment will be penalized or rejected.<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"23%\"><b><strong><strong>TEACHING METHODOLOGY<\/strong><\/strong><\/b><\/td>\n<td valign=\"top\" width=\"2%\">:<\/td>\n<td valign=\"top\" width=\"73%\">Lecture and Discussion, Co-operative Learning, Independent Study<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\" valign=\"top\" width=\"100%\"><b>\u00a0Please Download Course Outline <a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2015\/01\/L1_SCJ3203_TCS_Sept2014-1.docx\">HERE<\/a><\/b><\/p>\n<table style=\"height: 1216px\" border=\"1\" width=\"548\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td valign=\"top\" width=\"14%\">\n<address><b>Week<\/b><\/address>\n<\/td>\n<td valign=\"top\" width=\"61%\">\n<address><b>Topics<\/b><\/address>\n<\/td>\n<td valign=\"top\" width=\"24%\">\n<address><b>Activities\/hours<\/b><\/address>\n<\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"14%\">\u00a0&#8211;<\/td>\n<td style=\"text-align: center\" valign=\"top\" width=\"61%\">\n<address><strong>SEM I<br \/>\n<\/strong><\/address>\n<\/td>\n<td valign=\"top\" width=\"24%\">\u00a0&#8211;<\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"14%\"><b><b>Week 1<br \/>\n(8\/9\/2014)<\/b><\/b><\/td>\n<td valign=\"top\" width=\"61%\"><strong>1.0\u00a0<\/strong><a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/09\/Chapter1Set.pdf\"><strong>Mathematical preliminaries<\/strong><\/a><br \/>\n<strong>1.1 <a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/12\/Greek_Symbols.pdf\">Greek Symbols<\/a><\/strong><\/td>\n<td style=\"text-align: center\" valign=\"top\" width=\"24%\">Lecture 1<br \/>\nTutorial 1<br \/>\nAssessment: <a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/09\/Chap1IntroductionExercises_2.pdf\">Tutorial 1<\/a><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"14%\"><strong>Week 2-3\u00a0 (15 &amp; 22\/9\/2014)<\/strong><\/td>\n<td valign=\"top\" width=\"61%\"><b>2.0 <a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/09\/Chapter2Languages.pdf\">Languages<\/a><\/b><br \/>\n2.1\u00a0 Language and String<br \/>\n2.2\u00a0 Finite specification of language<br \/>\n2.3\u00a0 Regular set and expressions<b><br \/>\n<\/b><\/td>\n<td style=\"text-align: center\" valign=\"top\" width=\"24%\">Lecture : 4<br \/>\nTutorial: 2<br \/>\nAssessment: Tutorial 2, Tutorial 3, Quiz 1<\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"14%\"><strong>Weeks 4-6 (29\/9 &amp; 13\/10\/2014)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/strong><b><br \/>\n<\/b><\/td>\n<td valign=\"top\" width=\"61%\"><strong>3<\/strong><b>.0 <a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/09\/Chapter3CFG.pdf\">Context Free Grammars<\/a><\/b><br \/>\n3.1\u00a0 Grammars and languages<br \/>\n3.2\u00a0 Derivation Trees<br \/>\n3.3\u00a0 Regular Grammars<\/td>\n<td style=\"text-align: center\" valign=\"top\" width=\"24%\">Lecture : 4<br \/>\nTutorial: 2<br \/>\nAssessment: Quiz 2, Tutorial 4, Tutorial 5, Assignment 1<\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"14%\"><b><\/b><strong>Week 7 <\/strong><strong>(19\/10\/2014)<\/strong><\/td>\n<td valign=\"top\" width=\"61%\"><b>SEMESTER BREAK<br \/>\n<\/b><\/td>\n<td style=\"text-align: center\" valign=\"top\" width=\"24%\"><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"14%\"><strong>Weeks 8-10 (27 &amp; 3\/10\/2014 &amp; 10\/11\/2014) \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/strong><strong>\u00a0\u00a0\u00a0 <\/strong><\/td>\n<td valign=\"top\" width=\"61%\"><strong>4<\/strong><b>.0 <a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/09\/Chapter4FA.pdf\">Finite Automata<\/a><\/b><br \/>\n4.1\u00a0 Deterministic Finite Automata (DFA)<br \/>\n4.2\u00a0 State Diagram<br \/>\n4.3\u00a0 Non Deterministic Finite Automata (NFA)<br \/>\n4.4\u00a0 Finite automata and Regular Set<br \/>\n4.5\u00a0 Regular grammars and automata<br \/>\n<b><br \/>\n<\/b><\/td>\n<td style=\"text-align: center\" valign=\"top\" width=\"24%\">Lecture : 4<br \/>\nTutorial: 2<br \/>\nAssessment: Tutorial 6, Tutorial 7, Quiz 3, Assignment 2, Test <strong>(10 November 2014, 2.30pm, BK1-BK6, N28)<\/strong><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"14%\"><strong>Week 11-12<\/strong><strong>(17 &amp; 24\/11\/2014)<\/strong><\/td>\n<td valign=\"top\" width=\"61%\"><b>5.0 <a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/09\/Chapter5PDA.pdf\">Push Down Automata (PDA)<\/a><\/b><br \/>\n5.1\u00a0 Push Down Automata<br \/>\n5.2\u00a0 Context Free Language (CFL)<\/td>\n<td style=\"text-align: center\" valign=\"top\" width=\"24%\">Lecture\u00a0: 4<br \/>\nTutorial: 2<br \/>\nAssessment: Quiz 4, Tutorial 8, Tutorial 9<a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/12\/Revised_TCS_tugasan.pdf\">Group Assignmen<\/a>t<strong>*New<\/strong><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"14%\"><strong>Week 13-14<\/strong><strong>(1 &amp; 8\/12\/2014)<\/strong><\/td>\n<td valign=\"top\" width=\"61%\"><b><\/b><strong>6.0\u00a0\u00a0\u00a0\u00a0 <a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/09\/Chapter6TM.pdf\">Turing Machine<\/a><\/strong><br \/>\n6.1\u00a0\u00a0\u00a0\u00a0 Standard Turing Machine<br \/>\n6.2\u00a0\u00a0\u00a0\u00a0 Turing machine as language acceptor<a href=\"https:\/\/docs.google.com\/file\/d\/0B29qUm3VTZQtckpLUThGdFEwOTVBQmR6c0RSMEduanlYVWVN\/edit?usp=docslist_api\">Video turing machine<\/a><\/td>\n<td style=\"text-align: center\" valign=\"top\" width=\"24%\">Lecture\u00a0: 4<br \/>\nTutorial: 2<br \/>\nAssessment: Tutorial 10,Tutorial 11<\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"14%\"><strong>Week 15<\/strong><strong>(15\/12\/2014)<\/strong><\/td>\n<td style=\"text-align: left\" valign=\"top\" width=\"61%\"><strong>7.0\u00a0\u00a0\u00a0\u00a0 <a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/09\/Chapter7Chomsky.pdf\">Chomsky Hierarchy<\/a><\/strong><br \/>\n7.1\u00a0\u00a0 Grammars<br \/>\n7.2\u00a0\u00a0 Language levels 0, 1, 2, 3<\/td>\n<td valign=\"top\" width=\"24%\"><b><b>\u00a0<\/b><\/b>Lecture\u00a0: 1<br \/>\nTutorial: 1<br \/>\n<b>Assessment: Quiz 5,Tutorial 12<\/b><\/td>\n<\/tr>\n<tr>\n<td valign=\"top\" width=\"14%\"><strong>Week 16<\/strong><strong>(21\/12\/2014)<\/strong><\/td>\n<td valign=\"top\" width=\"61%\">\n<p style=\"text-align: left\" align=\"center\"><strong><strong>8.0\u00a0\u00a0<a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/12\/SummaryTable-6.3.pdf\"> Revision (Summary)<\/a>\u00a0New**(18 Dis 2014)<\/strong><\/strong><\/p>\n<p style=\"text-align: left\" align=\"center\"><strong><a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/12\/CLUE.pdf\">CLUE EXAM<\/a>\u00a0\u00a0New**(21 Dis 2014)<\/strong><\/p>\n<p style=\"text-align: left\" align=\"center\"><strong><a href=\"https:\/\/people.utm.my\/sitizaiton\/files\/2014\/12\/Answer-1-6.pdf\">Book Answer Completed<\/a>\u00a0\u00a0New**(30\u00a0Dis 2014)<\/strong><\/p>\n<p style=\"text-align: left\" align=\"center\"><strong>VIDEO ON (30 Dis 2014)<\/strong><\/p>\n<p><a href=\"https:\/\/www.youtube.com\/watch?v=VA4kWwJc9Uo\"><strong>Finite Deterministic Automata<\/strong><\/a><\/p>\n<p><strong><a href=\"https:\/\/www.youtube.com\/watch?v=HiN4b-dzie4\">Non Finite Deterministic\u00a0 Automata<\/a><\/strong><\/p>\n<p><a href=\"https:\/\/www.youtube.com\/watch?v=_9fuEO5khrI\"><strong>Finite\u00a0 Automata<\/strong><\/a><\/p>\n<p><a href=\"https:\/\/www.youtube.com\/watch?v=MJ9xNavURY8\"><strong>Pushdown Automata<\/strong><\/a><\/p>\n<p><a href=\"https:\/\/www.youtube.com\/watch?v=IhyEGNn-7Uo\"><strong>Turing Machine<\/strong><\/a><\/td>\n<td valign=\"top\" width=\"24%\">\u00a0&#8211;<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n<p><strong>REFERENCES<\/strong><strong> \u00a0\u00a0\u00a0\u00a0\u00a0 <\/strong>:<\/p>\n<ol>\n<li>Thomas Sudkamp, Language and machine, Pearson Int. Edition, Third Edition, 2006.<\/li>\n<li>John C. Martin, Introduction to Languages and the Theory of Computation, Fourth Edition, 2011.<\/li>\n<li>Michael Sipser, Introduction to the Theory of Computation, Cengage Learning, Third Edition, 2013.<\/li>\n<li>Elaine Rich. Automata, Computability and Complexity. Pearson International Edition. Pearson Prentice Hall. 2009.<\/li>\n<\/ol>\n<p><strong>GRADING<\/strong><\/p>\n<table style=\"height: 208px;width: 510px\" border=\"1\" width=\"510\" cellspacing=\"1\">\n<tbody>\n<tr>\n<td width=\"40\"><\/td>\n<td width=\"215\"><strong>Assessment<\/strong><\/td>\n<td width=\"72\"><strong>Number<\/strong><\/td>\n<td width=\"71\"><strong>% each<\/strong><\/td>\n<td width=\"66\"><strong>% total<\/strong><\/td>\n<\/tr>\n<tr>\n<td width=\"40\">1<\/td>\n<td width=\"215\">Assignments<\/td>\n<td width=\"72\">2<\/td>\n<td width=\"71\">5%<\/td>\n<td width=\"66\">10<\/td>\n<\/tr>\n<tr>\n<td width=\"40\">2<\/td>\n<td width=\"215\">Tutorials<\/td>\n<td width=\"72\">10 of 12<\/td>\n<td width=\"71\">2%<\/td>\n<td width=\"66\">20<\/td>\n<\/tr>\n<tr>\n<td width=\"40\">3<\/td>\n<td width=\"215\">Quizzes<\/td>\n<td width=\"72\">4 of 5<\/td>\n<td width=\"71\">2.5%<\/td>\n<td width=\"66\">10<\/td>\n<\/tr>\n<tr>\n<td width=\"40\">4<\/td>\n<td width=\"215\">Mid-Term Test<\/td>\n<td width=\"72\">1<\/td>\n<td width=\"71\">25%<\/td>\n<td width=\"66\">25<\/td>\n<\/tr>\n<tr>\n<td width=\"40\">5<\/td>\n<td width=\"215\">Final Exam<\/td>\n<td width=\"72\">1<\/td>\n<td width=\"71\">35%<\/td>\n<td width=\"66\">35<\/td>\n<\/tr>\n<tr>\n<td width=\"40\"><\/td>\n<td width=\"215\"><strong>Overall Total <\/strong><\/td>\n<td width=\"72\"><\/td>\n<td width=\"71\"><\/td>\n<td width=\"66\"><strong>100<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"<p>2014\/2015 SEMESTER 1 THEORY OF COMPUTER SCIENCE Lecturer : PM Dr Siti Zaiton Mohd Hashim Room No. : Academic Office, Level 3, N28a Telephone No. : 0197726248 E-mail : sitizaiton@utm.my Synopsis : This course introduces students to formal languages and automata theory. It will emphasize on grammar, language and abstract machine such as Regular Grammar, [&hellip;]<\/p>\n","protected":false},"author":273,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-689","page","type-page","status-publish","hentry","entry"],"_links":{"self":[{"href":"https:\/\/people.utm.my\/sitizaiton\/wp-json\/wp\/v2\/pages\/689","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/people.utm.my\/sitizaiton\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/people.utm.my\/sitizaiton\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/people.utm.my\/sitizaiton\/wp-json\/wp\/v2\/users\/273"}],"replies":[{"embeddable":true,"href":"https:\/\/people.utm.my\/sitizaiton\/wp-json\/wp\/v2\/comments?post=689"}],"version-history":[{"count":0,"href":"https:\/\/people.utm.my\/sitizaiton\/wp-json\/wp\/v2\/pages\/689\/revisions"}],"wp:attachment":[{"href":"https:\/\/people.utm.my\/sitizaiton\/wp-json\/wp\/v2\/media?parent=689"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}