Download - Free Documents

MCA
Course Curriculum for
Master of Computer Applications
Scheme and Syllabus
Through Distance Education w.e.f. July
Directorate of Distance Education Guru Jambheshwar University of Science amp
Technology, Hisar
Five Year Integrated MCA Course
for Distance Education for the Session
Scheme
BCA st Year / MCA st Year Max Marks Total Paper Code Nomenclature of Paper External
Internal MCA Computer Fundamentals MCA Computer Programming amp Problem Solving
Using C MCA MathematicsI MCA Business Flow Systems MCA Operating SystemI MCA
Communication amp Presentation Skills MCA Lab based on MCA Lab based on Total
BCA nd Year / MCA nd Year Paper Code Nomenclature of Paper MCA Data Structure
Algorithms MCA Database System MCA Digital Electronics MCA Computer Organization and
Architecture MCA MathematicsII MCA Communication SkillsScientific amp Technical Writing
MCA Lab based on MCA Lab based on Total Max Marks External Internal amp Total
BCA rd Year / MCA rd Year Max Marks Paper Code Nomenclature of Paper External Internal
MCA Computer Networks MCA Object Oriented Programming using C MCA Software
Engineering MCA Internet Fundamentals MCA MathematicsIII MCA Social Implications of IT
MCA Lab based on MCA Minor Project Distribution of Marks Evaluation VivaVoce vivavoce
will include Presentation/Seminar/ Demonstration Total Total
BCA th Year / MCA th Year Max Marks Paper Code Nomenclature of Paper External Internal
MCA Computer Graphics amp Multimedia MCA Artificial Intelligence MCA Analysis amp
Design of Computer Algorithms MCA Operating System II MCA Computer Networks II MCA
Management Information System MCA Lab based on MCA Lab based on Total Total
Thesis . Lab. Training report . Project report. MCA Computer Fundamentals . as per the
following criteria i Marks based on two assignmentshandwritten of marks each. Vivavoce
etc.BCA th Year / MCA th Year Max Marks Paper Code Nomenclature of Paper External
Internal MCA Principles of Programming Languages MCA Advanced Architecture and
Parallel Processing MCA Object Oriented Design and Modelling MCA System Simulation
and Modelling MCA Data Mining and Data Warehousing MCA Project Distribution of marks
Evaluation VivaVoce vivavoce will include Seminar/Presentation Demonstration Total Total
Grand Total of Marks from st yr to th yr Internal Marks in each paper including Practicals. ii
Marks for Presentation/Vivavoce.
Read Only memory. Floating Point representation of numbers. need for computer
communication networks. Magnetic Hard Disk. Representation of characters in computers.
Unix Operating System. Computer output units. McGraw Hill. . Some high level languages.
McGraw Hill. Classification of Computers. Personal Computer Operating System. Higher
level programming languages. Representation of intergers. Distributed Computer System. .
Time sharing operating system. Sanders. Multiprogramming Operating system.. Batch
operating system. Trainer. Fourth generation. substraction. Parallel Computer. Allocation of
Channel. Internet and World Wide Web. ATM Networks. Description of computer input units.
Local Area Networks. Binary addition. Binary division.Total Marks Time Hour External
Internal Note Examiner is requested to set eight questions covering the whole syllabi.
Computer basics. Computer Network Topologies. Physical devices used to construct
memories. Types of Communication with analog computers. Addition/Substraction of
numbers in s Complement notation. Twos Complement representation of numbers.
Computers Today. Rajaraman. Why Programming Language Assembly language. Serial
Access memory. Hexadecimal representation of numbers Decimal to binary Conversion.
Second generation. T .et. Communication Protocols. other input methods. New Delhi. signed
numbers. Characteristics of Communication Channels. Floppy Disk Drives. Physical
communication media. Representation of Fractions. D. . . References .al. Fifth generation.
First Generation of Computers. A candidate is required to attempt any five questions.
Memory cell. Interconnecting Networks. Third generation. CDROM. All questions shall carry
equal marks.H. V. . Prentice Hall of India.. Binary multiplication. On line and Real time
system. Computers th Edition. Why do we need an OS. Fundamental of Computers nd
Edition. memory Organization. Magnetic tape drives.
Operations on pointers. comma operators. Problem solving methods. Let us C. Tata
McGraw Hill.MCA Computer Programming and Problem Solving using C Total Marks Time
Hour External Internal Note Examiner is requested to set eight questions covering the whole
syllabi. Passing to a function. Expressions. . Programming in C. and Kalin M. Logical.
References . process. Operators and expressions. Strings. Use of library functions.W. for
statements. Functions Defining and accessing Passing arguments. Yashwant Kanetkar.
Tracing flow charts. continue and goto statements. Kernighan B. close. Passing to a function.
Flow charts. nested loops. Idenifiers and Keywords. external and static variables. Unary.
Passing to a function. All questions shall carry equal marks. A candidate is required to
attempt any five questions. statements and symbolic constants. Arithmetic. Tata McGraw
Hill. Need for computer languages. Pointers Declarations. Data Files Open. gets. The C
Programming Language Prentice Hall of India. Arrays of pointers. and Ritchies D. Hutchison
R R. Reading programs written in C language. Multidimensional arrays. . preparing and
running a complete C program. N. . printf. ifdef. Function protoypes. Union. . if else. putchar.
bitwise.M. dowhile. Tata McGraw Hill. Preprocessor commands. Balaguruswamy. break.
Data types. Recursion. C character set. . Storage classes Automatic. operations on strings. .
puts functions. Unformatted data files. assignment and conditional operators. Control
statements.Y. E. . New York. Define. Arrays Defining and processing. Library functions.
Introduction to C. create. include. InputOutput getchar. . Structures Defining and processing.
Declarations. Pointer and arrays. Introduction to algorithms. While. Applications
Programming in C MacMillian. Johnsonbaugh R. switch.
mean.MCAI MATHEMATICSI Total Marks Time Hour External Internal Note Examiner is
requested to set eight questions covering the whole syllabi. Calculus Differential Limits and
functions. parametric differentation. differential coefficient. by partial fractions and by
substitution. mean deviation. deciles and percentiles. straight line. arithmetic operation on
martrices. distance between two points. subtaction and transformation formulae. transpose.
Trigonometry Revision on angle measurement and T ratios addition. solution of simultaneous
equations using matrices. adjoint reciprocal and inverse of a matrix. indefinite integrals of
standard forms. standard deviation. HM and weighted arithmetic mean form discrete and
continous frequency distribution. median. Matrices. slope and intercept form. deviation.
including function of a function chain rule. diagonal matrices etc. homogeneous equations.
Analytical plane geometry Cartesian coordinates. Differential equations definition and
formation of ordinary differential equations. solutions of simultaneous equations by Cramars
rule. quartile. differentiation of standard functions. calculation of standard deviation . locus of
a point. formal evaluation of definite integrals. A candidate is required to attempt any five
questions. Definition of special matrices like unit. Algebra Revision on equation reducible to
quadratics and simultaneous equations linear and quadratic up to two variables only.
Determinants and their six important properties. elements of successive differentiation. All
questions shall carry equal marks. mode. logarithmic differentiation. general equation of first
degree. equations of first order and first degree. variable separable. measures of dispersion.
singular. integration by parts. area of triangle. ideal characteristics. differentiation of implicit
functions. Integral integration as inverse of differentiation. linear equations and differential
equations reducible to there types. GM. quartiles. measures of dispersion range. Statistics
Measures of central tendency. quartile deciles and percentiles. range. T ratio of multiple and
allied angles.
Company Management Shareholders. All questions shall carry equal marks.. Meeting and
resolutions. Forms of legal ownership Sole proprietorship. Business Management Nature and
importance. Environment of business system Economic and noneconomic environment.
rationalization arid combination.S. tendency towards large size. optimum firm. Functions of
managementplanning organization. partnership company and cooperative societyfeatures.
duties. formation. directing and controlling scientific management. Probability and events
Bayes theorem probability theorem. . References . Grewal. quotEngineering
Mathemiaticsquot Gupta S. Principles of Management. . elements of binomial and Poisson
distributions. chief executive and managing director. . V. ownership and management.
environment and management. scatter plots. Fundamentals of Mathematical Statistics.
Horizons of business Business combination. standard error of means. method of least
squares Pearsons coefficients of correlation. business system.and Kapoor. board of. staff.
merits and demerits. probability distributions.P. business and economic system. Introduction
The nature of business and components of business. R. Agarwal. normal distribution.
directors. . Sultan Chand amp Sons. A candidate is required to attempt any five questions.
coefficient of variation.from discrete and continuous frequency distributions. quotModern
Approach of Mathematicsquot. Public utilitiescharacteristics rights. Scale of Operation and
size of firm Measures of size and factors determimng size. MCA Business Flow Systems
Total Marks Time Hour External Internal Note Examiner is requested to set eight questions
covering the whole syllabi. Linear correlation and regression analysis.K. winding up process.
System structures. Body Language. Operating system services. MCA Operating SystemI
Total Marks Time Hour External Internal Note Examiner is requested to set eight questions
covering the whole syllabi. All questions shall carry equal marks. Operating system
structures System components. . Workshop. All questions shall carry equal marks. Personal
Computer system. A candidate is required to attempt any five questions. Distributed system.
scheduling algorithms. Deadlock characterization. Multi programmed batch systems. Memory
management. Time sharing system. Introduction to Batch systems.. Methods for handling
deadlocks.References Study Material already developed. system programs. Publications.
Small group communication techniques. Real time systems. Public speaking techniques.
MCAI Communication and Presentation Skills Total Marks Time Hour External Internal
Silberchatz Galvin. Swapping Concept. Definition of Operating System. . Operating System
Concepts. Parallel system. Communication Skills Essentials of Communication skills.
Interview. Dress codes. CPU scheduling basic criteria. Process Concepts. Process
scheduling. Operations on processes. Group Discussions etc. Deadlocks system model.
Wiley Note Examiner is requested to set eight questions covering the whole syllabi.
References . Virtual machines. A candidate is required to attempt any five questions.
Functions of Operating System. Logical and Physical addresses. system calls.
AudioVisual aids. Written Presentation a b References . MCA Data Structure amp
Algorithms Total Marks Time Hour External Internal Preparation of C. Balanced Tree
Definitions. Binary Search Tree. Presentation Skills a Presentation aids Audio aids.S.
Storage Structures. Trees Definition of tree. . quotBusiness Communicationquot. variable
and fix length strings. Report writing Note Examiner is requested to set eight questions
covering the whole syllabi. Galgotia Publishing Company. K. String Handling.. Binary tree
and related terms.. Postmeeting Follow up. Rajender Pal. b c Use of Power points.
Application of linked list on polynominal expressions and sets. sequential search. threaded
tree. operations on array. Tree Traversals. Linear Lists Arrays. Meetings Convening.
Managing. circularly linked lists. Introduction Definitions and Importance of Data Structures.
Korlahalli quotEssentials of Business Communicationquot. Printed aids.K. address
calculation in single and multidimensional arrays. Linked lists and operations on
them./Resume. . . Abstract data types.V. Binary Search and their complexity analysis.
Doubly linked list. Visual aids. Prepatation. A candidate is required to attempt any five
questions. Himalya Publishing House. All questions shall carry equal marks. Doubly linked
list. Application of binary tree. J. Head. Sinha.
data Modeling concepts. Bubble. Database oriented approach to Data Management.
Specifying constraints amp Indexes in SQL. All questions shall carry equal marks.
Application of graphs route problems. Data Models. Integrity Constraints Data definition in
the Hierarchical Model. Data Processing Vs Data Management System. File Oriented
Approach. Data Languages amp Interfaces. Quick. Schaum Series. Constraints in the
Network model. SQL Data Definition in SQL. Relational Algebra. . Hashing techniques
References . A Relational Database Management Systems ORACLE . Merge. Insertion. view
and queries in SQL. A candidate is required to attempt any five questions. . Conventional
Data Models amp Systems Network. Relational model constraints. Data modeling using the
Entity. Data Manipulation in a Network Database. Characteristics of a Database. Use of Data
as Resource. Sorting teclmiques Selection. Hierarchical Database Structures. Warshall s
algorithm. Database Administrator. DBMS Architecture amp Data Independence. PHI.
Information. Relationship Approach. Languages amp Systems Relational Model concepts.
McGraw Hill Tenenbaum. Data Dictionary. Advantage and Disadvantages of databases
systems. Schemas amp Instances. Introduction to Data Structures. MCA Database
Management System Total Marks Time Hour External Internal Note Examiner is requested to
set eight questions covering the whole syllabi.Graph Representation of graph in memory and
various operations on them. Minimum spanning tree. Basic Concepts Data. Finding path
matrix. Relational Model. Knowledge. Heap with their complexity analysis. Types of
Database system. Data Structure using C. Database Management system.
Basic Digital Circuits. Addision Wesley. An overview of ClientServer Architecture. Query
Processing Basic Alogrithms for Executing Query Operations. Types of Distributed Database
Systems. .D. J. Concurrency Control amp Recovery Techniques Concurrency Control
Techniques. Digital Signals. Naveen Parkash. Using Heuristics in Query Optimization. TMH.
Normal Forms based on primary keys INF. Database Backup and Recovery from
catastrophic failures. Boolean Algebra amp Theorems. All questions shall carry equal marks.
Distributed Databases and Client Server Architecture Distributed Database Concepts Data
Fragmentation. Fundamental Concepts Introduction. NF amp BCNF.Relational Database
Design Function Dependencies amp Normalizations for Relational Database. Ullman.
Recovery Techniques. Pearson Education. Fundamentals of Database Systems. Introduction
to Database Management System. A candidate is required to attempt any five questions.
Lossless join amp Dependency preserving decomposition. J. NF. Time Stamp Ordering.
Query Processing in Distributed database. Granularity of Data items. References . Recovery
Concepts. Widom. . Replication and Allocation. New York. Locking Techniques. MCA Digital
Electronics Total Marks Time Hour External Internal Note Examiner is requested to set eight
questions covering the whole syllabi. . Functional Dependencies. A First Course in Database
System. Navathe. Elmasri.
Parity Generator/Checkers. Flip Flops Introduction.Binary. Galgotia Book Source. . EBCDIC.
EXCESS. Sequential Circuits. Multiplexer/ Encoder.addition. Edge triggered flip flops. Digital
Electronics. Introduction about TTL amp CMOS Logic. TypesAsynchronous Counter or
Ripple Counters.P. Characteristics of Digital ICs. A candidate is required to attempt any five
questions. Half Subtracter. Serial Input Parallel Output.Number System amp Codes
Introduction. . Dharminder Kumar. T type FF. TMH. Octal. Minterms amp Maxterms. Digital
Computer Electronics. Number System . Kamaugh Map. MCA Computer Organization amp
Architecture Total Marks Time Hour External Internal Note Examiner is requested to set eight
questions covering the whole syllabi. Ghoshal. Error codes. Full Adder. Comparator. All
questions shall carry equal marks . Gray. Bidirectional Shift Registers. Counter Design. Jain.
Code Converters. ASCII. CodesBCD. TMH. Hexadecimal Signed amp Unsigned binary
Numbers. TriState Logic. . simplification using K maps.SOP amp POS. amp variables.
Registers Introduction. R. Synchronous Counters. Malvino Leech. Standard forms .
Demultiplexer/Decoder. Serial Input Serial Output. Octal. Clocked SR FF. Dtype FF. Parallel
Output. Parallel Input. References . Hexadecimal. Universal Shift Register. Dont Care
conditions. Master Slave JKFF. Shift Registers. Modern Digital Electronics. Full Subtractor.
JK FF. Counters Introduction. Half Adder. subtraction. Excitation Tables of Flip Flops.
Introduction to Digital Logic Families Introduction. D. Combinational Logic Design
Introduction.Mohan. Binary Arithmetic . Parallel Input Serial Output.
chains. Associative Memory. Timing and Control. Cosets. Register Transfer and
Microoperations. paths. Modes of Transfer. algorithms for determining cycle and minimal
paths. Lattices. Addressing modes. nd Edition. connectivity. Hasse diagram. semigroups.
Graphs Directed and undirected graphs. Direct Memory Access. cycles.Basic Computer
Organization. MCA MathematicsIIDiscrete Mathematical Structures Total Marks Time Hour
External Internal Mano M. InputOutput and Interrupts Microprogrammed controlunit. flows ion
networks. Adjacency and incedence matrices. Installations formats. rd Edition. Stallings W.
language. Memory organization. InputOutput Organization. auxiliary Memory. All questions
shall carry equal marks. Asynchronous Data Transfer. PHI. A candidate is required to
attempt any five questions. Reference . Arithmetic and Logic microoperations. Lattices and
Boolean Algebra Relations to partial ordering. Microprogram Sequencer. Stack organization.
modular arithmetic. . Computer Organizations and Architecture. error correcting codes.
Virtual Memory. circuits. Priority Interrupts. Subgroups. Group and Subgroups Group axioms.
Arithmetic Unit. polish notation and trees. Memory Reference Instructions. Axiomatic
definition of Boolean algebra as algebraic structures with two operations basic results truth
values and truth tables. The algebra of prepositional . Note Examiner is requested to set
eight questions covering the whole syllabi. Instruction cycle. Central Processing Unitgeneral
register organization. Minimas path Application Flow charts and state transition graphs.
Permutation Groups. computer Instructions.. Cache Memory.. PHI. grammars.
ShiftMicrooperations. Normal subgroups. FREE Semigroups. Applications. Finite State
Machine. Computer System and Architecture.
McGrawHill International Editions. . Ltd. Awareness of general and applied scientific and
technical events. Gate circuits. Discrete Mathematics and Its Applications. McGrawHill
International Editions Marc Lars Lipson. History of various scientific and technical
developments. Achievements of well known scientists of the world.Scientific and Technical
Writings Total Marks Time Hour External Internal Note Examiner is requested to set eight
questions covering the whole syllabi. Seymour Lipschutz. Interviewing a scientist. article.
Mathematics Series. Structure. PrenticeHall ofIndia Pvt. Galgotia Publications Pvt. Ltd.
Schaums Series. . facing a press conference by a scientist. Writing science feature. .
Splitting field. Alan Doerr. MCA Communication Skills . downward. Discrete Mathematical
Structures For Computer Science. polynomial roots. Bernard Kolm and Robert C. . Flow of
Communication in various scientific and technical organizations upward. Integral domain.
Applied Discrete Structures for Computer Science. Rosen. A candidate is required to attempt
any five questions. Special article. Irreducible polynomial. Precautionary measures in
scientific and technical writings. editorial. Kenneth G. Discrete Mathematics.function. lateral.
Delivering a public speech on the matter relating to Science and Technology. Basics of
Communication Skills VisampVis Scientific and Technical organizations. All questions shall
carry equal marks. Writing a Press Release on the subject relating to science and
technology. Finite Fields Definition Representation. The Boolean algebra of truth values.
Communication networks in the scientific and technical organizations. Popularization of
scientific and technical writings.Busby. References . Media coverage of scientific and
technical writings. Applications Switching circuits.
Primary attribute of LAN. Network Hardware. IEEE LAN . Topologies. Transport Layer The
transport service. Business Communication. Sinha. intemetworking. Error detection and
Correction. Network Software. MCA Computer Networks Total Marks Time Hour External
Internal Note Examiner is requested to set eight questions covering the whole syllabi.
Elements of transport protocols. Local Area Networks Introduction. Introduction.. Worldwide
Web. . Medium Access Sublayer Channel allocation Problem in Multiple access protocols.
References . . Elementary data link Protocols. COMMUNICATION CULTURE amp
DEVELOPMENT.. SNMP. . K K. Joel Whalen. FDDI Data Link Layer Design Issues.
Application Layer Network Secutiry. Sage Publication. Multimedia Introduction of ISDN and
ATM.References . . . MAN. H. standards . tramission media. YushkiAritshus. Advantage of
Computer Networks. Congestion Control algorithms. History and Development of Computer
Networks. type of transmission. A candidate is required to attempt any five questions.
Physical Layer Theoretical basis for data communication. DNS. Routing algorithms. EMail. .
Galgotia Publishing Company. I See What You Mean. D. USENET.. Network Layer Design
issues. Fry Roland. OSI and TCP/IP reference models. All questions shall carry equal marks.
Why Lan. MANUAL OF COMMERCIAL CORRESPONDENCE. sliding window protocols.
Prentice Hall of India.. Computer Networks. A candidate is required to attempt any five
questions. Timothy Budd. A candidate is required to attempt any five questions. MCA Object
Oriented Programming using C Total Marks Time Hour External Internal Note Examiner is
requested to set eight questions covering the whole syllabi. Abstraction. New Delhi. Classes
and Objects.. . . Tata McGraw Hill. . Working with C files.Balagurusamy. Constructors and
Destructors.. Managing Console I/O Operations. Computer Networks. MCA Software
Engineering Total Marks Time Hour External Internal Note Examiner is requested to set eight
questions covering the whole syllabi. Object Oriented Concepts Paradigms of Object
Oriented Programming Object and Classes. Information Hiding. References .. Operator
Overloading and Type Conversions. Uylen Black. Templates and Exception Handling. PHI.
All questions shall carry equal marks.. Inheritance and Polymorphism Object Modeling.
Object Oriented System Development. PHI. Pointers. Tannenbaum A. Virtual Functions and
Polymorphism. ..S. Encapsulation.al. Software Processes. All questions shall carry equal
marks. Object Oriented Modeling and Design. et. . nd Edition. Object Oriented Programming
with CI. Inheritance Extending Classes. Software Life Cycle models . An Introduction to
Object Oriented Programming Pearson Education Asia. . Rambagh J. th ED. C Language
Function in C. E. Introduction Software Crisis.
. Functional Testing Boundary value analysis. Decision table testing. Software Engineering.
Behavioral and nonbehavioral requirements. Logarithmic Poisson Model. Sommerville.
Prototype. R. Design Metrics. Data Flow Diagrams. Entity Relationship Diagrams.Waterfall.S.
I. Software Testing Software process. Function Count. integration and system testing.
Software Requirement and Specifications. P. Reverse Engineering. Structured Programming.
Structural testing Path testing. Fault Reports. . User Interface Design. Narosa. Information
flow metrics. Evolutionary and Spiral models. Testing Tools amp Standards. Software Design
Cohesion amp Coupling Classification of Cohesiveness amp Coupling. Testing During
Maintenance. Software Engineering Concepts. Calender time Component Reliability
Allocation. . Software Requirement Analysis and Specification Problem Analysis. Pressman.
McGraw Hill Int. rd ed. Reliability Models Basic Model.A practitioners approach. unit testing.
Tata McGraw Hill. R. Debugging. Single and multivariate models. Software Maintenance
Management of Maintenance. Reference . Token Count. Function Oriented Design. Addision
Wesley. Software Reliability Failure and Faults. Software Prototyping. Software Metrics Size
Metrics like LOC. .Jalote.Fairley. .Static. Authorizing changes to the product.. Object
Oriented design. Software Project Planning Cost estimation . Data flow and mutation testing.
Ensuring maintainability. SEICMM. Data Structure Metrics. Data Dictionaries. Overview of
Quality Standards like ISO . . Cause effect graphing. An Integrated approach to Software
Engineering. Risk Management. . Ed. . Software Engineering. COCOMO model. Putnam
Resource Allocation Model. Equivalence class testing.
Comer. Packets. Douglas E. Frames and Error detection. Interpreting a ping response. IP
Datagrams and Datagram forwarding. complexity in Network systems. Naming with the
Domain name system. WAN technologies and Routing. Nasib S. Software Engineering. . The
future IPIPV . All questions shall carry equal marks. Probing the Internet. New Age
Publication. World wide web pages amp Browsing. Reference . MCA Internet Fundamentals
Total Marks Time Hour External Internal Note Examiner is requested to set eight questions
covering the whole syllabi. MCA MathematicsIIIComputer Oriented Numerical and Statistical
Methods Using C Total Marks Time Hour External Internal . Computer Networks and
Internets. Khanna Publications. CGI Technology for Dynamic web documents.
Fragmentation. . Pearson Education Asia. IP Internet protocol addresses. Electronic mail
Representation and tranfer. . Growth of the Internet.Gill. Network ownership. . K. Aggarwal.
Yogesh Singh.. file transfer and remote file access. TCP Reliable Transport service. Tracing
a route. Network Management amp Security. Introduction Growth of computer networking.
Architecture and protocols.K. service paradigm and performance Internet working concepts.
A candidate is required to attempt any five questions. Software Engineering. IP
Encapsulation.
Siinpson s rules and Gaussian Quadrature. A candidate is required to attempt any five
questions All questions shall carry equal marks. V. Trapezodial. Inverse interpolation.
Cochrans Theoram. arithmetic operations with normalized floating point numbers and their
consequences. Polynomial fitting and other curve fitting. Statistical methods Sample
distributions. Error in number representationpitfalls in computing. Polynomial evaluation.
ANOV A Table.conditioned equations. Pitfalls in differentiation. Seasonal fluctuations and
Cyclic movement.formulae based on polynomial fit. syllabus uniformly. Ill.K. Solving
polynomial equations Bairstows Methods. . Sultan Chand amp Sons. Computer Arithmatic
Floating point representation of numbers. Analysis of Variance Definition. Difference tables.
One way classification. Iterative Methods Bisection. Rungakutta methods.P. GaussSeidal
Iterative method. interpolation. False position. t and F test. Interpolation and Approximation
Polynomial. Twoway classification with one observation per cell. Taylors series and Euler
methods. Predictor corrector methods. Gupta S. Numerical Differentiation and Integration
Differentiation . Assumptions. Time Series Analysis Components and Analysis of Time
Series. NewtonRaphson methods.. Solving of Simultaneous Linear Equations and ordinary
Differential Equations Guass elimination method. Fundamentals of Applied station statistics.
References . Discussion of convergences.Note Total eight questions are to be set by the
examiner covering the entire. . . Test of Significance. and Kapoor. Approximation of functions
by Taylor series and chebyshev polynomials. Measurement of Trend.
economic. .. . the examiner is requested to set three topics on the current debates on social
implications of Information Technology for essay writing. and Kapoor. the power of receivers
and senders and control over the content. the architecture of networks. the examiner is
requested. . Sultan Chand amp Sons. India. The debates includes social. Computer Oriented
Numerical Methods. Introduction Importance of social dimensions of science and technology.
Prentice Hall. The candidates are required to write an essay of approximately words on
anyone of the topics. Influencing factors such as geography of access. Social scientists and
others have thought about their social and economic role.P. Introduction to Statistics. V.
which is compulsory. to set five questions each of marks . debate over the social implications
of information and communication technologies. perspectives on technology and society.
Statistical Modelling.. In the first section. A candidate is required to attempt any three
questions from this section. MCA Social Implications of Information Technology Total Marks
Time Hour External Internal The objective of this course is to enable the students to debate
on Social dimensions of Information Technology. Graybill. . The essay will be of marks.
Information politics in digital age How do social and technical choices reshape acccess to
people. Perspectives on role of IT Focus on alternative ways in which IT professionals.
McGraw Hill. Anderson. services and technologies. Fundamentals of Applied station
statistics. Gupta S. . political and cultural implications of Information and Communication
Technologies. Rajaraman.K. In the second section.. Note Examination will have two
sections. McGraw Hill. Y.
Redesigning of work place. SutherlandCohen approach..Information Technology and the
reach of boundaries of business and management. Bezier curves. All questions shall carry
equal marks. Oxford University Press. scaling. Useful Internet sites http//www. Teich. .
rotation. mirror images. Bsplines. Raster Scan Display.ou. Newyork s. A candidate is
required to attempt any five questions. Calligraphic display. A. Technology and the future.
orthogonal projections. Line and Circle plotting using Bresenhams algorithm. W. Martin Note
Examiner is requested to set eight questions covering the whole syllabi.html MCAl Computer
Graphics and Multimedia Total Marks Time Hour External Internal Castells M.edu. D
graphics. The intelligence household. Privacy and surveillance in everyday life and impact of
IT on culture. perspective projection . References . vanishing .com http//www. Graphic
display devicesStorage CRT display. Picture transformationtranslation.
transformationsrotation about an arbitrary axis. Light Pen.. . Isometric projections. Debates
on digital divide. Midpoint Sub division algorithm. Windowing and Clipping. Graphics Input
Devices Mouse. ..chiodo/orwell. IT in learing and education. th edition.H. curve drawing using
Hermite polynomial. The Internet Galaxy Oxford University Press. D. Circle amp Ellipse
plotting using Midpoint algorithm. Dutton. press.H.C. Society on the line Information politics
in digital age.alteich. multiple views.C/Kara.students.
References . Pradeep K. Bhatia . . Production systems. Tata McGrawHill. Gordan Kalley.
David F Rogers Procedural Elements for Computer Graphics. AI techniques. I. Area Sub
division. International . Computer Graphics. Depth first. search knowledge. ND Ed Roy A.
best first search. heuristic searchHill climbing. Painters. Robotics. Computer Graphics.
Principles of Interactive Computer Graphics.points.Pauline Baker. Computer Graphics.
natural language processing.. Schaums Outline Series. Computer Graphics. Newman amp
Sproull. Tata McGraw Hill . Curved surface generation. theorem proving. vision and speech
processing. abstraction Problem solving State space search. N . PHI. ScanLine. Steven
Harrington.K. hidden surface removalZbuffer. branch and bound.A Programming Approach.
Search space control. McGraw Hill. expert systems. Scope of AI Games. . Tata McGrawHill.
All questions shall carry equal marks. Donald Hearon amp M.Plastock. Application Area for
multimedia. Multimedia Hardware and Software for Multimedia. Multimedia authoring tools.
Components of Multimedia. . A candidate is required to attempt any five questions. . breadth
first search. .Krishnamurthy. Tata McGrawHill MCA Artificial Intelligence Total Marks Time
Hour External Internal Note Examiner is requested to set eight questions covering the whole
syllabi. Introduction to Computer Graphics. .
. Artificial Intelligence. Nilsson. and Knight K.A. E.Best first search. Structured Knowledge
Representations Semantic Net slots. Prentice Hall ofIndia. Modus popes... Narosa Publishing
House. Norosa Publishing House. . Conflict resolution. Singapore.. frames. . . Knowledge
acquision. Ramani. Introduction to AI and Expert System. . S.Unifiction. . Use of certainty
factors. MCA Analysis and Design of Computer Algorithms . learning automation. Rule
Based Expert System. Means End Analysis. Satisfaction. Addison Wesley Publishing
Company. neural nets back propagation. Patterson. Introduction to Expert system.
exceptions and defaults. McGraw Hill International Edition. Handling uncertainty Prababilistic
reasoning. Case studies MYCIN. Sasikumar. Tata McGraw Hill IInd Edition . Resolution.
Peter Jackson. R.J. D. dependency directed backtracking Rule Based Systems Forward
reasoning. Fuzzy logic Learning Concept of learning. RI References . . . SchalkotI. M.
Constraints. Problem Reduction..J. N. Knowledge Representation Predicate logic
Skolemizing queries. genetic algorithm. Rich. . Expert Systems Need and justification for
expert systems. M. Learning by induction. Backward reasoning Use of no backtrack.
Principles of AI. Artificial IntelligenceAn Enfineering Approach.W..
. I/O Knapsack. Analysis of Algorithms. Making change Money. Heaps amp Heapsort.E. . A
candidate is required to attempt any five questions. stacks and queues. Finding maximum.
All questions shall carry equal marks. Fundamental of Algorithm Galgotia Publications.
Backtracking The queues problem. Elementary Data Structures. Aho A.Total Marks Time
Hour External Internal Note Examiner is requested to set eight questions covering the whole
syllabi. and Ullman. minimum. Optimal Binary search trees. Horowitz E and Sahni S. .D. ..
Sum of subsets. quick sort amp Strassens Matrix Multiplication etc. merge sort. Minimum
Spanning Trees. Trees. Branch and Bound O/I Knapsock problem. . Basic definitions amp
types of Algorithms. Single source/shortest path etc Digkastras Algorithm. . Graphs its
sequential amp linked representation. flow shop scheduling etc. Divide and Conquer
Problems Binary search. J. the travelling salesperson problem. Lower bound Theory amp NP
Hard amp NP Complete problems. J. References . Solving recurrence relations. Knapsack
problem.V. Travelling Sales person etc. Hoperoft. Design and Analysis of Algorithm Addison
Wesley. Greedy Method Problems Optimal storage on tape. . Dynamic programming All pair
shortest path. Knapsock problem amp Graph colouring etc. Basic Techniques for Algorithms
.
Operating System Concepts. References . An Inroduction to Operating Systems Concepts.
Classical problems of synchronization. free space management. Network Operating
Systems. Critical section problems. File access methods. Inter process communication.
Avoidance and detection. D. Review of Basic concepts of operating system. Introduction to
UNIX Operating system.. Willey Publications. monitors. . Disk Scheduling. Brassard G. File
concept. Process syncronisation concepts.. Threads. Addison Wesley. Directory
implementation. Directory structures. MCA Computer NetworksII Total Marks Time Hour
External Internal .M. Paging Segmentation. CPU scheduling algorithms. All questions shall
carry equal marks. Memory management and File handling system. Deadlock Prevention.
CPU scheduling criteria. Introduction to Algorithms Addison Wesley. Thrashing. PHI Manber.
Basic Architecture. Silberchatz Galvin. Allocation methods. MCA Operating SystemII Total
Marks Time Hour External Internal Note Examiner is requested to set eight questions
covering the whole syllabi. Deitel. Distributed Operating systems.. Synchronization hardware.
H. and Brattey P. Demand Paging. recovery from deadlock. . Semaphores. Basic concepts of
Deadlock. A candidate is required to attempt any five questions. Intorduction to algorithms.
Disk structure.
Petra Borowka. and Architecture. Performance Attributes. All questions shall carry equal
marks. Pearson Education Asia. IP address concept. References . . future ofTCP/IPIPv. .
Hello. Streameny stored audio and video. Vol. Internet Security and Firewall Design IP sec.
HighSpeed Networks MCA Management Information System Total Marks Time Hour
External Internal . Nalin K. Douglas E. . Multimedia Applications user activities and
intraactivites. Multimedia Information Netrworking. Fourth Edition. James F. Mobile IP. Video
Conferencing . TCP. OSPF. Network Backbone. Internet working with TCP/IP. A candidate is
required to attempt any five questions. Single user networked applications.Note Examiner is
requested to set eight questions covering the whole syllabi. Packet switching networks.
Ross. Internet Tools. . Internet ProtocolIP connection less data delivery. Circuit switching
networks. Internet architecture. RTP. Need for High Speed Networks. Comer. Socket
Interface. Intorduction to Internetworking concepts. Routing Protocols RIP. Stand alone
multimedia applications. WAN Introduction. . Computer Networking A top down approach.
featuring the internet. Protocols. Bridges. Thomson computer press. Principles. Sharda. PHI
Neelu Shrivastva. Introduction to high speed Networks. Multimedia Networking. LAN
switches. Kath W. UDP. Internetworking The way to a structure of Network. Multimedia
networking applications. Mapping of internet address to physical addressARP. Kurosa.
Pearson Asia Education. Routers.
variables. scope rules. Relatedness of MIS with management activities. A candidate is
required to attempt any five questions. Concept of balance. Management fuctions and
decision making. Abstraction data abstraction. control abstraction. Joel E. . James R. Robert
G. All questions shall carry equal marks Preliminaries Language paradigms. Claggett.
structures data types. procedure activations parameter passing methods. variable and data.
Nature. Information systems for ModernManagement . procedural abstraction. finite
automata.OBrien. language design tradeoffs. type checking. Formal languages and
automata The chomsky hierarchy of formal languages. ambiguous grammars. Impotance.
regular grammars regular expressions. of MIS Methodology and Tools. Role. All questions
shall carry equal marks Background. types primitive data types. and activation records.
modification of MIS. Evolution of Management through information system.Note Examiner is
requested to set eight questions covering the whole syllabi. References . Jalles A. Ross.
bindings. language criteria. Murdick. Meaning. Developement. Need. Management
Information System MCA Principles of Programming Languages Total Marks Time Hour
External Internal Note Examiner is requested to set eight questions covering the whole
syllabi. evaluation. and scopes. Imperative Programming Structured programming.
Influences on language design. Context free grammars pushdown automata. MIS
Effectiveness and efficiency criteria. techniques for systematic identification. A candidate is
required to attempt any five questions.
application of functional languages. A candidate is required to attempt any five questions. nd
ed. classes and polymorphism. synchronization of cooperating processes. Apple by Doris
amp Vandekopple J.Addison Wesley. Logic programming Formal logical systems. Program
Partitioning amp Scheduling. Parallel Computer Models The state of computing. th ed.
Program flow mechanism. PRAM and VLSI models. implementing functional languages.
System Inter connect Architecture. Programming languagesParadigm and practices. Memory
hierarchy technology. Robert. .Julius. Processor and Memory Hierarchy Advanced processor
technology. . Program amp. inheritance and object orientation.Addison Wesley MCA
Advanced Architecture and Parallel Processing Total Marks Time Hour External Internal
Note Examiner is requested to set eight questions covering the whole syllabi. methods and
encapsulation. Multiprocessors and Multicomputers. Multi vector and SIMD Computer. All
questions shall carry equal marks. Sabesta W. Languages for databases manipulating
relational databases using SQL. Virtual memory technology. implementations and
applications. Languages constructs for parllel processing the paradigm multiple processes.
Concepts of programming languages. Functional programming Features of functional
languages. Programming languages.Object oriented programming massages. design issues
for object oriented languages. TMH . nd ed. References . Sethi Ravi. N/W Properties
Conditions of parallelism. Superscaler and Vector Processor.
Object design. Message passing mechanism. Meta data. References .Bus Cache and
Shared Memory Backplane bus system. Dynamic Modeling. cache memory organisation.
Grouping constructs. Documentation. . A candidate is required to attempt any five questions.
Events and states. Generalisatiort and Inheritance. Comparison of methodologies. Object
Modelling Objects and Classes. Pipelining and Superscaler Techniques Linear pipeline.
Boundary condition. Nesting Concurrency Functional Modeling. implementation of control.
System Design Subsystems Concurrency. Dynamic Modelling. Allocation to processors and
tasks Management of data stores. Generalization as extension and restriction. Aggregation.
Data Flow Diagrams specifying operations. Links and Associations. All questions shall carry
equal marks. Multiple Inheritance. MCA Object Oriented Design and Modelling Total Marks
Time Hour External Internal Note Examiner is requested to set eight questions covering the
whole syllabi. Cache Coherence and synchronization mechanism. Optimization. Candidate
keys. Superscalar and superpipeline design. Requested and weak consistency model.
Functional Modeling. Architectural frameworks. Multiprocessor and Multicomputers
Multiprocessor system Interconnect. Arithmetic Pipeline. Design of associations. Instruction
Pipeline design. Shared memory organization. Iteration. Nonlinear pipeline. Adding
Operations. Kai Hwang Advanced Computer Architecture MGH Publications. Adjustment of
inheritance. Control implementation. Analysis Object Modeling.
study and use of one language depending on the availability in detail. All questions shall
carry equal marks.Implementation Using a programming language. Object Oriented
Modelling and Design. Modelling process and defination of the model. References . CA.
Defination of System Types of system. USA... Differential and partial differential equartion
models. reusability.J. Benjamin Cummins Publishing Co. programmingintheIarge. Booch.
Programming styles. Simulation of a time sharing computer system. robustness. Rambaugh..
et. Discrete and continuous simulation procedures. Prentice Hall ofIndia. Simulation
languages A brief introduction to important discrete and continues simulation languages. . A
candidate is required to attempt any five questions.al. Prentice Hall ofIndia. . et. References .
Rebecca WirfsBrock.al. Use of database and A. Combining discrete event and continues
models. . Techniques in the area of modelling and simulation. verfication and validation
modelling procedures. continuous and discrete. Comparing model data with real system
data.quotObject Oriented Analysis and Designquot. . New Delhi.G. Designing Object
Oriented Software.I. a database system. MCA System Simulation and Modelling Total Marks
Time Hour External Internal Note Examiner is requested to set eight questions covering the
whole syllabi.redwood City. Computer workload and preparation of its models. nd edition.
case study. Examples of a computer system should be used for illustration and discussion
purposes Simulation Process Uses of simulation.
Mining singledimensional Boolean Association rules from transactional databases. data
mining applications. What is data warehouse. trends in data mining. Architecture of Data
Mining System Association rule Mining. Data reduction Data Mining Primitives.
Constraintbased association Mining. J. Morgan Kaufman Publisher . Dataware house
implementation. What is classification What is prediction issues regarding classification amp
prediction Classification by decision tree induction. System Simulation N Deo.. System
simulation and modelling MCA Data Mining and Data Warehousing Total Marks Time Hour
External Internal Note Examiner is requested to set eight questions covering the whole
syllabi. Data MiningConcepts amp Techniques. Mining multidimensional rules from relational
databases amp data warehouses. Data Mining Query Language. Classification of data
mining system. Data Warehousing. Sam Anahory amp Dennis Murray. a multidimensional
data model. Pearson Eductioan .Han amp Michelize Kamber. All questions shall carry equal
marks. classification by back propagation . What is cluster analysis. Why preprocess the data
Data cleaning. major issues in data mining. A candidate is required to attempt any. What is
Data Mining. Hierarchical methods.Gorden. outlier analysis Applications and trends in data
mining. five questions. Pattern Interestingnees. categorization of major clustering methods.
social impacts of data mining. .. Designing G.lJI based on DMQL. Data integration and
Transformation. Bayslan classification. Data warehouse architecture. References .
partitioning methods. G. Data Mining Functionalities.
Hisar . Micheal J.. . Clande Seidman.Linoff. PrenticeHall India. Berry. . Mastering Data
Mining. Data Mining with Microsoft SQL server . All Rights Reserved By Directorate of
Distance Education Guru Jambheshwar University of Science amp Technology.A. John
Willey amp Sons. Gordan S.