PUNJABI UNIVERSITY, PATIALA

SYLLABI

OUTLINES OF TESTS,

AND COURSES OF READINGS

FOR

MCA (MASTER OF COMPUTER APPLICATIONS)

(SEMESTER SYSTEM)

THIRD YEAR (V and VI Semester)

2017-18 SESSION

PUNJABI UNIVERSITY,

PATIALA 147002

SYLLABI

OUTLINES OF PAPERS AND TESTS

M.C.A. (MASTER OF COMPUTER APPLICATIONS)

THIRD YEAR-FIFTH SEMESTER EXAMINATIONS

2017-18 SESSION

CODE NO. / TITLE OF PAPER / MAXIMUM MARKS
CONTINUOUS
ASSESSMENT / UNIVERSITY
EXAMINATION / TOTAL
MARKS / TIME TOTAL
ALLOWED
MCA-311 / Artificial Intelligence / 50 / 50 / 100 / 3 Hrs.
MCA-312 / Computer Graphics / 50 / 50 / 100 / 3 Hrs
MCA-313 / Theory of Computation / 50 / 50 / 100 / 3 Hrs.
MCA-314 / Business Intelligence / 50 / 50 / 100 / 3 Hrs.
MCA-315 / Programming Lab-V
(Computer Graphics) / 60 / 40 / 100 / 3 Hrs.
MCA-316 / *Elective / 50 / 50 / 100 / 3 Hrs.
Total / 310 / 290 / 600

*List of Electives: Any one of the following papers:

MCA-316 E1 / Windows Programming.
MCA-316 E2 / Digital Image Processing
MCA-316 E3 / Web Technology
MCA-316 E4 / Advanced Operating Systems with case study of UNIX

* Note: The electives will be offered to the students depending upon the availability of the teachers. The decision of the Head of the Department in this respect will be final.

CONTINUOUS ASSESSMENT (THEORY PAPERS)

1. / Two tests will be conducted during the Semester. Both the tests will be considered for assessment. / : / 60% of the marks allotted for Continuous Assessment
2. / Assessment/Quizzes / : / 20% of the marks allotted for Continuous Assessment
3. / Attendance / : / 10% of the marks allotted for Continuous Assessment.
4. / Class Participation and behaviour / : / 10% of the marks allotted for Continuous Assessment.

CONTINUOUS ASSESSMENT (PRACTICAL LAB)

1. / Two tests will be conducted during the semester. Both the tests will be counted for assessment. / : / 60% of the total marks allotted for continuous assessment.
2. / Lab Assignments / : / 30% of the total marks allotted for continuous assessment.
3. / Attendance / : / 10% of the total marks allotted for continuous assessment.

L T P C

4 0 0 4

MCA-311: Artificial Intelligence

Maximum Marks: 50 Maximum Time: 3 Hrs.

Minimum Pass Marks: 40% Lectures to be delivered: 45-55

A) Instructions for paper-setter

The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates

1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of scientific calculator is allowed.

SECTION A

Introduction to AI: Definitions, Basic Elements of AI, Application Areas.

Problems, Problem spaces and Search: Defining problem as a state space search, Production systems, problem characteristics, Production system characteristics.

Heuristic Search Techniques: Generate and Test, Hill climbing, Best First Search, Problem reduction, constraint satisfaction and Mean-ends analysis

SECTION B

Knowledge Representation: Properties of good knowledge representation, Approaches to knowledge representation.

Predicate logic: Prepositional logic, Computable functions and predicate logic, well-formed formulae, conversion to clausal form, unification, resolution.

Rule-based Programming in AI: Procedural vs. declarative knowledge, Logic Programming, forward vs. backward reasoning.

AI Language PROLOG: Features of PROLOG, Elementary Data Types, Compound objects in PROLOG, Writing simple program in PROLOG, Understanding Default flow control of the PROLOG Program, Controlling Program Flow with cut and fail, List Manipulation, String manipulation, Arithmetic operators, Input /Output statement.

SECTION C

Reasoning under uncertainty: Introduction to non-monotonic reasoning, logics for non-monotonic reasoning.

Statistical reasoning: Certainty factors and rule-based system, Bayesian networks, Dempster-Shafer theory.

Knowledge Representation using Weak and strong Slot-and-Filler structures: Semantic nets, frames, conceptual dependencies, Scripts.

SECTION D

Learning in AI: Definition, types of learning.

Expert System: Architecture and components of an expert system, Applications.

Natural language processing: Features of natural language, Steps in Natural Language Processing, Syntactic processing – Grammar and Parsers, Augmented Transition Networks, Semantic analysis – Semantic grammars, Case Grammars, Conceptual parsers, discourse and pragmatic processing – types of relation among sentences.

Text Books:

1.  Elaine Rich and Kevin Knight,Artificial Intelligence, Tata McGraw- Hill Publications

2.  Dan W. Patterson, Introduction to Artificial Intelligence and Expert Systems, PHI.

3.  William Clocksin and C.S. Mellish, Programming in PROLOG, Narosa Publishing Co.

Reference Books:

1.  E. Charnaik and D. McDermott," Introduction to artificial Intelligence", Addison-Wesley Publishing Company.

2.  Nils J. Nilson, “Principles of Artificial Intelligence”, Narosa Publishing Co.

3.  SanjivaNath, “Turbo PROLOG”, Galgotia Publications Pvt. Ltd.

4.  M. Chandwick and J.A. Hannah, “Expert Systems for Personal Computers”, Galgotia Publications Pvt. Ltd.

L T P C

4 0 0 4

MCA-312: Computer Graphics

Maximum Marks: 50 Maximum Time: 3 Hrs.

Minimum Pass Marks: 40% Lectures to be delivered: 45-55

A) Instructions for paper-setter

The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates

1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of scientific calculator is allowed.

SECTION A

Computer Graphics: Introduction, Applications areas, Components of Interactive Computer Graphics System.

Input devices: Keyboard, Touch panel, Light pens, Graphic tablets, Joysticks, Trackball, Data glove, Digitizer, Image scanner, Mouse, Voice Systems.

Hard copy output devices: Impact and non-impact printers, such as line printer, dot matrix, laser, ink-jet, electrostatic, flatbed and drum plotters.

Video Display Devices: Refresh cathode ray tube systems – raster scan CRT displays, random scan CRT displays, colour CRT-monitors, direct view storage tube. Flat panel displays – emissive vs non emissive displays, LCD displays, plasma panel displays, 3-D viewing devices, virtual reality.

SECTION B

Scan conversion: Line (DDA and Bresenham line algorithm), Circle (Polar, Bresenham and Mid-point circle algorithm), Ellipse(Polar and Midpoint ellipse algorithm), Area filling techniques (Boundary fill, Flood fill, scan line area fill algorithm), character generation, limitations of scan conversion.

2-dimensional Graphics: 2D Cartesian and Homogeneous co-ordinate system, Geometric transformations (translation, Scaling, Rotation, Reflection, Shearing), Composite transformations, two dimensional viewing transformation and clipping (Cohen –Sutherland, Liang-Barsky, Sutherland-Hodge man algorithms).

SECTION C

3-dimensional Graphics: 3D Cartesian and Homogeneous co-ordinate system, Geometric transformations (translation, Scaling, Rotation, Reflection), Composite transformations.

Mathematics of Projections – Perspective Projections, Anomalies of perspective projections, Parallel Projections, orthographic and oblique projections. Introduction to 3D viewing pipeline and clipping.

SECTION D

Hidden line and surface elimination algorithms: z-buffer, scan-line, sub-division, Painter's algorithm.

Illumination Models: Diffuse reflection, Specular reflection, refracted light, texture surface patterns, Halftoning, Dithering.

Surface Rendering Methods: Constant Intensity method, Gouraud Shading, Phong Shading.

Text Book:

1.  Donald Hearn and M.Pauline Baker, Computer Graphics, Pearson Education.

Reference Books:

1.  J.D. Foley, A.V. Dam, S.K. Feiner, J.F. Hughes,. R.L Phillips, ”Introduction to Computer Graphics”, Addison-Wesley Publishing company.

2.  R.A. Plastock and G. Kalley, “Computer Graphics”, McGraw Hill.


L T P C

4 0 0 4

MCA-313 : Theory of Computation

Maximum Marks: 50 Maximum Time: 3 Hrs.

Minimum Pass Marks: 40% Lectures to be delivered: 45-55

A) Instructions for paper-setter

The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates

1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of scientific calculator is allowed.

SECTION A

Formal language, Need for formal computational models, Non computational models.

Finite Automata: Deterministic finite Automata, Non deterministic finite Automata, Equivalence of NFA and DFA, Finite Automata with Epsilon-moves. 2-Way Finite Automata, Crossing sequences, Moore and Mealy Machine, Application of finite automata i.e. Lexical Analyzers, text editors.

SECTION B

Regular Expression and Languages: Regular expression, Equivalence of finite Automata and Regular expressions, Conversion between regular expressions and finite automata: Application of Regular Expressions : Regular Expression in UNIX, Lexical analysis, Finding pattern in text.

Regular Languages and Regular sets: Pumping lemma for regular sets, Applications of pumping lemma. Closure properties of regular language, The Myhill-Nerode Theorem, Minimization of finite Automata.

SECTION C

Context free Grammar and Languages: Context free Grammars: Derivation Trees, Leftmost and rightmost derrivations, Ambiguity, Parsing techniques for parsing of general CFG's-Early's, Cook-Kassami-Younger (CKY) and Tomitas's Parsing. Properties of Context free Languages- Normal forms for context free grammars, The Pumping Lemma for context free Languages; Closure properties of context free languages.

SECTION D

Pushdown Automata: Pushdown Automata: Deterministic Push Down Automata; Equivalence of Push Down Automata and Context free grammar. Linear Bounded Automata (LBA): Power of LBA, Closure Properties.

Turning Machine (TM): One Tape, multitape, The notions of time and space complexity in terms of T.M. Construction of simple problems. Computational complexity.

Chomsky Hierarchy of Languages: Recursive and recursively-enumerable languages.

Text Book:

1.  John E. Hopcroft, Rajeev Motwani and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Pearson Education.

ReferenceBooks:

1.  Daniel I.A. Cohen, "Introduction to Computer Theory", Wiley.

2.  B. M. Moret, “The Theory of Computation”, Pearson Education Asia.

3.  H.R. Lewis and C.H. Papa dimitriou, “Elements of the theory of Computation”, Pearson Education Asia.


L T P C

4 0 0 4

MCA-314: Business Intelligence

Maximum Marks: 50 Maximum Time: 3 Hrs.

Minimum Pass Marks: 40% Lectures to be delivered: 45-55

A) Instructions for paper-setter

The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates

1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of scientific calculator is allowed.

Section A

Introduction to Business Intelligence, Digital data and its types – structured, semi-structured and unstructured, Introduction to Online Transaction Processing (OLTP), Online Analytical Processing (OLAP), Different OLAP architectures: MOLAP, ROLAP, HOLAP, Comparison of OLTP and OLAP. BI Definitions and need, BI Component Framework, Business Applications of BI.

Section B

Data Warehouse: Definition, reasons and goals of a data warehouse. What constitutes a data warehouse. Introduction to Extraction-Transformation-Loading (ETL), Data integration, needs and advantages of using data integration, introduction to common data integration approaches, Introduction to Data Quality, Data Profiling concepts and applications.

Section C

Multi-Dimensional Data Modeling, Introduction to data and dimension modeling, Multi-dimensional data model, ER Modeling vs. Multi-dimensional modeling, Concepts of dimensions, facts, cubes, attribute, hierarchies, Typical Dimensional models - star and snowflake schema

Section D

Basics of Enterprise Reporting: Features of good reporting, Common report layout types, Report delivery formats, Report standardization and presentation practices, Brief introduction to Balanced scorecard, and Enterprise dashboards, Balanced scorecards vs. Enterprise dashboards.

Text Book:

1.  R.N. Prasad, SeemaAcharya, Fundamentals of Business Analytics, Wiley India Ltd.

Reference Books:

1.  Mike Biere, Business Intelligence for the Enterprise, Prentice Hall Professional.

2.  David Taniar, Progressive methods in Data Warehousing and Business Intelligence: Concepts and competitive analytics, Idea Group Inc.


L T P C

0 0 6 3

MCA-315: Programming Lab -V (Computer Graphics)

Maximum Marks: 100* Maximum Time: 3 Hrs.

Minimum Pass Marks: 40% Practical units to be conducted: 55-65

This laboratory course will mainly comprise of exercises based on paper MCA-312: Computer Graphics

*The splitting of marks is as under

·  Maximum Marks for Continuous Assessment: 60

·  Maximum Marks for University Examination: 40

CONTINUOUS ASSESSMENT (PRACTICAL LAB)

1. / Two tests will be conducted during the semester. Both the tests will be counted for assessment. / : / 60% of the total marks allotted for continuous assessment.
2. / Lab Assignments / : / 30% of the total marks allotted for continuous assessment.
3. / Attendance / : / 10% of the total marks allotted for continuous assessment.

NOTE: The examiner will give due weightage to Logic development/ Program execution, Lab records and viva-voce of the student while awarding marks to the student during end-semester final practical examination.

L T P C

4 0 0 4

MCA-316 E1: Windows Programming

Maximum Marks: 50 Maximum Time: 3 Hrs.

MinimumPass Marks: 40% Lectures to be delivered: 45-55

A) Instructions for paper-setter

The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates

1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of scientific calculator is allowed.

SECTION A

Windows Programming: Traditional Programming Paradigms, Overview of Windows Programming,Event Driven Programming.Data Types, Windows Messages, Device Contexts, Document Interfaces, Dynamic Linking Libraries, Software Development Kit (SDK) Tools, Context Help.