DURGAPUR INSTITUTE OF ADVANCED TECHNOLOGY AND MANAGEMENT DEPARTMENT OF INFORMATION TECHNOLOGY

Size: px
Start display at page:

Download "DURGAPUR INSTITUTE OF ADVANCED TECHNOLOGY AND MANAGEMENT DEPARTMENT OF INFORMATION TECHNOLOGY"

Transcription

1 DURGAPUR INSTITUTE OF ADVANCED TECHNOLOGY AND MANAGEMENT DEPARTMENT OF INFORMATION TECHNOLOGY Subject Code: CS 402 Subject Name: Formal Language & Automata Theory Semester : IV Year: 2 ND Session : 2019 Branch Name: Information Technology Faculty Name: Amit Kumar Datta Assistant Professor IT Department Syllabus Prerequisites of Formal Language & Automata Theory: Elementary discrete mathematics including the notion of set,function,relation,product,partial order,equivalence relation,graph& tree. They should have a thorough understanding of the principle of mathematical induction. Module-1: [13 L] Fundamentals: Basic definition of sequential circuit, block diagram, mathematical representation, concept of transition table and transition diagram (Relating of Automata concept to sequential circuit concept) Design of sequence detector, Introduction to finite state model.finite state machine: Definitions, capability & state equivalent, kth- equivalent concept. Merger graph, Merger table, Compatibility graph.finite memory definiteness, testing table & testing graph. Deterministic finite automaton and non deterministic finite automaton. Transition diagrams and Language recognizers. Finite Automata: NFA with Î transitions - Significance, acceptance of languages. Conversions and Equivalence: Equivalence between NFA with and without Î transitions. NFA to DFA conversion. Minimization of FSM, Equivalence between two FSM s, Limitations of FSM. Application of finite automata, Finite Automata with output- Moore & Melay machine. Module-2: [8 L] Regular Languages : Regular sets. Regular expressions, identity rules. Arden s theorem state and prove. Constructing finite Automata for a given regular expressions, Regular string accepted by NFA/DFA. Pumping lemma of regular sets. Closure properties of regular sets (proofs not required). Grammar Formalism: Regular grammars-right linear and left linear grammars. Equivalence between regular linear grammar and FA. Inter conversion, Context free grammar. Derivation trees, sentential forms. Right most and leftmost derivation of strings. (Concept only). Module-3: [9L] Context Free Grammars, Ambiguity in context free grammars. Minimization of Context Free Grammars. Chomsky normal form and Greibach normal form. Pumping Lemma for Context Free Languages. Enumeration of properties of CFL (proofs omitted). Closure property of CFL, Ogden s lemma & its applications. Push Down Automata: Push down automata, definition. Acceptance of CFL, Acceptance by final state and acceptance by empty state and its equivalence. Equivalence of CFL and PDA, interconversion. (Proofs not required). Introduction to DCFL and DPDA. Module-4: [6L] Turing Machine : Turing Machine, definition, model. Design of TM, Computable functions. Church s hypothesis, counter machine.types of Turing machines (proofs not required). Universal Turing Machine, Halting problem. TEXT BOOK: 1. Introduction to Automata Theory Language and Computation, Hopcroft H.E. and Ullman J. D., Pearson education. 2. Theory of Computer Science, Automata Languages and computation, Mishra and Chandrashekaran, 2nd edition, PHI. 3. Formal Languages and Automata Theory, C.K.Nagpal, Oxford REFERENCE BOOK: 1. Switching & Finite Automata, ZVI Kohavi, 2nd Edn., Tata McGraw Hill 2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley 3. Introduction to languages and the Theory of Computation, John C Martin, TMH 4. Elements of Theory of Computation, Lewis H.P. & Papadimitrou C.H. Pearson, PHI.

2 Course Outcomes: 1. The student will be able to define a system and recognize the behavior of a system. They will be able to minimize a system and compare different systems. 2. Student will convert Finite Automata to regular expression. 3. Students will be able to check equivalence between regular linear grammar and FA. 4. Students will be able to minimize context free grammar. 5. Student will be able to check equivalence of CFL and PDA. 6. They will be able to design Turing Machine. LESSION PLAN Sr. No. Day Reference of the Syllabus Remarks 1 Lecture 1 Fundamentals: Basic definition of sequential circuit, block diagram, mathematical representation, concept of transition tableand transition diagram 2 Lecture 2 Design of sequence detector, Introduction to finite state model 3 Lecture 3 Finite state machine: Definitions, capability & state equivalent, kth- equivalent concept 4 Lecture 4 Merger graph, Merger table, Compatibility graph 5 Lecture 5 Finite memory definiteness, testing table & testing graph. 6 Lecture 6 Deterministic finite automaton and non deterministic finite automaton. 7 Lecture 7 Transition diagrams and Language recognizers. 8 Lecture 8 Finite Automata: NFA with Î transitions - Significance, acceptance of languages. 9 Lecture 9 Conversions and Equivalence: Equivalence between NFA with and without Î transitions. NFA to DFA conversion 10 Lecture 10 Conversions and Equivalence: Equivalence between NFA with and without Î transitions. NFA to DFA conversion. 11 Lecture 11 Minimization of FSM, Equivalence between two FSM s, Limitations of FSM 12 Lecture 12 Application of finite automata, Finite Automata with output- Moore & Melay machine. 13 Lecture 13 Regular Languages: Regular sets. 14 Lecture 14 Regular expressions, identity rules. Arden s theorem state and prove 15 Lecture 15 Constructing finite Automata for a given regular expressions, Regular string accepted by NFA/DFA 16 Lecture 16 Pumping lemma of regular sets. Closure properties of regular sets 17 Lecture 17 Grammar Formalism: Regular grammars-right linear and left linear grammars.

3 18 Lecture 18 Equivalence between regular linear grammar and FA. 19 Lecture 19 Inter conversion, Context free grammar. 20 Lecture 20 Derivation trees, sentential forms. Right most and leftmost derivation of strings. 21 Lecture21 Context Free Grammars, Ambiguity in context free grammars. 22 Lecture 22 Minimization of Context Free Grammars. 23 Lecture 23 Chomsky normal form 24 Lecture 24 Greibach normal form 25 Lecture 25 Pumping Lemma for Context Free Languages. 26 Lecture 26 Enumeration of properties of CFL. Closure property of CFL, Ogden s lemma & its application 27 Lecture 27 Push Down Automata: Push down automata, definition. 28 Lecture 28 Acceptance of CFL, Acceptance by final state and acceptance by empty state and its equivalence. 29 Lecture 29 Equivalence of CFL and PDA, inter conversion. 30 Lecture 30 Introduction to DCFL and DPDA. 31 Lecture 31 Turing Machine : Turing Machine, definition, model 32 Lecture 32 Design of TM, Computable functions 33 Lecture 33 Church s hypothesis, counter machine 34 Lecture 34 Types of Turing machines 35 Lecture 35 Universal Turing Machine 36 Lecture 36 Halting problem Signature of HOD Signature of the faculty

4 DURGAPUR INSTITUTE OF ADVANCED TECHNOLOGY AND MANAGEMENT DEPARTMENT OF INFORMATION TECHNOLOGY Name of the Faculty: Mr. Amit Kumar Datta Subject: Introduction to Computing Paper Code: CS 402 Semester/Branch: 2 nd Semester/ IT Lesson Plan Lecture No. Reference of the Topic(s) to be covered Syllabus 1 History of Computer, Generation of Computer, Classification of Computers, Basic Anatomy of Computer System 2 Primary & Secondary Memory, Processing Unit, Input & Output devices 3 Binary & Allied number systems

5 representation of signed and unsigned numbers. BCD, ASII. Binary Arithmetic 4 logic gates 5 Assembly language, high level language, compiler and assembler 6 Basic concepts of operating systems like MS DOS, MS WINDOW, UNIX, Algorithm & flow chart 7 The C character set identifiers and keywords, data type & sizes 8-10 variable names, declaration, statements, Arithmetic operators, relational and logical operators, type 11 conversion, increment and decrement operators, bit wise operators, assignment operators and expressions precedence and order of evaluation. Input and Output: Standard input and output, formatted output -- printf, formatted input scanf 14 Statement and blocks, if - else, switch loops - while, for do while, break and continue, go to and labels Basic of functions, function types, functions returning values functions not returning values, auto, external 22 static and register variables, scope rules recursion, function prototypes, C preprocessor, command line arguments One dimensional arrays, pointers and functions 28 multidimensional arrays 29 Basic of structures, structures and functions 30 arrays of structures, bit fields 31 formatted and unformatted files Reference book:

A R "! I,,, !~ii ii! A ow ' r.-ii ' i ' JA' V5, 9. MiN, ;

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 information

Language properties and Grammar of Parallel and Series Parallel Languages

Language 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 information

GACE Computer Science Assessment Test at a Glance

GACE 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 information

A General Class of Noncontext Free Grammars Generating Context Free Languages

A 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 information

Enumeration of Context-Free Languages and Related Structures

Enumeration 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 information

Computer Science 141: Computing Hardware Course Information Fall 2012

Computer Science 141: Computing Hardware Course Information Fall 2012 Computer Science 141: Computing Hardware Course Information Fall 2012 September 4, 2012 1 Outline The main emphasis of this course is on the basic concepts of digital computing hardware and fundamental

More information

Self Study Report Computer Science

Self 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 information

CS 101 Computer Science I Fall Instructor Muller. Syllabus

CS 101 Computer Science I Fall Instructor Muller. Syllabus CS 101 Computer Science I Fall 2013 Instructor Muller Syllabus Welcome to CS101. This course is an introduction to the art and science of computer programming and to some of the fundamental concepts of

More information

RANKING AND UNRANKING LEFT SZILARD LANGUAGES. Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A ER E P S I M S

RANKING 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 information

CS 1103 Computer Science I Honors. Fall Instructor Muller. Syllabus

CS 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 information

WSU Five-Year Program Review Self-Study Cover Page

WSU 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 information

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR

COMPUTATIONAL 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 information

Grammars & Parsing, Part 1:

Grammars & 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 information

Designing a Computer to Play Nim: A Mini-Capstone Project in Digital Design I

Designing a Computer to Play Nim: A Mini-Capstone Project in Digital Design I Session 1793 Designing a Computer to Play Nim: A Mini-Capstone Project in Digital Design I John Greco, Ph.D. Department of Electrical and Computer Engineering Lafayette College Easton, PA 18042 Abstract

More information

Erkki Mäkinen State change languages as homomorphic images of Szilard languages

Erkki 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 information

PESIT SOUTH CAMPUS 10CS71-OBJECT-ORIENTED MODELING AND DESIGN. Faculty: Mrs.Sumana Sinha No. Of Hours: 52. Outcomes

PESIT 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 information

On the Polynomial Degree of Minterm-Cyclic Functions

On 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 information

A Version Space Approach to Learning Context-free Grammars

A 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 information

We are strong in research and particularly noted in software engineering, information security and privacy, and humane gaming.

We are strong in research and particularly noted in software engineering, information security and privacy, and humane gaming. Computer Science 1 COMPUTER SCIENCE Office: Department of Computer Science, ECS, Suite 379 Mail Code: 2155 E Wesley Avenue, Denver, CO 80208 Phone: 303-871-2458 Email: info@cs.du.edu Web Site: Computer

More information

School of Innovative Technologies and Engineering

School 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 information

Visual CP Representation of Knowledge

Visual CP Representation of Knowledge Visual CP Representation of Knowledge Heather D. Pfeiffer and Roger T. Hartley Department of Computer Science New Mexico State University Las Cruces, NM 88003-8001, USA email: hdp@cs.nmsu.edu and rth@cs.nmsu.edu

More information

arxiv: v1 [math.at] 10 Jan 2016

arxiv: 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 information

University of Groningen. Systemen, planning, netwerken Bosman, Aart

University of Groningen. Systemen, planning, netwerken Bosman, Aart University of Groningen Systemen, planning, netwerken Bosman, Aart IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document

More information

Radius STEM Readiness TM

Radius 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 information

SAM - Sensors, Actuators and Microcontrollers in Mobile Robots

SAM - 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 information

Informatics 2A: Language Complexity and the. Inf2A: Chomsky Hierarchy

Informatics 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 information

Proof Theory for Syntacticians

Proof 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 information

ENEE 302h: Digital Electronics, Fall 2005 Prof. Bruce Jacob

ENEE 302h: Digital Electronics, Fall 2005 Prof. Bruce Jacob Course Syllabus ENEE 302h: Digital Electronics, Fall 2005 Prof. Bruce Jacob 1. Basic Information Time & Place Lecture: TuTh 2:00 3:15 pm, CSIC-3118 Discussion Section: Mon 12:00 12:50pm, EGR-1104 Professor

More information

Parsing of part-of-speech tagged Assamese Texts

Parsing 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 information

Bluetooth mlearning Applications for the Classroom of the Future

Bluetooth mlearning Applications for the Classroom of the Future Bluetooth mlearning Applications for the Classroom of the Future Tracey J. Mehigan Daniel C. Doolan Sabin Tabirca University College Cork, Ireland 2007 Overview Overview Introduction Mobile Learning Bluetooth

More information

Objectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition

Objectives. 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 information

Innovative Methods for Teaching Engineering Courses

Innovative Methods for Teaching Engineering Courses Innovative Methods for Teaching Engineering Courses KR Chowdhary Former Professor & Head Department of Computer Science and Engineering MBM Engineering College, Jodhpur Present: Director, JIETSETG Email:

More information

PH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.)

PH.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 information

Course Specifications

Course Specifications Course Specifications Institution Date of Report 4.12.1434 College/Department Faculty of Computers and Information Technology / Department Information Technology A. Course Identification and General Information

More information

1.11 I Know What Do You Know?

1.11 I Know What Do You Know? 50 SECONDARY MATH 1 // MODULE 1 1.11 I Know What Do You Know? A Practice Understanding Task CC BY Jim Larrison https://flic.kr/p/9mp2c9 In each of the problems below I share some of the information that

More information

MASTER OF SCIENCE (M.S.) MAJOR IN COMPUTER SCIENCE

MASTER 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 information

Module 12. Machine Learning. Version 2 CSE IIT, Kharagpur

Module 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 information

Be aware there will be a makeup date for missed class time on the Thanksgiving holiday. This will be discussed in class. Course Description

Be aware there will be a makeup date for missed class time on the Thanksgiving holiday. This will be discussed in class. Course Description HDCN 6303-METHODS: GROUP COUNSELING Department of Counseling and Dispute Resolution Southern Methodist University Thursday 6pm 10:15pm Jan Term 2013-14 Be aware there will be a makeup date for missed class

More information

Software Development: Programming Paradigms (SCQF level 8)

Software Development: Programming Paradigms (SCQF level 8) Higher National Unit Specification General information Unit code: HL9V 35 Superclass: CB Publication date: May 2017 Source: Scottish Qualifications Authority Version: 01 Unit purpose This unit is intended

More information

Integrating simulation into the engineering curriculum: a case study

Integrating simulation into the engineering curriculum: a case study Integrating simulation into the engineering curriculum: a case study Baidurja Ray and Rajesh Bhaskaran Sibley School of Mechanical and Aerospace Engineering, Cornell University, Ithaca, New York, USA E-mail:

More information

(Sub)Gradient Descent

(Sub)Gradient Descent (Sub)Gradient Descent CMSC 422 MARINE CARPUAT marine@cs.umd.edu Figures credit: Piyush Rai Logistics Midterm is on Thursday 3/24 during class time closed book/internet/etc, one page of notes. will include

More information

ARNE - A tool for Namend Entity Recognition from Arabic Text

ARNE - A tool for Namend Entity Recognition from Arabic Text 24 ARNE - A tool for Namend Entity Recognition from Arabic Text Carolin Shihadeh DFKI Stuhlsatzenhausweg 3 66123 Saarbrücken, Germany carolin.shihadeh@dfki.de Günter Neumann DFKI Stuhlsatzenhausweg 3 66123

More information

CS Machine Learning

CS Machine Learning CS 478 - Machine Learning Projects Data Representation Basic testing and evaluation schemes CS 478 Data and Testing 1 Programming Issues l Program in any platform you want l Realize that you will be doing

More information

A Neural Network GUI Tested on Text-To-Phoneme Mapping

A Neural Network GUI Tested on Text-To-Phoneme Mapping A Neural Network GUI Tested on Text-To-Phoneme Mapping MAARTEN TROMPPER Universiteit Utrecht m.f.a.trompper@students.uu.nl Abstract Text-to-phoneme (T2P) mapping is a necessary step in any speech synthesis

More information

CS4491/CS 7265 BIG DATA ANALYTICS INTRODUCTION TO THE COURSE. Mingon Kang, PhD Computer Science, Kennesaw State University

CS4491/CS 7265 BIG DATA ANALYTICS INTRODUCTION TO THE COURSE. Mingon Kang, PhD Computer Science, Kennesaw State University CS4491/CS 7265 BIG DATA ANALYTICS INTRODUCTION TO THE COURSE Mingon Kang, PhD Computer Science, Kennesaw State University Self Introduction Mingon Kang, PhD Homepage: http://ksuweb.kennesaw.edu/~mkang9

More information

Evolution of Collective Commitment during Teamwork

Evolution of Collective Commitment during Teamwork Fundamenta Informaticae 56 (2003) 329 371 329 IOS Press Evolution of Collective Commitment during Teamwork Barbara Dunin-Kȩplicz Institute of Informatics, Warsaw University Banacha 2, 02-097 Warsaw, Poland

More information

An Introduction to the Minimalist Program

An 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 information

Rule Learning with Negation: Issues Regarding Effectiveness

Rule Learning with Negation: Issues Regarding Effectiveness Rule Learning with Negation: Issues Regarding Effectiveness Stephanie Chua, Frans Coenen, and Grant Malcolm University of Liverpool Department of Computer Science, Ashton Building, Ashton Street, L69 3BX

More information

Mathematics. Mathematics

Mathematics. Mathematics Mathematics Program Description Successful completion of this major will assure competence in mathematics through differential and integral calculus, providing an adequate background for employment in

More information

CS 598 Natural Language Processing

CS 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 information

Montana Content Standards for Mathematics Grade 3. Montana Content Standards for Mathematical Practices and Mathematics Content Adopted November 2011

Montana Content Standards for Mathematics Grade 3. Montana Content Standards for Mathematical Practices and Mathematics Content Adopted November 2011 Montana Content Standards for Mathematics Grade 3 Montana Content Standards for Mathematical Practices and Mathematics Content Adopted November 2011 Contents Standards for Mathematical Practice: Grade

More information

16 WEEKS STUDY PLAN FOR BS(IT)2 nd Semester

16 WEEKS STUDY PLAN FOR BS(IT)2 nd Semester 16 WEEKS STUDY PLAN FOR BS(IT)2 nd Semester COURSE: OBJECT ORIENTED PROGRAMMING Week Ch# Chapter Names 1 1 The Big Picture 2 2 C++ Programming Basics 3 3 Loops and Decisions 4 4 Structures 5 4 Structures

More information

Introduction and Motivation

Introduction and Motivation 1 Introduction and Motivation Mathematical discoveries, small or great are never born of spontaneous generation. They always presuppose a soil seeded with preliminary knowledge and well prepared by labour,

More information

Software Maintenance

Software Maintenance 1 What is Software Maintenance? Software Maintenance is a very broad activity that includes error corrections, enhancements of capabilities, deletion of obsolete capabilities, and optimization. 2 Categories

More information

ATW 202. Business Research Methods

ATW 202. Business Research Methods ATW 202 Business Research Methods Course Outline SYNOPSIS This course is designed to introduce students to the research methods that can be used in most business research and other research related to

More information

Rule Learning With Negation: Issues Regarding Effectiveness

Rule Learning With Negation: Issues Regarding Effectiveness Rule Learning With Negation: Issues Regarding Effectiveness S. Chua, F. Coenen, G. Malcolm University of Liverpool Department of Computer Science, Ashton Building, Ashton Street, L69 3BX Liverpool, United

More information

A Practical Approach to Embedded Systems Engineering Workforce Development

A Practical Approach to Embedded Systems Engineering Workforce Development A Practical Approach to Embedded Systems Engineering Workforce Development Özgür Yürür 1 [ John McLellan 2, Andy Mastronardi 3, Ed Harrold 4, Wilfrido Moreno 5 ] Abstract It is common to find digital electronic

More information

AP Calculus AB. Nevada Academic Standards that are assessable at the local level only.

AP 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 information

Assignment 1: Predicting Amazon Review Ratings

Assignment 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 information

CONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS

CONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS CONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS Pirjo Moen Department of Computer Science P.O. Box 68 FI-00014 University of Helsinki pirjo.moen@cs.helsinki.fi http://www.cs.helsinki.fi/pirjo.moen

More information

Multimedia Application Effective Support of Education

Multimedia 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 information

Computer Science (CS)

Computer Science (CS) Computer Science (CS) 1 Computer Science (CS) CS 1100. Computer Science and Its Applications. 4 Hours. Introduces students to the field of computer science and the patterns of thinking that enable them

More information

Computer Science. Embedded systems today. Microcontroller MCR

Computer Science. Embedded systems today. Microcontroller MCR Computer Science Microcontroller Embedded systems today Prof. Dr. Siepmann Fachhochschule Aachen - Aachen University of Applied Sciences 24. März 2009-2 Minuteman missile 1962 Prof. Dr. Siepmann Fachhochschule

More information

Probability and Game Theory Course Syllabus

Probability and Game Theory Course Syllabus Probability and Game Theory Course Syllabus DATE ACTIVITY CONCEPT Sunday Learn names; introduction to course, introduce the Battle of the Bismarck Sea as a 2-person zero-sum game. Monday Day 1 Pre-test

More information

Reduce the Failure Rate of the Screwing Process with Six Sigma Approach

Reduce the Failure Rate of the Screwing Process with Six Sigma Approach Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 Reduce the Failure Rate of the Screwing Process with Six Sigma Approach

More information

MINISTRY OF EDUCATION

MINISTRY OF EDUCATION Republic of Namibia MINISTRY OF EDUCATION NAMIBIA SENIOR SECONDARY CERTIFICATE (NSSC) COMPUTER STUDIES SYLLABUS HIGHER LEVEL SYLLABUS CODE: 8324 GRADES 11-12 2010 DEVELOPED IN COLLABORATION WITH UNIVERSITY

More information

Backwards Numbers: A Study of Place Value. Catherine Perez

Backwards Numbers: A Study of Place Value. Catherine Perez Backwards Numbers: A Study of Place Value Catherine Perez Introduction I was reaching for my daily math sheet that my school has elected to use and in big bold letters in a box it said: TO ADD NUMBERS

More information

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 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 information

M55205-Mastering Microsoft Project 2016

M55205-Mastering Microsoft Project 2016 M55205-Mastering Microsoft Project 2016 Course Number: M55205 Category: Desktop Applications Duration: 3 days Certification: Exam 70-343 Overview This three-day, instructor-led course is intended for individuals

More information

Content Language Objectives (CLOs) August 2012, H. Butts & G. De Anda

Content Language Objectives (CLOs) August 2012, H. Butts & G. De Anda Content Language Objectives (CLOs) Outcomes Identify the evolution of the CLO Identify the components of the CLO Understand how the CLO helps provide all students the opportunity to access the rigor of

More information

Computer Organization I (Tietokoneen toiminta)

Computer Organization I (Tietokoneen toiminta) 581305-6 Computer Organization I (Tietokoneen toiminta) Teemu Kerola University of Helsinki Department of Computer Science Spring 2010 1 Computer Organization I Course area and goals Course learning methods

More information

Bluetooth mlearning Applications for the Classroom of the Future

Bluetooth mlearning Applications for the Classroom of the Future Bluetooth mlearning Applications for the Classroom of the Future Tracey J. Mehigan, Daniel C. Doolan, Sabin Tabirca Department of Computer Science, University College Cork, College Road, Cork, Ireland

More information

Class Numbers: & Personal Financial Management. Sections: RVCC & RVDC. Summer 2008 FIN Fully Online

Class Numbers: & Personal Financial Management. Sections: RVCC & RVDC. Summer 2008 FIN Fully Online Summer 2008 FIN 3140 Personal Financial Management Fully Online Sections: RVCC & RVDC Class Numbers: 53262 & 53559 Instructor: Jim Keys Office: RB 207B, University Park Campus Office Phone: 305-348-3268

More information

Basic 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 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 information

LEGO MINDSTORMS Education EV3 Coding Activities

LEGO MINDSTORMS Education EV3 Coding Activities LEGO MINDSTORMS Education EV3 Coding Activities s t e e h s k r o W t n e d Stu LEGOeducation.com/MINDSTORMS Contents ACTIVITY 1 Performing a Three Point Turn 3-6 ACTIVITY 2 Written Instructions for a

More information

B.S/M.A in Mathematics

B.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 information

Lecture 1: Machine Learning Basics

Lecture 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 information

The Use of Statistical, Computational and Modelling Tools in Higher Learning Institutions: A Case Study of the University of Dodoma

The Use of Statistical, Computational and Modelling Tools in Higher Learning Institutions: A Case Study of the University of Dodoma International Journal of Computer Applications (975 8887) The Use of Statistical, Computational and Modelling Tools in Higher Learning Institutions: A Case Study of the University of Dodoma Gilbert M.

More information

Computer Science 1015F ~ 2016 ~ Notes to Students

Computer Science 1015F ~ 2016 ~ Notes to Students Computer Science 1015F ~ 2016 ~ Notes to Students Course Description Computer Science 1015F and 1016S together constitute a complete Computer Science curriculum for first year students, offering an introduction

More information

Interactive Whiteboard

Interactive Whiteboard 50 Graphic Organizers for the Interactive Whiteboard Whiteboard-ready graphic organizers for reading, writing, math, and more to make learning engaging and interactive by Jennifer Jacobson & Dottie Raymer

More information

have 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,

have 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 information

SIE: Speech Enabled Interface for E-Learning

SIE: Speech Enabled Interface for E-Learning SIE: Speech Enabled Interface for E-Learning Shikha M.Tech Student Lovely Professional University, Phagwara, Punjab INDIA ABSTRACT In today s world, e-learning is very important and popular. E- learning

More information

Math-U-See Correlation with the Common Core State Standards for Mathematical Content for Third Grade

Math-U-See Correlation with the Common Core State Standards for Mathematical Content for Third Grade Math-U-See Correlation with the Common Core State Standards for Mathematical Content for Third Grade The third grade standards primarily address multiplication and division, which are covered in Math-U-See

More information

IBM Software Group. Mastering Requirements Management with Use Cases Module 6: Define the System

IBM Software Group. Mastering Requirements Management with Use Cases Module 6: Define the System IBM Software Group Mastering Requirements Management with Use Cases Module 6: Define the System 1 Objectives Define a product feature. Refine the Vision document. Write product position statement. Identify

More information

Data Structures and Algorithms

Data Structures and Algorithms CS 3114 Data Structures and Algorithms 1 Trinity College Library Univ. of Dublin Instructor and Course Information 2 William D McQuain Email: Office: Office Hours: wmcquain@cs.vt.edu 634 McBryde Hall see

More information

PRODUCT COMPLEXITY: A NEW MODELLING COURSE IN THE INDUSTRIAL DESIGN PROGRAM AT THE UNIVERSITY OF TWENTE

PRODUCT COMPLEXITY: A NEW MODELLING COURSE IN THE INDUSTRIAL DESIGN PROGRAM AT THE UNIVERSITY OF TWENTE INTERNATIONAL CONFERENCE ON ENGINEERING AND PRODUCT DESIGN EDUCATION 6 & 7 SEPTEMBER 2012, ARTESIS UNIVERSITY COLLEGE, ANTWERP, BELGIUM PRODUCT COMPLEXITY: A NEW MODELLING COURSE IN THE INDUSTRIAL DESIGN

More information

Comprehension Recognize plot features of fairy tales, folk tales, fables, and myths.

Comprehension Recognize plot features of fairy tales, folk tales, fables, and myths. 4 th Grade Language Arts Scope and Sequence 1 st Nine Weeks Instructional Units Reading Unit 1 & 2 Language Arts Unit 1& 2 Assessments Placement Test Running Records DIBELS Reading Unit 1 Language Arts

More information

The Strong Minimalist Thesis and Bounded Optimality

The 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 information

Course Content Concepts

Course Content Concepts CS 1371 SYLLABUS, Fall, 2017 Revised 8/6/17 Computing for Engineers Course Content Concepts The students will be expected to be familiar with the following concepts, either by writing code to solve problems,

More information

Abstractions and the Brain

Abstractions 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 information

Modeling user preferences and norms in context-aware systems

Modeling user preferences and norms in context-aware systems Modeling user preferences and norms in context-aware systems Jonas Nilsson, Cecilia Lindmark Jonas Nilsson, Cecilia Lindmark VT 2016 Bachelor's thesis for Computer Science, 15 hp Supervisor: Juan Carlos

More information

ME 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) 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 information

Writing Research Articles

Writing Research Articles Marek J. Druzdzel with minor additions from Peter Brusilovsky University of Pittsburgh School of Information Sciences and Intelligent Systems Program marek@sis.pitt.edu http://www.pitt.edu/~druzdzel Overview

More information

Circuit Simulators: A Revolutionary E-Learning Platform

Circuit Simulators: A Revolutionary E-Learning Platform Circuit Simulators: A Revolutionary E-Learning Platform Mahi Itagi Padre Conceicao College of Engineering, Verna, Goa, India. itagimahi@gmail.com Akhil Deshpande Gogte Institute of Technology, Udyambag,

More information

IAT 888: Metacreation Machines endowed with creative behavior. Philippe Pasquier Office 565 (floor 14)

IAT 888: Metacreation Machines endowed with creative behavior. Philippe Pasquier Office 565 (floor 14) IAT 888: Metacreation Machines endowed with creative behavior Philippe Pasquier Office 565 (floor 14) pasquier@sfu.ca Outline of today's lecture A little bit about me A little bit about you What will that

More information

Context Free Grammars. Many slides from Michael Collins

Context 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 information

Machine Learning and Data Mining. Ensembles of Learners. Prof. Alexander Ihler

Machine Learning and Data Mining. Ensembles of Learners. Prof. Alexander Ihler Machine Learning and Data Mining Ensembles of Learners Prof. Alexander Ihler Ensemble methods Why learn one classifier when you can learn many? Ensemble: combine many predictors (Weighted) combina

More information

Learning Methods for Fuzzy Systems

Learning Methods for Fuzzy Systems Learning Methods for Fuzzy Systems Rudolf Kruse and Andreas Nürnberger Department of Computer Science, University of Magdeburg Universitätsplatz, D-396 Magdeburg, Germany Phone : +49.39.67.876, Fax : +49.39.67.8

More information

OFFICE SUPPORT SPECIALIST Technical Diploma

OFFICE SUPPORT SPECIALIST Technical Diploma OFFICE SUPPORT SPECIALIST Technical Diploma Program Code: 31-106-8 our graduates INDEMAND 2017/2018 mstc.edu administrative professional career pathway OFFICE SUPPORT SPECIALIST CUSTOMER RELATIONSHIP PROFESSIONAL

More information

CS 100: Principles of Computing

CS 100: Principles of Computing CS 100: Principles of Computing Kevin Molloy August 29, 2017 1 Basic Course Information 1.1 Prerequisites: None 1.2 General Education Fulfills Mason Core requirement in Information Technology (ALL). 1.3

More information