CME369 Syllabus - Theory On Computation And Visualization - 2021 Regulation Anna University

CME369 Syllabus - Theory On Computation And Visualization - 2021 Regulation Anna University

CME369

THEORY ON COMPUTATION AND VISUALIZATION

 L T P C
3003

COURSE OBJECTIVES:
1 To study the concepts and techniques of discrete mathematics for theoretical computer science.
2 To learn different formal languages and their relationship.
3 To classify and construct grammars for different languages and vice-versa.
4 To study Visualization, Graphical and Quantitative Information.
5 To learn Visualization design and data Ink.

UNIT I

REVIEW OF MATHEMATICAL THEORY

9
Sets, Functions, Logical statements, Proofs, Relations, Languages, Principal of Mathematical Induction, Strong Principle, Recursive Definitions, Structural Induction.

UNIT II

REGULAR LANGUAGES AND FINITE AUTOMATA

9
Regular Expressions, Regular Languages, Application of Finite Automata, Automata with output – Moore machine & Mealy machine, Finite Automata, Memory requirement in a recognizer, Definitions, union- intersection and complement of regular languages, Non Deterministic Finite Automata, Conversion from NFA to FA, ??- Non Deterministic Finite Automata, Conversion of NFA- ? to NFA, Kleene’s Theorem, Minimization of Finite automata, Regular And Non Regular Languages – pumping lemma.


UNIT III

CONTEXT FREE GRAMMAR (CFG) AND PUSHDOWN AUTOMATA

9
Definitions and Examples, Unions Concatenations And Kleene’s of Context free language, Regular Grammar for Regular Language, Derivations and Ambiguity , Unambiguous CFG and Algebraic Expressions, BacosNaur Form (BNF), Normal Form – CNF. Definitions, Deterministic PDA, Equivalence of CFG and PDA & Conversion, Pumping lemma for CFL, Intersections and Complements of CFL, Non-CFL.

UNIT IV

VALUE OF VISUALIZATION

9
Information Visualization, In Readings in Information Visualization, Graphical Excellence, Graphical Integrity, Sources of Graphical Integrity In The Visual Display of Quantitative Information

UNIT V

VISUALIZATION DESIGN

9
The Power of Representation, Data-Ink and Graphical Redesign, Data-Ink Maximization and Graphical Design, Data Density and Small Multiples

TOTAL: 45 PERIODS

OUTCOMES: At the end of the course the students would be able to
1. Discussing the concepts and techniques of discrete mathematics for theoretical computer science.
2. Explain the different formal languages and their relationship.
3. Discussing to classify and construct grammars for different languages and vice-versa.
4. Explaining the Visualization, Graphical and Quantitative Information.
5. Appling the Visualization design and data Ink.

TEXT BOOKS:
1. Introduction to the Theory of Computation by Michael Sipser
2. Automata Theory, Languages, and Computation By John Hopcroft, Rajeev Motowani, and Jeffrey Ullman

REFERENCES:
1. Introduction to Languages and the Theory of Computation, 4th by John Martin, Tata Mc Graw Hill
2. An introduction to automata theory and formal languages By Adesh K. Pandey, Publisher: S.K. Kataria& Sons
3. Introduction to computer theory By Deniel I. Cohen , Joh Wiley & Sons, Inc
4. Computation: Finite and Infinite By Marvin L. Minsky Prentice-Hall.
Previous
Next

Comments

Post a Comment

Popular posts from this blog

CS3491 Syllabus - Artificial Intelligence And Machine Learning - 2021 Regulation Anna University

CS3491 Syllabus - Artificial Intelligence And Machine Learning - 2021 Regulation Anna University CS3491 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING  LTPC 3024 COURSE OBJECTIVES: • The main objectives of this course are to: • Study about uninformed and Heuristic search techniques. • Learn techniques for reasoning under uncertainty • Introduce Machine Learning and supervised learning algorithms • Study about ensembling and unsupervised learning algorithms • Learn the basics of deep learning using neural networks We're excited to announce the launch of our new website! Visit NameWheelSpinner.com to explore its features and benefits. UNIT I PROBLEM SOLVING 9 Introduction to AI - AI Applications - Problem solving agents – search algorithms – uninformed
Read more

CS3451 Syllabus - Introduction To Operating Systems - 2021 Regulation Anna University

CS3451 Syllabus - Introduction To Operating Systems - 2021 Regulation Anna University CS3451 INTRODUCTION TO OPERATING SYSTEMS  LTPC 3003 COURSE OBJECTIVES: • To understand the basics and functions of operating systems. • To understand processes and threads • To analyze scheduling algorithms and process synchronization. • To understand the concept of deadlocks. • To analyze various memory management schemes. • To be familiar with I/O management and file systems. • To be familiar with the basics of virtual machines and Mobile OS like iOS and Android. We're excited to announce the launch of our new website! Visit NameWheelSpinner.com to explore its features and benefits. UNIT I INTRODUCTION 7 Computer System - Elements and organization; Operating Sy
Read more

CS3401 Syllabus - Algorithms - 2021 Regulation Anna University

CS3401 Syllabus - Algorithms - 2021 Regulation Anna University CS3401 ALGORITHMS  LTPC 3024 COURSE OBJECTIVES: • To understand and apply the algorithm analysis techniques on searching and sorting algorithms • To critically analyze the efficiency of graph algorithms • To understand different algorithm design techniques • To solve programming problems using state space tree • To understand the concepts behind NP Completeness, Approximation algorithms and randomized algorithms. We're excited to announce the launch of our new website! Visit NameWheelSpinner.com to explore its features and benefits. UNIT I INTRODUCTION 9 Algorithm analysis: Time and space complexity - Asymptotic Notations and its properties Best case, Worst case and average case analys
Read more