Syllabus of. BCA III (Bachelor of Computer Application) Semester-V



Similar documents
Artificial Intelligence. Class: 3 rd

Philadelphia University Faculty of Information Technology Department of Computer Science First Semester, 2007/2008.

Model 2.4 Faculty member + student

Computer Architecture Syllabus of Qualifying Examination

SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN

Division of Mathematical Sciences

Pushdown automata. Informatics 2A: Lecture 9. Alex Simpson. 3 October, School of Informatics University of Edinburgh als@inf.ed.ac.

Introduction to Automata Theory. Reading: Chapter 1

Bachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries

Course Manual Automata & Complexity 2015

CPIT-285 Computer Graphics

Software Development Training Camp 1 (0-3) Prerequisite : Program development skill enhancement camp, at least 48 person-hours.

Regular Expressions and Automata using Haskell

Stage III courses COMPSCI 314

INTRODUCTION TO RENDERING TECHNIQUES

CS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing

Introduction to Computer Graphics

Datavetenskapligt Program (kandidat) Computer Science Programme (master)

Implementation of Recursively Enumerable Languages using Universal Turing Machine in JFLAP

Assessment for Master s Degree Program Fall Spring 2011 Computer Science Dept. Texas A&M University - Commerce

Fast nondeterministic recognition of context-free languages using two queues

Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce

How to make the computer understand? Lecture 15: Putting it all together. Example (Output assembly code) Example (input program) Anatomy of a Computer

Monash University Clayton s School of Information Technology CSE3313 Computer Graphics Sample Exam Questions 2007

Genetic programming with regular expressions

Compiler Construction

Honors Class (Foundations of) Informatics. Tom Verhoeff. Department of Mathematics & Computer Science Software Engineering & Technology

Course Outline Department of Computing Science Faculty of Science. COMP Applied Artificial Intelligence (3,1,0) Fall 2015

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

INFORMATION TECHNOLOGY PROGRAM

DEGREE PLAN INSTRUCTIONS FOR COMPUTER ENGINEERING

COMP-557: Fundamentals of Computer Graphics McGill University, Fall 2010

SUBJECT CODE : 4074 PERIODS/WEEK : 4 PERIODS/ SEMESTER : 72 CREDIT : 4 TIME SCHEDULE UNIT TOPIC PERIODS 1. INTERNET FUNDAMENTALS & HTML Test 1

Image Processing and Computer Graphics. Rendering Pipeline. Matthias Teschner. Computer Science Department University of Freiburg

International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November ISSN

Course Information Course Number: IWT 1229 Course Name: Web Development and Design Foundation

Chapter 6: Programming Languages

Computer Science. Master of Science

ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)

Automata and Computability. Solutions to Exercises

Doctor of Philosophy in Computer Science

Course Syllabus For Operations Management. Management Information Systems

Automata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi

Department of Computer Science

Computer Science. Requirements for the Major (updated 11/13/03)

Computer Science Theory. From the course description:

Finite Automata. Reading: Chapter 2

Computer Applications in Textile Engineering. Computer Applications in Textile Engineering

Increasing Interaction and Support in the Formal Languages and Automata Theory Course

Web Development. Owen Sacco. ICS2205/ICS2230 Web Intelligence

The Halting Problem is Undecidable

Overview of E0222: Automata and Computability

Computer Science/Software Engineering

COMPUTER SCIENCE TRIPOS

Lesson Review Answers

School of Computer Science

Master of Science in Computer Science

CS5310 Algorithms 3 credit hours 2 hours lecture and 2 hours recitation every week

Computer Science MS Course Descriptions

Module Catalogue for the Bachelor Program in Computational Linguistics at the University of Heidelberg

6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, Class 4 Nancy Lynch

03 - Lexical Analysis

Increasing Interaction and Support in the Formal Languages and Automata Theory Course

Essential Mathematics for Computer Graphics fast

Course Descriptions - Computer Science and Software Engineering

Master of Science in Computer Science (Thesis option)

Introduction to Finite Automata

Department of Computer Science

Modeling of Graph and Automaton in Database

Programming Language Pragmatics

Computer Science/Mathematics Curriculum Pepperdine University

TIME SCHEDULE OBJECTIVES

CSC4510 AUTOMATA 2.1 Finite Automata: Examples and D efinitions Definitions

Regular Languages and Finite State Machines

Compiler I: Syntax Analysis Human Thought

Dhiren Bhatia Carnegie Mellon University

COMPUTER SCIENCE. 1. Computer Fundamentals and Applications

Course Overview. CSCI 480 Computer Graphics Lecture 1. Administrative Issues Modeling Animation Rendering OpenGL Programming [Angel Ch.

Semester-V. BCA 501-Software Engineering(BCA V) SDLC Models, Exploratory style and modern approaches of programming.

Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science. Unit of Study / Textbook Correlation

INTRODUCTION (Syllabus, Numerical Methods & Computational Tools)

Content. Chapter 4 Functions Basic concepts on real functions 62. Credits 11

ECS-602: Software Engineering

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. M.Sc. in Advanced Computer Science. Friday 18 th January 2008.

B2.53-R3: COMPUTER GRAPHICS. NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions.

Cut-to-the-Chase Series Web Foundations. HTML Assignment. By Eric Matthews Visit us at:

CSCI 3136 Principles of Programming Languages

Information Visualization of Attributed Relational Data

Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Language Processing Systems

Course Duration: One hour Theory and 3 hours practical per week for 15weeks. As taught in 2010/2011 Session

T Reactive Systems: Introduction and Finite State Automata

Garfield Public Schools Fine & Practical Arts Curriculum Web Design

2) Write in detail the issues in the design of code generator.

CA Compiler Construction

Classification of Natural Language Interfaces to Databases based on the Architectures

THE OPEN UNIVERSITY OF TANZANIA

William Paterson University of New Jersey Department of Computer Science College of Science and Health Course Outline

OBJECT RECOGNITION IN THE ANIMATION SYSTEM

Transcription:

Syllabus of BCA III (Bachelor of Computer Application) Semester-V Designed by Dr. S.B. Kishor GONDWANA UNIVERSITY, GADCHIROLI SESSION 2014-2015

SEM V BCA III Paper 1 Paper 2 Theory of Computational Analyzer E-Commerce and Web Designing Theory : 80 Internal : 20 Theory : 80 Internal : 20 Practical : 50 Paper 3 Computer Graphics Theory : 80 Internal : 20 Practical : 50 Paper 4 Computational Linguistics Theory : 80 Internal : 20

BCA III (Semester V) Paper I Paper II Paper III Paper IV : Theory of Computational Analyzer :E-Commerce and Web Designing :Computer Graphics : Computational Linguistics

BCA - III SEMESTER V PAPER- I: Theory of Computational Analyzer[: 80 (5BCA1) UNIT-I: FINITE AUTOMATON Finite State Machine: Finite automaton Model, Acceptance of strings and Languages, Types of FA (Deterministic Finite Automaton, Non-Deterministic Finite Automaton, NFA with ɛ Moves, Two way Deterministic Finite Automaton), Construction of DFA and NFA, Equivalence between NFA and DFA, Conversion of NFA into DFA, Minimization of FA. UNIT- II :REGULAR EXPRESSION&CONTEXT FREE GRAMMAR Regular Expression, Manipulation of Regular Expression, Equivalence between RE and FA, Inter Conversion, Pumping Lemma for Regular Set, Regular Grammar, Left Linear Grammar, Right Linear Grammar, Inter conversion of LLG and RLG Context Free Grammar, Derivation Tree, Chomsky Normal Form, Greibach Normal Form, Ambiguity in Grammar, Useless Symbol. UNIT- III:PUSH DOWN AUTOMATON AND TURING MACHINE Push Down Automaton: Definition, Model, Acceptance of CFL, Equivalence between CFL and PDA, Construction of PDA, Interconversion, Pumping Lemma for CFL. Turing Machine:Definition, Model, Acceptance of REL, Types of TM, Construction of TM,Linear Bounded Automaton, Chomsky Hierarchy. UNIT- IV : INTRODUCTION TO COMPILER Compiler :Definition of Compiler, Structure of Compiler, Lexical Analysis, Role of Lexical Analyzer, Transition Diagram for Identifier and Constant, Syntax Analysis, Parse Tree Construction, Intermediate Code Generation, Code Optimization, Principle sources of Code Optimization, Code Generation, Basic block, DAG, Construction of DAG, Book keeping, Error Handling, Typesof Compiler, Compiler Construction Tools.

Books : 1. J. D. Ullman and H. E. Hopcraft, Introduction to Automata Theory, Languages and Computation, Narosa Publication, ISBN : 81-85015-96-1 2. A. V. Aho, and J. D. Ullman, Principle of Compiler Design, Narosa Publication, ISBN : 81-85015-61-9 3. Dr. S.B. Kishor, Theory of Computation, Das Ganu Publication, ISBN : 978-93- 81660-15-7 References : 1. John C Martin, Introduction to Languages and the Theory of Computation, Tata McGraw-Hill Publication, ISBN : 0-07-049939-X 2 K. L. P. Mishra and N. Chandrashekhar, Theory of Computer Science, Prentice Hall of India, ISBN : 81-203-1271-6

BCA-III SEMESTER -V PAPER- II: E-COMMERCE AND WEB DESIGNING [: 80 (5BCA2) UNIT-I: E-Commerce and Introduction to Internet E-Commerce- Introduction, Application, Definition, Benefits of E-Commerce, Impediments of E-Commerce, Difference between Traditional and Electronic Commerce, E-Commerce Service, Electronic Data Interchange (EDI): Introduction, Benefits, Value Added Services (VAS), Online Payment Services, Trade Cycle. Introduction- Internet, Basic Internet Terms, Internet Addressing, Protocols, Internet Protocols,Services of Internet,Search Engine. UNIT-II: Basic of HTML and Tag Introduction to HTML - Introduction, Features of HTML, Advantages & Disadvantages of HTML, HTML Editors, Step to Create and View HTML Document, Basic Structure of HTML Program Tags & Attributes-Nesting of Tags, Classification of HTML Tags, Block Formatting Tags. UNIT-III: Working with HTML List - Introduction to Lists, Unordered List, Ordered List, Definition List, Nested List, Difference Between Ordered and Unordered List. Linking - Introduction, Type of Hyperlink Creation, Working with Links, Pathname and Types, Types of Linking or Anchors. Graphics in Web Page - Image Tag, Align Images, Embedding Inline Images and External Images, UNIT-IVAdvanced HTML Tables - Basic table tags and their related attribute Frames- Frames, <Frame> and <Frameset> tags and related attributes Form designs, Form Controls, Text controls, password fields, radio buttons, and check boxes. Reset and submit buttons, form control selection, option processing and text area. Books: 1) Greenstein and Feinman, Electronic Commerce, TMH, 2000, TMH, ISBN-0-07-042141-2, 2) BhushanDewan, E-Commerce, S.Chand,2001, First Edition, ISBN - 81-219-2083-3, References: 1) Complete HTML, BPB, 2010, ISBN-13:978-0-07-070194-6. 2) C.Xavier, Web Technology and Design,TMH,2010, ISBN-13:978-81-224-1450-9

BCA-III SEMESTER-V PAPER- III: COMPUTER GRAPHICS[: 80 (5BCA3) UNIT I: Introduction Geometry & Line Generation Introduction, Vectors, Pixels and Frames Buffers, Vector Generation, Character Generation, Displaying the Frame Buffer. Graphics Primitive Introduction, Display Devices, Primitive Operations, the Display File Interpreter, Normalized Device Coordinator, Display File Structure, Display Control, Text Line Style Primitive. UNIT II: Polygons, Transformations & Segments Polygons Introduction, Polygons, Polygon Representation, Entering Polygon, An Inside Test, Filling Polygons. Transformations Introduction, Matrices, Scaling Transformation, SIN & COS, Sum of Angles Identifier, Rotation, Homogeneous Coordinates and Translation, Rotation about an Arbitrary Point, Other Transformation, Display Procedures. Segments Introduction, the Segment Table, Segment Creation, Closing the Segments, Other Display File Structure, Raster Technique. UNIT III: Windowing & 3D Geometry Windowing & Clipping - Introduction, Viewing Transformation, Viewing Transformation Implementation, Clipping, Clipping of Polygons, Adding Clipping tothe System, Avoiding Division, Generalized Clipping, Position Relative toan Arbitrary Line Multiple Windowing..Interaction Introduction, Hardware, Input Devices Handling Algorithms, Event Handling, Sample Devices, Delectability Attributes, Simulating a Locator with a Pick, Pick with a Locator, Echoing, Interactive Technology. Three Dimension Geometry Introduction, 3D Geometry, Primitives and Transformation, Rotation about an Arbitrary Axis, Parallel Projection, Perspective Projection, Viewing Parameters, and Conversationto View Plan Coordinate, 3D Viewing Transformation, Special Projection. UNIT IV: Surface, Shading & Curves Hidden Surface and Lines Introduction, Back Face Removal, Pointers Algorithm, Collection of Polygons, Remembering the Style, Hidden Surface Check. Shading Introduction, Diffusion, Illustration, Point- Source Illustration, Specular Reflection, Transparency and Shadow. Curves Introduction, Curve Generation, Implementation, Interpolating Polygon, B-Spines and Curves. Books: 1) Steven Harrington, Computer Graphics a Programming Approach, Tata McGraw- Hill,ISBN- 0-07-100472-6 2) Donald Hearn Baker, Computer Graphics, Pearson Education, ISBN-81-78-08-794-4 3) S.B.Kishor, S. Dubey, B.Dikhit, Computer Graphics, Das Ganu Pub, References: 1) Newman &Sproul, Interactive Computer Graphics

2) David F Rogers, Procedural Elements for Computer Graphics, Tata McGraw Hill, 2 nd Ed, ISBN-0-07-047371-4 BCA - III SEMESTER-V PAPER-IV: COMPUTATIONAL LINGUISTICS[: 80 (5BCA4) UNIT I: Prolog Programming & A.I. Prolog: Introduction to Turbo Prolog, Structure of Languages. Cut, Fail, Recursion, Lists and Complex Structure Introduction to A.I.: Definition of AI, AI Technique, Tic-Tact-Toe, Pattern Recognition, Level ofthe Model, Criteria For Success, Problems and Problems Spaces, Defining the Problem, Production System, Control Strategies, Heuristic, Problem Characteristics. UNIT II: Problem Solving Basic Problem Solving Methods, State Space Search; Production Systems, Depth-First, Breadth- First Search, Heuristic Search - Hill Climbing, Best-First Search, Problem Reduction, Constraint Satisfaction End, Means-End Analysis UNIT III: Knowledge Representation Representing Simple Facts in Logic, Conservation to Clause Form, Resolution in Prepositional Logic and Predicative Logic, Unification Algorithm. UNIT IV: Structural Representation & Natural Language Understanding Structural Representation of Knowledge: Some Common Language Structures, Choosing Level of Representation, Finding the Right Structure, Declarative Representation. Natural Language Understanding : Concept of Understanding, Keyword Matching, Syntactic andsemantic Analysis, Understanding Language Generation and Matching Translation, General Concept of Implementation of A.I. System, Introduction to Pattern Recognition, Translation Books: 1) Rich, Knight, Nair, Artificial Intelligence, TMH, 3 rd Ed, ISBN 9780070087705 2) Dan W Patterson Introduction to Artificial Intelligence and Expert Systems,PHI,ISBN- 8120307771 3) NJ Nilsson, Principles of AI, Narosa Pub. House, 1990, ISBN-8185198292 References: 1) Peter Jackson, Introduction to Expert Systems, AWP, MA, 1992 2) RJ Schalkoff, Artificial Intelligence - an Engineering Approach, McGraw Hill Int Ed, Singapore, 1992 3) Burnham &Hall, Prolog Programming and Application