FACULTY OF MANAGEMENT- UG BACHELOR OF COMPUTER ... › wp-content › uploads › 2019 › 08 ›...

Dr. Kalyan Swarup

Dean, Management (UG)

SYLLABUS

DR. VISHWANATH KARAD MIT - WORLD PEACE UNIVERSITY

FACULTY OF MANAGEMENT- UG

BACHELOR OF COMPUTER APPLICATIONS

BATCH – 2017-2020

Dr. Kalyan Swarup


PROGRAMME STRUCTURE

BCA is 3 years full time professional credit based applied course including mathematics

and electronics along with computer science subjects that will provide theoretical

foundation for students of Computer Science.

Fast growing information technology and communication systems have become critical

components of almost every company's strategic plan. Companies which want to take

advantage of the new information technologies and communication systems require expert

professionals, who can apply computer science principles to solve problems produced by

the interface between business and technology.

BCA programme aims to develop academically competent and professionally motivated

computer personnel, equipped with objective and critical thinking that compassionately

foster the scientific temper with a sense of social responsibility.

BCA course is meant to heighten technological know-how, to train students to become

industry specialists, to provide research-based training and to encourage software

development.

Dr. Kalyan Swarup


VISION AND MISSION

VISION:

To be an innovative, vibrant and acclaimed premier educational program engaged in

promoting and grooming talents through our recital, our people and commitment to our

core values, thereby producing enduring learners who are able to compete globally.

To be a world leader in computer education, research and engagement, helping to create a

better knowledge society.

To ensure that every student gets the best opportunity to build career.

To build the culture of research, innovation & excellence while being firm on Values.

MISSION:

To provide high-quality, affordable and accessible educational programmes, which will

enhance the quality of the human resources available to the job markets.

To empower students to be successful by helping them develop the knowledge, skills and

abilities needed to enter or progress within the work force and to adapt and thrive in our

increasingly diverse and ever-changing world through continuous learning.

Offering the best professional development and career management opportunities for our

students.

Committing to continuous improvement through stakeholder engagement, industry

relations, and assurance of learning across all programs

Dr. Kalyan Swarup


PROGRAMME EDUCATIONAL OBJECTIVES

i. This course aims at inculcating essential skills as demanded by the global software industry

through interactive learning process.

ii. The curriculum is designed to cater to the ever-changing demands of Information

Technology (IT) by regular and timely inputs from the Industry. MIT-WPU-BCA course is

meant to heighten technological expertise, to train students to become industry specialists,

to provide research-based training and to encourage software development

iii. Successfully understand & analyze technical data to reach actionable conclusions, including

technological solutions to the business.

iv. Learn technologies & IT languages, so the business problems could be addressed.

v. To inculcate Entrepreneurial skills among students.

PROGRAMME SPECIFIC OUTCOMES

To produce employable IT workforce, that will have sound knowledge of IT and business

fundamentals that can be applied to develop and customize solutions for Small and Medium

Enterprises (SME)

To develop skilled manpower in the various areas of information technology like: Database

management, Software Development, Computer-Languages, Software engineering, Web based

applications etc.

Dr. Kalyan Swarup


PROGRAMME STRUCTURE:

(a) PROGRAMME DURATION: 03 years full time course

(b) SYSTEM FOLLOWED: Trimester pattern

(c) CREDIT SYSTEM:

Sr

No

Year Credits

1 First Year 47

2 Second Year 49

3 Third Year 51

Total Credits 147

(d) CREDITS FOR ACTIVITIES OTHER THAN ACADEMICS:

TY BCA

Sr.

No.

Year Particulars Credits

1 Third Year Certification Course 4 03

2 Third Year Certification Course 5 02

3 Third Year Value Added Program 02

Total 07

(e) ASSESSMENT CRITERIA:

Pattern of Examination:

The evaluation scheme comprises of:

a) University Evaluation

b) Concurrent Evaluation

For each credit course –

a) 50 marks shall be evaluated by the University and

b) 50 marks shall be evaluated on the basis of Concurrent evaluation.

Passing Criteria:

As per MIT-WPU norms.

Dr. Kalyan Swarup


(h) MANDATORY ATTENDANCE TO APPEAR FOR EXAMINATION:

1. It is obligatory on the part of the student to attend each and every Lecture, Tutorial, and

Laboratory practical sessions in a course for the academic excellence. However, on account

of late registration or illness or any other contingencies, the attendance requirement will be

a minimum of 75% of the classes scheduled/ held.

2. In case of extraordinarily genuine cases, the requirement of attendance can be further

condoned up to 15% by the Executive President/Vice-Chancellor on the recommendations

of the Head of the Department concerned. An application on prescribed format for

condoning limited shortage of attendance (up to 15% only) should be made by the student

at least one week prior to the examination.

3. Any candidate who fails to meet the attendance criteria indicated as above in any course

shall not be allowed to take the Midterm/ End term examination of that course unless he/she

fulfills the minimum attendance criteria.

4. The attendance records will be announced/ displayed periodically to sufficiently warn the

students who are falling short of attendance.

5. The final attendance records for the entire trimester /semester / one year will be displayed

by the respective faculty/course instructor handling a course, with the approval of the

Heads of Departments (Principal/Director), before the last day of classes in the current

trimester /semester / one year, or on the date as mentioned in the Academic Calendar.

(i) MEDIUM OF INSTRUCTION AND EXAMINATION:

i. Medium of Instruction: English.

ii. Examination:

Pattern of Examination:

The evaluation scheme comprises of:

a) University Evaluation

b) Concurrent Evaluation

For each credit course –

a) 50 marks shall be evaluated by the University.

b) 50 marks shall be evaluated on the basis of Concurrent evaluation.

(k) ELIGIBILITY CRITERIA FOR ADMISSION TO THE PROGRAMME

Eligibility for Admission -

In order to be eligible for admission to Bachelor of Computer Applications a candidate must have

passed.

a) HSC (10+2) from Science stream with English as passing Subject with minimum 50%

marks in aggregate.

Dr. Kalyan Swarup


MIT-WPU-BCA 2017-2020

A. Definition of Credit:-

45 lectures per programme 3 Credits

30 lectures per programme 2 Credits

B. Credits:-

Total number of credits for three year undergraduate BCA would be 147.

C. Structure of Credits for Undergraduate BCA programme:-

D. Course Code and Definition:-

E. Grading Scheme:

The marks shall be converted to grade points and grades using Table-I:

Sr No Subject Category No of

Subjects

No. of

credits

1 Core Subjects 33 99

2 Peace Course 05 10

3 Project 04 17

4 Add-on Basket of Open Electives /

Certificate programmes/Rural

Immersion

05 15

5 Value Addition Exposure 03 06

Total 147

Course Code Definitions

L Lecture

P Practical

WP Peace Programs

Dr. Kalyan Swarup


Table-I: Points Grading System

Marks Out of 100 Grade Grade Point

80-100 O: Outstanding 10

70-79 A+: Excellent 9

60-69 A: Very Good 8

55-59 B+: Good 7

50-54 B: Above Average 6

45-49 C: Average 5

40-44 Pass 4

0-39 Fail 0

AB Absent NA

The performance of a student will be evaluated in terms of two indices, viz.

a) Trimester Grade Point Average (TGPA) which is the Grade Point Average for a

trimester.

b) Cumulative Grade Point Average (CGPA) which is the Grade Point Average for all the

completed trimesters at any point in time.

Trimester Grade Point Average (TGPA):

At the end of each trimester, TGPA is calculated as the weighted average of GPI of all courses in

the current trimester in which the student has passed, the weights being the credit values of

respective courses.

TGPA = Grade Points divided by the summation of Credits of all Courses.

GPA (Si) = ∑ (Ci * Gi)/∑Ci

Where Ci is the number of credits of the ith

course and Gi is the grade point scored by the student in

the ith

course.

Cumulative Grade Point Average (CGPA):

Cumulative Grade Point Average (CGPA) is the grade point average for all completed trimesters.

CGPA is calculated as the weighted average of all GPA of all courses in which the student has

passed up to the current trimester.

Cumulative Grade Point Average (CGPA) for the Entire Course

CGPA=∑ (Ci * Si)/∑Ci

Where Si is the SGPA of the ith

trimester / semesters / one year and Ci is the total number of credits

in that trimester / semesters / one year.

The GPA and CGPA shall be rounded off to 2 decimal points and reported in the transcripts.

Dr. Kalyan Swarup


BCA (Third Year) (Batch 2017-2020) w.e.f 2019-20

Trimester 7 Trimester 8 Trimester 9

Sr. No. Course Title

Number

of

Credits

Sr. No. Course Title Number of

Credits Sr. No. Course Title

Number

of

Credits

Core Courses Core Courses Core Courses

701 Java Programming 03 801 Advanced Java

Programming 03 901 Artificial Intelligence 03

702 PHP 03 802 Grid & Cloud

Computing 03 902 Current Trends in IT 03

703 Management

Information System 03 803

Optimization

Techniques 03 903

Software Testing &

Quality Assurance - I 03

704 Software Testing &

Quality Assurance - I 03 804 Project Work 05 904 Project Work 05

2 Peace Courses

PC4 Indian Tradition,

Culture and Heritage 02 PC5

Humanities – Ethical ,

Moral and Social

Sciences

02

TOTAL 14 TOTAL 14 TOTAL 16 In addition, every student will also complete the following: (Evaluation at the end of academic year)

Sr. No. Particulars Credits

1 Certificate Programme 4 03

2 Certificate Programme 5 02

3 VAP 3 02

Dr. Kalyan Swarup


Bachelor of Computer Application (BCA)

COURSE STRUCTURE

Dr. Kalyan Swarup


COURSE STRUCTURE – Trimester VII

Course Code MIT-WPU-BCA-3701

Course Category Compulsory Subject

Course Title Java Programming

Teaching Scheme and Credits

Weekly load hours

L T Laboratory Credits

6 30 15 3

Pre-requisites: Knowledge of basic programming language like C language.

Course Objectives: 1. To learn the basic concept of Java Programming.

2. To understand how to use programming in day to day applications.

3. To get knowledge of object-oriented paradigm in the Java programming language

4. To use Java in a variety of technologies and on different platforms.

Course Outcomes: 1. Knowledge of the structure and model of the Java programming language

2. Develop software in the Java programming language

Course Contents:

Chapter 1 – Introduction to Java

1.1 Features of java

1.2 JDK Environment & tools like(java, javac, appletviewer, javadoc, jdb)

1.3 OOPs Concepts - Class, Abstraction , Encapsulation, Inheritance, Polymorphism

1.4 Difference between C++ and JAVA

1.5 Structure of java program

1.6 Data types ,Variables ,Operators , Keywords ,Naming Convention

1.7 Decision Making (if, switch), Looping(for, while)

1.8 Type Casting

1.9 Array

Creating an array

Types of Array

- One Dimensional arrays

- Two Dimensional array

1.10 String

- Arrays , Methods.

- StringBuffer class

Chapter 2 – Classes and Objects 2.1 Creating Classes and objects

2.2 Memory allocation for objects

2.3 Constructor

2.4 Implementation of Inheritance Simple, Multilevel,

2.5 Interfaces Abstract classes and methods

2.7 Implementation of Polymorphism

2.8 Method Overloading, Method Overriding

Dr. Kalyan Swarup


2.9 Nested and Inner classes.

2.10 Modifiers and Access Control

2.11 Packages Concept - Creating user defined packages, Java Built in packages

2.12 Wrapper classes

Chapter 3 – Applet, AWT Programming

Applet

3.1 Introduction

3.2 Types applet

3.3 Applet Life cycle - Creating applet, Applet tag, Applet Classes- Color, Graphics, Font

AWT

3.4 Components and container used in AWT

3.5 Layout managers

3.6 Listeners and Adapter classes

3.7 Event Delegation model

Chap Chapter 4 – File and Exception Handling

4.1 Exception types

4.2 Using try catch and multiple catch, Nested try, throw , throws and finally

4.3 Creating user defined Exceptions File Handling

4.4 Stream - ByteStream Classes, CharacterStream Classes

4.5 File IO basics

4.6 File operations - Creating file, Reading file(character, byte), Writing file (character, byte )

Laboratory Exercises / Practical: Yes

Reference Books :

Programming with JAVA - E Balgurusamy

The Complete Reference – JAVA Herbert Schildt

Pedagogy: Lab Programs, Problem solving, assignment, conceptual and contextual learning.

Assessment Scheme: Internal evaluation of each subject will be for 200 marks (which will be converted to 50 marks);

divided as follows:

Mid Term Examination 50

Attendance and Class Participation 50

Assignments 50

Presentations/ Practical/ Viva/Project 50

Total Marks 200

Term End Examination : (50 marks )

Dr. Kalyan Swarup


Prepared By Checked By Approved By

Prof. Monika Gadre Prof. Archana Mullapudi Prof. Shalaka Ghodke

Chairman, Board Of Studies

Dr. Kalyan Swarup





Course Title PHP


Weekly load hours


6 30 15 3

Pre-requisites: Knowledge about HTML required.

Course Objectives:

1. To know & understand concepts of internet programming.

2. To understand how to develop web based applications using PHP.

Course Outcomes:

3. Knowledge of the structure and model of the PHP

4. Develop web applications using PHP & MySQL

Course Contents:

Unit 1- HTML and Javascript

1.1 Basic HTML Structure

1.2 Common HTML Tags

1.3 HTML form and form elements

1.4 Introduction to Java Script

1.5 Identifier & operator, control structure, functions

1.6 Document object model(DOM)

Unit 2 – Introduction to PHP

2.1 Introduction to PHP

2.2 Features

2.3 Basic Syntax

- Variable

- Constant

- Keywords

- Data Types

- Type casting, Type Juggling

Unit 3 – Control Structure and Array

3.1 Conditional Statements

3.2 Loops

3.3 Break Statements

3.4 Array

- Indexed Vs Associative arrays

- Storing data in arrays

- Extracting multiple values

- Sorting

Dr. Kalyan Swarup


Unit 4 – String and Functions In PHP

4.1 Declaration of Strings

4.2 Types of strings in PHP

4.3 Comparing strings

4.4 Manipulating and searching strings

4.5 Defining and calling function

Unit 5 – Database

5.1 Introduction to MYSQL

5.2 Accept form data

5.3 Using PHP to access a databases

5.4 Mysql Database functions

Learning Resources:

Text Book:

Reference Books :

1. Programming PHP - Rasmus Lerdorf and Kevin Tatroe, O'Reilly publication

2. Beginning PHP 5 - Wrox publication Supplementary Reading:

Web Resources: www.w3schools.com

Weblinks: : www.devguru.com

MOOCs:

Pedagogy:

Lab Programs, Problem solving, assignment, conceptual and contextual learning.

Assessment Scheme:

Internal evaluation of each subject will be for 200 marks (which will be converted to 50 marks);

divided as follows:



Assignments 50


Total Marks 200



Prof. Shalaka Ghodke Prof. Archana Mullapudi Prof. Shalaka Ghodke

Chairman, Board of Studies

Dr. Kalyan Swarup





Course Title Management Information System (MIS)


Weekly load hours


6 45 -- 3

Pre-requisites: This course will not require you to have previous experience in any particular area

but you should have a high school reading level. Books will be required for learning.

Course Objectives:

Knowledge: To understand the concept, process and importance of MIS

Skills: To help students develop management skills. Understand basic information system

concepts as applied to business operations and management.

Attitude: To help students to acquaint with applications of MIS in the world of business.

Course Outcomes:

By the end of the course, the student should be able to:

Understand basic information system concepts as applied to business operations and

management.

Identify the major components of a computer system, including hardware, software, operating

systems and operating environments as they apply to information systems.

Evaluate, select, and use computer-based information systems from a management perspective.

Understand the interdependence and functionality of the hardware and software components of

information systems and work with the MIS staff to make technical decisions

Design and develop basic MIS applications

Understand how to utilize large-scale computer applications systems to assist with business

management and operations.

Accomplish all objectives as an individual or in a team environment.

Course Contents:

Unit 1 – Introduction to MIS and System Concepts

1.1 Systems, data , information and knowledge

1.2 Importance of MIS in the competitive business environment

1.3 Types of System

1.4 Subsystems

1.5 Transactions processing systems, expert systems, office automation systems and knowledge-

based systems

Unit 2 – Social and Ethical Issues of the Internet

2.1 Definition

2.2 Quality of Information

Dr. Kalyan Swarup


2.3 Value of Information

2.4 Information security

Unit 3 – Management Information System

3.1 Definition

3.2 Integrated System

3.3 MIS Vs. Data Processing MIS & Other Academic

3.4 Structure of MIS based on Management Activities

3.5 System Concepts of MIS with case study.

Unit 4 – Information System (ERP) and DSS

4.1 DSS

4.2 ERP System

4.3 Concepts of Decision Making and DSS

4.4 Difference between MIS and DSS

Unit 5 – Decision Making Systems and Modeling

5.1 Modeling Process

5.2 Information need for different phases and decision making

5.3 Sensitivity Analysis

5.4 Structured decision making, unstructured decision making and semi structured decision making

Learning Resources:

Text Book:

Reference Books :

1. Management Information System - Gorden Devis, MargarethH. Oison

2. Information Systems for Modern Management – Robert Murdick,

Joel E.Ross

3. Decision Support and Expert Systems – Efraim Turban

4. Management information system – D . P . Goyal .

Supplementary Reading:

Web Resources

Weblinks:

MOOCs:

Pedagogy:

Lab Programs, Problem solving, assignment, conceptual and contextual learning.

Assessment Scheme:


divided as follows:

Dr. Kalyan Swarup




Assignments 50


Total Marks 200



Prof. Sudeepta Banerjee Prof. Archana Mullapudi Prof. Shalaka Ghodke


Dr. Kalyan Swarup





Course Title Software Testing & Quality Assurance – I


Weekly load hours


6 45 -- 3

Pre-requisites: This course will not require you to have previous experience in any particular area

but you should have a high school reading level.

Course Objectives:

1) To understand the concept, process and importance of Software Testing.

2) To understand how to test bugs in software.

3) To develop programming logic

4) Gaining confidence in and providing information about the level of quality. To prevent

defects.

Course Outcomes:

Software testing helps in finalizing the software application or product against business and

user requirements. It is very important to have good test coverage in order to test the

software application completely and make it sure that it’s performing well and as per the

specifications. The course intends to emphasize more on learning rather than theory.

Course Contents:

Unit 1: Preliminaries

Software Quality

Software Testing

Quality Control

Quality Assurance

Quality Factors

Quality Assurance versus Quality Control

Unit 2: Software Quality Assurance

Definition of SQA

Need for SQA

SQA Activities

Building blocks of SQA

SQA Planning & Standards

Unit 3: Basics of Software Testing

Nature of errors

Bug life cycle

Testing Life cycle

Dr. Kalyan Swarup


Testing principles

Testing fundamentals

Debugging Process

Difference between QA and Testing

Difference between Debugging and Testing

Unit 4: Testing specialized Systems and Applications

Testing GUI

Testing Documentation and Help Facilities

Testing for Real-Time Systems

Unit 5: Testing Tools & Test Case Design

Junit, Apache Jmeter, Winrunner, Loadrunner, Rational Robot

Test Case Design:

Test Planning

Test Cases

Test case Design Examples

Building test cases

Test Report

Learning Resources:

Text Book:

1) Effective methods for software testing, second edition Book by William Perry

2) Glenford J. Myers, The Art of Software Testing, Wiley, New York, 1979.

3) Elfriede Dustin, Jeff Rashka, and John Paul, Automated Software Testing: Introduction,

4) Management, and Performance, Addison Wesley, Reading, Mass., 1999.

Reference Books :

5) The Art of Software Testing Book by Glenford Myers

6) Managing the Testing Process Book by Rex Black

7) Testing Computer Software Book by Cem Kaner, Hung Q Nguyen, and Jack Falk

8) Software Engineering for Students- A Programming Approach, Douglas Bell, Pearson

Education


Web Resources: Meet Guru99 - Free Training Tutorials & Video for IT Courses

Software Testing Article - 20 Best Websites to Learn Software Testing

Weblinks: : https://www.guru99.com/ https://www.utest.com/articles/20-best-websites-to-learn-software-testing

MOOCs:

Pedagogy:

Case discussion, Group Discussion, Problem solving, assignment, conceptual and contextual

learning.

Assessment Scheme:

https://www.guru99.com/

https://www.utest.com/articles/20-best-websites-to-learn-software-testing


Dr. Kalyan Swarup



divided as follows:



Assignments 50


Total Marks 200

*End Term Examination: (50 marks )


Prof. Jijai Pawar Prof. Archana Mullapudi Prof. Shalaka Ghodke


Dr. Kalyan Swarup


COURSE STRUCTURE – Trimester VIII



Course Title Advanced Java Programming


Weekly load hours


6 30 15 3

Pre-requisites: Knowledge of basic Java programming language.

Course Objectives: 1. To know the concept of Java Programming.

2. To understand how to use programming in day to day applications.

3. To develop programming logic.

Course Outcomes: Knowledge of the structure and model of the Java programming language

Develop software in the Java programming language

Course Contents:

Chapter 1 – JDBC

1.1 The design of JDBC

1.2 Basic JDBC program Concept

1.3 Drivers

1.4 Architecture of JDBC

1.5 Making the Connection, Statement , ResultSet, PreparedStatement, CallableStatement

1.6 Executing SQL commands

1.7 Executing queries

Chapter 2 – Multithreading 2.1 Introduction to Thread

2.2 Life cycle of thread

2.3 Thread Creation

- By using Thread Class

- By Using Runnable interface

2.4 Priorities and Synchronization

2.5 Inter thread communication

2.6 Implementation of Thread with Applet

Chapter 3 – Servlet and JSP 3.1 Introduction

3.2 How It differ from CGI

3.3 Types of servlet

3.4 Life cycle of servlet

3.5 Execution process of Servlet Application

3.6 Session Tracking

3.7 Cookie class

Dr. Kalyan Swarup


3.8 Servlet- Jdbc

JSP

3.9 Introduction to JSP

3.10 Components of JSP - Directives , Tags, Scripting Elements

3.11 Execution process of JSP Application

3.12 Building a simple application using JSP

3.13 JSP with Database

Chapter 4 – Collection

4.1 Collection Framework.

4.1.1 Interfaces – Collection, List , Set, Sorted Set, Enumeration, Iterator, ListIterator

4.1.2. Classes- LinkedList, ArrayList, Vector, HashSet, TreeSet, Hashtable

4.2 Working with maps

4.2.1 Map interface

4.2.2 Map classes – HashMap, TreeMap

Laboratory Exercises / Practical: Yes

Reference Books :

The Complete Reference – JAVA Herbert Schildt

Core java –II By Cay S. Horstmann and Gary Cornell

Compete Reference J2EE – Jim Keogh

Pedagogy: Lab Programs, Problem solving, assignment, conceptual and contextual learning.


divided as follows:



Assignments 50


Total Marks 200





Dr. Kalyan Swarup





Course Title Grid and Cloud Computing


Weekly load hours


6 45 0 3

Pre-requisites: None

Course Objectives: The student should be made to:

Understand how Grid computing helps in solving large scale scientific problems.

Gain knowledge on the concept of virtualization that is fundamental to cloud computing.

Learn how to program the grid and the cloud.

Understand the security issues in the grid and the cloud environment

Course Outcomes: 1. The student should be made to:

2. Understand how Grid computing helps in solving large scale scientific problems.

3. Gain knowledge on the concept of virtualization that is fundamental to cloud computing.

4. Learn how to program the grid and the cloud.

5. Understand the security issues in the grid and the cloud environment

Course Contents:

UNIT 1 : INTRODUCTION

Evolution of Distributed computing: Scalable computing over the Internet – Technologies for

network based systems – clusters of cooperative computers – Grid computing Infrastructures –

cloud computing – service oriented architecture – Introduction to Grid Architecture and standards –

Elements of Grid – Overview of Grid Architecture.

UNIT 2: GRID SERVICES

Introduction to Open Grid Services Architecture (OGSA) – Motivation – Functionality

Requirements – Practical & Detailed view of OGSA/OGSI – Data intensive grid service models –

OGSA services.

UNIT 3: VIRTUALIZATION

Cloud deployment models: public, private, hybrid, community – Categories of cloud computing:

Everything as a service: Infrastructure, platform, software – Pros and Cons of cloud computing –

Implementation levels of virtualization – virtualization structure – virtualization of CPU, Memory

and I/O devices – virtual clusters and Resource Management – Virtualization for data center

automation.

UNIT 4: SECURITY

Trust models for Grid security environment – Authentication and Authorization methods – Grid

Dr. Kalyan Swarup


security infrastructure – Cloud Infrastructure security: network, host and application level – aspects

of data security, provider data and its security, Identity and access management architecture, IAM

practices in the cloud, SaaS, PaaS, IaaS availability in the cloud, Key privacy issues in the cloud.

Laboratory Exercises / Practical:

Text Book:

1. Kai Hwang, Geoffery C. Fox and Jack J. Dongarra,

2. Distributed and Cloud Computing: Clusters, Grids, Clouds and the Future of Internet, First

Edition, Morgan Kaufman Publisher, an Imprint of Elsevier, 2012.

Reference Books :

1. Jason Venner, “Pro Hadoop- Build Scalable, Distributed Applications in the Cloud”, A

Press, 2009

2. Bart Jacob (Editor), “Introduction to Grid Computing”, IBM Red Books, Vervante, 2005

3. Ian Foster, Carl Kesselman, “The Grid: Blueprint for a New Computing Infrastructure”, 2nd

Edition, Morgan Kaufmann.

4. Frederic Magoules and Jie Pan, “Introduction to Grid Computing” CRC Press, 2009.

5. Daniel Minoli, “A Networking Approach to Grid Computing”, John Wiley Publication,

2005.

6. Barry Wilkinson, “Grid Computing: Techniques and Applications”, Chapman and Hall,

CRC, Taylor and Francis Group, 2010.

Pedagogy: Case discussion, Group Discussion, Problem solving, assignment, conceptual and contextual learning


divided as follows:



Assignments 50


Total Marks 200



Prof. Geetika Parmar Prof. Archana Mullapudi Prof. Shalaka Ghodke


Dr. Kalyan Swarup





Course Title Optimization Techniques


Weekly load hours


6 45 0 3

Pre-requisites: None

Course Objectives:

⦁ Formulate a real-world problem as a mathematical programming model.

⦁ To introduce the linear programming and related optimization theories to solve real life

/simulated problems.

⦁ To introduce students to use quantitate methods and techniques for effective decisions–

making.

⦁To model formulation and applications that are used in solving business decision problems.

Course Outcomes:

Illustrate the need to optimally utilize the resources in various types of industries.

Apply and analyze mathematical optimization functions to various applications. -

Demonstrate cost effective strategies in various applications in industry.

Course Contents:

Chapter 1: Introduction to Operations Research

1 What is Operations Research?

2 Definition of OR

3 Need of OR in industry

4 Scope/applications of OR

5 OR and decision making

Chapter 2: Linear Programming Problem

2.1 Simplex method

2.2 Special cases in Simplex method

o Degeneracy

o Alternative Optima

o Unbounded Solution

o Infeasible Solution

Chapter 3: Transportation & Assignment Problem

3.1 Finding initial basic feasible solution (IBFS) using

a. North West Corner Method (NWCM)

b. Matrix Minima/Least cost method (LCM)

c. Vogel’s approximation Method (VAM)

1 Optimization of transportation problem

a. MODI method for optimality test

b. Stepping Stone method

1 Assignment Problem

a. Definition

b. Mathematical formulation

Dr. Kalyan Swarup


2 Hungarian Method Procedure

3 Unbalanced Assignment Problem

Chapter 4: Queuing Theory

4.1 Introduction 4.2 Characteristics of Queuing Models

4.3 Transient and Steady states of the System

4.4 Model 1. Single-Channel Poisson Arrivals with Exponential Service Times, Infinite-

Population Model (M/M/1): (FCFS/∞/∞)

4.5 Model II. Generalization of Model (M/M/1): (FCFS/∞/∞) 881 (Birth-Death Process)

Chapter 5: PERT & CPM

5.1 Basic differences between PERT and CPM.

5.2 Arrow Networks, time estimates, Earliest expected time, Latest – allowable occurrences

time, Forward Pass Computation, Backward Pass Computation

5.3 Representation in Tabular Form

5.4 Critical Path

5.5 Probability of meeting scheduled date of completion

5.6 Calculation on CPM network.

5.7 Various floats for activities Laboratory Exercises / Practical: Not Applicable

Reference Books :

Problems in Operation Research – Prem Kumar Gupta, Dr. D. S. Hira, S Chand Publ.

Operations Research – A. M. Natarajan, P. Balasubramanie, A. Tamilarasi

Operations Research – Hamdy A. Taha

Operations Research: Theory And Application – J. K. Sharma, Laxmi Publ.

Operations Research, S. D. Sharma, Kedar Nath Ram Nath-Meerut

Quantitative techniques in Management – N D Vora, Tata McGraw Hill

Pedagogy: Case discussion, Group Discussion, Problem solving, assignment, conceptual and contextual

learning.learning


divided as follows:



Assignments 50


Total Marks 200


Dr. Kalyan Swarup



Prof. Shalaka Ghodke Prof. Archana Mullapudi Prof. Shalaka Ghodke


Dr. Kalyan Swarup


COURSE STRUCTURE – Trimester IX



Course Title Artificial Intelligence


Weekly load hours


6 45 0 3

Pre-requisites: Knowledge about computer fundamentals and algorithms.

Course Objectives: 1.To familiarize the students’ with specific, well known Artificial Intelligence methods, algorithms

and knowledge representation schemes.

2.To introduce students’ different techniques which will help them build simple intelligent

Systems based on AI/IA concepts.

Course Outcomes:

Students will develop a basic understanding of the building blocks of AI as presented in

terms of intelligent agents.

Students will be able to choose an appropriate problem-solving method and knowledge-

representation scheme.

Students will develop an ability to analyze and formalize the problem (as a state space,

graph, etc.) and select the appropriate search method.

Students will be able to develop/demonstrate/ build simple intelligent systems or classical

toy problems using different AI techniques.

Course Contents:

Chapter 1 – Introduction to Artificial Intelligence Introduction, What Is AI, The Foundations of Artificial Intelligence, The History of Artificial

Intelligence, Emergence Of Intelligent Agents, Applications of A.I.

Chapter 2 – Intelligent Agents Intelligent Agents: PEAS Representation for an Agent, Agent Environments,

Concept of Rational Agent, Structure of Intelligent agents, Types of Agents.

Chapter 3 – Uninformed Search Techniques Introduction: DFS, BFS, Lowest-Cost-First Search, Uniform cost search, Depth Limited Search,

Iterative Deepening, Bidirectional search, Comparing Different Techniques.

Chap Chapter 4 – Informed Search Methods

Heuristic functions, Hill Climbing, Best First Search, A*, Crypto Arithmetic Problem,

Backtracking for CSP, Performance Evaluation.

Chapter 5 – Learning

Forms of learning, Decision trees, inductive learning, Clustering - basic agglomerative, divisive

algorithms based on similarity/dissimilarity measures, Applications to NLP, Robotics

Dr. Kalyan Swarup


Laboratory Exercises / Practical: Not Applicable

Reference Books :

George Lugar, .AI-Structures and Strategies for Complex Problem Solving., 4/e, 2002, Pearson

Education.

Nils J. Nilsson, Principles of Artificial Intelligence, Narosa Publication.

Patrick H. Winston, Artificial Intelligence, 3rd edition, Pearson Education.

Deepak Khemani, A First Course in Artificial Intelligence, McGraw Hill Publication

Pedagogy: Case discussion, Group Discussion, Problem solving, assignment, conceptual and contextual

learning.


divided as follows:



Assignments 50


Total Marks 200





Dr. Kalyan Swarup





Course Title Current Trends in IT


Weekly load hours


6 45 -- 3

Pre-requisites: None.

Course Objectives: To understand the current trends and challenges in IT.

Leverage technology trends to identify and pursue business opportunities.

Course Outcomes: Students will get an insight on the Current ongoing trends & technologies in

IT Industry.

Course Contents:

1. Data Warehouse and Data Mining

What is Data Warehouse?

A Multidimensional Data Model

Data Warehouse Architecture

Data Warehouse Implementation

Data CubeTechnology

From Data Warehousing to Data Mining

Data Mining, Functionalities

Data Cleaning, Data Integration and Transformation, Data Reduction

2. Cloud Computing

Enabling Technologies and System Models for Cloud Computing

Introduction to Cloud Computing including benefits, challenges, and risks

Cloud Computing Models including Infrastructure/Platform/Software – as-a-service

Public cloud, private cloud and hybrid clouds

Cloud OS

Data centers for Cloud Computing

3. Business Analytics

Analytics concepts and use in Business Intelligence

Exploratory and statistical techniques:- Cluster analysis, Data visualization

Predictive analysis :- Regression, Time series

Data Mining :- Hierarchical clustering

Decision tree Text analytics :- Text mining

Dr. Kalyan Swarup


4. Internet of Things:

What is the Internet of Things?

History of IoT, About IoT

Overview and Motivations

Examples of Applications

Internet of Things Definitions and Frameworks : IoT Definitions, IoT Architecture,

General Observations.

Identification of IoT Objects and Services

Structural Aspects of the IoT

Environment Characteristics

Traffic Characteristics, Scalability, Interoperability, Security and Privacy, Open

Architecture

Key IoT Technologies

5. Open Unit:

Any cutting-edge technology which is seemingly more prevalent in the industry would be

covered here. This is intentionally kept open to incorporate the latest trend in the industry so

that students can get technological edge over.

Laboratory Exercises / Practical: Not Applicable

LearningResources:

Text Book:

Reema Thareja, “Data Warehouse”, Publisher: Oxford University Press

Hakima Chaouchi, “ The Internet of Things Connecting Objects to the Web” ISBN : 978-1-

84821-140-7, Willy Publications

Reference Books :


Web Resources:

Weblinks:

MOOCs:

Pedagogy:

Case discussion, Group Discussion, Problem solving, assignment, conceptual and

contextual learning.

Assessment Scheme:


divided as follows:

Dr. Kalyan Swarup




Assignments 50


Total Marks 200



Prof. Geetika Parmar Prof. Archana Mullapudi Prof. Shalaka Ghodke


Dr. Kalyan Swarup





Course Title Software Testing & Quality Assurance – II


Weekly load hours


6 45 -- 3

Pre-requisites: This course will require you to have basic knowledge about Software testing and

Quality assurance.

Course Objectives:

To understand the concept, process and importance of Software Testing.

To understand how to test bugs in software.

To develop programming logic

Gaining confidence in and providing information about the level of quality. To prevent defects.

Course Outcomes:

Software testing helps in finalizing the software application or product against business and user

requirements. It is very important to have good test coverage in order to test the software

application completely and make it sure that it’s performing well and as per the specifications. The

course intends to emphasize more on learning rather than theory.

Course Contents:

Unit 1: Software Testing Techniques( Approaches to Testing - I)

Functional Testing (Black Box)

Equivalence partitioning,

BVA, Cause- Effect graphing, etc.

Structural Testing (White Box)

Coverage testing, Statement coverage,

Branch & decision coverage,

Path coverage, etc.

Domain Testing

Black box vs. White Box

Gray Box Testing,

Unit Testing

Integration- Top-down ,Bottom up ,Big Bang, Sandwich Testing

Incremental Integration Testing

Unit 2: Levels of Testing

Unit Testing

Integration Testing

System Testing

Acceptance Testing

Alpha testing & Beta testing

Static vs. Dynamic testing

Manual vs. Automatic testing

Dr. Kalyan Swarup


Unit 3: Software Testing Techniques (Approaches to Testing - II)

Verification and Validation

Verification & Validation Planning

Regression Testing

Security testing

Performance Testing

Load Testing

Stress testing

Endurance Testing

Robustness Testing

Smoke Testing

Agile testing

Recovery Testing

End-to-End Testing

Usability Testing

Compatibility Testing

Install/Uninstall Testing

Unit 4: Test Metrics

Functional or Test Coverage Metric

Function Test Metric

Software Release Metrics

Software Maturity Metric

Final Test Report

Learning Resources:

Text Book:

Effective methods for software testing, second edition Book by William Perry

Cem Kaner, Jack Falk, and Hung Quoc Nguyen, Testing Computer Software, Second

edition,Wiley, New York, 1999.

Practical Software Testing: A Process-Oriented Approach, Burnstein, Springer, ISBN 978-

81-8128-089-3

Edward Kit, Software Testing in the Real World: Improving the Process, Addison Wesley,

1995.

Dr. Kalyan Swarup


Reference Books :

The Art of Software Testing Book by Glenford Myers

Managing the Testing Process Book by Rex Black

Testing Computer Software Book by Cem Kaner, Hung Q Nguyen, and Jack Falk

Software Engineering for Students- A Programming Approach, Douglas Bell, Pearson

o Education


Web Resources: Meet Guru99 - Free Training Tutorials & Video for IT Courses

Software Testing Article - 20 Best Websites to Learn Software Testing

Weblinks: : https://www.guru99.com/


MOOCs:

Pedagogy:

Case discussion, Group Discussion, Problem solving, assignment, conceptual and contextual

learning.

Assessment Scheme:


divided as follows:



Assignments 50


Total Marks 200



Prof. Jijai Pawar Prof. Archana Mullapudi Prof. Shalaka Ghodke





FACULTY OF MANAGEMENT- UG BACHELOR OF COMPUTER ... › wp-content › uploads › 2019 › 08 ›...

Documents

Transcript of FACULTY OF MANAGEMENT- UG BACHELOR OF COMPUTER ... › wp-content › uploads › 2019 › 08 ›...