B.C.A THEORY OF COMPUTATION MODULE SPECIFICATION SHEET. PES DEGREE COLLEGE BANGALORE SOUTH CAMPUS Affiliated to Bangalore University
|
|
- Garey Daniel
- 6 years ago
- Views:
Transcription
1 B.C.A THEORY OF COMPUTATION MODULE SPECIFICATION SHEET Course Outline To introduce students the basic concepts in theoretical computer science, and the formal relationships among machines, languages and grammars. The purpose of this subject is to cover the underlying concepts and techniques used in Theory of Computations. In this course we cover finite automata, pushdown automata, Context free grammars and Turing Machines. We also Cover Pumping Lemma for context free Language and Regular Language. Faculty Details BHAVYA R Assistant Professor Department of BCA bhavyareddy@pes.edu PES DEGREE COLLEGE BANGALORE SOUTH CAMPUS Affiliated to Bangalore University
2 1. GENERAL INFORMATION Academic Year : Semester : VI Title Code Duration THEORY OF COMPUTATION Credits 3 BCA601T Lectures 60 Seminars 00 Total: PRE REQUIREMENT STATEMENT This Subject has a good balance between Theory and Mathematical rigor. The students are expected to have a basic understanding of Discrete Mathematical Structures. 3. COURSE RELEVANCE In order to perform a rigorous study of computation, computer scientists work with a mathematical abstraction of computers called a model of computation. There are several models in use, but the most commonly examined is the Turing machine Computer scientists study the Turing machine because it is simple to formulate, can be analyzed and used to prove results, and because it represents what many consider the most powerful possible "reasonable" model of computation 4. LEARNING OUTCOMES 1. student can improve his/her logical thinking in solving the problems and theorems and understand the various concepts. 2. Model, compare and analyse different computational models using combinatorial methods. 3. Apply rigorously formal mathematical methods to prove properties of languages, grammars and automata. 4. Construct algorithms for different problems and argue formally about correctness on different restricted machine models of computation. 5. Identify limitations of some computational models and possible methods of proving them, this course is applicable to engineering application like designing the compilers. 5. VENUE AND HOURS/WEEK All lectures will normally be held on VII Floor. Lecture Sessions / Week : 5 2
3 6. MODULE MAP Session No Topics Portions Covered (%) Cumulative Portions Covered (%) Unit-1:Introduction Learning Objective By the end of this unit, students will be able to: Analyse and demonstrate the knowledge and ability to identify different types of finite automata and its capability. 1 Introduction Set Theory TextBook2: Chapter 1 Pg 1.2 to Terminologies used in Finite Automata Operations on strings, operations on languages TextBook2: Chapter 1: Pg 1.3 to Finite Automata(FA) Transition Diagram, table TextBook2: Chapter 1: Pg 1.6 to Applications of Finite Automata and Types of FA DFA,NFA, ε-nfa TextBook2: Chapter 1: Pg 1.7 to1.8 5 Deterministic Finite Automata(DFA) Mathematical Representation of a DFA, Extended Transition function of DFA, Language Accepted bya DFA TextBook2: Chapter 1 Pg 1.9 t % 22.41% 3
4 6 DFA Design 1.pattern Recognition problems TextBook2: Chapter 1 Pg 1.11to DFA Design 2.Divisible by K Problems TextBook2: Chapter Pg 1.11to DFA Design 3.Modulo-K-Counter problems. TextBook2: Chapter 1 Pg1.35 to Non Deterministic Finite Automata(NFA) Mathematical representation of NFA, NFA Design TextBook2: Chapter 1 Pg1.40 to Problems on Non Deterministic Finite Automata(NFA NFA Design Problems TextBook2: Chapter 1 Pg1.40 to ε-nfa Mathematical representation of ε-nfa,ε- Closure,Conversion from ε-nfa to DFA TextBook2: Chapter 1 Pg1.66 to Problems on ε-nfa Problems on constructing ε-nfa TextBook2: Chapter 1 Pg1.67 to1.74 4
5 13 Comparison of DFA, NFA,ε-NFA Comparison of DFA, NFA,ε-NFA TextBook2: Chapter 1 Pg1.74 to1.75 Unit II:Regular Expressions Learning Objective: By the end of this unit, students will be able to analyse regular expression, applications of regular expression, pumping lemma for regular expression and Minimization of finite automata. Apply rigorously formal mathematical methods to prove properties of languages, grammars and automata. 14 Introduction, Regular Expressions Properties of Regular Expressions. Pg2.2 to Basic operations of Regular Expressions, Describing Regular Expressions Basic operations of Regular Expressions, Describing Regular Expressions Pg2.9 to Construction of ε-nfa from Regular Expression Construction of ε-nfa from Regular Expression Pg2.13 to Problems on Construction of ε-nfa from Regular Expression Problems on Construction of ε-nfa from Regular Expression Pg2.20 to2.25 5
6 18 Construction of Regular Expression from Finite Automata Construction of Regular Expression from Finite Automata Pg2.25 to Application of Regular Expressions Problems on Regular Expressions Pg2.3 to Pumping Lemma for Regular Languages Theorem, Application of pumping lemma TextBook2: Chapter 2 Pg2.28 to Pumping Lemma for Regular Languages Problems on pumping lemma Pg2.30 to Properties of Regular Languages Closure Properties, Decision Properties. Pg2.37 to Minimization of Finite Automata Minimization of Finite Automata Pg2.40 to Problems on Minimization of Finite Automata Solving Problems on Minimization of Finite Automata Pg2.50 to % 43.1% 6
7 25 Problems on Minimization of Finite Automata Solving Problems on Minimization of Finite Automata Pg2.60 to 2.70 UNIT-3:Context Free Grammar: Learning Objective : By the end of this unit, students will be able to: Illustrate the Push down automata for a given language and discuss its properties. 26 Grammar,Types of Grammar Types of grammar Pg3.2 to Context Free Grammar Definition,Language accepted by a CFG Pg3.4 to Design of Language from CFG Problems Pg3.6 to Design of Context Free Grammar from Finite Automata Problems Pg.3.8to Design of Context Free Grammar from Languages Problems Pg to % 63.79% 7
8 31 Design of Context Free Grammar from Languages Problems Pg.3.17to Design of CFG from Regular Expressions Problems,Parsing/Derivation Pg.3.20to Parsing/Derivation Left Most Derivation, Right Most Derivation Pg.3.21 to Parse Tree / Derivation Tree(PT) Definition, subtree, problems, Applications of CFG Pg.3.24 to Ambiguous Grammar Definition, Problems Pg.3.29 to Pushdown Automata(PDA) Defintion,Language accepted by a PDA Pg to Construction of PDA Problems Pg. 3.40to3.51 8
9 Unit IV:Normal Forms for CFG Learning Objective: By the end of this unit, students will be able to: analyse the Chomsky Normal Form(CNF), Greibach Normal Form(GNF) 38 Introduction Substitution,Left Recursion Pg. 4.2 to Simplification of CFG Elimination of Useless Symbols Pg. 4.5 to Elimination ε- Productions ε- Productions, Nullable Variable, Method to eliminate ε- Productions Pg. 4.8to Elimination ε- Productions Problems on Elimination ε- Productions 20.69% 84.48% Pg. 4.10to16 42 Elimination Unit Productions Defintion,Procedure to eliminate unit productions, Problems Pg. 4.16to Elimination Unit Productions Problems on Elimination Unit Productions Pg. 4.24to4.39 9
10 44 Normal forms for Context- free Grammars CNF,Reduction of CFG to CNF Pg Problems Problems on CNF : Pg to Greibach Normal Form(GNF) Definition, Problems Pg to Conversion of CFG to pda Steps,Problems Pg to Pumping lemma for context free language Theorem Pg to Closure Properties of CFL s Theorem Pg to 4.71 Unit V:Turing Machine(TM) Learning Objective: By the end of this unit, students will be able to : Discuss the Abstract model of Computing machine through Turing machine and its types 50 Introduction to Turing machine(tm) Model of Turing Machine, Transition Diagram for Turing 10
11 ,Transition Table, Instantaneous Description of a TM(ID) TextBook2: Chapter 5 Pg. 5.2 to Construction of Turing machine(tm) Problems TextBook2: Chapter 5 Pg. 5.4 to Problems on Turing machine(tm) TextBook2: Chapter 5 Problems on Turing machine(tm) TextBook2: Chapter 5 Pg. 5.4 to Problems on Turing machine(tm) TextBook2: Chapter 5 Problems on Turing machine(tm) Pg to Types of Turing Machines Multi tape TM,Non deterministic TM,Multi-dimension TM,Multi head TM TextBook2: Chapter 5 Pg to Undecidability Undecidability TextBook2: Chapter 5 Pg Recursive and recursively enumerable languages Definition, Properties TextBook2: Chapter 5 Pg % 100% 11
12 57 Halting Problem of Turing Machine Theorem TextBook2: Chapter 5 Pg to The Post Correspondence Problem(PCP) Definition, Problems TextBook2: Chapter 5 Pg to Revision 60 Revision 7. RECOMMENDED BOOKS/JOURNALS/WEBSITES 7.1.Text books: 1. John E. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman: Introduction to Automata Theory, Languages and Computation, 3rd Edition, Pearson Education, Sarakutty T K, T Kohila Kangalakshmi: Theory of Computation,Skyward Publishers 7.2. Reference Books: 1. John C Martin: Introduction to Languages and Automata Theory, 3rd Edition, Tata McGraw-Hill, Daniel I.A. Cohen: Introduction to Computer Theory, 2nd Edition, John Wiley & Sons, Thomas A. Sudkamp: An Introduction to the Theory of Computer Science, Languages and Machines, 3rd Edition,Pearson Education, WEBSITES / ONLINE REFERENCES 1. http// 2. http// 8. ASSIGNMENT(S) ASSIGNMENT 1& 2 1. Draw a DFA to accept string of a s and b s having a substring aab. 2. Draw a DFA to accept strings of a s and b s having even number of a s and even number of b s? 3. Obtain a DFA to accept the language L={w: w mod 3=0} on ={a,b} 4. Construct a DFA to accept all strings on {a,b} having the prefix `baa` simulate the behaviour of DFA on baabab, abaab. 5. Explain finite automata in detail with an example. ASSIGNMENT 3 & 4 1. State and prove pumping lemma for Regular languages. 12
13 2. Construct on ε-nfa for the regular expression (0+1)*1(0+1). 3. Show that L={0 n 1 n n 0} is not Regular. 4. Show that L={W n a (W) = n b (W)} is not Regular 5. Explain Chomsky hierarchy og generative grammars. ASSIGNMENT 5 & 6 1. Construct a Turing Machine to accept the language L={0 n 1 n n 0} 2. Explain the halting problem of TM 3. Describe the Post correspondence problem. 4. Define Recursive and Recursively enumerable languages. 5. Explain Types turing Turing machine. 9. THEORY ASSESSMENT A. WRITTEN EXAMINATION The Theory Examination is for 100 Marks which will be held for duration of 3 Hrs. The Scheme and Blue Print will be released to the students once the Bangalore University releases it. B. CONTINUOUS ASSESSMENT The Continuous Assessment is conducted as per the following parameters. Parameter Assessment Marks Final Weightage Internal Test 50 Marks 37.5 Marks Assignment / 10 Marks 6.25 Marks Class Test 10 marks 6.25 Marks Total 70 Marks 50 Marks The students are hereby required to note that every internal test weightage will calculated for 44 Marks. This includes timely submission of assignments and attending class tests as conducted. Internal Test 01 Internal Test 02 Internal Test 03 Parameter MARKS 44 MARKS 44 MARKS 44 MARKS Final Internal Marks (Sum The Three Internal Tests) Attendance >95 % : 06 Marks % : 05 Marks % : 04 Marks % : 03 Marks % : 02 Marks 44 MARKS 06 MARKS 13
14 Total 50 MARKS 10. ASSESSMENT / ASSIGNMENT / CLASS TEST / ACTIVITY PLANNER Week Internal Test T1 T2 T2 Assignments Submission A1 A2 A3 A4 A5 A6 Class Test /CT /CT /CT Legend Meaning Test Topics Examinable T1, T2,T3 Internal Tests T1 Class 1 19 A1, A2, A3, A4, A5, A6 Assignments T2 Class CT Class Test T3 Class QUESTION BANK Unit-1: Introduction 2 marks Questions 1. Define Symbol, Alphabet? 2. Define ε NFA? 3. Design a DFA which ends with 01? 4. What are the Applications of Finite Automata? 5. Define extended transition function of DFA. 6. Design a DFA which accept strings of a s and b s starting with a string ab. 10 marks Questions 1. Draw a DFA to accept string of a s and b s having a substring aab. 2. Draw a DFA to accept strings of a s and b s having even number of a s and even number of b s? 3. Obtain a DFA to accept the language L={w: w mod 3=0} on ={a,b} 4. Draw a FA to accept decimal strings divisible by Differentiate between DFA, NFA, εnfa? 6. Draw a DFA to accept string of a s and b s ending with ab or ba. 7. Convert the following NFA into an equilent DFA. 14
15 Unit-2:Regular Expression 2 marks Questions 1. Define Regular Expression. 2. Construct a Regular Expression for the language consisting of all strings of a s and b s beginning with a and ending with ab. 3. Write a Regular Expression representing strings of 0 s and 1 s having odd length. 4. Write the properties of Regular languages. 5. Construct on ε-nfa for the regular expression 00* Define Closure properties and Decision properties of Regular languages. 10 marks Questions 1. State and prove pumping lemma for Regular languages. 2. Construct on ε-nfa for the regular expression (0+1)*1(0+1). 3. Show that L={0 n 1 n n 0} is not Regular. 4. Show that regular languages are closed under intersection and reversal. Unit-3:Context Free Grammars 1. Show that L={W n a (W) = n b (W)} is not Regular 2. Explain Chomsky hierarchy in generative grammars. 3. Define Parse tree and subtree with examples. 4. Construct a leftmost, rightmost, and parse tree. a)aaaaa b)abbbba c)bababbabab 5. Design a PDA to accept the language L(M)={wcw R w ε(a+b) *} where w R is the reverse of w. Unit-4:Normal Forms for CFG 2 marks 1. Define Right most Derivation and Left most Derivation. 2. Define Parsing and Ambiguous Grammar. 3. Eliminate left Recursion from the grammar. i. S->aB/bA ii. A->Ab/Sa 4. Define CFG, CNF and GNF. 5. Explain nullable variable with an example. 10 marks 1. Write the steps to Eliminate Useless symbols. 2. Write short note on Chomsky Hierarchy of languages. 3. Convert the following CFG to GNF S->AB A->BSB A->a B->b 15
16 4. Define Unit Productions & Eliminate all Unit Productions from the grammar. S->AB A->a B->C/b C->D D->E/bC E->d/Ab Unit-5:Turing Machine 2 marks questions 1. Write any four types of Turing Machine. 2. Define Post Correspondence problem 3. Define TM, Language acceptance of TM and ID of TM. 10 marks questions 1. Construct a Turing Machine to accept the language i. L={0 n 1 n n 0} 2. Explain the halting problem of TM 12. PREVIOUS QUESTION PAPERS 16
17 17
18 18
19 19
20 20
21 21
A R "! I,,, !~ii ii! A ow ' r.-ii ' i ' JA' V5, 9. MiN, ;
A R "! I,,, r.-ii ' i '!~ii ii! A ow ' I % i o,... V. 4..... JA' i,.. Al V5, 9 MiN, ; Logic and Language Models for Computer Science Logic and Language Models for Computer Science HENRY HAMBURGER George
More informationGrammars & Parsing, Part 1:
Grammars & Parsing, Part 1: Rules, representations, and transformations- oh my! Sentence VP The teacher Verb gave the lecture 2015-02-12 CS 562/662: Natural Language Processing Game plan for today: Review
More informationLanguage properties and Grammar of Parallel and Series Parallel Languages
arxiv:1711.01799v1 [cs.fl] 6 Nov 2017 Language properties and Grammar of Parallel and Series Parallel Languages Mohana.N 1, Kalyani Desikan 2 and V.Rajkumar Dare 3 1 Division of Mathematics, School of
More informationA General Class of Noncontext Free Grammars Generating Context Free Languages
INFORMATION AND CONTROL 43, 187-194 (1979) A General Class of Noncontext Free Grammars Generating Context Free Languages SARWAN K. AGGARWAL Boeing Wichita Company, Wichita, Kansas 67210 AND JAMES A. HEINEN
More informationEnumeration of Context-Free Languages and Related Structures
Enumeration of Context-Free Languages and Related Structures Michael Domaratzki Jodrey School of Computer Science, Acadia University Wolfville, NS B4P 2R6 Canada Alexander Okhotin Department of Mathematics,
More informationRANKING AND UNRANKING LEFT SZILARD LANGUAGES. Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A ER E P S I M S
N S ER E P S I M TA S UN A I S I T VER RANKING AND UNRANKING LEFT SZILARD LANGUAGES Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A-1997-2 UNIVERSITY OF TAMPERE DEPARTMENT OF
More informationA Version Space Approach to Learning Context-free Grammars
Machine Learning 2: 39~74, 1987 1987 Kluwer Academic Publishers, Boston - Manufactured in The Netherlands A Version Space Approach to Learning Context-free Grammars KURT VANLEHN (VANLEHN@A.PSY.CMU.EDU)
More informationInformatics 2A: Language Complexity and the. Inf2A: Chomsky Hierarchy
Informatics 2A: Language Complexity and the Chomsky Hierarchy September 28, 2010 Starter 1 Is there a finite state machine that recognises all those strings s from the alphabet {a, b} where the difference
More informationCOMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR
COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR ROLAND HAUSSER Institut für Deutsche Philologie Ludwig-Maximilians Universität München München, West Germany 1. CHOICE OF A PRIMITIVE OPERATION The
More informationBasic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1
Basic Parsing with Context-Free Grammars Some slides adapted from Julia Hirschberg and Dan Jurafsky 1 Announcements HW 2 to go out today. Next Tuesday most important for background to assignment Sign up
More informationSTA 225: Introductory Statistics (CT)
Marshall University College of Science Mathematics Department STA 225: Introductory Statistics (CT) Course catalog description A critical thinking course in applied statistical reasoning covering basic
More informationSelf Study Report Computer Science
Computer Science undergraduate students have access to undergraduate teaching, and general computing facilities in three buildings. Two large classrooms are housed in the Davis Centre, which hold about
More informationGRAMMAR IN CONTEXT 2 PDF
GRAMMAR IN CONTEXT 2 PDF ==> Download: GRAMMAR IN CONTEXT 2 PDF GRAMMAR IN CONTEXT 2 PDF - Are you searching for Grammar In Context 2 Books? Now, you will be happy that at this time Grammar In Context
More informationContext Free Grammars. Many slides from Michael Collins
Context Free Grammars Many slides from Michael Collins Overview I An introduction to the parsing problem I Context free grammars I A brief(!) sketch of the syntax of English I Examples of ambiguous structures
More informationAbstractions and the Brain
Abstractions and the Brain Brian D. Josephson Department of Physics, University of Cambridge Cavendish Lab. Madingley Road Cambridge, UK. CB3 OHE bdj10@cam.ac.uk http://www.tcm.phy.cam.ac.uk/~bdj10 ABSTRACT
More informationPH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.)
PH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.) OVERVIEW ADMISSION REQUIREMENTS PROGRAM REQUIREMENTS OVERVIEW FOR THE PH.D. IN COMPUTER SCIENCE Overview The doctoral program is designed for those students
More informationTHE UNIVERSITY OF SYDNEY Semester 2, Information Sheet for MATH2068/2988 Number Theory and Cryptography
THE UNIVERSITY OF SYDNEY Semester 2, 2017 Information Sheet for MATH2068/2988 Number Theory and Cryptography Websites: It is important that you check the following webpages regularly. Intermediate Mathematics
More informationBANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS
Daffodil International University Institutional Repository DIU Journal of Science and Technology Volume 8, Issue 1, January 2013 2013-01 BANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS Uddin, Sk.
More informationGrade 5 + DIGITAL. EL Strategies. DOK 1-4 RTI Tiers 1-3. Flexible Supplemental K-8 ELA & Math Online & Print
Standards PLUS Flexible Supplemental K-8 ELA & Math Online & Print Grade 5 SAMPLER Mathematics EL Strategies DOK 1-4 RTI Tiers 1-3 15-20 Minute Lessons Assessments Consistent with CA Testing Technology
More informationTeaching a Laboratory Section
Chapter 3 Teaching a Laboratory Section Page I. Cooperative Problem Solving Labs in Operation 57 II. Grading the Labs 75 III. Overview of Teaching a Lab Session 79 IV. Outline for Teaching a Lab Session
More informationRadius STEM Readiness TM
Curriculum Guide Radius STEM Readiness TM While today s teens are surrounded by technology, we face a stark and imminent shortage of graduates pursuing careers in Science, Technology, Engineering, and
More informationObjectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition Objectives Introduce the study of logic Learn the difference between formal logic and informal logic
More informationPELLISSIPPI STATE TECHNICAL COMMUNITY COLLEGE MASTER SYLLABUS APPLIED MECHANICS MET 2025
PELLISSIPPI STATE TECHNICAL COMMUNITY COLLEGE MASTER SYLLABUS APPLIED MECHANICS MET 2025 Class Hours: 3.0 Credit Hours: 4.0 Laboratory Hours: 3.0 Revised: Fall 06 Catalog Course Description: A study of
More informationSchool of Innovative Technologies and Engineering
School of Innovative Technologies and Engineering Department of Applied Mathematical Sciences Proficiency Course in MATLAB COURSE DOCUMENT VERSION 1.0 PCMv1.0 July 2012 University of Technology, Mauritius
More informationProof Theory for Syntacticians
Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 5, 2012 Logics for Linguistics Many different kinds of logic are directly applicable to formalizing theories in syntax
More informationFIGURE IT OUT! MIDDLE SCHOOL TASKS. Texas Performance Standards Project
FIGURE IT OUT! MIDDLE SCHOOL TASKS π 3 cot(πx) a + b = c sinθ MATHEMATICS 8 GRADE 8 This guide links the Figure It Out! unit to the Texas Essential Knowledge and Skills (TEKS) for eighth graders. Figure
More informationCS 598 Natural Language Processing
CS 598 Natural Language Processing Natural language is everywhere Natural language is everywhere Natural language is everywhere Natural language is everywhere!"#$%&'&()*+,-./012 34*5665756638/9:;< =>?@ABCDEFGHIJ5KL@
More informationACTL5103 Stochastic Modelling For Actuaries. Course Outline Semester 2, 2014
UNSW Australia Business School School of Risk and Actuarial Studies ACTL5103 Stochastic Modelling For Actuaries Course Outline Semester 2, 2014 Part A: Course-Specific Information Please consult Part B
More informationPESIT SOUTH CAMPUS 10CS71-OBJECT-ORIENTED MODELING AND DESIGN. Faculty: Mrs.Sumana Sinha No. Of Hours: 52. Outcomes
10CS71-OBJECT-ORIENTED MODELING AND DESIGN Faculty: Mrs.Sumana Sinha Of Hours: 52 Course Objective: The objective of this course is to enlighten students the software approach of handling large projects
More informationNatural Language Processing. George Konidaris
Natural Language Processing George Konidaris gdk@cs.brown.edu Fall 2017 Natural Language Processing Understanding spoken/written sentences in a natural language. Major area of research in AI. Why? Humans
More informationAnswer Key Applied Calculus 4
Answer Key Applied Calculus 4 Free PDF ebook Download: Answer Key 4 Download or Read Online ebook answer key applied calculus 4 in PDF Format From The Best User Guide Database CALCULUS. FOR THE for the
More informationB.S/M.A in Mathematics
B.S/M.A in Mathematics The dual Bachelor of Science/Master of Arts in Mathematics program provides an opportunity for individuals to pursue advanced study in mathematics and to develop skills that can
More informationParsing of part-of-speech tagged Assamese Texts
IJCSI International Journal of Computer Science Issues, Vol. 6, No. 1, 2009 ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 28 Parsing of part-of-speech tagged Assamese Texts Mirzanur Rahman 1, Sufal
More informationCS 1103 Computer Science I Honors. Fall Instructor Muller. Syllabus
CS 1103 Computer Science I Honors Fall 2016 Instructor Muller Syllabus Welcome to CS1103. This course is an introduction to the art and science of computer programming and to some of the fundamental concepts
More informationGrade 6: Correlated to AGS Basic Math Skills
Grade 6: Correlated to AGS Basic Math Skills Grade 6: Standard 1 Number Sense Students compare and order positive and negative integers, decimals, fractions, and mixed numbers. They find multiples and
More informationOn the Polynomial Degree of Minterm-Cyclic Functions
On the Polynomial Degree of Minterm-Cyclic Functions Edward L. Talmage Advisor: Amit Chakrabarti May 31, 2012 ABSTRACT When evaluating Boolean functions, each bit of input that must be checked is costly,
More informationIT Students Workshop within Strategic Partnership of Leibniz University and Peter the Great St. Petersburg Polytechnic University
IT Students Workshop within Strategic Partnership of Leibniz University and Peter the Great St. Petersburg Polytechnic University 06.11.16 13.11.16 Hannover Our group from Peter the Great St. Petersburg
More informationGACE Computer Science Assessment Test at a Glance
GACE Computer Science Assessment Test at a Glance Updated May 2017 See the GACE Computer Science Assessment Study Companion for practice questions and preparation resources. Assessment Name Computer Science
More informationCLASSIFICATION OF PROGRAM Critical Elements Analysis 1. High Priority Items Phonemic Awareness Instruction
CLASSIFICATION OF PROGRAM Critical Elements Analysis 1 Program Name: Macmillan/McGraw Hill Reading 2003 Date of Publication: 2003 Publisher: Macmillan/McGraw Hill Reviewer Code: 1. X The program meets
More informationPRODUCT PLATFORM DESIGN: A GRAPH GRAMMAR APPROACH
Proceedings of DETC 99: 1999 ASME Design Engineering Technical Conferences September 12-16, 1999, Las Vegas, Nevada DETC99/DTM-8762 PRODUCT PLATFORM DESIGN: A GRAPH GRAMMAR APPROACH Zahed Siddique Graduate
More informationarxiv: v1 [math.at] 10 Jan 2016
THE ALGEBRAIC ATIYAH-HIRZEBRUCH SPECTRAL SEQUENCE OF REAL PROJECTIVE SPECTRA arxiv:1601.02185v1 [math.at] 10 Jan 2016 GUOZHEN WANG AND ZHOULI XU Abstract. In this note, we use Curtis s algorithm and the
More informationPage 1 of 11. Curriculum Map: Grade 4 Math Course: Math 4 Sub-topic: General. Grade(s): None specified
Curriculum Map: Grade 4 Math Course: Math 4 Sub-topic: General Grade(s): None specified Unit: Creating a Community of Mathematical Thinkers Timeline: Week 1 The purpose of the Establishing a Community
More informationS T A T 251 C o u r s e S y l l a b u s I n t r o d u c t i o n t o p r o b a b i l i t y
Department of Mathematics, Statistics and Science College of Arts and Sciences Qatar University S T A T 251 C o u r s e S y l l a b u s I n t r o d u c t i o n t o p r o b a b i l i t y A m e e n A l a
More informationPELLISSIPPI STATE TECHNICAL COMMUNITY COLLEGE MASTER SYLLABUS APPLIED STATICS MET 1040
PELLISSIPPI STATE TECHNICAL COMMUNITY COLLEGE MASTER SYLLABUS APPLIED STATICS MET 1040 Class Hours: 3.0 Credit Hours: 3.0 Laboratory Hours: 0.0 Revised: Fall 06 Catalog Course Description: A study of the
More informationEmporia State University Degree Works Training User Guide Advisor
Emporia State University Degree Works Training User Guide Advisor For use beginning with Catalog Year 2014. Not applicable for students with a Catalog Year prior. Table of Contents Table of Contents Introduction...
More information"f TOPIC =T COMP COMP... OBJ
TREATMENT OF LONG DISTANCE DEPENDENCIES IN LFG AND TAG: FUNCTIONAL UNCERTAINTY IN LFG IS A COROLLARY IN TAG" Aravind K. Joshi Dept. of Computer & Information Science University of Pennsylvania Philadelphia,
More informationSyntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm
Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm syntax: from the Greek syntaxis, meaning setting out together
More informationErkki Mäkinen State change languages as homomorphic images of Szilard languages
Erkki Mäkinen State change languages as homomorphic images of Szilard languages UNIVERSITY OF TAMPERE SCHOOL OF INFORMATION SCIENCES REPORTS IN INFORMATION SCIENCES 48 TAMPERE 2016 UNIVERSITY OF TAMPERE
More informationLecture 1: Machine Learning Basics
1/69 Lecture 1: Machine Learning Basics Ali Harakeh University of Waterloo WAVE Lab ali.harakeh@uwaterloo.ca May 1, 2017 2/69 Overview 1 Learning Algorithms 2 Capacity, Overfitting, and Underfitting 3
More informationMillersville University Degree Works Training User Guide
Millersville University Degree Works Training User Guide Page 1 Table of Contents Introduction... 5 What is Degree Works?... 5 Degree Works Functionality Summary... 6 Access to Degree Works... 8 Login
More informationSouth Carolina English Language Arts
South Carolina English Language Arts A S O F J U N E 2 0, 2 0 1 0, T H I S S TAT E H A D A D O P T E D T H E CO M M O N CO R E S TAT E S TA N DA R D S. DOCUMENTS REVIEWED South Carolina Academic Content
More informationFoothill College Fall 2014 Math My Way Math 230/235 MTWThF 10:00-11:50 (click on Math My Way tab) Math My Way Instructors:
This is a team taught directed study course. Foothill College Fall 2014 Math My Way Math 230/235 MTWThF 10:00-11:50 www.psme.foothill.edu (click on Math My Way tab) Math My Way Instructors: Instructor:
More informationWhat the National Curriculum requires in reading at Y5 and Y6
What the National Curriculum requires in reading at Y5 and Y6 Word reading apply their growing knowledge of root words, prefixes and suffixes (morphology and etymology), as listed in Appendix 1 of the
More informationCommon Core State Standards
Common Core State Standards Common Core State Standards 7.NS.3 Solve real-world and mathematical problems involving the four operations with rational numbers. Mathematical Practices 1, 3, and 4 are aspects
More informationDiagnostic Test. Middle School Mathematics
Diagnostic Test Middle School Mathematics Copyright 2010 XAMonline, Inc. All rights reserved. No part of the material protected by this copyright notice may be reproduced or utilized in any form or by
More informationTUCSON CAMPUS SCHOOL OF BUSINESS SYLLABUS
TUCSON CAMPUS SCHOOL OF BUSINESS SYLLABUS 1. Mission Statement: Wayland Baptist University exists to educate students in an academically challenging, learningfocused and distinctively Christian environment
More informationGRADUATE STUDENT HANDBOOK Master of Science Programs in Biostatistics
2017-2018 GRADUATE STUDENT HANDBOOK Master of Science Programs in Biostatistics Entrance requirements, program descriptions, degree requirements and other program policies for Biostatistics Master s Programs
More informationAGS THE GREAT REVIEW GAME FOR PRE-ALGEBRA (CD) CORRELATED TO CALIFORNIA CONTENT STANDARDS
AGS THE GREAT REVIEW GAME FOR PRE-ALGEBRA (CD) CORRELATED TO CALIFORNIA CONTENT STANDARDS 1 CALIFORNIA CONTENT STANDARDS: Chapter 1 ALGEBRA AND WHOLE NUMBERS Algebra and Functions 1.4 Students use algebraic
More informationDocument number: 2013/ Programs Committee 6/2014 (July) Agenda Item 42.0 Bachelor of Engineering with Honours in Software Engineering
Document number: 2013/0006139 Programs Committee 6/2014 (July) Agenda Item 42.0 Bachelor of Engineering with Honours in Software Engineering Program Learning Outcomes Threshold Learning Outcomes for Engineering
More informationSAM - Sensors, Actuators and Microcontrollers in Mobile Robots
Coordinating unit: Teaching unit: Academic year: Degree: ECTS credits: 2017 230 - ETSETB - Barcelona School of Telecommunications Engineering 710 - EEL - Department of Electronic Engineering BACHELOR'S
More informationPre-Processing MRSes
Pre-Processing MRSes Tore Bruland Norwegian University of Science and Technology Department of Computer and Information Science torebrul@idi.ntnu.no Abstract We are in the process of creating a pipeline
More informationLITERACY ACROSS THE CURRICULUM POLICY
"Pupils should be taught in all subjects to express themselves correctly and appropriately and to read accurately and with understanding." QCA Use of Language across the Curriculum "Thomas Estley Community
More informationEECS 700: Computer Modeling, Simulation, and Visualization Fall 2014
EECS 700: Computer Modeling, Simulation, and Visualization Fall 2014 Course Description The goals of this course are to: (1) formulate a mathematical model describing a physical phenomenon; (2) to discretize
More informationOn-Line Data Analytics
International Journal of Computer Applications in Engineering Sciences [VOL I, ISSUE III, SEPTEMBER 2011] [ISSN: 2231-4946] On-Line Data Analytics Yugandhar Vemulapalli #, Devarapalli Raghu *, Raja Jacob
More informationAxiom 2013 Team Description Paper
Axiom 2013 Team Description Paper Mohammad Ghazanfari, S Omid Shirkhorshidi, Farbod Samsamipour, Hossein Rahmatizadeh Zagheli, Mohammad Mahdavi, Payam Mohajeri, S Abbas Alamolhoda Robotics Scientific Association
More informationModule 12. Machine Learning. Version 2 CSE IIT, Kharagpur
Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should
More informationSpring 2012 MECH 3313 THERMO-FLUIDS LABORATORY
Spring 2012 MECH 3313 THERMO-FLUIDS LABORATORY Course Description Instructor An introductory class to basic measurements and principles of engineering experimental practices. This course focuses on measurements
More informationAn Introduction to the Minimalist Program
An Introduction to the Minimalist Program Luke Smith University of Arizona Summer 2016 Some findings of traditional syntax Human languages vary greatly, but digging deeper, they all have distinct commonalities:
More informationDeveloping a TT-MCTAG for German with an RCG-based Parser
Developing a TT-MCTAG for German with an RCG-based Parser Laura Kallmeyer, Timm Lichte, Wolfgang Maier, Yannick Parmentier, Johannes Dellert University of Tübingen, Germany CNRS-LORIA, France LREC 2008,
More informationAssignment 1: Predicting Amazon Review Ratings
Assignment 1: Predicting Amazon Review Ratings 1 Dataset Analysis Richard Park r2park@acsmail.ucsd.edu February 23, 2015 The dataset selected for this assignment comes from the set of Amazon reviews for
More informationPHYSICS 40S - COURSE OUTLINE AND REQUIREMENTS Welcome to Physics 40S for !! Mr. Bryan Doiron
PHYSICS 40S - COURSE OUTLINE AND REQUIREMENTS Welcome to Physics 40S for 2016-2017!! Mr. Bryan Doiron The course covers the following topics (time permitting): Unit 1 Kinematics: Special Equations, Relative
More informationDublin City Schools Mathematics Graded Course of Study GRADE 4
I. Content Standard: Number, Number Sense and Operations Standard Students demonstrate number sense, including an understanding of number systems and reasonable estimates using paper and pencil, technology-supported
More informationAP Calculus AB. Nevada Academic Standards that are assessable at the local level only.
Calculus AB Priority Keys Aligned with Nevada Standards MA I MI L S MA represents a Major content area. Any concept labeled MA is something of central importance to the entire class/curriculum; it is a
More informationSpring 2015 IET4451 Systems Simulation Course Syllabus for Traditional, Hybrid, and Online Classes
Spring 2015 IET4451 Systems Simulation Course Syllabus for Traditional, Hybrid, and Online Classes Instructor: Dr. Gregory L. Wiles Email Address: Use D2L e-mail, or secondly gwiles@spsu.edu Office: M
More informationMath 181, Calculus I
Math 181, Calculus I [Semester] [Class meeting days/times] [Location] INSTRUCTOR INFORMATION: Name: Office location: Office hours: Mailbox: Phone: Email: Required Material and Access: Textbook: Stewart,
More informationGuidelines for Project I Delivery and Assessment Department of Industrial and Mechanical Engineering Lebanese American University
Guidelines for Project I Delivery and Assessment Department of Industrial and Mechanical Engineering Lebanese American University Approved: July 6, 2009 Amended: July 28, 2009 Amended: October 30, 2009
More informationCARPENTRY GRADES 9-12 LEARNING RESOURCES
CARPENTRY GRADES 9-12 LEARNING RESOURCES A Reference for Selecting Learning Resources (March 2014) March 2014 Manitoba Education and Advanced Learning Manitoba Education and Advanced Learning Cataloguing
More informationClassroom Connections Examining the Intersection of the Standards for Mathematical Content and the Standards for Mathematical Practice
Classroom Connections Examining the Intersection of the Standards for Mathematical Content and the Standards for Mathematical Practice Title: Considering Coordinate Geometry Common Core State Standards
More informationThe Interface between Phrasal and Functional Constraints
The Interface between Phrasal and Functional Constraints John T. Maxwell III* Xerox Palo Alto Research Center Ronald M. Kaplan t Xerox Palo Alto Research Center Many modern grammatical formalisms divide
More information11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation
tatistical Parsing (Following slides are modified from Prof. Raymond Mooney s slides.) tatistical Parsing tatistical parsing uses a probabilistic model of syntax in order to assign probabilities to each
More informationTable of Contents. Internship Requirements 3 4. Internship Checklist 5. Description of Proposed Internship Request Form 6. Student Agreement Form 7
Table of Contents Section Page Internship Requirements 3 4 Internship Checklist 5 Description of Proposed Internship Request Form 6 Student Agreement Form 7 Consent to Release Records Form 8 Internship
More informationMath 121 Fundamentals of Mathematics I
I. Course Description: Math 121 Fundamentals of Mathematics I Math 121 is a general course in the fundamentals of mathematics. It includes a study of concepts of numbers and fundamental operations with
More informationhave to be modeled) or isolated words. Output of the system is a grapheme-tophoneme conversion system which takes as its input the spelling of words,
A Language-Independent, Data-Oriented Architecture for Grapheme-to-Phoneme Conversion Walter Daelemans and Antal van den Bosch Proceedings ESCA-IEEE speech synthesis conference, New York, September 1994
More informationMASTER OF SCIENCE (M.S.) MAJOR IN COMPUTER SCIENCE
Master of Science (M.S.) Major in Computer Science 1 MASTER OF SCIENCE (M.S.) MAJOR IN COMPUTER SCIENCE Major Program The programs in computer science are designed to prepare students for doctoral research,
More informationCOURSE BAPA 550 (816): Foundations of Managerial Economics Course Outline
COURSE GOALS To develop students the economic foundations of managerial decision making. To introduce students to issues that have a profound impact on the success of organizations producing goods or delivering
More informationBook Reviews. Michael K. Shaub, Editor
ISSUES IN ACCOUNTING EDUCATION Vol. 26, No. 3 2011 pp. 633 637 American Accounting Association DOI: 10.2308/iace-10118 Book Reviews Michael K. Shaub, Editor Editor s Note: Books for review should be sent
More informationME 4495 Computational Heat Transfer and Fluid Flow M,W 4:00 5:15 (Eng 177)
ME 4495 Computational Heat Transfer and Fluid Flow M,W 4:00 5:15 (Eng 177) Professor: Daniel N. Pope, Ph.D. E-mail: dpope@d.umn.edu Office: VKH 113 Phone: 726-6685 Office Hours:, Tues,, Fri 2:00-3:00 (or
More informationMarketing Management MBA 706 Mondays 2:00-4:50
Marketing Management MBA 706 Mondays 2:00-4:50 INSTRUCTOR OFFICE: OFFICE HOURS: DR. JAMES BOLES 441B BRYAN BUILDING BY APPOINTMENT OFFICE PHONE: 336-334-4413; CELL 336-580-8763 E-MAIL ADDRESS: jsboles@uncg.edu
More informationMultimedia Application Effective Support of Education
Multimedia Application Effective Support of Education Eva Milková Faculty of Science, University od Hradec Králové, Hradec Králové, Czech Republic eva.mikova@uhk.cz Abstract Multimedia applications have
More informationDepartment of Anthropology ANTH 1027A/001: Introduction to Linguistics Dr. Olga Kharytonava Course Outline Fall 2017
Department of Anthropology ANTH 1027A/001: Introduction to Linguistics Dr. Olga Kharytonava Course Outline Fall 2017 Lectures: Tuesdays 11:30 am - 1:30 pm, SEB-1059 Tutorials: Thursdays: Section 002 2:30-3:30pm
More informationGIS 5049: GIS for Non Majors Department of Environmental Science, Policy and Geography University of South Florida St. Petersburg Spring 2011
GIS 5049: GIS for Non Majors Department of Environmental Science, Policy and Geography University of South Florida St. Petersburg Spring 2011 Instructor Dr. Barnali Dixon Teaching Assistant: Lauren Bates
More informationENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist
Meeting 2 Chapter 7 (Morphology) and chapter 9 (Syntax) Today s agenda Repetition of meeting 1 Mini-lecture on morphology Seminar on chapter 7, worksheet Mini-lecture on syntax Seminar on chapter 9, worksheet
More informationWSU Five-Year Program Review Self-Study Cover Page
WSU Five-Year Program Review Self-Study Cover Page Department: Program: Computer Science Computer Science AS/BS Semester Submitted: Spring 2012 Self-Study Team Chair: External to the University but within
More informationMaximizing Learning Through Course Alignment and Experience with Different Types of Knowledge
Innov High Educ (2009) 34:93 103 DOI 10.1007/s10755-009-9095-2 Maximizing Learning Through Course Alignment and Experience with Different Types of Knowledge Phyllis Blumberg Published online: 3 February
More informationMTH 141 Calculus 1 Syllabus Spring 2017
Instructor: Section/Meets Office Hrs: Textbook: Calculus: Single Variable, by Hughes-Hallet et al, 6th ed., Wiley. Also needed: access code to WileyPlus (included in new books) Calculator: Not required,
More informationIntroduction to Simulation
Introduction to Simulation Spring 2010 Dr. Louis Luangkesorn University of Pittsburgh January 19, 2010 Dr. Louis Luangkesorn ( University of Pittsburgh ) Introduction to Simulation January 19, 2010 1 /
More informationA. What is research? B. Types of research
A. What is research? Research = the process of finding solutions to a problem after a thorough study and analysis (Sekaran, 2006). Research = systematic inquiry that provides information to guide decision
More informationThe Strong Minimalist Thesis and Bounded Optimality
The Strong Minimalist Thesis and Bounded Optimality DRAFT-IN-PROGRESS; SEND COMMENTS TO RICKL@UMICH.EDU Richard L. Lewis Department of Psychology University of Michigan 27 March 2010 1 Purpose of this
More informationCOVER SHEET. This is the author version of article published as:
COVER SHEET This is the author version of article published as: Sivapalan, Siva and Cregan, Peter (2005) Value of online resources for learning by distance education. CAL-laborate 14:pp. 23-27. Copyright
More informationMorphotactics as Tier-Based Strictly Local Dependencies
Morphotactics as Tier-Based Strictly Local Dependencies Alëna Aksënova, Thomas Graf, and Sedigheh Moradi Stony Brook University SIGMORPHON 14 Berlin, Germany 11. August 2016 Our goal Received view Recent
More information