114
(An Autonomous Institution Affiliated to VTU) Accredited by NAAC with AGrade Department of Master of Computer Applications THIRD & FOURTH Semester MCA Scheme and Syllabus ACADEMIC YEAR 2016-17

(An Au tono m ous I n stitu tion Af filiated to VT U )newhorizonindia.edu/.../uploads/2018/02/SECOND_YEAR_MCA_SYLL… · THIRD & FOURTH Sem ester MCA Sch em e and Syllabu s A C A

  • Upload
    lenhan

  • View
    215

  • Download
    1

Embed Size (px)

Citation preview

(An Autonomous Institution Affiliated to VTU)

Accredited by NAAC with ‘A’ Grade

Department of Master of Computer Applications

THIRD & FOURTH Semester MCA

Scheme and Syllabus

ACADEMIC YEAR 2016-17

CONTENTS

1. Vision, Mission of the College and Department 3

2. Program Educational Objectives (PEO) , Program Specific Objectives

& PEO to Mission Statement Mapping 4

3. Program Outcomes (PO) with Graduate Attributes 5

4. Mapping of POs with PEOs 6

5. Course Credit Structure 7

SCHEME

6. Scheme of Third Semester MCA 8

7. List of Electives Third Semester 9

8. Scheme of Fourth Semester MCA 10

9. List of Electives Fourth Semester 11

SYLLABUS

10. Syllabus of Third Semester MCA:

a) 16MCA31 OOPs Concepts using JAVA 12

b) 16MCA32 Computer Networks 1 6

c)) 16MCA33X ELECTIVES-1 22

d) 16MCA34X ELECTIVES-2 33

e) 16MCA35X ELECTIVES-3 43

f) 16MCA36 Mini Project using Networks and Java concepts 11. Syllabus of Fourth Semester MCA:

a) 16MCA41 Advanced Java and Enterprises Architecture 57

b) 16MCA42 Design and Analysis of Algorithms 61

c) 16MCA43X ELECTIVES-4 64

d) 16MCA44X ELECTIVES-5 76

e) 16MCA45X ELECTIVES-6 91

f) 16MCA46 Mini Project Using J2EE and JSP 100

g) 16MCA47 Professional Ethics for Software Engineers 101

3

NEW HORIZON COLLEGE OF ENGINEERING

VISION

To emerge as an institute of eminence in the fields of engineering, technology and management in serving the industry and the nation by empowering students

with a high degree of technical, managerial and practical competence.

MISSION

To strengthen the theoretical, practical and ethical dimensions of the learning process by fostering a culture of research and innovation among faculty members

and students.

To encourage long-term interaction between the academia and industry through their involvement in the design of curriculum and its hands-on implementation

To strengthen and mould the student in professional, ethical, social and environmental dimensions by encouraging participation in co-curricular and

extracurricular activities.

QUALITY POLICY

To provide services of the highest quality both curricular and co-curricular; so that our students can integrate their skills and serve the industry and society equally

well at a global level.

DEPARTMENT OF MCA

VISION

To be the source in bringing Competent Computing Professionals, Innovators, Researchers, Entrepreneurs and Leaders to serve the Industry,

Nation and Society.

MISSION

To provide world class computer education and cultivating technical skills to meet the challenging global needs and emerging trends in the

industry.

To enable students in acquiring strong academic skills and enhance knowledge towards innovation in research and development.

To inculcate the professional behavior and leadership qualities with ethical responsibilities for the betterment of the society and empower

them to become entrepreneurs.

4

PROGRAM EDUCATIONAL OBJECTIVES (PEOs) PEO 1: To develop the ability to plan, analyze, design, code, test, implement and maintain the software product for real time system s. PEO 2: To excel in problem solving and programming skills in computing fields of IT industries. PEO 3: To practice effectively as individuals and as team members in multidisciplinary projects involving technical, managerial, eco nomical and social constraints. PEO 4: To encourage students capability to set up their own enterprise in various sectors of Computer Applications. PEO 5: To prepare the students to pursue higher studies in computing and related fields and to work in the fields of teaching and re search.

PROGRAM SPECIFIC OUTCOME (PSOs)

PSO1: Understand and apply the computing techniques with mathematics and industrial concepts for solving the real time industrial problems

PSO2: Analyze, design, develop, test, and maintain the software applications with latest computing tools and technologies

PEO to Mission Statement Mapping

Mission Statements PEO1 PEO2 PEO3 PEO4 PEO5 To nurture students with a holistic approach, to inculcate knowledge, expertise and attitude with the ability to think critically, rationally and innovatively.

3 3 3 2 2

To bring awareness in the latest trends in the Industry. To make the student to realize the positive transformations happening in them.

3 3 2 3 2

To impart excellence in the art of education both curricular and co-curricular, as a result of which our students learn to blend technical proficiency and humanity in serving the industry and society equally well at the global level.

3 2 3 3 3

Correlation: 3- High, 2-Medium, 1-Low

5

Program Outcomes (PO) with Graduate Attributes

Graduate Attributes

Program Outcomes (POs)

1

Scholarship of Knowledge

PO1: Understand and apply the fundamental principles of mathematics, science, knowledge of computer science for solving complex problems.

2

Critical Thinking

PO2:Identify, analyze, and formulate the real world requirements in computing d omain for solving problems.

3

Problem Solving

PO3: Design and estimate the computer system components, sub-systems, COTs and appropriate tools for developing solutions for complex problems.

4 Research Skill PO4: Use latest tools and technique needed for hard computing practices

5

Usage of modern tools

PO5: Use right platform on design and execution for performance.

6

Collaborative and Multidisciplinar y work

PO6: Customize and fit the software solutions on society and environment

7

Project Management and Finance

PO7: Work effectively as an individual as well as a member / leader in a team.

8

Communication

PO8: Understand and commit ethical , cyber regulations and management practices in computing field for managing software projects from diverse environments and act accordingly

9

Life-long Learning

PO9: Understand the societal, environmental, health, legal, ethical issues and its impact with respect to computing and professional practice .

10

Ethical Practices and Social Responsibility

PO10: Discover openings and use novel thoughts for creating value and wealth for the betterment of the individual and society

11

Independent and Reflective Learning

PO11: Design, execute and interpret the software with real time data and synthesis the information to reach suitable conclusions. .

6

Mapping of POs To PEOs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11

PEO1 3 2 2 2 2 2 1 1 1 1 1

PEO2 3 3 3 3 2 2 1 2 2 1 3

PEO3 2 3 3 3 3 3 3 3 3 3 3

PEO4 3 3 3 2 3 3 3 3 3 2 1

PEO5 1 2 2 2 3 2 3 3 3 3 3

Correlation: 3- High, 2-Medium, 1-Low

7

Master of Computer Applications

Credit Allocation

Semester I to VI BATCH 2015-18

Semester Core Course Credit

Electives Credits

Project Works

Credits/ Industrial

Internships

Seminar Total Credit Per Semester

1

25

0

0

0

25

2

24

0

3

0

27

3

10

12

3

0

25

4

12

10

3

0

25

5

10

15

3

0

28

6

0

0

18

2

20

Total

81

37

30

2

150

8

New Horizon College of Engineering

Department of Master of Computer Applications

Scheme of Third Semester MCA Program

10

12

3Core Course

Electives

Project

Credit Distribution Across Various Subject Areas

37.5

62.5

Practical

Lecture

Contact Hours per week (Percentage)

15

20

25

20

1010 Remember

Understand ApplyAnalyzeEvaluateCreate

Average Assessmentof various Bloom's levels (%)

S. No

Course Code

Course

Credit Distribution

Overall

Credits

Contact Hours

Weekly

(Theory)

Contact Hours

Weekly

(Lab)

Marks

L P T S CIE SEE Total

1 16MCA31 Object Oriented Programming Concept

Using JAVA 3 2 0 0 5 4 3 75 75 150

2 16MCA32 Computer Networks 3 2 0 0 5 4 3 75 75 150

3

16MCA33 Electives-1 4 0 0 0 4 4 0 50 50 100

4 16MCA34 Electives-2 4 0 0 0 4 4 0 50 50 100

5 16MCA35 Electives-3 3 1 0 0 4 4 2 50 50 100

6 16MCA36 Mini Project using Network concept and

Java 0 3 0 0 3 0 3 50 50 100

TOTAL 25 20 11 350 350 700

9

New Horizon College of Engineering

Department of Master of Computer Applications

Scheme of Fourth Semester MCA Program

S. No Course Code

Course

Credit Distribution

Overall

Credits

Contact Hours

Weekly

(Theory)

Contact Hours

Weekly

(Lab)

Marks

L P T S CIE SEE Total

1 16MCA41 Advanced Java and Enterprises Architecture 3 2 0 0 5 4 3 75 75 150

2 16MCA42 Design and Analysis of Algorithms 3 2 0 0 5 4 3 75 75 150

3 16MCA43 Electives-4 4 0 0 0 4 4 0 50 50 100

4 16MCA44 Electives-5 3 0 0 0 3 4 0 50 50 100

5 16MCA45 Electives-6 3 0 0 0 3 4 0 50 50 100

6 16MCA46 Mini Project using J2EE and JSP 0 3 0 0 3 0 3 50 50 100

7 16MCA47 Professional Ethics for Software Engineers Mandatory Course 2 4 0 25 25 50

TOTAL 25 24 9 375 375 750

10

12

3

Core Course

Electives

Project

Credit Distribution Across Various Subject Areas

37.5

62.5

Practical

Lecture

Contact Hours per week (Percentage)

15

20

25

20

10

10 Remember

Understand

Apply

Analyze

Evaluate

Create

Average Assessmentof various Bloom's levels (%)

10

Third Semester-Electives

Sno Course Code

Course Name Credits*

Electives-1 L P T S Total

1 16MCA331 Computer Graphics 4 0 0 0 4

2 16MCA332 User Interface Design and Human Computer Interaction

4 0 0 0 4

3 16MCA333 Data Warehousing and Data Mining 4 0 0 0 4

4 16MCA334 Management Information System 4 0 0 0 4

5 16MCA335 Digital Image Processing Using MATLAB 4 0 0 0 4

Electives-2

6 16MCA341 Information and Network Security 4 0 0 0 4

7 16MCA342 Unix System Programming 4 0 0 0 4

8 16MCA343 Artificial Intelligence and Expert System 4 0 0 0 4

9 16MCA344 Human Resource Management 4 0 0 0 4

10 16MCA345 Business Communication 4 0 0 0 4

Electives-3

11 16MCA351 Computer based Optimization Techniques 3 1 0 0 4

12 16MCA352 Data Base Management System 3 1 0 0 4

13 16MCA353 Bioinformatics and Computer Application 3 1 0 0 4

14 16MCA354 Big Data Analytics 3 1 0 0 4

15 16MCA355 Probability and Statistics 3 1 0 0 4

*L: Lecture T: Tutorial P: Practical S: Self Study

11

Fourth Semester-Electives

Sno Course Code Course Name *Credits

Electives-4 L P T S Total

1 16MCA431 Mobile Application Using Android 4 0 0 0 4

2 16MCA432 Advanced Web Technology 4 0 0 0 4

3 16MCA433 Software Project Management 4 0 0 0 4

4 16MCA434 Soft Computing 4 0 0 0 4

5 16MCA435 Wireless Sensor Network 4 0 0 0 4

Electives-5

6 16MCA441 Multimedia and Gaming 3 0 0 0 3

7 16MCA442 Cryptography and Ethical Hacking 3 0 0 0 3

8 16MCA443 Decision Support System 3 0 0 0 3

9 16MCA444 Health Care Management and Information Systems

3 0 0 0 3

10 16MCA445 Rich Internet Applications and Internet of Things

3 0 0 0 3

11 16MCA446 Adobe Experience Manager 3 0 0 0 3

Electives-6

12 16MCA451 Service Oriented Architecture 3 0 0 0 3

13 16MCA452 Enterprises Resources Planning 3 0 0 0 3

14 16MCA453 XML and Its Applications 3 0 0 0 3

15 16MCA454 Cloud Computing 3 0 0 0 3

16 16MCA455 Cyber Forensic and Cyber law 3 0 0 0 3

17 16MCA456 VMWare Virtualization 3 0 0 0 3

*L: Lecture T: Tutorial P: Practical S: Self Study

12

THIRD SEMESTER

Object Oriented Programming Concept using JAVA Course Code : 16MCA31 Credits : 05 L:P:T:S : 3:2:0:0 CIE Marks : 50+25 Exam Hours : 3+3 SEE Marks : 50+25 Course Outcomes: At the end of the Course, the Student will be able to:

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 3 2 1 1 - - - - 3 3 -

CO2 3 3 3 2 1 1 - - - - 3 3 -

CO3 3 3 3 2 1 1 - - - - 3 3 -

CO4 3 3 3 2 1 1 - - - - 3 3 -

CO5 3 3 3 2 1 1 - - - - 3 3 -

CO6 3 3 3 2 1 1 - - - - 3 3 -

CO1 Understand about Java Basics as well as advanced and is able to do practical related with real time problems in software development.

CO2 Understand fundamentals of programming such as variables, conditional and iterative execution, methods, etc.

CO3 Understand fundamentals of object-oriented programming in Java, including defining classes, invoking methods, using class libraries, etc.

CO4 Be aware of the important topics about constructor, interface and package.

CO5 Have the ability to write programs relating to Thread, Exception and Enumeration.

CO6 Use Generics, networking and swings with practical example.

13

SYLLABUS

Module Contents of the Module Hours COs

1 INTRODUCTION: The Java Language, The Key Attributes of Object-Oriented Programming, The Java Development Kit, A First Simple Program, Handling Syntax Errors, The Java Keywords, Identifiers in Java, The Java Class Libraries, Java’s Primitive Types, Literals, A Closer Look at Variables, The Scope and Lifetime of Variables, operators Using Cast, Operator Precedence, Expressions. Input characters from the Keyword, if statement, Nested ifs, if-else-if Ladder, Switch Statement, Nested switch statements, for Loop, Enhanced for Loop, While Loop, do-while Loop, Use break, Use continue, Nested Loops CLASS FUNDAMENTALS: How Objects are Created, Reference Variables and Assignment, Methods, Returning from a Method, Returning Value, Using Parameters, Constructors, Parameterized Constructors, The new operator Revisited, Garbage Collection and Finalizers, The this Keyword.

9

CO1

List of Experiments 1. Write a JAVA Program to implement Inner class and

demonstrate its Access protection.

8

2 MORE DATA TYPES AND OPERATORS: Arrays, Multidimensional Arrays, Alternative Array Declaration Syntax, Assigning Array References, Using the Length Member, The For-Each Style for Loop, Strings, The Bitwise operators., String Fundamentals, The String Constructors, Three String-Related Language Features, The Length() Method, Obtaining the characters within a string, String comparison, using indexOf() and lastIndexOf(), Changing the case of characters within a string, StringBuffer and StringBuilder. CONTROLLING ACCESS TO CLASS MEMBERS AND METHOD OVERLOADING: Pass Objects to Methods, How Arguments are passed, Returning Objects, Method Overloading, Overloading Constructors, Recursion, Understanding Static, Introducing Nested and Inner Classes, Varargs: Variable-Length Arguments.

9

CO1

List of Experiments 1. Write a JAVA Program to demonstrate Constructor

Overloading and Method Overloading 2. Write a program in Java for String handling which performs

the following: a) Checks the capacity of StringBuffer objects. b) Reverses the contents of a string given on console and

converts the resultant string in upper case. c) Reads a string from console and appends it to the

resultant string of ii.

8

3 INHERITANCE: Inheritance Basics, Member Access and Inheritance, Constructors and Inheritance, Using super to Call

9 CO3

14

Superclass constructors, Using super to Access Superclass Members, Creating a Multilevel Hierarchy, Superclass References and Subclass Objects, Method Overriding, Overridden Methods support polymorphism, Using Abstract Classes, Using final, The Object Class. INTERFACE FUNDAMENTALS: Creating an Interface, Implementing an Interface, Using Interface References, Implementing Multiple Interfaces, Constants in Interfaces, Nested Interfaces. Package Fundamentals, Packages and Member Access, Importing Packages

List of related Experiments 1. a. Write a JAVA Program to demonstrate Inheritance. b. Simple Program on Java for the implementation of Multiple inheritance using interfaces to calculate the area of a rectangle and triangle. 2. Write a JAVA program using Synchronized Threads, which demonstrates Producer Consumer concept. 3. Complete the following: a. Create a package named shape. b. Create some classes in the package representing some common shapes like Square, Triangle, and Circle. c. Import and compile these classes in other program.

8

4 EXCEPTION HANDLING: The Exception Hierarchy, Exception Handling Fundamentals, The Consequences of an Uncaught Exception, using Multiple catch clauses, Catching subclass Exceptions, try blocks can be nested, Throwing an Exception, A Closer look at Throwable, using finally, using throws Java’s Built-in Exceptions, New Exception features added by JDK 7, Creating Exception Subclasses. Multithreading fundamentals, The Thread Class and Runnable Interface CREATING THREAD: Creating Multiple Threads, Thread Priorities, Synchronization, using Synchronization Methods, The Synchronized Statement, Thread Communication using notify(), wait() and notify All(), Enumerations, Java Enumeration are class types, The Values () and Valueof () Methods, Constructors, methods, instance variables and enumerations, Autoboxing, Annotations (metadata)

9

CO4

List of Experiments 1. Write a JAVA Program to create an enumeration Day of Week with seven values SUNDAY through SATURDAY. Add a method is Workday( ) to the DayofWeek class that returns true if the value on which it is called is MONDAY through FRIDAY. For example, the call DayOfWeek.SUNDAY.isWorkDay ( ) returns false. 2. Write a JAVA program to implement a Queue using user defined Exception Handling (also make use of throw, throws).

8

5 GENERICS: What are Generics?, A simple Generics Example, Generic Methods, Generic Constructors, Applet basics, Applet Initialization and Termination, A key Aspect of an Applet Architecture, Requesting Repainting, using the status window,

9

15

Text Book

1. Java Fundamentals, A comprehensive Introduction by Herbert Schildt and Dale Skrien, Edition 2013, Tata McGraw Hill. 2. JAVA The Complete Reference (Ninth Edition) By - Herbet Schildt, Edition 2014, Tata McGraw Hill. Reference Books

1. Programming with Java by T V Suresh Kumar, B Eshwara Reddy and P Raghavan, 2011, Sanguine Technical Publishers. 2. Programming in JAVA2 by Dr K Somasundaram ,Jaico publications 3. Java Programming by Hari Mohan Pandey, 2012, Pearson Education. 4. Java 2 Essentials, Cay Hortsmann, second edition, Wiley publications.

Assessment Pattern

CIE- Continuous Internal Evaluation (50+25 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50+25 Marks)

Networking fundamentals, The Networking classes and Interfaces, The InetAddress class,The Socket Class, The URL class, The URLConnection Class, The HttpURLConnection Class. COLLECTIONS OVERVIEW: The Collection Interfaces, The origin and Design philosophy of swing, Components and containers, Layout managers,A first simple swing Example, Event Handling, Exploring Swing Controls-JLabel and ImageIcon, The Swing Buttons, Trees.

CO5

List of Experiments 1. Write a JAVA program to print a chessboard pattern. 2. Write a JAVA applet program, which handles keyboard event.

8

Bloom’s Category Tests

Remember 10

Understand 10

Apply 55

Analyze

Evaluate

Create

16

COMPUTER NETWORKS

Course Code : 16MCA32 Credits : 05 L:P:T:S : 3:2:0:0 CIE Marks : 50+25 Exam Hours : 3+3 SEE Marks : 50+25 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To understand the basic concepts of networking devices and architecture.CO2 To understand the various error detection, correction algorithm.

CO3 To understand the problem solving of various situations.

CO4 To understand each layer services and protocols in details

CO5 To learn various congestion control technique

CO6 Understand the difference and behavior of TCP and UDP and various applications

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 1 1 2 1 - - 2 3 3 -

CO2 3 3 2 1 1 2 1 - - 3 3 3 -

CO3 3 3 2 1 1 2 1 - - 1 3 3 -

CO4 3 3 2 1 1 2 1 - - 1 3 3 -

CO5 3 3 2 1 1 2 1 - - 2 3 3 -

CO6 3 3 2 1 1 2 1 - - 3 3 3 -

17

SYLLABUS

Module Contents of the Module Hours COs

1 Introduction to Computer Networks Introduction, need of Computer Networks, Classification of Computer Networks :Local Area Network (LAN) ,Metropolitan Area Network (MAN), Wide Area Network(WAN), Network Protocol Stack ( TCP/IP and ISO-OSI)

Physical Layer

Guided and Wireless transmission, communication media, Digital Modulation techniques and multiplexing (FDMA, TDMA, CDMA) and mobile telephone systems (1G, 2G,3G and 4G).

9

CO1 CO4

List of Experiments (For Illustration purposes Only) 1. Write a TCL script to simulate the network described below Consider a small network with five nodes n0, n1, n2, n3, n4, forming a star topology. The node n4 is at the center. Node n0 is a TCP source, which transmits packets to node n3 (a TCP sink) through the node n4. Node n1 is another traffic source, and sends UDP packets to node n2 through n4. The duration of the simulation time is 10 seconds. 2. Write a TCL script to simulate a file transfer with NS2

8

18

(a)Consider a client and a server. The server is running a FTP application (over TCP). The client sends a request to download a file of size 10 MB from the server. Write a script to simulate this scenario. Let node #0 be the server and node #1 be the client. TCP packet size is 1500 B. Assume typical values for other parameters. (b) To verify that the client has downloaded the entire file, plot the "Bytes Received " curve for Node #1. The y-axis is in Kbits. Convert from MB to bytes . TCP headers would effectively increase the count of received bytes at node # 1.

2 Data Link layer Data Link Layer Design issues, Services provided to Network Layer, Framing, Error Detection and Correction Codes, Data Link Protocols and Sliding window protocols :elementary Data Link Protocol, unrestricted simplex Protocol, Simplex Stop-and-Wait Protocol, Simplex Protocol for a Noisy, ARQ, Go-back-n ARQ Method, Selective-repeat ARQ. Medium Access Sublayer

Multiple access protocols and Examples: ALOHA,Pure ALOHA,Slotted ALOHA Protocol,Ethernet:Carrier Sense Multiple Access (CSMA), Frame format of CSMA,Types of CSMA,CSMA with Collision Detection(CSMA/CD),Wireless LAN, bluetooth, spanning tree

9

CO2 CO3

List of Experiments 1.Setting up a local area network with NS2 (a)In this exercise you will be simulating a CSMA/CD based LAN with ns2. Consider the LAN with seven nodes to be an isolated one i.e. not connected to the Internet. Node # 0 in the LAN act as a UDP traffic source, and node # 6 is the destination node. Assume CBR traffic to be flowing between the nodes. The simulation lasts for 25 seconds. In Ethernet a packet is broadcasted in the shared medium, and only the destination node accepts the packet. Other nodes simply drop it. (b) Suppose the above LAN is to be connected to the Internet. Add node # 7 into the network so that it act as the gateway. Connect node # 0 and # 7 with a 1 Mb wired link. Move the UDP source to node # 7. ( c )verify the hop count for both how it is different.

8

3 Network Layer

Functions of network layer, Network Layer Design issues, Routing algorithms- Dijkstra algorithm, Bellman-ford algorithm, Flood-based routing algorithm, Distance vector routing algorithm, Link-state routing algorithm, Hierarchical routing algorithm, Congestion Control Algorithms, cause of congestion, congestion control methods :Open-Loop Congestion Control, Closed-Loop Congestion. Quality of Service

leakybucket, tokenbucket, load shedding algorithm,

9 CO5

19

Internetworking and The Network Layer in the Internet.

List of related Experiments 1. Simulate a wired network and demonstrate Distance Vector Routing algorithm. 2. Simulating link errors Consider the following network diagram Here node # 2 act as a router. Any traffic to or from the LAN passes through it. Consider node #1 running a FTP server, and node # 5 is downloading a file of size 4 MB. However, the link between node # 2 and # 3 is fault. It drops packets with a fixed probability of 0.2. Implement a link error model to reflect this. It may be noted here that the file download time will be more than the we had in exercise # 2 of experiment # 1.. Verify this from the "Packet Retransmissions" plot.

8

4 Quality of Service

tunneling, Fragmentation versions of IP : IPv4 and IPv6,ARP(Address Resolution Protocol),ICMP(Internet Control Message Protocol). The Transport Layer

Elements of transport protocols, functions of transport layer, connection establishment:Two-Way Handshake, `connection release

The Internet Transport Protocol The Internet Transport Protocols – TCP,UDP

9

CO6 List of Experiments 1. Measuring Network Performances Bottleneck in the network Consider a dumbbell topology with eight nodes as shown as in the following figure. Consider nodes# 2 and 3 to be two routers connecting two different networks. When the bandwidth of the link 2-3 is much lower than the sum of bandwidths of the other links in the network, it act as a bottleneck.

8

20

Assume node # 0 running a FTP application (over TCP) and sending data to node # 6. Node # 1 is sending CBR data node # 7. Assume all the links except 2-3 has a bandwidth of 1 Mb, propagation delay of 10ms and queue type as DropTail. (All are duplex links).

5 The Internet Transport Protocol functionality of TCP and UDP,comparison between UDP and TCP`. The Application Layer Introduction, functions of application layer, DNS, structure of DNS, DNS message format

Examples

Email, email protocols, WWW, WWW architecture, working of WWW, Streaming audio and Video and Content Delivery

9

CO6

List of Experiments 1. Measuring Network Performances Bandwidth sharing between TCP and UDP

Consider the dumbbell topology from our previous exercise: Node # 0 is a TCP source, and the corresponding sink is at node # 6. Node # 1 is a UDP source (CBR traffic) with a null agent attached to node # 7. These two traffic flows through the common link 2-3. The aim of this exercise is to examine how TCP and UDP share the bandwidth between themselves when the rate of CBR traffic is changed. Set the TCP packet size to 1460 B. The UDP and CBR packet sizes are 1500 B. All the links in the network have same bandwidths (say, 4

8

21

Text Books 1. “Computer Networks” by Andrew S Tanenbaum, David J Wetheral, 5th Edition, Pearson 2012 2. “Computer Networks “ by Larry L Peterson ,5th edition. Reference Books 1. “Computer Networks” Principles,Technologies and Protocols for Network Design, by NATALA OLIFER and VICTOR OLIFER , 2010 2. http://www.ietf.org/rfc.html relevant RFC document could be used to get more detailed information about any of the concepts prescribed in the syllabus like RFC 2460 can be referred to get a detailed information about IPV6 3.Data Communication and Networking,Forouzan,4th edition

Assessment Pattern

CIE- Continuous Internal Evaluation (50+25 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

SEE- Semester End Examination (50+25 Marks)

Mb), delay and queue types. (a) Set the initial rate of CBR traffic to 0.5 Mb. Run the simulation, and plot the "Bytes Received" by node #s 4 and 5 (sinks for TCP and UDP traffic) (b) Part 2: Behaviour of UDP Reduce the bandwidth of the link 2-3 to say, 2 Mb. Repeat the above steps and observe the graphs in this case.

Bloom’s Category Tests

Remember 10

Understand 10

Apply 55

Analyze

Evaluate

Create

22

ELECTIVES - 1

Computer Graphics

Course Code 16MCA331 Credits: 04

L:P:T:S 4:0:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To gain knowledge about graphics hardware devices and software used.

CO2 To understand the two dimensional graphics and their transformations.

CO3 To understand the three dimensional graphics and their transformations.

CO4 To apply illumination and color models.

CO5 To be familiar with clipping techniques.

CO6 Able to Solve any simple animation problems.

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 2 1 1 - - 2 2 3 - 3

CO2 3 3 2 2 1 1 - - 2 2 3 - 3

CO3 3 3 2 2 1 1 - - 2 2 3 - 3

CO4 3 3 2 2 1 1 - - 2 2 3 - 3

CO5 3 3 2 2 1 1 - - 2 2 3 - 3

CO6 3 2 2 2 1 1 - - 2 2 3 - 3

Syllabus

Module Contents of the Module Hours Cos

1 INTRODUCTION Survey of computer graphics, Overview of graphics systems – Video display devices, Raster scan systems, Random scan systems, Graphics monitors and Workstations, Input devices, Hard copy Devices, Graphics Software; Output primitives – points and lines, line drawing algorithms, loading the frame buffer, line function; circle and ellipse generating algorithms; Pixel addressing and object geometry, filled area primitives.

9 CO1

2 TWO DIMENSIONAL GRAPHICS Two dimensional geometric transformations – Matrix representations and homogeneous coordinates, composite transformations; Two dimensional viewing – viewing pipeline, viewing coordinate reference frame; widow to viewport coordinate transformation, Two dimensional viewing functions; clipping operations – point, line, and polygon clipping algorithms.

9 CO2

3 THREE DIMENSIONAL GRAPHICS Three dimensional concepts: Three dimensional object representations – Polygon surfaces Polygon tables Plane equations Polygon meshes; Curved Lines and surfaces, Quadratic surfaces; Blobby objects; Spline representations –Bezier curves and surfaces BSpline curves and surfaces. TRANSFORMATION AND VIEWING: Three dimensional geometric and modeling transformations – Translation, Rotation,

9 CO3, CO5

23

Scaling, composite transformations; Three dimensional viewing – viewing pipeline, viewing coordinates, Projections, Clipping; Visible surface detection methods.

4 ILLUMINATION AND COLOUR MODELS Light sources basic illumination models – halftone patterns and dithering techniques; Properties of light Standard primaries and chromaticity diagram; Intuitive colour concepts - RGB colour model YIQ colour model CMY colour model HSV colour model HLS colour model; Colour selection.

9 CO4

5 ANIMATIONS & REALISM ANIMATION GRAPHICS: Design of Animation sequences – animation function – raster animation – key frame systems – motion specification –morphing – tweening. COMPUTER GRAPHICS REALISM : Tiling the plane – Recursively defined curves – Koch curves – C curves –Dragons – space filling curves – fractals – Grammar based models – fractals –turtle graphics – ray tracing.

9 CO6

Text Books: 1. John F. Hughes, Andries Van Dam, Morgan Mc Guire ,David F. Sklar , James D. Foley, Steven K. Feiner and Kurt Akeley ,”Computer Graphics: Principles and Practice”,, 3 rd Edition, AddisonWesley Professional,2013. (UNIT I, II, III, IV). 2. Donald Hearn and Pauline Baker M, “Computer Graphics", Prentice Hall, New Delhi, 2007 (UNIT V).

Reference books: 1. Donald Hearn and M. Pauline Baker, Warren Carithers, “Computer Graphics With Open GL”, 4th Edition, Pearson Education, 2010. 2. Jeffrey McConnell, “Computer Graphics: Theory into Practice”, Jones and Bartlett Publishers, 2006. 3. Hill F S Jr., "Computer Graphics", Maxwell Macmillan” , 1990. 4. Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner, Erik Reinhard, Kelvin Sung, and AK Peters, Fundamental of Computer Graphics, CRC Press, 2010. 5. William M. Newman and Robert F.Sproull, “Principles of Interactive Computer Graphics”, Mc Graw Hill 1978.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

24

USER INTERFACE DESIGN AND HUMAN COMPUTER INTERACTION

Course Code 16MCA332 Credits: 04

L:P:T:S 4:0:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Describe the key principles of user interface design

CO2 To learn development processes, evaluating interface design

CO3 To Describe The Interaction Styles

CO4 To know the concepts of command and natural languages, design issues

CO5 Describe a variety of approaches and design issues

CO6 Be familiar with balancing function and fashion, information visualization

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 2 - - - 2 2 1 2 3 3

CO2 3 3 2 2 - - - 2 2 1 2 - 3

CO3 3 3 2 2 - - - 2 2 1 2 - 3

CO4 3 3 2 2 - - - 2 2 1 2 3 3

CO5 3 3 2 2 - - - 2 2 1 2 - 3

CO6 3 3 2 2 - - - 2 2 1 2 - 3

Syllabus

Module Contents of the Module Hours Cos

1 INTRODUCTION Usability of Interactive Systems: Introduction, Usability Goals and Measures, Usability Motivation, Universal Usability, Goals for our profession. Guideline, principles, and theories: Introduction, Guidelines, principles, Theories.

8 CO1

2 DEVELOPMENT PROCESSES, EVALUATING INTERFACE DESIGN Managing Design Processes: Introduction, Organizational Design to support Usability, The Four Pillars of Design, Development methodologies: Ethnographic Observation, Participatory Design, Scenario Development. Evaluating Interface Design: Introduction, Expert Reviews, Usability Testing and Laboratories, Survey Instruments, Acceptance tests, Evaluation during Active Use, Controlled Psychologically Oriented Experiments.

10 CO2

3 INTERACTION STYLES Direct Manipulation and Virtual Environments: Introduction, Examples of Direct Manipulation, Discussion of direct manipulation, 3D Interfaces, Tele-operation, Virtual and Augmented Reality Menu Selection, Form Filling and Dialog Boxes: Introduction, Task-Related Menu Organization, Single Menus, Combination of Multiple Menus, Content Organization, Fast Movement Through Menus, Data Entry With Menus, Form Filling, Dialog Boxes and Alternatives

9 C02, CO3

25

4 COMMAND AND NATURAL LANGUAGES, DESIGN ISSUES Command and Natural Languages: Introduction, Command-organization functionality strategies and structure, Naming and Abbreviations, Natural Language in computing. Interaction Devices: Introduction, Keyboards and Keypads, Pointing Devices, Speech and Auditory interfaces, Displays-Small and Large Quality of Service: Introduction, Models of Response-Time Impacts, Expectations and Attitudes, User Productivity

8 CO5

5 BALANCING FUNCTION AND FASHION, INFORMATION VISUALIZATION Balancing Function and Fashion: Introduction, Error Messages, Non-anthropomorphic Design, Display design, web page design, Window Design, Color, Information Search and Visualization Multimedia document searches, Advanced filtering and Search Interfaces, Information Visualization: Introduction, Data tyoe by task taxonomy, Challenges for information visualization.

8

CO6

Text Books:

1. Ben Shneiderman, Plaisant, Cohen, Jacobs: Designing the User Interface, 6th Edition, Pearson , Education, 2016

2. Wilber O Galitz: The Essential Guide to User Interface Design- An Introduction to GUI Design, Principles and Techniques, Wiley-Dreamtech India Pvt Ltd, 2012

Reference books:

1. Alan Dix, Janet Finalay, Gregory D AbiwdmRussel Bealel: Human-Computer Interaction, III Edition, Pearson ,Education, 2012. 2. Eberts: User Interface Design, Prentice Hall, 2012

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

26

Data Warehousing and Data Mining

Course Code 16MCA333 Credits: 04

L:P:T:S 4:0:0:0 CIE Marks: 50

Exam Hrs 03 SEE Marks: 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand the architecture of data ware house and construction of data model. To Know quality of data and why data preprocessing is important

CO2 To find frequent pattern with candidate and without candidate elements

CO3 To know about classification techniques and their implementation with real data set

CO4 To learn about clustering algorithm and implementation techniques

CO5 To analyzes anomalies , noise and outlier in the data set with respective different applications

CO6 Apply the knowledge to many disciplines such as AI, Machine Learning, Statistics & Pattern Recognition, Market Basket Analysis, Document Clustering, and Credit Card Fraud Detection, detecting spam email messages based upon the message header & content

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - - 1 - - 1 3 3

CO2 3 3 2 - - - 1 - - 1 3 2

CO3 3 3 2 - - - 1 - - 1 3 2

CO4 3 3 2 - - - 1 - - 1 3 3

CO5 3 3 2 - - - 1 - - 1 3 2

CO6 3 3 2 - - - 1 - - 1 3 2

Syllabus

Module Content of the Module Hours Cos

1

Data Warehouse basic concepts: Basic concepts, Data Warehouse Modeling, Data Cube and OLTP and OLAP, Tools. Data Mining Concepts: What is Data Mining, Motivating Challenges, The Origins of Data Mining, Data Mining Tasks, Types o f D a t a , Data Q u a l i t y , D a t a P r e p r o c e s s i n g , Measures o f S i m i l a r i t y a n d Dissimilarity of data.

9 CO1

2

Association Analysis: Basic Concepts and

Algorithms: Basics of association analysis, Frequent Item set Generation using Apriori

algorithm, Rule Generation;

Alternative methods for frequent item set generation: Compact Representation of Frequent Item sets, Alternative methods for

9 CO1,CO2,CO6

27

generating frequent item sets, FP-Growth

Algorithm and construction of FP-Growth tree.

3

Classification: Preliminaries, General approach to solving Classification Problem, Decision tree I n d u c t i o n , R u l e -Based Classifiers, and Bayesian Classifiers.

Classification Techniques: Neural Network, Genetic Algorithm, Nearest Neighbor Classifiers. Estimating Predictive accuracy of classification methods, Improving accuracy of clarification methods, Evaluation criteria for classification methods.

9 CO1, CO2, CO3,CO6

4

Basic Concepts and Algorithms: Overview, Features of cluster analysis, Types of Data and Computing Distance, Types of Cluster Analysis Methods, Overview of clustering algorithms,

Cluster Analysis: Explains the K-Means, Agglomerative Hierarchical Clustering and DBSCAN algorithms for clustering, an overview of Cluster Evaluation and trends in cluster analysis research.

9 CO1,

CO2,CO4,CO6

5

Anomaly Detection: Preliminaries, statistical approaches, proximity based outlier detection, density based outlier detection, clustering based technique. Trends and Applications of data mining: Telecommunication, Finance, retails, Bioinformatics.

9 CO5,CO6

TEXT BOOKS:

1. Jiawei Han and Micheline Kamber: Data Mining – Concepts and Techniques, 3rd Edition, Morgan Kaufmann, 2011.

2. Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining, 2nd Edition, Pearson Education, 2006.

REFERENCE BOOKS:

1. Alex Berson and Stephen J. Smith: Data Warehousing, Data Mining, and OLAP Computing Mc GrawHill Publisher, 1997.

2. G. K. Gupta, Introduction to Data Mining with Case Studies, 3rd Edition, PHI, New Delhi, 2009.

3. Arun K Pujari, Data Mining Techniques, 2nd Edition, Universities Press, 2009. Assessment Pattern

28

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

29

Management Information Systems

Course Code 16MCA334 Credits: 04

L:P:T:S 4:0:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To describe basic information systems concepts and terminology

CO2 To identify the range and importance of information systems applications in modern organizations

CO3 To understand the strategic importance of various information systems

CO4 To understand and apply the fundamental concepts and theories of information systems management

CO5 To understand in Application perspective

CO6 To understand various roles of MIS

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 2 - - 2 - - 3 3 3

CO2 3 3 2 2 - - 2 - - 3 3 2

CO3 3 3 2 2 - - 2 - - 3 3 2

CO4 3 3 2 2 - - 2 - - 3 3 3

CO5 3 3 2 2 - - 2 - - 3 3 2

CO6 3 3 2 2 - - 2 - - 3 3 2

Syllabus

Module Contents of the Module Hours Cos

1 INFORMATION SYSTEM AND ORGANIZATION Introduction - Matching the Information System Plan to the Organizational Strategic Plan – Identifying Key Organizational Objective and Processes and Developing an Information. System Development – User role in Systems Development Process – Maintainability and Recoverability in System Design.

9 CO1

2 REPRESENTATION AND ANALYSIS OF SYSTEM STRUCTURE Models for Representing Systems: Mathematical, Graphical and Hierarchical (Organization Chart, Tree Diagram) – Information Flow – Process Flow – Methods and Heuristics Decomposition and Aggregation – Information Architecture – Application of System Representation to Case Studies.

9 CO5

3 SYSTEMS, INFORMATION AND DECISION THEORY Information Theory – Information Content and Redundancy – Classification and Compression – Summarizing and Filtering – Inferences and Uncertainty

9 CO2, CO3

30

Information System - Identifying Information needed to Support Decision Making – Human Factors – Problem characteristics and

Information System Capabilities in Decision Making..

4 INFORMATION SYSTEM APPLICATION Transaction Processing Applications – Basic Accounting Application – Applications for Budgeting and Planning – Other use of Information Technology: Automation – Word Processing – Electronic Mail – Evaluation Remote Conferencing and Graphics – System and Selection – Cost Benefit – Centralized versus Decentralized Allocation Mechanism.

9 CO5

5 DEVELOPMENT AND MAINTENANCE OF INFORMATION SYSTEMS Systems analysis and design – System development life cycle – Limitation – End User Development – Managing End Users. Off– the shelf software packages Introduction– Outsourcing –Comparison of different methodologies.

9 CO6

TEXT BOOK: 1. Laudon K.C, Laudon J.P, Brabston M.E, “Management Information Systems - Managing the digital firm”, Pearon Education, 2004. REFERENCE BOOKS: 1. Turban E.F, Potter R.E, “Introduction to Information Technology”; Wiley, 2 004. 2. Jeffrey A.Hoffer, Joey F.George, Joseph S. Valachich, “Modern Systems Analysis and Design”, Third Edition, Prentice Hall, 2002. Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

31

DIGITAL IMAGE PROCESSING USING MATLAB

Course Code : 16MCA335 Credits : 04 L:P:T:S : 4:0:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To experience with the design, implementation and testing of various image processing algorithms

CO2 To understand different modalities and current techniques in image acquisition

CO3 To use the mathematical principles for digital image enhancement (contrast, gradients, noise)

CO4 To analyze how digital images are represented and stored efficiently depending on the desired quality, color depth, dynamics

CO5 To describe and apply the concepts of feature detection and contour finding algorithms.

CO6 To apply image processing operations in MATLAB application

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 2 - - 2 3 3

CO2 3 3 2 - - 1 2 - - 2 3 2

CO3 3 3 2 - - 1 2 - - 2 3 2

CO4 3 3 2 - - 1 2 - - 2 3 3

CO5 3 3 2 - - 1 2 - - 2 3 2

CO6 3 3 2 - - 1 2 - - 2 3 2

Syllabus

Module Contents of the Module Hours Cos

1 Introduction to Digital Image Processing & Applications Digital Image Processing, Examples of Use of Digital Image Processing, Fundamental Steps in Digital Image Processing, Components of an Image Processing System. Basic Relationship Between Pixels & Sampling and Quantization Elements of Visual Perception, Image Sensing and Acquisition, Image Sampling and Quantization. Some Basic Relationships Between Pixels, Linear and Nonlinear Operations.

9 CO1 CO2

2 Image Enhancement Background, Some Basic Gray Level Transformations, Histogram Processing, Enhancement Using Arithmetic/Logic Operations, Basics of Spatial Filtering, Smoothing Spatial Filters, Sharpening Spatial Filters, Combining Spatial Enhancement Methods. Introduction to the Fourier Transform: Fourier Transform and the Frequency Domain, Smoothing Frequency-Domain Filters, Sharpening Frequency Domain Filters, Homomorphic Filtering, Implementation.

9

CO1 CO3

3 Image Restoration and Transforms A Model of the Image Degradation/Restoration Process, Noise Models, Restoration in the Presence of Noise Only-Spatial

9 CO1 CO4

32

Filtering, Periodic Noise Reduction by Frequency Domain Filtering, Linear, Position-Invariant Degradations, Estimating the Degradation Function, Inverse Filtering, Minimum Mean Square Error (Wiener) Filtering, Constrained Least Squares Filtering, Geometric Mean Filter, Geometric Transformations. Discrete Fourier transform, Walsh transform(WT), Hadamard transform, Cosine transform, Haar transform, Wavelet transform. Color Image Processing: Color Fundamentals, Color Models, Pseudocolor Image Processing, Basics of Full-Color Image Processing, Color Transformations, Smoothing and Sharpening.

4 Morphological Image Processing & Segmentation Detection of Discontinuities, Edge linking & Boundary Detection, Thresholding, Region based segmentation, Laplacian of Gaussian, Derivative of Gaussian, Canny Edge Detection. Morphological operation : Dilation erosion, Opening & Closing, Basic Morphological Algorithm, Image representation schemes.

9 CO1 CO5

5 MATLAB Image processing toolbox: Introduction to MATLAB, matrix operations, introduction to image processing tool box. Programming MATLAB: Image read & write, filters (spatial, frequency domain), Image Restoration and Reconstruction, morphological operations, edge detection and linking, segmentation.

9

CO1 CO6

Text Books: 1. Digital Image Processing, Gonzalez & Woods, Third edition, 2008, Pearson Education

Reference books:

1. Digital Image Processing, S. Jayaraman, 1st Edition, 2009, Tata McGraw Hill Publication

2. Fundamentals of Image processing, A.K. Jain, 1st Edition, 2001, Prentice Hall of India Publication

3. Digital Image Processing using MATLAB, Gonzalez, Woods & Steven, Second edition, 2010, Pearson

Education

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

33

ELECTIVES – 2

Information and Network Security

Course Code : 16MCA341 Credits : 04 L:P:T:S : 4:0:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand professional, ethical, legal, security and social issues and responsibilities in computing.

CO2 Understand Security issues and technology.

CO3 Understand cryptography.

CO4 Analyze the network security.

CO5 Analyze Electronic mail security.

CO6 Understanding web security and system security.

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - - 2 2 3 3

CO2 3 3 2 - - 1 - - 2 2 3 2

CO3 3 3 2 - - 1 - - 2 2 3 2

CO4 3 3 2 - - 1 - - 2 2 3 3

CO5 3 3 2 - - 1 - - 2 2 3 2

CO6 3 3 2 - - 1 - - 2 2 3 2

Syllabus

Module Contents of the Module Hours Cos

1 Introduction: Planning for Security: Introduction; Information Security Policy, Standards, and Practices; The Information Security Blue Print; Contingency plan and a model for contingency plan. Security Technology-1: Introduction; Physical design; Firewalls; Protecting Remote Connections

9 CO1, CO2

2 Security Technology – 2: Introduction; Intrusion Detection Systems (IDS);Honey Pots, Honey Nets, and Padded cell systems; Scanning and Analysis Tools Cryptography: Introduction; A short History of Cryptography; Principles of Cryptography; Cryptography Tools; Attacks on Cryptosystems.

9

CO1, CO3

3 Introduction to Network Security:Authentication Applications: Attacks, services, and Mechanisms; Security Attacks; Security Services; A model for Internetwork Security- Internet Standards and RFCs Kerberos, X.509 Directory Authentication Service.

9 CO1, CO4

4 Electronic Mail Security: Pretty Good Privacy (PGP); S/MIME 9 CO1,

34

IP Security: IP Security Overview; IP Security Architecture; Authentication Header; Encapsulating Security Payload; Combining Security Associations; Key Management.

CO5

5 Web Security Web security Considerations; Secure Socket layer (SSL) and Transport layer Security (TLS); Secure Electronic Transaction (SET) System Security Intruders, Intrusion Detection, Firewall Design Principles- Characteristics, Types of Firewall and Firewall Configuration.

9 CO1, CO6

Text Books:

1. William Stallings, “Cryptography and Network Security – Principles and Practices”, 4th Edition, Pearson Education, 2009.

2. Michael E. Whitman and Herbert J. Mattord: Principles of Information Security, 2nd Edition, Cengage Learning, 2005.

Reference books:

1.Behrouz A. Forouzan and DebdeepMukhopadhyay: “Cryptography and Network Security”, 2nd Edition, Tata McGraw-Hill, 2010. 2.AtulKahate, “Cryptography and Network Security” 2nd Edition TMH.

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

35

UNIX SYSTEM PROGRAMING Course Code : 16MCA342 Credits : 04 L:P:T:S : 4:0:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand different standards such as Unix, ANSI C and POSIX standards

CO2 Analyze the types of files and file APIs

CO3 Understand the environment of the process creation

CO4 Applying the functions for memory allocation, process creation & termination

CO5 Understand and apply the APIs for process groups

CO6 Understand the various Signal APIs and inter-process communications

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 1 1 - - 2 1 3 2 3 3

CO2 3 3 1 1 - - 2 1 3 3 3 2

CO3 3 3 1 1 - - 2 1 3 2 3 2

CO4 3 3 1 1 - - 2 1 3 2 3 3

CO5 3 3 1 1 - - 2 1 3 3 3 2

CO6 3 3 1 1 - - 2 1 3 2 3 2

Syllabus

Module Contents of the Module Hours Cos

1 Introduction UNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO C++ Standards, Difference between ANSI C and C++, The POSIX Standards, The POSIX.1 FIPS Standard, The X/Open Standards. UNIX and POSIX APIs: The POSIX APIs, The UNIX and POSIX Development Environment, API Common Characteristics

9 CO1

2 UNIX Files File Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes, Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files, Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic Links. UNIX File APIs General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs

9 CO2

3 UNIX Processes The Environment of a UNIX Process: Introduction, main function, Process Termination, Command-Line Arguments, Environment List Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit, setrlimit Functions, UNIX Kernel Support for Processes.

9 CO3, CO4

4 Process Control: Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, waited, wait3, wait4 Functions, Race

9 CO4, CO5

36

Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system Function, Process Accounting, User Identification, Process Times Process Relationships: Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp, tcsetpgrp, and tcgetsid Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups.

5 Signals and Daemon Processes Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The SIGCHLD Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interval Timers, POSIX.lb Timers. Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Single- instance daemons; Daemon conventions; Client-Server Model. Interprocess Communication: Introduction, Pipes, popen, pclose Functions; Coprocesses; FIFOs; XSI IPC; Message Queues; Semaphores

9 CO6

Text Books: 1. Terrence Chan: Unix System Programming Using C++, Prentice-Hall of India /

Pearson Education, 1999. 2. W.Richard Stevens, Stephen A. Rago: Advanced Programming in the UNIX

Environment, 2nd Edition, Pearson Education / Prentice-Hall of India, 2005 Reference books:

1. Stephen R. Bourne,Wiley, The Unix V Environment, 1987, ISBN 0 201 18484 2 2. Kay A. Robbins and Steven Robbins , ”UNIX Systems Programming: Communication, Concurrency, and Threads”, PRENTICE HALL, ISBN: 0-13-042411-0 3. Keith Haviland, Dina Gray, Ben Salama, “Unix System Programming”, 2nd Edition Addison Wesley.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

37

ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEM Course Code : 16MCA343 Credits : 04 L:P:T:S : 4:0:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand the significance of artificial intelligence and expert systemsin real time environment

CO2 Apply the idea of intelligent agents and search methods

CO3 Analyze about representing knowledge

CO4 Understand and apply the reasoning and decision making in uncertain world

CO5 Construct plans and methods for generating knowledge

CO6 Analyze the concepts of expert systems

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 2 3 - - 1 3 3

CO2 3 3 2 - - 2 3 - - 1 3 3

CO3 3 3 2 - - 2 3 - - 1 3 3

CO4 3 3 2 - - 2 3 - - 1 3 3

CO5 3 3 2 - - 2 3 - - 1 3 3

CO6 3 3 2 - - 2 3 - - 1 3 3

Syllabus

Module Contents of the Module Hours Cos

1 Introduction to AI:What is AI? Intelligent agents – Agents and Environments, the concept of rationality, the nature of environments, structure of agents Problem-Solving by Searching: Problem Solving agents – Searching for solutions, Uninformed search strategies, Informed search strategies, Heuristic functions.

9 CO1, C02

2 Adversarial search: Optimal decisions in games, Alpha, Beta pruning, evaluation functions, cutting off search. Logical Agents: Logic, Propositional logic, forward and backward chaining, – First order logic – Syntax and semantics, Using first order logic.

9

CO2, C03

3 Uncertainty: Acting under uncertainty, handling uncertain knowledge, rational decisions, Basic probability notation, propositions, atomic events, prior probability, Axioms of probability - Baye’s rule. Probabilistic reasoning: Making simple decisions, basis of utility

9 CO4

38

theory, utility functions, decision networks.

4 Planning: Planning problem, Expressiveness and extension, Partial order planning, Planning and acting in non-deterministic domains. Learning: Learning decision trees, learning methods – Neural networks, Reinforcement learning – Passive and active.

9 CO5

5 Introduction to Expert Systems:Definition, Features of an expert system, Organization, Characteristics, Prospector, Knowledge Representation inexpert systems. Expert system tools: MYCIN, EMYCIN.

9 C01, CO6

Text Books: 2. Artificial Intelligence - A Modern Approach,Stuart Russel and Peter Norvig, 3rd Edition, 2009, Pearson

Education / PHI.

3. A Guide to Expert Systems, Donald A.Waterman, Pearson Education.

Reference Books:

1. Introduction to AI & Expert System, D. W. Patterson, 3rd Edition, 2010, Prentice hall of India.

2. Principles of Artificial Intelligence& Expert Systems Development, David W.Rolston, Tata McGraw Hill.

3. Artificial Intelligence, Elaine Rich, 2012, McGraw Hill.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

39

Human Resource Management

Course Code 16MCA344 Credits: 04

L:P:T:S 4:0:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To describe basic information of the concepts and terminology

CO2 To identify the range and importance of HRM information systems applications in modern organizations

CO3 To understand the strategic importance of various HRM systems.

CO4 To understand and apply the fundamental concepts and theories of Human resource management

CO5 To understand in HRM perspective.

CO6 To understand various roles of HRMS

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - 2 - 2 3 3

CO2 3 3 2 - - 1 - 2 - 2 3 3

CO3 3 3 2 - - 1 - 2 - 2 3 3

CO4 3 3 2 - - 1 - 2 - 2 3 3

CO5 3 3 2 - - 1 - 2 - 2 3 3

CO6 3 3 2 - - 1 - 2 - 2 3 3

Syllabus

Module Contents of the Module Hours Cos

1 Nature and scope of Human Resource Management - Differences

between personnel management and HRM - Environmental of HRM -

Human resource planning -Recruitment –

Selection - Methods of Selection - Uses of Various tests - interview techniques in selection and placement.

10 CO1

2 Induction - Training - Methods - Techniques - Identification of the

trainin g needs - Training and Development - Performance appraisal –

Transfer - Promotion and termination of services - Career development.

10 CO5

3 Remuneration - Components of remuneration - Incentives - Benefits –

Motivation - Welfare and social security measures. 8

CO2, CO3

4 Labour Relation - Functions of Trade Unions - Forms of collective

bargaining –

Workers’ participation in management - Types and effectiveness - Industrial Dispute and Settlements

8 CO5

5 Human Resource Audit - Nature - Benefits - Scope - Approaches.

Parameters: resource evaluation ,personality, development,communication,Attitude

8 CO6

40

TEXT/ REFERENCE BOOKS

1. Human Resource Management – SECOND EDITION - V.S.P. Rao.

2. Human Resource Management – TATA MC GRAW HILL EDITION BY -Ashwathappa

3. Fundamentals of Human Resource Management – Pearson edition ,Garry Deseler

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember

Understand 10

Apply 10

Analyze 10

Evaluate 10

Create 10

41

Business Communication

Course Code 16MCA345 Credits: 04 L:P:T:S 4:0:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To develop communication skills, discover what business communication

CO2 To have a good knowledge Principles of Letter Writing and Business Correspondence.

CO3 To learn how to adapt your communication experiences in life and college to the

business world

CO4 Enhance skills in written as well as oral Communication through practical conduct of

this course

CO5 To improve Vocabulary, Oral Presentation

CO6 To students in understanding the principles & techniques of business communication.

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 2 - 3 - - 3 3

CO2 3 3 2 - - 2 - 3 - - 3 2

CO3 3 3 2 - - 2 - 3 - - 3 2

CO4 3 3 2 - - 2 - 3 - - 3 3

CO5 3 3 2 - - 2 - 3 - - 3 2

CO6 3 3 2 - - 2 - 3 - - 3 2

Syllabus

Module Contents of the Module Hours Cos

1 Nature of Communication, Barriers to Communication Nature of Communication Define Communication, Process of Communication, Types of Communication (verbal & Non Verbal), Importance of Communication, Different forms of Communication. Barriers to Communication Causes, Linguistic Barriers, Psychological Barriers, Interpersonal Barriers, Cultural Barriers, Physical Barriers, Organizational Barriers.

10 CO1 ,CO2

2 Principles of Letter Writing Nature & Function of letters, Principles, Elements of structure, Forms of Layout, Styles of presentation. Business Correspondence: Inviting quotations, Sending quotations, placing orders, Inviting tenders, Sales letters, claim & adjustment letters and social correspondence.

9 CO3

42

3 Other Business Communication Part-1: Define Memorandum, Essentials of a memorandum, Drafting Inter -office Memo Part-2: Notices, Agenda, Minutes, Job application letter, preparing the Resume.

8 CO4

4 Report Writing Part-1: Business reports, Types, Characteristics, Importance, Elements of structure Part-2: Process of writing, Order of writing, the final draft, check lists for reports.

9 CO5

5 Vocabulary, Oral Presentation Vocabulary: Words often confused Words often misspelt, common errors in English. Oral Presentation: Importance, Characteristics, Presentation Plan, Power point presentation, Visual aids.

9 CO6

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

43

ELECTIVES – 3

COMPUTER BASED OPTIMIZATION TECHNIQUES Course Code : 16MCA351 Credits : 04 L:P:T:S : 3:1:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand the optimization techniques and Proficiency with tools from optimization, probability, statistics, simulation, and engineering

CO2 Create economic analysis, including fundamental applications of those tools in industry contexts Involving uncertainty and scarce or expensive resources.

CO3 Apply the facility with mathematical and computational modeling of real decision-making problem

CO4 Analyze the modeling tools and computational tools, as well as analytic Skills to evaluate the problems.

CO5 Evaluate the facility with the design, implementation, and analysis of computational experiments.

CO6 Identify problems which can be formulated as a linear programming problem

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - - 2 2 3 3

CO2 3 3 2 - - 1 - - 2 3 3 3

CO3 3 3 2 - - 1 - - 1 1 3 3

CO4 3 3 2 - - 1 - - 2 1 3 3

CO5 3 3 2 - - 1 - - 3 2 3 3

CO6 3 2 2 - - 1 - - 2 3 3 3

Module Contents of the Module

1 Introduction of operation research, LP Formulations, Graphical method for solving LP’s with 2 variables, Simplex method, Duality theory in linear programming and applications, Integer linear programming, dual simplex method.

9

Program to demonstrate Simplex method Program to demonstrate dual Simplex method

2 Transportation problem, Assignment problem. Dynamic Programming: Basic Concepts, Bellman’s optimality principles, Dynamics programming approach in decision making problems, optimal subdivision problem. Sequencing Models: Sequencing problem, Johnson’s Algorithm for processing n jobs through 2 machines, Algorithm for processing n Jobs through 3 or more machines, Processing 2 jobs through n machines.

9

Program to demonstrate Transportation problem

3 Project Management : PERT and CPM : Project management origin and use of PERT, origin and use of CPM, Applications of PERT and CPM, Project Network, Diagram representation

9

44

Critical path calculation by network analysis and Critical path calculation by critical path method (CPM), Determination of floats Critical Path Implementation in C

4 Queuing Models : Essential features of queuing systems, operating characteristics of queuing system, probability distribution in queuing systems Classification of queuing models, solution of queuing M/M/1 :

/FCFS, M/M/S : /FCFS./FCFS.

9

C code for single server Queuing model

5 Inventory Models: Introduction to the inventory problem, Deterministic Models, The classical EOQ (Economic Order Quantity) model. Inventory models with deterministic demands(no shortage & shortage allowed) Inventory models with probabilistic demand, multiterm deterministic models.

9

Text Books: 1. Shubham Agarwal, Computer based optimization techniques, Alpha science international limited , 2015. 2. Introduction to Operation Research, Computer Oriented Algorithmic approach Gillet B.E. Tata Mcgraw Hill publishing Ltd, New Delhi, 1982. 3. Operations Research , P.K. Gupta & D.S. Hira, S.Chand & Co. 4. Operations Research: Theory and Applications , J.K. Sharma, Mac Millan. Reference books: 1 . Operations Research , S.D. Sharma, Kedar Nath Ram Nath, Meerut (UP). 2. Optimization Theory and Application , S.S. Rao, Wesley Eastern. 3. Operations Research - An Introduction , Tata Hamdy, A Fifth Edition, Prentice Hall of India Pvt. Ltd., New Delhi. 4. Operations Research an Introduction , Taha H.A. McMillan Publication.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

45

Database Management System

Course Code : 16MCA352 Credits : 04 L:P:T:S : 3:1:0:0 CIE Marks : 50 Exam Hours : 3 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 2 3 2 - - 2 - - 1 1 3

CO2 3 2 3 2 - - 2 - - 1 1 2

CO3 3 2 3 2 - - 2 - - 1 1 2

CO4 3 2 3 2 - - 2 - - 1 1 3

CO5 3 2 3 2 - - 2 - - 1 1 2

CO6 3 2 3 2 - - 2 - - 1 1 2

CO1 To learn the concepts of DBMS

CO2 Understand Relational schema and building ER diagram

CO3 Analyze Relation algebra and Basic SQL

CO4 Understand the areas of database design, SQL and programming.

CO5 To know the concept of Normalization

CO6 Gain the ability to apply knowledge of SQL in PL/SQL

46

SYLLABUS

Module Contents of the Module Hours COs

1 Introduction: Characteristics of Database approach; Actors on the screen; Workers behind the scene; Advantages of using DBMS approach; Architectures for DBMSs. Entity-Relationship Model: Entity Types, Entity Sets, Attributes and Keys; Relationship Types, Roles and Structural Constraints; Weak Entity Types.

9

CO1, CO2

List of Experiments (For Illustration purposes Only) 1. Determination of entities, attributes and relationships in

musical DB, university DB, Bank DB 2. Drawing Relational Schema on musical DB, university DB,

Bank DB

2

2 Designing ER diagram: Refining the ER Design for COMPANY Database; ER Diagrams, Naming Conventions and Design Issues; Relationship Types of Degree Higher than Two, Relational Database Design Using ER- to-Relational Mapping Relational Model and Relational Algebra: Relational Model Concepts; Relational Model Constraints and Relational Database Schemas; Update Operations, Transactions and Dealing with Constraint Violations;

9 CO1 CO3

List of Experiments 1. Drawing ER diagram on musical DB, university DB, Bank DB

2

3 Unary Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary Relational Operations: JOIN and DIVISION; Additional Relational Operations; Examples of Queries in Relational Algebra; SQL: SQL Data Definition and Data Types; Specifying Constraints in SQL; Schema Change Statements in SQL; Basic Queries in SQL.

9 CO1 C04

List of related Experiments 1. Writing Basic SQL queries depending on

musical DB, university DB, Bank DB 2

4 SQL: More Complex SQL Queries, Insert, Delete and Update Statements in SQL; Views (Virtual Tables) in SQL. Database Design: Informal Design Guidelines for Relation Schemas; Functional Dependencies;1NF,2NF,3NF and Boyce-Codd Normal Form

9

CO1 CO5

List of Experiments 1. Writing SQL queries depending on musical DB, university

DB, Bank DB

2

5 Introduction to PL/SQL:Basics of PL/SQL:Data types, general syntax. Cursors. Procedures and exceptions

9 CO1, CO6

List of Experiments 1. Learning some basic queries on PL/SQL

2

47

Text Book

1. Elmasri and Navathe: Fundamentals of Database Systems, 7th Edition, Pearson

Education, 2015. 2. Silberschatz, Korth and Sudharshan: Data base System Concepts, 6th Edition, Mc-GrawHill,2010. 3. Bill Pribyl, Steven Feuerstein: Learning Oracle PL/SQL, O'Reilly Media, November 2001

Reference Books

1. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3rd

Edition, McGraw-Hill,1996. 2. Database Principles Fundamentals of Design, Implementation and Management

by Coronel, Morris, Rob- Cengage Learning,2013.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

48

BIOINFORMATICS AND COMPUTER APPLICATION Course Code : 16MCA353 Credits : 04 L:P:T:S : 3:1:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 COURSE OBJECTIVES

CO1 To understand the basic concepts.

CO2 To search information, visualize it.

CO3 To learn various bioinformatics algorithms.

CO4 To understand data mining techniques.

CO5 To study various Data Mining and pattern matching techniques

CO6 To know the various Bioinformatics Software

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 2 3 1 - - 3 - - 1 1 3

CO2 3 2 3 1 - - 3 - - 1 1 2

CO3 3 2 3 1 - - 3 - - 1 1 2

CO4 3 2 3 1 - - 3 - - 1 1 3

CO5 3 2 3 1 - - 3 - - 1 1 2

CO6 3 2 3 1 - - 3 - - 1 1 2

Syllabus

Module Contents of the Module Hours COs

1 Introduction to computer networks - Topologies and designs; Basics of computer operating systems - windows and Linux; Introduction to Markup language - Hyper Text Markup Language (HTML) and Extensive Markup Language (XML); Spreadsheets and Presentation software Introductory Concepts The Central Dogma – The Killer Application – Parallel Universes – Watson’s Definition - Top Down Versus Bottom up – Information Flow – Convergence

9

CO1

List of Experiments 1. Study of Internet resources in Bioinformatics. E.g. NCBI, CGEB, EMBL.

2. Open access bibliographic resources and literature databases a. PubMed b. BioMed Central c. Public Library of Sciences (PloS) d. CiteXplore.

2

2 Data Management Databases – Data Management – Data Life Cycle – Database Technology – Interfaces – Implementation – Networks – Geographical Scope – Communication Models – Transmissions Technology – Protocols – Bandwidth – Topology – Hardware – Contents – Security – Ownership – Implementation – Management Search Engine The search process – Search Engine Technology – Searching and Information Theory Computational methods – Search Engines and Knowledge Management

9 CO2

49

List of Experiments 3. Searches on MEDLINE, PubMed and CDROM bibliographic databases. Concept of boolean operators in searching. 4. Introduction to sequence data bases Protein sequence databank, NBRF-PIR, SWISSPROT, EMBL.

2

3 Visualization and Algorithms Data Visualization – sequence visualization – structure visualization – user Interface – Animation Versus simulation – General Purpose Technologies - Exhaustive search – Greedy – Dynamic programming – divide and conquer – graph algorithms Statistics Tabulation of data and Graphical representation. Measures of central tendency and dispersion: mean, median, mode, range, standard deviation, variance. Idea of two types of errors and level of significance. Tests of significance (F & t test); Chi - square tests. Simple linear regression and correlation

9 CO3

List of Experiments 5. Pair wise alignment- Needleman-Wunsch and Smith-Waterman algorithms

2

4 Data Mining Data Analysis – Tool selection statistics of Alignment – Clustering and Classification – Data Mining – Methods – Selection and Sampling – Preprocessing and Cleaning – Transformation and Reduction – Data Mining Methods – Evaluation – Visualization – Designing new queries – Pattern Recognition and Discovery – Machine Learning – Text Mining – Tools Pattern Matching Pairwise sequence alignment – Local versus global alignment – Multiple sequence alignment Computational methods – Dot Matrix analysis – Substitution matrices Dynamic programming Word methods – Bayesian methods – Multiple sequence alignment

9

CO4 CO5

List of Experiments 6. Multiple alignment- CLUSTALW & PRINTS 7. BLAST, FASTA programs for sequence database search 8. Genome data bank – study the features of human genome. 8. Evaluation of protein structure by Swiss PDB viewer and by other molecular visualization tools.

5 Modeling and Simulation Drug Discovery – components – process – Perspectives – Numeric considerations – Algorithms – Hardware – Issues Protein structure – AbInitio Methods – Heuristic methods Systems Biology – Tools – Collaboration and Communications – standards - Issues – Security Intellectual property Bioinformatics Software Clustal V, Clustal W 1.7, RasMol, Oligo, Molscript, Treeview, Alscript, Genetic Analysis Software, Phylip

9

CO6

List of Experiments 9. Calculation of phi – psi angles - Ramachandran plot. 10. Homology modeling of a given protein sequence.

2

50

Text Books:

1. Bryan Bergeron, “Bio Informatics Computing”, Second Edition, Pearson Education, 2003. 2. T.K.Attwood and D.J. Perry Smith, “Introduction to Bio Informatics, Longman Essen, 1999. 3. An Introduction to, Bioinformatics Algorithms (Computational Molecular Biology) , “Neil C.Jones,

PaveA. Pevzner”, MIT Press 2004

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 20 10 10

Remember 10 5

Understand 5

Apply 5

Analyze 10 5

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember

Understand 10

Apply 10

Analyze 10

Evaluate 10

Create 10

51

Big Data Analytics

Course Code 16MCA354 Credits: 04

L:P:T:S 3:1:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To develop in depth understanding of the key technologies in data science and

business analytics

CO2 Understanding Data Analytic Tools

CO3 Understanding data analysis.

CO4 Evaluating Estimating Moments

CO5 Analyzing frequent item sets and clustering

CO6 Estimating frameworks and visualization

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - 1 - 3 - - 2 3 3

CO2 3 3 2 - 1 - 3 - - 2 3 2

CO3 3 3 2 - 1 - 3 - - 2 3 2

CO4 3 3 2 - 1 - 3 - - 2 3 3

CO5 3 3 2 - 1 - 3 - - 2 3 2

CO6 3 3 2 - 1 - 3 - - 2 3 2

Syllabus

Module Contents of the Module Hours COs

1 INTRODUCTION TO BIG DATA Introduction to Big Data Platform – Traits of Big data -Challenges of Conventional Systems - Web Data – Evolution Of Analytic Scalability - Analytic Processes and Tools - Analysis vs Reporting Modern Data Analytic Tools - Statistical Concepts: Sampling Distributions - Re-Sampling - Statistical Inference - Prediction Error.

9

CO1, CO2 List of Experiments (For Illustration purposes Only)

1. Write a script/command to create the directory structure.

2. Write a script to load files daily. This would be run everyday with the

current date called from a crontab job. Use the files inside of the

"sample_data" directory in the folder for this lab.

2

52

2 DATA ANALYSIS Regression Modeling - Multivariate Analysis - Bayesian Modeling - Inference and Bayesian Networks - Support Vector and Kernel Methods - Analysis of Time Series: Linear Systems Analysis - Nonlinear Dynamics - Rule Induction Neural Networks: Learning And Generalization - Competitive Learning - Principal Component Analysis and Neural Networks - Fuzzy Logic: Extracting Fuzzy Models from Data - Fuzzy Decision Trees

9

CO1, CO3

List of Experiments

1. Your objective is to extract the file server_20120509.log under

logs/01_hdfs/day_20120509 in HDFS and load it into program.

2. Generate a model to extract fuzzy models from data.

2

3 MINING DATA STREAMS Introduction To Streams Concepts – Stream Data Model and Architecture - Stream Computing - Sampling Data in a Stream – Filtering Streams – Counting Distinct Elements in a Stream Estimating Moments – Counting Oneness in a Window – Decaying Window - Real time Analytics Platform(RTAP) Applications - Case Studies - Real Time Sentiment Analysis, Stock Market Predictions.

9

CO1, CO4

List of Experiments 1.Write a program that produces a list of properties with minimum value(min_value), largest value(max_value) and number of unique values. Before you start, execute the prepare step to load the data into HDFS. 2.Generate a count per state.Now that extracted the properties, calculate the number of records per state.

2

4 FREQUENT ITEMSETS AND CLUSTERING Mining Frequent Item sets - Market Based Model – Apriori Algorithm – Handling Large Data Sets in Main Memory – Limited Pass Algorithm – Counting Frequent Itemsets in a Stream Clustering Techniques – Hierarchical – K-Means – Clustering High Dimensional Data – CLIQUE And PROCLUS – Frequent Pattern based Clustering Methods – Clustering in Non-Euclidean Space

9

CO1, CO5

List of Experiments 1.Create a program to : 1. Calculate the total views per hour per day. 2. Calculate the total views per day. 3. Calculate the total counts of each hour across all days.

2

53

5 FRAMEWORKS AND VISUALIZATION MapReduce – Hadoop, Hive, MapR – Sharding – NoSQL Databases - S3 - Hadoop Distributed File Systems – Visualizations - Visual Data Analysis Techniques - Interaction Techniques; Systems and Analytics Applications - Analytics using Statistical packages-Approaches to modeling in Analytics – correlation, regression, decision trees, classification, association-Intelligence from unstructured information.

9 CO1, CO6

List of Experiments 1. Generate a model wrt correlation, regression, decision tree.

2

TEXT BOOKS: 1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007.

2. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced Analytics”, John Wiley & sons, 2012.

REFERENCE BOOKS:

1. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge University Press, 2012.

2. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007

3. Pete Warden, “Big Data Glossary”, O’Reilly, 2011.

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

54

PROBABILITY AND STATISTICS

Course Code : 16MCA355 Credits : 04 L:P:T:S : 3:1:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand basic probability axioms and rules of discrete and continous random variables as well as be familiar with common named discrete and continous random variables.

CO2 Analyze and Compute probabilities by modeling sample spaces and applying rules of permutations and combinations, additive and multiplicative laws and conditional probability

CO3 Evaluate the probability distribution of a random variable, based on a real-world situation, and use it to compute expectation and variance, correlation

CO4 Apply probability concept based on practical situations using the binomial and normal distributions

CO5 use the normal distribution to test statistical hypotheses and to compute confidence intervals

CO6 Distinguish between one and two factor analysis of variance tests and identify the appropriate hypothesis testing procedure based on type of outcome variable and number of samples

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2

CO1 3 3 2 - 1 1 3 3 2 3 3

CO2 3 3 2 - 2 2 1 1 2 3 2

CO3 3 3 2 - 3 3 2 2 1 3 2

CO4 3 3 2 - 1 1 3 3 2 3 3

CO5 3 3 2 - 2 1 1 3 3 3 2

CO6 3 3 2 - 3 1 3 3 2 3 3 2

Module Contents of the Module Hours cos

1 PROBABILITY Axioms of probability - Conditional probability - Total probability - Bayes theorem RANDOM VARIABLE Random variable - Probability mass function - Probability density functions

9 CO1, CO2

2 STANDARD DISTRIBUTION Binomial, Poisson, Exponential, Gamma distribution Normal distributions and their properties

9

C program for finding Binomial distribution expression C program for finding Poisson distribution expression 4

CO1, CO3

3 TWO DIMENSIONAL RANDOM VARIABLES Joint distributions - Marginal and conditional distributions – Covariance Correlation and Regression - Transformation of random variables -

9

55

Central limit theorem . C program to calculate correlation Coefficient C program to calculate regression analysis

4 CO1, CO4

4 TESTING OF HYPOTHESIS Sampling distributions – Testing of hypothesis for mean, variance, t distribution Chi-square distribution - Tests for independence of attributes and Goodness of fit.

9

C program to calculate chi square 2

CO1, CO5

5 DESIGN OF EXPERIMENTS

Analysis of variance – One way classification – CRD , RBD - Latin square.. . 9

Text Books: 1. Probability And Statistics For Engineers And Scientists , Ronald E. Walpole, Pearson Education,

2014 2. An introduction to probability and statistics, Vijay K. Rohatgi, A.K. Md. Ehsanes Saleh, Wiley series, 2015. 3. A first Course in Probability ,Ross. S., Fifth Edition, Pearson Education, Delhi 2002. (Chapters 2 to 8) 4. Miller & Freund’s Probability and Statistics for Engineers ,Johnson. R. A., Sixth Edition, Pearson

Education, Delhi, 2000. (Chapters 7, 8, 9, 12) Reference books:

1. Probability and Statistics for Engineers and Scientists Walpole, R. E., Myers, R. H. Myers R. S. L. and Ye. K,

Seventh Edition, Pearsons Education, Delhi , 2002.

2. Schaum’s outlines - Introduction to Probability and Statistics, Lipschutz. S and Schiller. J, McGraw-Hill, New

Delhi, 1998.

3. Fundamentals of Mathematical Statistics , Gupta, S.C, and Kapur, J.N.,Sultan Chand, Ninth Edition , New

Delhi ,1996.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

56

MINI PROJECT USING NETWORK CONCEPT AND JAVA

Course Code 16MCA36 Credits 03

L:P:T:S 0:3:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Objectives:

To get depth knowledge of Java

To get exposure in developing an application based on Java Programming.

MINI PROJECT WORK:

This mini project is based on subject Network concept using Java. Simple projects need to be developed

Expected Course Outcome:

Students will get depth knowledge of Java Programming.

Students will get exposure in developing an application based on Java.

Assessment Method:

The marks of the main project would be given on the basis of Power Point Demonstration on Project,

uniqueness of the report and viva. Project must be done in a group of 2 to 3 students.

CIE:

Power Point Demonstration on Project – 20 marks

Project completion and documentation – 20 marks

Attending the reviews - 5 marks

Viva - 5 marks

SEE: Project completion and documentation – 20 marks, Project Demonstration – 20 marks Viva - 10 marks

Create

57

FOURTH SEMESTER

ADVANCED JAVA AND ENTERPRISES ARCHITECTURE Course Code : 16MCA41 Credits : 05 L:P:T:S : 3:2:0:0 CIE Marks : 50+25 Exam Hours : 3+3 SEE Marks : 50+25 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understanding JDBC connectivity

CO2 Getting a big picture of Servlet and cookies

CO3 Getting high-level exposure about JSP and Tag Libraries

CO4 Understanding about Java Beans and different action tags

CO5 Understanding about Stateless session bean and different action tags

CO6 Understanding the development of server programming

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 2 - 1 - 2 3 3

CO2 3 3 2 - - 2 - 1 - 2 3 2

CO3 3 3 2 - - 2 - 1 - 2 3 2

CO4 3 3 2 - - 2 - 1 - 2 3 3

CO5 3 3 2 - - 2 - 1 - 2 3 2

CO6 3 3 2 - - 2 - 1 - 2 3 3

SYLLABUS

Module Contents of the Module Hours COs

1 JDBC Object The Concept of JDBC, JDBC Driver Types, JDBC Packages, A Brief

9 CO1

58

Overview of JDBC Process, Database Connection, Associating the JDBC/ODBC Bridge with the Database, Statement Objects, ResultSet, Transaction Processing, Metadata, Data Types, Exceptions. JDBC and Embedded SQL Model Programs, Tables, Indexing, Inserting Data into Tables, Selecting Data from a Table, Metadata, Updating Tables, Deleting Data from a Table, Joining Tables, Calculating Data, Grouping and Ordering Data, Subqueries, VIEW.

List of Experiments (For Illustration purposes Only) 1. Write a JAVA Program to insert data into Student DATA BASE

and retrieve info based on particular queries

8

2 Servlets Introduction, Advantages of Servlets over CGI, Installing Servlets, The Servlets Life Cycle, Servlet API, Handling HTTP GET Request, Handling HTTP POST Request, Servlet Context. Servlets – Sessions Cookies, Session Tracking, Filter API, Multi-tier Applications Using Database Connectivity

9

CO2 List of Experiments 1. Write a JAVA Servlet Program to implement a

dynamic HTML using Servlet (user name and password should be accepted using HTML and displayed using a Servlet).

2. Write a JAVA Servlet Program using cookies to

remember user preferences.

8

3 Java Server Pages (JSP) Introduction, Advantages of JSP, Developing First JSP, JSP Scripting Elements- (Directives, Declaratives, Scriplets, Expressions, Implicit Variables), Page Directives. Java Server Pages Standard Tag Library: Why you should use the JSTL, JSTL Expression Language, Core Tags, custom tag Libraries: why custom Tags, Tag Library basics, how are tags being used, new and old custom tags, Tag library Descriptors (TLDs), simple JSP 2.0 custom tags.

9

CO3

List of related Experiments 1. a. Write a JAVA JSP Program to print 10 even and 10 odd

number. b. Write a JAVA JSP Program to implement verification of a particular user login and display a welcome page.

2. Write a JAVA Servlet Program to implement and demonstrate get() and Post methods(Using HTTP Servlet Class).

8

4 Java Beans What is a Java Bean? Advantages of Java Beans, The Java Beans API JSP with Java Beans Introspector, property Descriptor, Event Descriptor, Method Descriptor, A Bean Example, JSP with Java Beans

9 CO4

59

Text Book

1. Core Servlets and Java Server Pages. Volume 1: Core Technologies. Marty Hall, Larry Brown. 2013, Second Edition, Prentice Hall

2. Java 6 Programming Black Book, 2012 , Dreamtech Press. 3. Developing Enterprise Java Components. Enterprise

JavaBeans 3.1.O’reilly. Andrew LeeRubinger, Bill Burke, 2010, O'Reilly Media

Reference Books

1. EJB 3 Developer Guide, A practical guide for developers and architects to the Enterprise Java Beans Standard, Michael Sikora, July 2008. Shroff Publishers & Distributors PVT LTD.

Assessment Pattern

CIE- Continuous Internal Evaluation (50+25 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

List of Experiments 1.Write a JAVA JSP Program to get student information through a HTML and create a JAVA Bean Class, populate Bean and display the same information through another JSP.

2. Write a JAVA JSP Program which uses <jsp:plugin> tag to run a applet.

8

5 Server Side Component Models: The Stateless Session Bean, the Stateful Session Bean, the Singleton Session Bean, Message- Driven Beans. EJB and PERSISTENCE. Persistence Entity manager Mapping Persistence objects, Entity Relationships.

9 CO5

List of Experiments 1. An EJB application that demonstrates Session Bean. 2. An EJB application that demonstrates Entity Bean. 3. An EJB application that demonstrates MDB.

8

60

SEE- Semester End Examination (50+25 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 55

Analyze

Evaluate

Create

61

DESIGN AND ANALYSIS OF ALGORITHMS

Course Code : 16MCA42 Credits : 05 L:P:T:S : 3:2:0:0 CIE Marks : 50+25 Exam Hours : 3+3 SEE Marks : 50+25 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Introduce the paradigms and approaches used to design and analyze algorithms and also to Categorize problems based on the popular domains.

CO2 Develop algorithms using iterative/recursive approach and estimate the efficiency of algorithms in terms of asymptotic notations.

CO3 Provide necessary background for writing algorithms in a formal way. Implement algorithms using a specific design strategy and compute their running time.

CO4 Familiarize with the fundamental concepts and techniques for analyzing the complexity of algorithms for any graphical and combinatorial problem.

CO5 Design, implement and test an appropriate algorithm for different application problems.

CO6 Introduce the limitations of algorithm and classify problems as P, NP or NP Complete and finding solutions using various strategies/constraints.

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 2 2 - - - - 2 - - 3 3 3

CO2 2 2 - - - - 2 - - 3 3 2

CO3 2 2 - - - - 2 - - 3 3 2

CO4 2 2 - - - - 2 - - 3 3 3

CO5 2 2 - - - - 2 - - 3 3 2

CO6 2 2 - - - - 2 - - 3 3 3

62

SYLLABUS

Module Contents of the Module Hours COs

1 Introduction: Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem Types, Basics of data Structures. Fundamentals of the Analysis of Algorithm Efficiency: Analysis Framework, Asymptotic Notations and Basic efficiency classes, Mathematical analysis of Recursive and Non recursive algorithms, Examples.

9

CO1 List of Experiments

1. Implement Nonrecursive Programs such as Matrix Multiplication, Uniqueness of an array determine the time required.

2. Implement Recursive Programs such as Factorial, Fibonacci series and determine the time required.

8

2 Brute Force: Selection Sort, Bubble sort, String Matching Divide-and-Conquer: Merge sort, Quick sort, Binary Search, Binary tree traversals and related properties, Multiplication of large integers.

9

CO2 List of Experiments

1. Implement Recursive Binary search and Linear search and determine the time required to search an element.

2. Sort a given set of elements using Merge sort method and determine the time required to sort the elements.

3. Sort a given set of elements using Quick sort method and determine the time required sort the elements.

8

3 Decrease-and-Conquer: Insertion Sort, Depth First and Breadth First Search, Topological sorting, Algorithms for Generating Combinatorial Objects Space and Time Tradeoffs: Sorting by Counting, Input Enhancement in String Matching using Horspool’s Algorithm, , Hashing.

9

CO3 List of Experiments

1. Obtain the Topological ordering of vertices in a given

digraph. 2. Print all the nodes reachable from a given starting node in a

digraph using BFS method. 3. Implement Horspool’s algorithm for String Matching.

8

4 Dynamic Programming: Computing a binomial coefficient, Warshall’s and Floyd’s algorithms. Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees.

9

CO4

List of Experiments 1. Find Minimum Cost Spanning Tree of a given undirected

graph using Prim’s algorithm. 2. Implement Floyd’s algorithm for the All-Pairs- Shortest-

Paths Problem. 3. Compute the transitive closure of a given directed graph

using Warshall's algorithm.

8

63

ext Book

1. Introduction to the Design and Analysis of Algorithms, Anany Levitin, 3rd Edition, 2011 Pearson Education.

Reference Books

1. Fundamentals of Computer Algorithms, Horowitz E., Sahani S., Rajasekharan S, 2nd Edition, Universities Press.

2. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, 3rd Edition, PHI.

Assessment Pattern

CIE- Continuous Internal Evaluation (50+25 Marks)

SEE- Semester End Examination (50+25 Marks)

5 Backtracking: n-queens problem, Hamiltonian Circuit problem, Subset-Sum problem. Branch-and-Bound: Knapsack problem, Traveling Salesman Problem, Assignment Problem. P, NP-Completeness and Approximation Algorithms: Introduction, Lowerbound arguments, Decision trees, P, NP and NP-complete problems.

9 CO5, CO6

List of Experiments 1. Implement NQueen’s problem using Backtracking

Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths Problem.

2. Implement Sum of subset problem using Backtracking and display error message if a subset is not formed.

8

Bloom’s Category

Tests Assignments Quizzes Self Study

Mini Project

Seminar

Marks (out of 50)

30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

64

ELECTIVES - 4

MOBILE APPLICATIONS USING ANDROID

Course Code 16MCA431 Credits 04

L:P:T:S 4:0:0: 0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Learn and understand the terminology related to mobile application development and the need for mobile web presence

CO2 Understand designing of Android user interfaces and types of mobile websites

CO3 Understand the tools needed for android installation and to manage screen orientations

CO4 Learn the various user interface views and to handle user preferences through content providers

CO5 Learn to use Android's communication APIs for SMS and mail and to learn basics of networking

CO6 Learn to use the Location-based services offered by Android Applications

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - 1 - 2 - 2 - 3 3

CO2 3 3 2 - 1 - 2 - 2 - 3 2

CO3 3 3 2 - 1 - 2 - 2 - 3 2

CO4 3 3 2 - 1 - 2 - 2 - 3 3

CO5 3 3 2 - 1 - 2 - 2 - 3 2

CO6 3 3 2 - 1 - 2 - 2 - 3 3

Syllabus

Module Contents of the Module Hours Cos

1 Introduction to : Preliminary Considerations – Cost of Development – Importance of Mobile Strategies in Business World – Mobile Myths – Third-Party Frameworks

Mobile Applications: Mobile Web Presence - Marketing – Web Services for Mobile Devices – Web Services Languages

9 CO1

2 Mobile User Interface Design: Effective Use of Screen Real Estate – Understanding Mobile Application Users – Understanding Mobile Information Design – Understanding Mobile Platforms - Using the Tools for Mobile Interface Design Mobile Websites: Choosing a Mobile Web Option – Adaptive Mobile Websites – Dedicated Mobile Websites - Mobile Web Applications with HTML 5

9 CO2

3 Getting Started with Android: Why Target Android? - Who Supports Android? - Android as Competition to Itself - Getting the Tools You Need - Connecting to the Google Play - Android

9 CO3

65

Development Practices -Building the Derby App in Android Android User Interface: Understanding Components of a Screen – Adapting to Display Orientation – Managing Changes to Screen Orientation – Creating User Interface Programmatically – Listening for UI Notifications

4 Types of Views: Designing Your User interface using Views - Displaying Pictures and Menus with Views – AnalogClock and DigitalClock Views Data Persistence: Saving and loading user Preferences - Persisting data to files – Creating and using Data bases– Content Providers

9 CO4

5 Android Messaging and Networking: SMS Messaging – Sending SMS – Receiving SMS - Sending E-mail – Networking – Downloading Binary Data, Downloading Text Files

Location Based Services: Displaying Maps – Obtaining Map API Key – Displaying the Map – Zoom Control – Changing Views – Navigating – Adding Markers – Getting the Location that was Touched – Geocoding and Reverse Geocoding

9 CO5 CO6

Text Books: 1. Professional Mobile Application Development, Jeff McWherter and Scott Gowell, 2012, Wrox Publishers

2. Beginning Android Application Development, Wei – Meng Lee, 2011, Wiley.

Reference books:

1. Professional Android 4 Application Development, Reto Meier, 2012, Wrox Publications

2. Beginning iOS6 Development :Exploring the iOS SDK, David Mark, Jack Nutting, Jeff LaMouche, and Fredric

Olsson, 2013, Apress

3. Android in Practice, Charlie Collins, Michael Galpin and Matthias Kappler, 2012, Dream Tech.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

66

ADVANCED WEB TECHNOLOGY

Course Code 16MCA432 Credits: 4 L: P: T: S : 4:0:0:0 CIE Marks: 50 Exam Hours: 3 SEE Marks: 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To understand the advanced concepts of web technology.

CO2 Understand the application of Perl Scripting

CO3 Understand the application of CGI & how to track users

CO4 Understand the concept of PHP Scripting

CO5 Understand the advanced applications of PHP & concept of RUBY

CO6 Understand the advanced concepts of RUBY & applications of Rails

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - 3 2 - 3 3

CO2 3 3 2 - - 1 - 3 2 - 3 2

CO3 3 3 2 - - 1 - 3 2 - 3 2

CO4 3 3 2 - - 1 - 3 2 - 3 3

CO5 3 3 2 - - 1 - 3 2 - 3 2

CO6 3 3 2 - - 1 - 3 2 - 3 3

67

SYLLABUS

Module Contents of the Module Hours COs

1 Programming in Perl: Origins and uses of Perl, Scalars and their operations, Assignment statements and simple input and output, Control statements, Fundamentals of arrays, Hashes, References, Functions, Pattern matching, File input and output; Introduction to CGI Scripting: What is CGI? Developing CGI Applications, Processing CGI, Introduction to CGI.pm, CGI.pm methods, Creating CGI objects, Extracting parameter names, Fetching parameter values.

9

CO2

2 CGI.pm: Creating HTML Pages Dynamically – The HTTP header, Starting and Finishing a Page, The body of the Page, Using CGI.pm – An example, Adding Robustness – Taint Checking, Strict, Carp, Cookies. Building Web Applications with Perl: Uploading files, Tracking users with Hidden Data, Using Relational Databases, Using DBI and a relational Database – an Example, Using libwww.

9

CO3 List of Experiments

1. Write a CGI-Perl program to demonstrate usage of cookies. 2. Write a Perl program to insert name and age information

entered by the user into a table created using MySQL and to display the current contents of this table.

7

3 Introduction to PHP: Origins and uses of PHP, Overview of PHP, General syntactic characteristics, Primitives, operations and expressions, Output, Control statements, Arrays, Functions, Pattern matching. Building Web applications with PHP: Form handling, Files, Tracking users – cookies, sessions.

9

CO4 List of related Experiments

1. Create XHTML form with Name, address line1, address line2 and email text fields. On submitting, store the values in MySQL table. Retrieve and display the data based on name.

7

4 Database Access with PHP: Using Databases – Introducing MySQL, Accessing MySQL from PHP, Handling XML, Processing RSS feeds. Introduction to Ruby: Origins and uses of Ruby, Scalar types and their operations, Simple input and output, Control statements, Arrays, Hashes.

9

CO5

5 Advanced concepts of Ruby: Methods, Classes, Code blocks and iterators, Pattern matching. Introduction to Rails: Overview of Rails, Document requests, Processing forms, Rails applications with Databases, Layouts.

9

CO6 List of Experiments

1. Build a Rails application to accept book information viz. accession number, title, authors, edition and publisher

7

68

Text Book 1. Web

Programming Building Internet Applications, Chris Bates, 3rd Edition, 2012, Wiley India.

2. Programming the World Wide Web, Robert W. Sebesta, 7th Edition, 2012, Pearson Education.

Reference Books 1. Internet & World Wide Web How to program, M. Deitel, P.J. Deitel, A. B. Goldberg, 3rd Edition, 2011, Pearson

Education / PHI. 2. The Web Warrior Guide to Web Programming, Xue Bai et al, 2012, Thomson.

3. PHP and MySQL, Joel Murach, First Edition, 2012, Mauch’s Publications.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

from a web page and store the information in a database and to search for a book with the title specified by the user and to display the search results with proper headings.

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

69

SOFTWARE PROJECT MANAGEMENT

Course Code 16MCA433 Credits 04

L:P:T:S 4:0:0: 0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand the fundamental principles of Software Project management

CO2 To have a good knowledge of responsibilities of project manager and how to handle these.

CO3 Be familiar with the different methods Project Evaluation

CO4 To understand Activity Planning Part And Project Evaluation

CO5 to have idea about monitoring and control techniques

CO6 Understanding the managing people and organizing teams

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - 3 - - 3 3

CO2 3 3 2 - - 1 - 3 - - 3 2

CO3 3 3 2 - - 1 - 3 - - 3 2

CO4 3 3 2 - - 1 - 3 - - 3 3

CO5 3 3 2 - - 1 - 3 - - 3 2

CO6 3 3 2 - - 1 - 3 - - 3 3

Syllabus

Module Contents of the Module Hours COs

1 INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT Project Definition – Contract Management and technical project management – Activities Covered By Software Project management PROJECT PLANNING Overview of Project Planning – Stepwise Project Planning. Methods and methodologies, categorizing software projects , Setting objectives.

6 CO1 ,CO2

2 PROJECT EVALUATION Strategic Assessment – Technical Assessment – Cost Benefit Analysis –Cash Flow Forecasting, Managing the allocation of resources within programmes , Strategic programme management EVALUATION TECHNIQUES Cost Benefit Evaluation Techniques – Risk Evaluation , Creating a programme , Aids to programme management , Some reservations about programme management , Benefits

8 CO3

70

management.

3 ACTIVITY PLANNING PART-I Objectives – Project Schedule – Sequencing and Scheduling Activities –Network Planning Models, Forward Pass – Backward Pass. ACTIVITY PLANNING PART-II Activity Float – Shortening Project Duration, Identifying the critical path, Activity float , Shortening the project duration, Identifying critical activities, Activity-on-arrow networks

9 CO4

4 MONITORING AND CONTROL Creating Framework – Collecting the Data – Visualizing Progress – Cost Monitoring – Earned Value – Prioritizing Monitoring – Getting Project Back To Target – Change Control MANAGING CONTRACTS Managing Contracts – Introduction – Types of Contract – Stages In Contract Placement – Typical Terms Of A Contract – Contract Management – Acceptance.

9 CO5

5 MANAGING PEOPLE AND ORGANIZING TEAMS Introduction – Understanding Behavior – Organizational Behavior: A Background – Selecting The Right Person For The Job – Instruction In The Best Methods – Motivation CHARACTERISTICS The Oldman – Hackman Job Characteristics Model – Working In Groups – Becoming A Team –Decision Making – Leadership – organizational Structures – Stress –Health And Safety – Case Studies

12 CO6

Text Books: 1. “Software Project Management”, Bob Hughes, Mikecotterell, fifth Edition, Tata McGraw Hill, 2012.

2. Software Engineering Project management, Wiley Edition Fourth Edition edited by Richard H Thayer

Foreword by Edward Yourdon

Reference books:

REFERENCE BOOKS: 1. “Information Technology Project Management”, Jack T. Marchewka, 5th edition, Wiley India,

2012.

2. "Managing Global Projects", Ramesh, Gopalaswamy, Tata McGraw Hill, 2012.

3. “Software Project Management”, Royce, Pearson Education, 2013.

4. “Software Project Management in Practice”, Jalote, Pearson Education, 2012.

71

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

72

SOFT COMPUTING

Course Code 16MCA434 Credits 04

L:P:T:S 4:0:0: 0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To learn the key aspects of Soft computing

CO2 To know about the components and building block hypothesis of Genetic algorithm.

CO3 To understand the features of neural network and its applications

CO4 To study the fuzzy logic components

CO5 To gain insight onto Neuro Fuzzy modeling and control

CO6 To gain knowledge in machine learning through Support vector machines.

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 3 - - - 3 3

CO2 3 3 2 - - 1 3 - - - 3 2

CO3 3 3 2 - - 1 3 - - - 3 2

CO4 3 3 2 - - 1 3 - - - 3 3

CO5 3 3 2 - - 1 3 - - - 3 2

CO6 3 3 2 - - 1 3 - - - 3 3

Syllabus

Module Contents of the Module Hours COs

1 Neural Networks-1(Introduction & Architecture)

Auto-associative and hetro-associative memory Neuron, Nerve

structure and synapse, Artificial Neuron and its model, activation

functions, Neural network architecture: single layer and ultilayer

feed forward networks, recurrent networks. Various learning

techniques; perception and convergence rule,

9 CO1, CO2

2 Neural Networks-II (Back propagation networks):Architecture: perception model, solution, single layer artificial neural network

Multilayer perception model: back propagation learning methods, effect of learning rule co-efficient ;back propagation algorithm, factors affecting back propagation training, applications.

9

CO1, CO3

3 Fuzzy Logic-I (Introduction)

Basic concepts of fuzzy logic, Fuzzy sets and Crisp sets Fuzzy set theory and operations: Properties of fuzzy sets, Fuzzy and Crisp relations, Fuzzy to Crisp conversion.

9 CO1, CO4

4 Fuzzy Logic –II (Fuzzy Membership, Rules)

Membership functions, interference in fuzzy logic, fuzzy if-then rules Applications: Fuzzy implications and Fuzzy algorithms,

9 CO1, CO5

73

Fuzzyfications & Defuzzificataions, Fuzzy Controller, Industrial applications.

5 UniGenetic Algorithm(GA)

Basic concepts, working principle, procedures of GA, flow chart of GA, Genetic representations, (encoding) Initialization and selection Applications: Genetic operators, Mutation, Generational Cycle, applications.

9 CO1, CO6

TEXT BOOKS: 1. S. Rajsekaran& G.A. VijayalakshmiPai, “Neural Networks,Fuzzy Logic and Genetic Algorithm: Synthesis and Applications” Prentice Hall of India. 2. N.P.Padhy,”Artificial Intelligence and Intelligent Systems” Oxford University Press. REFERENCE BOOKS: 1. SimanHaykin,”Neural Netowrks”Prentice Hall of India 2. Timothy J. Ross, “Fuzzy Logic with Engineering Applications” Wiley India. 3. Kumar Satish, “Neural Networks” Tata McGraw Hill

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

74

Wireless Sensor Networks

Course Code 16MCA435 Credits 04

L:P:T:S 4:0:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand working of wireless sensor networks.

CO2 Understand Wide range of applications such as disaster management, military and security.

CO3 Necessitate the development of resource conscious protocols and management techniques.

CO4 Provide a broad coverage of challenges and latest research results related to the design and management of wireless sensor networks.

CO5 Creating pervasive environment that would have profound influence on the society.

CO6 Facilitate exchanging information in regard to the development of technologies, applications and experiences with focus on large deployable applications.

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - - 2 - 3 3

CO2 3 3 2 - - 1 - - 2 - 3 2

CO3 3 3 2 - - 1 - - 2 - 3 2

CO4 3 3 2 - - 1 - - 2 - 3 3

CO5 3 3 2 - - 1 - - 2 - 3 2

CO6 3 3 2 - - 1 - - 2 - 3 3

Syllabus

Module Contents of the Module Hours COs

1 Overview of Wireless sensor Networks Introduction, Brief Historical Survey of Sensor Networks, and Background of Sensor Network Technology, Ah-Hoc Networks, Applications of Wireless Sensor Networks: Sensor and Robots, Reconfigurable Sensor Networks, Highway Monitoring, Military Applications, Civil and Environmental Engineering Applications, Wildfire Instrumentation, Habitat Monitoring, Nanoscopic Sensor Applications, Another Taxonomy of WSN Technology, Basic Sensor Network Architectural Elements, Home Control, Medical Applications, Basic Wireless Sensor Technology : Introduction, Sensor Node Technology, Sensor Taxonomy, WN Operating Environment, WN Trends, Wireless Network Standards: IEEE 802.15.4, ZigBee, IEE 1451

9 CO1

2 Medium Access Control Protocols for Wireless Sensor Networks : Introduction, Background, Fundamentals of MAC Protocols, MAC Protocols for WSNs: Schedule-Based Protocols, Random Access-Based Protocols, Coordination, Schedule Synchronization, Adaptive Listening, Access Control and Data Exchange ( B-MAC,Box-MAC, Bit-MAC, H-MAC, I-MAC, O-MAC, S-MAC. Ri-MAC, T-MAC, Q-MAC (Query MAC), Q-MAC ( QoS MAC), X-MAC)

9 CO5

3 Routing Protocols for Wireless Sensor Networks Introduction, Data 9 CO2,

75

Dissemination and Gathering, Routing Challenges and Design Issues in Wireless Sensor Networks Network Scale and Time-Varying Characteristics, Resource Constraints, Sensor Applications Data Models, Routing Strategies in Wireless Sensor Networks: WSN Routing Techniques, Flooding and Its Variants, Sensor Protocols for Information via Negotiation, Low-Energy Adaptive Clustering Hierarchy, Power-Efficient Gathering in Sensor Information Systems, Directed Diffusion, Geographical Routing

CO3

4 Traditional Transport Control Protocols: TCP (RFC 793), UDP (RFC 768), MobileIP, Introduction, WSN Middleware Principles, Middleware Architecture: Existing Middleware: MiLAN (Middleware Linking Applications and Networks), IrisNet (Internet-Scale Resource-Intensive Sensor Networks Services)

9 CO5

5 Operating Systems for Wireless Sensor Networks Introduction, Examples of Operating Systems. Applications: TinyOS,Mate, MagnetOS

9 CO6

Text Books: 1. Wireless Sensor Network by KazemSohraby, Daniel Minoli, TaiebZnati Pub: Wiley. 2. Wireless Sensor Networks Signal Processing and Communications by Ananthram Swami, Qing Zhao,

Yao-Win Hong, Lang Tong Pub: John Wiley & Sons. 3. Ad Hoc Wireless Networks: Architectures And Protocols By Murthy Pub: Pearson Education

Reference Books: 1. Wireless sensor networks Edited by C. S. Raghavendra Pub: Springer 2. Fundamentals of Sensor Network Programming: Applications and Technology By Sridhar S. Iyengar,

NandanParameshwaran, Vir V. Phoha, N. Balakrishnan, Chuka D. Okoye, Wiley Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

76

ELECTIVES – 5

Multimedia and Gaming

Course Code 16MCA441 Credits 03

L:P:T:S 3:0:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Basics of multimedia systems

CO2 Able to understand architecture of multimedia

CO3 Understand Graphics and Images, Video Technology, Computer-Based Animation

CO4 To understand Optical Storage Media

CO5 To understand Content Analysis and Data and File Format Standards

CO6 Understanding the Multimedia Application Design and issues

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - - 2 - 3 3

CO2 3 3 2 - - 1 - - 2 - 3 3

CO3 3 3 2 - - 1 - - 2 - 3 3

CO4 3 3 2 - - 1 - - 2 - 3 3

CO5 3 3 2 - - 1 - - 2 - 3 3

CO6 3 3 2 - - 1 - - 2 - 3 3

Syllabus

Module Contents of the Module Hours COs

1 Introduction, Media and Data Streams, Audio Technology

Multimedia Elements; Multimedia Applications; Multimedia Systems Architecture; Evolving Technologies for Multimedia Systems; Defining Objects for Multimedia Systems; Multimedia Data Interface Standards; The need for Data Compression; Multimedia Databases. Media: Perception Media, Representation Media, Presentation Media, Storage Media, Transmission Media, Information Exchange Media, Presentation Spaces & Values, and Presentation Dimensions; Key Properties of a Multimedia System: Discrete & Continuous Media, Independence Media, Computer Controlled Systems, Integration; Characterizing Data Streams: Asynchronous Transmission Mode, Synchronous Transmission Mode, Isochronous Transmission Mode; Characterizing Continuous Media Data Streams. Sound: Frequency, Amplitude, Sound Perception and Psychoacoustics; Audio Representation on

12 CO1 ,CO2

77

Computers; Three Dimensional Sound Projection; Music and MIDI Standards; Speech Signals; Speech Output; Speech Input; Speech Transmission.

2 Graphics and Images, Video Technology Capturing Graphics and Images Computer Assisted Graphics and Image Processing; Reconstructing Images; Graphics and Image Output Options. Basics; Television Systems; Digitalization of Video Signals; Digital Television; Computer-Based Animation Basic Concepts; Specification of Animations; Methods of Controlling Animation; Display of Animation; Transmission of Animation; Virtual Reality Modeling Language.

9 CO3

3 Optical Storage Media History of Optical Storage; Basic Technology Video Discs and Other WORMs; Compact Disc Digital Audio; Compact Disc Read Only Memory; CD-ROM Extended Architecture; Further CD- ROM-Based Developments; Compact Disc Recordable: Compact Disc Magneto-Optical; Compact Disc Read/Write; Digital Versatile Disc.

9 CO4

4 Content Analysis Simple Vs. Complex Features; Analysis of Individual Images; Analysis of Image Sequences; Audio Analysis; Applications. Data and File Format Standards Rich-Text Format; TIFF File Format; Resource Interchange File Format (RIFF); MIDI 106 File Format; JPEG DIB File Format for Still and Motion Images; AVI Indeo File Format; MPEG Standards; TWAIN

9 CO5

5 Multimedia Application Design Multimedia Application Classes; Types of Multimedia Systems; Virtual Reality Design; Components of Multimedia Systems; Organizing Multimedia Databases: Application Workflow Design Issues; Distributed Application Design Issues.

9 CO6

Text Books: 1. Ralf Steinmetz, Klara Narstedt: Multimedia Fundamentals: Vol 1-Media Coding and Content Processing, 5th Edition, Pearson Education, 2012. 2. Prabhat K. Andleigh, Kiran Thakrar: Multimedia Systems Design, PHI,2012.

Reference books:

1. K.R Rao, Zoran S. Bojkovic and Dragorad A. Milovanovic: Multimedia Communication Systems: Techniques, Standards, and Networks, Pearson Education, 2012. 2. Nalin K Sharad: Multimedia information Networking, PHI, 2012.

78

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

79

CRYPTOGRAPHY AND ETHICAL HACKING Course Code : 16MCA442 Credits : 03 L:P:T:S : 3:0:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 COURSE OBJECTIVES

CO1 To know the methods of conventional encryption.

CO2 To understand the concepts of public key encryption and number theory, authentication and Hash functions and to the know the network security tools and applications.

CO3 To learn various hacking techniques and attacks, to know how to protect data assets against attacks from the Internet.

CO4 To assess and measure threats to information assets

CO5 To evaluate where information networks are most vulnerable.

CO6 To enable students to understand issues associated with the nature of forensics

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 2 3 2 1 - - - - - 1 3 3

CO2 2 3 2 1 - - - - - 1 3 2

CO3 2 3 2 1 - - - - - 1 3 2

CO4 2 3 2 1 - - - - - 1 3 3

CO5 2 3 2 1 - - - - - 1 3 2

CO6 2 3 2 1 - - - - - 1 3 3

Syllabus

Module Contents of the Module Hours COs

1 INTRODUCTION OSI Security Architecture - Classical Encryption techniques - Cipher Principles - Data Encryption Standard - Block Cipher Design Principles and Modes of Operation - Evaluation criteria for AES - AES Cipher - Triple DES - Placement of Encryption Function - Traffic Confidentiality PUBLIC KEY CRYPTOGRAPHY Key Management - Diffie-Hellman key Exchange - Elliptic Curve Architecture and Cryptography - Introduction to Number Theory - Confidentiality using Symmetric Encryption - Public Key Cryptography and RSA

9 CO1

2 AUTHENTICATION AND HASH FUNCTION Authentication requirements - Authentication functions - Message Authentication Codes - Hash Functions - Security of Hash Functions and MACs - MD5 message Digest algorithm - Secure Hash Algorithm - RIPEMD - HMAC Digital Signatures - Authentication Protocols - Digital Signature Standard

9 CO2

80

NETWORK SECURITY Authentication Applications: Kerberos - X.509 Authentication Service - Electronic Mail Security - PGP - S/MIME - IP Security - Web Security.

3 HACKING WINDOWS Hacking windows – Network hacking – We bhacking – Password hacking . A study on various s attacks –Input validation attacks – SQL injection attacks – Buffer overflow attacks – Privacy attacks. TCP/IP TCP / IP – Checksums – IP Spoofing port scanning , DNS Spoofing . Dos attacks – SYN attacks , Smurf attacks , UDP flooding , DDOS –Models . Firewalls – Packet filter firewalls, Packet Inspection firewalls – Application Proxy Firewalls . Batch File Programming.

9 CO3,

4 FUNDAMENTALS OF COMPUTER FRAUD Fundamentals of Computer Fraud–Threat concepts Framework for predicting inside attacks – Managing the threat –,Strategic Planning Process. ARCHITECTURE Architecture strategies for computer fraud prevention –Protection of Websites – Intrusion detection system – NIDS , HIDS– Penetrating testing process – Web Services – Reducing transaction risks.

9 CO3, CO4

5 FRAUD INDICATOR SELECTION PROCESS Forensics – Computer Forensics – Journaling and it requirements – Standardized logging criteria – Journal risk and control matrix MISUSE DETECTION Neural networks –Misuse detection and Novelty detection

9 CO5 CO6

Text Books:

1. Atul Kahate, "Cryptography and Network Security", Tata McGraw-Hill, 2003. 2. Bruce Schneier, "Applied Cryptography", John Wiley & Sons Inc, 2001. 3. Charles B. Pfleeger, Shari Lawrence Pfleeger, "Security in Computing", Third Edition, Pearson Education,

2003. 4. Kenneth C.Brancik “Insider Computer Fraud ” Auerbach Publications Taylor & Francis Group – 2008. 5. Ankit Fadia “ Ethical Hacking ” second edition Macmillan India Ltd , 2006

81

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 20 10 10 10

Remember 10 5

Understand 5 5

Apply 5

Analyze 10 5

Evaluate 5

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember

Understand 10

Apply 10

Analyze 10

Evaluate 10

Create 10

82

Decision Support System Course Code : 16MCA443 Credits : 03 L:P:T:S : 3:0:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Decision Support Systems are tools decision makers use to gain a better understanding of their business and customers.

CO2 Understanding Decision Making and Computerized Support

CO3 Analyzing Decision Support Systems

CO4 Analysing capabilities to help decision makers see avenues through which to gain competitive advantage.

CO5 Applying Enterprise Information Systems to various problems

CO6 Verifying the

Importance and role of knowledge management

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 2 3 2 - - 3 3

CO2 3 3 2 - - 2 3 2 - - 3 3

CO3 3 3 2 - - 2 3 2 - - 3 3

CO4 3 3 2 - - 2 3 2 - - 3 3

CO5 3 3 2 - - 2 3 2 - - 3 3

CO6 3 3 2 - - 2 3 2 - - 3 3

Syllabus

Module Contents of the Module Hours COs

1 Decision Making and Computerized Support – 1 Managers and Decision Making, Managerial-Decision Making and Information Systems, Managers and Computer Support, Computerized Decision Support and the Supporting technologies, A frame work for decision support, The concept of Decision Support systems, Group Decision Support Systems, Enterprise Information Systems, Knowledge Management systems, Expert Systems.

Decision Making and Computerized Support – 2 Phases of Decision- Making Process, Decision-Making: The Intelligence Phase, Decision Making: The Design Phase, Decision Making: The Choice Phase.

9 CO1, CO2

2 Decision Support Systems: An Overview DSS Configuration, What is DSS? Characteristics and Capabilities of DSS, Components of DSS, The Data Management Subsystem, The Model Management Subsystem, The User Interface Subsystem, The Knowledge-Based Management Subsystem, The User, DSS Hardware, DSS Classification.

9

CO1, CO3

83

Decision Support Systems Development Introduction to DSS development, The Traditional System Development Life cycle, Alternate Development Methodologies, Prototyping: The DSS Development Methodology, DSS Technology Levels and Tools, DSS Development Platforms.

3 Group Support Systems Group Decision Making, Communication and Collaboration, Communication Support, Collaboration Support: Computer-Supported Cooperative work. Group Support Systems

Group Support Systems, Group Support Systems Technologies, Group Systems Meeting Room and Online, The GSS Meeting Process, Distance Learning, Creativity and Idea Generation

9 CO1, CO4

4 Enterprise Information Systems Concepts and definitions, Evolution of Executive and Enterprise Information Systems, Executive’s roles and information needs, Characteristics and capabilities of Executive Support Systems, Comparing and integrating EIS and DSS. Supply and Value Chains and Decision Support

Supply and Value Chains and Decision Support, Supply Chain problems and solutions, MRP, ERP /ERM, SCM, CRM, PLM, BPM, and BAM.

9 CO1, CO5

5 Knowledge Management Introduction, Organizational learning and Transformation, Knowledge management initiatives, Approaches to Knowledge management, IT in Knowledge management. Importance and role of knowledge management

Knowledge management systems implications, Role of people in Knowledge management, Ensuring success of Knowledge management.

9 CO1, CO6

TEXT BOOKS:

1. Decision Support Systems for Business Intelligence, 2nd Edition, wiley publications 2. Decision-making support systems: Theory & practice, 2012 Udo Richard Franz Averweg &

bookboon.com REFERENCE BOOKS:

1. Decision Support Systems: A Historical Overview,Daniel J. Power 2. Foundations of Decision Support Systems,By Robert H. Bonczek, Clyde W. Holsapple, Andrew B.

Whinston

84

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

85

HEALTHCARE MANAGEMENT AND INFORMATION SYSTEMS

Course Code : 16MCA444 Credits : 03 L:P:T:S : 3:0:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand and Learn the concepts and theories in health care management information systems and security of healthcare information systems

CO2 Understand healthcare information types and data quality

CO3 Managing healthcare information and clinical information systems

CO4 Understand the changes in the health care industry and the renewed focus on health care information technology initiatives

CO5 Understand and analyze the concepts of healthcare information system standards and security of healthcare information

CO6 Understand and analyze the importance of information technology in healthcare

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 2 3 - - 1 - - 1 3 2 3

CO2 3 2 3 - - 1 - - 1 3 2 2

CO3 3 2 3 - - 1 - - 1 3 2 2

CO4 3 2 3 - - 1 - - 1 3 2 3

CO5 3 2 3 - - 1 - - 1 3 2 2

CO6 3 2 3 - - 1 - - 1 3 2 3

Syllabus

Module Contents of the Module Hours COs

1 Introduction to Health Care Information:Types of Health Care Information, Internal Data and Information, External Data and Information. Health Care Data Quality:Data versus Information, Problems with Poor-Quality Data, Ensuring Data and Information Quality.

9 CO1, C02

2 Health Care Information Regulations: Licensure, Certification, and Accreditation, Patient Safety Organizations. Laws, and Standards:Legal Aspects of Managing Health Information.

9

CO2, C03

3 History and Evolution of Health Care Information Systems: Definition of Terms, History and Evolution. Clinical Information Systems: The Electronic Health Record, Other Major HCIS Types, Fitting Applications Together, Overcoming Barriers to Adoption.

9 CO3

4 Technologies That Support Health Care Information Systems: Information Technology Adoption Challenges, Data Management and Access, Networks and Data Communications, Remote Access Technologies. Internet and Web Concepts and Applications: E-Commerce in Health Care, Clinical and Managerial Decision Support,

9 CO4, C06

86

Information Systems Architecture.

5 Health Care Information System Standards: Standards Development Process, Classification Standards. Security of Health Care Information Systems: The Health Care Organization’s Security Program, Threats to Health Care Information, Administrative Safeguards, Technical Safeguards, Security in a Wireless Environment, Remote Access Security.

9 C01, CO5

Text Books: 1. Health Care Information Systems: A Practical Approach for Health Care Management, Karen A. Wager,

Frances Wickham Lee, John P. Glaser, 3rd Edition, 2013, Jossey-Bass.

Reference Books:

2. Information Systems for Healthcare Management, Gerald L. Glandon, Donna J. Slovensky, Detlev H. Smaltz,

8thedition, 2013, Health Administration Pr.

3. Healthcare Information Management Systems, Cases, Strategies, and Solutions, Weaver, C.A., Ball,

M.J., Kim, G.R., Kiel, J.M, 2015, Health Informatics.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

87

Rich Internet Applications and Internet of Things

Course Code 16MCA445 Credits: 03

L:P:T:S 3:0:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To understand Rich Internet Applications (RIAs) using Adobe Flash, Flex 3

CO2 To gain the knowledge Ajax using XML

CO3 To understand knowledge about IOT, Protocols and physical devices

CO4 To understand knowledge SDN

CO5 To understand knowledge network function virtualization

CO6 To understand knowledge IoT Physical Devices and Endpoints

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - 3 - - 3 3

CO2 3 3 2 - - 1 - 3 - - 3 2

CO3 3 3 2 - - 1 - 3 - - 3 2

CO4 3 3 2 - - 1 - 3 - - 3 3

CO5 3 3 2 - - 1 - 3 - - 3 2

CO6 3 3 2 - - 1 - 3 - - 3 3

Syllabus

Module Contents of the Module Hours COs

1 Rich Internet Applications (RIAs) with Adobe Flash and Flex Adobe Flash- Introduction - Flash Movie Development, Learning Flash with Hands-on Examples, Publish your flash movie, Creating special effects with Flash, Creating a website splash screen, action script, web sources. Adobe Flex 2- Introduction, Flex Platform Overview, Creating a Simple User Interface, Accessing XML data from your application, Interacting with Server Side Applications, Customizing your User Interface, Creating Charts and Graphs, Connection Independent RIAs on the desktop -Adobe Integrated Runtime (AIR), Flex 3 Beta.

12 CO1

2 Ajax and Using XML Ajax- Enabled Rich Internet Application: Introduction, Traditional Web Applications Vs Ajax Applications, Rich Internet Application with Ajax, History of Ajax, Raw Ajax example using xml httprequest object Using XML Creating a full scale Ajax Enabled application, Dojo ToolKit.

9 CO2

3 IOT Introduction to Internet of Things –Definition and Characteristics of IoT, Physical Design of IoT – IoT Protocols, IoT communication models, Iot Communication APIs IoT enabaled Technologies – Wireless Sensor Networks, Cloud Computing, Big data analytics, Communication protocols, Embedded Systems

9 CO2, CO3

88

IoT Levels and Templates Domain Specific IoTs – Home, City, Environment, Energy, Retail, Logistics, Agriculture, Industry, health and Lifestyle.

4 IoT and M2M IoT and M2M – Software defined networks, network function virtualization, difference between SDN and NFV for IoT Basics of IoT System Management NETCOZF, YANG- NETCONF, YANG, SNMP NETOPEER

7 CO4

5 IoT Physical Devices and Endpoints Introduction to Raspberry PI-Interfaces (serial, SPI, I2C) Programming – Python program with Raspberry PI with focus of interfacing external gadgets, I/O controlling output, reading input from pins.

8 CO6

TEXT BOOKS:

1. AJAX, Rich Internet Applications, and Web Development for Programmers, Paul J Deitel and Harvey M Deitel, Deitel Developer Series, Pearson education. 2. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti, Universities Press, 2015 REFERENCE BOOKS: 3.Programming Flex 3, C.Kazoun and J.Lott,SPD. 4. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O'Reilly (SPD), 2014

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

89

ADOBE EXPERIENCE MANAGER

Course Code : 17MCA446 Credits: 03 L:P:T:S : 3:0:0:0 CIE Marks: 50 Exam Hours : 3 SEE Marks: 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Implement successfully online campaigns for business and marketing problems within the Organization

CO2 Gain a fresh perspective on online marketing in a global scenario

CO3 Develop a multi-channel strategy using search, social, PPC and programmatic buying that deliver on organization marketing objectives

CO4 Create online brand building initiatives using AEM

CO5 Integrate new digital marketing techniques and strategic marketing plan using AEM

CO6 Drive changes and foster innovation in Digital Marketing with AEM

Mapping of Course Outcomes to Program Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - 2 - - 2 - - 3 3

CO2 3 3 2 - 2 - - 2 - - 3 3

CO3 3 3 2 - 2 - - 2 - - 3 2

CO4 3 3 2 - 2 - - 2 - - 3 2

CO5 3 3 2 - 2 - - 2 - - 3

3

3

3

CO6 3 3 3 - 2 - 1 2 - - 3 3

SYLLABUS

Module Contents of the Module Hours

1 Introduction to DM & AEM Getting started with DM: What is online marketing? Characteristics of good domain name? What is digital marketing? Different methods of digital Marketing, Main methods of DM, Search engine optimization, pay per click & display advertising, email marketing, content marketing, social media marketing. FAQ’s Getting started with AEM: Introduction to Web content management, History of AEM ,The adobe marketing cloud, Install & deploy AEM, Author Instance, Publish Instance,AEM Consoles: Authoring in AEM, work with user interfaces: Classic UI, Touch optimized UI, AEM web console: OSGi management console, CRX Explorer, CRXDE Lite

9

CO1, CO2, CO6

Hands on: 1. AEM installation & deployment. 2. Working in AEM Environment

2 Introduction to Scripting Languages: Revisiting : XHTML , CSS, Javascript, JSP Introduction to Sightly

9

CO3

90

Hands on: 1. Creation of web pages using HTML & JavaScript 2. Creation of server side web pages using JSP 3. Creation of web pages using HTML & Slightly scripts

CO6

3 AEM Architecture OSGi framework: Introduction , AEM functional building blocks, Granite platform, Architecture stack, OSGi framework. Content Repository: JCR, Jackrabbit Oak, Adobe CRX. Introduction to JSON, MongoDB. Web Framework: REST, Apache Sling.

9

CO1, CO3 CO6 Hands on:

1. Familiarize yourself with a Repository structure. 2. Create a Node and add properties.

4 Managing Content AEM Authoring Framework —Templates, Create Templates, Components and Design ,components ,Create a Page-Rendering Component ,Modularize the Page Component ,Inheriting Foundation Components ,Types of Hierarchies - Resource Type Hierarchy , Container Hierarchy, Include Hierarchy , Overlays , Sling Resource Merger ,Overlays vs. Sling Resource Merger , Design , Adding a design to a page ,Creating Components and Include Them in Scripts, Create a Top Navigation Component, Dialog Boxes ,Create Dialog Boxes for Components, Dialog Box -Classic-UI ,touch-optimized UI ,Use Design Dialog Boxes for Global Content , Create a logo component.

9

CO4 CO6 Hands On

1. Create the Structure of Your Website 2. Create a Template for Your Website 3. Create a Page-Rendering Component 4. Create a Website Structure 5. Modularize the Page Component 6. Inherit the Sightly Foundation Component Page 7. Add a Design to the Page 8. Create a Top Navigation Component and Include it in a Script 9. Create a Training Title Component 10. Create a Logo Component

5 Digital Asset Management, Mobile pages, Managing Campaigns: Introduction to DAM, Basic DAM functions, DAM Metadata, DAM Components, Finding Assets, Asset Management, Authoring Mobile Pages, Touch enabled Authoring, Responsive Mobile Pages, Adding New content, Editing Page Properties, Managing Campaigns, Campaigns and the Brand, Leads and lists, Segmentation, Content Targeting,Introduction to Personalization – users, content, Rules. Personalization and Content Targeting Tools,Personalization Console,ContextHub,Landing Pages

9

CO4

,

CO

5

CO6

Hands on: 1. Create and customize asset share page 2. Add a predicate to the asset share page

91

1. Create the Structure of Your Website

2. Create a Template for Your Website

3. Adding a Page-Rendering Component

4. Modularize the Page Component

5. Inherit the Sightly Foundation Component Page

6. Add a Design to the Page

7. Create a Top Navigation Component and Include it in a Script

8. Create a Training Title Component

9. Create a Logo Component

10. Create and customize asset share page

3. Add an asset editor page 4. Versioning for assets 5. Create folders 6. Add CUG properties to folders 7. Use tags to organize assets 8. Edit images 9. Upload thumbnail 10. View references to assets 11. Edit metadata of an asset 12. Provide multiple titles for a page 13. Edit properties of multiple pages 14. Creating brand 15. Creating campaign 16. Defining a new segment 17. Create experiences 18. Turn a component into targeted component 19. Test the campaign

Text Books:

1. “Adobe Experience Manager: A practioners Guide” – Dr.V Ilango, Vishwanath C R, Mrs. Vandana, Shiva Balan, & others. 2017.

2. “Adobe Experience Manager: Classroom in a Book“, Ryan D Lunka , 2014, Adobe Press . 3. “Adobe Experience Manager: Quick Reference Guide“, Shane closser , 2014, Adobe Press . 4. ”Digital Marketing Handbook “ , Shivanikarwal ,2015 , CreateSpace Independent Publishing Platform

LEARNING PROJECT

The student shall be capable of identifying a problem related to the field of Digital marketing and carry out a mini project using Adobe experience manager (AEM) on the problem defined. Each student is expected to do the mini project individually. The code developed towards the project will be reviewed by a panel of experts during the course of the semester.

OBJECTIVES

To get exposure in developing websites using AEM environment Web pages can be created using the following components.

90

11. Add a predicate to the asset share page

12. Add an asset editor page

13. Versioning for assets

14. Create folders

15. Add CUG properties to folders

16. Use tags to organize assets

17. Edit images

18. Upload thumbnail

19. View references to assets

20. Edit metadata of an asset

21. Provide multiple titles for a page

22. Edit properties of multiple pages

23. Creating brand

24. Creating campaign

25. Defining a new segment

26. Create experiences

27. Turn a component into targeted component

28. Test the campaign

Assessment Pattern CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category

Tests

Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5

91

ELECTIVES – 6

SERVICE ORIENTED ARCHITECTURE

Course Code : 16MCA451 Credits : 03 L:P:T:S : 3:0:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand the basic principles of service orientation

CO2 Analyze the Web services framework

CO3 Understand the technology underlying the service design

CO4 Analyze the service layers

CO5 Applying the technologies support with SOA platform

CO6 Analyze the various WS-* specification standards

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 2 3 2 - - 3 - 3 1 - 2 3

CO2 2 3 2 - - 3 - 3 1 - 2 2

CO3 2 3 2 - - 3 - 3 1 - 2 2

CO4 2 3 2 - - 3 - 3 1 - 2 3

CO5 2 3 2 - - 3 - 3 1 - 2 2

CO6 2 3 2 - - 3 - 3 1 - 2 3

Syllabus

Module Contents of the Module Hours COs

1 Fundamentals of SOA: Introduction o SOA, Evolution of SOA: Fundamental SOA; Common Characteristics of contemporary SOA; Common tangible benefits of SOA; An SOA timeline (from XML to Web services to SOA); The continuing evolution of SOA (Standards organizations and Contributing vendors) Roots of SOA: Anatomy of SOA, How components in an SOA interrelate - Principles of service orientation.

9 CO1

2 Web Services and Primitive SOA : The Web services framework; Services (as Web services); Service descriptions (with WSDL); Messaging (with SOAP) Web Services and Contemporary SOA – 1: Message exchange patterns; Service activity; Coordination; Atomic Transactions; Business activities; Orchestration; Choreography

9

CO2, CO3

3 Web Services and Contemporary SOA – 2: Addressing; Reliable messaging; Correlation; Polices; Metadata exchange; Security; Notification and Eventing Principles of Service – Orientation: Services-orientation and the enterprise; Anatomy of a service-oriented architecture; Common Principles of Service-orientation; How service orientation

9 CO3

92

principles inter-relate; Service-orientation and object-orientation; Native Web service support for service-orientation principles

4 Service Layers: Service-orientation and contemporary SOA; Service layer abstraction; Application service layer, Business service layer, Orchestration service layer; Agnostic services; Service layer configuration scenarios

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)- Web Services Interoperability Technologies (WSIT)

9 CO4, CO5

5 WS-BPEL language basics: WS-Coordination overview; Service-oriented

business process design; WS-addressing language basics; WS-Reliable

Messaging language basics

SOA support in .NET: Common Language Runtime - ASP.NET web forms – ASP.NET web services – Web Services Enhancements (WSE)

9 CO5, CO6

Text Books: 1. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design”, Pearson Education, 2005.

Reference books:

1. Robert Daigneau, ”Service Design Patterns: Fundamental Design Solutions for SOAP/WSDL and RESTful Web Services”, 1st edition, Addison Wesley, 2011

2. Thomas Erl , “SOA Design patterns”, 1 edition, Prentice Hall PTR, 2009 Nicolai M. Josuttis, “SOA in Practice: The Art of Distributed System Design”, 1st edition, O'Reilly Media, 2007 Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

93

ENTERPRISES RESOURCES PLANNING Course Code : 16MCA452 Credits : 03 L:P:T:S : 3:0:0:0 CIE Marks : 50 Exam Hours : 3 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To understand the significance of ERP and their impact on organizational growth.

CO2 To learn ERP and related technology in terms of integrated data modeling.

CO3 To analyze ERP from the manufacturing perspective.

CO4 To understand the different type of ERP modules and their information flow.

CO5 To enable students to understand the ERP implementation life cycle.

CO6 Highlight the benefits of different ERP modules and Differentiate ERP modules with their

information flow

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 2 2 - - 3 3

CO2 3 3 2 - - 1 2 2 - - 3 2

CO3 3 3 2 - - 1 2 2 - - 3 2

CO4 3 3 2 - - 1 2 2 - - 3 3

CO5 3 3 2 - - 1 2 2 - - 3 2

CO6 3 3 2 - - 1 2 2 - - 3 3

Syllabus

Module Contents of the Module Hours COs

1 Introduction to ERP: Introduction, Evolution of ERP, What is ERP?, Reasons for the growth of the ERP market, The advantages of ERP, Why do Man ERP Implementations Fail? Why are ERP packages Being used Now? Enterprise – An Overview: Introduction, Integrated Management Information, Business modeling, Integrated Data Model.

9 CO1

2 ERP and Related Technologies: Introduction, Business Process Reengineering, Management Information System, Decision Support System, Executive Information Systems, Data Warehousing, Data Mining, On-line Analytical Processing, Supply Chain Management.

9 CO5

3 ERP - Manufacturing Perspective: Introduction, ERP. CAD/CAM, Materials Requirements Planning, Bill of Material, Closed Loop MRP. Manufacturing Resource Planning, Distribution Requirements Planning, JIT and Kanban, Product Data Management, Benefits of PDM, Make-to-order, and Make-to Stock, Assemble to order, Engineer to order, Configure-to order.

9 CO2, CO3

4 ERP Modules: Introduction, Finance, Plant Maintenance, Quality 9 CO5

94

Management, Materials Management. Benefits of ERP: Introduction, Reduction of Lead time, On-time shipment, Reduction in Cycle Time, Improved Resource Utilization, Better Customer Satisfaction, Improved Suppler Performance, Increased Flexibility, Reduced Quality Costs, Improved Information Accuracy and Decision – making capability.

5 ERP Implementation Life Cycle: Pre-evaluations Screening, Package Evaluation, Project Planning Phase, Gap Analysis, Reengineering, Configuration, Implementation of Team Training, Testing, Going Live, End user Training, Post implementation Vendor, Consultants and Users: Introduction, In-house implementation – Pros and Cons, Vendors, Consultants, End-users.

9 CO6

Text Books : 1. Enterprise Resource Planning Alexis Leon -, Tata Mc Graw Hill Publishing Company Ltd -2002.

2. Vinod Kumar Garg and Venkitakrishnan -Enterprise Resource Planning Concept and Practice, Prentice Hall, India - 2nd Edition, 2004 Reference:

1. Thomas Volloman, et,al -Manufacturing Planning & Controls. Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

95

XML and Its Applications Course Code : 16MCA453 Credits : 03 L:P:T:S : 3:0:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To learn XML & to understand its applications

CO2 Write the schema for the given XML documents in both DTD and XML Schema languages

CO3 Format XML data to the desired format

CO4 Parse XML documents by using DOM, SAX, and STAX

CO5 Create, deploy, and call Web services using Java, PHP, C# .NET,

CO6 Understand Web Services and its Infrastructure, Use of SOAP, Building a Web Service, Deploying and Publishing Web Services

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - 3 2 - 3 3

CO2 3 3 2 - - 1 - 3 2 - 3 2

CO3 3 3 2 - - 1 - 3 2 - 3 2

CO4 3 3 2 - - 1 - 3 2 - 3 3

CO5 3 3 2 - - 1 - 3 2 - 3 2

CO6 3 3 2 - - 1 - 3 2 - 3 3

Syllabus

Module Contents of the Module Hours COs

1 INTRODUCTION Part-1: Role Of XML - XML and The Web - XML Language Basics - SOAP Part-2: Web Services - Revolutions Of XML - Service Oriented Architecture (SOA).

9 CO2

2 XML TECHNOLOGY Part-1: XML - Name Spaces - Structuring With Schemas and DTD Part-2: Presentation Techniques - Transformation - XML Infrastructure.

9 CO3

3 SOAP Part-1: Overview Of SOAP - HTTP - XML-RPC - SOAP: Protocol - Message Structure - Intermediaries Part-2: Actors - Design Patterns And Faults - SOAP With Attachments.

9 CO4

4 WEB SERVICES Part-1: Overview - Architecture - Key Technologies - UDDI - WSDL

9 CO5

96

Part-2: ebXML - SOAP And Web Services In E-Com - Overview Of .NET And J2EE.

5 XML SECURITY - 9 Part-1: Security Overview - Canonicalization - XML Security Framework - XML Encryption Part-2: XML Digital Signature - XKMS Structure - Guidelines For Signing XML Documents - XML In Practice.

9 CO6

Text Books: 1. XML, Web Services And The Data Revolution, Frank. P. Coyle, 2012, Pearson Education.

Reference books:

1. Developing Java Web Services, Ramesh Nagappan , Robert Skoczylas and Rima Patel Sriganesh, 2004, Wiley Publishing Inc..

2. Developing Enterprise Web Services, Sandeep Chatterjee, James Webber, 2004, Pearson Education. 3. Java Web Services Architecture, McGovern, et al., 2005, Morgan Kaufmann Publishers.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

97

CLOUD COMPUTING

Course Code : 16MCA454 Credits : 03

L:P:T:S : 3:0:0:0 CIE Marks : 50

Exam Hours : 3 SEE Marks : 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To introduce the broad perceptive of cloud architecture and model

CO2 To understand the concept of Virtualization and design of cloud Service models

CO3 To be familiar with the cloud platforms

CO4 To understand the features of cloud programming environments

CO5 To apply different cloud programming model as per need.

CO6 To learn cloud software environment

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 - - 2 - - - - 2 2 3

CO2 3 3 - - 2 - - - - 2 2 3

CO3 3 3 - - 2 - - - - 2 2 2

CO4 3 3 - - 2 - - - - 2 2 3

CO5 3 3 - - 2 - - - - 2 2 2

CO6 3 3 - - 2 - - - - 2 2 3

Module

No

Module Content Hours Cos

1

Distributed System Models and Enabling Technologies

Scalable Computing Service over the Internet: The Age of

Internet Computing, scalable computing Trends and New Paradigms, Internet of Things and Cyber-Physical Systems.

System Models for Distributed and Cloud Computing: Clusters of Cooperative Computers, Grid Computing Infrastructures,

Peer-to-Peer Network Families, Cloud Computing over the

Internet. Software Environments for Distributed Systems and

Clouds: Service-Oriented Architecture (SOA), Trends towards

Distributed Operating Systems, Parallel and Distributed

Programming Models. Performance, Security, and Energy- Efficiency: Performance Metrics and Scalability Analysis, Fault-

Tolerance and System Availability, Network Threats and Data Integrity, Energy-Efficiency in Distributed Computing

9

CO1

98

2

Cloud Platform Architecture over Virtualized Data Centers

Cloud computing and Service Models: Public, Private, and

Hybrid Clouds, Cloud Ecosystem and Enabling

Technologies, Infrastructure-as- a- Service (IaaS), Platform-

and Software-as-a- Service (Paas, SaaS). Architectural

Design of Compute and Storage Clouds: A Generic Cloud

architecture Design, Layered Cloud Architectural

development, Virtualization Support and Disaster

Recovery, Architectural Design Challenges. Performance of

Distributed Systems and the Cloud Data-intensive Scalable

Computing (DISC), Quality of Service in Cloud computing,

Benchmarking MPI, Azure, EC2, MapReduce and Hadoop.

9

CO2

3

Public Cloud Platforms GAE, AWS, and Azure: Smart Cloud,

Public Clouds and Service Offerings, Google App Engine

(GAE), Amazon Web Service (AWS), Microsoft Windows

Azure. Inter- cloud Resource Management: Extended

Cloud Computing Services, Resource Provisioning and

Platform Deployment, Virtual Machine Creation and

Management.

Cloud Security and Trust management: Cloud Security

Defense Strategies, Distributed Intrusion/Anomaly

Detection, Data and Software Protection Techniques.

9

CO3

4

Cloud Programming and Software Environments

Features of Cloud and Grid Platforms: Cloud Capabilities

and Platform Features, Traditional Features Common to

Grids and Clouds, Data Features and Databases,

Programming and Runtime Support. Parallel and

Distributed Programming Paradigms: Parallel Computing

and Programming Paradigms, MapReduce, Twister and

Iterative MapReduce, Hadoop Library from Apache.

9

C04

5

Programming the Google App Engine, Google File System

(GFS), Bigtable, Google’s NOSQL system, Chubby, Google’s

Distributed Lock service. Programming on Amazon AWS

and Microsoft Azure: Programming on Amazon EC2,

Amazon Simple Storage Service S3, Amazon Elastic Block

Store EBS and SimpleDB, Microsoft Azure programming

support. Emerging Cloud Software Environments: Open

Source Eucalyptus and Nimbus, Open Nebula,

Sector/Sphere, and OpenStack

9

CO5, CO6

99

TEXT BOOKS:

1. Distributed and Cloud Computing, From Parallel Processing to the Internet of Things, Kai Hwang, Jack Dungaree, and Geoffrey Fox, MK Publishers, 2012.

2. Cloud Computing: Web-Based Applications that change the Way you work and collaborate Online, Michael Miller, Pearson Publication, 2012.

REFERENCE BOOKS:

1. Cloud Computing, A Practical Approach, Anthony T. Volte, Toby J. Volte, Robert Elsenpeter, McGraw Fill, 2010.

2. Cloud Computing for Dummies: J. Hurwitz, ISBN 978-0-470-484-8 3. Cloud Computing, Dr. Kumar Sourabh, 2nd Edition, Wiley India.

4. Cloud Application Architectures: Building Applications and Infrastructure in the Cloud, George Reese, O'Reilly

5. Mastering Cloud Computing, Rajkumar Buyya, Christian Vecchiola, S.Thamarai Selvi, TMGH, 2013.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Taxonomy

Tests Assignments Quizzes

Marks 30 10 10

Remember 5 - 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2 -

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5 Create 5

90

CLOUD COMPUTING

Course Code : 16MCA454 Credits : 03

L:P:T:S : 3:0:0:0 CIE Marks : 50

Exam Hours : 3 SEE Marks : 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 To introduce the broad perceptive of cloud architecture and model

CO2 To understand the concept of Virtualization and design of cloud Service models

CO3 To be familiar with the cloud platforms

CO4 To understand the features of cloud programming environments

CO5 To apply different cloud programming model as per need.

CO6 To learn cloud software environment

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 - - 2 - - - - 2 2 3

CO2 3 3 - - 2 - - - - 2 2 3

CO3 3 3 - - 2 - - - - 2 2 2

CO4 3 3 - - 2 - - - - 2 2 3

CO5 3 3 - - 2 - - - - 2 2 2

CO6 3 3 - - 2 - - - - 2 2 3

Module

No

Module Content Hours Cos

1

Distributed System Models and Enabling Technologies

Scalable Computing Service over the Internet: The Age of

Internet Computing, scalable computing Trends and New Paradigms, Internet of Things and Cyber-Physical Systems.

System Models for Distributed and Cloud Computing: Clusters of Cooperative Computers, Grid Computing Infrastructures,

Peer-to-Peer Network Families, Cloud Computing over the

Internet. Software Environments for Distributed Systems and

Clouds: Service-Oriented Architecture (SOA), Trends towards

Distributed Operating Systems, Parallel and Distributed

Programming Models. Performance, Security, and Energy- Efficiency: Performance Metrics and Scalability Analysis, Fault-

Tolerance and System Availability, Network Threats and Data Integrity, Energy-Efficiency in Distributed Computing

9

CO1

91

2

Cloud Platform Architecture over Virtualized Data Centers

Cloud computing and Service Models: Public, Private, and

Hybrid Clouds, Cloud Ecosystem and Enabling

Technologies, Infrastructure-as- a- Service (IaaS), Platform-

and Software-as-a- Service (Paas, SaaS). Architectural

Design of Compute and Storage Clouds: A Generic Cloud

architecture Design, Layered Cloud Architectural

development, Virtualization Support and Disaster

Recovery, Architectural Design Challenges. Performance of

Distributed Systems and the Cloud Data-intensive Scalable

Computing (DISC), Quality of Service in Cloud computing,

Benchmarking MPI, Azure, EC2, MapReduce and Hadoop.

9

CO2

3

Public Cloud Platforms GAE, AWS, and Azure: Smart Cloud,

Public Clouds and Service Offerings, Google App Engine

(GAE), Amazon Web Service (AWS), Microsoft Windows

Azure. Inter- cloud Resource Management: Extended

Cloud Computing Services, Resource Provisioning and

Platform Deployment, Virtual Machine Creation and

Management.

Cloud Security and Trust management: Cloud Security

Defense Strategies, Distributed Intrusion/Anomaly

Detection, Data and Software Protection Techniques.

9

CO3

4

Cloud Programming and Software Environments

Features of Cloud and Grid Platforms: Cloud Capabilities

and Platform Features, Traditional Features Common to

Grids and Clouds, Data Features and Databases,

Programming and Runtime Support. Parallel and

Distributed Programming Paradigms: Parallel Computing

and Programming Paradigms, MapReduce, Twister and

Iterative MapReduce, Hadoop Library from Apache.

9

C04

5

Programming the Google App Engine, Google File System

(GFS), Bigtable, Google’s NOSQL system, Chubby, Google’s

Distributed Lock service. Programming on Amazon AWS

and Microsoft Azure: Programming on Amazon EC2,

Amazon Simple Storage Service S3, Amazon Elastic Block

Store EBS and SimpleDB, Microsoft Azure programming

support. Emerging Cloud Software Environments: Open

Source Eucalyptus and Nimbus, Open Nebula,

Sector/Sphere, and OpenStack

9

CO5, CO6

92

TEXT BOOKS:

1. Distributed and Cloud Computing, From Parallel Processing to the Internet of Things, Kai Hwang, Jack Dungaree, and Geoffrey Fox, MK Publishers, 2012.

2. Cloud Computing: Web-Based Applications that change the Way you work and collaborate Online, Michael Miller, Pearson Publication, 2012.

REFERENCE BOOKS:

1. Cloud Computing, A Practical Approach, Anthony T. Volte, Toby J. Volte, Robert Elsenpeter, McGraw Fill, 2010.

2. Cloud Computing for Dummies: J. Hurwitz, ISBN 978-0-470-484-8 3. Cloud Computing, Dr. Kumar Sourabh, 2nd Edition, Wiley India.

4. Cloud Application Architectures: Building Applications and Infrastructure in the Cloud, George Reese, O'Reilly

5. Mastering Cloud Computing, Rajkumar Buyya, Christian Vecchiola, S.Thamarai Selvi, TMGH, 2013.

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Taxonomy

Tests Assignments Quizzes

Marks 30 10 10

Remember 5 - 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2 -

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5

93

CYBER FORENSIC AND CYBER LAW

Course Code : 16MCA455 Credits : 03 L:P:T:S : 3:0:0:0 CIE Marks : 50 Exam Hours : 03 SEE Marks : 50 Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understanding about Cybercrime and Newsgroup

CO2 Understanding about Cyber offenses and cyberstalking

CO3 Understanding about cyber crime to mobile and fishing

CO4 Understanding about CyberLaw and Cyber security

CO5 Understanding about Cyber Forensics and Precuation

CO6 Understanding about Cyber crime and related Law and Cyber Forensics

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - 3 2 - 3 3

CO2 3 3 2 - - 1 - 3 2 - 3 2

CO3 3 3 2 - - 1 - 3 2 - 3 2

CO4 3 3 2 - - 1 - 3 2 - 3 3

CO5 3 3 2 - - 1 - 3 2 - 3 2

CO6 3 3 2 - - 1 - 3 2 - 3 3

Syllabus

Module Contents of the Module Hours COs

1 Introduction to Cybercrime: Introduction, Cybercrime: Definition and Origins of the Word, Cybercrime and Information Security, Who are Cybercriminals? Classifications of Cybercrimes: E-Mail Spoofing, Spamming, Cyber defamation, Internet Time Theft Newsgroup Spam Crimes Emanating from Usenet Newsgroup, Industrial Spying/Industrial Espionage, Hacking, Online Frauds, Pornographic Offenses , Software Piracy, Password Sniffing, Credit Card Frauds, Identity Theft

9 CO1

2 Cyber Offenses: How Criminals Plan Them Introduction, Categories of Cybercrime, How Criminals Plan the Attacks: Passive Attack, Active Attacks, Scanning/Scrutinizing gathered Information, Attack (Gaining and Maintaining the System Access), Social Engineering Cyberstalking:

9 CO2

94

Types of Stalkers, Cases Reported on Cyberstalking, How Stalking Works? Real-Life Incident of Cyberstalking, Cybercafe and Cybercrimes, Botnets: The Fuel for Cybercrime, Botnet, Attack Vector

3 Cybercrime: Mobile and Wireless Devices Introduction, Proliferation of Mobile and Wireless Devices, Trends in Mobility, Credit Card Frauds in Mobile and Wireless Computing Era: Types and Techniques of Credit Card Frauds, Security: Cryptographic Security for Mobile Devices, LDAP Security for Hand-Held Mobile Computing Devices Phishing and Identity Theft Introduction, Phishing: Methods of Phishing, Phishing Techniques, Spear Phishing, Types of Phishing Scams, Phishing Toolkits and Spy Phishing, Phishing Countermeasures

9 CO3

4 Cyber Law: Cybercrimes Introduction, Why Do We Need Cyberlaws: The Indian Context, The Indian IT Act: Admissibility of Electronic Records: Amendments made in the Indian ITA 2000, Positive Aspects of the ITA 2000, The Weak Areas of the ITA 2000 Cyber Security: Challenges to Indian Law and Cybercrime Scenario in India, Consequences of Not Addressing the Weakness in Information Technology Act Amendments to the Indian ITA 2008: Overview of Changes Made to the Indian IT Act, Cybercafe- Related Matters Addressed in the Amendment to the Indian IT Act, State Government Powers Impacted by the Amendments to the Indian IT Act

9 CO4

5 Computer Forensics Introduction, Historical Background of Cyberforensics, Digital Forensics Science, The Need for Computer Forensics, Cyberforensics and Digital Evidence: The Rules of Evidence,Forensics Analysis of E-Mail: RFC282, Digital Forensics Life Cycle: The Digital Forensics Process,The Phases in Computer Forensics/Digital Forensics Precautions to be Taken when Collecting Electronic Evidence: Chain of Custody Concept, Network Forensics, Approaching a Computer Forensics Investigation: Typical Elements Addressed in a Forensics Investigation Engagement Contract, Solving a Computer Forensics Case, Setting up a Computer Forensics Laboratory: Understanding the Requirements

9 CO5

95

Text Books: 1. Cyber Security Understanding Cyber Crimes, Computer Forensics and Legal Perspectives – Nina Godbole, Sunit Belapur, Wiley : April 2011 India Publications Released 2. Windows Forensics: The field guide for conducting corporate computer investigations - Chad Steel, Wiley , December 2006 India Publications

Reference books:

1. Internet Forensics: Using Digital Evidence to Solve Computer Crime- Robert Jones, O’Reilly Media, Released: October 2005

Assessment Pattern

CIE- Continuous Internal Evaluation (50 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 50) 30 10 10

Remember 10 5

Understand

Apply 20 10 5

Analyze

Evaluate

Create

SEE- Semester End Examination (50 Marks)

Bloom’s Category Tests

Remember 10

Understand 10

Apply 30

Analyze

Evaluate

Create

96

VMWARE VIRTUALIZATION

Course Code : 16MCA456 Credits: 03

L:P:T:S : 3:0:0:0 CIE Marks: 50

Exam Hours : 3 SEE Marks: 50

Course Outcomes: At the end of the Course, the Student will be able to:

CO1 Understand the common terms and definitions of virtualization.

CO2 Comprehend the business benefits and business considerations of virtualization

CO3 Understand various approaches to server virtualization, its relevance to the modern data centre, available platforms and important features.

CO4 Understand the implications of virtualization on storage, networks, and applications, and recognize issues, challenges, and opportunities for managing this.

CO5 Understand the impact and changes of virtualization on IT service management.

CO6 Explain typical steps that lead to the successful adoption of virtualization techniques, and understand the implications for an organization.

Mapping of Course Outcomes to Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 - - - 2 - - - 2 2 3

CO2 3 3 - - - 2 - - - 2 2 2

CO3 3 3 - - - 2 - - - 2 2 2

CO4 3 3 - - - 2 - - - 2 2 3

CO5 3 3 - - - 2 - - - 2 2 2

CO6 3 3 - - - 2 - - - 2 2 3

97

SYLLABUS

Module Contents of the Module Hours

1 Understanding virtualization: Describing Virtualization: Microsoft Windows Drives Server Growth, Explaining Moore’s Law, Understanding the Importance of Virtualization: Examining Today’s Trends, Virtualization and Cloud Computing, Understanding Virtualization Software Operations: Virtualizing Servers, Virtualizing Desktops, Virtualizing Applications. Understanding Hypervisors: Describing a Hypervisor: Exploring the history of Hypervisor , Understanding Type 1 Hypervisor , Understanding Type 2 Hypervisor, Understanding the role of a Hypervisor: Holodecks and Traffic Cops, Resource Allocation ,Comparing Today’s Hypervisor: Vmware ESX , Citrix Xen, Microsoft Hyper -V, Other Solutions. Understanding Virtual Machines Describing a Virtual Machine: Examining CPU’s in a Virtual Machine, Examining Memory in a Virtual Machine, Examining Network Resources in a Virtual Machine, Examining Storage in a Virtual Machine

9

CO1, CO2, CO3

Understanding How a Virtual Machine works, Working with Virtual Machines: Understanding Virtual Machine Clones, Understanding Templates, Understanding Snapshots, Understanding OVF, Understanding Containers.

Hands on : 2. Installing Vmware Workstation, Creating a virtual machine and

configuring its options 3. Modifying Virtual Machine Settings

2 Creating a Virtual Machine: Performing P2V Conversions: Investigating the Physical-to-Virtual Process, Hot and Cold Cloning Loading Your Environment: Loading VMware Workstation Player, Exploring VMware Player, Loading Virtual Box, Building a New Virtual Machine: Thinking About VM Configuration, Creating a First VM. Installing a Guest OS Installing Windows on a Virtual Machine, Loading Windows into Virtual Machine: Installing Windows10, Installing VMware Tools, Understanding Configuration Options Optimizing a New Virtual Machine, Installing Linux on a Virtual Machine Loading Linux into a Virtual Machine: Exploring Oracle VM Virtual Box, Installing Linux into a Virtual Machine, Installing Virtual Box Guest Additions Understanding Configuration Options, Optimizing a New Linux Virtual Machine.

9

CO2 CO4

98

Hands on : 1. Installing Linux guest operating system and VMware Tools on the

Virtual Machines. 2. Modifying Virtual Machine Settings.

3 Managing the Hardware for VM: Managing CPUs for a Virtual Machine: Understanding CPU Virtualization, Configuring VM CPU Options, Tuning Practices for VM CPUs : Choosing Multiple vCPUs vs. a Single vCPU, Hyper-Threading, Working with Intel and AMD Servers. Managing Memory for a Virtual Machine: Understanding Memory Virtualization, Configuring VM Memory Options, Tuning Practices for VM Memory: Calculating Memory Overhead, Memory Optimizations. Managing Storage for a Virtual Machine: Understanding Storage Virtualization, Configuring VM Storage Options, Tuning Practices for VM Storage. Managing Networking for a Virtual Machine: Understanding Network Virtualization, Configuring VM Network Options, Tuning Practices for Virtual Networks.

9

CO4, CO5 CO6

Hands on : 1. Manage virtual machine power settings and snapshots 2. Use vSphere vMotion to migrate a virtual machine and vSphere

Storage vMotion to migrate a virtual machine data store

4 Protecting Virtual Machine: Cloning a Virtual Machine Working with Templates, Saving a Virtual Machine State: Creating a Snapshot, Merging Snapshots, Understanding Availability Increasing Availability , Protecting a Virtual Machine , Protecting Multiple Virtual Machines Protecting Data centers.

9

CO5 CO6

Understanding Applications in a Virtual Machine Examining Virtual Infrastructure Performance Capabilities, Deploying Applications in a Virtual Environment, Understanding Virtual Appliances and vApps, Open Stack and Containers.

Hands on : 1. Create and deploy virtual machine clones and templates and

customize a guest operating system 2. Using vSphere vApps, Managing Multitiered Applications

5 vSphere: Introducing VMware vSphere 6:Planning and Installing VMware ESXi (lab exercise)(Pg. No:30 -53),Creating and Configuring Virtual Network (Lab Exercise), Putting together a Virtual Network, Working with vSphere Standard Switches (Pg no:182-196), Creating and Configuring Storage Devices, Implementing vSphere Storage Fundamentals, Creating and Managing VM (Lab exercise), Using Templates and vApps(Lab exercise).

9

CO4, CO5

99

Bloom’s Category

Tests

Remember 10

Understand 10

Apply 10

Analyze 10

Evaluate 5

Create 5

Hands on : 1. Use vSphere vMotion to migrate a virtual machine and vSphere

Storage vMotion to migrate a virtual machine data store 2. Implement a vSphere DRS cluster

CO6

Text Books: 1. “Virtualization Essentials”, Matthew Portnoy, 2nd Edition, Wiley India Pvt. Ltd. 2. Mastering VMware vSphere 6, Nick Marshall, Scott Lowe (Foreword by) with Grant Orchard, Josh Atwell.

Assessment Pattern CIE- Continuous Internal Evaluation (50Marks) Theory

Bloom’s Taxonomy

Tests Assignments Quizzes

Marks 30 10 10

Remember 5 - 2

Understand 5 2 2

Apply 5 2 2

Analyze 5 2 2

Evaluate 5 2 2

Create 5 2 -

SEE- Semester End Examination (50 Marks) Theory

100

MINI PROJECT USING J2EE AND JSP

Course Code 16MCA46 Credits 03

L:P:T:S 0:3:0:0 CIE Marks 50

Exam Hrs 03 SEE Marks 50

Course Objectives:

To get depth knowledge of J2EE and JSP

To get exposure in developing an application based on J2EE and JSP.

MINI PROJECT WORK:

This mini project is based on any concept using J2EE and JSP. Simple projects need to be

developed

Expected Course Outcome:

Students will get depth knowledge of J2EE and JSP.

Students will get exposure in developing an application based on J2EE and JSP.

Assessment Method:

The marks of the main project would be given on the basis of Power Point Demonstration on

Project, uniqueness of the report and viva. Project must be done in a group of 2 to 3 students.

CIE:

Power Point Demonstration on Project – 20 marks

Project completion and documentation – 20 marks

Attending the reviews - 5 marks

Viva - 5 marks

SEE: Project completion and documentation – 20 marks, Project Demonstration – 20 marks Viva - 10 marks

101

PROFESSIONAL ETHICS FOR SOFTWARE ENGINEERS Course Code : 16MCA47 Credits : 02 L:P:T:S : 2:0:0:0 CIE Marks : 25 Exam Hours : 02 SEE Marks : 25 COURSE OBJECTIVES

CO1 To understand the intricacies of accessibility issues

CO2 To understand the threats in computing environment

CO3 To understand the concepts of computer ethics in work environment.

CO4 To ensure safe exits when designing the software projects

Mapping of Course Outcomes to Program Outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2

CO1 3 3 2 - - 1 - 3 2 - 3 3

CO2 3 3 2 - - 1 - 3 2 - 3 2

CO3 3 3 2 - - 1 - 3 2 - 3 2

CO4 3 3 2 - - 1 - 3 2 - 3 3

CO5 3 3 2 - - 1 - 3 2 - 3 2

CO6 3 3 2 - - 1 - 3 2 - 3 3

Syllabus

Module Contents of the Module Hours COs

1 COMPUTER ETHICS INTRODCUTION AND COMPUTER HACKING A general Introduction – Computer ethics: an overview – Identifying an ethical issue – Ethics and law – Ethical theories - Professional Code of conduct – An ethical dilemma – A framework for ethical decision making - Computer hacking – Introduction – definition of hacking – Destructive programs – hacker ethics - Professional constraints – BCS code of conduct – To hack or not to hack? – Ethical positions on hacking

9 CO1

2 ASPECTS OF COMPUTER CRIME AND INTELLECTUAL PROPERTY RIGHTS Aspects of computer crime - Introduction - What is computer crime – computer security measures – Professional duties and obligations - Intellectual Property Rights – The nature of Intellectual property – Intellectual Property – Patents, Trademarks, Trade Secrets, Software Issues, Copyright - The extent and nature of software piracy – Ethical and professional issues – free software and open source code

9 CO2

3 REGULATING INTERNET CONTENT, TECHNOLOGY AND SAFETY Introduction – In defence of freedom expression – censorship – laws upholding free speech – Free speech and the Internet - Ethical and professional issues - Internet technologies and privacy – Safety and risk – assessment of safety and risk – risk benefit analysis – reducing risk

9 CO3,

4

COMPUTER TECHNOLOGIES ACCESSIBILITY ISSUES Introduction – Principle of equal access – Obstacles to access for individuals – professional responsibility - Empowering computers in the workplace – Introduction – computers and employment – computers and the quality of work – computerized monitoring in the work place – telecommuting

9 CO3, CO4

102

– social, legal and professional issues - Use of Software, Computers and Internet-based Tools - Liability for Software errors - Documentation Authentication and Control – Software engineering code of ethics and practices – IEEE-CS – ACM Joint task force

5 SOFTWARE DEVELOPMENT AND SOCIAL NETWORKING Software Development – strategies for engineering quality standards – Quality management standards – Social Networking – Company owned social network web site – the use of social networks in the hiring process – Social Networking ethical issues – Cyber bullying – cyber stalking – Online virtual world – Crime in virtual world - digital rights management - Online defamation – Piracy – Fraud

9 CO5 CO6

REFERENCES:

1. Penny Duquenoy, Simon Jones and Barry G Blundell, “Ethical , legal and professional issues in computing”,

Middlesex University Press, 2008 2. George Reynolds, “Ethics in Information Technology”, Cengage Learning, 2011 3. Caroline Whitback,” Ethics in Engineering Practice and Research “, Cambridge University Press, 2011 4. Richard Spinello, “Case Studies in Information and Computer Ethics”, Prentice Hall, 1997. 5. John Weckert and Douglas Adeney, Computer and Information Ethics, Greenwood Press, 1997. 6. Sara Baase, “A Gift of Fire: Social, Legal, and Ethical Issues for Computing and the Internet”,3rd Edition,Prentice Hall, 2008 7. http://www.infosectoday.com/Articles/Intro_Computer_Ethics.htm

Assessment Pattern

CIE- Continuous Internal Evaluation (25 Marks)

SEE- Semester End Examination (25 Marks)

Bloom’s Category Tests Assignments Quizzes Self Study Mini Project Seminar

Marks (out of 25) 10 5 5 5

Remember

Understand 3 3 3 3

Apply 3

Analyze 2 2 2

Evaluate 2

Create 2

Bloom’s Category Tests

Remember

Understand 5

Apply 5

Analyze 5

Evaluate 5

Create 5