Dr. K. N.

MODI UNIVERSITY NEWAI

RAJASTHAN
SYLLABUS For MCA. 1st to 6th Semester Session: 2011-12

MASTER OF COMPUTER APPLICATION

DR. K. N. MODI UNIVERSITY

Study and Evolution Scheme MCA (Master of Computer Application) Effective from session 2011-12 MCA I Semester Year-I Semester-I
S. NO. Sub Code Subject Name Period Evaluation Scheme Continuous Final Total Assessment Exam P 0 40 60 100 5 Credit

L 1 01MC101 Professional Communication Financial Accounting Computer Concept and programming in (C) Discrete Mathematics Organization Behavior 4

T 1

2 3

01MC102 01MC103

4 4

1 1

0 0

40 40

60 60

100 100

5 5

4 5 LAB 1 2 3

01MC104 01MC105

4 4

1 1

0 0

40 40

60 60

100 100

5 5

01MP101 01MP103 01MP1011

Communication Lab C Lab Co-Curricular Activities TOTAL

0 0 0 20

0 0 0 5

2 2 4 8

50 50

50 50

100 100 50 750

1 1 1 28

DR. K. N. MODI UNIVERSITY

Study and Evolution Scheme MCA (Master of Computer Application) Effective from session 2011-12 MCA II Semester Year-I Semester-II
S. NO. Sub Code Subject Name Period Evaluation Scheme Continuous Final Total Assessment Exam P 0 40 60 100 5 Credit

L 1 01MC201 Object oriented programming using C++ Comp. Based numerical & statistical technique Computer Organization Human Values and Professional Ethics Environment Science and Ecology 4

T 1

01MC202

40

60

100

01MC203

40

60

100

01MC204

40

60

100

01MC205

40

60

100

LAB 1 2 3 01MP201 01MP202 01MP2011 C++ Lab CBNST Lab Co-Curricular Activities TOTAL 0 0 0 20 0 0 0 5 2 2 4 8 50 50 50 50 100 100 50 750 1 1 1 28

DR. K. N. MODI UNIVERSITY

Study and Evolution Scheme MCA (Master of Computer Application) Effective from session 2011-12 MCA III Semester Year-II Semester-III
S. NO. Sub Code Subject Name Period Evaluation Scheme Continuous Final Total Assessment Exam P 0 40 60 100 5 Credit

L 1 02MC301 Internet and Core JAVA Data Base management system Operating System Design and Analysis of Algorithm Management Information System 4

T 1

02MC302

40

60

100

3 4

02MC303 02MC304

4 4

1 1

0 0

40 40

60 60

100 100

5 5

5 LAB 1 2 3

02MC305

40

60

100

02MP301 02MP302 02MP3011

JAVA LAB DBMS LAB Co-Curricular Activities TOTAL

0 0 0 20

0 0 0 5

2 2 4 8

50 50

50 50

100 100 50 750

1 1 1 28

DR. K. N. MODI UNIVERSITY

Study and Evolution Scheme MCA (Master of Computer Application) Effective from session 2011-12 MCA IV Semester Year-II Semester-IV
S. NO. Sub Code Subject Name Period Evaluation Scheme Continuous Final Total Assessment Exam P 0 0 0 0 0 40 40 40 40 40 60 60 60 60 60 100 100 100 100 100 5 5 5 5 5 Credit

L 1 2 3 4 5 02MC405 02MC401 02MC402 02MC403 02MC404 Advance JAVA Data Structure Using C Computer Network Software Engineering Cryptography & Network Security 4 4 4 4 4

T 1 1 1 1 1

1 2

02MP401 02MP402 02MP4011

JAVA Lab DS Lab Co-Curricular Activities TOTAL

0 0 0 20

0 0 0 5

2 2 4 8

50 50

50 50

100 100 50 750

1 1 1 28

DR. K. N. MODI UNIVERSITY

Study and Evolution Scheme MCA (Master of Computer Application) Effective from session 2011-12 MCA V Semester Year-III Semester-V
S. NO. Sub Code Subject Name Period Evaluation Scheme Continuous Final Total Assessment Exam P 0 0 0 0 0 40 40 40 40 40 60 60 60 60 60 100 100 100 100 100 5 5 5 5 5 Credit

L 1 2 3 4 5 LAB 1 2 03MP501 03MP502 03MP5011 Web Technology Lab . NET Lab Co-Curricular Activities TOTAL 0 0 0 20 03MC501 03MC502 03MC503 03MC504 03MC505 Web Technology . NET Framework Artificial Intelligence Mobile Computing Modeling & Simulation 4 4 4 4 4

T 1 1 1 1 1

0 0 0 5

2 2 4 8

50 50

50 50

100 100 50 750

1 1 1 28

DR. K. N. MODI UNIVERSITY

Study and Evolution Scheme MCA (Master of Computer Application) Effective from session 2011-12 MCAVI Semester Year-III Semester-VI
S. NO. Sub Code Subject Name Period Evaluation Scheme Continuous Final Total Assessment Exam P 10 10 4 24 100 200 100 300 200 500 50 750 3 5 1 9 Credit

L 1 2 03MC601 03MC602 03MP6011

Seminar Project

T 0 0 0 0

0 0 0 0

Co-Curricular Activities
TOTAL

PROFESSIONAL COMMUNICATION 01 MC 101 Course Objective: The aim of the course is to provide high level professional communication skills to the students. It will help the students to increase the ability to work within and across diverse and converging media environments. UNIT - I Introduction: Role of Communication, defining and classifying communication, purpose of communication, process of communication, importance of communication in management, communication structure in organization, barriers & gateway in communication, 7 Cs of communication. UNIT- II Oral Communication: What is oral communication, principles of successful oral communication, two sides of effective oral communication, effective listening, non-verbal communication, Body language and Paralanguage? UNIT - III Written Communication; purpose of writing, clarity in writing, principles of effective writing, electronic writing process; Introduction to business letter, Layout of business letter, writing memos, what is report purpose, kinds & objectives of reports, writing reports. UNIT- IV Understanding the case method of learning, different types of cases, overcoming the difficulties of the case method, case analysis; What is a Presentation: elements of presentation, designing a presentation, advanced visual support for business presentation, types of visual aid, practicing delivery of presentation. UNIT -V Group Communication: meetings, notice, planning meetings, objectives, participants, timing, venue of meeting, leading meetings, minutes of meeting, Media Management, conference, interviews, seminars, workshop, business etiquettes.

Reference Books:

1. 2. 3. 4.

Kaul : Effective Business Communication Rajendra pal Business Communication ( Sultanchand & sons publication). P.D. Chaturvedi Business Communication (Pearson education, ) Sharma R.C.,Mohan Krishna Business : Correspondance and Report Writing (Tata McGraw Hill)

FINANCIAL ACCOUNTING 01 MC102 Course Objective: A business or an organization needs a tool to communicate its results and position to stakeholders, a tool that is commonly understood by all. For that purpose, accounting serves as the language of business. Stakeholders, in return, use this information make sound decisions. Bearing these in mind, this course aims to convey sufficient knowledge for an adequate interpretation, analysis and use the information provided by financial accounting. UNIT -1 Overview: Accounting concepts, conventions and principles; Accounting Equation, International Accounting principles and standards; Matching of Indian Accounting Standards with International Accounting Standards UNIT -2 Mechanics of Accounting: Double entry system of accounting, journalizing of transactions; preparation of final accounts, Profit & Loss Account, Profit & Loss Appropriation account and Balance Sheet, Policies related with depreciation, inventory and intangible assets like copyright, trademark, patents and goodwill UNIT-3 Analysis of financial statement: Ratio Analysis- solvency ratios, profitability ratios, activity ratios, liquidity ratios, market capitalization ratios ; Common Size Statement ; Comparative Balance Sheet and Trend Analysis of manufacturing, service & banking organizations

UNIT-4 Funds Flow Statement: Meaning, , Preparation of Funds Flow Statement and its analysis ; Cash Flow Statement: Various cash and non-cash transactions, flow of cash, preparation of Cash Flow Statement and its analysis. UNIT-5 WORKING CAPITAL : Concept ,NATURE ,SCOPE of Gross and Net Working Capital, TEMPORARY WORKING CAPITAL AND PERMANENT WORKING CAPITAL Preparation of Schedule of Changes in Working Capital. Reference Books 1) Narayanswami - Financial Accounting: A Managerial Perspective (PHI, 2nd Edition). 2) Mukherjee - Financial Accounting for Management (TMH, 1st Edition). 3) Ramchandran & Kakani - Financial Accounting for Management (TMH, 2nd Edition). 4) Ghosh T P - Accounting and Finance for Managers (Taxman, 1st Edition). 5) Maheshwari S.N & Maheshwari S K An Introduction to Accountancy (Vikas, 9th Edition) 6) Ashish K. Bhattacharya- Essentials of Financial Accounting (PHI, New Delhi) 7) Ghosh T.P- Financial Accounting for Managers (Taxman, 3rdEdition) 8) Maheshwari S.N & Maheshwari S K A text book of Accounting for Management (Vikas,1st Edition) 9) Gupta Ambrish - Financial Accounting for Management (Pearson Education, 2ndEdition) 10) Chowdhary Anil - Fundamentals of Accounting and Financial Analysis (Pearson Education,1st Edition)

COMPUTER CONCEPTS AND PROGRAMMING IN C 01MC103 Course objective: This course is intended to provide experienced programmers with an understanding of the basic elements of the C programming language. It will help students to learn the fundamentals behind how to design, write, test and document computer programs written in the C programming language. UNIT 1 Computer Fundamentals: Functional units of Computer: I/O devices, Primary and secondary memories, Number System: Decimal, Binary, Octal, and hexadecimal, Fixed and floating Points, Character Representations, ASCII, EBSDIC.

UNIT 2 Programming Fundamentals: Algorithm development, Techniques of Problem solving, Flowcharting, Stepwise Refinement, Algorithm for Searching (Sequential), Exchange and Insertion, Algorithm Sorting. UNIT 3 Basic of C Programming: Introduction of C language, Representation of Integer, Character, real, Data Types: Constants and Variables, Operators, Arithmetic Expression, Logical expression, Assignment statement, Structure of a C program, Header files, Directives. UNIT 4 Programming in C: Decision control Structure, Alteration and Iterations (While, do while, For loop, switch case), Arrays, String processing, Functions, Recursion. UNIT 5 Advance Concept in C: Pointers, Structure, Union, Files, Top down design, Program correctness, Debugging and testing of Programs. Reference Books: 1) 2) 3) 4) Let us C by Yaswant Knatkar. Exploring in C by Yashwant Kanatkar. Introduction to computer by Alexis Leon, Leon press, Channai. Computer fundamentals And C programming by E. Balagurusamy, The MsGraw-Hill publishing company Ltd

DISCRETE MATHEMATICS 01MC104 Course objective: The main objectives of this course are to train the students to read and write mathematical proofs; to develop the students' mathematical problem solving skills; and to familiarize the students with standard concepts in discrete mathematics. UNIT- 1 Set Theory, Relation, Function :Definition of sets, Countable and uncountable sets, Venn Diagrams, Proof of some general ,identities on sets, Definition of relation, Types of relation, Composition of relations, Equivalence relation, Partial ordering relation, Definition of function, Types of function, One to one, into and onto function, Inverse function, Composition of functions, Recursively defined function. UNIT -2 Algebraic Structure: Definition , Properties, Types, Semigroups, Monoid, Groups, Abelian groups, Properties of groups, Subgroup, Cyclic group, Coset, Factor group, Permutation group, Normal subgroup, Homomorphism, isomorphism of groups, Example and standard result, Rings and field(definition and standard results) UNIT -3 Posset, Hasse Diagram and Lattices, Boolean Algebra :Introduction, Ordered set, Hasse diagram of partially ordered set, Isomorphic ordered set, Well ordered set, Properties of lattices, Complemented lattices, Basic Definition of Boolean algebra, Sum of products and product of sums, Form in Boolean algebra, Logic gates , Karnaugh maps, Directed graphs, Fundamental circuits in Diagraphs, Adjancey matrices of a diagraph. UNIT -4 Propostion Logic: Proposition , First order logic, Basic logical operation, Truth tables, Tautologies, Contradictions, Algebra of proposition, Logic implementations, Logical equivalence, Predicates, Universal and existential quantifiers UNIT- 5 Graph and tree: Simple graph , Multigraph, Graph terminology, Representation of graphs, Bipartite, Regular, Planner and connected graph, Connected components in graphs, Euler graphs, Hamiltonian path and circuits, Graph coloring, Chromatic number, Isomorphism and

homomorphism of graphs, Definition of tree, Rooted tree, Properties of trees, Binary search tree, Tree traversal, Cut sets , cut vertices, Incidence Matrix. Reference Books: 1. Discrete Mathematics and its Applications, By Kenneth H Rosen, McGraw Hill, Sept2002. 2. Discrete Mathematical Structures with Applications to Computer Science, By J.P.Tremblay, R.Manohar, McGraw Hill Pub, 1975. 3. Graph Theory with Applications to Engineering and Computer Science, By Prentice Hall, Englewood Cliffs, N.J, 1974

ORGANIZATION BEHAVIOUR 01 MC 105 Course objective: The aim of this course is to provide you with a fundamental understanding of theories of organizational behavior and the principles of business management. This course will take a functional approach to the study of business management, and will integrate organizational behaviour theories with an understanding of managerial practices. UNIT- I Concept, Nature, Characteristics, Importance and Models of Organization. Span of Management, System and process of controlling, A paradigm Shift, Departmentation. Organizational Behaviour: Cognitive Framework, Behaviouristic Framework and Social Cognitive Framework. UNIT -2 Perception: Concept, Process, Nature, Importance, Management and Behavioural Applications. Personality: Concept, Process, Types, Nature, Theories, Importance, Personality Attitude and Job Satisfaction. Attitude: Concept, Process, Importance, Attitude Measurement. UNIT - 3 Learning process, Models of learning. Role of Rewards and Punishment, Problems solve and decision making, Organization Learning. Conflict: Concept, Sources, Types, Classification of Conflict Intra individual, Interpersonal, Intergroup and Organizational. UNIT -4 Individual & Group Motivation: Hierarchy of needs theory, Theory X and theory Y , Motivation hygiene theory, ERG theory, McClellands theory, Equity theory.

Organisational Power and Authority:Concepts, Sources of Power, Distinction Between Power and Authority UNIT -5 Group Dynamics: Stages of Group Development, Group Cohesiveness, Formal and Informal Groups, Group processes and Decision Making, Reasons for Group Formation, Dysfunctional Groups. Leadership: Concepts, Function and Theories of leadership-Trait, Behavioural and situational Theories. Grievance and Process of Grievance Handling. Reference Books: 1. Udai Pareek: Organizational Behavior processes 2. Udai Pareek: Making Organizational roles effective 3. Fred luthans: Organizational Behavior 4. Stephan P.Robbins: Organizational Behavior

OBJECT ORIENTED PROGRAMMING USING C++ 01MC201 Course Objective: Object-oriented programming (OOP) is a Programming Paradigm that uses objects data structures consisting of data fields and methods together with their interactions to design applications and computer programs. UNIT- I Object Modeling: Objects and classes, links and association, generalization, aggregation. Dynamic Modeling: Events and states, operations, advanced dynamic modeling concepts, a sample dynamic model. Functional Modeling: Data flow diagram, specifying operations, a sample functional model.OMT (object modeling techniques) methodologies, SA/SD, JSD. UNIT- II Introduction to OOP: Procedural Programming, Object oriented Programming Paradigm, Basic concept of object oriented programming: Object, class, data abstraction and encapsulation, Inheritance, Polymorphism, dynamic binding, message passing, application of OOP. UNIT- III Tour of C++: Application of C++, A simple C++ program, structure of C++ program. Basic Facilities: Data Types, new operators and keywords, Type conversions in C++, Classes and

Objects, Defining data members and member functions, Static class members, Array of objects, Constructors and Destructors UNIT- IV Inheritance: Introduction, Base class and derived class, Types of Inheritance: single, multilevel, multiple, hierarchical, hybrid, Virtual base class, Abstract class, this pointer, Virtual functions and pure virtual functions. Polymorphism: Run time, Compile time, Early binding, Late binding, Functions: Call by reference, Function overloading, Inline Functions, Friend Functions,

UNIT -V Operator Overloading, Overloading unary and binary operators, overloading using friend functions. Exception handling: Error Handling, Exception Specification (i.e. Usage of Try, Catch, Throw), Files: File Operations, Templates: Defining templates, Function templates. Reference Books: 1. 2. 3. 4. 5. James Rumbaugh, Object Oriented Modeling and Design, PHI Herbert Schieldt, The Complete Reference: Java, TMH. E. Balaguruswamy, Programming in JAVA, TMH. Thinking in C++ - Bruce Eckel Rajesh K. Shukla Object Oriented Programming in C++.

COMPUTER BASED NUMERICAL AND STATISTICAL TECHNIQUES 01MC202 Course Objective: The objective of this course is to present the foundation of basic mathematical operations that can be executed through the program and codes on computers. UNIT -I Floating point Arithmetic: Representation of floating point numbers, Operations, Normalization, Pitfalls of floating point representation, Errors in numerical computation Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using Bisection Method, Iteration Method, Regula-Falsi method, Newton Raphson method, Secant method, Rate of convergence of iterative methods. UNIT -II

Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss Elimination direct method and pivoting, Ill Conditioned system of equations, Refinement of solution. Gauss Seidal iterative method, Rate of Convergence Interpolation and approximation: Finite Differences, Difference tables, Polynomial Interpolation Newtons forward and backward formula UNIT -III Central Difference Formulae: Gauss forward and backward formula, Stirlings, Bessels, Everetts formula. Interpolation with unequal intervals: Langranges Interpolation, Newton Divided difference formula, Hermits Interpolation, Approximation of function by Taylors series and Chebyshev polynomial UNIT -IV Numerical Differentiation and Integration: Introduction, Numerical Differentiation, Numerical Integration, Trapezoidal rule, Simpsons rules, Booles Rule, Weddles Rule EulerMaclaurin Formula Solution of differential equations: Picards Method, Eulers Method, Taylors Method, RungeKutta methods, Predictor-corrector method, Automatic error monitoring, stability of solution. UNIT- V Curve fitting, Cubic Spline and Approximation: Method of least squares, fitting of straight lines, polynomials, exponential curves etc Frequency Chart: Different frequency chart like Histogram, Frequency curve, Pi-chart. Regression analysis: Linear and Non-linear regression, multiple regressions. Reference Books: 1. Rajaraman V., Computer Oriented Numerical Methods, PHI 2. Grewal B. S., Numerical methods in Engineering and Science, Khanna Publishers, Delhi 3. T. Veerarajan, T Ramachandran, Theory and Problems in Numerical Methods, TMH 4. Pradip Niyogi, Numerical Analysis and Algorithms, TMH 5. Francis Scheld, Numerical Analysis, TMH 6. Computer Based Numerical & Statistical Techniques By Manish Goyal COMPUTER ORGANIZATION 01MC203 Course Objective: This course deals with computer organization and design. It is concerned with the structure and behavior of the various functional modules of the computer and how they interact to provide the processing needs of the user. It is concerned with the way the hardware components are connected together to form a computer system.

UNIT- I Introduction: Number representation; fixed and floating point number representation, IEEE standard for floating point representation. Error detection and correction codes: Hamming code. Digital computer generation, computer types and classifications, functional units and their interconnections, buses, bus architecture, types of buses and bus arbitration. Register, bus and memory transfer. UNIT- II Central Processing Unit : Addition and subtraction of signed numbers, look ahead carry adders. Multiplication: Signed operand multiplication, Division and logic operations. Floating point arithmetic operation. Processor organization, general registers organization, stack organization and addressing modes. UNIT- III Control Unit: Instruction types, formats, instruction cycles and sub cycles (fetch and execute etc) , micro-operations, execution of a complete instruction. Hardwire and micro programmed control: microprogramme sequencing, wide branch addressing, and microinstruction with next address field, pre-fetching microinstructions. UNIT-IV Memory: Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 1/2D memory organization, Main memories: RAM and ROM memories. Cache memories: concept and design issues, performance, address mapping and replacement. Auxiliary memories: magnetic disk, magnetic tape and optical disks Virtual memory: concept implementation. UNIT-V Input / Output: Peripheral devices, I/O interface, I/O ports, Interrupts: interrupt hardware, types of interrupts and exceptions. Modes of Data Transfer: Programmed I/O, interrupt initiated I/O and Direct Memory Access., I/O channels and processors. Serial Communication: Synchronous & asynchronous communication, standard communication interfaces. Reference Books: 1. Computer System Architecture, M. Mano(PHI) 2. William Stalling, Computer Organization, PHI 3. Vravice,Hamacher & Zaky, Computer Organization, TMH 4. John P Hays, Computer Organization, McGraw Hill 5. Nirmala Sharma Computer Organization

HUMAN VALUES & PROFESSIONAL ETHICS 01MC204 Course Objective: This course aims at helping students to think about some of the important ethical implications of the day-to-day happenings and practices of Indian industry and business. It is designed to stimulate discussion and debate rather than to formulate principles, and to raise further questions rather than to dictate answers. The following objectives are underlined: To improve ethical reasoning by correlating moral concepts to business practices - clarification of the values that determine managerial behaviour. To understand Indian Ethos & Values is an important feature of this paper. UNIT-I Business Ethics: Nature, scope and purpose of ethics; Relevance of values; Importance of Ethics & moral standards; Ethics & Moral Decision Making. Values impact in Business: Indian Value System and Values, Teaching from scriptures and tradition (Geeta , Mahabharata) UNIT- II Corporate Social Responsibility: Nature, scope & Importance; Corporate Governance: Concept, Importance for Industry; Ethical Issues related with Advertisements, Finance, Investment, Technology; Spiritual Values in Management; Work ethics: concept of Swadhrama. UNIT -III Gandhian approach in Management & Trusteeship: Gandhijis doctrine of Satya & Ahinsa, Concept, importance & relevance of Trusteeship principle in modern business. UNIT- IV Need, purpose & relevance of Indian Ethos; Salient features; MBA model: Manas, Buddhi, Ahunmkar Holistic and Spiritual, Brainstorming Relevance of Bhagvad Gita: Doctrine of Karma i..e Nishkama Karmayoga, Guna Theory (SRT i.e. Sat, Raj & Tam Model), Theory of Sanskaras, Bhagvad Gita & Self Management. UNIT- V Corporate Strategy: Global industrial competition, Information Technology, Competitive Strategy, Benchmarking, Total Quality Management, Brand Building, Promotional Strategies,

Corporate Restructuring, Corporate Governance System Worldwide, Corporate Disclosure and Investor Protection in India. Reference Books: 1. 2. 3. 4. Western doors and eastern windows- Subhash Sharma Corporate corridor- Subhash Sharma Human Values for managers- S K Chakarborty by Wheeler Publishing House. Management Concepts in Ancient Indian Psycho-Philosophic thoughts and their significance from present day organization- Wisdom, Banasthali Vidhyapith. 5. A History of Indian Economics Thoughts- Routlege, London.

ENVIRONMENT & ECOLOGY 01MC205 Course Objective: This course provides an introduction to the science of ecology and the physical and biological processes that affect our environment. Main objective of the course is for student to learn about the conceptual framework of ecology. UNIT -I Definition, Scope & Importance, Need For Public Awareness- Environment definition, Eco system Balanced ecosystem, Human activities Food, Shelter, Economic and social Security. Effects of human activities on environment-Agriculture, Housing, Industry, Mining and Transportation activities, UNIT-II Basics of Environmental Impact Assessment. Sustainable Development. Natural ResourcesWater Resources- Availability and Quality aspects. Water borne diseases, Water induced diseases, Fluoride problem in drinking water. UNIT-III Mineral Resources, Forest Wealth, Material cycles- Carbon, Nitrogen and Sulphur Cycles. Energy Different types of energy, Electro-magnetic radiation. Conventional and NonConventional sources Hydro Electric, Fossil Fuel based, Nuclear, Solar, Biomass and Bio-gas. Hydrogen as an alternative future source of Energy. UNIT-IV Environmental Pollution and their effects. Water pollution, Land pollution. Noise pollution, Public Health aspects, Air Pollution, Solid waste management. Current Environmental Issues of Importance : Population Growth, Climate Change and Global warming- Effects, Urbanization, Automobile pollution. Acid Rain, Ozone Layer depletion, Animal Husbandry.

UNIT-V Environmental Protection- Role of Government, Legal aspects, Initiatives by Non-governmental Organizations (NGO), Environmental Education, Women Education. Reference Books: Environmental Studies Benny Joseph Tata McgrawHill-2005 Environmental Studies Dr. D.L. Manjunath, Pearson Education-2006. Environmental studies R. Rajagopalan Oxford Publication - 2005. Text book of Environmental Science & Technology M. Anji Reddy BS Publication. Principles of Environmental Science and Engineering P. Venugoplan Rao, Prentice Hall of India. 6. Environmental Science and Engineering Meenakshi, Prentice Hall India. 1. 2. 3. 4. 5. C++ LAB 01MP201 Contents 1. Implementation of Class and object. 2. Implementation of Constructor and Destructor. 3. Implementation of Inheritance. 4. Implementation of Abstract class. 5. Implementation of functions. 6. Implementation of friend function. 7. Implementation of virtual function. 8. Implementation of polymorphism. 9. Implementation of operator overloading. 10. Implementation of function overloading. 11. Implementation of overriding. 12. Exception handling. 13. Implementation of template.

COMPUTER BASED NUMERICAL AND STATISTICAL TECHNIQUES LAB 01MP202 Contents: 1. Write a program to implement algebraic and transcendental equations using Bisection method. 2. Write a program to implement algebraic and transcendental equations using Newton Raphson method. 3. Write a program to implement algebraic and transcendental equations using method of false position. 4. Write a program to implement iteration method. 5. Write a program to implement algebraic and transcendental equations using Secant method. 6. Write a program to implement numerical differentiation. 7. Write a program to implement numerical integration using Simpson's 1/3 rule. 8. Write a program to implement numerical integration using Simpson's 3/8 rule. 9. Write a program to implement numerical integration using trapezoidal rule. 10. Write a program to implement Lagranges method.

Internet and Core JAVA 02MC301 Course Objective: Java is a powerful object-oriented programming language with simple code structure. You can create applications and applets with graphics and user interfaces because Java has built-in application programming interface (API) and due to its rich set of interfaces java has a platform in itself. Java provides errorless programming with platform independent feature. Java developers tried to write the code structure similar to the syntax of C++ so it would be easy for C++ programmers to learn java. In comparison to C++, Java handles many operations like creation and deletion of memory automatically; it helps to make bug-free code in Java application. Unit I

Internet: Internet, connecting to Internet: Telephone, Cables, Satellite Connection, ISP, Introduction to Internet Services, E-Mail concepts, File transfer protocol, World Wide Web, Browsers, uses of Internet. Unit II Introduction to JAVA, Characteristics of JAVA, Data types , Variables, Operators, Control statement, Object oriented concepts: Classes, Objects, Encapsulation, Polymorphism etc, Constructor. Unit III Inheritance, Types of Inheritance (Single, Multilevel, Hybrid etc), Interface, Package, Access modifier, Array, Garbage Collection, Exceptional handling: Try, Catch, Throw, Throws, Finally, Custom Exception, String handling, string handling function, String buffer class. Unit IV JAVA utilities like java.lang, java.util and their uses. Introduction to AWT, AWT components, AWT classes, Events, events handling, Event listener, Adapter Class , Java Applets and their uses, Threads, Life cycle of a thread, Synchronization and deadlocks, Input/ Output, Networking. Unit V Java swings: Introduction to layout management, Layouts, Frame, Text inputs, Text fields, Labels Text area, Tabbed Pane, Scroll pane, Choice components, Check box, Radio buttons, Combo box, Menus and Tool bars, List etc.

References Books: 1) Gary Cornell, Core Java: Volume I, By sun Microsystems, Pearson 2) Margaret Levine Young , The complete reference , THM. 3) Naughton, Schildt, The complete reference JAVA 2, TMH 4) Balagurusamy E, Programming in Java, TMH. 5) Mark Wutica, Java Enterprise Edition, QUE

Data Base management system 02MC302 Course Objective: A Database Management System (DBMS) is a plant of computer programs that assures the beginning. The objective of this syllabus is to provide broad introduction to the concepts of database system and relational systems in particulars. It also introduce the standard database language SQL Structured Query Language and the description of relational model which are fundamental of relational system and we also concerned with transaction management system Unit I Introduction: An overview of database management system, Database System Vs File System, Database system concepts and architecture, data models schema and instances, data independence and data base language and interfaces, Data definitions language, DML. Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization, aggregation. Unit- II Relational data Model and Language: Relational data model concepts, integrity constraints: entity integrity, Keys constraints, Domain constraints, Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data types and literals, Types of SQL commands, SQL operators and their procedure, Tables, views and indexes, Queries and sub queries, Aggregate functions, Insert, update and delete operations, Joins, Unions, Intersection, Minus, Cursors in SQL, Triggers Unit- III Data Base Design & Normalization: Functional dependencies, normal forms, first, second, third normal forms, BCNF, inclusion dependencies, loss less join decompositions, normalization using FD, MVD, and JDs Unit- IV Transaction Processing Concepts: Transaction system, Testing of serializability, Serializability of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures, log based recovery, checkpoints, deadlock handling. Unit- V Concurrency Control Techniques: Concurrency control, locking Techniques for concurrency control, Time stamping protocols for concurrency control, validation based protocol, Recovery with concurrent transaction.Transaction processing in Distributed system, data fragmentation. Replication and allocation techniques for distributed system References Books: 1 Date C J, "An Introduction To Database System", Addision Wesley 2 Korth, Silbertz, Sudarshan, "Database Concepts", McGraw Hill

3 Elmasri, Navathe, "Fundamentals Of Database Systems", A. Wesley 4 Paul Beynon Davies, "Database Systems", Palgrave Macmillan 5 Bipin C. Desai, "An introduction to Database Systems", Galgotia Publication

Operating System 02MC303 Course Objective: The objective of this course is to provide overview of computer system and operating system.The concept of process management, memory management, storage management and protection and security issues. Unit-I Introduction: Definition and types of operating systems, Batch Systems, multi programming, time-sharing, distributed and real-time systems, Operating system structure, Operating system components and services, System calls, system programs, Virtual machines. Unit-II Process Management: Process concept, Process scheduling, Threads, Interprocess communication, CPU scheduling criteria, Scheduling algorithms (First come first serve, Shortest job first, Priority, Round robin etc), Multiple-processor scheduling. Unit-III Process Synchronization and Deadlocks: The Critical-Section problem, synchronization hardware, Semaphores, Critical regions, Monitors, Deadlocks-System model, Characterization, Deadlock prevention, Avoidance and Detection, Recovery from deadlock, Combined approach to deadlock handling. Unit-IV Memory Management: Memory Management-Logical and Physical Address Space, swapping, Contiguous Allocation, Paging, Segmentation with paging, Demand paging and its performance, Page replacement. Unit-V Storage management: File systems, secondary Storage Structure, File concept, access methods, directory structure, Efficiency and performance, recovery, Disk structure, Disk scheduling, Disk management. Security & Case Study: Protection and Security-Goals of protection, Domain of protection, The Security problem, Program threats, System and network threats, Authentication. References Books: 1) Abraham Siberschatz and Peter Baer Galvin, "Operating System Concepts", Fifth Edition, Addision-Wesley 2) Milan Milankovic, "Operating Systems, Concepts and Design", McGraw-Hill. 3)_Harvey M Deital, "Operating Systems", Addison Wesley 4) Richard Peterson, "Linux: The Complete Reference", Osborne McGraw-Hill.

Design and Analysis of Algorithm 02MC304 Course Objective: The objective of this syllabus is to provide an overview of algorithms and their complexity and their place in modern computing system .The algorithms are described in pseudo codes which are not any conventional programming language. Unit-I Introduction: Algorithms, Analysis of Algorithms, Design of Algorithms, Complexity of Algorithms, Asymptotic Notations, Growth of function, Recurrences and their solution. Unit-II Sorting in polynomial Time: Insertion sort, Merge sort, Heap sort, and Quick sort Sorting in Linear Time: Counting sort, Radix Sort, Bucket Sort Elementary Data structures: Stacks and Queues, priority queues, Trees, set and disjoint set. Unit-III Advanced Design and Analysis Techniques: Dynamic programming, Greedy algorithms: General method, knapsack problem, Backtracking, Branch-andBound, and amortized Analysis Unit-IV Graph Algorithms: Elementary Graph Algorithms, Breadth First Search, Depth First Search, Minimum Spanning Tree, Kruskal's Algorithms, Prim's Algorithms, and Single Source Shortest Path, All pair Shortest Path, Maximum flow and Traveling Salesman Problem. Unit-V String matching, approximation algorithms, travelling salesman problem, Matrix operations, Number Theoretic Algorithms. Reference Books: 1) Fundamentals of Computer Algorithms by Horowitz and Sahani, Galgotia 2) Introduction to Algorithms by Thomas H Cormen Leiserson et al, PHI 3) Design and Analysis of Computer Algorithms, Aho, Pearson Education Pub 4) Algorithm Design by Jon Kleinberg and Eva Tardos, Pearson Education 5) Fundamental of Algorithms by Brassard Bratley, PHI 6) Algorithms Design by M T Goodrich et al, John Wiley

Management Information System 02MC305 Course Objective: The objective of this syllabus is to familiar students with information system used in management and to explore MIS subsystems and technologies including software and networking, however the coursework focuses on technology management not on engineering. The course emphasizes management skills such as planning, Control, ERP, CRM, project management, quality and efficiency management in IS projects. Unit I Foundation of Information Systems: Introduction to information system in business, fundamentals of information systems, solving business problems with information systems, Types of information systems, Effectiveness and efficiency criteria in information system. Unit II An overview of Management Information Systems: Definition of a management information system, MIS versus Data processing, MIS & Decision Support Systems, MIS & Information Resources Management, End user computing, Concept of an MIS, Structure of a Management information system. Unit III Concepts of planning & control: Concept of organizational planning, The Planning Process, Computational support for planning, Characteristics of control process, The nature of control in an organization. Unit IV Business applications of information technology: Internet & electronic commerce, Intranet, Extranet & Enterprise Solutions, Information System for Business Operations, Information System for Managerial Decision Support, Information System for Strategic Advantage. Unit V Managing Information Technology:Enterprise & global management, Security & Ethical challenges, Planning and implementing changes. Advanced Concepts in Information Systems: Enterprise Resource Planning, Supply Chain Management, Customer Relationship Management, and Procurement Management. Reference Books: 1. 2. 3. 4. 5. O Brian, "Introduction to Information System", MCGRAW HILL. Gordon B. Davis & Margrethe H. Olson, "Management Information System", TMH Murdick, "Information System for Modern Management", PHI. Jawadekar, Management Information System", TMH. Jain Sarika, "Information System", PPM

ADVANCE JAVA 02MC401 Course Objective: This course is designed for students already familiar with Java language and Object Oriented Programming techniques. It covers a large number of advanced topics including software development methodologies using Java tools and APIs, Java core technologies, Java Framework, Java GUIs, Network programming in Java, Java Web technologies, Java Database Connectivity (JDBC), and Java and XML. The main focus of the course is Advanced Java Technologies and Architecture. Students will learn to use Java technologies in the real world and write numerous, nontrivial programs throughout the semester to demonstrate mastery of the concepts discussed in the classroom. Unit 1: Introduction Java & internet, Java applets and its applications, java awt : java AWT packageContainers (Component,Container,Panel,Window, Frame, Canvas), Basic User Interfacec omponents (Labels, Buttons, Check Boxes, Radio Buttons, Choice, Text Fields, Text Areas, Scrollbars), Layouts (Flow Layout, Grid Layout, Border Layout, Card Layout). Unit 2 : event handling: EventdelegationApproach, ActionListener, AdjustmentListener, MouseListener a nd MouseMotion Listener,WindowListener, KeyL istener,Java utilities like java.lang, java.util and their uses, java.io, basics of networking using Java. Java applets and their use Event Handling AWT and working with Windows Event Handling Event Handling Mechanisms, Delegation Event Model, Event Class, Event Listener Interfaces, Adapter Classes, Inner Class. AWT and working with windows AWT Unit 3: Customizers Servlets - Life cycle of servlet, use of tomcat for servlet, servlet API, Javax. Servlet package, servlet parameters, Javax.Servlet.http package, Handling HTTP requests and Responses, Cookies. Unit 4: JDBC JDBC Fundamentals, Establishing Connectivity and working with connection interface, Working with statements, Creating and Executing SQL statements, Working with Result Set Object & Result Set Meta Data JDBC API, JDBC Drivers, Products, JDBC Design considerations Basic steps to JDBC, setting up a connection to database, Creating and executing SQL statements, Result set and Result set Meta Data Object. Unit 5: JSP: Advantage of JSP technology (Comparison with ASP / Servlet), JSP Architecture, JSP Access Model, JSP Syntax Basic (Directions, Declarations, Expression, Scriplets,

Comments),JSP Implicit Object, Object Scope, Synchronization Issue, Exception Handling, Session Management Java Beans BDK, JAR files, Introspection, Developing simple bean using BDK, Bound Properties, BeanInfo, Interface, Constrained properties, Persistance, Reference Books: 1) Fundamentals of Computer Algorithms by Horowitz and Sahani, Galgotia 2) Introduction to Algorithms by Thomas H Cormen Leiserson et al, PHI 3) Design and Analysis of Computer Algorithms, Aho, Pearson Education Pub 4) Algorithm Design by Jon Kleinberg and Eva Tardos, Pearson Education 5) Fundamental of Algorithms by Brassard Bratley, PHI 6) Algorithms Design by M T Goodrich et al, John Wiley

DATA STRUCTURE USING C 02MC402 Course Objective: This course couples work on program design, analysis with an introduction to the study of data structures. Data structures capture common ways to store and manipulate data, and they are important in the construction of sophisticated computer programs. Students will be expected to write C programs, ranging from very short programs to more elaborate systems. Since one of the goals of this course is to teach you how to write large, reliable programs. Emphasize will be given on development of clear, modular programs that are easy to read, debug, verify, analyze, and modify. UNIT -I Introduction: Basic Terminology, Elementary Data Organization, Data Structure operations, Algorithm Complexity and Time-Space trade-off Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, address calculation, application of arrays, Character String in C, Character string operation, Array as Parameters, Ordered List, Sparse Matrices, and Vectors. Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop, Array Representation of Stack, Linked Representation of Stack, Operations Associated with Stacks, Application of stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using stack. UNIT-II

Recursion: Recursive definition and processes, recursion in C, example of recursion, Tower of Hanoi Problem, simulating recursion. Backtracking, recursive algorithms, principles of recursion, tail recursion, removal of recursion. Queues: Array and linked representation and implementation of queues, Operations on Queue: Create, Add, Delete, Full and Empty. Circular queue, Deque, and Priority Queue. UNIT- III Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion Algorithms, Doubly linked list, Linked List in Array, Polynomial representation and addition, Generalized linked list, Garbage Collection and Compaction. Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete Binary Tree. Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees. Traversing Threaded Binary trees, Huffman algorithm. UNIT -IV Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation. 15 Sorting: Insertion Sort, Bubble Sorting, Quick Sort, Merge Sort, Heap Sort. Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of Search Algorithm, Path Length, AVL Trees, B-trees.

UNIT - V Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees. Reference Books: 1. S. Lipschutz, Data Structures Mc-Graw Hill International Editions, 1986. 2. Jean-Paul Tremblay, Paul. G. Soresan, An introduction to data structures with Applications, Tata Mc-Graw Hill International Editions, 2nd edition 1984. 3. A. Michael Berman, Data structures via C++, Oxford University Press, 2002. 4. M. Weiss, Data Structures and Algorithm Analysis in C++, Pearson Education, 2002, 2nd edition. 5. Ellis Horowitz, S. Sahni, D. Mehta Fundamentals of Data Structures in C++, Galgotia Book Source, New Delhi.

COMPUTER NETWORK 02MC403 Course Objective: This course provides students with the skills and knowledge in data communications and networking to set-up, maintain and troubleshoot local area networks (LAN), data communication systems, microcomputers and peripherals including maintaining programs on the World Wide Web. Basic objective is to provide a conceptual foundation for the study of data communications using the open systems interconnect (OSI) model for layered architecture and to develop an understanding in basic hardware and software environments for data communications and computer networks. UNIT I Introductory Concepts: Goals and Applications of Networks, Network structure and architecture, The OSI reference model, services, networks topology, Physical Layer- transmission, switching methods, integrated services digital networks, terminal handling. UNIT II Medium access sub layer: Channel allocations, LAN protocols, ALOHA Protocols- Pure ALOHA, slotted ALOHA, Carrier Sense Multiple Access Protocols, CSMA with Collision Detection, Collision free Protocols, IEEE standards, Ethernet, FDDI, Data Link Layer- basic design issues, error correction & detection algorithms, elementary data link layer protocols, sliding window protocols, error handling, High Level Data Link Control UNIT- III Network Layer: Point-to Point networks, concept of virtual circuit and LAN, routing algorithms, congestion control algorithms, internetworking, TCP/IP protocol, IP addresses, IPv6. UNIT IV Transport Layer: Design issues, connection management, Internet Transport Protocol (UDP), Ethernet transport Protocol, Transmission Control Protocol. (TCP) UNIT V Application Layer: Domain Name System, Simple Network Management Protocol, Electronic mail, File Transfer Protocol, Hyper Text Transfer Protocol, Introduction to Cryptography and Network Security (DES, RSA algorithms), Communication Security (IPSec, Firewalls), Authentication protocols such as authentication based on shared key (Diffie Helleman Key exchanger), Introduction to multimedia and compression Techniques. References Books:

1. Computer Networks by A. S Tanenbaum, 4 , Edition, Pearson education 2. Data and Computer Communication by W. Stallings, Macmillan Press 3. Computer Networks & Internet with Internet Applications by Comer Pearson Education 4. Internetworking with TCP/IP by PHI 5. Data Communication and Networking by Forouzan TMH 6. Computer Networks with Internet Protocols by W Stallings, Pearson Education

th

SOFTWARE ENGINEERING 02MC404 Course Objective: This course is intended to provide the students with an overall view over Software Engineering as an engineering discipline and with insight into the processes of software development. In this course, students will gain a broad understanding of the discipline of software engineering and its application to the development of and management of software systems. UNIT-I Introduction to Software Engineering, Software Components, Software Characteristics, Software Crisis, Software Engineering Processes, Similarity and Differences from Conventional, Engineering Processes, Software Quality Attributes. Software Development Life Cycle (SDLC) Models: Water Fall Model, Prototype Model, Spiral Model, Evolutionary Development Models, Iterative Enhancement Models. UNIT-II Software Requirement Specifications (SRS): Requirement Engineering Process: Elicitation, Analysis, Documentation, Review and Management of User Needs, Feasibility Study, Information Modeling, Data Flow Diagrams, Entity Relationship Diagrams, Decision Tables, SRS Document, IEEE Standards for SRS. Software Quality Assurance (SQA): Verification and Validation, SQA Plans, Software Quality Frameworks, ISO 9000 Models, SEI-CMM Model. UNIT-III Software Design:Basic Concept of Software Design, Architectural Design, Low Level Design: Modularization, Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, Design Strategies: Function Oriented Design, Object Oriented Design, Top-Down and Bottom-Up Design. Software Measurement and Metrics: Various Size Oriented Measures: Halesteads Software Science, Function Point (FP) Based Measures, Cyclomatic Complexity Measures:Control Flow Graphs. UNIT-IV Software Testing: Testing Objectives, Unit Testing, Integration Testing, Acceptance Testing, Regression Testing, Testing for Functionality and Testing for Performance, Top-Down and Bottom-Up Testing Strategies: Test Drivers and Test Stubs, Structural Testing (White Box Testing), Functional Testing (Black Box Testing), Test Data Suit Preparation, Alpha and Beta

Testing of Products. Static Testing Strategies: Formal Technical Reviews (Peer Reviews), Walk Through, Code Inspection, Compliance with Design and Coding Standards. UNIT-V Software Maintenance and Software Project Management: Software as an Evolutionary Entity, Need for Maintenance, Categories of Maintenance: Preventive, Corrective and Perfective Maintenance, Cost of Maintenance, Software Re- Engineering, Reverse Engineering. Software Configuration Management Activities, Change Control Process, Software Version Control, An Overview of CASE Tools. Estimation of Various Parameters such as Cost, Efforts, Schedule/Duration, Constructive Cost Models (COCOMO), Resource Allocation Models, Software Risk Analysis and Management. References Books: 1. R. S. Pressman, Software Engineering: A Practitioners Approach, McGraw Hill. 2. Rajib Mall, Fundamentals of Software Engineering, PHI Publication. 3. K. K. Aggarwal and Yogesh Singh, Software Engineering, New Age International Publishers. 4. Pankaj Jalote, Software Engineering, Wiley 5. Carlo Ghezzi, M. Jarayeri, D. Manodrioli, Fundamentals of Software Engineering, PHI Publication. 6. Ian Sommerville, Software Engineering, Addison Wesley. 7. Kassem Saleh,Software Engineering, Cengage Learning. 8. Pfleeger, Software Engineering, Macmillan Publication. CRYPTOGRAPHY AND NETWORK SECURITY 02MC405 Course Objective: The objective of the course is to groom experts in the field of Information Security for taking up responsibilities such as Security Professional/ Security Analyst/ Network & System Administrator/ Security Auditor/Ethical hackers. UNIT-I Introduction to Cryptography: Introduction To Security: Attacks, Services & Mechanisms, Security, Attacks, And Security Services. Conventional Encryption: Classical Techniques, Conventional Encryption Model, and Steganography, Classical Encryption Techniques. Modern Techniques: Simplified DES, Block Cipher Principles, DES Standard, DES Strength, Differential & Linear Cryptanalysis, Block Cipher Design Principles, Block Cipher Modes of Operation.

UNIT-II Conventional Encryption Algorithms: Triples DES, Blowfish, International Data Encryption Algorithm, RCS, CAST-128, RC2 Placement & Encryption Function, Key Distribution, Random Number Generation, Placement Of Encryption Function.

UNIT-III Public Key Encryption: Public-Key Cryptography: Principles Of Public-Key Cryptosystems, RSA Algorithm, Key Management, Fermats & Eulers Theorm, Primality, The Chinese Remainder Theorem. UNIT-IV Hash Functions: Message Authentication & Hash Functions: Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash Functions, Birthday Attacks, Security Of Hash Function & MACS, MD5 Message Digest Algorithm, Secure Hash Algorithm (SHA), Digital Signatures: Digital Signatures, Authentication Protocol, Digital Signature Standard (DSS), Proof Of Digital Signature Algorithm. UNIT-V Network & System Security: Authentication Applications: Kerberos X.509, Directory Authentication Service, Electronic Mail Security, Pretty Good Privacy (PGP), S / Mime, Security: Architecture, Authentication Header, Encapsulating Security Payloads, Combining Security Associations, Key Management, Web Security: Secure Socket Layer & Transport Layer Security, Secure Electronic Transaction (Set), System Security: Intruders, Viruses, Firewall Design Principles, Trusted Systems. Reference Books: 1. Johannes A. Buchmann, Introduction to cryptography, Springer- Verlag. 2. Atul Kahate, Cryptography and Network Security, TMH 3. William Stallings, Cryptography and Network Security: Principles and Practice, Prentice Hall, New Jersey.

WEB TECHNOLOGY 03MC501 Course Objective: The aim of this subject is to cover current and future web technologies and the design, development and management of web-based systems. It introduce the students to the fundamentals various web development technologies like HTML, XML etc. UNIT I Introduction: Introduction to web, protocols governing the web, web development strategies, Web applications, web project, web team.

UNIT II Web Page Designing: HTML: list, table, images, frames, forms, CSS; XML: DTD, XML schemes, presenting and using XML. UNIT III Scripting: Java script: Introduction, documents, forms, statements, functions, objects; event and event handling; introduction to AJAX, VB Script UNIT IV Server Site Programming: Introduction to active server pages (ASP),ASP.NET, java server pages (JSP), JSP application design, tomcat server, JSP objects, declaring variables, and methods, debugging, sharing data between JSP pages, Session, Application: data base action , development of java beans in JSP, introduction to COM/DCOM. UNIT V PHP (Hypertext Preprocessor): Introduction, syntax, variables, strings, operators, if-else, loop, switch, array, function, form ,mail, file upload, session, error, exception, filter, PHP-ODBC. References Books: 1. Xavier, C, Web Technology and Design , New Age International 2. Ivan Bayross, HTML, DHTML, Java Script, Perl & CGI, BPB Publication. 3. Ramesh Bangia, Internet and Web Design , New Age International 4. Bhave, Programming with Java, Pearson Education 5. Ullman, PHP for the Web: Visual QuickStart Guide, Pearson Education 6. Deitel, Java for programmers, Pearson Education

. NET FRAMEWORK 03MC502 Course Objective: The main objective is of the course is to introduce the students to the fundamentals of C#, .NET Framework, databases and Web application development with ASP.NET and AJAX. Students will learn how to build dynamic data-driven Web applications with SQL Server and ASP.NET. UNIT-I The .Net framework: Introduction, The Origin of .Net Technology, Common Language Runtime (CLR), Common Type System (CTS), Common Language Specification (CLS), Microsoft Intermediate Language (MSIL), Just-In Time Compilation, Framework Base Classes. UNIT-II C -Sharp Language (C#): Introduction, Data Types, Identifiers, Variables, Constants, Literals,Array and Strings, Object and Classes, Inheritance and Polymorphism, Operator Overloading, Interfaces, Delegates and Events. Type conversion. UNIT-III C# Using Libraries: Namespace- System, Input-Output, Multi-Threading, Networking and sockets, Managing Console I/O Operations, Windows Forms, Error Handling. UNIT-IV Advanced Features Using C#: Web Services, Window Services, Asp.net Web Form Controls, ADO.Net. Distributed Application in C#, Unsafe Mode, Graphical Device interface with C#. UNIT-V .Net Assemblies and Attribute: .Net Assemblies features and structure, private and share assemblies, Built-In attribute and custom attribute. Introduction about generic. References Books: 1. Wiley, Beginning Visual C# 2008,Wrox 2. Fergal Grimes, Microsoft .Net for Programmers. (SPI) 3. Balagurusamy, Programming with C#, (TMH) 4. Mark Michaelis, Essential C# 3.0: For .NET Framework 3.5, 2/e, Pearson Education 5. Shibi Parikkar, C# with .Net Frame Work , Firewall Media.

ARTIFICIAL INTELLIGENCE 03MC503 Course Objective: This course examines the concepts, techniques, applications, and theories of Artificial Intelligence. The focus of the course is on the theory and application of artificial intelligence. This course will focus on issues of search, knowledge representation, reasoning, decision making, and learning from the perspective of an intelligent agent. UNIT-I Introduction: Introduction to Artificial Intelligence, Foundations and History of Artificial Intelligence, Applications of Artificial Intelligence, Intelligent Agents, Structure of Intelligent Agents. Computer vision, Natural Language Possessing. UNIT-II Introduction to Search: Searching for solutions, Uniformed search strategies, Informed search strategies, Local search algorithms and optimistic problems, Adversarial Search, Search for games, Alpha - Beta pruning. UNIT-III Knowledge Representation & Reasoning: Propositional logic, Theory of first order logic, Inference in First order logic, Forward & Backward chaining, Resolution, Probabilistic reasoning, Utility theory, Hidden Markov Models (HMM), Bayesian Networks. UNIT-IV Machine Learning: Supervised and unsupervised learning, Decision trees, Statistical learning models, Learning with complete data - Naive Bayes models, Learning with hidden data EM algorithm, Reinforcement learning, UNIT-V Pattern Recognition: Introduction, Design principles of pattern recognition system, Statistical Pattern recognition, Parameter estimation methods - Principle Component Analysis (PCA) and Linear Discriminant Analysis (LDA), Classification Techniques Nearest Neighbor (NN) Rule, Bayes Classifier, Support Vector Machine (SVM), K means clustering. Reference Books: 1. Stuart Russell, Peter Norvig, Artificial Intelligence A Modern Approach, Pearson Education

2. Elaine Rich and Kevin Knight, Artificial Intelligence, McGraw-Hill 3. E Charniak and D McDermott, Introduction to Artificial Intelligence, Pearson Education 4. Dan W. Patterson, Artificial Intelligence and Expert Systems, Prentice Hall of India

MOBILE COMPUTING 03MC504 Course Objective: The aim of this course is to respond to the growing demand for mobile application engineers; the specialist architects, designers and implementers of mobile internet and enterprise, Mobile computing is an IT course that aims to develop graduates with the necessary understanding and skills to build mobile internet and business computing applications using the latest technologies and to provide basics for various techniques in Mobile Communications and Mobile Content services. Unit I Introduction, issues in mobile computing, overview of wireless telephony: cellular concept, GSM: air-interface, channel structure, location management: HLR-VLR, hierarchical, handoffs, channel allocation in cellular systems, CDMA, GPRS. Unit - II Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth, Wireless multiple access protocols, TCP over wireless, Wireless applications, data broadcasting, Mobile IP, WAP: Architecture, protocol stack, application environment, applications. Unit III Data management issues, data replication for mobile computers, adaptive clustering for mobile wireless networks, File system, Disconnected operations. Unit - IV Mobile Agents computing, security and fault tolerance, transaction processing in mobile computing environment.

Unit V Adhoc networks, localization, MAC issues, Routing protocols, global state routing (GSR), Destination sequenced distance vector routing (DSDV), Dynamic source routing (DSR), Ad Hoc on demand distance vector routing (AODV), Temporary ordered routing algorithm (TORA), QoS in Ad Hoc Networks, applications. References Books: 1. J. Schiller, Mobile Communications, Addison Wesley. 2. Charles Perkins, Mobile IP, Addison Wesley. 3. Charles Perkins, Ad hoc Networks, Addison Wesley. 4. Upadhyaya, Mobile Computing, Springer Modeling and Simulation 03MC505 Unit-1 System definition and components, stochastic activities, continuous and discrete systems, system modeling, types of models, static and dynamic physical models, static and dynamic mathematical models, full corporate model, types of system study. Unit-II System simulation, why & when to simulate, nature and techniques of simulation, comparison of simulation and analytical methods, types of system simulation, real time simulation, hybrid simulation, simulation of pure-pursuit problem, single-server queuing system and an inventory problem, Monte-Carlo simulation, Distributed Lag models, Cobweb model. Unit-III Simulation of continuous systems, analog vs. digital Simulation, Simulation of water reservoir system, Simulation of a servo system, simulation of an autopilot, Discrete system simulation, fixed time-step vs. even to even model, generation of random numbers, test for randomness, Monte-Carlo computation vs. stochastic simulation. Unit-IV System dynamics, exponential growth models, exponential decay models, modified exponential growth models, logistic curves, generalization of growth models, system dynamic diagrams Introduction to SIMSCRIPT: Program, system concepts, origination, and statements, defining the telephone system model.

Unit-V Simulation of PERT Networks, critical path computation, uncertainties in activity duration , resource allocation and consideration. Simulation languages and software, continuous and discrete simulation languages, expression based languages, object oriented simulation, general purpose vs. application - oriented simulation packages, CSMP-III, MODSIM-III. References 1. Geoftrey Gordon, System Simulation, PHI 2. Jerry Banks, John S. C Barry L. Nelson David M. Nicol, Discrete Event System Simulation, Pearson Education 3. V P Singh, System Modeling and simulation, New Age International. 4. Averill M. Law, W. David Kelton, System Modeling and simulation and Analysis, TMH 5.Modeling & Simulation-Narsingh Deo..(PHI)

03MCA 601 Seminar Guidelines & General Instruction: The aim of the subject is to develop ability of a student to carry out literature survey & independent study of an advanced subject/topic/matters in the field of Computer Science and Information technology. At the beginning of semester a list of colloquium topic should be displayed on the notice board by the department and/or on the institution web site. Every Student must select a topic of his choice. The student is required to conduct rigorous study/survey on the subject under the supervision of the faculty member of the department, prepare a report and present this in presence of all the students of his class at the end of semester. The comments & criticism of the topic/subject will be discussed for the benefit of all the students. The evaluation will be carried out by the department based on the presentation. 03MCA 602 Project Guidelines & General Instruction: Every student is required to carry out project work under the supervision of a faculty member of the department. However, a student may also opt to pursue his project work in a reputed industry/institution with the consent of Department/Institute. In such cases, the department must look into the suitability of the projects and assign one internal guide/supervisor. The internal supervisor shall monitor progress of the student continuously. A candidate is required to present the progress of the project work (at least twice) during the semester at an appropriate time decided by the Department. There will a final presentation of the project work at the end of the semester.