OUTLINES OF TESTS, SYLLABI AND COURSES OF … · SYLLABI AND COURSES OF READINGS CHOICE-BASED...

For the Sessions 2017-18 & 2018-19

Board of Studies meeting held on 17.12.2016

OUTLINES OF TESTS,

SYLLABI AND COURSES OF READINGS

CHOICE-BASED CREDIT SYSTEM

FOR

MCA (MASTER OF COMPUTER

APPLICATIONS)

(SEMESTER SYSTEM)

Second Year (3rd

& 4th

Semester)

Sessions 2017-18 and 2018-19

MATA GUJRI COLLEGE

(An Autonomous College) SRI FATEHGARH SAHIB-140406



Mata Gujri College, Sri Fatehgarh Sahib

(An Autonomous College)

SYLLABUS, OUTLINES OF PAPERS AND TESTS


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

SECOND YEAR-THIRD SEMESTER EXAMINATIONS

Sessions 2017-18and 2018-19

CODE

NO. TITLE OF PAPER

Schedule of

Teaching

(Hours/Week) Total Hours Credits

Marks

L T P Internal External

MCA-231 Object Oriented Analysis &

Design Using UML 4 1 0 5 4 50 50

MCA-232 Programming in Java 4 1 0 5 4 50 50

MCA-233 Computer Networks 4 1 0 5 4 50 50

MCA-234 Data Structures 4 1 0 5 4 50 50

MCA-235 *Choice Based Course-III

4 1 0 5 4 50 50

MCA-236 Programming Lab-V(based on

MCA-232) 0 0 5 5

5 60 40

MCA-237 Programming Lab-VI (based on

MCA-234) 0 0 5 5 60 40

Total 25 0 10 35 25 370 330

*Choice Based Course: Any one of the following papers:

1. MCA-235C1 Software Testing and Quality Assurance

2. MCA-235C2 Research Methodology

3. MCA-235C3 System Software

CONTINUOUS ASSESSMENT (THEORY PAPERS)

1. Two tests will be conducted during a semester. Both the tests will

be counted for assessment.

: 60% of the total marks allotted for continuous

assessment.

2. Assignment/Quizzes : 20% of the total marks allotted for continuous

assessment.

3. Attendance : 10% of the total marks allotted for continuous

assessment.

4. Class Participation and behaviour : 10% of the total marks allotted for continuous

assessment.

CONTINUOUS ASSESSMENT (PRACTICAL LAB)

1. MCQ/Viva/Program Execution will be conducted during a

semester.


assessment.

2. Lab Assignments : 30% of the total marks allotted for continuous

assessment.


assessment.



MCA-231 Object Oriented Analysis & Design Using UML

Maximum Marks: 100 Maximum Time: 3

Hrs.

Internal Assessment:50

External Examination:50

Minimum Pass Marks: 40% Lectures to be

delivered: 45-55

A) Instructions for paper-setter

The question paper will consist of three units I, II and III. Unit I and II will have four questions from the

each unit of the syllabus and will carry 10 marks each. Unit III will consist of questions from whole

syllabus and will be of 2 marks each.

B) Instructions for candidates

1. Candidates are required to attempt two questions each from unit I and II . Unit III is compulsory.

2. Use of scientific calculator is allowed.

UNIT I Introduction to Object: Object Orientation, OO Development, OO Themes, OO Modelling History. Modelling Concepts: Modelling as design technique, UML2.0 Graphical Notations. Class modelling: Objects and classes, Links and Association, Generalization and inheritance, Grouping

constructs, Aggregation, Abstract Classes, Generalization as extension and restriction, Multiple

inheritance, Meta data, Candidate keys, Constraints. Derived data, Packages State modelling: Events and states, Transitions and conditions, state diagrams state diagram behaviour,

Nesting states, Concurrency, Advanced State Modelling concepts Interaction modelling: Use Case Model, Sequence model, Activity Model, Use case relationships,

Procedural sequence model. Relationship among three Models.

UNIT II

Analysis and Design: system development stages and life cycle, system conception.

Domain analysis: Domain Class Model, Domain State Model, Domain Interaction Model, Iterating

analysis.

Application analysis: Application Interaction Model, Application Class Model, Application State

Model.

System design: Overview, estimating Performance, Making reuse plan, Breaking of system into

Subsystem, Identifying Concurrency, Allocation of subsystem, Management of data storage, Handling

global resources, Choosing a software control strategy, Handling boundary condition, setting trade off

priorities, common architectural style.

Class Design: Overview, Bridging the gap, realizing use cases, Designing Algorithms Recursing

downward, Refactoring, Design Optimization, Reification of Behaviour, Adjustment of inheritance

Organizing a class design.

Implementation Modelling, Database design, Programming Style, Iterative development, Managing

Models.

Text Book: 1. Rambough, “Object Oriented Modeling and Design with UML2”, Pearson Education.

References: 1. BOOCH, “Object Oriented Analysis and Design”, Addison Wesley

2. Pierre-Alain Muller, “Instant UML”, Shroff Publishers.

3. Booch, Rumbaugh, Jacobson, “The Unified Modeling Language User Guide”, Addison Wesley.



MCA-232 Programming in Java

Maximum Marks: 100 Maximum Time: 3 Hrs.



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








UNIT-I

Java Fundamentals: Features of Java, OOPs concepts, Java virtual machine Byte code, Data types,

variable, Differences between Java and C++,arrays, expressions, operators, and control structures, static,

final and finally method Objects and classes. String Handling, Primitive Type Wrappers. Inheritance:

Basics, Using super, Creating Multilevel Hierarchy, Method Overriding, Dynamic Method Dispatch,

Using Abstract Classes, Using final with inheritance.

Packages and Interfaces: Defining a package, Finding packages CLASSPATH environment variables,

Access Protection, Importing Packages, Defining an Interface, Implementing Interface, Nested Interface,

Applying Interface and Variables in Interfaces.

Exception Handling: Fundamentals, Exception Types, Uncaught Exceptions, Using try and catch,

Multiple catch clauses, Nested try Statements, throw, throws, finally, Java's inbuilt Exceptions, Creating

own Exception Subclasses, Chained Exceptions, Using Exceptions.

Multithreaded Programming: The java Thread Model, The Main Thread, Creating a thread, Creating

Multiple Threads, Using Alive() and join (), Thread Priorities, Synchronization, Inter thread

Communication, Suspending, Resuming, and Stopping Threads, Using Multithreading.

UNIT-II

I/O Basics: Streams, Byte Streams, Character Streams, The Predefined Streams, Reading Console Input,

Writing Console Output, The Print Writer Class, Reading and writing files

GUI: Introduction to AWT programming, Layout managers and Menus. Event handling.

Swing components – JApplet, JButton, JFrame.

Java applets- Life cycle of an applet – Adding images to an applet – Adding sound to an applet, passing

parameters to an applet.

Database Connectivity: JDBC Basics.

Servlets- Basics of Servlets, Servlet Life Cycle of JSP-- Life cycle of JSP-Basic tags of JSP, Basic

application using servlet and JSP.

Text Book:

1. Patrick Naughton and Herbert Schildt, “The Complete Reference Java 2”, Tata McGraw Hill.

References:

1. Java Programming Language, Third Edition by Ken Arnold, James Gosling, David Holmes.

Pearson Publications.

2. Infosys Campus Connect Foundation Program Volume:1 – 3, Education & Research

Department, Infosys Technologies Ltd , Bangalore.



MCA-233 Computer Networks






The question paper will consist of three units I, II and III. Unit I and II will have four questions

from the each unit of the syllabus and will carry 10 marks each. Unit III will consist of questions

from whole syllabus and will be of 2 marks each.


1. Candidates are required to attempt two questions each from unit I and II . Unit III is

compulsory.


UNIT-I

Network Software – Protocol hierarchies, Design issues for layers, Interfaces and services, types of

services, Reference models: OSI model, TCP/IP model, Comparison of TCP/IP and OSI models.

Physical Layer -Transmission Media-Twisted pair, coaxial cable, fiber optics, wireless transmission

(Radio, Microwave, Infrared, Light wave).

Data Link Layer -Framing, Error control, Sliding window protocols (one bit, Go back n, selective

repeat).

Medium Access Sub layer: Static and dynamic channel allocation, Multiple access protocols - ALOHA,

CSMA, CSMA/CD, Collision Free protocol. IEEE standards for LAN: Ethernet LAN (802.3), Token

Bus (802.4), Token Ring (802.5), Wireless LAN(802.11, 802.15, 802.16 )

UNIT-II

Network Layer: Design Issues, Routing Algorithms –Shortest path routing, flooding, flow based

routing, distance vector routing, Hierarchical routing.

Congestion Control Algorithms – Leaky bucket, Token bucket, Choke Packet, Load shedding Internet

protocols: Internetworking devices, virtual circuits, connectionless internetworking, IPv4 , IPv6.

Transport Layer-Addressing, establishing and releasing connection, flow control, buffering, Internet

Transport Protocol (TCP and UDP).

Application Layer- Domain name system, E-mail, File transfer protocol, HTTP, HTTPS.

Network Security: Security attacks and Preventions, Cryptography – principles, public key encryption

and digital Signatures.

Text Books :

1. Tanenbaum A. S. “Computer Networks”, 3rd

Edition, PHI publications, .

2. Data Communications & Networking by Forouzan, Tata McGraw Hills.

References:

1. Infosys Campus Connect Foundation Program Volume:1 – 3, Education & Research

Department, Infosys Technologies Ltd , Bangalore.

2. Comer Douglas E, “Computer Networks and Internet”, 2nd

Edition, PH.



MCA-234 Data Structures












UNIT-I

Introduction: Data structures and their operations, mathematical notation and functions, algorithmic

complexity and time space trade off.

Arrays: Arrays and its operations, merging two arrays, representation of one and multidimensional

arrays in memory.

Linked Lists: Sequential representation versus linked representation, operations on linked lists

concatenation of two linked lists, Circular linked lists, doubly linked lists, dynamic memory allocation

and garbage collection.

Stacks: Sequential and linked representations, operations, Applications of stack: Conversion from infix

to post fix form; evaluation of postfix expressions.

Queues: Sequential and linked representation, operations, circular queues, priority queues, dequeues.

UNIT-II

Trees: Introduction to terminology of trees, binary tree, full binary tree, complete binary tree, sequential

and linked representation of binary trees in memory, tree traversal: in-order, pre-order and post order,

searching, insertion and deletion in binary trees, AVL trees, B-Trees. Application of binary trees: binary

search trees, creation of heap and heap sort.

Graphs: Graphs and their applications, sequential and linked representation of graph – adjacency matrix,

operations on graph, Dijkstra’s algorithm for shortest distance, DFS and BFS, Hashing.

Searching and Sorting: Linear and Binary search, Insertion sort, Selection sort, Shell sort, Merge sort,

Radix sort, Bubble sort, Quick sort.

File organization: Processing and operations on Sequential file organization, direct file organization and

Indexed Sequential organization:

Note: Insertion, Deletion, Traversal, Count, Search operations are to be performed on all the data

structures.

Text Books:

1. A. Tanenbaum, Y. Lanhgsam and A.J. Augenstein, "Data Structures Using C", Prentice Hall of

India, 1990

2. Mary E. S. Loomis, "Data Management and File Structures", PHI, 1995.

3. Vishal Goyal, LalitGoyal and Pawan Kumar, "Simplified Approach to Data Structures", Shroff

Publications.

4. Shubhnandan S. Jamwal, Programming in C, Pearson Publications

Reference Books:

1. Seymour Lipschultz, “Theory and Practice of Data Structures", McGraw-Hill.

2. E. Horowitz and S. Sahni, “Data Structures with Pascal", Galgotia, 3rd Edition.

3. Robert Sedgewick, “Algorithms in C”, Pearson Education.



MCA-235 C1 Software Testing and Quality Assurance












UNIT-I

An Overview of Testing Process: Software Testing, Fundamentals of Testing: Human and errors,

Testing and Debugging , Objectives of Software Testing, General Principles of Testing, Roles of Tester,

Software Testing Process, Static and Dynamic Analysis, STEP Methodology, Elements of STEP and

STEP Architecture.

Software Testing Techniques: BBT & its Technique, Boundary Value Analysis, Cause-Effect Graph,

White-Box Testing and its Techniques, Domain and Boundary Testing, Logic Based Testing, Data Flow

Testing, Overview of Testing Tools.

UNIT-II

Create the Test Plan: Basics of manual testing, Test Cases, Test Results, Variations of Test cases, Test

Plan, Purpose and components of Test plan. Designing of test cases, Execution of test cases, Bug Life

Cycle, Bug reporting., Automation testing: Drawbacks of manual testing, Challenges of software test

automation, Automation Lifecycle.

Software Quality Assurance: Overview of Software Quality, Software Quality Attributes, Factors

Affecting Software Quality, Building Software Quality Assurance Plan, Components of SQAP.

Text Books:

1. Software Testing Foundations, Andreas Spillner, Tilo Linz, Hans Schaefer, Shoff Publishers

and Distributors 2. Software Testing: Principles and Practices by Srinivasan D and Gopalswamy R, PearsonEd.

References:

1. Foundations of Software Testing by Aditya P. Mathur – Pearson Education custom edition .

2. Testing Object Oriented Systems: models, patterns and tools, Robert V Binder, Addison

Wesley. 3. Software Engineering – A practitioner's approach by Roger S. Pressman, 5thEdition, McGraw

Hill 4. The art of software testing by GJ Myers, Wiley.



MCA-235 C2 Research Methodology












UNIT-I

Research Methodology: Objectives, Role & Scope, Process of Research; Research Designs:

Exploratory, Descriptive & Experimental Research Designs and their Applications; Sampling Design:

Concepts, types and their applicability; Scaling Techniques including Likert &Thurston, Scale.

Tools & Techniques of Data Collection: Primary & Secondary; Classification & Tabulation of Data.

UNIT-II

Testing of Hypothesis: Concept, types of hypothesis, significance level, degrees of freedom, Errors in

hypothesis testing, Procedure of testing hypothesis; Statistical Tests: Chi-square test, t-test, ANOVA –

1 way and 2 way; SPSS and Report Presentation: Use of Statistical Package for Social Sciences,

Report Writing - Mechanics of Report Writing, Preliminary pages, Main body and Appendices including

Bibliography, Diagrammatic and Graphical presentation of Data.

Text Books :

1. Amir D. Aczel & Jayavel Sounderpandian, Business Statistics, Tata McGraw-Hill Publishing Co. Ltd.,

New Delhi, 6th Edition.

2. Donald R. Cooper & Pamela S. Schindler, Business Research Methods, Tata McGraw-Hill Publishing Co.

Ltd., New Delhi, 9th Edition.

3. C.R. Kothari, Research Methodology-Methods and Techniques, New Age International Publishers.

References:

1. Malhotra Naresh K, Marketing Research: An applied Orientation, Pearson Publishers,

2. G. C. Beri, Business Statistics, Tata McGraw-Hill Publishing Co. Ltd., New Delhi, 2ndEdition.

3. J. K. Sharma, Business Statistics, Pearson Education, New Delhi, 3rd Reprint.



MCA-235 C3 System Software












UNIT-I

Introduction to systems software: Definition, features of system programming, system programming

vs. application programming, type of system programmes. Assembler: Elements of Assembly Language

Processing, A simple Assembly scheme, Pass structure of Assemblers, Design of a two pass assembler.

A brief overview of single pass assembly and problem of forward references.

Macro processor: macro instructions, features of macro facility, implementation, one pass macro pre

processor, two pass macro pre-processor, macro assemblers. UNIT-II

Compilers: Overview of compilation process, lexical analysis, syntax analysis, semantic analysis,

intermediate code generation, Code optimisation transformations (Compile time evaluation, Elimination

of common sub-expression, Dead code elimination, Frequency reduction, strength reduction – concepts

only), intermediate code form for arithmetic expressions (postfix, prefix, triples, quadruples – concepts

only),compiler vs. interpreter

Loaders and Linkers: Various Loading and Linking Schemes, Design of absolute loader, Re-Locatable

loaders, dynamic loading and linking concepts, Functions and structure of text editor.

Text Book: 1. Dhamdhere D. M. "Systems Programming and Operating system", Tata McGraw-Hill Publishing

Company Limited, New Delhi, Second Edition.

References: 1. Donovan, "System programming". (McGraw-Hill),

2. Aho and Ulman, "Principles of Compilers", Narosa Publishing House,

3. Aho, A.V., Ullman Sethi R., I.D.: Compilers : Principles, Techniques and Tools, Addison-Wesley

Publishing Co.



MCA-236 Programming Lab-V

Maximum Marks: 100* Maximum Time: 3 Hrs.

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

This laboratory course will mainly comprise of exercises on what is learnt under the paper MCA-232:

Programming in Java .

*The splitting of marks is as under

Maximum Marks for Continuous Assessment : 60**

Maximum Marks for Semester Examination : 40***

**CONTINUOUS ASSESSMENT (PRACTICAL LAB)


semester.


assessment.


assessment.


assessment.

*** For Semester Examination the evaluator will distribute the marks for the practical

examination according to the following guidelines:

Viva Voce 40% of the marks allotted for Semester Examination

Lab Record 20% of the marks allotted for Semester Examination

Program Execution 40% of the marks allotted for Semester Examination.



MCA-237 Programming Lab-VI

Maximum Marks: 100 * Maximum Time: 3 Hrs.


This laboratory course will mainly comprise of exercises on what is learnt under the paper MCA-234:

Data Structures


Maximum Marks for Continuous Assessment:60**




semester.


assessment.


assessment.


assessment.

*** For Semester Examination the evaluator will distribute the marks for the practical

examination according to the following guidelines:






Mata Gujri College, Sri Fatehgarh Sahib

(An Autonomous College) SYLLABUS, OUTLINES OF PAPERS AND TESTS


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

SECOND YEAR-FOURTH SEMESTER EXAMINATIONS

Sessions 2017-18and 2018-19

CODE

NO. TITLE OF PAPER

Schedule of Teaching

(Hours/Week) Total

Hours Credits

Marks

L T P Internal External

MCA-241 Computer Graphics

4 1 0 5 4 50 50

MCA-242 Web Programming Using

ASP.NET

4 1 0 5 4 50 50

MCA-243

Algorithm Analysis and

Design 4 1 0 5 4 50 50

MCA-244 Artificial Intelligence

4 1 0 5 4 50 50

MCA-245 *Choice Based Course-IV

4 1 0 5 4 50 50

MCA-246 Programming Lab-VII

(based on MCA-241) 0 0 5 5

5 60 40

MCA-247 Programming Lab-VIII

(based on MCA-242) 0 0 5 5 60 40

Total 25 0 10 35 25 370 330

*Choice Based Course: Any one of the following papers:

1. MCA-245C1 Content Management System

2. MCA-245C2 Data Mining

3. MCA-245C3 Computer Based Optimization Techniques

CONTINUOUS ASSESSMENT (THEORY PAPERS)

1. Two tests will be conducted during a semester. Both the tests will

be counted for assessment.


assessment.

2. Assignment/Quizzes : 20% of the total marks allotted for continuous

assessment.


assessment.

4. Class Participation and behaviour : 10% of the total marks allotted for continuous

assessment.

CONTINUOUS ASSESSMENT (PRACTICAL LAB)


semester.


assessment.


assessment.


assessment.



MCA-241 Computer Graphics












UNIT-I Functioning of Input devices: Keyboard, Touch panel, Light pens, Graphic tablets, Joysticks, Data

glove, Image scanner, Mouse.

Functioning of Output devices: Impact and non impact printers, such as line printer, dot matrix, laser,

ink-jet, electrostatic, flatbed and drum plotters.

Functioning of Video Display Devices: Refresh cathode ray tube, raster scan displays, random scan

displays, color CRT monitors, DVST, flat-panel displays, virtual reality, raster scan systems, Frame

buffer and video controller.

Scan conversion algorithms for line, circle and ellipse, Bresenham’s algorithms, area filling techniques.

2-dimensional Graphics: Cartesian and Homogeneous co-ordinate system, Matrix representation,

Geometric transformations(translation, Scaling, Rotation, Reflection, Shearing), Composite

transformations, Viewing transformation, 2D clipping algorithms (Cohen Sutherland and Liang Barsky’s

line clipping algorithms), polygon and text clipping.

UNIT-II 3-dimensional Graphics: Geometric transformations (translation, Scaling, Rotation, Reflection,

Shearing),Composite transformations, Mathematics of Projections (parallel & perspective),3-D viewing

transformations and clipping.

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

Illumination Models: Diffuse reflection, Specular reflection, refracted light,

Introduction to 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.

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.

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



MCA-242 Web Programming Using ASP.NET




Minimum Pass Marks: 40% Lectures to be delivered: 45-55 A) Instructions for paper-setter

The question paper will consist of three units I, II and III. Unit I and II will have four questions from the each unit

of the syllabus and will carry 10 marks each. Unit III will consist of questions from whole syllabus and will be of 2

marks each.




UNIT-I

Introduction to Microsoft ASP.NET, .NET Framework, An overview of .NET including the Common

Language Interface, the Common Type System, the Common Language Runtime, and .NET class

libraries. Language and platform neutrality.

Introduction to C#: Overview of C#, Literals, Variables, Data Types, Operators, Expressions,

Branching, Looping, Methods, Arrays, Strings, Structures, Enumerations, difference between C++ and

C#, difference between Java and C#.

Object oriented aspects of C#: Classes, Objects, Inheritance, Polymorphism, Interfaces, Operator

Overloading, Delegates, Events, Errors and Exceptions.

An introduction to Web Forms, The ASP.NET execution model,.

ASP.NET Web Application User Interface: Creating an ASP.NET Web application user interface with

various controls, creating and using Master page, Implementing event handlers by using code-behind

files, Explain user input by using validation controls, Create and use user controls.

UNIT-II

Managing State: The Various Means to Manage State, Request object, Application object, Cache

object, Session object, Server-side state management, Using session for server-side and client-side state

management.

XML Web Services: Need of XML Web services, Understanding the Web Service Model, Creating an

ASP.NET Web Service,

Implementing Navigation for the User Interface: Round Trip and Post back, State Management for

user navigation, Navigation between Pages.

Storing and Retrieving Data with ADO.NET: ADO.NET Overview, Connecting to Data, Executing

SQL with Commands, Accessing Data with ADO.NET, Fast Data Access with DataReaders, DataSet

Basics, Filling DataSets with DataAdapters,

Data Binding: Bind Data to the UI, Transform and Filter Data.

Security: Authenticating and Authorizing Users, Using Windows Authentication, Using Forms

Authentication

Using Caching Page: Output Caching, User Control Caching, Data Caching

Text Book: 1. Matthew MacDonald: ASP.NET: The Complete Reference, Osborne.

References:

1. Jesse Liberty, Dan Hurwitz: Programming ASP.NET, OReilly.

2. Stephen Walther: ASP.NET 3.5 Unleashed, SAMS.

3. Infosys Campus Connect Foundation Program Volume:1 – 3, Education & Research Department, Infosys

Technologies Ltd , Bangalore.



MCA-243Algorithm Analysis and Design








marks each.




UNIT-I Introduction to algorithm analysis: Introduction to algorithms, Algorithm Specifications, performance

analysis, case study on analysis of algorithms, Growth rate of functions.

Recursion and Induction: recursive procedures, induction proofs, proving correctness, recurrence

equations, recursion.

Randomized Algorithms: Basic of Probability Theory, Description of Randomized algorithms,

Identifying the repeated Elements, Primality Testing, Advantages and Disadvantages of using

randomized algorithms.

Divide and conquer technique of problem solving: Quick sort, Merge Sort, Binary search and their

Performance Analysis

BackTracking Algorithm: n-Queen problem, Graph Coloring.

UNIT-II Greedy algorithms: General Method, Knapsack Problem, Minimum-cost Spanning Trees: Prim’s

algorithm, kruskal’s minimal spanning trees, Single source shortest paths

Dynamic Programming: General Method, All Pair Shortest Paths, Optimal Binary Search Trees.

Lower Bound Theory for Comparison Based Algorithms for searching and sorting. Intractable Problems,

Nondeterministic Algorithms: Searching, Sorting, Knapsack, NP Hard and NP complete Problems, NP

Hard Graph Problem(Travelling Salesman problem), NP Hard Scheduling Problems (Job Shop

Scheduling)

Text Book: 1. Ellis Horowitz , SartajSahni ,SanguthevarRajasekaran : Fundamentals of Computer Algorithms, second edition,

Universities Press.

References:

1. Coreman, Leiserson&Rivest : Introduction to Algorithm, PHI Publication.

2. Aho ,Ullman. : Design & Analysis of Computer Algorithm, Pearson Education.

3. Infosys, Campus Connect, Analysis of Algorithms, Vol-3.



MCA-244 Artificial Intelligence




Minimum Pass Marks: 40% Lectures to be delivered: 45-55 A) Instructions for paper-setter



marks each.




UNIT-I

Introduction to AI: Definition, Nilsson's Onion Model explaining basic Elements of AI and AI

application Areas.

Introduction to Prepositional Logic: Syntax, Semantics, Inference methods in Prepositional Logic.

Introduction to Predicate Logic: Syntax, Semantics of Predicate Logic, Clausal form, Resolution,

Unification, Inference Mechanisms.

Knowledge Based Systems: Meaning of Knowledge, Types of Knowledge, Components of Knowledge

Base System.

Knowledge Representation: Approaches to Knowledge representation, Issues in Knowledge

representation, Knowledge representation using rules. Semantic Nets, Frames, Conceptual

Dependencies, Scripts, CYC.

Knowledge Acquisition: Definition, General Learning Model, Types of Learning, Factors affecting

Learning.

Knowledge organization & Manipulation: Introduction, Issues in organization and manipulation.

UNIT-II

Expert systems: Basic Components & architecture of Expert systems, representing and using domain

knowledge, ES-Shells.

Natural Language processing: Overview, Syntactic processing, Semantic analysis, Morphological,

Discourse and Pragmatic processing.

Basics of Neural Networks: Connectionist Models and their structures, Multilayer Perception & Back

Propagation Networks, Gradient Descent.

Some Representation Issues: Representing Boolean function, Distributed Representation, Representing

Real - valued Functions.

Introduction to Some Applications: NETTALK, Handwritten Character Recognition, Travelling

Salesman Problem.

Introduction to AI language LISP: Symbolic expression, creating, appending and modifying lists,

defining functions, Predicates, Conditionals, Recursion, Iteration, Printing and reading, Lambda

expressions and higher order function, List storage.

Text Books: 1. Neural Networks for Pattern Recognition by “Christopher M. Bishop”.

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

References: 1. E. Rich and K. Knight, "Artificial Intelligence", Tata McGraw Hill.

2. E. Charnaik and D. McDermott, "Introduction to Atificial Intelligence", Addison-Welsley Publishing Company.

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

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



MCA-245 C1 Content Management System Maximum Marks: 100 Maximum Time: 3 Hrs.







marks each.




UNIT-I

Joomla Basics: Open Source, Content Management System (CMS), History, Features.

Why Joomla: Advantages & Disadvantages. Comparison with others CMS like Wordpress & Drupal.

Real World Examples of what Joomla Can Create.

WAMP Installing & Configuring Joomla : Installing WAMPServer, Downloading Joomla Files,

Create Store Database, Setup Wizard.

Architecture of Joomla: Database, Joomla Framework, Components, Module, Plugin, Templates, Web

Browser.

Control Panel: Creating Categories, Creating Categorised and Uncategorised Articles, inserting

Images/Graphics into Articles, Filtering & Sorting Articles, Adding read more option into your Articles.

Joomla Menus: Create Menus, Adding Menu Items, Modify Menu items, Changing the Menu Order,

Creating Submenu.

Joomla Modules: Create Modules, Breadcrumb Module, Feed Display Module, Footer Module, Latest

News Module, Search Module, Random Image Module, Who's Online Module.

UNIT-II

Joomla Global Setting: System Setting, Debug Setting, Cache Setting, Session Setting, Media Setting,

language Manager, Mass Emailing, Plugin and Extension.

Joomla Advance: Template Manager, Customize Template, Adding Template, Creating Template,

Customize Logo, Category Management.

Content Management: Adding Content, Adding Title, TinyMCE editor, Creating Content without

WYSIWYG editor Text Insertion, Editors Buttons, Formatting Content, Adding Banners.

Introduction the Joomla Manager: Working with Media Files, Uploading files, Organizing files,

Viewing the information, Displaying media on your site.

Creating a Multilingual Website: Introduction the Language Manager, Installing new Languages

Packs, Modifying a Language Packs, Enabling Multilingual Content.

Joomla Website SEO: Creating Search Engine-Friendly URLs, Creating Custom Error Page, Working

with metadata and Page Titles.

Website Backup: Akeeba Backup Installing, Akeeba Backup Configuring, Creating a Backup.

Text Book: 1.Joomla Bible second Edition WILEY.

References: 1. Jennifer Marriott and Elin Waring, The Official Joomla! Book Addison-Wesley Professional.



MCA-245 C2 Data Mining






The question paper will consist of three units I, II and III. Unit I and II will have four questions from the each unit of the syllabus

and will carry 10 marks each. Unit III will consist of questions from whole syllabus and will be of 2 marks each.




UNIT-I

Data Warehousing : Data warehousing Components –Building a Data warehouse – Mapping the Data Warehouse to

a Multiprocessor Architecture – Data Extraction, Cleanup, and Transformation Tools –Metadata – reporting – Query

tools and Applications – Online Analytical Processing (OLAP) – OLAP and Multidimensional Data Analysis.

Data Mining: Data Mining Functionalities – Data Preprocessing – Data Cleaning – Data Integration and

Transformation – Data Reduction – Data Discretization and Concept Hierarchy Generation.

Association Rule Mining: Efficient and Scalable Frequent Item set Mining Methods – Mining Various Kinds of

Association Rules – Association Mining to Correlation Analysis – Constraint-Based Association Mining.

UNIT-II

Classification and Prediction: Issues Regarding Classification and Prediction – Classification by Decision Tree

Introduction – Bayesian Classification – Rule Based Classification – Classification by Back propagation – Support

Vector Machines – Associative Classification – Lazy Learners – Other Classification Methods – Prediction –

Accuracy and Error Measures .

Cluster Analysis: Types of Data in Cluster Analysis – A Categorization of Major Clustering Methods – Partitioning

Methods – Hierarchical methods – Density-Based Methods – Grid-Based Methods – Model Based Clustering Methods

– Clustering High Dimensional Data – Constraint-Based Cluster Analysis – Outlier Analysis.

Text Books:

1. Jiawei Han, MichelineKamber and Jian Pei, Data Mining: Concepts and Techniques, Morgan Kaufmann.

References:

1. Alex Berson and Stephen J. Smith, Data Warehousing, Data Mining & OLAP, Tata McGraw – Hill Edition.

2. K.P. Soman, ShyamDiwakar and V. Ajay, Insight into Data mining: Theory and Practice, Prentice Hall of India.

3. G. K. Gupta, Introduction to Data Mining with Case Studies, Prentice Hall of India.



MCA-245 C3 Computer Based Optimization Techniques






The question paper will consist of three units I, II and III. Unit I and II will have four questions from the each unit of the syllabus

and will carry 10 marks each. Unit III will consist of questions from whole syllabus and will be of 2 marks each.




UNIT-I

Introduction: Definition of operation research, models in operation research, general methods for solving O.R.

models Elementary theory of convex sets, Linear programming problems, examples of LPPs, mathematical

formulation of the mathematical programming problems, Graphical solution of the problem. Simplex method, Big M

method, Two Phase method, problem of degeneracy.

Duality in linear programming: Concept of duality, duality and simplex method, dual simplex method.

UNIT-II

Transportation Problem: Introduction, mathematical formulation of the problem, initial basic feasible solution,

optimum solution, degeneracy in transportation problems, unbalanced transportation problems.

Assignment Problems: Introduction, mathematical formulation of an assignment problem, unbalanced assignment

problems.

Network Analysis: Introduction to Networks, Minimal Spanning Tree Problem

Shortest Path problem: Dijkstra's Algorithm, Critical Path method, Critical Path Computations, Optimal Scheduling

by CPM, Project Evaluation and Review Techniques (PERT).

Text Book:

1. KantiSwarup, P. K. Gupta and Man Mohan : Operations Research, Sultan Chand and Sons, New Delhi.

References:

1. ChanderMohan and Kusum Deep :Optimization Techniques, New Age International.

2. Hadley, G: Linear Programming



MCA-246 Programming Lab-VII



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


Maximum Marks for Continuous Assessment: 60**

Maximum Marks for Semester Examination: 40***


1. MCQ/Viva/Program Execution will be conducted during a semester. : 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.

*** For Semester Examination the evaluator will distribute the marks for the practical examination

according to the following guidelines:






MCA-247 Programming Lab-VIII



This laboratory course will mainly comprise of exercises on what is learnt under the paper MCA-242: Web

Programming using ASP.NET and a Minor Project in ASP.NET.

For the minor projects in a team of maximum size three will be allowed and the team will submit joint project

report. The student team members must highlight their role and/or contributions in the joint project report.


Maximum Marks for Continuous Assessment :60**



1. MCQ/Viva/Program Execution will be conducted during a semester. : 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.

***For Semester Examination the evaluator will distribute the marks for the minor project work according to the following

guidelines:

Demonstration of Project 50% of the marks allotted for Semester Examination

Presentation and Viva Voce 25% of the marks allotted for Semester Examination

Project Report Document 15% of the marks allotted for Semester Examination

Source Code 10% of the marks allotted for Semester Examination.

OUTLINES OF TESTS, SYLLABI AND COURSES OF … · SYLLABI AND COURSES OF READINGS CHOICE-BASED...

Documents

Transcript of OUTLINES OF TESTS, SYLLABI AND COURSES OF … · SYLLABI AND COURSES OF READINGS CHOICE-BASED...