GGLLLAAA RVUUUNNNIIIVVEEERRSSSIIITTTYYY,,,...

Course Curriculum (w.e.f. Session 2015-16)

Master of Computer Applications (MCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

DDDEEEPPPAAARRRTTTMMMEEENNNTTT OOOFFF CCCOOOMMMPPPUUUTTTEEERRR EEENNNGGGIIINNNEEEEEERRRIIINNNGGG

&&& AAAPPPPPPLLLIIICCCAAATTTIIIOOONNNSSS

(((SSSYYYLLLLLLAAABBBUUUSSS)))

AAAPPPPPPLLLIIICCCAAABBBLLLEEE TTTOOO SSSTTTUUUDDDEEENNNTTTSSS AAADDDMMMIIITTTTTTEEEDDD IIINNN 222000111444---OOONNNWWWAAARRRDDD (((IIINNN FFFIIIRRRSSSTTT YYYEEEAAARRR)))

MMMAAAYYY 111555TTTHHH,,, 222000111555

(((UUUPPPDDDAAATTTEEEDDD AAAFFFTTTEEERRR 999TTTHHH BBBOOOSSS)))

GGGLLLAAA UUUNNNIIIVVVEEERRRSSSIIITTTYYY,,,

MMMAAATTTHHHUUURRRAAA (((UUU...PPP...))) IIINNNDDDIIIAAA




CCCOOOUUURRRSSSEEE SSSTTTRRRUUUCCCTTTUUURRREEE

MMMCCCAAA




1

First Semester

S. NO.

CODE SUBJECT TEACHING SCHEME

CREDITS CONTACT HR/WK L T P

1. MCA1001 Computer Concept & Programming

4 0 0 4 4

2. MCA1002 Computer Organization & Architecture

3 1 0 4 4

3. MCA1003 Fundamentals of Computers 3 0 0 3 3

4. MCA1004 Discrete Mathematics 3 1 0 4 4

5. MBA1008 Managerial and Organizational Behaviour

3 0 0 3 3

6. AHS1002 Environmental Science 2 0 0 2 2

PRACTICALS

7. MCA1081 Computer Programming Lab 0 0 4 2 4

8. MCA1082 Computer Organization & Architecture Lab

0 0 2 1 2

9. MCA1083 Computer Lab 0 0 2 1 2

10. AHE1082 Professional Communication Lab-I

0 0 2 1 2

11. MCA1099 General Proficiency 0 0 0 1 0

Total 18 2 10 26 30

Second Semester

S. NO.


CREDITS CONTACT

HR/WK L T P

1. MCA2001 Theory of Automata & Formal Language

3 1 0 4 4

2. MCA2002 Computer Graphics & Multi Media

4 0 0 4 4

3. MCA2003 Introduction to Microprocessors

3 1 0 4 4

4. MCA2004 Optimization Technique 3 1 0 4 4

5. MBA2008 Accounting & Financial Management

2 1 0 3 3

PRACTICALS

6. MCA2081 Computer Graphics & Multi Media Lab

0 0 4 2 4

7. MCA2082 Microprocessors Lab 0 0 2 1 2

8. MCA2083 Mini Project I 0 0 4 2 4

9. AHE 2082 Professional Communication Lab-II

0 0 2 1 2


Total 15 4 12 26 31




2

Third Semester

S. NO.



1. MCA3001 Object Oriented Programming

3 0 0 3 3

2. MCA3002 Data Structures 3 1 0 4 4

3. MCA3003 Database Management System

4 0 0 4 4

4. MCA3004 Software Engineering 3 0 0 3 3

5. MCA3005 Operating System 3 0 0 3 3

6. AHE3001 Ethics & Values 2 0 0 2 2

PRACTICALS

7. MCA3081 Object Oriented Programming Lab using C++

0 0 4 2 4

8. MCA3082 Data Structures Lab 0 0 4 2 4

9. MCA3083 Database Management System Lab

0 0 4 2 4

10. AHE3081 Soft Skills-I 0 0 2 1 2


Total 18 1 14 27 33

Fourth Semester S. NO.



1. MCA4001 Unix & Shell Programming 3 0 0 3 3

2. MCA4002 Design & Analysis of Algorithm

3 1 0 4 4

3. MCA4003 Computer Networks 3 1 0 4 4

4. MCA4004 Internet & Java Programming

3 0 0 3 3

5. Elective I 3 0 0 3 3

6. Elective II 3 0 0 3 3

PRACTICALS

7. MCA4081 Unix & Shell Programming Lab

0 0 2 1 2

8. MCA4082 Design & Analysis of Algorithm Lab

0 0 2 1 2

9. MCA4083 Java Programming Lab 0 0 4 2 4

10. MCA4084 Mini Project – II 0 0 2 1 2

11. AHE4081 Soft Skills- II 0 0 2 1 2


Total 18 2 12 27 32




3

Fifth Semester

S. NO.


CREDITS CONTACT

HR/WK L T P

1. MCA5001 Web Technology 3 0 0 3 3

2. MCA5002 Distributed Systems 4 0 0 4 4

3. MCA5003 .Net framework using C# 3 0 0 3 3

4. Elective III 3 0 0 3 3

5. Elective IV 3 0 0 3 3

6. AHE5001 Technical Writing 2 0 0 2 2

PRACTICALS

7. MCA5081 Web Technology Lab 0 0 4 2 4

8. MCA5082 .Net framework Lab 0 0 4 2 4

9. MCA5083 Mini Project III 0 0 4 2 4

10. MCA5084 Seminar 0 0 2 1 2


Total 18 0 14 26 32

Sixth Semester

S. NO.


CREDITS CONTACT

HR/WK L T P

1. MCA6081 Industrial Training 0 0 0 26 0

ELECTIVE I

S. NO.

CODE SUBJECT TEACHING SCHEME CREDITS CONTACT WEEK L T P

1. MCA4021 Information Retrieval Systems

3 0 0 3 3

2. MCA4022 Soft Computing 3 0 0 3 3

3. MCA4023 Digital Image Processing 3 0 0 3 3

4. MCA4024 Management Information System

3 0 0 3 3




4

ELECTIVE II

S. NO.

CODE SUBJECT TEACHING SCHEME CREDITS CONTACT WEEK L T P

1. MCA4041 Data Compression 3 0 0 3 3

2. MCA4042 E Commerce 3 0 0 3 3

3. MCA4043 Service Oriented Architecture

3 0 0 3 3

4. MCA4044 Mobile Application Development

3 0 0 3 3

ELECTIVE III

S. NO.


CREDITS CONTACT

HR/WK L T P

1. MCA5021 Data Mining & Warehousing

3 0 0 3 3

2. MCA5022 Cloud Computing 3 0 0 3 3

3. MCA5023 Mobile Computing 3 0 0 3 3

4. MCA5024 Agile Software Development

3 0 0 3 3

ELECTIVE IV

S. NO.


CREDITS CONTACT

HR/WK L T P

1. MCA5041 Cryptography & Network Security

3 0 0 3 3

2. MCA5042 Software Project Management

3 0 0 3 3

3. MCA5043 Artificial Intelligence 3 0 0 3 3

4. MCA5044 Business Intelligence 3 0 0 3 3




5

MMCCAA11000011:: CCOOMMPPUUTTEERR CCOONNCCEEPPTT && PPRROOGGRRAAMMMMIINNGG

Prerequisite: Basic knowledge of Algorithm, Flowchart Designing.

Module No.

Content Teaching

Hours

I

Planning the Computer Program: Purpose of Program Planning, Algorithm, Flowcharts. Introduction to C Programming Language: Structure of a C Program, Standard I/O in C, Fundamental Data Types- Character, Integer, Single and Double-Precision Floating Point, Data type modifiers: Short, Long, Unsigned. Operators and Expressions: Using Numeric and Relational Operators, Mixed Operands and Type Conversion, Logical Operators, Bit Operations, Operator Precedence and Associativity. Making Decisions, Loops and Iteration: Conditional Program Execution, Applying if and switch Statements, Nesting if and else, Restrictions on switch Values, Use of break and default with switch, Program Loops and Iteration, Uses of while, do while and for Loops, Multiple Loop Variables, Assignment Operators, Using break and continue.

13

II

Storage Classes: Auto, Extern, Register and Static Variables. Arrays & Strings: One Dimensional, Two Dimensional and Multidimensional Arrays and their Applications, Declaration and Manipulation of Arrays. String Variable, String Handling Functions, Array of Strings, Operations on Strings. Functions: Designing Structured Programs, Functions in C, User Defined and Standard Functions, Formal vs. Actual Arguments, Function Category, Function Prototype, Parameter Passing, Recursive Functions, and Passing Arrays to a Function.

14

III

Structure and Union: Declaration and Initialization of Structures, Structure as Function Parameters, Unions. Pointers: Pointer Variable and its Importance, Pointer Arithmetic and Scale Factor, Compatibility, Dereferencing, L-value and R-value, Pointers and Arrays, Pointer and Character Strings, Pointers and Functions, Array of Pointers, Pointer to Pointer, Structure Pointer, Dynamic Memory Allocation: Malloc, Calloc, Free. The Pre-Processor Directives, Command Line Arguments, Macros. File Management: Opening a File, Closing a File, Input/Output Operations in Files, Random Access to Files.

13

Text Book:

Behrouz A. Forouzan and Richard F. Gilberg (2007) Computer Science – “A structured Programming Approach Using C” , Cengage Learning.

Reference Books: K. N. King (2008) “C Programming - A Modern Approach”, 2nd Edition. W. W. Norton, Kernighan and Ritche (1996) “The C programming Language”, PHI.

Outcome: After completion of this course students will be equipped with problem solving skills with C language.

Credits: 04

L–T–P: 4–0–0 Semester I




6

MMCCAA11000022:: CCOOMMPPUUTTEERR OORRGGAANNIIZZAATTIIOONN && AARRCCHHIITTEECCTTUURREE

Prerequisite: This course requires knowledge of Computer Organization & Architecture.

Module No.

Content Teaching

Hours

I

Introduction: Basic Organization of Computer with Functional Units, Logic Gates, K-Maps. Combinational & Sequential Circuits: Half Adder, Full Adder, Decoder, Multiplexer, Flip-flops - SR, JK, D, T. Faster Arithmetic Algorithms: Addition, Subtraction and Booth’s Multiplication. Micro-Operation: Arithmetic, Logic and Shift Micro-Operation. ALU Design: Arithmetic Circuit, Logic Circuit, Arithmetic and Logic and Shift Unit. Single Bus Organization: Fundamental Concepts (Register Transfers, Performing of Arithmetic or Logical Operations, Fetching a Word from Memory, Storing a Word in Memory), Bus Transfer.

13

II

Basic Organization: Von Neumann Architecture, Operational Flow Chart (Fetch, Execute), Instruction Cycle, Execution of a Complete Instruction, Multiple-Bus Organization. Control Design: Hardwired & Micro Programmed Control Unit (Microinstruction, Control Memory Micro-Program Sequencing). Processor Design: Processor Organization: General Register Organization, Stack Organization, Addressing Mode, Instruction Format, Data Transfer & Manipulations, Program Control, Reduced Instruction Set Computer.

14

III

Input-Output Organization: I/O Interface, Modes of Transfer- Programmed I/O, Interrupt Initiated I/O, Priority Interrupts-Polling, Daisy Chaining, Interrupt Cycle, Direct Memory Access- DMA Controller, DMA Transfer, Input-Output Processor. Memory Organization: Memory Hierarchy & Characteristics, Internal Memory- Main Memory (RAM and ROM Chips) & Cache Memory, Virtual Memory. Architecture and Introduction to Parallel Processing: Architecture and Pin-Diagram of 8085, Concept of Pipeline, Flynn’s and Feng’s Classification.

13

Text Book:

Patterson, Nov 17 (2008),” Computer Organisation and Design”, Elsevier Pub. 4th Edition.

Reference Books:

William Stalling (2011)”Computer Organization”, PHI, 7th Edition. V. Carl.Hamacher & Zaky (1996)”Computer Organization”, TMH, 4th International Edition. Mano (2003)”Computer System Architecture”, PHI, 3rd Edition. John P Hays (2001)”Computer Organization”, McGraw Hill, 2nd Edition. Tannenbaum (2005) “Structured Computer Organization”, PHI, 5th Edition. P Pal Chaudhry (2002) “Computer Organization & Design”, PHI, 2nd Edition.

Outcome: After completion of this course students will have an idea about the functionality and behavior of

the major subsystems of computer.

Credits: 04 L–T–P: 3–1–0 Semester I




7

MMCCAA11000033:: FFUUNNDDAAMMEENNTTAALLSS OOFF CCOOMMPPUUTTEERRSS

Prerequisite: Basic knowledge of computers

Module No.

Content Teaching

Hours

I

Information concept and Processing: Definition of Information, Need for Information, Quality of Information, Value of Information, Categories and Levels of information in Business Organization, Data concepts and Data Processing, data representation – Number system. Computer Appreciation: Definition of an Electronic Digital Computer, history, Generations, Characteristics and applications of Computers, classification of Computers. Elements of Computers Processing System: Hardware CPU, Peripherals, Storage Media, Software Definition, Role and Categories, Firmware and Human ware.

14

II

Communication: Need for communication, Data Transmission, Baud, Bandwidth, Data transmission rate, Channel Capacity, transmission impairments, Signal noise ratio. Transmission media (twisted cables, Micro wave and radio wave, Optical fiber and satellite) and communication through these media. A/D and D/A, Modulation, Multiplexing-FDM, TDM. Communication techniques: Circuit switching, message switching and packet switching and their advantages and disadvantages.

13

III

Networking Essentials: Networking of Computer – Introduction of LAN and WAN, Types of LAN, Basic ISO-OSI model of LAN, client – Server Architecture’s. Programming Language Classification: Computer Languages, Generation of Languages, Translators – Interpreters, Compilers, Assembles, Introduction to 4GLS. Digital Fundamentals: Various Codes, Decimal, Binary, Hexa Decimal Conversion, Floating Numbers, Gates, Flip Flops, Adder, Multiplexers.

14

Text Book:

Yadav, D.S, (2006), "Foundations of Information Technology", New Age, 3rd Edition. Reference Books:

Rajaraman, V.(2010), “Fundamentals of Computers”, PHI Learning, 5th Edition. Peter Nortans(2006) “Introduction To Computers”, TMH,6th Edition .

Outcome: After completion of this course students will have an idea about the use of Information

Technology.





8

MMCCAA11000044:: DDIISSCCRREETTEE MMAATTHHEEMMAATTIICCSS

Prerequisite: This course requires knowledge of Mathematics.

Module No.

Content Teaching

Hours

I

Sets, Functions and Relations: Definition of Sets, Countable and Uncountable Sets, Venn Diagrams, Proofs of Some General Identities on Sets, Functions –Definition and Types; Relations –Definition and Types. Theorem Proving Techniques: Mathematical Induction (Simple and Strong), Pigeonhole Principle, Proof by Contradiction.

13

II

Algebraic Structures: Definition, Types - Semi Groups, Monoid, Groups, Abelian Group, Properties of Groups, Subgroup, Cyclic Groups, Cosets, Permutation Groups, Normal Subgroup, Homomorphism and Isomorphism of Groups, Rings, Fields. Posets, Hasse Diagram and Lattices: Introduction, Ordered Set, Hasse Diagram, Ordered Sets, Isomorphic Ordered Set, Well Ordered Set, Properties of Lattices, Bounded , Distributive and Complemented Lattices.

14

III

Propositional Logic: Proposition, First order Logic, Basic Logical Operation, Truth Tables, Tautologies, Contradictions, Algebra of Proposition, Logical Implications, Logical Equivalence, Predicates, Universal and Existential Quantifiers. Graph Theory: Simple Graph, Multi Graph, Connected Component in a Graph, Euler Graphs, Hamiltonian Path and Circuits, Graph Coloring, Chromatic Number, Isomorphism and Homomorphism of Graphs, Planar Graph, Weighted Graph, Travelling Salesman Problem.

13

Text Book:

Kenneth H Rosen (Sept.2002)”Discrete Mathematics and Its Applications”, McGraw Hill.

Reference Books:

J. P.Tremblay (1997) “Discrete Mathematical Structures with Applications to Computer Science”, Tata McGraw-Hill Publishing Company Pvt. Ltd New Delhi.

V. Krishnamurthy (1986) “Combinatorics Theory and Applications”, East-West Press Pvt. Ltd New Delhi.

Ralphp P. Grimaldi (2004) “Discrete and Combinatorial Mathematics - An Applied Introduction”, Pearson, 5th Edition .

C. L. Liu (2000) “Elements of Discrete Mathematics”, Tata McGraw-Hill, 2nd Edition.

Outcome:

At the end of the course, student will understand the applications of Computer Science having

Mathematical Structures.





9

MMBBAA11000088:: MMAANNAAGGEERRIIAALL AANNDD OORRGGAANNIIZZAATTIIOONNAALL BBEEHHAAVVIIOORR

Module No.

Content Teaching

Hours

I

Organisation: Components of Organisation, Nature and Variety of Organisations. Organisational behavior: Concept, Nature, Scope and Importance, Models of Organisational Behaviour. Leadership: Concept, Function, Style and Theories of Leadership-Trait, Behavioural and Situational Theories. Organisational Power and Politics: Concept, Sources of Power, Distinction Between Power, Authority and Influence, Approaches to Power, Dysfunctional Uses of Power.

13

II

Personality: Types, Factors Influencing Personality & Theories. Learning: Concept & Learning Theories. Perceptions: Concept, Nature, Process, Importance. Attitudes: Characteristics, Components, Measurement & Changing. Motivation: Importance, Types & Theories. Individual Behavior and Understanding Self: Johari Window.

14

III

Group Dynamics and Teams: Theories of Group Formation - Formal and Informal Groups, Their Interaction & Group Development - Importance of Teams - Formation of Teams - Team Work. Organisational Culture: Concept, Charactersitics, Elements of Culture, Implications of Organisation Culture, Process of Organisational Culture. Organisational Change: Concept, Nature, Resistance to Change, Managing Resistance to Change, Implementing Change. Conflict: Concept, Sources, Classification, Resolution. Stress: Meaning, Consequences, Causes & Managing Stress.

13

Text Book:

Stephen P.Robins (2001) “Organisational Behavior”, Prentice Hall of India, 9th Edition.

Reference Books:

Schermerhorn, hunt and Osborn (2001) “Organisational behavior”, John Wiley, 7th Edition. Jit S.Chand (2001) “Organisational Behavior”, Vikas publishing House Pvt. Ltd. 2nd Edition. Fred Luthans (1998) “Organisational Behavior”, McGraw Hill Book Co. New Strom & Davis (2001)”Organisational behavior”, McGraw Hill.





10

AAHHSS11000022:: EENNVVIIRROONNMMEENNTTAALL SSCCIIEENNCCEE

Module No.

Content Teaching

Hours

I

Basics of Environmental Studies: Environment: Concept, Types, Introduction, Multidisciplinary Nature, Scope, Importance, Need of Creating Public Awareness about Environment, Environmental Education, Environmental Ethics. Natural Environment: Life on the Earth, Structure & Function of Atmosphere, Hydrosphere, Lithosphere and Biosphere. Human Activities and their Effects on Environment: Effect of Agriculture, Housing, Mining, Transportation and Industries.

13

II

ECOSYSTEM AND NATURAL RESOURCES Ecology and Ecosystem: Definitions, Structure & Functions. Biodiversity: Status, Distribution, Depletion and Conservation. Natural Resources: Introduction, Classification, Depletion, Conservation, Status and Challenges related to Water Resources, Mineral Resources and Forest Resources. Status and Challenges related to Energy Resources: Fossil Fuels, Hydroelectricity, Nuclear Energy, Solar Energy, Biomass Energy and Other Alternative Energy Resources.

14

III

ENVIRONMENTAL PROBLEMS AND PROTECTION Environmental Pollution: Causes, Effects and Control of Air Pollution, Water Pollution, Land Pollution and Noise Pollution. Solid Wastes and Hazardous Wastes: Introduction and Management. Global Environmental Challenges: Global Warming, Ozone Layer Depletion, Acid Rain, Urbanization and Overpopulation. Environmental Protection: Role of Citizens, Role of NGOs, Role of Government, Role of International Agencies and Conventions. Tools of Environmental Protections: Environmental Laws, Environmental Impact Assessment, ISO Certification, Environmental Economics, Concept of Ecological Footprints and Sustainable Development, Major Environmental Problems and Efforts towards Environmental Protection in India.

13





11

MMCCAA11008811:: CCOOMMPPUUTTEERR PPRROOGGRRAAMMMMIINNGG LLAABB

Prerequisite: Basic Knowledge Basics of Algorithm, Flowchart Designing.

Module No.

Content Lab

Hours

I

(1) Execution of Simple ‘ C’ Programs (a) WAP to Calculate Simple Interest. (b) WAP to Swap Two Numbers with and without using Third Variable. (c) WAP to Input the Distance of a City in [KM] and Print the Distance to Meter

and Centimeter. (d) WAP to Calculate the Gross Salary of an Employee where DA=50% of Basic,

HRA=35% of Basic Salary. (2) Expression and Evaluation

(a) WAP to Calculate the Average of Three numbers. (b) WAP to convert temperature from Celsius to Fahrenheit and vice-versa. (c) Check the Behavior of the Operators.

(3) Conditional and Branching (a)WAP to Find Whether Given Number is Even or Odd. (b) WAP to Find Greater among Three Numbers. (c) WAP to Input the Basic Salary and Year of Experience of an Employee. Calculate the Gross Salary where DA=90% of basic, HRA=35%. of basic. If the experience of an employee is greater than equal to 5 years and gross salary is less than Rs.10000 then show the net updated salary with the increment 5000 in gross salary. (d) WAP to calculate percentage and grade of a student of five subjects. (e) WAP to find whether a given year is leap year or not.

(4) Iteration (a) WAP to even numbers between 5 to 5000 (b) WAP to print Fibonacci series up to the desired term. (c) WAP to calculate factorial of a given number. (d) WAP to generate table of a given number in proper format. (e) WAP to check whether an input number is prime or not. (f) WAP to input a number and print the reverse of that number with multiplication of digits. (g) WAP to input a number and print the sum of first and last digit of that number. (h) WAP to check whether an input number is palindrome or not. (I)WAP to print the Armstrong numbers between 2 to 500. (5) Functions (a) WAP to perform arithmetic operations using functions and switch case. (b) WAP to calculate the factorial of a number by using function. (c) WAP to calculate the binomial coefficient.

(d) WAP to print the series and sum of the series: (i) 1+1/2!+1/3!+…………………. (ii) 1+x/2!+x/3!+………………….. (iii) X - X3 / 3! + X5 / 5! - X7 / 7! + X9 / 9! - ..…………….. (iv) X + X3 / 3! + X5 / 5! + X7 / 7! + X9 / 9!- ……………….

(e) WAP to demonstrate the call by value and call by reference. (6) Recursion (a) WAP to calculate factorial of a number. (b) WAP to generate table of any number.

48





12

(c ) WAP to find GCD of two numbers. (d) WAP to calculate nth term of Fibonacci Series 1,1,2,3,5,8…………………..

(7) Array (a) WAP to perform addition and subtraction and transpose of two matrixes. (b) WAP to perform matrix multiplication of two matrixes. (c ) WAP to check whether given text is palindrome or not.

(d) WAP to calculate total number of consonants, vowels and other characters in a given line of the text. (e) WAP to print the length of a string. (f) WAP to search an element in an array.

(8) Structures (a) WAP to demonstrate use of structure.

(b) WAP to enter 10 records of student information .Structure fields are Name, Roll no, Marks. Calculate the average of their marks. (c ) WAP to demonstrate, how structure is passed to a function. (d)WAP to demonstrate, how structure is passed to a function.

Outcome:

After completion of this course Students will be equipped with problem solving skills with C

language.




13

MMCCAA11008822:: CCOOMMPPUUTTEERR OORRGGAANNIIZZAATTIIOONN && AARRCCHHIITTEECCTTUURREE LLAABB

Prerequisite: This course requires knowledge of Computer Organization & Architecture.

Module No.

Content Lab

Hours

I

Introduction of Computer Organization. To study and implement various AND GATE using universal gates NAND. To study and implement various AND GATE using universal gates NOR. To study and implement various NOT GATE using universal gates NOR. To study the operation of Demultiplexer. To study the operation of decimal to BCD encoder. To study the operation of BCD decoder to decimal. To study the half adder and full adder using NAND and NOR gates. To study the half subtractor & full subtractor using NAND & XOR gates. To study the operation of segment decoder. To study the operation of Flip –Flop (JK ,D ,T). To study the BCD counter. To study the Ring counter and Johnson counter.

24

Outcome:

After completion of this course students will have an idea about the functionality and behavior of

the major subsystems of computer.





14

MMCCAA11008833:: CCOOMMPPUUTTEERR LLAABB Prerequisite: Basic Knowledge computers.

Credits: 01 Semester I L–T–P: 0–0–2

LIST OF PRACTICALS Identify and familiarity with functionality of various components of computer. 1 Installation of Windows, Linux operating system and other s/w and packages. 1 Working on Operating System: To check some elementary functions of Operating System: 1

Booting/ Shut Down. Change Desktop Settings Change Date and Time Check system properties.

Introduction to computer network i.e. LAN 1 Basic Command of Operating System (Dos/Windows) 1 Working on Microsoft Office 4

Word Processing(MS Word)

A document is required to be created for testing the following areas: Editing and formatting text and paragraph Page and paragraph setup

Inserting symbols and pictures Presentation(Power Point Presentation)

A presentation is required to be created with 4 slides for testing the following areas: Editing and formatting slides Inserting pictures and sounds Animating pictures and text with sound effects

MS Excel

A spreadsheet is required to be created for testing the following areas: Formatting cells and data Functions & formulae (Relative, absolute and Mixed reference)

Charts

Working on Internet and Email and Web Search 1

Use of Internet Web Browser Types and usage Website browsing, Web Portal Types Working on Search Engine Working on Google Drive for sharing information

Use of Email Create an email account Sending mail, multiple mails, use of CC and BCC, Mail attachments. Chatting Applications

Social Networking Create and account on social networking portal Add and delete friends Reading and sending messages

Outcome: The student will be familiar with the hardware, software installation, office packages and

networking.




15

AAHHEE 11008822:: PPRROOFFEESSSSIIOONNAALL CCOOMMMMUUNNIICCAATTIIOONN LLAABB--II Objectives:

To help learners gain confidence in spoken English and overcome inhibitions.

To equip learners with effective listening and train them to acquire standard pronunciation, accent,

stress patterns and intonation.

To enrich their vocabulary.

Module No.

Content Teaching

Hours

I

Hurdles of the Path and Route Map Language Drills: Singular & Plural, countable & uncountable, Parts of speech, Tense-shift Routine Expressions: Greetings, Introducing yourself and others, Query—formal/informal, Replies-Positive, Neutral and Negative, Expressing surprise, regret, apology, seeking information. Tenses through simple presentations: Present: Introduction, Routine, My City, My Value System etc. Past: Describing events—marriage party, picnic, conference etc. Experience, Process, Movie Future: Goal of my life, India of my dreams etc. We will have to return to our roots, Cloning will make us immortal Technological Advancement: Man is on the verge of becoming Machine/God.

10

II

Virtual Speaking Extempore: 1 minute description of objects in the room. Picture Description: Flow of the idea, organization of the message, Crowded Pictures, Abstract Pictures (modern art etc.) Open ended-relationship based: Mother (in Business suit) rushing outside while child is crying, goods in home are scattered Sibling Fight Joint family—having fun Cook a Story: ways of developing in prose, Jumbled Pictures, One person-one sentence, Tie-up the loose threads

10

III

Rapid Vocabulary & its Usage: Roots & word formation, commonly misused words, words with shades of meaning, Phrasal Verbs, Terms used as Noun & Verb, Noun & Adjectives. Speak Well: Ambiguity in conversation/comment, Reason & ways to root it out, commonly mispronounced words Phonetic symbols/ Pronunciation Drills Comprehension and Conversation Listening: Active & Passive listening; listening with Empathy, Listening Comprehension Reading Comprehension (pre-discussion and Post discussion) Telephonic Conversation: Greetings, putting the phone on hold, inquiry about the caller. Simple Role Play.

10

References:

Allen, W. S. Living English Structure. New Delhi: Orient Longman Pvt. Ltd. Balan, J. Spoken English. New Delhi: Tata McGraw Hill. Martin, H. & Waren P. C. English Grammar & Composition. New Delhi: S. Chand & Co.

Credit: 01 L–T–P : 0–0–2 Semester I




16

MMCCAA22000011:: TTHHEEOORRYY OOFF AAUUTTOOMMAATTAA && FFOORRMMAALL LLAANNGGUUAAGGEE

Prerequisite: This course requires basic knowledge of Discrete Mathematics (MCA1004).

Module No.

Content Teaching

Hours

I

Introduction, Alphabets, Strings and Languages: Automata and Grammars, Deterministic Finite Automata (DFA)-Formal Definition, Simplified Notation- State Transition Graph, Transition Table, Language of DFA, Nondeterministic Finite Automata (NFA), NFA with Epsilon Transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata, Distinguishing One String from other, Myhill-Nerode Theorem; FA with Output, Moore and Mealy Machine, Equivalence of Moore and Mealy Machine, Applications and Limitation of FA. Regular Expression (RE) , Definition, Algebraic Laws for Regular Expressions, Kleen’s Theorem, Regular Expression to FA, DFA to Regular Expression, Arden Theorem, Non Regular Languages, Pumping Lemma for Regular Languages, Application of Pumping Lemma, Closure Properties of Regular Languages, Decision Properties of Regular Languages.

13

II

Context Free Grammar (CFG) and Context Free Languages (CFL): Definition, Examples, Derivation , Derivation Trees, Ambiguity in Grammar, Inherent Ambiguity, Ambiguous to Unambiguous CFG, Useless Symbols, Simplification of CFGs, Normal Forms for CFGs- CNF and GNF; Closure Properties of CFLs, Decision Properties of CFLs, Emptiness, Finiteness and Membership, Pumping Lemma for CFLs. Push Down Automata (PDA): Description and Definition, Instantaneous Description, Language of PDA, Acceptance by Final State, Acceptance by Empty Stack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two Stack PDA.

14

III

Turing Machines (TM): Basic Model, Definition and Representation, Instantaneous Description, Language Acceptance by TM, Variants of Turing Machine, TM as Computer of Integer functions, Universal TM, Church’s Thesis, Recursive and recursively Enumerable Languages, Halting Problem, Introduction to Undecidability, Undecidable Problems about TMs. Post Correspondence Problem (PCP), Modified PCP, Computational Complexity Theory, Intractable Problems.

13

Text Book:

Hopcroft, Ullman (2001) “Introduction to Automata Theory, Languages and Computation”, Pearson Education, third edition.

Reference Books:

K.L.P. Mishra and N. Chandrasekaran (2000) “Theory of Computer Science : Automata, Languages and Computation”, PHI, third edition.

Martin J. C. (2003) “Introduction to Languages and Theory of Computations”, TMH, third edition.

Outcome:

At the end of this course, the students should be able to distinguish between the different

mathematical models and be able to use these models in solving different types of problems.

Credits: 04 L–T–P: 3–1–0 Semester II




17

MMCCAA22000022:: CCOOMMPPUUTTEERR GGRRAAPPHHIICCSS && MMUULLTTIIMMEEDDIIAA Prerequisite: This course requires basic knowledge of fundamental of computer programming and computer organization.

Module No.

Content Teaching

Hours

I

Graphics Systems: Refresh CRT, Raster-Scan Displays, DVST, Plasma Displays, LCD, Input. Devices: Functions Provided by Input Devices, Basic Working of these Input Devices. Output Primitives : Lines DDA, Bresenham & Circle Drawing Algorithms, Filled Area Primitives, Scan Line Polygon Fill Algorithm, Inside Outside Tests, Boundary Fill & Flood Fill Algorithm. Line Clipping Algorithms: Cohen Sutherland Line Clipping Algorithm, Liang Barsky Algorithms, Polygon Clipping Algorithms- Sutherland Hodgeman, Weiler Atherton Algorithms.

13

II

Transformation: Translation, Rotation, Scaling, Mirror Images, Transformation about an Arbitrary Point, 3D- Transformation, Rotation about an Arbitrary Axis. Projection: Orthogonal Projections, Multiple Views, Isometric Projection, Perspective Projections (One, Two and Three Vanishing Points). Quadric Surfaces, Spline Representation, Spline Specification, Bezier Curves and Surfaces, B-Splines and Surfaces, Displaying Spline Curves and Surfaces.

14

III

Hidden Line and Surface Removal Algorithms: Back Face Detection, Depth-Buffer and A-buffer Methods, Introduction to Shading. Graphics Standards: GKS/PHIGS. Multimedia: Multimedia Architecture, Multimedia File Formats, Compression, Image Compression, Video Compression, Audio Compression. DVI Technology: Video & Audio Codecs, Virtual Reality, GUI Design, Playback, Hypermedia Linking and Embedding.

13

Text Book:

D. Hearn and M. P. Baker,(1996) “Computer Graphics”, PHI.

Reference Books:

W.K. Gilloi, (2007)”Interactive Computer Graphics”, PHI. D.F. Rogers,(1997) “Procedural Elements for Computer Graphics”, McGraw-Hill. J.D. Foley and A.D. Van, (1990)”Fundamentals of Interactive Computer Graphics”, Addison-Wesley. Rogers and Adam, (2008)”Mathematical Elements for Computer Graphics”, McGraw-Hill.

R. Steinmetz and K. Nahrstedt,(1995) ”Multimedia: Computing, Communications and Applications”,

Prentice Hall, PTR.

Outcome:

At the end of this course, the students should be able to understand development and

advancement of computer graphics technology.





18

MMCCAA22000033:: IINNTTRROODDUUCCTTIIOONN TTOO MMIICCRROOPPRROOCCEESSSSOORRSS

Prerequisite: Students need to know the basic building blocks of a digital system and knowledge of

computer organization.

Text Book:

N Senthil Kumar, M Saravanan, and S Jeevananthan (2010), “Microprocessors and Microcontrollers”, Oxford University Press India.

Ramesh S. Gaonkar (2000) “Microprocessor Architecture Programming and Applications with 8085”. 4th Edition, Penram International Publishing.

Reference Books:

Ray A.K.Bhurchandi.K.M (2002) “Advanced Microprocessor and Peripherals”, Tata McGraw-Hill. D. V. Hall (1992) “Microprocessors and Interfacing”, Programming and Hardware , 2nd Edition,

Tata McGraw-Hill. Y.C. Liu and G.A. Gibson (2003) “Microcomputer Systems: The 8086/8088 Family Architecture

Programming and Design”, PHI , 2nd Edition.

Outcome:

At the end of the course, students will be able to

Identify the basic element and functions of microprocessor. Describe the architecture of microprocessor and its peripheral devices.

Module No.

Content Teaching

Hours

I

Introduction: Microprocessors Evolution and Types, Overview of 4004, 8080, 8085,8086,80286, 80386, 80486 and Pentium Micro Processor, Micro Processor Application. 8-Bit Microprocessor: 8085 Microprocessor and its Architecture, The 8085 Programming Model, Addressing Modes, Instruction Classification, Instruction Format, Overview of Instruction Set-Data Transfer Operation, Arithmetic Operation, Logic Operations and Branch Operations. Introduction to Assembly Language Program.

13

II

Programming Technique with Additional Instruction: Looping, Counting, Indexing, Additional Data Transfer and 16-bit Arithmetic Instruction, Counters and Time Delays, Stack and Subroutine. 16 Bit Microprocessor: Architecture of 8086 – Register Organization, Execution Unit, Bus Interface Unit, Signal Description, Physical Memory Organization, Mode of Operation, I/O Addressing Capabilities.

14

III

Peripheral Interfacing: I/O Programming: Programmed I/O, Interrupt Driven I/O, DMA I/O, Memory-Mapped I/Os. Peripheral Devices: 8237 DMA Controller, 8255- Programmable Peripheral Interface, 8253/8254 Programmable Timer/Counter.8259 Programmable Interrupt Controller.

13





19

MMCCAA22000044:: OOPPTTIIMMIIZZAATTIIOONN TTEECCHHNNIIQQUUEE

Prerequisite: This course requires knowledge of Mathematics with problem solving approach.

Module No.

Content Teaching

Hours

I

Preliminaries: Inventory Models and Replacement Problems- Inventory Models, Various Costs-Deterministic Inventory Models, Single Period Inventory Model with Shortest Cost, Stochastic Models, Application of Inventory Models, Economic lot Sizes-Price Breaks, Replacement Problems-Capital Equipment-Discounting Costs-Replacement in Anticipation of Failure- Group Replacement-Stochastic Nature Underlying the Failure Phenomenon. Linear Programming Problems (LPP): Definition of LPP, Graphical Solutions of Linear Programming Problems, Simplex Method, and Artificial Variable Method, Two Phase Method, Charnes’ Big-M Method, Sensitivity Analysis, Duality, Dual Simplex Method.

13

II

Integer Linear Programming Problems: Integer Linear Programming Problems, Mixed Integer Linear Programming Problems, Cutting Plane Method, Branch and Bound Method, 0-1 Integer Linear Programming Problem. Transportation Problems: Introduction to Transportation Model, Matrix Form of TP, Applications of TP Models, Basic Feasible Solution of a TP, Degeneracy in TP, Formation of Loops in TP, Solution Techniques of TP, Different Methods for Obtaining Initial Basic Feasible Solutions viz. Matrix Minima Method, Row Minima Method, Column Minima Methods, Vogel’s Approximation Method, Techniques for Obtaining Optimal Basic Feasible Solution. Assignment Problems: Definition, Hungarian Method for AP. CPM and PERT: Network Diagram-Events and Activities- Project Planning Reducing Critical Events and Activities-Critical Path Calculations-Examples- Resources and Man Power Leveling. Sequencing Problems-Travelling Salesman Problems –Machine Scheduling Problem (Job-Shop).

14

III

Non Linear Programming: Formulation of an NLPP, Concave and Convex Functions, Solution of NLPP, Having more than one in Equality Constraint using Kunn-Tucker Condition. Dynamic Programming: Bellman’s Principle of Optimality of Dynamic Programming, Multistage Decision Problem and its Solution by Dynamic Programming with Finite Number of Stages, Solution of Linear Programming Problems as a Dynamic Programming Problem. Queuing Theory: Introduction to Queues, Basic Elements of Queuing Models, Queue Disciplines, Memory less Distribution, Role of Exponential and Poisson Distributions, Markovian Process, Erlang Distribution, Symbols and Notations, Distribution of Arrivals, Distribution of Service Times, Definition of Steady and Transient State, Poisson Queues.

13

Text Book: D.S.Hira and P.K Gupta (2005), “Operation Research”, S. Chand Publication. Hadley G (2001) “Linear Programming”, Massachusetts , Addison-Wesley.

Reference Books:

Taha H.A (2006) “Operations Research – An Introduction”, Macmillan. Swarup K (2004) “Operation Research”, S. Chand.

Outcome: At the end of this course, the students should be able to understand how real time problem can

be solved using optimization technique.





20

MMBBAA22000088:: AACCCCOOUUNNTTIINNGG && FFIINNAANNCCIIAALL MMAANNAAGGEEMMEENNTT

Module No.

Content Teaching

Hours

I Overview: Meaning of Accounting, Characteristics, Functions, Importance, Concepts, Conventions, Brief Introduction to Accounting Standards and IFRS. Double Entry System-Journalizing of Transaction, Posting in Ledger.

13

II

Mechanics of Accounting: Preparation of Final Accounts-Trial Balance, Trading Account, Profit & Loss Account, and Balance Sheet, Concept of Copyright, Trademark, Patents and Goodwill. Analysis of Financial Statement: Ratio Analysis- Solvency Ratios, Profitability Ratios, Activity Ratios, Liquidity Ratios. Concept of Comparative Balance Sheet and Trend Analysis.

14

III

Funds Flow Statement: Meaning of Working Capital, Preparation of Schedule of Changes in Working Capital, Preparation of Funds Flow Statement and its Analysis, Cash Flow Statement- Preparation of Cash Flow Statement and its analysis.

13

Text Book:

Tulsian ( 2008)”P. C. Financial Accounting”, Pearson Education Narayanswami.

Reference Books:

Financial Accounting (2004) “A Managerial Perspective”, PHI, 2nd Edition. Mukherjee (2009) “Financial Accounting for Management “, TMH, 1st Edition. Ramchandran and Kakani (2007)” Financial Accounting for Management” ,TMH , 2nd Edition. Ghosh T P (1998) “Accounting and Finance for Managers” , Taxman, 1st Edition. Maheshwari S.N and Maheshwari S K (2007) “An Introduction to Accountancy”, Vikas, 9th Edition. Ashish K. Bhattacharya (2007) “Essentials of Financial Accounting”, PHI, New Delhi.





21

MMCCAA22008811:: CCOOMMPPUUTTEERR GGRRAAPPHHIICCSS && MMUULLTTII MMEEDDIIAA LLAABB Prerequisite: Sound knowledge of programming concepts.

Module No.

Content Lab

Hours

I

Design a program for moving of Text from Left to right on the screen. Design a program for moving of Text from Left to right by changing color

of the text. Implementation of DDA Line Algorithm Implementation of mid point Circle Algorithm. Implementation of Bresenhams Algorithm – Line, Circle. Program for drawing polygon. Program for filling polygon by using Boundry fill and flood fill

Algorithms. Two Dimensional transformations - Translation, Rotation, Scaling,

Reflection. Composite 2D Transformations Implement Cohen Sutherland 2D line clipping algorithm. Implement Liang Barsky 2D line clipping algorithm. Three dimensional transformations - Translation, Rotation, Scaling Composite 3D transformations Implementation of Visible Surface Detection Algorithms.

48

Outcome:

After completing the lab student can develop graphics based project

Credits: 02 Semester II L–T–P : 0–0–4




22

MMCCAA22008822:: MMIICCRROOPPRROOCCEESSSSOORRSS LLAABB

Prerequisite: Students need to know the basic building blocks of a digital system and knowledge of

computer organization.

Credits: 01 Semester II L–T–P: 0–0–2

Module No.

Content Lab

Hours

I

To study 8085 microprocessor System. To study 8086 microprocessor System. To develop and run a program to find out largest and smallest number. To develop and run a program for converting temperature from 0F to 0C. To develop and run a program to compute square root of a given

number. To develop and run a program for computing ascending/ descending

order of the numbers. To perform interfacing of RAM chip to 8085/8086. To perform interfacing of keyboard controller. To perform interfacing of DMA controller. To perform interfacing of UART/USART.

24

Outcome:

At the end of the course, students will be able to

Identify the basic element and functions of microprocessor.

Understand how basic assembly language program can be written.




23

MMCCAA22008833:: MMIINNII PPRROOJJEECCTT II Prerequisite: Sound knowledge of programming concepts.

Module No.

Content Lab

Hours

I

Students are required to develop a real time application project comprising of minimum 1000 LOC on any platform in a modular structure. The development of the project must consist of the following : Project Planning – Schedule and Activity Estimation using MS Project 2000 SRS in IEEE 830-1998 format Process Framework for development Software Design Document as per IEEE-1016 Interfaces Detail and Component Level Design Test Cases development as per the stated Software requirement, which is further to be tested on any CASE tool. In order to obtain creativity, it is required that, the software must have minimal use of library/ library functions of respective language/ package

48

Outcome:

After completing the project, the students should gain an insight into the development process of

real projects.

Credits: 02 Semester II L–T–P : 0–0–4




24

AAHHEE 22008822:: PPRROOFFEESSSSIIOONNAALL CCOOMMMMUUNNIICCAATTIIOONN LLAABB--IIII

Semester II

References: Martin, H. & Waren, P. C. English Grammar & Composition. S. Chand & Co. New Delhi,2006 Sharma, S.D.,Text of professional Communication Skills and ESP for Engineers and

Professionals, Sarup & Sons, Delhi Hornby. A.S., Advanced Learners’ Dictionary of Current English, OUP Murphy, Raymond, Intermediate English Grammar. Cambridge University Press. Rizvi, Ashraf, M. Effective Technical Communication. New Delhi: Tata McGraw Hill

Module No.

Content Lab

Hours

I

Applied Grammar- Tenses: their role and correct usage, Subject-Verb agreement, Voices: Active & Passive, Clauses, Conjunctions, Prepositional Phrases, Transformation, Synthesis, Syntax, Conditional sentences. Analyzing and correcting errors in sentences.

12

II

Reading & Writing Skills- a) Reading comprehension, letter writing: Inquiries and their replies, placing and cancelling orders, adjustment letters, accepting and rejecting offers, resume & CV writing, business report writing, application, Précis writing, E-mail writing Vocabulary- Extension methods, synonyms, antonyms, one word substitution, words often confused idioms & phrases.

10

III

Group Strategies & Group Discussion: GD vs Debate, Practice of Abstract topics. Interviews: What is an interview? Types of Interviews, Preparing for Interviews, Drills required for Interviews, potential interview questions, Mock Interview activities. Case Study: Requirement & Significance in professional and personal spheres of life, Important tips for preparing a case study.

08

Credits: 01 L–T–P : 0–0–2 Semester II




25

MMCCAA33000011:: OOBBJJEECCTT OORRIIEENNTTEEDD PPRROOGGRRAAMMMMIINNGG

Prerequisite: Students need to be familiar with the basic concepts of procedure oriented programming and

algorithm designing.

Text Books:

James Rumbaugh etal (1991)”Object Oriented Modeling and Design”, PHI . Bjarne Stroustrup (1997)”C++ Programming Language”, Addison Wesley, 3rd Edition.

Reference Books:

Robert Lafore (2000)”C++ Programming H. Schildt “– Teach yourself C++ TMH . D Samantha (2009)”Object oriented Programming in C++ and Java” , PHI.

Outcome: At the end of the course, students will get the knowledge of object oriented programming in C++

with modeling concept.

Module No.

Content Teaching

Hours

I

Introduction: Evolution of Programming Paradigm, Structured versus Object-Oriented Development, Characteristics of Object-Oriented Programming. Classes and Objects: Introduction, Class Specification, Class Objects, Accessing Class Members, Defining Member Functions, Outside Member Functions as Inline, Accessing Member Functions within a Class, Data Hiding, Access Boundary of Objects Revisited, Empty Classes, Pointers within a Class, Passing Objects as Arguments, Returning Objects from Functions, Friend Functions and Friend Classes, Constant Parameters and Member Functions, Static Data and Member Functions. Constructors and its Type, Destructor, Constructor Overloading, Order of Construction and Destruction, Nameless Objects, Dynamic Initialization through Constructors, Constructors with Dynamic Operations. Polymorphism: Function Overloading, Operator Overloading- Unary, Binary, Comparison, Arithmetic Assignment, New and Delete; Data Conversion, Conversion between Basic Data Types, Conversion between Objects and Basic Types, Conversion between Objects of Different Classes.

13

II

Inheritance: Introduction, Class Revised, Derived Class Declaration, Forms of Inheritance, Inheritance and Member Accessibility, Constructors in Derived Classes, Destructors in Derived Classes, Constructors Invocation and Data Members Initialization, Overloaded Member Functions, Multilevel Inheritance, Multiple Inheritance, Hierarchical Inheritance, Multipath Inheritance and Virtual Base Classes, Hybrid Inheritance. Virtual Functions: Introduction, Need for Virtual Functions, Pointer to Derived Class Objects, Definition of Virtual Functions, Array of Pointers to Base Class Objects, Pure Virtual Functions, Abstract Classes, Virtual Destructors. Exception Handling: Introduction, Error Handling, Exception Handling Model, Exception Handling Constructs, Handler Throwing the Same Exception again, List of Exceptions, Catch all Exceptions, Exceptions in Constructors and Destructors, Handling Uncaught Exceptions, Exceptions in Operator Overloaded Functions. Generic Programming with Templates: Introduction, Function Templates, Overloaded Function Templates, Nesting of Function Calls, Multiple Arguments Function Templates, User Defined Template Arguments, Class Templates, Inheritance of Class Template, Class Template Containership, Class template with Overloaded Operators.

14

III

Object Modeling: Objects and Classes, Links and Association, Generalization and Inheritance, Aggregation, Abstract Class, Multiple Inheritance, Meta Data, Candidate Keys, Constraints. Dynamic Modeling: Events and States, Operations, Nested State Diagrams and Concurrency, Advanced Dynamic Modeling Concepts, A Sample Dynamic Model. Functional Modeling: Data Flow Diagram, Specifying Operations, Constraints, A Sample Functional Model, OMT (object modeling techniques) methodologies.

13

Credits: 03 L–T–P: 3–0–0 Semester III




26

MMCCAA33000022:: DDAATTAA SSTTRRUUCCTTUURREESS

Prerequisite: Students need to be familiar with the basic concepts of programming and algorithm

designing.

Module No.

Content Teaching

Hours

I

Introduction to Data Structure, Types, Data Structure Operations, Algorithm Complexity and Time-Space trade-off. Array: Representation of Single and Multidimensional Arrays, Address Calculation, Operations on Arrays, and Application of Arrays: Matrix Multiplication, Sparse Polynomial Representation and Addition, Character String Operation. Stacks: Array Representation and Implementation of Stack, Operations on Stacks: Push & Pop. Queues: Array Representation and Implementation of Queues, Operations on Queue- Create, Add, Delete, Full and Empty, Types of Queues: Circular Queue, D-Queue and Priority Queue. Application of Stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of Postfix Expression using Stack. Recursion: Recursive Definition and Processes, Recursion in C.

13

II

Linked Lists: Representation and Implementation of Singly Linked Lists, Operations on Linked Lists - Insertion and Deletion to/from Linked Lists, Linked Stacks and Queues, Overflow and Underflow Conditions, Polynomial Representation and Addition and Multiplication of Polynomials, Doubly Linked List, Circular linked list. Trees: Introduction, Binary Trees and their Representation, Algebraic Expressions, Complete Binary Tree. Extended Binary Trees, Array and Linked Representation of Binary Trees, Traversing Binary Trees, Path Length, Huffman Algorithm. Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST. Types of Tress: Threaded Binary trees, AVL Trees, Introduction to Multi-way Search trees, B-tree.

14

III

Searching and Hashing: Sequential Search, Binary Search, Comparison and Analysis, Hashing Functions, Hash Tables and Collision Resolution Techniques. Sorting: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort, Radix Sort, Shell Sort. Graphs: Terminologies and Representation, Path Matrix, Graph Traversals - DFS and BFS, Shortest Path Problems, Minimum Cost Spanning Trees, Topological Sort.

13

Text Book:

Lipschutz (2006)”Data Structures Schaum’s Outline Series”, TMH 12th Reprint.

Reference Books:

Horowitz and Sahani (2004)”Fundamentals of Data Structures”, W H Freeman & Co. Jean Paul Trembley and Paul G. Sorenson (2007) “An Introduction to Data Structures with

applications”, Tata McGraw Hill 2nd Edition. R. Kruse etal (2004)”Data Structures and Program Design in C”, Pearson Education 2nd Edition.

Outcome: At the end of the course, students will get the knowledge of various and appropriate data structure to store the data and solving the computational problems.





27

MMCCAA33000033:: DDAATTAABBAASSEE MMAANNAAGGEEMMEENNTT SSYYSSTTEEMM

Prerequisite: Students need to be familiar with entity relationship approach and database languages.

Module No.

Content Teaching

Hours

I

Introduction: An Overview of Database Management System, Database System vs File System, Data Models Schema and Instances, Data Independence and Data Base Language and Interfaces, Database Users, Data Definitions Language, DML, Overall Database Structure. 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, Reduction of an ER Diagrams to Tables, Extended ER Model. Relational Data Model and Language: Relational Data Model Concepts, Integrity Constraints- Entity Integrity, Referential Integrity, Keys Constraints, Domain Constraints. Basic Structure of Oracle System: Introduction to SQL, Data Types and Literals, Types of SQL Commands - DDL and DML Command.

13

II

Relational Model Concepts: Basic Relational Algebra Operation, Additional Relational, Algebra Operation, Relational Calculus. Data Base Design & Normalization: Functional Dependencies, Different Normal Forms, BCNF, Loss Less Join Decompositions, MVD, and JDs, Alternative Approaches to Database Design. Restricting and Sorting Data , Tables, Views and Indexes, Queries and Sub Queries, Aggregating Data using Group Functions, SQL Function. PL/SQL: Cursors in SQL, Procedures, Functions and Triggers.

14

III

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. Concurrency Control Techniques: Concurrency Control, Locking Techniques for Concurrency Control, Time Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple Granularity, Multi-Version Schemes, Recovery with Concurrent Transaction. Transaction Processing in Distributed System, Data Fragmentation. Replication and Allocation Techniques for Distributed System, Overview of Concurrency Control and Recovery in Distributed Database.

13

Text Book:

Elmasri and Navathe (2010) “Fudamentals of Database Systems”, Addision Wesley, 6th Edition.

Reference Books:

Date C J (1993)”An Introduction to Database Systems”, Addision Wesley, 8th Edition. Korth, Silbertz and Sudarshan (1998)”Database Concepts”, McGraw Hill, 5th Edition. Bipin C. Desai (2008)”An Introduction to Database Systems”, Gagotia Publications. Majumdar and Bhattacharya (2002)”Database Management System”, TMH.

Outcome:

After completion of the course students will have a solid foundation in the design and

implementation of database applications on a variety of today's most commonly used platforms

Credits: 04 L–T–P : 3–1–0 Semester III




28

MMCCAA33000044:: SSOOFFTTWWAARREE EENNGGIINNEEEERRIINNGG Prerequisite: Students need to be familiar with the basic concepts of Programming principle and Concept

of various type of software.

Module

No. Content

Teaching Hours

I

Introductory Concepts – The Evolving Role of Software, Its Characteristics, Components and Applications, A Layered Technology, Software Process, SDLC. Process Models: Water Fall Model, Prototyping, Incremental, Spiral, RAD, Formal Methods Model Time boxing Model and Comparison of Models. Software Requirement Specification-Requirement Process, SRS Components, Requirement Specifications with Use C, Requirement Validations. Project Management and Planning Concepts: Project Management Concepts- Project Scheduling and Staffing, Project planning objectives – Project Estimation Methods–Decomposition Techniques, Empirical Estimation models – COCOMO Model.

13

II

Function-Oriented Design: Problem Partitioning, Abstraction, Top Down and Bottom Up Design. Module-Level Concepts: Coupling, Cohesion, Design Notation and Specification- Structure Charts, Structured Design Methodology- Data Flow Diagram. OO Analysis and OO Design: OO Concepts-Classes and Objects, Relationships Among Objects, Inheritance and Polymorphism, Introduction to UML Design Patterns. Design Verifications: Design Walkthroughs, Critical Design Review, Consistency Checkers, Metrics- Size, Function Points. Software Configuration Management: Version Control and Change Management. Risk Management: Risk Mitigation, Monitoring, and Management.

14

III

Coding: Coding Process, Verification - Code Inspections, Static Analysis, Proving Correctness, Metrics- Size Measures and Complexity Metrics. Testing Fundamentals Test case design - Black Box Testing and White box testing, Levels of testing. Software Reliability and Quality Assurance: Reliability Issues, Metrics Reliability Metrics, Reliability Growth Modeling, Software Quality, ISO 9000 Certification for Software Industry, SEI Capability Maturity Model. Advanced Topics in Software Engineering: Clean-Room Software Engineering, Reengineering, Reverse Engineering, Engineering of Component-Based Systems, Web Engineering, Computer Aided Software Engineering.

13

Text Book:

R. S. Pressman,(2010) “Software Engineering – A practitioner’s approach”, 7th Edition, McGraw Hill Int. Ed .

Reference Books:

K.K. Aggarwal & Yogesh Singh,(2003) “Software Engineering”, 3rd Edition New Age International Publisher.

P. Jalote, (2004) “An Integrated approach to Software Engineering”, Narosa 3rd edition . James Peter, W Pedrycz, (2004) “Software Engineering”, John Wiley & Sons 4th edition .

Outcome:

At the end of the course, students will be able to design experiment with software prototype and to select and use software metric.





29

MMCCAA33000055:: OOPPEERRAATTIINNGG SSYYSSTTEEMM

Prerequisite: Students need to be familiar with the basic concepts of Programming, Computer Organization

and Microprocessor Architecture.

Module No.

Content Teaching

Hours

I

Introduction: Operating System and Functions, Classification of Operating Systems- Batch, Interactive, Multiprogramming Time Sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multithreaded Systems, Operating System Structure- Layered Structure, Reentrant Kernels, Monolithic and Microkernel Systems, System Components, Operating System Services. Processes: Process Concept, Process States, Process Transition Diagram, Process Control Block (PCB), Principle of Concurrency, Producer/Consumer Problem, Inter Process Communication Models and Schemes, Process Generation, Threads and their Management.

13

II

CPU Scheduling: Scheduling Concepts, Schedulers, Performance Criteria, Scheduling Algorithms, Multiprocessor Scheduling. Process Synchronization: Mutual Exclusion, Critical Section Problem, Dekker’s Solution, Peterson’s Solution, Semaphores, Test and Set Operation, Classical Problem in Concurrency- Dining Philosopher Problem, Readers Writers Problem, Sleeping Barber Problem. Deadlock: System model, Deadlock Characterization, Prevention, Avoidance and Detection, Recovery from Deadlock, Combined Approach.

14

III

Memory Management: Basic Bare Machine, Resident Monitor, Multiprogramming with Fixed Partitions, Multiprogramming with Variable Partitions, Paging, Segmentation, Paged Segmentation, Virtual memory Concepts, Demand Paging, Performance of Demand Paging, Page Replacement Algorithms, Thrashing, Cache Memory Organization, Locality of Reference. I/O Management and Disk Scheduling: I/O Devices, I/O Subsystems, I/O Buffering, Disk Storage and Disk Scheduling, RAID. File System: File Concept, File Organization and Access Mechanism, File Directories, and File Sharing, File System Implementation Issues, File System Protection and Security.

13

Text Book:

Silberschatz, Galvin and Gagne (2005) “Operating Systems Concepts”, Wiley, 7th edition.

Reference Books:

Sibsankar Halder and Alex A Aravind (2009)”Operating Systems”, Pearson Education, 6th Edition. Harvey M Dietel (2002)”An Introduction to Operating System”, Pearson Education, 2nd Edition. D M Dhamdhere (2006) “Operating Systems: A Concept based Approach”, 2nd Edition. M. J. Bach (1986)”Design of the Unix Operating System”, Prentice Hall of India.

Outcome:

At the end of the course, students will be able to point the problems related to process management

and synchronization.





30

AAHHEE33000011:: EETTHHIICCSS && VVAALLUUEESS

Credits: 02 Semester III L–T–P: 2–0–0

Module

No. Content

Teaching

Hours

I

Conceptual Foundations: Foundations of Morality, Professional Ethics, Professional Standards In Engineering Practice, Major Theories Of Ethics and Different Ethical Approaches, Normativity of Science and Technology. Professions And Moral Dilemmas: Contemporary Ethical Issues, Conflict Of Interests, Contracts, Rights And Violations, Consent And Dissent; Privacy And Confidentiality, Consultancy, Allocation Of Burdens And Benefits, Direct And Indirect Responsibility, Patents, Piracy and Clones.

14

II Decision Making : Theoretical Bases, Foundational Values, Greater Welfare Approach, Risk-Benefit Analysis, Right-based Approach, Priority Allocation, Binding Grounds of Decisions, Public Norms and Professional Guidelines.

14

III Social Responsibility: Individual and Collective Responsibility, Corporate Social Responsibility, Justice and Fairness, Beneficence and Safety, Respect for Humanity, Life, and Nature, Sustainable Development.

11

References:

Sandel M. J., Justice: What’s Right Thing To Do? , Penguin Books, 2010




31

MMCCAA33008811:: OOBBJJEECCTT OORRIIEENNTTEEDD PPRROOGGRRAAMMMMIINNGG LLAABB UUSSIINNGG CC++++

Prerequisite: Students need to be familiar with the basic concepts of programming designing.

Outcome:

At the end of the course, students will get the all concepts of object oriented with their

implementation.

Module No.

Content Lab

Hours

I

Programs Based on the Concepts of:

Class and Object, Reference Variable, Use of Scope Resolution Operator,

Default Arguments, Inline Function.


Constructors, Destructors, Friend Function, Object as Parameter, Object

as an Arguments and Keyword Static.


Function Overloading, Operator Overloading and Type Conversion.


Inheritance, Virtual Function, Abstract Class, This Pointer.


File Handling, Exception Handling, Template.

48





32

MMCCAA33008822:: DDAATTAA SSTTRRUUCCTTUURREESS LLAABB

Prerequisite: Students need to be familiar with the basic concepts of programming and algorithm

designing.

Module No.

Content Lab

Hours

I

Write a program to insert the element at given position in an array and display that array.

Write a program to delete the element from given position in an array and display that array.

Write a program to demonstrate various operations (length, copy, append, compare) on strings.

Write a program to demonstrate various operations (reverse, extracting a substring from left, extracting a substring from right, extracting a substring from middle) on strings.

Write a program to demonstrate various operations (create, push, pop , overflow, underflow, peek , display) of STACK using array implementation.

Write a program to demonstrate various operations (create, enqueue, dequeue, overflow, underflow, peek, display) of QUEUE using array implementation.

Write a program to demonstrate various operations (create, enqueue, dequeue, overflow, underflow, peek, display) of CIRCULAR QUEUE using array implementation.

Write a program to solve the problem of Tower of Hanoi by using recursion. Write a program to demonstrate various operations (create, Traversing, searching,

inserting an element at beginning, at end, after a given element, deleting an element from beginning, from end, after a given element) of a linked list.

Write a program to demonstrate various operations (create, Traversing, searching, inserting an element at beginning, at end, after a given element, deleting an element from beginning, from end, after a given element) of a doubly linked list.

Write a program to demonstrate various operations (create, push, pop , overflow, underflow, peek , display) of STACK using linked list.

Write a program to demonstrate various operations (create, enqueue, dequeue, overflow, underflow, peek, display) of QUEUE using linked list.

Write a program for addition of polynomials. Write a program to demonstrate various operations ( create, insert a new node,

search, find smallest element, find largest element, height, number of elements, number of internal nodes, number of external nodes, delete a node) on binary search tree.

Write a program for Preorder Traversal, In-order Traversal and Post-order traversal of a BST.

Write a program for Linear search. Write a program for Binary search. Write a program for Bubble sort. Write a program for Merge sort. Write a program for Insertion sort. Write a program for Selection sort. Write a program for Quick sort. Write a program to illustrate traversal of a graph using Breadth- first search. Write a program to illustrate traversal of a graph using Depth- first search. Write a program for Minimum Spanning Tree. Write a program to find shortest path for given source and destination.

Write a program to find shortest path among all pair of vertices.

48

Outcome:

At the end of the course, students will get the knowledge of various and appropriate data structure

to store the data and solving the computational problems.





33

MMCCAA33008833:: DDAATTAABBAASSEE MMAANNAAGGEEMMEENNTT SSYYSSTTEEMM LLAABB

Prerequisite: Students need to be familiar with entity relationship approach and database languages.

Module No.

Content Lab

Hours

I

Introduction of Data Definition Language (DDL) and Its commands.(Create, Alter, Drop, Rename). Introduction of Data Manipulation Language (DML) and Its Commands (Insert, Update, Delete). Introduction of Transaction Control Language (T.C.L) & Data Control Language(D.C.L.) Creation, altering and dropping of tables and inserting rows into a table (use constraints while creating tables) examples using SELECT command. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP BY, HAVING and Creation and dropping of Views. Queries using Conversion functions (to_char, to_number and to_date), string functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, substr and instr), date functions (Sysdate, next_day, add_months, last_day, months_between, least, greatest, trunc, round, to_char, to_date) To implement concept of Joins in SQL. To implement the concept of sub-queries. Introduction to PL/SQL.

(i) Programs related to Conditional Statements in PL/SQL (ii) Programs related to Cursors.

(iii) Programs related to stored Procedures and Functions (iv) Programs related to Triggers.

48

Outcome:

After completion of the course students will have a solid foundation in the design and

implementation of database applications on a variety of today's most commonly used platforms (e.g.

MS SQL, Oracle, and DB2).

Credits: 02 L–T–P: 0–0–4 Semester II Credits: 02 L–T–P : 0–0–4 Semester III




34

AAHHEE33008811:: SSOOFFTT SSKKIILLLLSS ––II

After having undergone two courses on spoken English namely Spoken English-1 & 2, this

course focuses more on the use of English, specifically in business situations. The course is

based on diverse range of business themes which helps them visualize the expectations out of

an engineer.

Course Objective-

Soft Skills-I program will ensure that the students have a clear understanding of what is

expected and not expected from them. Build confidence and belief in what they are doing and do

not overly doubt themselves. Being aware about learning what they need both in and out of the

classroom.

Reference Books/ Text Books / Cases:

Cook, S. “The Effective Manager( e-book)”, IT Governance Publishing. Lesikar, R. V., & Pettit J. B. “Business Communication: Theory and Application”, New Delhi:

All India Traveller Book Seller. Bhatnagar, Nitin & Mamta Bhatnagar, “Effective Communication and Soft Skills: Strategies

for Success”, New Delhi, Pearson (Dorling Kindersley, India Ltd.) Mohan, Krishan & NP Singh, “Speaking English Effectively”, New Delhi: Macmillan

Publishers India Ltd. Pillalamarri, J. K. ,”Management of Soft Skills “Chennai: Schitech Publications. Rao, M.S. & Ramana, P.S.V., “Soft Skills for Better Employability”, ICFAI University Press.

Module No.

Content Lab

Hours

I

Who Am I and Why Am I Here, Change is the Only Constant, Learning to Learn,

Technology Know–How for a Fresher, Knowledge on Tools, Application

Orientation, Career Management (Journey and Options). 10

II

Business Communication, Service Mindset, Customer Mindset, Myths about

Business, Values in Business, Business Etiquette, Email Etiquette, Telephone

Etiquette, Team Building, Role of a Manager. 10

III Attitude for Success, Role Models, Handling Peer Competition, Building Relationships, Branding Yourself.

10

Credit: 01 L–T–P: 0–0–2 Semester III




35

MMCCAA44000011:: UUNNIIXX && SSHHEELLLL PPRROOGGRRAAMMMMIINNGG Prerequisite: Basic knowledge of operating system concepts.

Module No.

Content Teaching

Hours

I

Introduction: Unix System Organization (The Kernel and the Shell), Files and Directories, Basic Unix Commands, Editors (Vi and Ed). Unix System Administration: File System, Internal Representation of Files, Mounting and Unmounting of File System, System Booting, Shutting Down, Handling User Account, Backup, Recovery, Security, Creating Files, Storage of Files, Disk Related Commands.

13

II

Unix Shell programming: Types of Shells, Shell Metacharacters, Shell Variables, Shell Scripts, Shell Commands, The Environment, Integer Arithmetic and String Manipulation, Special Command Line Characters, Decision Making and Loop Control, Controlling ,Arrays. Functions

14

III

System call for the file system: creat, open, read, write, lseek, change directory and change root, change owner and change mode, stat and fstat, pipe, dup, moutnig and unmounting file system, link, unlink, file system abstractions and maintenance.

Inter Process Communication: Process tracing, system V IPC, network communication, sockets.

13

Text Book:

Sumitabha Das (2007), “UNIX Concepts and Applications”, TMH .

Maurice J. Bach (2004),” The Design of the operating system”, Prentice-Hall.

Reference Books:

S. Prata,(2008)” Advanced UNIX – A Programmer Guide”, BPB Pub. Yashavant Kanetkar, (2004)”Unix Shell Programming”, BPB Pub., I Edition . Vijay Mukhi, (2004)”The C Odyssey” UNIX v 3, BPB Pub. Ken Rosen, (2007)”Unix The Complete Reference” TMH.

Outcome:

After compeletion of this course the student will get knowledge about multi user operating system

with shell programmingand system call with IPC concept.

Credits: 03 L–T–P: 3–0–0 Semester IV




36

MMCCAA44000022:: DDEESSIIGGNN && AANNAALLYYSSIISS OOFF AALLGGOORRIITTHHMM Prerequisite: Basic knowledge of Data Structure.

Module No.

Content Teaching

Hours

I

Algorithms: Analyzing algorithms, Complexity of Algorithms. Growth of functions: Asymptotic Notations, Recurrence Relations and their Solution Methods. Sorting and Order Statistics: Counting, Radix, Bucket sort. Advanced Data Structures: Augmenting Data Structures; B – trees, Binomial Heaps, Fibonacci Heaps; Data Structure for Disjoint Sets.

13

II

Divide and Conquer: Quick Sort, Merge Sort. Greedy Method: Knapsack Problem, Job Sequencing with Deadlines, Activity Selection Problem, Huffman Codes. Dynamic Programming: Chained Matrix Multiplications, Longest Common Subsequence (LCS), 0/1 Knapsack. Backtracking: 8 – Queens Problem, Graph Coloring. Branch & Bound: TSP Problem. Approximation Algorithms: Vertex & Set Cover Problem.

14

III

Graph Algorithms: Minimum Spanning Trees; Depth First Search, Breadth First Search; Maximum Flow. Single Source Shortest Path Problem: Dijkstra & Bellman Ford Algorithms. String Matching: Naïve, Rabin Karp, Knuth-Morris-Pratt, Automata Matcher. NP-Completeness: Basic Concepts, Nondeterministic Algorithms, NP-Completeness, Examples of NP Complete Problems.

13

Text Book:

G. Brassard and P.Bratley,(2001) “Algorithmics, PHI T.H. Coremen”, et. al, “Introduction to Algorithm”, PHI.

Reference Books:

A. Aho, J. Hopcroft and J. Ullman, (1983) “The design and Analysis of Computer Algorithms”, Addison Wesley.

E. Horowitz and S. Sahani, (2001)”Fundamentals of Computer Algorithms”, Galgotia, New Delhi. S.E. Goodman and S.T. Hedetniemi, (1977)”Introduction to the Design and Analysis of Algorithms”,

McGraw Hill.

Outcome:

After compeletion of this course the student will get knowledge complexity of algorithm, behavior

analysis of algorthim.





37

MMCCAA44000033:: CCOOMMPPUUTTEERR NNEETTWWOORRKKSS Prerequisite: Basic knowledge of fundamental of computer and programming.

Module No.

Content Teaching

Hours

I

Network Edge - Internet - ISPs and Internet Backbones, Use of Computer Networks, Type of Networks, Reference Models- The OSI Reference Model, TCP/IP Reference Model. Physical Layer: Direction of Data Flow, Types of Connections, Topologies, Transmission Media-Guided and Unguided, Modulation, Multiplexing, Circuit Switching. Data Link Layer : Error Detection and Correction ,Parity – LRC,CRC; Hamming code, Flow Control and Error Control, Stop and Wait, Go Back-N ARQ , Selective Repeat ARQ, Sliding Window, LAN - Ethernet IEEE 802.3 - IEEE 802.4 - IEEE 802.5 - IEEE 802.6.

15

II

Medium Access Sub Layer: Static/Dynamic Channel Allocation in LAN’s and MAN’s, Multiple Access Protocols, ALOHA, Carrier Sense, Collision Free Protocols Network Layer: Services of Network Layer, Internetworks – Packet Switching and Datagram Approach , IP Addressing Methods, Subnetting, Routing – Routing Algorithms, Optimality Principle, Shortest Path Routing – Dijkstra, Bellman-Ford Algorithms, Flooding and Broadcasting, Distance Vector Routing, Link State Routing, Hierarchical Routing, Flow Based Routing, Multicasting.

14

III

Transport Layer-: Duties of Transport Layer, User Datagram Protocol (UDP), Transmission Control Protocol (TCP) – Segment Format, Window Management; Congestion Control, Quality of Services (QOS) – Integrated Services. Application Layer: Domain Name Space, SMTP, FTP, HTTP, Telnet, WWW, Security, Cryptography-Substitution and Transposition, Ciphers, Data Encryption Standard (DES), DES Chaining, RSA Algorithm -Public Key Cryptography; Authentication Protocols, Firewall, VPN.

13

Text Book:

A.S. Tanenbaum,(2006) "Computer Networks", Second Ed., Prentice Hall, India.

Reference Books:

Kurose, J.F. and Ross K.W., (2005)"Computer Networking: A Top-Down Approach Featuring the Internet", Third Edition, Addison-Wesley.

Forouzan B A.,(2004) "Data Communication and Networking", Third Edition, McGrawHill.

Outcome:

After compeletion of this course the student will get knowledge to understand the termilogy and

concept of OSI reference model and TCP/IP model.


http://www.indiastudychannel.com/resources/35389-CS-COMPUTER-NETWORKS-Syllabus-Anna.aspx




38

MMCCAA44000044:: IINNTTEERRNNEETT && JJAAVVAA PPRROOGGRRAAMMMMIINNGG Prerequisite: Basic knowledge of object oriented concepts and programming.

Module No.

Content Teaching

Hours

I

Introduction To Web :Client Server Architecture/Computing, Internet & It’s Applications, Search Engines, Web Protocols, Web Project Development-Target Users, Web Team, Planning & Process Development. Java Fundamentals: Introduction to Java, Features, Objects, Methods & Classes, Constructors, Abstract Classes, Polymorphism.

15

II

Object Implementation: Inheritance, Packages and Interfaces, Exception Handling, Multithreaded Architecture and Thread Control Methods, I/O, String Handling, Introduction to Wrapper Classes & Generic Class, Collection Framework. GUI Programming: Java Applet, Graphics & Animations, Controlling Animations Through Threads, Introduction to AWT Programming, Basic UI Components, Layout and Component Managers, Event Handling, Swing Components –Creating a Swing Applet and Application.

14

III

JDBC: Types of Drivers, The Connectivity Model, JDBC/ODBC Bridge Communicating with Database. Multimedia Experience- Processing Image Using Java, Java Cryptography-Java Security API; Introduction to Java Web Services-Composite Computing Model. Remote Method Invocation: RMI Architecture - Creating RMI Client/ Server Application, Java Beans & Introduction to Enterprise Java Beans, Java Servlets- Servlet Basics, Servlet API .

13

Text Book:

Naughton, Schildt,(2002) “The Complete Reference JAVA2”, TMH.

Reference Books:

Jessica Burdman,(1999) “Collaborative Web Development” Addison Wesley.

Cay Horstmann ,(1997)“ Big Java” , Wiley India Edition.

Loy & Wood,(2002) “Java Swing” O’ reilly.

Bhave & Patekar, (2008)“Programming with Java” Pearson.

Outcome:

After completion of this course the student will get knowledge about object oriented concepts used

in java along with the concepts of Threading, GUI development, Distributed computing.





39

MMCCAA44002211:: IINNFFOORRMMAATTIIOONN RREETTRRIIEEVVAALL SSYYSSTTEEMMSS ((EElleeccttiivvee II))

Prerequisite: Fundamental knowledge of Data structure, Data Base Management system and Web Technology.

Module No.

Content Teaching

Hours

I

Introduction to Information Retrieval: IR basic concepts, Information & Data Retrieval, Applications of IR, Web Search Basics, Web Characteristics & Web Graph, Introduction to Web Structure, Content, Usage Based Retrieval, Search Engines Working Approach ,Web Crawling & Indexing- Crawling Architecture, Crawling Features, Link Analysis, Web Graph, Hubs and Authorities, Page Rank Computation. Basic IR Models: Basic Modeling concepts, Boolean model, Vector Model, Evaluation of IR- Scoring , TF-IDF, Term Weighting, Recall & Precision.

13

II

Retrieving User Behavior from the Web: Uncovering Patterns in Web ,Content & Structure Pattern Mining, Web Usage Mining Architecture-Preprocessing Tasks, Data Cleaning, Transaction Identification, Discovery Techniques on Web Transactions -Path Analysis, Association Rules, Sequential Patterns, Web Usage Mining Components, Integrating Content and Usage Profiles for Personalization, Practical Web Mining Issues and Applications. Parallel &Distributed IR: Parallel & Distributed IR Architecture, Collection partitioning & Clustering- Flat Clustering and Hierarchical Clustering, Multimedia IR Models & languages.

14

III

Text & Query Languages: Query Types, Keyword based querying, Structural

queries, Metadata, Text & markup languages,, Text operations & Document

Preprocessing, Indexing & searching, Inverted files ,Suffix Trees & Suffix Arrays.

Term Vocabulary- Determining the Vocabulary of Terms, Search Structures for

Dictionaries, Wild Card Queries, Designing Parsing and Scoring Functions.

XML Retrieval: Basic XML Concepts, Extracting Data from Text, Text Centric &

Data Centric Retrieval. Vector space model for XML retrieval, Evaluation of XML

retrieval, Web Parsing Techniques- DOM, SAX, Transformation Engines and

Filters, Data Binding.

13

Text Book:

Ricardo Baeza-Yates and Berthier Ribeiro (2011) “Modern Information Retrival” Addison Wesley.

Reference Books: C. Manning, P. Raghavan, and H. Schütze (2008) “Introduction to Information Retrieval”,

Cambridge University Press. Soumen Chakrabarti (2003) “Mining the Web: discovering knowledge from hypertext data, Part 2”,

Morgan Kaufmann. Gordon Linoff and Michael Berry (2001) “Mining the Web: Transforming Customer Data into

Customer Value”, John Wiley & Sons. Jiawei Han, Micheline Kamber (2000) “Data mining: concepts and techniques” Morgan Kaufmman

Publishers. Anthony Scime (2005) “Web mining: applications and techniques”, Idea Group. Bing Liu (2007) “Web data mining: exploring hyperlinks, contents, and usage data”, Springer.

Outcome: Working of information retrieval system and its capabilities for searching information using various searching techniques and formalizing queries for search engine.





40

MMCCAA44002222:: SSOOFFTT CCOOMMPPUUTTIINNGG ((EElleeccttiivvee--II))

Prerequisite: Artificial Intelligence & Expert System.

Text Book:

S. Rajsekaran & G.A. Vijayalakshmi Pai, (2003) “Neural Networks, Fuzzy Logic and Genetic Algorithm: Synthesis and Applications” 4th Edition, Prentice Hall of India.

Reference Books:

Timothy J Ross (2009), "Fuzzy Logic with Engineering Applications",3rd Edition, John Wiley and Sons.

David E. Goldberg (2009), "Genetic Algorithm in Search Optimization and Machine Learning ", Adission-Wesley.

Karray (2009), ”Soft Computing and Intelligent Systems Design: Theory, Tools and Applications”,1st Edition Pearson Education.

Outcome:

By the end of the course a student is expected to: Become able to apply Fuzzy Logic, Genetic Algorithms and Artificial Neural Networks as

computational tools to solve a variety of real world problems in their area of interest ranging from

Optimization problems to Pattern recognition and control tasks.

Module No.

Content Teaching

Hours

I.

Neural Networks :Introduction to Soft Computing & Neural Computing, Fundamentals of Artificial Neural Network(ANN), Models of ANN, Architectures of ANN(Feed forward and Feedback or Recurrent N/W), Learning Methods in ANN, Taxonomy of ANN System, Single Layer Perceptron, Linearly Separable Task and XOR Problem, Introduction to Error Back Propagation Network(EBPN), Back Propagation Learning, Error Back Propagation Learning Algorithm, Associative Memory, Auto Associative Memory, Bidirectional Hetro-Associative Memory, Adaptive Resonance Theory, Applications of Neural Network, ADALINE, MADALINE Network, Rosenblatt’s Perception.

13

II.

Fuzzy Logic: Introduction to Fuzzy Sets & Crisp Sets, Fuzzy Membership and Fuzzy Operations, Properties of Fuzzy sets, Crisp Relations and Fuzzy Relations, Fuzzy System, Crisp Logic, Propositional Logic and its Laws, Inference in Propositional Logic (Modus Ponens, Modus Tollens and Chain Rule), Fuzzy Logic, Inference in Fuzzy Logic(GMP and GMT), Fuzzy Rule Based System, Fuzzyfications & Defuzzificataions, Applications of Fuzzy Logic.

14

III.

Genetic Algorithm(GA):Introduction to GA, Search Optimization Method, Evolutionary Algorithm Working Principle, Biological Background of GA, Working Principles of GA, Flow Chart of Genetic Programming, Encoding(Binary, Value, Permutation, Tree), Operators of GA(Random Population, Reproduction or Selection), Crossover and Mutation, Basics of Genetic Algorithm with Example for Maximize f(x)=x2.

13

Credits: 03 L–T–P : 3–0–0 Semester IV




41

MMCCAA44002233:: DDIIGGIITTAALL IIMMAAGGEE PPRROOCCEESSSSIINNGG ((EElleeccttiivvee II))

Prerequisite: This course requires basic knowledge of Discrete mathematics.

Module No.

Content Teaching

Hours

I

Introduction and Fundamentals: Motivation and Perspective, Applications, Components of Image Processing System, Element of Visual Perception, A Simple Image Model, Sampling and Quantization, Some Basic Relationships between Pixels, An Introduction to the Color Image Model. Intensity Transformations and Spatial Filtering: Introduction, Some Basic Intensity Transformation Functions, Histogram Processing, Histogram Equalization, Histogram Specification, Local Enhancement, Enhancement using Arithmetic/Logic Operations – Image Subtraction, Image Averaging, Basics of Spatial Filtering, Smoothing - Mean filter, Ordered Statistic Filter, Sharpening – The Laplacian.

13

II

Filtering in the Frequency Domain: Fourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain, Image Smoothing Using Frequency Domain Filters, Image Sharpening Using Frequency Domain Filters, Selective Filtering. Morphological Image Processing: Introduction, Logic Operations involving Binary Images, Dilation and Erosion, Opening and Closing, The Hit-or-Miss Transformation, Morphological Algorithms – Boundary Extraction, Region Filling, Extraction of Connected Components, Convex Hull, Thinning, Thickening.

14

III

Image Segmentation: Introduction, Point, Detection of Isolated Points, Line Detection, Edge Models, Basic Edge Detection, Cannay Edge Detection, Edge Linking and Boundary Detection (Hough Transform), Thresholding, Region-Based Segmentation. Representation and Description: Representation- Boundary (Border) Following, Chain Codes, Polygonal Approximations Using Minimum-Perimeter Polygons, Signatures, Boundary Descriptors, Regional Descriptors.

13

Text Book:

R.C.Gonzalez and R.E.Woods (2008), “Digital Image Processing”, 3rd Edition, Prentice Hall.

Reference Books:

Anil K. Jain (1989). “Fundamentals of Digital Image Processing”, Prentice-Hall. Bhabatosh Chanda, D. Dutta Majumder (2011). “Digital Image Processing and Analysis”, PHI.

Outcome:

Sound understanding of digital image processing concepts viz-a-viz image acquisition, perception,

transformations, enhancement, analysis etc.





42

MMCCAA44002244:: MMAANNAAGGEEMMEENNTT IINNFFOORRMMAATTIIOONN SSYYSSTTEEMM ((EElleeccttiivvee II))

Prerequisite: Fundamental Understanding of Software Engineering.

Module No.

Content Teaching

Hours

I

System Concept: Definition of Systems, Components of System, Types of System, Concept of Data and Information. Information Systems: Definition of Information System, Classification of Information System, Operation Support System, Management Support System, Importance of Management Information System. Management Support System and Classifications: Management Information System, Decision Support Systems, Executive Information System, Knowledge Management Systems and Expert System.

13

II

Role of Management Information System: Competitive Strategy concept, Value Chain and Strategic IS, Business Process Reengineering, Difference between Business Improvement and BPR Concept of Organizational Planning, The Planning Process. Developing MIS System: System Development Life Cycle, Traditional Approach and Prototyping Approach, Feasibility Analysis, System Analysis, System Design.

13

III

Developing MIS System: System Implementation, Testing, Documentation, Training, Conversion & Maintenance. Applications: Enterprise Resource Planning, Supply Chain Management, Procurement Management Customer Relationship Management. Security & Ethical Challenges of IT. Ethical Responsibilities –Business Ethics, Technology Ethics.

14

Text Books:

O’Brien (2007) “Management Information System. 8th Edition”; Tata McGraw-Hill Publication.

Reference Books:

Laudon & Laudon (2007) “Business Information System”. 9th Edition. Tata McGraw-Hill

Publication.

Jawedkar, S. (2007) “Management Information System”. 3rd Edition. Tata McGraw-Hill

Publication.

David, W. (2008) “Business Data Analysis using Excel”. Oxford Publications.

Outcome:

Provide the fundamentals associated with the management of information technology in a business

enterprise.

Credits: 03 L–T–P: 3–0–0

Semester IV




43

MMCCAA44004411:: DDAATTAA CCOOMMPPRREESSSSIIOONN ((EElleeccttiivvee IIII))

Prerequisite: Basic knowledge of fundamental of computer system.

Module No.

Content Teaching

Hours

I

Introduction: Need For Data Compression, Lossy/ Lossless Compression, Symmetrical Compression And Compression Ratio, Run Length Encoding (RLE) for Text and Image Compression, Relative Encoding and Its Applications in Facsimile Data- Compression and Telemetry, Scalar Quantization. Statistical Methods: Statistical Modeling of Information Source, Coding Redundancy, Variable Size Codes Prefix Codes, Shannon-Fano Coding, Huffman Coding, Adaptive Huffman Coding, Arithmetic Coding a Adaptive Arithmetic Coding, Text Compression Using PPM Method. Dictionary Methods: String Compression, Sliding Window Compression, LZ77, LZ78 and LZW Algorithms and Applications in Text Compression, Zip and Gzip, ARC and Redundancy Code.

13

II

Image Compression: Loss Less Techniques of Image Compression, Gray Codes, Two Dimensional Image Transform, Discrete Cosine Transform and its Application in Lossy Image Compression, Quantization, Zig-Zag Coding Sequences, JPEG and JPEG-LS Compression Standards, Pulse Code Modulation and Differential Pulse Code Modulation Methods of Image Compression, Video Compression and Mpeg Industry Standard. Audio Compression: Digital Audio, Lossy Sound Compression, Mu-Law and A-Law Compounding, DPCM And ADPCM Audio Compression, MPEG Audio Standard, Frequency Domain Coding, Format of Compressed Data.

14

Iii

Conventional Encryption: Security of Information, Security Attacks, Classical Techniques, Caesar Cipher, Block Ciper Principles, Data Encryption Standard, Key Generation for DES, Block Cipher Principle, Design and Modes of Operation, S-Box Design, Triple Des With Two Three Keys, Introduction to International Data Encryption Algorithm, Key Distribution. Number Theory And Public Encryption: Modular Arithmetic, Fermat's and Euler's Theorems, Chinese Remainder Theorem, Discrete Logarithm, Principles of Public Key Cryptosystems, RSA Algorithm, Key Management, Diffie-Hellman Key Exchange, Elliptic Curve Cryptography. Message Authentication: Authentication Requirements and Functions, Message Authentication Codes (MAC), Hash Functions and their Security, Hash and MAC Algorithms, Digital Signatures and Authentication Protocols, Digital Signature Standard and Algorithms.

13

Text Book:

Khalid Sayood, (2000)”Introduction to Data Compression” , Morgan Kaufmann Publication, 2nd Edition.

Reference Books:

David Salomon (2007)”Data compression: The Complete Reference” , Springer Verlag Publication, Volume 10.

Gilbert Held, Thomas R. Marshall, (1991)”Data compression”.

Outcome:

By the end of the course a student is expected to: Become able to understand about compression technique and information security.

Credits: 03

L–T–P: 3–0–0

Semester IV




44

MMCCAA44004422:: EE CCOOMMMMEERRCCEE ((EElleeccttiivvee IIII))

Prerequisite: Basic concepts and understanding of internet and commercial software.

Module No.

Content Teaching

Hours

I

Introduction: Electronic Commerce - Technology and Prospects, Definition of E- Commerce, Economic Potential of Electronic Commerce, Incentives for Engaging in Electronic Commerce, Forces Behind E-Commerce, Advantages and Disadvantages, Architectural Framework, Impact of E-commerce on Business. Network Infrastructure for E- Commerce: Internet and Intranet based E-Commerce, Issues, Problems and Prospects, Network Infrastructure, Network Access Equipments, Broadband Telecommunication (ATM, ISDN, FRAME RELAY).

15

II

Mobile Commerce: Introduction, Wireless Application Protocol, WAP Technology, Mobile Information Device, Mobile Computing Applications. Web Security: Security Issues on Web, Importance of Firewall, Components of Firewall, Transaction Security, Emerging Client Server, Security Threats, Network Security, Factors to Consider in Firewall Design, Limitation of Firewalls.

12

III

Encryption: Encryption Techniques, Symmetric Encryption- Keys and Data Encryption Standard, Triple Encryption; Asymmetric Encryption- Secret Key Encryption, Public and Private Pair Key Encryption; Digital Signatures, Virtual Private Network. Electronic Payments: The SET protocol, Payment Gateway, Certificate, Digital Tokens, Smart Card, Credit Card, Magnetic Strip Card, E-Checks, Credit/Debit Card Based EPS, Online Banking, EDI Application in Business, E- Commerce Law, Forms of Agreement, Govt. Policies and Agenda.

13

Text Book:

Ravi Kalakota,(2004)Andrew Winston, “Frontiers of Electronic Commerce”, Addison Wesley.

Reference Books:

Bajaj and Nag,(2005) “E-Commerce the Cutting Edge of Business”, TMH. P. Loshin, John Vacca, “Electronic Commerce”, Firewall Media, New Delhi.

Outcome: Understanding of Ecommerce model and transactions on Ecommerce.

Credits: 03 L–T–P: 3–0–0 Semester: IV




45

MMCCAA44004433:: SSEERRVVIICCEE OORRIIEENNTTEEDD AARRCCHHIITTEECCTTUURREE

((EElleeccttiivvee IIII))

Prerequisite: Fundamental understanding of operating system, distributed system and web technologies,

Knowledge of C# and relational database is desirable, basic knowledge of XML, WSDL.

Module No.

Content Teaching

Hours

I

Introduction: Roots of SOA, Characteristics of SOA, Comparing SOA to Client Server and Distributed Internet Architectures, Anatomy of SOA, How Components in an SOA Interrelate, Principles of Service Orientation, Web Services, Service Descriptions, Messaging with SOAP, Message Exchange Patterns Coordination, Atomic Transactions, Business Activities, Orchestration, Choreography, Service Layer Abstraction, Application Service Layer, Business Service Layer, Orchestration Service Layer.

15

II

Service Oriented Analysis: Business Centric SOA, Deriving Business Services, Service Modeling, Service Oriented Design, WSDL Basics, SOAP Basics – SOA Composition, Guidelines – Entity, Centric Business Service Design, Application Service Design, Task Centric Business Service Design, SOA Platform Basics, SOA Support in J2EE, Java API for XML Based Web Services, (JAX,WS), Java Architecture for XML Binding (JAXB), Java API for XML Registries (JAXR) , Java API for XML Based RPC (JAX,RPC).

14

III

Web Services Interoperability Technologies (WSIT): SOA Support in .NET, Common Language Runtime, ASP.NET Web Forms, ASP.NET Web Services, Web Services Enhancements (WSE), WS, BPEL Basics, WS Coordination Overview, WS Choreography, WS Policy, WS Security.

11

Text Book:

Thomas Erl (2005), “SOA Principles of Service Design”, The Prentice Hall Service Oriented Computing Series from Thomas Erl.

Reference Books:

Newcomer, Lomow (2005) “Understanding SOA with Web Services”, Pearson Education. Sandeep Chatterjee, James Webber (2005) “Developing Enterprise Web Services, An Architect’s Guide”,

Pearson Education. Dan Woods and Thomas Mattern (2006) “Enterprise SOA Designing IT for Business Innovation”

O’REILLY, First Edition.

Outcome:

To solve and develop program logic for Web Service systems. Understanding of how SOA systems differ from traditional non-distributed systems. Understand how distributed systems are evolving and how that may change the way business is

conducted in the future.

Understand the impact of SOA on software quality, efficiency, security, performance and flexibility.





46

MMCCAA44004444:: MMOOBBIILLEE AAPPPPLLIICCAATTIIOONN DDEEVVEELLOOPPMMEENNTT

((EElleeccttiivvee IIII))

Prerequisite :Exposure to Java (J2SE) and basic RDBMS

Module No.

Content Teaching

Hours

I

Preliminaries - Introduction & need for Mobile Apps development, Example, Mobility concept, Mobile structure and characetrstics. Getting started with Mobility - Mobility landscape, Mobile platforms, Mobile apps development, Overview of Android platform, setting up the mobile app development environment along with an emulator, a case study on Mobile app development Building blocks of mobile apps - App user interface designing – mobile UI resources (Layout, UI elements, Draw-able, Menu), Activity- states and life cycle, interaction amongst activities.

14

II

App functionality beyond user interface - Threads, Async task, Services – states and life cycle, Notifications, Broadcast receivers, Telephony and SMS APIs Native data handling – on-device file I/O, shared preferences, mobile databases such as SQLite, and enterprise data access (via Internet/Intranet) Taking apps to Market - Versioning, signing and packaging mobile apps, distributing apps on mobile market place.

13

III

Sprucing up mobile apps - Graphics and animation – custom views, canvas, animation APIs, multimedia – audio/video playback and record, location awareness, and native hardware access (sensors such as accelerometer and gyroscope) Testing mobile apps - Debugging mobile apps, White box testing, Black box testing, and test automation of mobile apps, JUnit for Android, Robotium, MonkeyTalk Current trens in Mobile Apps development.

13

References:

Barry Burd, Android Application Development All in one for Dummies, Edition: I Teach Yourself Android Application Development In 24 Hours, Edition: I, Publication: SAMS

Outcome:

At the end of this course, student shall be able to: Appreciate the Mobility landscape Familiarize with Mobile apps development aspects Design and develop mobile apps, using Android as development platform, with key focus on user

experience design, native data handling and background tasks and notifications. Appreciation of nuances such as native hardware play, location awareness, graphics, and

multimedia. Perform testing, signing, packaging and distribution of mobile apps





47

MMCCAA44008811:: UUNNIIXX && SSHHEELLLL PPRROOGGRRAAMMMMIINNGG LLAABB

Module No.

Content Lab

Hours

I

Objective: To teach students various unix/linux utilities and shell scripting. Commands

Unix/linux basic commands. vi editor commands

Shell Scripts Write a shell script that print out the date information in the following

order, time, date of week, day, month, year. Write a shell script that tells you its name and its PID. Write a shell script that takes three command line arguments. The first

argument is the name of the destination file and other two arguments are the names of files to be placed in the destination file.

Write a shell script that takes the command line argument and report whether it is a directory or a file or something else.

Write a shell script that accept the file name on the command line if the file is readable than count the no. of lines ,words and characters in this file.

Write a shell script to find all login users on your system whose user-id is greater than 200.

Write a shell script to calculate the following series without multiplication.

Write a shell program which displays the number of occurrences of string 2 in string 1.

Write a shell script to find out the length of the input string. Write a shell script to compare two strings input by the user,

System Calls In C

24

Reference Books:

Sumitabh Das (2006). “Unix Concepts and Applications”, 4th Edition, TMH Publication. S. Parata (2008), “Advanced Unix: A Programmer's Guide”, BPB Publication. Yashwant Kanetkar (2009), “Unix Shell Programming”, BPB Publication.

Outcome:

After completing this lab the student will be able to Understand Linux or Unix Operating system. Understand Logging in the system and Create and modify files and use basic file permissions.

Perform basic process and job control. Understand vi text editor. Understand Shell Programming and system programming.





48

MMCCAA44008822:: DDEESSIIGGNN && AANNAALLYYSSIISS OOFF AALLGGOORRIITTHHMMSS LLAABB Prerequisite: Basic knowledge of data structure concepts and programming..

Module No.

Content Lab

Hours

I

Sorting Technique:

Implementation of Insertion sort. Implementation of Merge sort Implementation of Heap sort. Implementation of Counting Sort.

Divide and Conquer Approach:

Implementation of Quick sort. Implementation of merge sort.

Greedy algorithms:

Implementation of Prim’s algorithms for minimum spanning tree Implementation of Kruskal algorithms for minimum spanning tree Implementation of single source shortest path problem using Dijkstra’s

Algorithms & Bellman Ford algorithms Dynamic programming:

Implementation of 0/1 Knapsack problem Back Tracking Approach:

Implementation of 8 queen problem.

24

Outcome:

After completing this lab the student will be able to Understand sorting and searching technique and algorithm concepts.





49

MMCCAA44008833:: JJAAVVAA PPRROOGGRRAAMMMMIINNGG LLAABB Prerequisite: Basic knowledge of object oriented concepts and programming..

Outcome:

After completion of this course students will have an idea aboutJava programming for Application

and Applet along with developing GUI in java and communicating it with databases.

Module No.

Content Lab

Hours

I

Programs Based on the Concepts of: Java Classes, Constructors, Polymorphism And Keyword Static.

Programs Based on the Concepts of: Inheritance Using Java ,Multithreading Using Thread Class and Interface Runnable, String Handling, Generic Classes and Collection API.

Programs Based on the Concepts of: Applet Programming ,Combining Multithreading With Graphics UI Development Using AWT And Swings Handling Events On UI Components.

Handling Database Connectivity With Java. Concepts of Image Processing Using Java . Implementation of Distributed Computing Using RMI.

48





50

MMCCAA44008844:: MMIINNII PPRROOJJEECCTT ––IIII Prerequisite: Sound knowledge of programming concepts.

Module No.

Content Lab

Hours

I

Students are required to develop a real time application project comprising of minimum 3000 LOC on any platform in a modular structure. The project must be based on any of the subject studied till previous semesters and should have a interactive GUI. The development of the project must consist of the following : Project Planning – Schedule and Activity Estimation using MS Project 2000 SRS in IEEE 830-1998 format Process Framework for development Software Design Document as per IEEE-1016 Interfaces Detail and Component Level Design Test Cases development as per the stated Software requirement, which is further to be tested on any CASE tool. In order to obtain creativity, it is required that, the software must have minimal use of library/ library functions of respective language/ package

48

Outcome:


real projects.

Credits: 01 Semester IV L–T–P : 0–0–2




51

AAHHEE44008811:: SSOOFFTT SSKKIILLLLSS ––IIII

Objectives:

To make the students aware of the primary skills and sub skills involved in using English

effectively at the contemporary corporate workplace with a global presence.

To provide practice and guidance to enhance skills to the proficiency level expected by any

organization.

Credit-01 Semester IV L-T-P: 0-0-2

Module

No. Content

Teaching Hours

I

Introduction to English and Grammar. Speaking face to face vs. over the phone. Auxiliary and Modal verbs. 4 Techniques of reading- Skim, Scan, Intensive, Extensive. ABC of writing, The KISS concept. Presenting ideas, information and opinions with clarity. Listening for information and making

Inferences. Intonation, Word stress, Pacing, Sound clarity

10

II

Second level of reading to interpret information Subject Verb Agreement Understanding ideas and making inferences Indianism, Question Tags, Phrasal verbs Prepositions, Active and Passive voice Third level reading and data interpretation Sentence stress, connected speech Tenses

10

III

Adverbs, Adjectives, Modifiers, Collocation Discussing data and coming to conclusions Link expressions, Compound nouns Negotiation skills Business quiz, idioms and phrases Individual presentation on speaking and writing Feedback and Poster creation

10

References:

Hornby, A.S., An Advanced Learners’ Dictionary of Current English, OUP.

Murphy, Raymond, Intermediate English Grammar, Cambridge University Press.

.Rizvi, Ashraf, M. Effective Technical Communication. New Delhi: Tata McGraw Hill. Infosys modules on English lab. PPT slides & videos provided by Infosys.

Material:

Audio-Video Material available in the language Lab.




52

MMCCAA55000011:: WWEEBB TTEECCHHNNOOLLOOGGYY Prerequisite: Internet Architecture and Java Programming Concepts.

Module No.

Content Teaching Hours )

I

Introduction to Client Server Architecture: Components of Client/Server Application, Client Server Models and their Benefits. Server Side Component Architecture, Multitier Architecture, Web Portal Development & Testing. Implementation: HTML- List, Table, Frame, Image, Form and Other Tags with their Usage, Formatting using CSS, DHTML; JavaScript, DOM Basics, Statements, Integrating JavaScript with Various Elements of HTML, XHTML.

13

II

XML: Domain Languages, Comparison with HTML, DTD, CSS, XSL, Content Creation — Entities, Attributes, XML Schema, XML Parsing Techniques; XML and Data Binding-JAXB, Integrating XML with other Applications, XLINK , XPOINTER. Introduction to AJAX and Applications. Distributed Object Computing: ActiveX, COM, & DCOM.

14

III

Web Servers & Application Servers: Web Security, Middleware Standards-CORBA, Enterprise Java Beans and DNA, Web Services and SOA. Server Side Implementation: CGI Background, Overview of PERL, Introduction to ASP, Objects, Components, Connecting with Databases. JSP Architecture, Objects, JSP Directive Elements, Variables & Methods, Sharing Session & Application Data, Introduction to PHP –Basics, Array and Functions.

14

Text Book:

Chris Bates (2007) "Web Programming – Building Internet Application", 2nd Edition, Wiley-

Dreamtech India Pvt. Ltd.

Reference Books:

Holzener, Steven (2001) “Inside XM”, Techmedia publication.

Bergstan, Hans (2004) “Java Server Pages” ,O’Reilly Publication.

Nicholas C. Zakas (2011) “Professional JavaScript for Web Developers”, Wiley Publication.

Leon Shklar, Rich Rosen (2009) “Web Application Architecture: Principles, Protocols and

Practices”, 2nd Edition Wiley Publication.

Burdman, Jessica (2000) “Collaborative Web Development”, Addison Wesley.

Outcome: Web based applications development and deployment on web server. Operational knowledge of middleware technologies and security issues related to web.

Credits: 03 L–T–P: 3–0–0 Semester V

http://www.indiastudychannel.com/resources/120845-Syllabus-UPTU-M-C-A-nd-yr-Semester-IV.aspx

http://as.wiley.com/WileyCDA/WileyTitle/productCd-EHEP001034.html






53

MMCCAA55000022:: DDIISSTTRRIIBBUUTTEEDD SSYYSSTTEEMMSS

Prerequisite: Basic concepts and understanding of the courses like Operating systems, Data communication

and Computer Network.

Module No.

Content Teaching

Hours

I

Introduction: Introduction to Distributed Systems and Design Issues Related to Distributed System Characteristics, Examples of Distributed Systems Models. Architectural Fundamentals, Limitation of Distributed System. Logical Clocks- Lamport’s & Vectors Logical Clocks, Causal Ordering of Events. Case Study of Amobea. Distributed Mutual Exclusion: Classification, Requirements, Performance Measurement, Non-Token Based Algorithm & Token Based Algorithm and their Performance.

15

II

Distributed Deadlock: Distributed Deadlock Handling Strategies in Distributed System, Issues in Deadlock Detection, Centralized Deadlock Detection- Ho Ramamurthy Algorithm, Distributed Deadlock Detection- Path Pushing Algorithm and Edge Chasing Algorithm. Agreement Problem: Classification of Agreement Protocols, Byzantine Agreement Problem, Solution to Byzantine Agreement Problem. Communication in Distributed System: Communication Between Distributed Objects, Events and Notifications, Concept of DCOM, Inter Process Communication- RPC, Distributed Objects and Middleware - RMI and CORBA, Case Study-JINI.

12

III

Distributed File System: Issues in Distributed File Systems, Mechanism for Building Distributed File Systems, Case Studies of SUN – NFS, AFS, CODA. Failure Recovery: Failure Recovery in Distributed Systems, Concepts in Backward and Forward Recovery, Recovery in Concurrent Systems. Distributed Share Memory: Design issues in Distributed Shared Memory, Algorithm for Implementation of Distributed Shared Memory. Fault Tolerance: Issues in Fault Tolerance, Commit Protocols-Two Phase Commit Protocols & Three Phase Commit Protocols, Voting Protocols-Static Voting Protocols, Dynamic Voting Protocols- Majority Based & Reassignment Protocols.

13

Text Book:

Coulouris, Dollimore, Kindberg (2011) "Distributed System: Concepts and Design”, Pearson Ed.

Reference Books:

Singhal & Shivaratri (2001) "Advanced Concept in Operating Systems", McGraw Hill. Gerald Tel "Distributed Algorithms", Cambridge University Press. Tannenbaum (2004) “Distributed Operating Systems”, Pearson Education. Tannenbaum (2004) “Distributed Systems: Principles and Paradigms”, Pearson Education.

Outcome:

Understanding of the technical demands and potential solutions for distributed systems that impose high requirements on data storage and transport. A sound understanding of the principles and concepts involved in designing distributed systems and Internet applications Ability to implement a distributed application using Java RMI.

Credits: 04 Semester V L–T–P: 4–0–0




54

MMCCAA55000033:: ..NNEETT FFRRAAMMEEWWOORRKK UUSSIINNGG CC##

Prerequisite: Before attending this course, students must have proficiency in any high level language like C

(MCA 111)/C++, earlier versions of Visual Basic etc. Students must also have familiarity with

concepts of Operating System (MCA 122), Computer Network (MCA 223).

Module No.

Content Teaching

Hours

I

Introduction of Dot Net Frame Work: Introduction, Architecture of Frame work, Common Language Runtime and Architecture, Common Type System, Common Language Specification, The Base Class Library, Just-in-Time Compilation, Garbage Collection. Introduction of C# with Feature: Data Types, Identifiers, Variables & Constants, C# Statements, Object Oriented Concept, Object and Classes, Arrays and Strings, Delegates and Events, Properties and Indexer.

15

II Input Output, Multi-Threading, Networking and Sockets, Unsafe Mode, Generic Classes, Unified Class, Error -handling. Assemblies: Its Feature and Structure, Types of Assembly - Private and Shared.

14

III

Advanced Concepts: Component Based and Web Based Application. Attribute: Built-In Attribute and Custom Attribute, ADO .NET, Web Services, Windows Services. Graphical Device Interface: Vector2D, Typography and Imaging, Anti-Aliasing.

13

Text Books:

Shibi Panikkar and Kumar Sanjeev (2009) “C# with .NET Frame Work”. Firewall Media. Shildt (2010) “C#: The Complete Reference. C#3.0”, Tata McGraw Hill Publication.

Reference Books:

Jeffrey Richter “Applied Microsoft .Net Framework Programming”, Microsoft. Wiley (2011) “Professional C#”, Wrox Publication. Shildt, “C#: The Complete Reference ADO.NET”, Tata McGraw Hill Publication.

Outcome:

The goal of this course is to help students to make learn the Microsoft. NET Framework with C# language. After completing this course students will be able to understand data-driven applications SQL Server and ADO.NET, building stand-alone applications, create web-based distributed applications and develop Real world Application using the .NET Framework, C#.





55

MMCCAA55002211:: DDAATTAA MMIINNIINNGG && WWAARREEHHOOUUSSIINNGG ((EElleeccttiivvee IIIIII))

Prerequisite: Basic concepts and understanding of the courses like Algorithm, Probability, Statistics and

Data structure.

Module No.

Content Teaching

Hours

I

Introduction: Overview, Motivation (For Data Mining), Data Mining-Definition & Functionalities, Data Processing, Form of Data Preprocessing, Data Cleaning: Missing Values, Noisy Data,(Binning, Clustering, Regression, Computer And Human Inspection),Inconsistent Data, Data Integration and Transformation. Data Reduction: Data Cube Aggregation, Dimensionality Reduction, Data Compression, Numerosity Reduction, Clustering, Discretization and Concept Hierarchy Generation. Data Warehousing: Overview, Definition, Delivery Process, Difference Between Database System and Data Warehouse, Multi Dimensional Data Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept Hierarchy, Process Architecture, 3 Tier Architecture, Data Marting, Aggregation, Historical Information, Query Facility, OLAP Function And Tools. OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining Interface, Security, Backup And Recovery, Tuning Data Warehouse, Testing Data Warehouse.

13

II

Concept Description: Definition, Data Generalization, Analytical Characterization, Analysis of Attribute Relevance, Mining Class Comparisons, Statistical Measures in Large Databases, Measuring Central Tendency, Measuring Dispersion of Data, Graph Displays of Basic Statistical Class Description, Mining Association Rules in Large Databases, Association Rule Mining, Mining Single-Dimensional Boolean Association Rules From Transactional Databases– A priori Algorithm, Mining Multilevel Association Rules From Transaction Databases and Mining Multi-Dimensional Association Rules From Relational Databases. Classification And Predictions: What is Classification & Prediction, Issues Regarding Classification and Prediction, Decision Tree, Bayesian Classification, Classification By Back Propagation, Multilayer Feed-Forward Neural Network, Back Propagation Algorithm, Classification Methods Knearest Neighbor Classifiers, Genetic Algorithm.

14

III

Knowledge Discovery, Data Mining Cluster Analysis: Data Types in Cluster Analysis, Categories of Clustering Methods, Partitioning Methods. Hierarchical Clustering- CURE And Chameleon, Density Based Methods-DBSCAN, OPTICS, Grid Based Methods- STING, CLIQUE, Model Based Method –Statistical Approach, Neural Network Approach, Outlier Analysis, Multimedia Data-Mining, Multimedia-Databases, Mining Multimedia Data, Data-Mining And The World Wide Web, Web Data-Mining, Mining And Meta-Data, Data Visualization & Overall Perspective, Data Visualization, Applications of Data-Mining.

13

Text Book: Jiawei Han, Micheline Kamber, (2006)”Data Mining Concepts & Techniques” Elsevier, Second Edition . Reference Books: M.H.Dunham,(2003)”Data Mining:Introductory and Advanced Topics” Pearson Education, First

Edition. Sam Anahory, Dennis Murray, (2009)“Data Warehousing in the Real World : A Practical Guide for

Building Decision Support Systems, 1/e “ Pearson Education, Fourth Edition. Outcome:

Understanding to apply data mining concept, algorithm and approaches for real life application.





56

MMCCAA55002222:: CCLLOOUUDD CCOOMMPPUUTTIINNGG ((EElleeccttiivvee--IIIIII))

Prerequisite: Exposure to any object oriented programming language (such as Java) and basic operational knowledge of any RDBMS (such as MySQL).

Module No.

Content Teaching

Hours

I

Overview of Cloud Computing - Brief history and Evolution of Cloud Computing, Traditional vs. Cloud Computing, Importance of Cloud Computing, Cloud service models (IaaS, PaaS & SaaS). Cloud deployment models (Public, Private, Hybrid and Community Cloud), Benefits and Challenges of Cloud Computing. Working with Private Cloud – Concept of Hypervisor, Basics of virtualization, Virtualization technologies, Server virtualization, VM migration techniques, Role of virtualization in Cloud Computing. Business cases for the need of Cloud computing environment, Concept of Private Cloud, Characteristics of Private Cloud, Private Cloud deployment models, Private Cloud Vendors, Private Cloud Building blocks (Physical Layer, Virtualization Layer, Cloud Management Layer), Virtual Private Cloud. Case study on (one out of CloudStack, OpenStack, Eucalyptus, IBM or Microsoft).

13

II

Working with Public Clouds – Concept of Public Cloud, Importance of Public Cloud, When to opt for Public Cloud, Public Cloud Service Models, and Public Cloud players. Infrastructure as a Service Offerings, IaaS Vendors, PaaS offerings, PaaS vendors, Software as a Service. Implementing public cloud (one out of AWS, Windows Azure, IBM or Rackspace) Overview of Cloud Security - Security concerns in Traditional IT, Challenges in Cloud Computing in terms of Application, Server, and Network Security. Security reference model, Abuse and Nefarious Use of Cloud Computing, Insecure Interfaces and APIs (Malicious Insiders, Shared Technology Issues, Data Loss or Leakage, Account or Service Hijacking, Unknown Risk Profile), Attacks in Cloud Computing, Vendors offering Cloud Security for public and private clouds.

14

III

Overview of Multi-Cloud Management Systems - Explain concept of multi-cloud management, Challenges in managing heterogeneous clouds, benefits of multi-cloud management systems. Case study on Multi-Cloud Management System ( Right Scale Cloud Management System) Business Clouds - Cloud Computing in Business, Various Biz Clouds focused on industry domains (Retail, Banking and Financial sector, Life Sciences, Social networking, Telecom, Education). Cloud Enablers (Business Intelligence on cloud, Big Data Analytics on Cloud), Role of Cloud computing in SCM and CRM. Future directions in Cloud Computing - Future technology trends in Cloud Computing with a focus on Cloud service models, deployment models, cloud applications, and cloud security. Migration paths for cloud, Selection criteria for cloud deployment. Current issues in cloud computing leading to future research directions.

13

Text Book:

Raj Kumar Buyya, James Broberg, Andrezei M.Goscinski (2011), Cloud Computing: Principles and paradigms.

Credits: 03 L–T–P: 3–0–0 Semester VIII




57

Anthony T. Velte, Toby J. Velte, and Robert Elsenpeter (2010) Cloud Computing: A Practical Approach, McGraw Hill.

Reference Books:

Rittinghouse, John, W, Cloud computing: Implementation, management and security. Barrie Sosinsky (2011), Cloud Computing Bible, Wiley. Rhoton, John, Cloud Computing Architected: Solution Design Handbook. Krutz, Ronald L.; Vines, Russell Dean, Cloud Security, A comprehensive Guide to Secure Cloud

Computing.

Outcome:

After successful completion of this Cloud computing, the participant will be able to explain the concepts of

Cloud Computing and the various deployment and service models of Cloud Computing. Describe the Security

concerns of Cloud Computing and the Multi-Cloud management System.




58

MMCCAA55002233:: MMOOBBIILLEE CCOOMMPPUUTTIINNGG ((EElleeccttiivvee IIIIII))

Prerequisite: This course requires basic knowledge of computer network and data base system.

Module No.

Content Teaching

Hours

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

12

II

Data Management: Data Management Issues, Data Replication for Mobile Computers, Adaptive Clustering for Mobile Wireless Networks, File System, Disconnected Operations, Mobile Agents Computing, Security and Fault Tolerance, Transaction Processing in Mobile Computing Environment.

14

III

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.

14

Text Books:

Charles Perkins (2001), “Ad hoc Networks”, Addison Wesley. Raj Kamal (2007) “Mobile Computing”, Oxford University Press.

Reference Books:

J. Schiller (2003) “Mobile Communications”, Addison Wesley. Charles Perkins (1997) “Mobile IP”, Addison Wesley. Upadhyaya (2002) “Mobile Computing”, Springer.

Outcome:

After completion of this course students will have an idea about advance concept of network system

and ad-hoc n/w.





59

MMCCAA55002244:: AAGGIILLEE SSOOFFTTWWAARREE DDEEVVEELLOOPPMMEENNTT ((EElleeccttiivvee IIIIII))

Prerequisite Awareness of basics of software engineering concepts and waterfall methodology and exposure to any object oriented programming language such as Java, C#.

Module No.

Content Teaching

Hours

I

Fundamentals of Agile: The Genesis of Agile, Introduction and background, Agile Manifesto and Principles, Overview of Scrum, Extreme Programming, Feature Driven development, Lean Software Development, Agile project management, Design and development practices in Agile projects, Test Driven Development, Continuous Integration, Refactoring, Pair Programming, Simple Design, User Stories, Agile Testing, Agile Tools Agile Scrum Framework: Introduction to Scrum, Project phases, Agile Estimation, Planning game, Product backlog, Sprint backlog, Iteration planning, User story definition, Characteristics and content of user stories, Acceptance tests and Verifying stories, Project velocity, Burn down chart, Sprint planning and retrospective, Daily scrum, Scrum roles – Product Owner, Scrum Master, Scrum Team, Scrum case study, Tools for Agile project management

14

II

Agile Software Design and Development: Agile design practices, Role of design Principles including Single Responsibility Principle, Open Closed Principle, Liskov Substitution Principle, Interface Segregation Principles, Dependency Inversion Principle in Agile Design, Need and significance of Refactoring, Refactoring Techniques, Continuous Integration, Automated build tools, Version control. Current researches in Agile software development

12

III

Agile Testing: The Agile lifecycle and its impact on testing, Test-Driven Development (TDD), xUnit framework and tools for TDD, Testing user stories - acceptance tests and scenarios, Planning and managing testing cycle, Exploratory testing, Risk based testing, Regression tests, Test Automation, Tools to support the Agile tester Industry Trends: Market scenario and adoption of Agile, Agile ALM, Roles in an Agile project, Agile applicability, Agile in Distributed teams, Business benefits, Challenges in Agile, Risks and Mitigation, Agile projects on Cloud, Balancing Agility with Discipline, Agile rapid development technologies

14

References:

Ken Schawber & Mike Beedle, Agile Software Development with Scrum, Pearson, 2008 Robert C. Martin, Agile Software Development, Principles, Patterns and Practices, Prentice

Hall,2002 Lisa Crispin & Janet Gregory, Agile Testing: A Practical Guide for Testers and Agile Teams,

Addison Wesley, 2008 Alistair Cockburn, Agile Software Development: The Cooperative Game, Addison Wesley, 2006 Mike Cohn , User Stories Applied: For Agile Software, Addison Wesley 2004

Outcome: Understand the background and driving forces for taking an Agile approach to software

development Understand the business value of adopting Agile approaches Understand the Agile development practices Drive development with unit tests using Test Driven Development Apply design principles and refactoring to achieve Agility





60

MMCCAA55004411:: CCRRYYPPTTOOGGRRAAPPHHYY && NNEETTWWOORRKK SSEECCUURRIITTYY ((EElleeccttiivvee IIVV))

Prerequisite: This course requires basic knowledge of computer network .

Module No.

Content Teaching

Hours

I

Introduction to Cryptography: Introduction to Security Attacks, Services And Mechanisms, Introduction to Cryptology, Conventional Encryption Model, Classical Encryption Techniques-Substitution Ciphers & Transposition Ciphers, Cryptanalysis, Stereography, Stream & Block Ciphers. Modern Block Ciphers: Block Ciphers Principles, DES Principal, Strength of DES, Differential & Linear Cryptanalysis of DES, Block Cipher Model of Operation, Triple DES, AES, BLOWFISH,IDEA Encryption & Decryption, Confidentiality Using Conventional Encryption, Traffic Confidentiality, Key Distribution, Random Number Generation.

15

II

Principles of Public Key Cryptography: Principle of Public Key Cryptography, Prime and Relative Prime Numbers, Modular Arithmetic, RSA Algorithm, Security of RSA Key Management. Message Authentication & Hash Function: Authentication Recruitments, Authentications Functions, Message Authentication Codes, Digital Signatures, Authentication Protocols Digital Signatures Standard (DSS), Proof of Digital Signatures Algorithm.

15

III

Electronics Mail Security: Pretty Good Privacy (PGP), S/MIME, IP Security-IP Security Overview, Architecture, Authentication Header; Encapsulating Security Payloads Combining Security Association, Key Management. Web Security: Socket Layer & Transport Layer Security, Secure Electronic Transaction (SET). System Security: Intruders, Viruses and Related Threads, Firewall Design Principles.

12

Text Book:

William Stalling “ Cryptography and networks security: Principles and Practice”, Prentice Hall, New jersey.

Reference Books:

Johannes A Buchmann, “Introduction to cryptography,” Spiringer–verlag. Bruce Schiener, “Applied Cryptography”. Atul Kahate, “Cryptography and Network Security”, TMH.

Outcome:

After completion of this course students will have an idea about advance concept of information

security.





61

MMCCAA55004422:: SSOOFFTTWWAARREE PPRROOJJEECCTT MMAANNAAGGEEMMEENNTT ((EElleeccttiivvee IIVV))

Prerequisite: Basic Understanding of the course likes Software Engineering.

Module

No. Content

Teaching Hours

I

Introduction And Software Project Planning: Project Management (PM) Fundamentals, People, Process, Product, Technology, Need Identification, Vision And Scope of Document, Project Management Cycle, SPM Objectives, Management Spectrum, SPM Framework, Software Project Planning Objectives, Project Plan, Types of Project Plan, Project Elements, Work Breakdown Structure (WBS), Types of WBS, Functions, Activities and Tasks, Team Dynamics, Project Life Cycle and Product Life Cycle, Ways to Organize Personnel, Project Schedule, Scheduling Objectives, Software Project Estimation Models and Methods, Network Diagrams- PERT, CPM; Bar Charts, Milestone Charts, Gantt Charts.

15

II

Project Monitoring and Control: Dimensions of Project Monitoring & Control, Earned Value Analysis, Earned Value Indicators- Budgeted Cost for Work Scheduled (BCWS), Cost Variance (CV), Schedule Variance (SV), Cost Performance Index (CPI), Schedule Performance Index (SPI), Interpretation of Earned Value Indicators, Error Tracking. Software Reviews: Types of Review- Inspections, Deskchecks, Walkthroughs, Code Reviews, Pair Programming. Risk Management: Risks and Risk Types, Risk Breakdown Structure (RBS), Risk Management Process: Risk Identification, Risk Analysis, Risk Planning, Risk Monitoring, Cost Benefit Analysis. Software Project Management Tools: CASE Tools.

12

III

Software Configuration Management: Software Configuration Items and Tasks, Baselines, Plan for Change, Change Control, Change Requests Management, Version Control Testing Objectives, Testing Principles, Test Plans, Test Cases, Types of Testing, Levels of Testing, Test Strategies, Program Correctness, Program Verification & Validation, Testing Automation & Testing Tools, Concept of Software Quality, Software Quality Attributes, Software Quality Metrics and Indicators, Quality Management and ISO 9000 Quality Assurance Method, The SEI Capability Maturity Model CMM),SQA Activities, Formal SQA Approaches- Proof of Correctness.

13

Text Book:

M. Cotterell, "Software Project Management", Tata McGraw-Hill Publication.

Reference Books:

Royce, "Software Project Management", Pearson Education. Kieron Conway, "Software Project Management", Dreamtech Press. S. A. Kelkar, "Software Project Management", PHI Publication. Pankaj Jalote, (2005)Software Project Management in practice, Pearson Education.

Outcome:

After completion of this course students will have an idea Software Project Management

Techniques.





62

MMCCAA55004433:: AARRTTIIFFIICCIIAALL IINNTTEELLLLIIGGEENNCCEE ((EElleeccttiivvee IIVV))

Prerequisite: Basic Understanding of the course likes Discrete Mathematics, Logical Reasoning.

Module No.

Content Teaching

Hours

I

Introduction: Introduction to AI, AI Techniques, Level of Model, Criteria for Success, Turing Test. Problems, Problem Spaces & Search: Defining Problem as a Space, Search, Production System, Problem Characteristics, Production System Characteristics, Issues in the Design of Search Programs. Heuristics Search Strategies: Generate and Test, Hill Climbing, Best First Search (A*), Problem Reduction (AO*), Constraint Satisfaction, Means Ends Analysis.

12

II

Knowledge Representation Issues: Representations and Mappings, Approaches to knowledge Representation, The Frame Problem, Semantic Network, Frame Representation. Using Predicate Logic: Representing Simple Facts in Logic, Representing Instance and is-a Relationship, Computable Functions and Predicates, Resolution, Natural Deduction. Representing Knowledge Using Rules: Procedural Vs Declarative knowledge, Logic Programming, Forward and Backward Searching, Matching knowledge Representation. Game Playing and Search: Introduction, Min-Max algorithm, Alpha-Beta Cut Off, Example of Games.

14

III

Intelligent Systems: Learning Model, Types of Learning, Components of an Expert System, Categories of Expert System, Stages of Development of Expert System, Expert System Development Tools, Overview of Fuzzy Systems, ANN, Swarm Intelligent Systems.

14

Text Book:

E.rich and Knight (2008) “Artificial Intelligence”, McGraw Hill International.

Reference Books:

N.J Nilson (1998) “Principles of artificial Intelligence”, Narosa Publishing House. Peterson (2006) “Artificial Intelligence”, PHI Ltd. R.Forsyth (1989) “Expert systems, Principles and Case Studies”, Chapman and Hill. R.Keller (2010) “Expert system Technology Development and Application”, Yourdon Press.

Outcome:

After completion of this course students will have an idea about soft computing skills and modern

intelligent system.





63

MMCCAA55004444:: BBUUSSIINNEESSSS IINNTTEELLLLIIGGEENNCCEE ((EElleeccttiivvee--IIVV))

Prerequisite: Database Management System (MCA 123).

Module No.

Content Teaching

Hours

I

Introduction to Business Intelligence: Introduction to Digital Data and Its Types – Structured, Semi-Structured and Unstructured, Introduction to OLTP and OLAP (MOLAP, ROLAP, HOLAP), BI Definitions & Concepts, BI Framework, Data Warehousing Concepts and Its Role in BI; BI Infrastructure Components – BI Process, BI Technology, BI Roles & Responsibilities, Business Applications of BI, BI Best Practices.

13

II

Basics of Data Integration (Extraction Transformation Loading): Concepts of Data Integration, Needs and Advantages of using Data Integration, Introduction to Common Data Integration Approaches; Meta Data - Types and Sources, Introduction to Data Quality, Data Profiling Concepts and Applications, Introduction to ETL using Kettle.

13

III

Introduction to Multi-Dimensional Data Modeling: Introduction to Data and Dimension Modeling, Multidimensional Data Model, ER Modeling vs. Multi Dimensional Modeling, Concepts of Dimensions, Facts, Cubes, Attribute, Hierarchies, Star and Snowflake Schema, Introduction to Business Metrics and KPIS, Creating Cubes using Microsoft Excel. Basics of Enterprise Reporting: A Typical Enterprise, Malcolm Bridge - Quality Performance Framework, Balanced Scorecard, Enterprise Dashboard, Balanced Scorecard vs. Enterprise Dashboard, Enterprise Reporting using MS Access / MS Excel, Best Practices in the Design of Enterprise Dashboards.

14

Text Book:

RN Prasad and Seema Acharya (2011), “Fundamentals of Business Analytics”, Wiley India.

Reference Books:

David Loshin (2012), “Business Intelligence”, 2nd Edition, Elsevier Science & Technology. Mike Biere (2010), “Business Intelligence for the Enterprise”, Pearson. IBM (2004), “An Introduction to Building Data Warehouse”, Prentice Hall of India. Larissa Terpeluk Moss & Shaku Atre (2003), “Business Intelligence Roadmap”, Pearson.

Outcome:

At the end of this course, student will be able to Differentiate between Transaction Processing and Analytical applications and describe the need for

business intelligence. Demonstrate understanding of technology and processes associated with business intelligence

framework. Demonstrate understanding of Data warehouse implementation methodology and project life cycle. Given a business scenario, identify the metrics, indicators and make recommendations to achieve the

business goal.

Credits: 03 L–T–P: 3–0–0 Semester VII




64

MMCCAA55008811:: WWEEBB TTEECCHHNNOOLLOOGGYY LLAABB

Prerequisite: Students need to be familiar with the basic concepts of Object oriented programming and

knowledge of Java programming.

Module

No. Content

Lab Hours

I

HTML

Design a profile page consisting of your CV using following HTML

elements: Font, Color-Background & Foreground, Margins, Lists, Links,

Graphics: Image Scaling, Alignments, Text Wrapping B/W images, Table:

Bordering, Image, cell color, cell alignment.

Apply various types of CSS to above experiment.

Design a web form for user registration with some constraints using

javascript.

Program based on javascript functions.

XML

Programs for Internal & External DTD containing student information

and displaying it using CSS.

Design XML DTD containing student information using features of Entity

and attribute.

Design a program to perform searching based on XML file data.

Design a XML parsing program to read Element value from any XML file

using JavaScript.

Design a XML parsing program for data binding and fetching the data in

HTML form.

Design a java program to read data from XML file.

ASP, JSP & PHP

Design a web application in ASP using Request & Response for handling

HTML form components.

Design ASP application demonstrating the use of Application object and

to display the number of times the page has been visited.

Design ASP application demonstrating database connectivity.

Design a website in JSP/PHP for online purchasing.

48

Outcome:

At the end of the course, students will be able to:

Develop web based application. Write clear and effective Server side & Client side script .. Access data using PHP & JSP





65

MMCCAA55008822:: ..NNEETT FFRRAAMMEE WWOORRKK LLAABB

Prerequisite: Students need to be familiar with the basic concepts of programming, such as variables,

expressions, conditionals, loops, etc. While it is preferable for students to have an

understanding of the object-oriented paradigm, it is not essential.

Module No.

Content Lab

Hours

I

Working with OOPS concepts. Code access security with C#. (Properties and Indexers). Working with Delegates and Events on Console. File handling with C#. Working with multiple threads. Using System.Net Web Client to retrieve or upload Data with C#. Client Server Networking with TCP, UDP and Socket. Working with Page and Forms using ASP.NET. Data Base access model (Working with ADO.NET). Creating Web Service and Consume in web based application.

48

Outcome:

At the end of the course, students will be able to:

Explain the principles of object-oriented programming. Write clear and effective C# code. Access data using ADO.NET. Develop web applications using ASP.NET Web Forms. Develop and use ASP.NET Web Services.

.

Credits: 02

L–T–P: 0–0–4 Semester V




66

MMCCAA55008833:: MMIINNII PPRROOJJEECCTT IIIIII Prerequisite: Sound knowledge of programming concepts.

Credits: 02 Semester V L–T–P : 0–0–4

Module No.

Content Lab

Hours

I

Students are required to develop a real time application project comprising of minimum 1000 LOC on any platform in a modular structure. The development of the project must consist of the following : Project Planning – Schedule and Activity Estimation using MS Project 2000 SRS in IEEE 830-1998 format Process Framework for development Software Design Document as per IEEE-1016 Interfaces Detail and Component Level Design Test Cases development as per the stated Software requirement, which is further to be tested on any CASE tool. In order to obtain creativity, it is required that, the software must have minimal use of library/ library functions of respective language/ package

48

Outcome:


real projects.

GGLLLAAA RVUUUNNNIIIVVEEERRSSSIIITTTYYY,,,...

Documents

Transcript of GGLLLAAA RVUUUNNNIIIVVEEERRSSSIIITTTYYY,,,...