Mca Part III(Sem v to Vi)

PUNJABI UNIVERSITY, PATIALA

OUTLINES OF TESTS,SYLLABI AND COURSES OF READINGS

FOR MCA (MASTER OF COMPUTER APPLICATIONS)

(SEMESTER SYSTEM)

3rd Year (V & VI Semester)2011-12 & 2012-13 Sessions

1

SYLLABUS

OUTLINES OF PAPERS AND TESTSM.C.A. (MASTER OF COMPUTER APPLICATIONS)

THIRD YEAR-Fifth SEMESTER EXAMINATIONSYEAR 2011-12 & 2012-13Session

CODE NO. TITLE OF PAPER MAXIMUM MARKS

CONTINUOUSASSESSMENT

UNIVERSITYEXAMINATION

TOTALMARKS

TIME TOTALALLOWED

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 Seminar 100 - 100 -

MCA-315 Programming Lab-V(Graphics)

60 40 100 3 Hrs.

Elective-I 50 50 100 3 Hrs.

Total 360 240 600

List of Electives

MCA-316 E—Commerce MCA-322 Decision Support SystemsMCA-317 Corporate Strategy & Business Policy MCA-323 Communication Skills & Report WritingMCA-318 Digital Image Processing MCA-324 Graph TheoryMCA-319 Organization Behaviour and Development MCA-325 Programming LanguagesMCA-320 Advanced Operating Systems MCA-326 Theory & Programming of Embedded SystemsMCA-321 Compiler Design MCA-327 Computer Based Optimization Techniques

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 or three tests out of 60% of the marks allotted for Continuous Assessment.which minimum two will be considered for assessment.

2. Seminars/Assignments/Quizzes 30% of the marks allotted for Continuous Assessment.

3. Attendance, class participation andbehaviour 10% of the marks allotted for Continuous Assessment.

2

L T P C 3 1 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-setterThe 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 candidates1. 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 non-programmable scientific calculator is allowed.

SECTION A

Introduction to AI: Definitions, Basic Elements of AI, Application Areas.Prepositional Logic: Syntax and semantics of Preposition Logic.First Order Predicate Logic: Syntax, Semantics, Properties of wff, Clausal form, Inference rules, Unification, resolution, non deductive Inference methods.

SECTION B

Logic Programming: procedural vs. declarative knowledge, AI programming vs. conventional programming, forward vs. backward reasoning.AI Language PROLOG: Features of Prolog, Elementary Data Types, Compound objects in Prolog, Recursion, Understanding Default flow control of the Prolog Program, Controlling Program Flow with cut and fail, List Manipulation, String manipulation, Arithmetic operators, Input /Output statement, Recursion. (No programming exercises).

SECTION C

Knowledge Base Systems: Introduction, Overview of Knowledge Acquisition, Representation, Organization, manipulation. Knowledge Representation: Types of knowledge, features of good representation, structured knowledge representation techniques – semantic nets, conceptual dependencies, frames, Scripts. Knowledge Organisation and Manipulation: Features of good organization, Blind Search – Breadth first search, depth first search, Heuristic search - Simple Hill climbing, Searching OR and AND-OR graphs. Matching: Matching process, factor affecting matching. Knowledge Acquisition: Learning model.

SECTION D

Expert System: Architecture, 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. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert Systems”, PHI.2. E. Rich and K. Knight," Artificial Intelligence", Tata McGraw Hill.3. W.F. Clofisin and C.S. Mellish, “Programming in PROLOG”, Narosa Publishing Co.

References: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. Sanjiva Nath, “Turbo PROLOG”, Galgotia Publications Pvt. Ltd.4. M. Chandwick and J.A. Hannah, “Expert Systems for Personal Computers”, Galgotia Publications Pvt. Ltd.

3

L T P C 3 1 0 4

MCA-312: Computer Graphics




E.2. Use of non-programmable 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. D. Hearn and M.P. Baker, “Computer Graphics”, PHI New Delhi; Second Edition, 1995.

References:

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

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

L T P C 3 1 0 4

MCA-313: Theory of Computation




E.


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 Lemna 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 Books:

1. J.E. Hopcroft, R. Motwani and J.D. Ullamn, “Introduction to Automata Theory, Languages and Computation”, Pearson Education Asia, 2nd Edition.

Reference:

1 Daniel I.A. Cohen, "Introduction to Computer Theory", Wiley, Second edition.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 2nd Edition.

5

L T P C 4 0 0 4

MCA-314: Seminar

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

There will be at least two teachers in charge for the evaluation of seminar. The topic of seminar must be relevant to computer science or computer industry and not to be the part of the course contents to be studied in the theory papers.

First few lectures (5-10) will be spent by the teacher in charge on the allocation of seminar, how to prepare presentations, presentation skills etc. The following books can act as the reference

1. “Effective Presentation”, 3rd Edition by Ros Jay, Antony Jay published by Pearson

2. Effective Presentation Skills (A Fifty-Minute Series Book) by Steve Mandel

Each student will deliver half hour seminar on the topic to be assigned by the teacher in charge. Students will be evaluated marks on the following basis:

1. Contents: Relevance, innovativeness, and the amount of the contents with the topic assigned.

25% of the total marks

2. Presentation: Oral presentation method, aids used etc. 25% of the total marks

3. Seminar Chair: Each student will be chairing one seminar session. He/she will be evaluated on the basis of role played by him/her as the chairperson.


4. Seminar Reporting: Each student will act as the reporter for one seminar session and evaluation will be done on the basis of reporting done by the student.


5. Questioned asked by the student in seminars: Students are supposed to actively participate in the seminar sessions and will be evaluated on the basis of relevance of the questions asked by them.


6. Viva – voce 10% of the total marks

6

L T P C 0 0 6 6

MCA-315: Programming Lab V (Graphics)

Maximum Marks: 100* Maximum Time: 3 Hrs. Minimum Pass Marks: 40% Practical units to be conducted: 55-60

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

The following categories of programs are to be developed in C/C++/Java related to MCA-322: Computer Graphics:

1. Simple programs to handle graphics (drawing sine curve, cosine curve, animating an object around curve)

2. Program to draw bar chart, frequency curve and pie chart.

3. Program to draw line, rectangle, circle using rubber banding.

4. Program to implement various Line, circle and ellipse drawing algorithms.

5. Program to implement area fill techniques.

6. Program to demonstrate 2D Transformations like translation, scaling, rotation, reflection, shearing.

7. Program for perform 2D Clipping.

*The splitting of marks is as under

Maximum Marks for Continuous Assessment: 60 Maximum Marks for University Examination: 40

7

L T P C 3 1 0 4

MCA-316: E-Commerce




E.


SECTION A

Meaning and Concept of Electronic Commerce, Potential Benefits of E-Commerce, Ecommerce Technologies, Types of Ecommerce, Business Models of E-Commerce. Framework of Ecommerce, Technology behind Ecommerce, The Anatomy of Ecommerce Applications.

SECTION B

Ecommerce Security Issues : Asses, Threats and Impacts. Messaging Security Issues, Cryptography : Encryption Technique and Mechanism, Firewall : Components and Functionality, Factors in Firewall Design. Regulatory and Legal Environment for Ecommerce

SECTION C

Electronic Data Interchange : Types of Edi, Benefits and Functionality of EDI. Electronic : Payment Mechanism : Issues in Electronic Payment Systems, Types of Electronic Payment Schemes : Smart Card, Debit Card, Credit Card, Electronic Cash, Electronic Cheque. Risk & Electronic Payment Systems.

SECTION D

Web Based Marketing : Online Advertising Mechanism, Internet Marketing Techniques, Marketing Strategies for Internet, Factors in Ecommerce Website Design. E-Commerce in India. Present Status and Future Scope.

Text Books :

1. Ravi Kalakota, Andrew B. Whinston : "Frontiers of Electronic Commerce", Addison Wesley.

References:

1. Efrain Turbon, Lee, David King : "Electronic Commerce-A managerial Perspective", Prentice-Hall.2. Grenstein, Feinnman, "Electronic Commerce", Tata McGraw-Hill.3. Pete Loswin, Paul A Murphy : "Electronic Commerce", Jaico Publishing House.

8

L T P C 3 1 0 4

MCA-317: Corporate Strategy & Business Policy




E.


SECTION A

Introduction to Corporate Strategy, Corporate Mission purpose & Goals Objectives, Types & Hierarchy of Objectives, Strategic Management Process, Determination of Objectives - Internal & external environmental scanning, the different forms of strategy.

SECTION B

Concept & approaches to strategy formulation, expansion, Diversification, Acquisition, Merger & Divestment, Evaluation of alternatives. Analysis & Formulation of organisational Policies - Marketing, Production, Financial & Personnel, Productivity & Competitive Analysis.

SECTION C

Strategic Planning: Technological & Demand forecasting : Long & Short term planning, Tactical Plans, criterion & Provision of Planning, the analytical relationships among cash , Growth & Investment goals.

SECTION D

Nature & Type of organisational structure, information & control system, Mobilisation of resources. Corporate performance, appraisals & Review of Plans, Objectives & strategy, Rescheduling of Resources, Techniques for Improving organisational effectiveness.

Text Books:1. H. Ansoff Igor, “Corporate Strategy”, McGraw Hill, New Delhi, 1987.

References:

1. Strategic Management, Altex Muller, M.H. 2. Colley, Doyle & Hardie, Organisations, Richard Hale, Pearson Education, Corporate Strategy, TMH. 3. Kazmi Azar , “Business Policy”, Tata McGraw Hill, Delhi, 1993.4. Bus Strategy Management, Wheelan, Pearson Education.

9

L T P C 3 1 0 4

MCA-318: Digital Image Processing




E.


SECTION A

Digital Image Processing: Definition, Problems and Applications Fundamental Steps in Digital Image Processing, Components of an Image Processing System.Digital Image Fundamentals: Image Sensing, and Acquisition, Image Sampling and Quantization, Basic Relationship between Pixels, Linear and Non-linear Operations.

SECTION B

Image Enhancement in Spatial Domain: Basic Gray Level Transformations, Histogram Processing, Enhancements using Arithmetic/Logic Operations, Basics of Spatial Filtering, Smoothing, Spatial Filters, Sharpening Spatial Filters, Combining Spatial Enhancement Methods.Introduction to Fourier Transformation and Frequency Domain. Smoothing Frequency Domain Filters, sharpening Frequency Domain Filters, Homomorphic Filtering, Implementation.

SECTION C

Image Restoration : Noise Models, Restoration in the Presence of Noise Only-Spatial Filtering, Periodic Noise Reduction by Frequency Domain Filtering, Linear, Position-Invariant Degradations, Estimating the Degradation Function, Inverse Filtering, Minimum Mean Square Error (Wiener) Filtering, Constrained Least Squares Filtering, Geometric Mean Filter, Geometric Transformations.Colour Image Processing: Colour Models, Pseudocolour Image Processing, Basics of Full Colour Image Processing. Colour Transformations, Smoothing and Sharpening. Colour Segmentation.

SECTION D

Image Compression: Image Compression Models, Elements of Information Theory, Error Free Compression, Lossy Compression, Image Compression Standards.Point Detection, Line Detection and Edge Detection, Edge Linking and Boundary Detection.

Text Book:1. R. C. Gonzalez, R. E. Woods, “Digital Image Processing”, Pearson Education-2002

References:1. A. K. Jain, “Fundamentals of Digital Image Processing”, PHI, 2002

10

L T P C 3 1 0 4

MCA-319: Organisational Behaviour and Development



B) Instructions for candidates1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and `the entire

section E.


SECTION A

Defining OB, Fundamentals of OB, Foundations for the study of OB: The Hawthorne studies and its implications, Human relation movement, organisational culture, the basic theories of behaviour prediction of human behaviour at work.Understanding Indian social and cultural environment and its influence on industrial behaviour. Challenges & Opportunities for OB. Developing an OB Model,

SECTION B

Personality, and its determinants, Personality traits attributes, influencing OB. Personality development Understanding attitudes, values and formation of organisational culture, job satisfaction.

Perception, its nature and importance, perception vs sensation, perceptual organisation and selectivity, social perception.

Learning theories of Learning, learning principles, Reinforcement-kinds and administration.

SECTION C

Motivation, its meaning, type of motives, theories of Motivation (Marlow, herzberg, Mecgreger & McClelland’s) job designing and goal setting.Interpersonal Behaviour : Understanding conflicts and its dimensions. Goal congruence and group Behaviour & dynamics.

SECTION D

Power and politics: meaning and relationship. Source and types of power, implications and acquisition of power, Leadership & is theories. O.D defined and its importance, underlying assumptions and values, characteristics and foundations of OD, operational components of OD, conditions for success of OD, Interventions-its overview, kinds and applications.

Text Books:1. Stephen P. Robbins Organisational Behaviour, Pearson Education,

References:

1 J.W. Newston & Keith Davis, OB, 11th editio, TMH.2. Fred Luthaus, Organiations Behaviour, McGraw Hill. 3. R.W. Griffn & Moohead . Organisational Behaviou, Jaico Books.

11

L T P C 3 1 0 4

MCA-320: Advanced Operating Systems




E.


SECTION ADistributed OS: Goals, H/W Concepts, S/W Concepts, Client/Server Model.Communication: Layered Protocols, RPC, Remote Object Invocation, Message and Stream Oriented Communication.Processes: Threads, Clients, Servers, Code Migration, S/W Agents.Process Synchronization Mechanism: Process Concepts, Concurrent Processes, Threads, Critical Section Problem, Synchronization Problems (Dining Philosophers, Producer-Consumer, Reader-Write).Clock Synchronization, Logical Clocks, Global State, Election Algorithms, Mutual Exclusion

SECTION BNaming: Naming Entities, Locating Mobile Entities, Removing Unreferenced Entities.Distributed Deadlock Detection: Deadlock Handling Strategies, Control Organization for Distributed Deadlock Detection, Centralized, Distributed and Hierarchical Deadlock Detection Algorithms.

SECTION CSecurity: Introduction, Secure Channels, Access Control, Security Management.Distributed Object Based System: CORBA, DCOM, GLOBE, Comparison.

Distributed File System: Architecture, Mechanism for Building Distributed File System, Design IssuesDistributed Shared Memory: Architecture, Memory Coherence, Coherence Protocols, Design Issues.Failure Recovery: Classification of Failures, Backward and Forward Recovery, Recovery in Concurrent Systems.Fault Tolerance: Introduction, Process Resilience, Reliable Client/Server Communication, Group Communication, Distributed Commit, Recovery.

SECTION DResource Security and Protection: Access Matrix Model, Safety in Access Matrix Model, Advanced Models of Protection, CryptographyIntroduction to Multiprocessor Operating Systems and Database Operating Systems.

Text Books:1. M. Singhal, N. G. Shivaratri, “Advanced Concepts in Operating Systems”, Tata McGraw-Hill.2. A. S. Tanenbaum, “Distributed Systems”, Pearson Education.

Reference:1. Silberschatz and Galvin, "Operating System Concepts", Addison-Wesley publishing, Co., 1999.2. D. M. Dhamdhere, “Operating Systems – A Concept Based Approach”, Tata McGraw-Hill.

12

L T P C 3 1 0 4

MCA-321: Compiler Design




E.


SECTION A.

Introduction to Compiling : Compilers v/s Interpretes, Phases of a Compiler, Cross-compiler, Compiler-Construction tools. One Pass-Compiler, Syntax definition, Parsing : Predictive Paring, Design of a Predictive Parser, Symbol tables.

SECTION B

Lexical Analysis : Rote of Lexical Analyser, Specification and Recognition of Tokens, finite Automata, From Regular expression to a NFA.Syntax Directed Translation : Syntax Directed definitions, Syntax directed translation scheme : Quadruples, Triples, Indirect triples, Constructing syntax trees, Bottom-up evaluation of S-attributed definitions, L: attributed definitions.

SECTION C

Syntax Analysis : Rate of parsing, CFG, Top-down parsing, Bottom up, Parse tree, Operator-Precedene Parsing, LR parsers, Using ambiguous grammar. Runtime Environment-Storage organisation, storage allocation strategies.

SECTION D

Code Generation : Issue in design of code generator, Basic Block and flow graphs, Next-use Information, DAG representation of basic blocks. Code Optimization : Peep optimization, Principle source of optimization, Optimization of basic blocks. Introduction to Global DFA.

Text Book :

1. Ah. A. V. Ulman Sethi, R, “Compilers : Principles, Techniques & , Addison-Wesley, 1999.

13

L T P C 3 1 0 4

MCA-322: Decision Support Systems




E.


SECTION A

Concept of Decision - making, Decision - Making Process, Simon’s Model, Programmed Vs. Non-Programmed decisions, Decision models: Decision-Making Under assumed certainty, risk & uncertainty, Quantitative Tools for Decision-Making.

SECTION B

Introduction to Decision Support Systems, Characteristics & Objectives, Benefits of DSS, DSS Vs. EDP/MIS, Specific DSS, DSS Generator, DSS tools and their relationships, Role of DSS & its applications.

SECTION C

Components of DSS - Data Subsystem, Model Subsystem, User - Interface, DBMS in DSS, Report generator, Types of Models & Modeling in DSS.

DSS Software Tools : Standard Packages, specialized tools & Generators-DBMS, Information retrieval packages, statistical data analysis packages, forecasting packages, Programming Languages for DSS.

SECTION D

Group Decision Support Systems : Group versus Individual activities, Benefits of GDSS, types of Groups DSS, Groups DSS in use : Electronic Meeting Systems, Work flow systems. Expert Systems : Basic idea, components of Expert Systems, Pros and cons. of Expert Systems. Expert Systems and DSS. Dataware housing and Executive Information System Fundamentals.

Text Books :

1. Efren G. Mallach, Decision Support & Data Warehouse Systems, Tata McGraw Hill. 2. DSS & Intelligent Systems by Efrain Turban, Jay E. Aronson, Pearson Education.

References:

1. Michael W-Davis, “Applied Decision Support”, Prentice Hall.2. R. Jaya Shankar, “Decision Support Systems”, Tata McGraw Hill.3. Sprague and Watson, “Decision Support Systems: Theory & Practice”, PHI.4. J.L. Bennett, “Building Decision Support System”, Addison-Wesley Publications.

14

L T P C 3 1 0 4

MCA-323: Communication Skills & Report Writing




E.


SECTION A

Communication : Meaning & Importance, Communication process, Forms of Communication, including electronic Communication-Telephone Voicemail, Tele-conferencing, video conferencing, e-mail, discussion groups. Intranet & Internet. Communication in Information Technology Age-Changing role of communication.

SECTION B

Barriers to Effective Communication, OverComing barriers, Inter-personal and Intra-personal Communication. Personality and Communication, Role of effective Communicator, Cross-Cultural Communication and its determinants. Problem in Cross Cultural Communication.

SECTION C

Introduction to Communication models-Aristotle’s Communication models- Shannon and Weaver transmission model, Berlo’s model, Lasswell’s model, The two way communication model. Non verbal Communication-Nature, Importance and media of Non-verbal Communication.

SECTION D

Written Communication : Business Letters, memo, Report Writing-Types of reports. Elements of Report and presentations. Listening : types of Listening barriers in Listening.

Text Book :

1. C.S. Rayndu, “Communication”, Himalya Publishing House.

References :

1. Basic Communication Skills for Technology, A Rutherford, Pearson Education, Asia, 2000.2. Robert E. Swindle, Elizabeth M. Swindle, “The Business Communicator”, Prentice Hall, 3rd Edition.3. Parag Diwan, “Communication Management”, Deep and Deep Publications, 1997.4. Mahesh Kumar “ Communication Skills, SLIET Publication, 2001. 5. Communication for Business, Shirley Taylor, Pearson Education. 6. Communication in IT Age, "Dhiraj Sharma," Himalya Publications, 2004.

15

L T P C 3 1 0 4

MCA-324: Graph Theory




E.


SECTION A

Graphs : Introduction, Applications, finite and infinite graphs, incidence and degree, Isomorphism, Subgraphs, Walks, paths and circuits, connected Graphs, Disconnected graphs and components. Euler graphics, details of euler graphs, travelling salesman problem.

SECTION B

Trees : Introduction, properties, pendent vertices in a tree, distance and centres in a tree, rooted and binary trees, spanning trees, fundamentals, circuits, spanning trees in weighed graph, Cut Sets : Introduction, fundamental circuits and cut sets, connectivity and separability, network flows.

SECTION C

Planar graphs: Introduction, Kuratowrski’s two graphs, detection of planarity, geometric dual, combnational dual. Matrix Representations: Incidence matrix, adjacency matrix.

SECTION D

Chromatic number, Chromatic, polynominal, the four colour problem, Directed graphs : Introduction, types diagraphs and binary relation, directed paths and connectdness, Euler diagraphs, trees with directed edges : Enumeration of graphs : types, Counting labeled trees.

Text Book:

1. Narsingh Deo : Graph Tehory, PHI.

References:

1. West D. B.: Introduction to graph theory, Second, Edition, Pearson Education Asia. 2. Wilson R. J.: Introduction to graph theory, fourth edition, Pearson Education, Asia.

16

L T P C 3 1 0 4

MCA-325: Programming Languages




E.


SECTION ANeed of studying Programming Languages, Evolution of Programming Languages, Criterion for Language Design, Computer Hardware, Firmware Computers, Translators and Software Simulators, Virtual Computers and Binding Times.Type Checking, Strong Typing, Type Compatibility, Scope and Lifetime, Referencing Environment.Elementary and Structured Data Type. Sequence Control: Within Expression, Between Statements, Non-arithmetic Expressions.

SECTION B Subprogram Control: Sequence Control, Data Control, Parameter Transmission, Explicit Common Environment, Co-routinesStorage Management: Elements Requiring Storage, Programmer and System Controlled Storage, Static Storage, Heap Storage Management.Exception Handling

SECTION CFunctional Programming: Functions, Recursion, Control Structures, Implementation, Introduction to Logic Programming: Concepts, Computing with Relations; Rules, Facts and Queries.Concurrent Programming: Concepts, Parallelism in H/W, Implicit Synchronization, Concurrency as Interleaving, Liveness Properties, Safe Access to Shared Data, Concurrency in ADA Synchronized Access to Shared Variables.

SECTION DObject Oriented Programming: Concepts, Objects, Classes, Instances, Abstraction, Data Encapsulation, Information Hiding, Inheritance, Polymorphism its Implementation in C++.

Text Books:1. T.W. Pratt, M. V. Zelkowitz," Programming Languages :Design and Implementation", Pearson Education.2. R. W. Sebesta, “Concepts of Programming Languages”, Pearson Education.

References:1. Ravi Sethi, " Programming Languages :Concepts and constructs", Pearson Education.2. Michael Marcotty and Henry Ledgard," Programming Languages & Landscape: Syntax/ Semantics/ Implementation",3. Allen Tucker, Robert Noonam, “Programming Languages Principles and Paradigms”, Tata McGraw Hill.

17

L T P C 3 1 0 4

MCA-326: Theory & Programming of Embedded Systems




E.


SECTION A

Micro Controllers : Introduction and Embedded processors, overview of 8051 family. 8051 Assembly language programming : Introduction, Assembling and running 8051 program. The program Counter and ROM space in 8051, Datatypes and directives, 8051 flag bits and PSW register, register banks and stack.

SECTION B

Jump, loop and Call Instruction, Call instructions, time delay generation and calculation. I/O port programming : pin description of 8051, I/O programming : Bit manipulation : Addressing Modes : Immediate and register addressing, accessing memory using various addressing models.

SECTION C

Artihemantic Instructions and programs unsigned addition, Subtraction, multiplication and : Division, signed number concepts and arithhematic operations, Logic Instructions and programs : Logic and compare instructions, rotate and sharp instructions BCD and ASCIII Application program.

SECTION D

Single Instructions and programming : Single bit instruction programming, Single bit operations with CY, reading input pins vs port batch. Timer/Counter in 8051: programming 8051 timers, Counter programming : 8051 interrupts, timer interrupts, external hardware interrupts, interrupt priority in 8051, 8051 interfacing to keyboard and with DAC.

Text Book

1. Mazid : M.A. and Mazidi J.G. : The 8051 Microcontroller and Embedded Systems, Pearson Education, Asia.

18

L T P C 3 1 0 4

MCA-327: Computer Based Optimization Techniques




E.


SECTION A

OR models, solving the OR Model, Introduction to Linear Programming, two variable LP model, Graphical LP Solution, Graphical sensitivity Analysis, Simplex Method, Big M Method, Two Phase Method, Special cases in Simplex Method Application.

SECTION B

Duality and Sensitivity Analysis : Definition of the Dual problem, Primal dual relationship,, Additional Simplex Algorithm for LP, Post Pptimal or Sensitivity Analysis. Transportation Model, Transportation Algorithm, Assignment Model.

SECTION C

Networks Models : Definition, Minimum spanning trees algorithms, Shortest Route Problem, Maximum flow Model, Minimum Cost Capacitors flow problem, PERT & CPM.

SECTION DNon-Linear Programming : Unconstrained Algorithms, Direct search Method, Gradient Method, Constrained Algorithm, Separable programming, Quadratic Programming, Geometric Programming

Text Book

1. H.A. Taha, Operations Research, Seventh Edition, PHI, New Delhi.

Reference Books

1. Kanti Swarup, "Operations Research" 2. N.G.Nari, "Operations Research" 3. Heara and Gupta, "Operations Research" 4. S.D.Sharma, "Operations Research"5. Goel and Mittal, "Operational Research"6. V.K.Kapoor, "Problems and Solutions in Operations Research"

19

SYLLABUS OUTLINE OF PAPERS AND TESTS

M.C.A. (MASTER OF COMPUTER APPLICATIONS) THIRD YEAR SIXTH SEMESTER YEAR 2011-12 & 2012-13 Sessions

CODE TITLE OF PAPER MAXIMUM MARKSMCA-328 PROJECT 400

TOTAL 400

MCA-328 Project in a Computer Organisation/University Computer Centre/Dept. of Computer Science, etc., as decided by the Head of the Department

Project : 400 Marks

1. The evaluation committee will distribute these marks for seminar/viva/project report and for any other activity, which the committee thinks to be proper.

2. Joint projects will be allowed and joint project reports will also be accepted. Individual project reports will be recognised and the students should highlight their contributions in a joint project report.

Committee for Evaluation of project report/work:

i. Head of the Department

ii. Internal Guide (if any)

iii. One or two nominee(s) of Dean, Academic Affairs

iv. External Examiner

Quorum will be of any three members.

20

Mca Part III(Sem v to Vi)

Documents

Transcript of Mca Part III(Sem v to Vi)