MASTER OF COMPUTER APPLICATIONS (MCA) Degree Programme · 2019-06-12 · • To excel in logical...

(Effective from the Academic Year 2017

DEPARTMENT OF COMPUTER APPLICATIONS

GOVERNMENT ARTS COLLEGE (AUTONOMOUS)

MASTER OF COMPUTER APPLICATIONS

(MCA) Degree Programme

CURRICULUM & SYLLABUS

(Effective from the Academic Year 2017



SALEM-7



CURRICULUM & SYLLABUS

(Effective from the Academic Year 2017-2018)





2

GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM -7

MASTER OF COMPUTER APPLICATIONS (MCA)

Course Structure under CBCS

(For candidates admitted from the Academic Year 2017-18 onwards)

SEMESTER SYSTEM WITH INTERNAL ASSESSMENT

REGULATIONS

1. OBJECTIVE OF THE PROGRAMME

The programme educational objectives of Master of Computer Applications are

as follows:

• To excel in logical thinking, problem solving and programming skills in the

various computing fields of IT industries.

• To develop the ability to plan, analyze, design, code, test, implement &

maintain a software product for real time system.

• To encourage students to be the entrepreneurs in various sectors of computer

applications.

• To make the students to find solutions and develop system-based applications

for real time problems in various domains involving technical, managerial,

economical & social feasibility.

• To motivate the students to pursue higher studies in computing or related

disciplines and to work in the fields of teaching and research.

• To transform graduates, with knowledge in mathematics into Software

Engineers that the industry requires from time to time.

• To impact professional knowledge and practical skills to the students with the

power of critical thinking.

MCA programme has been designed to prepare graduates for attaining the

following program outcomes:

• Understand and Apply mathematical foundation, computing and domain

knowledge for the conceptualization of computing model of problems.

3

• Identify, Analyze the computing requirements of a problem and Solve them

using computing principles.

• Design and Evaluate a computer based system, components and process to

meet the specific needs of applications.

• Use current techniques and tools necessary for complex computing practices.

• Use suitable architecture or platform on design and implementation with

respect to performance.

• Understand and commit to Cyber regulations and responsibilities in

Professional computing practices.

• Recognize the significance for and develop the ability to engage in life-long

learning as a Computing professional.

• Apply the understanding of management principles with computing knowledge

to manage the projects in multidisciplinary environments.

• Communicate effectively with the computing community as well as society by

being able to comprehend effective documentations and presentations.

• Understand societal, environmental, health, legal, ethical issues within local

and global contexts and the consequential responsibilities relevant to

professional practice.

• Function professionally with ethical responsibility as an individual as well as in

multidisciplinary teams with positive attitude.

• Use knowledge to analyze, interpret the data and synthesis the information to

derive valid conclusions using research methods.

• Identify, critically analyze, formulate and develop computer applications.

• Select modern computing tools and techniques and use them with dexterity.

• Design a computing system to meet desired needs within realistic constraints

such as safety, security and applicability.

• Devise and conduct experiments, interpret data and provide well informed

conclusions.

• Appreciate the importance of goal setting and to recognize the need for life-

long learning.

4

2. CONDITIONS FOR ADMISSION

A candidate who has passed any degree in any discipline of minimum three-

year duration with mathematics at +2 level or any degree with at least one paper in

Mathematics/Statistics/Business Mathematics/Business Statistics in Periyar

University or any of the above degree of any other University accepted by the

Periyar University as equivalent thereto, subject to such condition as may be

prescribed thereto are permitted to appear and qualify for the Master of Computer

Applications(MCA) degree examinations of this autonomous college for a course of

study of three academic years.

Since MCA is an AICTE approved programme, the admission eligibility

criteria prescribed by All India Council for Technical Education (AICTE) through

TamilNadu Common Entrance Test (TANCET) single window counseling from

time-to-time. Further, a candidate completed B.Sc. Computer Science, BCA, B.Sc.

Information Technology and B.Sc. Computer Technology can be admitted to study

from the second year (third semester to sixth semester) as lateral entry.

3. DURATION OF THE COURSE

The course duration for the degree of Master of Computer Applications (MCA)

shall consist of three academic years divided into six semesters. Each semester

consists of 90 working days.

4. COURSE OF STUDY

The course of study shall comprise instruction in the following subjects

according to the syllabus and books prescribed with its latest edition from

time-to-time.

5

SEMESTER I

S.

No.

Course

Code Title of the Course Hours Credits

Marks

IA SE Total

1 17PCA01 Core Course-I: Discrete

Structures 5 5 25 75 100

2 17PCA02 Core Course-II: Data Structures

and Algorithms 5 4 25 75 100

3 17PCA03 Core Course-III: Problem

Solving and Programming in C 5 4 25 75 100

4 17PCA04 Core Course-IV: Critical

Thinking 4 4 25 75 100

5 17PCAM1 Elective Course-I 5 4 25 75 100

6 17PCAP1 Core Practical-I : C

Programming 3 2 40 60 100

7 17PCAP2 Core Practical-II : Creative

Thinking to Programming 3 2 40 60 100

Total Credits and Marks 25 700

SEMESTER II

S.

No.

Course


Marks

IA SE Total

1 17PCA05

Core Course-V: Computer

Oriented Numerical Methods

and Probability Theory

5 5 25 75 100

2 17PCA06 Core Course-VI: Object Oriented

Programming and C++ 4 4 25 75 100

3 17PCA07 Core Course-VII: Relational

Database Management Systems 4 4 25 75 100

4 17PCA08

Core Course – VIII : Digital

Logic Design and Computer

Architecture

4 4 25 75 100

5 17PCAM2 Elective Course - II 5 4 25 75 100

6 17PCAP3

Core Practical-III: Object-

Oriented Programming and Data

Structures

3 2 40 60 100

7 17PCAP4 Core Practical-IV: SQL Queries

and Reports 3 2 40 60 100

8 17PGNM1 Non Major Elective Common

Course–I: Human Rights 2 2 25 75 100


GOVERNMENT ARTS COLLEGE(AUTONOMOUS), SALEM - 7

Curriculum for MCA Degree Programme

( For the candidates admitted from the academic year 2017-2018 )

6

SEMESTER III

SEMESTER IV

S.

No.

Course

Code Title of the Course

Class

Hours Credits

Marks

IA SE Total

1 17PCA12 Core Course-XII: Operations

Research 5 5 25 75 100

2 17PCA13 Core Course - XIII:

Programming in .NET 5 4 25 75 100

3 17PCA14 Core Course-XIV: Cloud

Computing and BigData 5 4 25 75 100

4 17PCAM5 Elective Course - V 4 4 25 75 100

5 17PCAM6 Elective Course - VI 5 4 25 75 100

6 17PCAP7 Core Practical - VII: .NET


7 17PCAMP Core Practical-VIII: Software

Development Project 3 2 40 60 100


S.

No.

Course


Class

Hours Credits

Marks

IA SE Total

1 17PCA09 Core Course-IX: Core Java 4 4 25 75 100

2 17PCA10 Core Course-X: Visual


3 17PCA11 Core Course-XI: Operating

Systems and Computer Networks 5 4 25 75 100

4 17PCAM3 Elective Course - III 4 4 25 75 100

5 17PCAM4 Elective Course - IV 5 4 25 75 100

6 17PCAP5 Core Practical-V: Java


7 17PCAP6 Core Practical-VI: VB & VC++


8 17PGNM2

Non Major Elective Common

Course–II: General Studies for

Competitive Examinations

2 3 25 75 100


7

SEMESTER V

S.

No.

Course


Class

Hours Credits

Marks

IA SE Total

1 17PCA15 Core Course-XV: Advanced

Java 4 4 25 75 100

2 17PCA16 Core Course-XVI: Open

Source Technologies 5 4 25 75 100

3 17PCA17 Core Course-XVII: Data

Science using R and Python 5 4 25 75 100

4 17PCAM7 Elective Course - VII 5 4 25 75 100

5 17PCAM8 Elective Course -VIII 5 4 25 75 100

6 17PCAP8 Core Practical-VIII: Open

Source Programming 3 2 40 60 100

7 17PCAP9 Core Practical-IX: Advanced

Java Programming 3 2 40 60 100


SEMESTER VI

S.

No.

Course


Marks

IA SE Total

1

17PCAPR

Pro

ject

Wo

rk

Project Specification

and Analysis (20%

weightage)

4 3

-- 200 200

2

Project Design and

Development (25%

weightage)

8 3

3

Testing and

Implementation with

stakeholder feedback

(25% weightage)

8 3

4

Project Report and

Viva-Voce (30%

weightage)

10 3


Grand Total of Credits and Marks 140 3900

8

LIST OF ELECTIVE COURSES:

S.

No. Semester Elective

Course


1

Semester-I Elective-I

17PCAA1 Principles of Management

2 17PCAB1 Organizational Behaviour

3 17PCAC1 Human Resource Management

4

Semester-II Elective-II

17PCAA2 Structured System Analysis and Design

5 17PCAB2 Object Oriented Analysis and Design

6 17PCAC2 Software Engineering

7

Semester-III Elective-III

17PCAA3 Computer Graphics and Multimedia

8 17PCAB3 Principles of Compiler Design

9 17PCAC3 System Software

10

Semester-III Elective-IV

17PCAA4 Professional Ethics

11 17PCAB4 Distributed Operating Systems

12 17PCAC4 Social Network Analysis

13

Semester-IV Elective-V

17PCAA5 LAMP Technologies

14 17PCAB5 Internet and Web Programming

15 17PCAC5 UNIX/Linux and Shell Programming

16

Semester-IV Elective-VI

17PCAA6 Semantic Web

17 17PCAB6 Internet of Things

18 17PCAC6 Data Warehousing and Data Mining

19

Semester-V Elective-VII

17PCAA7 Software Documentation

20 17PCAB7 Software Quality Management and

Assurance

21 17PCAC7 Enterprise Resource Planning

22

Semester-V Elective-VIII

17PCAA8 Soft Computing

23 17PCAB8 Geographic Information System

24 17PCAC8 Mobile Computing

9

5. EXAMINATIONS

THEORY EXAMINATIONS:

The theory examination consists of Internal Assessment (IA) and Semester

Examination (SE). The semester examinations (SE) for theory courses shall be conducted at

the end of each semester; for each of the courses the examination will be conducted for three

hours duration and for 75 marks. The internal assessment marks for theory courses are

computed as follows:

IA Marks for Theory paper:-

Test(10) + Assignment(5) +Seminar(5)+ Attendance(5) = 25 Marks

(i) Test Marks:

Three tests - 5 Marks

(Best two tests will be taken into account)

Model Examination - 5 Marks

(ii) Assignment Marks:

Two assignments - 5 Marks (2.5 +2.5)

(iii) Seminar Marks:

Seminar on a topic prescribed by the staff in-charge - 5 Marks

PRACTICAL EXAMINATIONS:

The practical examination consists of Internal Assessment (IA) and Semester

Examination (SE). The semester examinations for practical courses shall be conducted at the

end of each semester. The internal assessment marks for practical courses are computed as

follows:

IA marks for Practical paper: -

Test (15) + Observation (15) + Attendance (10) = 40 Marks

Test Marks:

Two tests - 10 Marks

(Two tests will be taken into account)

Model Examination - 5 Marks

Observation Marks:

Observation during the lab session on preparation

of Observation Note Book & Record Preparation - 15 Marks

IA Test for Theory Subjects:

In order to award 10 marks for IA test component, two common internal assessment

tests on each subject will be conducted for every 2½ Units of the syllabus of which the

10

average of the two scores will be taken into account. If a candidate is absent for the IA Test,

retest may be conducted. If a student is failed in IA Test, retest may be conducted for lesser

mark (i.e. 8 marks).

Attendance for Theory and Practical Subjects

Percentage of Attendance Below

75%

75%-

79%

80%-

84%

85%-

89%

90%-

94%

95%-

100%

Marks for Theory 0

Mark 1 Mark

2

Marks

3

Marks 4 Marks

5

Marks

Marks for Practical 0

Mark

1-2

Marks

3-4

Marks

5-6

Marks

7-8

Marks

9-10

Marks

• If a student has attained 65-74% of attendance then the student is allowed to write the

semester examination in the same semester itself on a condition that he/she has to pay the

condonation fee.

• If a student has attained 50-64% of attendance, he/she is not allowed to write the

examination in the same semester. Those papers can be taken up as arrears in the next

semester.

• If a student has attained below 50% of attendance, the student comes under REDO

category. The student has to redo the semester for attaining attendance percentage and can

appear for the semester, if the attendance percentage is satisfactory. Otherwise the same

rules given above are again applicable. Without writing minimum one semester

examination, a student in REDO category is not allowed to write for the next semester

examination as per the revised Periyar University Regulation for REDO category.

a. Assignment for Theory Subjects

In order to award 5 marks for the assignment component, three assignments under each

course will be given to the student to take the average of best two as IA. Assignment topics

are not book-based. Assignment need not be only writing but also Brainstorming Activity,

Interactive sessions, Questionaire/Quiz, Programming, Calculations/drawing, and Surfing in

the Net, etc. Atleast one assignment for each subject should be composed apart from the

syllabus.

b. Observation for Practical Subjects

During every regular practical lab slot, the student has to complete minimum one

exercise provided in the syllabus. Students should bring their observation note book ready for

the exercises from the list of exercises in order. The students are to be observed during the

Lab and 10 marks are awarded for each exercise. For late completion, lesser marks are

11

awarded. Finally the cumulative total is converted for 10 marks for the observation

component of Internal Assessment. Five marks for the performance in the lab and the record

preparation.

c. Semester Examination for Theory and Practical Subjects

End semester theory examination shall be conducted for each paper with three hours

duration at the end of each semester for 75 Marks. The semester practical examination shall

be conducted for 60 Marks at the end of each semester by executing two Lab exercises from

the List of Exercises. The passing minimum for theory and practical during semester

examination is 50% of the maximum marks of semester examination.

The candidate failing in any subject(s) will be permitted to appear for each failed

subject(s) in the subsequent examination. The semester exam question papers are set 100%

external Question Paper Setters. The papers are also evaluated by external examiners 100% to

enforce high academic quality.

MINI PROJECT:

During the fifth semester, one practical is considered as mini project. This practical

course will be dealt as an in-house project or client-based real-time project. The teaching

faculty members are the internal guide to guide through the project development process end-

to-end. At the end of the semester, a report is to be mandatorily submitted and the evaluation

needs to be carried out as a practical course. Project Report, Presentation and Demonstration

are compulsory for evaluation.

PROJECT WORK:

During the final semester, a real-time project work is to be carried out by the students

individually under the supervision of internal faculty guide. A project report as per the

prescribed format has to be submitted at the end of the semester for evaluation. Viva-voce

will be conducted on the basis of the project report submitted by the student.

6. QUESTION PAPER PATTERN

a. For Theory

Time: 3 Hours Max. Marks: 75

Passing Min: 38

PART – A: 5 X 5 = 25 marks

(Answer ALL Questions)

(Two Questions from each unit with internal choice)

PART – B: 5 X10 = 50 marks

(Answer ALL Questions)

(Two Questions from each unit with internal choice)

12

b. For Practical

Time: 3 Hours Max. Marks: 60

Passing Min: 30 (50%)

One / Two Compulsory Problem(s) to be solved using a software technology within 3 hours.

c. Distribution of the Marks

(i) Practical :

• For writing procedure 20 %

• For writing program in the main answer book 30 %

• For listing and debugging 30 %

• For correct and formatted output 20 %

(ii) Project Work :

• Evaluation 150 Marks

• Viva–Voce 50 Marks

7. RULES FOR PROJECT WORK

a. Students should do their five months (December to April) Project Work in an

Industry or as an in-house project in the Institution itself.

b. Each Internal guide shall have maximum of five students.

c. The project is divided into four major phases namely: i) project specification and

analysis; ii) Design and Development; iii) Testing and Implementation; and

iv) Report submission and model Viva-voce.

d. The project should be reviewed atleast three times periodically by the internal

guide.

e. The students should prepare two copies of the project report and submit the same

at the end of the semester for evaluation by external examiner. After evaluation,

one copy is to be retained in the department and the student can hold one copy.

8. PASSING MINIMUM

A candidate shall be declared to have passed the examination if the candidate secures

not less than 50% of the marks in semester examination as well as in total marks in each

course. i.e. For theory courses, the candidate should get a minimum of 38 marks out of 75 in

SE and a minimum of 50 marks out of 100 in total marks.

For practical courses, the candidate should get a minimum of 30 marks out of 60 in

the semester examinations and a minimum of 50 marks out of 100 in total marks. Submission

of record note book is a must for practical examinations.

For the project work evaluation and viva-voce, a candidate should secure 50% of the

marks in the viva-voce examinations as well as 50% of the total marks.

13

Candidates who do not obtain the required minimum marks for a pass in a course

(theory or practical or project viva-voce) will be permitted to appear for the same in the

subsequent examinations on the same curriculum and syllabus.

9. CLASSIFICATION OF SUCCESSFUL CANDIDATES

The performance of the student is indicated by letter grades and the corresponding

Grade Point (GP), Grade Point Average (GPA), and Cumulative Grade Point Average

(CGPA).

RANGE OF MARKS GRADE POINTS LETTER GRADE DESCRIPTION

90-100 9.0-10.0 O Outstanding

80-89 8.0-8.9 D+ Excellent

75-79 7.5-7.9 D Distinction

70-74 7.0-7.4 A+ Very Good

60-69 6.0-6.9 A Good

50-59 5.0-5.9 B Average

00-49 0.0 U Re-appear

ABSENT 0.0 AAA ABSENT

where,

Ci – is the credits assigned to the course.

GPi – is the point corresponding to the grade obtained for each course

n – is number of all courses successfully cleared during the particular

semester in the case of GPA and during all the semesters in the case of

CGPA.

n n

Σ Ci GPi Σ Ci GPi i=1 i=1

GPA = ————————— CGPA = —————————

n n

Σ Ci Σ Ci

i=1 i=1

14

The classification of a candidate at the end of the programme is as follows:

CGPA GRADE CLASSIFICATION OF FINAL RESULT

9.5 – 10.0 O+

First Class – Exemplary * 9.0 and above but below 9.5 O

8.5 and above but below 9.0 D++

First Class with Distinction * 8.0 and above but below 8.5 D+

7.5 and above but below 8.0 D

7.0 and above but below 7.5 A++

First Class 6.5 and above but below 7.0 A+

6.0 and above but below 6.5 A

5.5 and above but below 6.0 B+

Second Class 5.0 and above but below 5.5 B

4.5 and above but below 5.0 C+

Third Class 4.0 and above but below 4.5 C

0.0 and above but below 4.0 U Re-appear

*The candidates who have passed in the first appearance and within the prescribed semester of the PG

programme are eligible

10. COMMENCEMENT OF THIS REGULATION

These regulations shall take effect from the academic year 2017-2018. i.e., for

students who are admitted in the first year of the programme during the academic year

2017-18, second year of the programme during the academic year 2018-19 (lateral entry)

and thereafter. Those students who gets admitted under the specific regulations will follow

the same until the maximum duration for the programme i.e. 10 semesters.

Sum of the multiplication of obtained grade points

by the credits of the courses in a semester

GPA = —————————————————————————————

Sum of the credits of the courses passed in a semester

Sum of the multiplication of obtained grade points

by the credits of the courses passed

CGPA = ——————————————————————————————

Sum of the credits of the courses passed

15

In case, any student is debarred and repeating any semester will go by the next

regulation after the maximum regulation validity of 14 semesters.

11. TRANSITORY PROVISION

Candidates who were admitted to the MCA programme before 2017-2018 shall not be

permitted to appear for the examinations under these regulations.

12. MAXIMUM DURATION FOR THE COMPLETION OF THE PG

PROGRAMME

The maximum duration for completion of the MCA programme shall not exceed ten

semesters. If any student is debarred due to shortage of attendance, the student can redo that

particular semester in the forthcoming years provided there is a vacancy within the

sanctioned strength of that semester concerned (the vacancy will differ for the first two

semesters and the rest four semesters due to lateral entry admission).

*****

16

GOVERNMENT ARTS COLLEGE(AUTONOMOUS), SALEM-7


SEMESTER-I

CORE COURSE-I : DISCRETE STRUCTURES

COURSE CODE : 17PCA01

COURSE OBJECTIVES:

• To understand the concepts and operations of matrix algebra needed for computing

graphics modeling.

• To understand and apply the class of functions which transform a finite set into

another finite set which relates to input output functions in computer science.

• To impart discrete knowledge in computer engineering through finite automata and

Context free grammars.

COURSE OUTCOMES:

On successful completion of the course, the student will be able to:

• Apply the basic knowledge of matrix, set theory, functions and relations concepts

needed for designing a

• nd solving problems.

• Practice logical operations and predicate calculus needed for computing skill.

• Design and solve Boolean functions for defined problems.

• Apply the acquired knowledge of formal languages to the engineering areas like

Compiler Design.

• Apply the acquired knowledge of finite automata theory and design discrete problems

to solve by computers.

UNIT-I

Introduction: Statements and Notations- Connectives: Negation- Conjunction-

Disjunction-Statement Formulas and Truth Tables-Conditional and Bi-Conditional-Well

Formed Formulas-Tautologies-Equivalence of Formula-Duality law-Tautological

implications. Normal Forms: Disjunctive Normal Forms-Conjunctive Normal Forms-

Principal Disjunctive Normal Forms- Principal Conjunctive Normal Forms.

UNIT-II

Theory of inference for the Statement Calculus-The Predicate Calculus: The

Statement, function, variables and quantifiers-Predicate formulas-Free and Bound Variables-

The Universe of discourse. Inference Theory of the Predicate Calculus: Valid Formulas

and equivalences-Some valid formula involving quantifiers- Theory of inference for the

predicate calculus-Formulas involving more than one quantifiers.

UNIT-III

Relations and Functions: Relations and ordering – Properties and Binary relations in

a Set – Relation Matrix and Graph of a relation – Partition and covering of a set –

Equivalence Relations – Compatibility relations – Composition of Binary Relations –

Functions. Definition and Introduction – Composition of function – Inverse functions –

Binary and n-nary operations – Hashing functions – Natural numbers – Recursion.

17

UNIT-IV

Lattices and Boolean Algebra: Lattices as partially ordered sets – Some Properties

of Lattices – Boolean Algebra – Boolean Functions.

UNIT-V

Grammars and Languages : Discussion of Grammars – Formal Definition of a

Languages – Notions of syntax Analysis – Polish Expression and their compilation – Simple

Precedence Grammars.

REFERENCE BOOKS:

1. Trembly J.P. and Manohar R., “Discrete Mathematical Structures with Applications to

Computer Science”, Tata McGraw Hill Publications Co. Ltd., New Delhi 2003.

2. Kolman, Busy and Ross,”Discrete Mathematical Structures”, PHI.

3. K.D. Joshi, “Foundations of Discrete Mathematics”, Wiley, Estern Limited.

WEB RESOURCES:

1. www.cs.yale.edu/homes/aspnes/classes/202/notes.pdf

2. home.iitk.ac.in/~arlal/book/mth202.pdf

3. https://www.cims.nyu.edu/~regev/teaching/discrete_math_fall_2005

18

GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM-7


SEMESTER-I

CORE COURSE-II : DATA STRUCTURES AND ALGORITHMS


COURSE OBJECTIVES:

• To understand the linear and non linear data structures available in solving problems.

• To know about the sorting and searching techniques and its efficiencies.

• To get a clear idea about the various algorithm design techniques.

• To understand the application of data structures and algorithms

• To acquire the skill to analyze the efficiency of an algorithm.

COURSE OUTCOMES:


• Select and apply the data structure to suit any given problem.

• Identify the data structure as per the application need.

• Apply the algorithm design techniques to any of the real world problem.

• Develop any new application with the help of data structures and algorithms.

• Write an efficient algorithm for a given problem.

• Analyze its time complexity.

UNIT-I

Data structures: Definitions – Concept of Data structures - Overview of Data

structures – Implementation of Data structures. Array: Definition – Terminology - One

dimensional array – Multidimensional arrays – Pointer Array – Application of Array: Sparse

Matrices manipulation. Linked lists: Definition – Single Linked list – Double Linked list –

Circular Linked list – Application of Linked lists- Memory Representation.

UNIT-II

Stacks: Introduction - Definition – Representation of Stack – Operations of Stack –

Application of Stack: Evaluation of Arithmetic Expression – Infix to Postfix conversion -

Implementation of Recursion. Queues: Introduction - Definition – Representation of Queues

– Various Queue Structures- Application of Queues.

UNIT-III

Trees: Basic Terminology - Definition - Binary Tree – Properties of a Binary Tree –

Representation of Binary Tree – Operations on a Binary Tree – Traversals – Type of Binary

Tree - Expression Tree – Trees and Forest - Conversion of a forest tree to Binary Tree.

Tables: Rectangular Tables – Jagged Tables – Inverted Tables – Hash Tables – Hashing

Techniques.

UNIT-IV

Graphs: Definitions – Graph terminologies – Representation of Graphs – Operations

of Graphs – Graph Traversals: Depth First Search – Breadth First Search – Application of

Graph Structure – Shortest Path Problem: Dijikstra and Warshall Algorithms, Minimum Cost

Spanning Tree: Kruskal’s and Prim’s algorithm. Searching: Basic Terminologies – Linear

19

Search – Binary Search – Comparison of Linear and Binary Search. Sorting: Insertion Sort –

Bubble Sort – Quick Sort – Merge Sort – Heap Sort.

UNIT-V

Algorithms: Development of Algorithms – Principles of Analyzing Algorithms: Order

of Growth – Efficiency – Operations of order of Growth – Feasible and Optimal Solutions-

Algorithm Design Technique: Divide and Conquer Algorithms – Quick Sort – Dynamic

Programming – Warshall’s Algorithm – Greedy Technique – Kruskal Algorithm – Branch and

Bound – Traveling Salesman Problem.

REFERENCE BOOKS:

1. D. Samanta, “Classic Data Structures”, Prentice Hall of India Pvt. Ltd., 9th Edition,

2007.

2. E. Horowitz, S.Sahni and Dinesh Mehta, “Fundamentals of Data structures in C++”,

University Press, 2007.

3. Anany Levitin “Introduction to the Design and Analysis of Algorithms” Pearson

Education 2003.

4. Jean Paul Tremblay AND Paul G.Sorenson, “An Introduction to Data Structures with

Applications”, Tata McGraw-Hill & Co., Ltd., New Delhi.

5. M. A. Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson Education

Asia, 2013.

6. An Introduction to Data Structures and Algorithms, James A Store, Springer Science,

2012.

7. Data Structures and Algorithms made easy, Narasimha Karumanchi, CreateSpace

Independent Publishing Platform, 2011

WEB RESOURCES:

1. http://nptel.ac.in/courses/106102064/

2. https://www.tutorialspoint.com/data_structures_algorithms/

3. http://lib.mdp.ac.id/ebook/Karya%20Umum/Dsa.pdf

4. https://web.stanford.edu/class/cs97si/03-data-structures.pdf

20



SEMESTER-I

CORE COURSE-III : PROBLEM SOLVING AND PROGRAMMING IN C


COURSE OBJECTIVES:

• To understand the basic concepts of problem solving approaches.

• To know the optimal program structure using conditional and iterative control

structures and functions.

• To learn to design, implement, debug and test programs.

• To trace the programs developed in C programming language.

• To understand the techniques of structured (functional) decomposition to break a

program into smaller pieces and describe the mechanics of parameter passing.

COURSE OUTCOMES:


• Design a computational solution for a given problem.

• Break a problem into logical modules that can be solved (programmed).

• Transform a problem solution into programs involving programming constructs

• Write programs using structures, strings, arrays, pointers and files for solving

complex computational problem.

• Introduce modularity using functions and pointers which permit ad hoc run-time

polymorphism.

UNIT I

INTRODUCTION TO COMPUTER PROBLEM SOLVING: Introduction – The

Problem Solving Aspect – Top Down Design – Implementation of Algorithm – Program

Verification – The Efficiency of Algorithm – The Analysis of Algorithm.

UNIT II

PROGRAMMING, ALGORITHMS AND FLOWCHARTS: Programs and

Programming – building blocks for simple programs – Programming Life Cycle Phases –

Pseudo Code Representation – Flow Charts - Algorithm - Programming Languages –

Compiler – Interpreter, Loader and Linker – Program Execution – Classification of

Programming Language – Structured Programming Concept.

UNIT III

BASICS OF ‘C’, INPUT / OUTPUT & CONTROL STATEMENTS: Introduction

– Identifier – Keywords – Variables – Constants – I/O Statements – Operators – Initialization

–Expressions – Expression Evaluation – Lvalues and Rvalues – Type Conversion in C –

Formatted input and output functions - Specifying Test Condition for Selection and Iteration

Conditional Execution and Selection – Iteration and Repetitive Execution- Goto Statement –

Nested Loops – Continue and Break Statements.

21

UNIT IV

ARRAYS, STRINGS, FUNCTIONS AND POINTERS: Array – One Dimensional

Character Arrays- Multidimensional Arrays – Arrays of Strings - Two

Dimensional Character Array – Functions – Parameter Passing Mechanism Scope – Storage

Classes – Recursion – Comparing Iteration and Recursion- Pointers – Pointer Operators -

Uses of Pointers- Arrays and Pointers – Pointers and Strings – Pointer Indirection – Pointers

to Functions – Dynamic Memory Allocation.

UNIT V

USER-DEFINED DATATYPES & FILES: Structures – Initialization - Nested

Structures – Structures and Arrays – Structures and Pointers – union – Typedef and

Enumeration Types – File Management in C – Files and Streams – File Handling Functions –

Sequential Access File- Random Access File – Command Line Arguments.

REFERNCE BOOKS:

1. R.G.Dromey, “How to solve it by computer”, Pearson education, fifth edition, 2007.

2. Pradip Dey, Manas Ghosh, “Fundamentals of Computing and Programming in C”,

First Edition, Oxford University Press, 2009.

3. Kamthane, A.N., “Programming with ANSI and Turbo C”, Pearson Education,

Delhi,2010.

4. Deitel and Deitel, “C How to Program”, Pearson Education. 2010 6 th edition.

5. Brian W. Kernighan and Dennis M. Ritchie, “The C programming Language”,2006,

Prentice-Hall.

6. Yashavant Kanetkar, “Understanding Pointers In C”, 4th Revised & Updated Edition,

2008, BPB Publications.

7. Cormen,Leiserson, Rivest, Stein, “ Introduction to Algorithms”, McGraw Hill ,

Publishers, 2002.

8. Peter Norton, “Introduction to Computers”, Sixth Edition, Tata McGraw Hill

Publications, 2007.

9. Reema Thareja, “Programming in C”, Oxford University Press, 2011.

WEB RESOURCES:

1. http://www.w3schools.in/c-tutorial/

2. http://www.tutorialspoint.com/cprogramming/

3. https://www.programiz.com/c-programming

22



SEMESTER-I

CORE COURSE-IV : CRITICAL THINKING


COURSE OBJECTIVES:

• To know the free software ALICE.

• To introduce the students to the wonderful world of thinking to programming.

• To be aware of thinking to solutions.

• To recognize the ways and means to mix and match the features.

• To understand the features of ALICE.

• To learn the coding with enjoyable elements.

COURSE OUTCOMES:


• Download and install Alice.

• Set preferences and use Alice IDE.

• Create code for setting scenes with actors using various statements.

• Apply programming constructs to develop code with effects.

• Develop simple simulation applications for different concepts of various domains.

• Create interactive applications with customization of interactive input.

• Infer OOP concept from Alice programming.

UNIT – I

INTRODUCTION TO ALICE – Alice and Object Oriented Programming –

Exploring the Interface: Main Work Areas -- Icons – Buttons and Menus – Playing an Alice

– Creating the First Alice World: Creating Objects – Adding Objects – Object Classes and

Instances – Positioning Objects – Adding Actions – Closing and Reloading – Printing Code

from Alice World – Saving an Alice World as a Movie File.

UNIT – II

METHODS: Top down Design and Modular Development – The Software

Development Cycle: Designing Methods – Coding methods – Testing and Debugging –

Working with Primitive methods - Creating New Methods in Alice – Methods with

Parameters. ALGORITHMS – Elements of Logical Structure – Linear Sequences –

Selection Sequences – Repetition Sequences – Parallel Algorithms – Branching in Alice

Methods – A Simple Count-Controlled Loop – Using the While Instruction - Boolean Logic –

Comparing Values

UNIT – III

EVENTS: Event Driven Software – Three Dimensional Space – Events in Alice –

Building Camera Controls with Events – Building a flying Machine in Alice – Text and

Sound: Adding Elements of Language to an Alice World – Using the Say and Think Methods

– The Print Instruction – Three Dimensional Text – Sound in Alice Worlds.

23

UNIT – IV

RECURSIVE ALGORITHMS: Recursion– Recursion Algorithms – Recursion

compared to Iteration – Infinite Recursion and Conditional recursion - Creating Recursion

Methods – Converting Existing Iterative Methods to Recursion – List and Arrays in Alice :

The need for different data structures – Lists – Arrays.

UNIT – V

MAKING ANIMATED MOVIE WITH ALICE : Introduction – The Movie

Making Process – Recording a Movie from Alice – Preproduction – Storyboarding –

Simulating multiple cameras - Recording Camera Positions for a Multi shot Scene –

Postproduction - Video Game Programming: Video Game Careers – Video Game

Programming Features.

REFERENCE BOOKS:

1. Charles W. Herbert,“An introduction to Programming using Alice 2.2”, Course

Technology-Cengage Learning, Second Edition.

2. Vanesa S. Olsen, “Alice 3 Cook Book”, Packt Publishing Ltd, Open

Source(Community experience distilled), Birmingham, UK, 2011.

3. Wanda Dann, Dennis Cosgrove, Don Slater, Dave Culyb, Laura Paoletti, Pei Tang,

“Alice 3 How-to Guide (Part 1, Part-2, Part-3 - Getting Started)”, 1st Edition, 2012.

4. Wanda Dann, Stephen Cooper, Randy Pausch, “Learning to Program with Alice”,

PHI, 2006.

WEB RESOURCES:

1. https://www.alice.org/

2. http://info.aliceapp.com/schedule-your-alice-demo

3. https://www.fileplanet.com/52849/50000/fileinfo/American-McGee%27s-Alice-

Demo

4. https://themeforest.net/item/alice-agency-freelance-portfolio-theme/11302841

5. http://www.aliceprogramming.net/

24



SEMESTER-I

CORE PRACTICAL -I : C PROGRAMMING

COURSE CODE : 17PCAP1

COURSE OBJECTIVES:

• To understand the basic concepts of problem solving approaches.

• To achieve critical thinking to form the algorithm.

• To get an idea about design, implementation, debugging and testing the C programs.

• To learn the techniques of structured (functional) decomposition to break a program

into smaller pieces and describe the mechanics of parameter passing.

• To learn the syntax and semantics of various statements in C.

COURSE OUTCOMES:


• Design a computational solution for a given problem.

• Break a problem into logical modules that can be solved (programmed).

• Transform a problem solution into programs involving programming constructs

• Write programs using structures, strings, arrays, pointers and files for solving

complex computational problem.

LIST OF EXERCISES

1. Write a program to read the following information, Employee number, Name,

Designation, and Basic Salary. Calculate the DA - 80 % of Basic Salary, HRA - 15 % of

Basic Salary, PF -12 % of Basic Salary. Finally, Calculate gross salary and net salary of

an employee.

2. Write a program to find the sum of individual digits using decision making and looping.

3. Write a program to find the biggest and lowest elements of numbers using array.

4. Write a program in C to find n-th maximum and minimum number from the list of

numbers given.

5. Write a program to arrange names in alphabetical order using String functions.

6. Write a program to implement matrix manipulation using functions.

7. Write a program to print ‘n’ Fibonacci Series and factorial of ‘n’ numbers using recursion.

8. Write a program to print the Student’s Mark sheet assuming Register Number, Name,

Course, Date of Birth, and Marks in 5 subjects in a structure. Create an array of Structures

and print the Mark sheet in university pattern.

9. Implement a Stack with Push and Pop operations using arrays.

10. Create a Queue and do the Inserting and deletion operations using arrays.

11. Implement the operations of Singly Linked List.

12. Write a program which takes a file as command line argument and copy it to another file.

At the end of the second file, file has to write (i) No. of lines (ii). No. of Words (iii). No.

of Characters.

25

WEB RESOURCES:

1. http://www.includehelp.com/c-programming-examples-solved-c-programs.aspx

2. http://www.w3resource.com/c-programming-exercises/

3. http://fresh2refresh.com/c-programming/

26



SEMESTER-I

CORE PRACTICAL –II : CREATIVE THINKING TO PROGRAMMING


COURSE OBJECTIVES:

• To understand the way Office Suite can be used for making documents of text, data,

images, graphics and videos.

• To enable the students in crafting professional databases.

• To understand the tricks of programming.

• To make awareness to critical thinking towards programming

• To familiarize the steps in preparation of programs through some open source tools.

• To expose students to programming.

• To offer a safe environment for making mistakes, a platform to develop critical

thinking and problem-solving skills and a fun way to experiment with technology.

• Learn programming basics in a creative context that’s more engaging and less

complicated.

COURSE OUTCOMES:


• Prepare documents of text and other forms of data.

• Prepare reports and show charts with data.

• Prepare presentation slides with effects and animation.

• Create databases, tables, database queries and reports.

• Write programs with the help of enjoyable coding approaches.

• Develop the skill of programming using tools such as ALICE.

LIST OF EXERCISES

1. Prepare a table of contents and index for a document.

2. Create a student details in Ms-Word table format which has details of ROLLNo.,

NAME, CLASS, MARK 1, MARK 2, MARK 3 and find TOTAL and Average of the

marks.

3. Creating Project abstract features to be covered: Formatting styles-inserting tables-

bullets and numbers-Changing text direction- cell alignment-foot note-hyperlink-

symbols-spell checker.

4. Prepare Individual Pay Bill Preparation using Formulae and Built-in Functions.

5. Creating self running presentations using Text with Animation and Transition

containing Images and Media files.

6. Create databases, enter and edit data using forms to generate reports using Report

Wizard.

27

7. Develop an ALICE program that performs some mathematical calculations that

determines how big a cube grows.

8. Design and code a branching exercise for penguin on the ice using if-else in ALICE.

9. Using simple looping to design a clock application in ALICE.

10. Use looping and the do-together constructs to demonstrate rescue at sea in ALICE.

WEB RESOURCES:

1. https://www.microsoft.com/en-in/learning/training.aspx

2. https://ptgmedia.pearsoncmg.com/images/9780735669413/samplepages/97807356694

13.pdf

3. https://www.gcflearnfree.org/subjects/office/

4. www.aliceprogramming.net/

5. http://www.alice.org

6. https://www.alice.org/resources/alice-3-exercises-projects/

7. http://pages.cpsc.ucalgary.ca/~tamj/2010/203P/extras/exercises/exercises.htm

28



SEMESTER-II

CORE COURSE-V : COMPUTER ORIENTED NUMERICAL METHODS

AND PROBABILITY THEORY


COURSE OBJECTIVES:

• To understand and apply numerical methods for solving systems of linear equations.

• To understand and apply numerical integration and differentiation.

• To solving initial value problems of ordinary differential equations numerically.

• To provide an understanding of the statistical methods and probabilistic concepts by

which real-life problems are analyzed.

COURSE OUTCOMES:


• Apply the various methods used for the numerical solution of scientific problems.

• Solve system of linear equations and initial value problems of ordinary differential

equations numerically.

• Realize the value of probability and Statistics in acquiring knowledge and making

decisions.

• Develop an ability to apply statistical tests in experiments, as well as to analyze and

interpret data.

(Note : Focus on problems- No derivations)

UNIT I

Linear System of Equations: Solution of Systems of Equations – Solution of

Simultaneous Linear Equations – Gauss Elimination Methods – Gauss Jordan Methods,

Jacobi and Gauss Seidal Iterative Methods.

UNIT II

Numerical Differentiation and Integration: Interpolation, Differentiation and

Integration – Difference Table – Newton’s Forward and Backward Interpolation – Lagrangian

Interpolation – Trapezoidal and Simpson Rule.

UNIT III

Differential Equations: Ordinary Differential Equations–Taylor Series and Euler

Methods, Runge – Kutta Methods – Predictor-Corrector Method – Milne and Adam –

Bashforth Methods.

UNIT IV

Probability Distributions: Probability Axioms- Bayes Theorem – Discrete Random

Variables and Continuous Random Variables – Density & Distribution Functions - Joint and

Marginal Distributions –Conditional Distributions.

UNIT V

Sampling Distributions: Small Sample, T-Test, F-Test, Chi-Square Test, ANOVA

One-way Classification and Two-way Classifications.

29

REFERENCE BOOKS:

1. P. Kandasamy- “Numerical Methods” – S. Chand Company, 2010.

2. T. Veerarajan, “Probability Statistics and Random Process”, Tata McGraw Hill, 2010.

3. Grewal B.S, “Numerical Methods in Engineering and Science”, Khanna Publishers,

1994.

4. John.E..Freund, Irwin Miller, Marylees Miller, “Mathematical Statistics with

Applications”, Seventh Edition, Prentice Hall of India, 2004.

5. A.M.Natarajan & A.Tamilarasi, “Probability Random Processes and Queuing

Theory”, New Age International Publishers, 2nd

Edition, 2005.

6. S.K. Gupta, “Numerical Methods for Engineers”, New Age International Publishers,

1995.

7. M.K.Venkatraman, “Numerical Methods”, National Pub. Company, Third Edition,

1995.

WEB RESOURCES:

1. http://www.rejinpaul.com/2015/03/ma6459-numerical-methods-syllabus-notes-

question-papers-regulation-2013.html

2. http://authors.library.caltech.edu/down.html

3. http://www.ou.edu/class/che-design/Num-Meth-06/

30



SEMESTER-II

CORE COURSE-VI : OBJECT ORIENTED PROGRAMMING AND C++


COURSE OBJECTIVES:

• To know the meaning of object–oriented approach.

• To understand the class–object paradigm.

• To know the concept operator overloading.

• To appreciate about inheritance.

• To understand and apply the concepts of virtual and friend functions.

• To appreciate about exception handling mechanisms.

• To realize the feature of STL.

COURSE OUTCOMES:


• Define various Classes and Object for any Real-time Application.

• Illustrate the types of Inheritance.

• Apply the different features such as Inheritance, Function and Operator Overloading.

• Develop C++ code using the Virtual AND Friend Functions.

• Analyze and design an application using object oriented programming approach.

UNIT–I

Basic Concepts of OOPs–Structure of C++–Data Types – Variables – Functions –

Scope of Variables – Inline Function–Default arguments – Dynamic allocation – New and

Delete Operators – References – Arrays.

UNIT–II

Classes and Objects – Constructors and Destructors – Controlling and Accessibility

Class Member and Member Function – Friend Function and Friend Class – This Pointer –

Static Member Function.

UNIT–III

Overloading: Functions and Operators–Inheritance – Types of Inheritance Access

Control – Virtual Base Class – Pointer – Virtual Function – Polymorphism.

UNIT–IV

I/O Streams: Managing Console I/O – Manipulators – File I/O streams - Managing

Sequential and Random access files – Template Class and Function.

UNIT–V

Exception Handling (Try, Catch and Throw) – STL: Overview – Components of STL

– Containers – Algorithm – Iterators.

REFERENCE BOOKS:

1. E.Balagurusamy, “Object Oriented Programming with C++”, Sixth Edition, McGraw

Hill Publication , 2013.

2. Herbert Schildt, "C++ The Complete Reference", Tata McGraw Hill Edition, 2003.

31

3. Bjarne Stroustrup, "The C++ Programming Language", 3rd Edition, Addison Wesley,

2000.

4. Ravichandran, Programming With C++, TMH, 1995.

WEB RESOURCES:

1. http://www.w3schools.in/c-tutorial/

2. http://www.tutorialspoint.com/cprogramming/

3. https://www.programiz.com/c-programming

32



SEMESTER-II

CORE COURSE-VII : RELATIONAL DATABASE MANAGEMENT SYSTEMS


COURSE OBJECTIVES:

• Understand the introduction to database, historical roots and its models.

• Know the fundamentals of data models and conceptualize.

• Explain the database system using ER diagram.

• Study the SQL and relational database design.

• Impart knowledge on transaction processing, concurrency control techniques and

recovery procedures.

• Know the functions of distributed DBMS.

COURSE OUTCOMES:


• Define the basic concepts of the database and data models.

• Design a database using ER diagrams and map ER into Relations.

• Apply normalization on the relations.

• Perform query evaluation to monitor the performance of the DBMS.

• Develop a simple database applications using normalization.

• Compare and contrast about different special purpose databases and to critique how

they differ from traditional database systems.

• Implement the distributed database transparency features and data fragmentation.

UNIT – I

Files systems and Database : Data versus Information - Introducing the Database –

The Historical Roots of the Database : Files and File Systems – Problems with File System

Data Management – Database Systems. Database Models: Evolution of Data Models –

Degrees of Data Abstraction.The Relational Database Model: A Logical View of Data –

Keys – Integrity Rules – Relational Set Operators – The Data Dictionary and the System

Catalog – Relationships within the Relational Database – Data Redundancy Revisited –

Indexes – Codd’s Relational Database Rules.

UNIT – II

Entity Relationship (E-R) Modeling: The Entity Relationship (E-R) Model –

Developing an ER Diagram – Database design challenges. Normalization of Database

Tables: Database Tables and Normalization – Need for normalization – Normalization

Process – Higher – Level Normal Forms – Demoralization.

UNIT – III

Structural Query Language (SQL): Introduction to SQL – Data Definition

Commands – Data Manipulation Commands – Queries – Advanced Data Management

Commands – More Complex Queries and SQL Functions – Updatable Views – Procedural

SQL: Triggers – Stored Procedures.

33

UNIT – IV

Transaction Management and Concurrency Control: What is Transaction? –

Concurrency Control – Concurrency Control with Locking Methods – Concurrency Control

with Time Stamping Methods – Concurrency Control with Optimistic Methods – Database

Recovery Management.

UNIT – V

Distributed Database Management Systems: The Evolution of Distributed

Database Management Systems – Distributed Processing and Distributed Databases –

Functions of Distributed Database Management System – DDBMS Components – Levels of

Data and Process Distribution – Distributed Database Transparency Features – Distribution

Transparency – Transaction Transparency – Performance Transparency and Query

Optimization – Distributed Database Design – Data Fragmentation.

REFERENCE BOOKS:

1) Peter Rob Carlos Coronel, “Database Systems – Design Implementation and

Management”, Thomson Course Technology, Fifth Edition – 2002.

2) Abraham Silberschatz, Henry F.Korth and S.Sundarshan “Database System Concepts”,

Sixth Edition, McGraw Hill, 2010.

3) C.J. Date, “An Introduction to Database Systems”, Eight Edition, Pearson Education

Delhi, 2003.

4) Ramez Elamassri and Shankant B-Navathe, “Fundamentals of Database Systems”,

Sixth Edition, Pearson Education Delhi, 2010.

5) Raghu Ramakrishnan, Johannes Gehrke ,’ Database management systems” McGraw

Hill, 2003.

6) Peter Rob, Carlos Coronel, “Database System Concepts”, Cengage Learning, 2008.

WEB RESOURCES:

1. https://www.vssut.ac.in/lecture_notes/lecture1423726199.pdf

2. https://www.tutorialspoint.com/dbms/dbms_tutorial.pdf

3. http://tmv.edu.in/pdf/Distance_education/BCA%20Books/BCA%20IV%20SEM/BC

A-428%20Oracle.pdf

34



SEMESTER-II

CORE COURSE-VIII : DIGITAL LOGIC DESIGN AND COMPUTER

ARCHITECTURE


COURSE OBJECTIVES:

• Understand the basic theoretical concepts of digital systems like the binary system

and Boolean algebra.

• Express real life problem in logic design terminology.

• Use Boolean algebraic formulations to design digital systems.

• To design using combinational/sequential circuits

• Understand the Instruction execution stages.

• Learn the functions of the various computer hardware components.

COURSE OUTCOMES:


• Comprehend the number systems, combinational sequential circuits to be in a position

to continue with computer organization.

• Analyze the I/O and memory organization in depth.

• Write assembly language programs for different operations.

UNIT- I

DIGITAL LOGIC CIRCUITS: Basic Logic Functions, Logic Gates, Universal

Logic Gates, Minimization of Logic expressions. Flip-flops, Combinational Circuits. Digital

Logic Circuits-II: Registers, Shift Registers, Binary Counters, Decoders, Multiplexers,

Programmable Logic Devices.

UNIT- II

MEMORY AND PROGRAMMABLE LOGIC: RAM, Memory Decoding, Error

Detection and Correction ROM, Programmable Logic Array, Programmable Array Logic,

Design at the Register Transfer Level: Register Transfer Level Notation, Register Transfer

Level in HTL, Algorithm State Machine, Design Example(ASMD Chart).

UNIT- III

COMPUTER ARITHMETIC: Algorithms for Fixed Point and Floating Point

Addition, Subtraction, Multiplication and Division Operations. Hardware Implementation of

Arithmetic and Logic operations, High Performance Arithmetic Instruction Set & Addressing:

Memory Locations and Addresses: Various Addressing Modes, Instruction Formats, Machine

Addresses and Sequencing.

UNIT- IV

PROCESSOR ORGANIZATION: Introduction to CPU, Register Transfers,

Execution of Instructions, Multiple Bus Organization, Hardwired Control, Micro

Programmed Control Memory Organization: Concept of Memory: RAM, ROM Memories,

Memory Hierarchy, Cache Memories, Virtual Memory, Secondary Storage, Memory

Management Requirements.

35

UNIT- V

INPUT / OUTPUT ORGANIZATION: Introduction to I/O, Interrupts – Hardware,

Enabling and Disabling Interrupts, Device Control, Direct Memory Access, Buses, Interface

Circuits, Standard I/O Interfaces.

REFERENCE BOOKS:

1. M.Morris Mano, “Digital Design”, Pearson Education/PHI, Fith Edition, 2013.

2. M.Moris Mano, “Computer Systems Architecture”, Third Edition, Pearson Education,

2008.

3. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, “Computer Organization”, Fifth

edition, McGraw Hill, 2011.

4. Miles Murdocca, Vincent Heuring, “Computer Architecture and Organization - An

Integrated Approach”, Second Edition, Wiley India.

5. William Stallings, “Computer Organization and Architecture”, Sixth Edition, Pearson

Education.

6. David A. Paterson and John L. Hennessy, “Computer Organization and Design”,

Elsevier.

WEB RESOURCES:

1. http://www.rejinpaul.com/2014/06/cs6303-computer-architecture-syllabus-notes-

question-papers-cs6303ca-cse-it-3rd-sem-regulation-2013.html

2. http://studentsblog100.blogspot.in/2014/07/cs6303-computer-architecture-syllabus-reg-

2013-for-3rd-cse.html.

3. http://studentskey.in/computer-architecture-lecture-notes-pdf/

36



SEMESTER-II

CORE PRACTICAL -III : OBJECT ORIENTED PROGARMMING AND DATA

STRUCTURES


COURSE OBJECTIVES:

• To understand the concepts of object oriented programming.

• To know the types of data structures such as stack, queue, arrays and linked lists.

• To appreciate the operations on the linear data structures.

• To understand the non-linear data structures – trees and graphs and its traversals.

• To recognize the importance of searching and sorting and the various techniques

available for the same.

COURSE OUTCOMES:

On successful completion of the course, the students will be able to:

• Write code for demonstrating the OOP concepts such as class definition, object

creation, inheritance and polymorphism.

• Represent the stack and queue using arrays and linked lists.

• Implement the various operations on singly linked list, doubly linked list.

• Perform traversals on binary tree.

• Develop programs to sort the given data using sorting techniques namely merge and

quick sort.

• Perform graph search like depth first search and breadth first search.

LIST OF EXERCISES

1. Write C++ program to demonstrate the definition of Class and Creation of Objects.

2. Demonstrate the different types of Inheritance in C++.

3. Write a C++ program for implementing polymorphism through operator overloading and

function overloading.

4. Implement a Stack with Push and Pop operations using linked lists.

5. Create a Queue and do the Inserting and deletion operations using linked lists.

6. Implement the operations of Doubly Linked List.

7. Create a binary tree and perform In–order, Pre-order and Post-order traversals.

8. Write C++ program to sort the given list of numbers using Quick sort.

9. Write a program to perform on a graph: Depth First Search and Breadth First search.

10. Write a program to find the shortest path in a given graph using Dijkstra algorithm.

WEB RESOURCES:

1. http://www.includehelp.com/c-programming-data-structure-examples.aspx

2. http://www.geeksforgeeks.org/c-programs-gq/stack-queue-cc-programs-gq/

3. http://www.mycplus.com/tutorials/data-structures/arrays-c-cpp-programming/

37



SEMESTER-II

CORE PRACTICAL–IV : SQL QUERIES AND REPORTS


COURSE OBJECTIVES:

• To understand the features SQL.

• To know the SQL commands and its syntax.

• To appreciate the way database objects can be created and manipulated.

• To learn the various options available in Select statement.

• To try making reports.

• To learn programming constructs for query language.

COURSE OUTCOMES:


• Create and structure database schema using create, alter and drop.

• Apply data manipulation commands such as insert, update and delete to maintain the

data storage with store and update operations.

• Execute select statement with variety of options for simple to complex queries.

• Formulate query statements with multiple table access.

• Apply the report writing commands for writing simple programs.

• Generate reports with formatting options.

LIST OF EXERCISES

1. Data Definition Commands: Create, Alter, Drop

2. Data Manipulation Commands: Insert, Update, Delete

3. Simple operations using database query statements.

a. Comparison Operators

b. Logical Operators

c. Set Operators

d. Built in functions

4. Advanced Query statements

a. All types of Join Operations

b. Sub-queries and correlated sub-queries

c. Use of set and other commands for temporary reporting

5. Reports using programming language features of database software

a. Program for displaying student grade sheet preparation.

b. Create a Report for implementing Electricity Bill Calculation.

c. Program to generate a report for the Employee database using triggers.

d. Write a employee database trigger to implement the concept of master detail

relationship.

WEB RESOURCES:

1. https://www.tutorialspoint.com/sql/sql-select-query.htm

2. https://www.w3schools.com/sql/

3. http://a4academics.com/interview-questions/53-database-and-sql/397-top-100-

database-sql-interview-questions-and-answers-examples-queries

38



SEMESTER-III

CORE COURSE- IX : CORE JAVA


COURSE OBJECTIVES:

• Understand Object Oriented Programming concepts through Java features.

• Know the basic characteristics of Java

• Understand the concept of class hierarchy

• Understand the difference between a Java application and a Java applet

• Learn the steps for developing java Applets.

• Know how to design a simple graphical user interface using Graphics package.

COURSE OUTCOMES:


• Apply object oriented programming concepts

• Include exception handling in java

• Develop web applications using applets.

• Create graphical user interface in java programs

• Define and use packages and interfaces in a java program.

• Code and use graphics classes for graphics features in applet development.

UNIT – I

FUNDAMENTALS OF OOP: Basic concepts of OOP – Benefits of OOP. Java

Evolution: Java History – Java Features – Java Environment. Overview of Java:

Introduction – Java Program Structure – Java Tokens – Java Statements – JVM – Command

Line Arguments. Constants, Variables and Data types. Operators and Expressions –

Decision Making and Branching – Decision Making and Looping.

UNIT – II

CLASSES, OBJECTS AND METHODS: – Constructors – Arrays, Strings and

Vectors – Interfaces: Defining, Extending, and Implementing Interfaces, Accessing Interface

Variables.

UNIT – III

MANAGING ERRORS AND EXCEPTIONS: Introduction – Types of Errors –

Exceptions – Exception Handling Code – Multiple Catch Statements – Finally Statement –

Throwing Own Exceptions – Using Exceptions for Debugging. MANAGING

INPUT/OUTPUT FILES: Concept of Streams – Stream Classes – Byte Stream Classes –

Character Stream Classes – Using the File Class – I/O Exceptions – Reading/Writing

Characters and Bytes - Handling Primitive Data Types – Concatenating and Buffering Files –

Random Access Files.

UNIT – IV

PACKAGES: Introduction – Java API Packages – Using System Packages – Creating

Packages – Accessing Packages – MULTITHREADED PROGRAMMING: Introduction –

Creating Threads – Extending the Thread Class – Stopping and Blocking a Thread – Life

39

Cycle of a Thread – Thread Exceptions – Thread Priority – Synchronization – Implementing

the Runnable Interface.

UNIT – V

APPLET PROGRAMMING: Introduction – Applet Life Cycle – Applet Tag –

Adding Applet to HTML File – Running the Applet – Passing Parameters to Applets.

GRAPHICS PROGRAMMING: Introduction – Graphics Class – Lines and Rectangles –

Circles and Ellipses– Drawing Arcs and Polygons – Line Graphs –Drawing Bar Charts.

REFERENCE BOOKS:

1. E. Balagurusamy, “Programming with Java”, A Primer 5th

edition, Colored Edition,

McGraw Hill Education (India) private limited, New Delhi, 2015.

2. Patrick Naughton, Herbert Schildt, “The Complete Referenceǁ Java2”, 3rd Edition,

Tata McGraw Hill Pub.Ltd. New Delhi.

3. Bruce Eckel, “Thinking of Java”, 3rd

Edition, Prentice Hall, 2000.

4. Thomas Wu, “An Introduction to Object Oriented Programming with Java”, Special

Indian Edition, TMH, New Delhi, 2006.

5. Patrick Naughton and Herbertz Schildt, “Java-2- The Complete Reference”, 5th

Edition, Tata McGraw Hill.

WEB RESOURCES:

1. https://www.nptelvideos.com/java

2. https://www.tutorialspoint.com/java

3. https://www.udemy.com/java-tutorials

4. https://en.wikibooks.org/wiki/java_programming

5. https://en.wikiversity.org/wiki/java_tutorials

40



SEMESTER-III

CORE COURSE-X : VISUAL PROGRAMMING


COURSE OBJECTIVES:

• To understand the needs for GUI based programming.

• To appreciate the features of Visual Basic in creating windows applications.

• To be recognize the ease of programming through visual programming.

• To learn GUI programming in Visual C++ using Microsoft foundation classes.

• To acquire the skills to create simple application using advanced controls.

OUTCOMES:


• Use the different controls available in Visual Basic for developing simple

applications.

• Apply event driven code development for correct, coherent programs.

• Develop conceptual Form and database designs that solve complex problems.

• Create database and establish database connectivity with any backend.

• Interface applications with internet programs.

UNIT I

Visual Basic: Introduction-The Code Window - The Anatomy of a procedure-Editor

Features-Visual Basic File system Controls-Random access Files-Binary files-Introduction to

the File System Object model-MDI Forms-Features of an MDI Form-Loading MDI Forms

and Child Forms-The Active Form property-The Debugging Methods-ActiveX Data Objects.

UNIT II

Windows Fundamentals: The Windows Environment-The Graphical User

Interface-The Multi tasking Environment-Dynamic Link Libraries(DLL)-The Lay Out

Window-OOPs and Windows-Window Messages-The Windows Message Format.

UNIT III

Visual C++: Visual C++Windows Development Tools-Windows Application

Component-The Win_Main() Function-WND Class-WM_PAINT Messages-Drawing an

Ellipse-Drawing a Chord-Drawing a pie Wedge-Drawing a rectangle.

UNIT IV

Microsoft Foundation Class: MFC design Considerations-Key Features of the

MFC Library-A Simplified MFC Applications- A Simple Applications and templates-The

MFCSWP.H Header File-The MFCSWP.CPP Source Code File-Running the MFCSWP

Application.

41

UNIT V

Advanced Concepts: Domain Name System – Email – World Wide Web (HTTP)

– Simple Status Bars – Splitter Windows and Multiple Views – Dynamic Link Library –

Database Management with ODBC – TCP/IP – Winsock and WinInet, – ActiveX Control –

Creation and Usage – Container Class.

REFERENCE BOOKS:

1. Chris H.Pappas & William H.Murray, “The Complete Reference Visual C++

6”,TATA McGREW-HILL EDITION,2009.

2. J. David Kruglirski, “Programming Microsoft Visual C++”, Fifth Edition, Microsoft

Press, 1998.

3. Mohammed Azam “Visual Basic 6.0”, VIKAS PUBLISHING,2000.

4. Steve Holzner, “Visual C++ 6 programming”, Wiley Dreamtech India Private Ltd.,

2003.

5. Kate Gregory, “Using Visual C++”, Prentice Hall of India Pvt. Ltd., 1999.

6. Herbert Schildt, “MFC from the Ground up”, TMGH, New Delhi, 2nd

Edition, 2008.

7. Deitel, “Visual Basic 6.0 How to Program”, Pearson Education, 2012.

WEB RESOURCES:

1. http://www.faadooengineers.com/threads/9498-Visual-programming-ppt-full-notes-

pdf-e-books

2. http://www.siue.edu/~dbock/cmis142/cmis142.htm

3. http://www.kciti.edu/wp-content/uploads/2017/0

42



SEMESTER-III

CORE COURSE-XI : OPERATING SYSTEMS AND COMPUTER NETWORKS


COURSE OBJECTIVES:

• To learn the fundamentals of Hardware/Software for networking.

• To understand the computer networks concepts that includes the various layers from

OSI model.

• To gain insight on to the functions of each of the layer of OSI model.

• To be aware of the evolution and fundamental principles of operating system,

processes and their communication

• To understand the various operating system components like process management,

memory management

• To know the components and management aspects of a computer network.

COURSE OUTCOMES:


• Demonstrate the OSI layers with its functions.

• Evaluate the different features of each of the layers.

• Modify existing open source in terms of functionality or features required.

• Compare and contrast the OSI layers into networking protocols such as TCP/IP or

UDP.

• Implement the algorithms in process management and memory management and file

management.

• Apply deadlock handling issues of IPC.

• Demonstrate the mapping between the physical memory and virtual memory

UNIT I

INTRODUCTION TO OPERATING SYSTEMS: Types of Operating Systems –

Operating Systems Structures – Systems Components – Process Concept – Process

Scheduling – Operation on Processes – Co-Operating Processes – Inter Process

Communications – CPU Scheduling – Scheduling Criteria – Scheduling Algorithms.

UNIT II

PROCESS SYNCHRONIZATION: Critical Section – Semaphores – Critical

Region- Monitors. DEADLOCKS: Characterization – Methods for handling deadlocks –

Deadlock prevention – Deadlock Avoidance – Deadlock Detection – Recovery from

Deadlock.

UNIT III

MEMORY MANAGEMENT: Address Binding – Swapping – Contiguous Memory

allocation – Paging: Basic Method. Segmentation: Basic Method – Hardware support.

Virtual Memory: Background - Demand paging: Basic concepts – Page Replacement: FIFO-

LRU. Thrashing.

43

UNIT IV

INTRODUCTION TO NETWORKS AND COMMUNICATION MEDIA: Uses –

Network Hardware – Network Software: Protocol hierarchies – Design Issues – Connection

oriented and connectionless services – Reference Models: OSI Reference Model – TCP/IP

Reference Model. Wireless Transmission – Satellite Communication.

UNIT V

DATA LINK LAYER: Data Link Layer: Design Issues – Error Detection and

Correction Methods. NETWORK LAYER: Network Layer Design Issues- List of Routing

Algorithms. TRANSPORT LAYER: Elements of transport protocols (An overview).

APPLICATION LAYER: Domain Name System – Email.

REFERENCE BOOKS:

1. Andrews S. Tanenbaum, “Computer Networks”, Prentice Hall of India Private

Limited, (4th Edition), 2003.

2. Behrouz. A. Forouzan, “Data Communication and Networking”, Fourth Edition, Tata

McGraw-hill, New Delhi, 2006.

3. William Stallings, “High Speed Networks and Internets”, Second Edition, Pearson

Education Asia, New Delhi, 2002.

4. Abraham Silberschatz Peter B Galvin, G.Gagne, “Operating Systems Concepts”,

Seventh Edition, Addision Wesley Publishing Co., 2010.

5. Andrew S.Tanenbaum, “Modern operating Systems”, Third Edition, PHI Learning

Pvt. Ltd., 2008.

6. William Stallings, “Operating Systems: Internals and Design Principles”, Seventh


WEB RESOURCES:

1. http://www.scribd.com/mobile/document/173069678/communication-and-

networking-syllabus

2. http://cseweb.used.edu/classes.wi13/cse222A-a/syllabus.html

3. http://targetstudy.com/course/me-digital-communication-networking.html

4. https://smude.edu.in/smude/programs/information-technology/bca/data-

communication.html

5. https://www.cs.wmich.edu/~bhardin/s14cs4540/ppt-dir/ch1.ppt

6. www.wiley.com/college/silberschatz6e/0471417432/slides/slides.html

44



SEMESTER-III

CORE PRACTICAL-V : JAVA PROGRAMMING


COURSE OBJECTIVES:

• To understand the concept of OOP features.

• To acquire skills required for developing simple applications in core Java.

• To know the various statements and classes and the associated methods for each of

the classes from built-in packages.

• To gain knowledge on threads and applets.

• To learn the steps in exception handling and streams.

COURSE OUTCOMES:


• Identify and access the suitable classes and methods from the built-in packages.

• Developing simple application program in java.

• Analyze and select the classes and I/O streams and classes.

• Choose and use appropriate methods for writing object-oriented code.

• Write any simple java program core java.

LIST OF EXERCISES

1. Write a Java program to add two binary numbers.

2. Write a Java program to convert a decimal number to binary number and vice versa.

3. Write a Java program to count the letters, spaces, numbers and other characters of an

input string.

4. Implement a Java function that calculates the sum of digits for a given char array

consisting of the digits '0' to '9'. The function should return the digit sum.

5. Write a java program to define a class SortData with two methods asec() and desc().

6. Write a java program to demonstrate the implementation of abstract class.

7. Write a java program to implement method overriding.

8. Write a java program to implement multiple inheritance.

9. Create a package, add necessary classes and import the package in java class.

10. Write a java program for multiplying two matrices and print the product for the same.

11. Write a java program to implement multithreading.

12. Write a java program to read the student data from user and store it in the file.

13. Write a java program to implement exception handling.

14. Create a simple applet to find the biggest and smallest of given numbers.

WEB RESOURCES:

1. https://www.javatpoint.com/

2. http://www.java-examples.com/

3. https://www.cs.utexas.edu/~scottm/cs307/codingSamples.htm

45



SEMESTER-III

CORE PRACTICAL-VI : VB & VC++ PROGRAMMING


COURSE OBJECTIVES:

• To understand the IDE and the components of VB and VC++.

• To acquire skills required for developing simple applications in VB and VC++.

• To know the various events and properties associated with each of the controls

supported by VB and VC++.

• To gain knowledge on establishing database access using ODBC.

• To learn the steps in navigating through various wizard in VB and VC++.

COURSE OUTCOMES:


• Identify and access components of VB and VC++ IDE.

• Developing simple application in VB as well as in VC++.

• Analyze and select the controls that can be used in applications.

• Choose and use appropriate events for writing event driven application code.

• Set and reset appropriate properties necessary for the application being developed.

• Establish database connectivity using ODBC.

• Use wizard in achieving quick application development.

• Apply ActiveX controls for developing sophisticated applications.

LIST OF EXERCISES

1. Develop a database application using data control in Visual Basic.

2. Create an SDI application in Visual Basic.

3. Create a Dialog-based application.

4. Develop an MDI application.

5. Implementation of advanced dynamic Slider & Image controls in an application.

6. Demonstrate reading and writing into documents using a program.

7. Create DLLs and use them in a sample application.

8. Implement Data access through ODBC use Cdatabase, Crecordset.

9. Create an application that will load the bit map dynamically with and without wizard.

10. Create an Active-x control and use it in an application.

WEB SOURCES:

1. http://www.tutorialspoint.com/listtutorials/visual-basic/1

2. http://www.freestudentprojects.com/category/visual-basic/

1. https://msdn.microsoft.com/en-us/library/aa733747(v=vs.60).aspx

46



SEMESTER-IV

CORE COURSE-XII : OPERATIONS RESEARCH


COURSE OBJECTIVES:

• To know the concept and an understanding of basic concepts in Operations Research

Techniques for Analysis and Modeling in Computer Applications.

• To understand, develop and solve mathematical model of linear programming

problems.

• To understand, develop and solve mathematical model of Transport and assignment

problems.

• To understand network modeling for planning and scheduling the project activities.

COURSE OUTCOMES:

• Understand and apply linear, integer programming to solve operational problem with

constraints.

• Apply transportation and assignment models to find optimal solution in warehousing

and Travelling,

• To prepare project scheduling using PERT and CPM.

• Identify and analyze appropriate queuing model to reduce the waiting time in queue.

• Apply optimization concepts in real world problems.

UNIT I

Operations Research – A Tool for Decision Support System – Linear Programming:

Graphical Method – Simplex Method – Big M Method – Two-phase Method.

UNIT II

Transportation Problem: Balanced Transportation Problem – Unbalanced

Transportation Problem- Assignment Problem.

UNIT III

Dynamic Programming: Introduction – The recursive equation approach –

Characteristics of Dynamic Programming – Computational Procedure – tabular method of

solution.

UNIT IV

Queuing Theory : Introduction – Terminologies of Queuing System – Empirical

Queuing Models : (M/M/1):(GD/∞/∞) Model - (M/M/C):(GD/∞/∞) Model -

(M/M/1):(GD/N/∞) Model -(M/M/c):(GD/N/∞) Model (for C<=N).

UNIT V

Project Scheduling by PERT/CPM: Network – Critical Path Method (CPM) –

PERT calculations – PERT Algorithm – Solved Problems.

47

REFERENCE BOOKS:

1. Kanti Swarup, P.K.Gupta, Man Mohan, “Operations Research”, Sultan Chand and

Sons Educational Publishers, New Delhi.

2. Taha H.A., “Operation Research”, Pearson Education.

3. Sharma J.K., “Mathematical Models in Operations Research”, TMH, 1989.

4. R. Panneerselvam, “Operations Research”, Prentice Hall of India Private Limited,

2002

WEB RESOURCES:

1. https://projecteuclid.org/download/pdf_1/euclid.bams/1183512098

2. http://www.me.utexas.edu/~jensen/ORMM/problems/

3. http://web.itu.edu.tr/topcuil/ya/OR.pdf

4. https://works.bepress.com/michael_johnson/14/

48



SEMESTER-IV

CORE COURSE-XIII : PROGRAMMING IN . NET


COURSE OBJECTIVES:

• To understand the basics of C# programming language.

• To learn Assemblies, AppDomains, COM, Code Access Security, Code Optimization,

Cryptography and data protection.

• To be aware of data driven applications using ADO.NET, data providers.

• To appreciate the feature of OOP approach in dot net.

• To know to use Windows Applications using Windows Forms, Control Library,

Advanced UI Programming, Data Binding concepts.

COURSE OUTCOMES:

On successful completion of the course the student will be able to:

• Develop programs using C# programming language.

• Create fully functional data driven applications using ADO.Net

• Create dynamic Web applications.

• Establish connectivity to interact with a database using server-side programming.

• Create Web Services.

• Develop Windows Forms Applications and data driven applications using various

controls.

UNIT I

Understanding .Net and .Net framework – Architecture – CLR – CTS - CLS –Base

Class Library – MSIL code – Assemblies – Manifest – Meta data – Managed execution.

Overview of C# - Literals, Variables and Data Types – Operators and Expressions - Decision

making and Branching – Decision making and Looping.

UNIT II

Methods in C# - Handling Array – Manipulating Strings. Structures and Enumerations

– Classes and Objects – Inheritance and Polymorphism – Interfaces - Delegates and Events –

Managing Errors and Exceptions.

UNIT III

. C# Application Development on .Net - Building Windows Applications – Creating a

simple window form – Creating a window forms application using Tree view control -

Accessing Data with ADO.NET – Working with Data Bound Controls.

UNIT IV

Web Application Development in ASP.Net –ASP.Net Menus– Creating a Web form –

ASP.Net Controls: Standard, Data, Validation, Navigation, Login, Webparts, HTML and

Crystal Reports – Database connectivity in Web Forms using ADO.Net – Web Services.

49

UNIT-V

Introducing to ASP.NET MVC: MVC Architecture - What is ASP.NET MVC? -

Understanding Model - Understanding View - Understanding Controller - Advantages of

MVC based Web Application - Features of ASP.NET MVC Framework. First MVC

Application: Software Requirements – Developing First MVC Application - Rendering

HTML output - Understanding Life Cycle of ASP.MVC Request – Exploring Controllers –

Exploring Razor Views.

REFERENCE BOOKS:

1. E. Balagurusamy, “Programming in C#”, Tata McGraw-Hill, 2004.

2. V.R. Kavitha, “C# and .Net Framework”, Sree Magnus Publications, 2011.

3. J. Liberty, “Programming C#”, 2nd ed., O’Reilly, 2002.

4. Steven Holzner, Microsoft “Visual C# .Net 2003”, Pearson Education Pvt Ltd, 2004.

5. Herbert Schildt, “The Complete Reference: C#”, Tata McGraw-Hill, 2004.

6. Robinsonetal, “Professional C#”, 2nd ed., Wrox Press, 2002.

7. Andrew Troelsen, “C# and the .NET Platform”, A! Press, 2003.

WEB RESOURCES:

1. https://www.cs.colorado.edu/~kena/classes/5448/f11/presentationmaterials/csharp_d

otnet_adnanreza.pdf

2. http://csharp.net-tutorials.com/download-csharp-tutorial-as-pdf/

3. http://www.introprogramming.info/wp-

content/uploads/2013/07/Books/CSharpEn/Fundamentals-of-Computer-

Programming-with-CSharp-Nakov-eBook-v2013.pdf

4. http://www.completecsharptutorial.com/basic/parameter-examples/

5. http://www.c-sharpcorner.com/uploadfile/mahesh/simple-ado-net-program-with-

visual-studio-net-ide/http://www.tutorialspoint.com/asp.net_mvc/

50



SEMESTER-V

CORE COURSE- XV : CLOUD COMPUTING AND BIGDATA


COURSE OBJECTIVES:

• To understand the current trends and basics of Cloud computing.

• To know the types of virtualization.

• To understand Big Data Analytics principles and techniques.

• To understand the financial value of Big Data Analytics.

• To explore the tools and practices for working with Big Data.

• To emphasize the use of Hadoop, MapReduce.

COURSE OUTCOMES:


• Connect to cloud services from any computing device.

• Implement virtualization.

• Identify the need of big data analytics for any domain.

• Use Hadoop, Map Reduce Framework.

• Explain the technologies for bigdata.

• Device big data analytics for a given real-time problem

UNIT I

Cloud Computing : Introduction – History – Characteristics – Cloud Computing

Models: Service Models – Deployment Models – Issues and Challenges of Cloud Computing

– Advantages and Disadvantages of Cloud Computing – Cloud Computing Architecture.

UNIT II

Virtualization – Types of Virtualization – Implementation of Virtualization –

Implementation support at the OS level – Middleware Support for Virtualization –

Advantages of Virtualization – Application Virtualization – Virtualization Implementation

Techniques – Hardware Virtualization – Virtualization for Data Centre.

UNITIII

Introduction to Big data: Classification of Digital data – Characteristics of Data–

Evolution, Definition and Challenges with Big Data – Why Big Data? – Traditional Business

Intelligence versus Big Data – A typical Data Warehouse Environment – A typical Hadoop

Environment – Coexistence of Big Data and Data Warehouse.

UNIT IV

Big Data Analytics : What is Big Data Analytics? –– What Big Data Analytics Isn’t?

– Why this sudden Hype Around Big Data Analytics – Classification of Analytics – Greatest

Challengesthat Prevent Business from Capitalizing Big Data – Top Challenges Facing Big

Data – Why BigData Analytics Important? – Data Science – Data Scientist – Terminologies

used in Big Data Environments – Basically Available Soft State Eventual Consistency

(BASE) – Open source Analytics Tools - NoSQL.

51

UNIT V

Technologies for Big Data: Distributed and Parallel Computing for Big data –

Computing Model of Hadoop – HDFS and MapReduce – How does Hadoop Function? –

Cloud Providers in Big data Market – In–Memory Computing Technology for Big Data –

Hadoop: Features – Advantages – Versions – Hadoop Ecosystem – Hadoop Distributed File

system – The MapReduce Framework – Techniques to Optimize MapReduce Jobs – Uses of

MapReduce – Role of HBase in Big DataProcessing – Storing Data in Hadoop – Processing

Data with Hadoop – Introducing HBase Architecture – Storing Big Data with HBase –

Interacting with the Hadoop Ecosystem – HBase in Operations – Programming with HBase.

REFERENCE BOOKS:

1. V.K. Pachghare, “Cloud Computing”, PHI, 2012.

2. Seema Acharya, Subhasini Chellappan, “Big Data and Analytics”, Wiley

Publication, 2017.

3. BIG DATA, Black Book TM, DreamTech Press, 2015.

4. Michael Miller, Cloud Computing: Web–Based Applications That Change the Way

You Work and Collaborate Online, Que Publishing, August 2008.

5. Frank J Ohlhorst, “Big Data Analytics: Turning Big Data into Big Money”, Wiley

and SAS Business Series, 2012.

6. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets,

Cambridge University Press, 2012.

WEB RESOURCES:

1. https://azure.microsoft.com/en-in/overview/what-is-cloud-computing/ .

2. https://www.ibm.com/cloud-computing/learn-more/what-is-cloud-computing/

3. https://www.salesforce.com/in/cloudcomputing/

52



SEMESTER-IV

CORE PRACTICAL -VII : . NET PROGRAMMING


COURSE OBJECTIVES:

• To know the features of C#. Net features.

• To acquire skills of programming in C#.net and ASP.Net.

• To understand the benefits of MVC design over traditional ASP.NET Web Forms.

• To acquiring sufficient knowledge on role of Model, View and Controller in

integrating them to develop complete web application.

• To understand how Routing API maps requests to action methods in controller.

COURSE OUTCOMES:


• Compare and interpret the advanced concepts in .net framework and MVC

framework..

• Develop console and windows applications with C# and CLR features.

• Apply the learnt programming knowledge and skills in MVC framework for dynamic

web application development.

• Produce web applications for real time project.

LIST OF EXERCISES

1. Develop a simple C# console application using Classes and Objects.

2. Write a C# console application using Inheritance.

3. Write a C# program to display the number of days of the year between two given years.

4. Write a C# program to sort a list of elements using Shell sort.

5. Write a program in C# to create a file and write an array of input strings to the file.

6. Creating Simple Windows Application for displaying a list of sports and games.

7. Design and develop a C# application to establish Database connectivity using

ADO.Net.

8. Build a Web application using ASP.Net/Web Services.

9. Write a simple ASP.NET MVC application using Controllers.

10. Write a simple ASP.NET MVC application using Filters.

WEB RESOURCES:

1. http://www.c-sharpcorner.com/uploadfile/mahesh/simple-ado-net-program-with-visual-

studio-net-ide/

2. https://en.wikibooks.org/wiki/C_Sharp_Programming/The_.NET_Framework/Console_P

rogramming

3. http://www.tutorialspoint.com/asp.net_mvc/

4. http://www.w3resource.com/csharp-exercises/searching-and-sorting-algorithm/index.php

5. http://www.csharp-examples.net/

53



SEMESTER-V

CORE PRACTICAL -X : SOFTWARE DEVELOPMENT

COURSE CODE : 17PCAMP

COURSE OBJECTIVES:

• To gain live experience with developmental aspects.

• To create awareness about the use of previously learnt courses for implementation.

• To recall the analysis, design and development steps.

• To acquire proficiency in debugging and testing a software.

• To understand the concepts of identifying the problem to implement the software

to solve such problems.

• To establish a base for major project work.

COURSE OUTCOMES:


• Work in develop a project.

• Design and Develop applications using some software technologies.

• Analyze and select the suitable software technology to implement.

• Interpret the pros and cons of different languages, packages and database

software.

• Restructure the existing applications using different better technology.

• Design and develop real-time projects

RULES AND SPECIFICATION

1. Team project with a maximum of two per team.

2. Students shall select a domain and identify the problem, preferably in-house problem.

However, the project must be a real-time project only.

3. The student is expected to follow the standard stepwise procedures for the design and

development of the project.

4. Documentation is to be prepared based on the specified format as like Major project.

5. Evaluation is like a practical course. Weightage of marks is distributed over

attendance, observation and tests.

6. Report, Presentation with Demo is mandatory at the time of examination.

7. Feedback from the stakeholders of the project is to be obtained and added to the

report in a standard format.

WEB RESOURCES:

1. https://www.annauniv.edu/academic_courses/docs/ugthesis.pdf

2. http://www.cs.northwestern.edu/~agupta/_projects/embedded_systems/FinalReport.pdf

3. http://cecminiproject2015.blogspot.in/2015/03/sample-project-report-format-not-

final.html

54



SEMESTER-IV

CORE COURSE-XIV : ADVANCED JAVA PROGRAMMING


COURSE OBJECTIVES:

• To understand the advanced concepts of java.

• To enhance the knowledge in applying the advanced features like Swing, JDBC,

Servlets, RMI, Ajax, JSP, JQuery, MVC, Struts and Spring of J2EE.

• To know the concepts of web applications and MVC architecture.

• To learn the concept of distributed computing.

COURSE OUTCOMES :

On successful completion of this course, the students will be able to:

• Identity and use relevant networking packages, classes and objects for programming.

• Perform GUI based application development using Swing.

• Develop distributed applications using RMI,

• Develop dynamic Web applications using AJAX, JSP and Servlets.

• Design and develop applications using JDBC, Struts and Spring.

UNIT I

Collection Framework: Collection classes and Interfaces-Legacy classes-Date-

Calendar, Time zone-Internationalization-Localization. Event Handling: Exploring Swing-

JFrame-Component-Text fields-Buttons-Combo boxes-Application design using Swing

Component.

UNIT II

Database Programming in Java: Overview of the JDBC process-JDBC concepts-

JDBC drivers-Database connection statement Objects-The Connection Interface-Result Set

Interacting with the database-Transaction processing.

UNIT III

Java Networking: Basics of TCP/UDP Sockets - Remote Method Invocation (RMI)-

Distributed application Architecture-Client Proxy-Server Proxy-RMI Process-Defining and

using Remote Objects.

UNIT IV

Java Servlets: Initialization-Deployment-Reading Client data-Reading HTTP Request

headers-Cookies-Session Tracking-Database connections-Java server pages(JSP)-JSP tags-

Components of JSP page-Expressions- Scriptlets - Directives-Declarations-Working with

JSP-JSP and ODBC-JQuery-AJAX.

55

UNIT V

Application Development: Overview of MVC architecture-Struts: working principles

of Struts-Building Model components-View components-Controller components-Developing

web applications-Spring: Framework-Controllers-Developing simple applications.

REFERENCE BOOKS:

1. Herbert Schildt, ”The Complete Reference Java”, Tata McGraw Hill Publishing

Company Ltd, 2012.

2. Craig Walls, “The Spring in Action”, 4th

Edition, Manning Publications, 2015.

3. Marty Hall,Larry Brown,Yaakow Chaikin, “Core Servlets and Java Server Pages:

Volume 2-Advanced Technologies”, 2nd

Edition, Pearson Education, 2008.

4. Jim Keogh, “The Complete reference to J2EE”, Tata McGraw-Hill edition, reprint

2012.

5. Kognet learning solutions Inc. “Java Server Programming Java EE6 BLACK BOOK”,

Dreamtech press, Reprinted 2013.

6. Jim Keogh, “The Complete reference to J2EE”, Tata McGraw-Hill edition, reprint

2012.

7. C Muthu, “Programming with Java”, Second Edition, Vijay Nicole Imprints Private

Limited, Collaboration with Tata McGraw Hill, 2011.

WEB RESOURCES:

1. https://www.udemy.com/advanced-java-programming/

2. http://www.w3schools.in/java-tutorial/

3. http://freecomputerbooks.com/javaAdvancedBooks.html

4. https://www.lynda.com/Java-tutorials/Java-Advanced-Training/107061-2.html

5. https://www.udemy.com/advanced-java-programming/

6. http://www.w3schools.in/java-tutorial/

7. http://freecomputerbooks.com/javaAdvancedBooks.html

8. https://www.lynda.com/Java-tutorials/Java-Advanced-Training/107061-2.html

56



SEMESTER-V

CORE COURSE-XVI : OPEN SOURCE TECHNOLOGIES


COURSE OBJECTIVES:

• To create awareness about Free and Open Source Software technologies

• To acquire proficiency in open source technologies such as PHP and MySQL.

• To realize the power of open source technologies.

COURSE OUTCOMES:


• Justify the use of Free and Open Source Software technologies

• Explore open source WAMP tool for PHP and MySQL in Windows platform.

• Apply the learnt knowledge in open source technologies such as PHP and MySQL

• Develop web applications and/or real-time projects using PHP and MySQL

UNIT I

History of FOSS: The FOSS Revolution - History of Free/Open Source and BSD

Software - FOSS Licences – Types of Freedom - Living with Free Software - Discussion

FOSS Projects – WAMP/LAMP/MAMP: Open source for PHP and MySQL.

UNIT II

Why PHP and MySQL? – Server-side scripting Overview – Getting Started with PHP

- Learning PHP Syntax and variables – Learning PHP control structures and functions –

Passing Information with PHP.

UNIT III

Learning PHP String Handling – Learning Arrays – Learning PHP Number Handling

– Introducing Object Oriented PHP – Working with the File System – Working with Cookies

and Sessions – Handling Exceptions with PHP.

UNIT IV

Introducing Databases and MySQL – Learning Structured Query Language –

Integrating PHP and MySQL – Performing Database Queries – Integrating Web Forms and

Databases.

UNIT V

Sending E-mail with PHP – Integrating PHP and Java – Integrating PHP and

JavaScript – Integrating PHP and XML – Creating and consuming Web Services with PHP –

Creating Graphics with PHP.

REFERENCE BOOKS:

1. T.V.Gopal, “Open Source Software”, Scitech Publications, 2nd

Edition, 2003.

2. Steve Suehring, Tim Converse, and Joyce Park, “PHP6 and MySQL”, Wiley

Publishing Inc., Indiana, 2009, Reprint, 2015.

3. Jesús M. González-Barahona et al, “Introduction to Free Software”, Free Technology

Academy, Europe, 2009.

57

4. Steven Holzner, “PHP: The Complete Reference”, 2nd Edition, Tata McGraw-Hill

Publishing Company Limited, Indian Reprint 2009.

5. Rasmus Lerdorf, Kevin Tatroe and Peter MacIntyre, “Programming PHP”, O’Reilly,

2nd Edition/3rd Indian Reprint, 2009.

6. Vikram Vaswani, “MYSQL: The Complete Reference”, 2nd Edition, Tata McGraw-

Hill Publishing Company Limited, Indian Reprint 2009.

7. Ivan Bayross, Sharanam Shah, “MySQL 5 for Professionals”, Shroff Publishers, 2nd

Edition, 2007.

WEB RESOURCES:

1. http://www.tutorialspoint.com/articles/category/open-source

2. http://www2.cs.siu.edu/~carver/talks/foss.pdf

3. http://www.olcos.org/cms/upload/docs/Use-open-source-tools_en.pdf

4. https://www.mysql.com/

5. https://www.w3schools.com/php/php_mysql_intro.asp

58

COURSE OBJECTIVES:

• To understand the importance of Data Science.

• To learn the basics of R Programming user interface.

• To have an exposure about R notation in data analysis.

• To learn the technical strengths of Python.

• To gain knowledge about R and Python in application development.

COURSE OUTCOMES:


• Relate the knowledge to various types of real world applications.

• Demonstrate the use of R and Python in data analysis

• Develop simple Application Using R and Python.

• Use data analysis simulator tools.

UNIT I

Data Science:-What is Data Science? - Emergence and Evolution of Data Science - Where is

Data Science Used? - Myths about Data Science - What are data and data sets? - Perspectives

on data - DIKW and data science Pyramid - The CRISP _ DM Life cycle

UNIT II

R: The R User Interface - Objects - Functions - Sample with Replacement - Writing Your

Own Functions - The Function Constructor - Arguments – Scripts. Packages: install.packages

- library - R Objects - Atomic Vectors - Doubles - Integers - Characters - Logicals - Complex

and Raw - Attributes - Names - Dim - Matrices - Arrays - Class - Dates and Times - Factors -

Coercion - Lists - Data Frames - Loading Data - Saving Data.

UNIT III

R Notation - Selecting Values - Positive Integers - Negative Integers - Zero - Blank Spaces -

Logical Values - Names -Modifying Values: Changing Values in Place - Logical Subsetting -

Logical Tests - Boolean Operators - Missing Information: na.rm - is.na. Programs - Strategy -

Sequential Steps - Parallel Cases - if Statements - else Statements - Lookup Tables - Code

Comments. Loops - Expected Values - Table of Contents - expand.grid - For Loops - While

Loops - Repeat Loops.

UNIT IV

PYTHON: Introduction: Why do people use python?- Python a scripting language- Users of

Python- Need of Python- Python’s Technical Strengths. How Python runs programs:

Introducing the Python Interpreter- Program Execution-Execution Model Variation: Python



SEMESTER-V

CORE COURSE -XVII : DATA SCIENCE USING R AND PYTHON


59

Implementation Alternatives - Types & Operations: Numbers Types: Numeric type basics,

Numbers in action, Other numeric types -Strings Fundamentals: String Basics, String

Literals, Strings in action, String Methods.

UNIT V

List and Dictionaries - Tuples - Files - Python Statements - Assignment - Expressions & Print

- if tests - While & For loops. Functions: Basics - coding functions - Definition & Calls -

Scopes: Python basics- Global Statement - Scopes & Nested functions - Arguments

REFERENCES:

1. John D.Kelleher and Brendan Tierney, "Data Science", The MIT Press, 2018.

2. Garrett Grolemund Foreword by Hadley Wickham, “Hands-On Programming with R

Write Your Own Functions And Simulations”, O’Reilly Media, First Edition 2014.

3. Lutz, "Learning Python", O' Reilly Media, Fourth Edition, 2009.

4. Summerfield, “Programming in Python 3”, Pearson Education, 2007.

5. Wesley J Chun, Core – Python Programming, Pearson education, 2001.

WEB RESOURCES:

1. https://mitpress.mit.edu/datascience

2. https://7chan.org>src>OReilly_Learning

3. https://rstudio-education.github.io>hopr

60



SEMESTER-IV

CORE PRACTICAL -VIII : ADVANCED JAVA PROGRAMMING


COURSE OBJECTIVES:

• To understand the importance of advanced frameworks such as JSP, Servlets, Swing,

JQuery, JDBC, Struts, Spring.

• To improve the programming skill as per the industry need in Java domain.

• To acquire the real time project development skills in Java platform.

COURSE OUTCOMES:


• Realize the potential of advanced concepts in J2EE.

• Develop applications with advanced features of Java.

• Apply the learnt programming knowledge and skills as per the industry need.

• Produce applications on real time projects.

LIST OF EXERCISES

1. Write a program for Java Collection Framework that demonstrates any two of the

following collections: Set, List, Map, Tree, Stack, Vector, HashTable or Dictionary.

2. Demonstrate a program for any one InputStream-OutputStream and Reader-Writer

classes.

3. Develop a network program for sending and receiving data from the client to server using

UDP.

4. Develop a network program for sending and receiving data from the client to server using

TCP.

5. Design an event handler for keyboard events using Listeners.

6. Design a form using Swing controls using Event Handling by Adapters.

7. Develop a program to implement the concept of Servlet and JDBC (Insert, Delete,

Update, Retrieve).

8. Server side and Client side RMI Implementation for invoking a remote method for simple

calculator.

9. Develop a simple e-mail registration application using JSP, Ajax and JQUERY.

10. Create a simple application using: i) Struts ii) Spring.

WEB RESOURCES:

1. www.javalearner.com/advanced.htm

2. http://www.java-made-easy.com/java-programming-tutorials.html

3. http://javaprogramming.language-tutorial.com/

4. http://www.includehelp.com/java-language-solved-programs.aspx

61



SEMESTER-V

COREPRACTICAL -IX : OPEN SOURCE TECHNOLOGIES PROGRAMMING


COURSE OBJECTIVES:

• To create awareness about Free and Open Source Software technologies

• To acquire proficiency in Web Programming using a Open Source Front End (PHP)

and a Open Source Back End (MySQL) technology.

• To realize the power of open source technologies.

COURSE OUTCOMES:


• Develop web applications using PHP and MySQL in Windows platform.

• Restructure the existing applications using PHP and MySQL.

• Design and develop real-time projects using PHP and MySQL quickly.

LIST OF EXERCISES

(Use PHP as front end and MySQL as back end for all the exercises (1-10) given below)

1. Creating a secured authentication system for login Process.

2. Print Student’s Mark sheet in the proper format.

3. Implement Income tax calculation for employees based upon their salary per annum.

4. Write a program for displaying applicants rank list for admission processing.

5. Classify positive, negative and neutral opinions of customer’s feedback for a Product

purchased online and provide product’s star rating based upon the opinion poll.

6. Create a web portal for searching Jobs matched to the Job Seekers suitable for their

qualification and experience.

7. Implement a form for maintaining Stock Inventory details containing opening stock,

closing stock, items sold and items purchased.

8. Maintain Supply Chain Management using Quotation, Purchase order and Invoice.

9. Generate monthly Mobile Bill for post paid customers.

10. Categorize Customers based upon their Customer Relationship Management (CRM)

records.

WEB RESOURCES:

1. http://www.olcos.org/cms/upload/docs/Use-open-source-tools_en.pdf

2. https://www.mysql.com/

3. https://www.w3schools.com/php/php_mysql_intro.asp

62

COURSE OBJECTIVES:

• To understand the concept of management and its nature.

• To know the functions of management such as planning, decision making, organizing,

directing, staffing and controlling.

• To gain an insight into the concepts of functions of management.

• To be aware of various communication symbols, styles and barriers.

COURSE OUTCOMES:


• Describe the concepts of management and its functions.

• Perform planning for various organizational functions.

• Carry out decision making with critical objectives.

• Apply problem solving approaches.

• Formulate organizational structure

• Prepare performance appraisals.

• Practice leadership and motivational theories as and when needed.

• Apply controlling techniques appropriately.

UNIT-I

MANAGEMENT: Meaning – Definition– Nature of Management – Functions of

Management – Levels of Management – Scope of Management. Fundamentals of Planning:

Concept of Planning – Types of Planning – Process of Planning.

UNIT-II

DECISION MAKING: Concept of Decision and Decision Making – Types of

Decision – Decision Making Process – Effective Decision – Individual Vs Group of Decision

Making – Problem Solving – Approaches for Problem Solving – Quantitative and Non-

Quantitative bases for Decision Making – Quantitative Techniques for Decision Making.

UNIT-III

ORGANIZING: Concept of Organization and Organizing – Concept of

organizational Theory – Factors affecting Organization Structure – Concept of Organization

Structure. Staffing: Concept of Staffing – Manpower Planning – Recruitment and Selection –

Training and Development – Performance appraisal.

UNIT-IV

DIRECTING: Concept of Direction – Direction and Supervision – Directing and

Human Factor. Motivation Theories – Leadership: Leadership Theories – Leadership Styles –

Leadership Development.

UNIT – V

COMMUNICATION: Concept – Symbols – Network – Barriers in Communication

– Making Communication Effective. Controlling: Concept – Controlling and Management by

Exception – Design of Effective Control System –Financial Control – Operating Control –

Inventory Control.



SEMESTER-I

ELECTIVE COURSE-I : PRINCIPLES OF MANAGEMENT

COURSE CODE : 17PCAM1

63

REFERENCE BOOKS:

1. L.M.Prasad , “Principles and Practice of Management”, Sultan Chand & Sons , New

Delhi, 2009.

2. Joesph L.Massie, “Essentials of Management”, PHI, 2004.

3. Kumkum Mukherjee, “Principles of Management”, PHI, 2nd

Edition, 2010.

4. Dr.J.Jayasankar, “Principles of Management”, Margham Publications.

5. Harold Koontz, “Principles of Management”, Tata McGraw Hill Education Pvt. Ltd.,

New Delhi.

WEB RESOURCES:

1. http://www.cliffsnotes.com/study-guides principles of management

2. http://en.wikiversity.org/wiki.principles of management

64

COURSE OBJECTIVES:

• To understand the concept of Organization and Organizational Behaviour.

• To learn about the nature of Human Behaviour.

• To understand the Concept of Motivation and Decision Making.

• To know about Group Dynamics.

• To understand the concept of Organizational structure.

COURSE OUTCOMES:


• Identify the concepts of Organizational Behaviour.

• Apply motivational theories in organizational environment.

• Practice personality theories in Organizational Context.

• Work in teams, resolve team conflicts and solve interpersonal issues while working in

corporate.

• Apply the knowledge to create organizational culture.

UNIT– I

Nature of Organisational Behaviour: Concept of Organisation – What Managers

Do? – Concept of Organisational Behaviour – Challenges in Organisational Behaviour.

Foundation of Organisational Behaviour: Scientific Management – Fayol’s Administrative

Management – Bureaucracy – Human Behaviour Approach.

UNIT– II

Nature of Human Behaviour : Concept of Behaviour – Individual Differences –

Models of Man . Personality : Concept of Personality – Personality Management.

Perception : Concept of Perception. Learning : Concept of Learning – Learning Theories –

Reinforcement. Attitudes and Values: Attitudes – Effects of Employee Attitudes –Attitude

change – Values.

UNIT– III

Motivation :Concept of Motivation – Theories of Motivation – Maslow’s Need

Hierarchy – Herzberg’s Motivation–Hygiene Theory – Motivational Applications:

Designing of Reward System – Empowerment – Individual Decision Making and Problem

Solving : Concept of Decision and Decision Making – Approaches for Problems Solving –

Creativity and Innovation. Interpersonal Behaviour: Nature of Interpersonal Behaviour –

Levels of Self Awareness.

UNIT– IV

Group Dynamics : Concept of Group Dynamics – Formal Groups – Informal Group

or Organisation – Group Behaviour. Work Teams : Concept of Team – Team Creation.

Leadership: Concept of Leadership – Leadership Theories – Leadership Styles.



SEMESTER-I

ELECTIVE COURSE-I : ORGANIZATIONAL BEHAVIOR


65

Communication : Concept of Communication – Communication Symbols – Communication

Network – Barriers in Communication.

UNIT– V

Design of Organisation Structure: Concept of Organisation Structure – Contingent

factors in Organisational Design – Departmentation – Centralisation and Decentralisation.

Forms of Organisation Structure :Line Organisation Structure – Line and Staff

Organisation Structure – Functional Organisation Structure – Matrix Organisation Structure.

Organisational Culture : Concept of Organisational Culture – Creating Organisational

Culture

REFERENCE BOOKS:

1. L.M.Prasad “ Organizational Behaviour”, 4th

Edition, Sultan Chand &

Sons,2006.Fred Luthans, “ Organizational Behaviour”,9th

Edition, McGraw Hill ,

2002.

2. K. Aswathappa, “Human resource management, text and cases, 5th

Edition, Mcgraw

Hill, 2009.

3. Shashi K.Gupta and Rosy Joshi, Organizational Behaviour, 4th

Edition, Kalyani

Publications, 2006.

WEB RESOURCES:

1. http://buc.edu.in/sde_book/msc_organ.pdf

2. http://nptel.ac.in/downloads/110105034/

3. https://lecturenotes.in/subject/55/organizational-behaviour

66

COURSE OBJECTIVES:

• To understand the Concept, Importance and Scope of Management.

• To know the Qualities and Roles of HR Manager.

• To be aware of Strategic HRM and HR Policies.

• To learn the process of HR Planning.

• To understand the Recruitment and Selection Process.

• To gain knowledge on Performance Appraisal and Job Evaluation.

COURSE OUTCOMES:


• Realize the Need and Scope of HRM.

• Acquire the HR Skills.

• Apply Strategic HRM.

• Formulate HR Policies.

• Carryout Recruitment and Selection process.

• Identify Training Needs and Arrange Training.

• Prepare Performance Appraisals.

• Evaluate Jobs.

UNIT-I

Nature and Scope of Human Resource Management (HRM): Concept –

Characteristics – Objectives – Importance – Functions - Scope. Organizing the HR Function:

Organization of the HR Department – Qualities, Roles and Status of HR Manager.

UNIT-II

Strategic HRM: Concept of Strategic HRM – Role of Strategic HRM –

Implementations of Strategic HRM – Environment of HRM. Human Resource Policies:

Concept and Nature of HR Policies – Types of HR Policies – Scope or Coverage of HR

Policies – Formulation of HR Policies – Essentials of sound HR Policies.

UNIT-III

Human Resource Planning: Concept – Objectives – Need and Importance – Process –

Levels of HR Planning. Recruitment and Selection: Meaning and Process of Recruitment –

Recruitment Policy – Recruitment Organization – Sources of Recruitment – Techniques of

Recruitment – Steps in Selection process – Selection Testing – Selection Interviewing –

Competency Mapping.

UNIT-VI

Employee Training: Concept – Need– Importance – Types of Training – Identifying

Training Needs – Objectives of Training – Methods and Techniques of Training. Career

Planning and Development: Career Planning and Manpower Planning – Career Planning

Terminology – Career Counselling.



SEMESTER-I

ELECTIVE COURSE-I : HUMAN RESOURCE MANAGEMENT


67

UNIT-V

Performance Appraisal: Concept – Objectives, Uses or Importance – Process –

Problems – Essentials of an Effective Performance Appraisal System – Methods or

Techniques of Performance Appraisal - Performance Appraisal through MBO. The 360

Degree Appraisal Technique – Performance Appraisal of Mangers – Performance Appraisal

Interview – Appraisal of Potential – Performance Management. Job Evaluation: Concept,

Objectives, Process, Advantages and Limitations of Job Evaluation.

REFERENCE BOOKS:

1) C.B.Gupta, “Human Resource Management”, Sultan Chand & Sons Educational

Publishers, New Delhi, 2009.

2) K.Aswathappa, “Human Resource Management Text and Cases”, Tata McGraw Hill

Education Pvt. Ltd., Sixth Edition.

3) Dessler, “Human Resource Management”, Pearson Education Ltd., 2007.

4) Bernadin, “Human Resource Management” , Tata McGraw Hill, 8th

Edition, 2012.

5) Decenzo & Robbins, “Human Resource Management”, Wiley, 8th

Edition, 2007.

WEB RESOURCES:

1) http://www.rejinpaul.com/2015/01/ba7204- human resource management notes –

question papers

2) http://www.feadooengineers.com/threads/3980- human resource management -(HRM)

– ebook – PDF - download

68

COURSE OBJECTIVES:

• To know the roles and responsibilities of System Analyst.

• To understand Information requirements analysis.

• To prescribe the planning and investigation fundamentals.

• To aware of analysis, design and implementation steps.

• To recognize and appreciate the need for documentation for future continuance of the

system with maintenance and reviews.

COURSE OUTCOMES:


• Solve a wide range of problems related to the analysis, design and construction of

information systems

• perform Analysis and Design of systems of small sizes

• Carryout Plan and undertake a major individual project

• Prepare and deliver coherent and structured verbal and written document.

• Analyze small applications from definition of the problem to documentation,

maintenance and review.

UNIT-I

THE SYSTEM IN THE ORGANIZATION: Systems Concepts – System and the

System Analyst – The Business as a System – Information Systems. THE SYSTEM

ANALYST: Systems Life cycle – The Data processing Department - The Role of Systems

Analyst. Types of System: TPS, MIS, DSS, Need for System Analysis and Design

Development Strategies: SDLC, Structured Analysis Development Method, System Prototype

Method. COMMUNICATION SKILLS: Problems of Communication – Written Reports –

Oral Communication – Standard Documentation.

UNIT-II

SYSTEM PLANNING: Approaches to System Development – User Involvement –

Feasibility Assessment. SYSTEM INVESTIGATION: Objectives of Investigation –

Methods of Investigation – Recording the Investigation.

UNIT-III

LOGICAL SYSTEM DESIGN: Analyzing User Requirements: Design Objectives -

Outline of Design Outputs and Inputs – Data Dictionary – Structured Decisions: Decision

Tree, Decision Tables, Structured English – Processing Requirements – User System

Specification. SOFTWARE DESIGN AND DOCUMENTATION: Structured Flowcharts,

HIPO, Warnier/Orr Diagrams.

UNIT-IV

PHYSICAL DESIGN OF COMPUTER SUBSYSTEM: File Design – Database

Design – Output and Input Design – Computer Procedure Design – System Security.



SEMESTER-II

ELECTIVE COURSE-II : STRUCTURED SYSTEM ANALYSIS AND DESIGN


69

PHYSICAL DESIGN OF MANUAL SUBSYSTEM: Form Design – Dialogue Design –

Code Design – Designing User Procedures.

UNIT-V

SYSTEM IMPLEMENTATION: Preparation for Implementation – Changeover-

Maintenance and Review. PROJECT DOCUMENTATION AND MANAGEMENT:

Project Reports – Project Management.

REFERENCE BOOKS:

1. Lee and Lee, “Introducing the System Analysis and Design”, National Informatics

Centre.

2. Jame A.Senn, “Analysis and Design of Information System”, 2nd

Edition, 2010,

TMGH, Delhi.

3. Elias W. Awad, “System Analysis and Design”, PHI.

4. V.Rajaraman, “Analysis and Design of Information Systems”, PHI, Delhi.

5. Modern Systems Analysis and Design by Jeffrey A. Hoffer, Joey F. George, Joseph S.

Valacich, Prabin K. Panigrahi, Pearson Education Publication, 4th Edition.

WEB RESOURCES:

1. http://www.systemanalysisanddesigns.com/

2. https://www.safaribooksonline.com/library/view/systems-analysisand/

9781118037423/05_chapter001.html#ch001-sec002

3. http://nptel.ac.in/syllabus/106108102/

4. https://www.abebooks.com/Analysis-Design-Information-Systems-Second-Edition/

5041291400/bd

70



SEMESTER-II

ELECTIVE COURSE-II : OBJECT ORIENTED ANALYSIS AND DESIGN


COURSE OBJECTIVES:

• To gain the background knowledge as well as core expertise in object oriented

system.

• To know the importance of the software design process.

• To learn to analyze and design systems by OOP approach.

• To understand the unified process and Unified Modeling Language.

COURSE OUTCOMES:


• Narrate the three pillars of object-orientation methodologies and explain the benefits

of each.

• Create use case documents that capture requirements for a software system.

• Create class diagrams that model both the domain model and design model of a

software system.

• Design the interface between the classes and objects.

• Create interaction diagrams that model the dynamic aspects of a software system.

• Understand the facets of the Unified Process approach to designing and building a

software system.

UNIT I

Complexity of Software – Object Model – Evolution and Elements of the Object

model – Applications – Nature of Object – Objects Relationship.

UNIT II

Classes – Nature of Class – Relationships – Building Quality Classes and Objects –

Identifying Classes and Objects – Key Abstractions and Mechanisms.

UNIT III

Unified Modeling Language – Meta model – UML Process and Design – Overview of

the Process – Inception – Elaboration – Construction – Iterative development – Use Case –

Use Case Diagrams.

UNIT IV

Class Diagrams – Essentials – Interaction Diagram – Advanced Concepts of Class

Diagrams – Class Scope Operations and Attributes – Multiple and Dynamic Classification –

Aggregation and Composition – Derived Associations and Attributes – Interfaces and

Abstract Classes.

71

UNIT V

Package Diagram – Collaboration Diagram – State Diagram – Concurrent State

Diagram – Activity Diagram – Decomposing Activity – Physical Diagram – UML

Programming.

REFERENCE BOOKS:

1. Grady Booch, “Object Oriented Analysis and Design”, Pearson Education 2007.

2. Martin Fowler, Kendall Scott, “UML Distilled, A brief Guide to the Standard Object

modeling Languages”, 2nd


3. Erich Gamma, Richard Helm, Ralph Johnson Vlissides, “Design Patterns: Elements

of Reusable Object Oriented Software”, Pearson Education, 2008.

4. James Rumbaugh et al. “Object Oriented Modeling and Design”, Pearson Education

2005.

5. Eriksson,”UML Tool Kit”, Pearson Education 2003.

WEB RESOURCES:

1. https://ssmengg.edu.in/weos/weos/upload/EStudyMaterial/Cse/8th%20sem/OOAD/

OOAD_NOTES.pdf

2. http://www.sasurieengg.com/e-course-material/It-MCA/III-

IT/2.CS2353Object%20Oriented%20Analysis%20and%20Design.pdf .

3. https://www.unf.edu/~broggio/cen6016/5-CEN6016-Chapter1.ppt

72



SEMESTER-II

ELECTIVE COURSE-II : SOFTWARE ENGINEERING


COURSE OBJECTIVES:

• To provide an insight into the processes of software development.

• To understand and practice the various fields such as analysis, design, development,

testing of Software Engineering.

• To develop skills to construct software of high quality with high reliability

• To apply metrics and testing techniques to evaluate the software

COURSE OUTCOMES:


• Get an insight into the processes of software development

• Explain the problem domain for developing SRS and various models of software

engineering.

• Model software projects into high level design using DFD, UML diagrams.

• Measure the product and process performance using various metrics.

• Evaluate the system with various testing techniques and strategies

UNIT – I :

INTRODUCTION: Software Engineering Paradigms – Waterfall Life Cycle Model –

Spiral Model – Prototype Model – Fourth Generation Techniques – Planning – Software

Project Scheduling, – Risk Analysis and Management – Requirements and Specification –

Case Study for Project Plan and SRS

UNIT II

SOFTWARE DESIGN: Abstraction – Modularity – Software Architecture –

Cohesion – Coupling – Various Design Concepts and Notations – Real time and Distributed

System Design – Documentation – Dataflow Oriented Design – Jackson System development

– Designing for Reuse – Programming Standards – Case Study for Design of any Application

Project.

UNIT III

SOFTWARE TESTING AND MAINTENANCE: Software Testing Fundamentals –

Software testing strategies – Black Box Testing – White Box Testing – System Testing –

Object Orientation Testing – State based Testing - Testing Tools – Test Case Management –

Software Maintenance Organization – Maintenance Report – Types of Maintenance – Case

Study for Testing Techniques

UNIT IV

SOFTWARE METRICS: Scope – Classification of Metrics – Measuring Process

and Product Attributes – Direct and Indirect Measures – Cost Estimation - Reliability –

Software Quality Assurance – Standards – Case Study for COCOMO model.

73

UNIT V

SCM & WEB ENGINEERING: Need for SCM – Version Control – SCM Process –

Software Configuration Items – Taxonomy – CASE Repository – Features – Web

Engineering.

REFERENCE BOOKS:

1. Roger S. Pressman, “Software Engineering: A Practitioner Approach”, Seventh

edition, McGrawHill, 2010.

2. Richard Fairley, “ Software Engineering Concepts”, Tata McGraw Hill Edition, 2008.

3. Ali Behforroz, Frederick J.Hudson, “Software Engineering Fundamentals”, Oxford

Indian Reprint, 2012.

4. Sommerville, “Software Engineering”, Sixth Edition, Addison Wesley-Longman,

2004.

5. Kassem A. Saleh, “Software Engineering”, First Edition, J.Ross Publishing, 2009.

6. Pankaj Jalote, “An Integrated approach to Software Engineering”, Third Edition,

Springer Verlag, 2005.

7. Roger S. Pressman, David Lowe, “Web Engineering: A Practitioner’s Approach”,

Special Indian edition, McGraw Hill, 2008.

8. Jibitesh Mishra, Ashok Mohanty, “Software Engineering”, Pearson Education, First

Edition, 2012.

WEB RESOURCES:

1. http://nptel.ac.in/downloads/106105087/

2. http://www.tutorialspoint.com/software_engineering/

3. https://www.karunya.edu/it/files/QP_Pdfs/Software%20Engineering.pdf

4. http://www.shwetankeducation.com/images/Software%20engineering%20Questions

%20and%20Answers.pdf

74



SEMESTER-III

ELECTIVE COURSE-III : COMPUTER GRAPHICS AND MULTIMEDIA


COURSE OBJECTIVES:

• To understand Computer Graphics and its Applications.

• To understand the 2D Transformations, 2D Viewing.

• To learn and appreciate the application of Illumination and color models.

• To understand the 3D Concept, Transformations and Viewing.

• To study the Multimedia Concepts with required Hardware, Software, Audio and

Video.

COURSE OUTCOMES:


• Implement basic Graphics, Lines and File Algorithms.

• Experiment the concept of hidden line and surface elimination methods like Frame

Buffer, Scan Line, etc.

• Apply 2D and 3D Transformations and Viewing.

• Use different packages and programs for the Creation and Implementation of

Multimedia.

• Prepare Multimedia Animation using multimedia concepts and tools.

UNIT I

2D GRAPHICS: 2D Transformations – Clipping – Window – View Port Mapping –

Graphical User Interfaces and Interactive Input Methods – Picture Construction Techniques –

Virtual Reality Environment.

UNIT II

3D GRAPHICS: 3D Transformation – 3D Viewing – Visible Surface Detection –

Back Face Detection – Depth Buffer Method – Scan Line Method.

UNIT III

MULTIMEDIA BASICS : Introduction to Multimedia – Components – Hypermedia

– Authoring – Authoring tools – File formats – Color models – Digital Audio representation –

Transmission – Audio signal processing – Digital music making – MIDI – Digital video –

Video compression techniques – Video performance measurements – Multimedia Databases –

Animation – Key frames and tweening techniques – Principles of animation – Virtual reality

– Multimedia for portable devices.

UNIT IV

MULTIMEDIA COMMUNICATION : Stream Characteristics for Continuous

Media – Temporal Relationship – Object Stream Interactions - Media Synchronization –

Models for Temporal Specifications – Streaming of Audio and Video – Recovering from

Packet Loss – RTSP – Multimedia Communication Standards –RTP/RTCP – SIP and H.263

– Real time streaming and On-demand Streaming.

75

UNIT V

MULTIMEDIA APPLICATION DEVELOPMENT : Design, Development and

Evaluation of Multimedia a System – The Development of User Interface Design – Design

Process – Multimedia & the Internet – Multimedia Conferencing – Multimedia File Sharing –

Multimedia Broadcasting – Multimedia Development Issues – Multimedia Project –

Structured Multimedia Development – Multimedia Project Timing – Sample Project.

REFERENCE BOOKS:

1. Donald Hearn and M. Pauline Baker, “Computer Graphics in openGL”, Second


2. Tom McReynolds,David Blythe “Advanced Graphics Programming Using OpenGL”,

Elsevier, 2010.

3. Parag Havaldar and Gerard Medioni, “Multimedia Systems-Algorithms, Standards

and Industry Practices”, Course Technology, Cengage Learning, 2010.

4. John F. Koegel Bufend , “Multimedia systems”, Pearson Education, Delhi, 2002.

5. Ralf Steinmetz and Klara “Multimedia Computing, Communications and

Applications”, Pearson Education, 2004.

6. Kurose and Ross, “Computer Networks: A top down Approach”, Pearson Education,

2002.

7. Ralf Steinmetz and Klara Nahrstedt “Multimedia Applications”, Springer, 2007

WEB RESOURCES:

1) http://www.Smartzword.com/notes/graphics-and-mm-notes-pdf-gm-notes-pdf/

2) http://www.edunotes.in/6-sem-cse-notes/graphics-and-mm

3) http://www.rejinpaul.com/2015/06/it6501-graphics-and-mm-syllabus-notes-question-

bank-with-answers-regulation-2013.html?m=1

4) http://googleweblight.com/i?u

5) http://www.freebookcenter.net/computerscience–books-Download/computer-

Graphics-and-mm.html&grpid=hCc9itu1&hl=en-In

76



SEMESTER-III

ELECTIVE COURSE-III : PRINCIPLES OF COMPILER DESIGN


COURSE OBJECTIVES:

• To know the design principles of a Compiler.

• To learn the various parsing techniques.

• To understand the different levels of translation.

• To appreciate Error detection and recovery.

• To learn to optimize and effectively generate machine codes.

COURSE OUTCOMES:


• Design and implement a prototype compiler.

• Apply the various optimization techniques

• Demonstrate the working of LEX and YACC compiler for debugging of programs.

• Demonstrate the role of lexical analyzer, use of regular expression and transition

diagrams.

• Produce Context free grammar.

• Construct parse tree.

• Identify new tools and technologies for designing a compiler.

• Develop programs for solving parser problems.

• Write programs to improve the execution speed.

UNIT – I

Introduction to Compilers: Compilers and Translators – Need for Translators –

Structure of a Compiler –Lexical Analysis – Syntax Analysis – Optimization – Code

Generation – Error handling. Finite Automata and Lexical Analysis: The Role of the

Lexical Analyzer – A Simple Approach to the Design of Lexical Analyzers – Regular

Expressions – Finite Automata – From Regular Expressions to Finite Automata – Minimizing

the number of States of a DFA.

UNIT – II

The Syntactic Specification of Programming Languages: Context-Free Grammars

– Derivations and Parse Trees. Basic Parsing Techniques: Parsers – Shift-Reduce Parsing –

Operator Precedence Parsing – Top-down Parsing – Predictive Parsers.

UNIT – III:

Syntax-Directed Translation: Syntax-Directed Translation Schemes –

Implementation of Syntax-Directed Translators – Intermediate Code – Postfix Notation –

Parse Trees and Syntax Trees – Three-Address Code, Quadruples, and Triples.

UNIT – IV

Symbol Tables: The Contents of a Symbol Table – Data Structures for Symbol

Tables. Error Detection and Recovery: Errors – Lexical-Phase Errors – Syntactic-Phase

Errors – Semantic Errors.

77

UNIT – V

Introduction to Code Optimization: The Principal Sources of Optimization – Loop

Optimization. Code Generation: Object Programs – Problems in Code Generation – A

Machine Model – A Simple Code Generator – Register Allocation and Assignment –

Peephole Optimization.

REFERENCE BOOKS:

1. Alfred V.Aho, Jeffrey D.Ullman, “Principles of Compiler Design”, Narosa Publishing

House, 2002.

2. Alfred V.Aho, Monica S.Lam, Ravi Sethi, Jeffrey D.Ullman, “Compilers: Principles,

Techniques and Tools”, Second Edition, Pearson Education, 2007.

3. A.A.Puntambekar, “Principles of Compiler Design”, Second Revised Edition,

Technical Publications Pune, 2009.

4. Niklaus Wirth, “Compiler Construction”, Addison-Wesley, 1996.

5. V.Raghavan, “Principles of Compiler Design”, Tata McGraw Hill, 2010.

WEB RESOURCES:

1. https://www.diku.dk/~torbenm/Basics

2. https://www.nptelvideos.com

3. www.nptel.ac.in

4. https://en.wikipedia.org/wiki/Principles_of_compiler_Design

5. https://en.wikipedia.org/wiki/Compiler_construction

6. https://www.tutorialspoint.com/compiler_design/

78



SEMESTER-III

ELECTIVE COURSE-III : SYSTEM SOFTWARE


COURSE OBJECTIVES:

• To understand the relationship between system software and machine architecture.

• To know design and implementation of assemblers, linkers and loaders.

• To understand the design, function and implementation of assemblers, linkers and

loaders.

• To have an understanding of macro processors and system software tools.

COURSE OUTCOMES:


• Trace the path of a source code to object code and to the executable file.

• Design the front end of the compiler-scanner, parser.

• Differentiate the relationship between system software architecture and machine.

• Analyze the functions of assembler, compiler, linker, and loaders.

• Evaluate the design and implementation of loaders and linkers.

UNIT I

BASICS OF SYSTEM SOFTWARE AND ASSEMBLER: Introduction – System

Software and SIC/XE Machine Architecture - Basic Assembler Functions –Assembler

Algorithms and Data Structures – Machine Dependent Assembler Features, Instruction

Formats and Addressing Modes – Program Relocation – Machine Independent Assembler

Features – Literals – Symbol-defining Statements – Expressions – Program Blocks – Control

Sections and Program Linking-Implementation Examples MASM Assembler.

UNIT II

COMPILER- LEXICAL ANALYSIS, SYNTAX ANALYSIS: Phases of Compiler-

Lexical Analysis: Role of a Lexical Analyzer, Input Buffering, Specification and

Recognition of Tokens, Finite Automata, Designing a Lexical Analyzer Generator, Pattern

Matching based on NFA’s. Syntax Analysis: Role of Parser, Top-down Parsing, Recursive

Descent and Predictive Parsers (LL), Bottom-Up Parsing, Operator Precedence Parsing, LR,

SLR and LALR Parsers.

UNIT III

COMPILER- CODE GENERATION, OPTIMIZATION: Intermediate

Languages: Graphical Representations, DAGs, Three Address Code, Types of Three Address

Statements, Syntax-Directed translation into Three Address Code, Implementation of Three

Address Statements – Code Optimization: Machine Dependent and Machine Independent

Code Generation: Sources of Optimization-Code Generation – Semantic Stacks, Evaluation

of Expressions, Control Structures, and Procedure Calls.

UNIT IV

LOADERS AND LINKERS: Basic Loader Functions: Design of an Absolute Loader

– A Simple Bootstrap Loader Machine Dependent Loader Features Relocation – Program

79

Linking – Algorithm and Data Structures for Linking Loader. Machine-Independent Loader

Features – Automatic Library Search – Loader Options Loader Design Options – Linkage

Editors – Dynamic Linking – Bootstrap Loaders. Implementation examples:

MSDOS linker.

UNIT V

MACRO PROCESSORS & OTHER SYSTEM SOFTWARE: Basic Macro

Processor Functions – Macro Definition and Expansion – Macro Processor Algorithm and

Data Structures – Implementation Examples: MASM Macro Processor – Text Editors –

Overview of Editing Process – User Interface – Editor Structure – Interactive Debugging

Systems – Debugging Functions and Capabilities – Relationships with Other parts of the

System – User Interface Criteria. – Virtual Machines.

REFERENCE BOOKS:

1. Leland Beck - “System Software – An Introduction to Systems Programming”, Third

Edition, Pearson Education, Inc., 2008.

2. A.V. Aho, R. Shethi and Ulman; Compilers - Principles, Techniques and Tools,

Second Edition, Pearson Education, 2002.

3. D. M. Dhamdhere, "Systems Programming and Operating Systems", Tata McGraw

Hill Company, Second Edition, 2009.

4. John J. Donovan, “Systems Programming”, Tata McGraw Hill Company, Second

Edition, 2000.

5. V. Raghavan, “Principles of Compiler Design”, Tata McGraw Hill Education

Publishers, 2010.

6. Srimanta Pal, “Systems Programming” , Oxford University Press, 2011.

WEB RESOURCES:

1. http://pcfundamental.blogspot.in/2013/07/system-software-bios-language.html

2. https://en.wikibooks.org/wiki/A-

level_Computing/AQA/Computer_Components,_The_Stored_Program_Concept_and

_the_Internet/Fundamentals_of_Computer_Systems/System_software

3. http://www.diku.dk/~torbenm/Basics/basics_lulu2.pdf

4. https://github.com/compilers-course-materials

80



SEMESTER-III

ELECTIVE COURSE -IV : PROFESSIONAL ETHICS


COURSE OBJECTIVES:

• To understand the concepts of computer ethics in work environment.

• To understand the threats in computing environment.

• To understand the intricacies of accessibility issues.

• To ensure safe exits when designing the software projects.

COURSE OUTCOMES:


• Helps to examine situations and to internalize the need for applying ethical principles,

values to tackle with various situations.

• Develop a responsible attitude towards the use of computer as well as the technology.

• Envision the societal impact on the products/ projects they develop in their career.

• Realize the code of ethics and standards of computer professionals.

• Analyze the professional responsibility and empowering access to information in the

work place.

UNIT I

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.

UNIT II

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.

UNIT III

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.

UNIT IV

COMPUTER TECHNOLOGIES ACCESSIBILITY ISSUES: Introduction –

Principle of Equal Access – Obstacles to Access for Individuals – Professional Responsibility

81

– Empowering Computers in the Workplace – Introduction – Computers and Employment

– Computers and the Quality of Work – Computerized Monitoring in the Work Place –

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

UNIT V

SOFTWARE DEVELOPMENT AND SOCIAL NETWORKING: Software

Development – Strategies for Engineering Quality Standards – Quality Management

Standards – Social Networking – Company Owned Social Network Website – 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.

REFERENCE BOOKS:

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


WEB RESOURCES:

1. http://www.infosectoday.com/Articles/Intro_Computer_Ethics.htm

2. https://www.linkedin.com/pulse/20140831053426-77080879-10-golden-rules-to-

professional-ethics-in-the-workplace

3. https://www.cs.umd.edu/~oleary/gradstudy/node14.html

4. http://www.isaca.org/certification/code-of-professional-ethics/pages/default.aspx

82



SEMESTER-III

ELECTIVE COURSE- IV : DISTRIBUTED OPERATING SYSTEMS


COURSE OBJECTIVES:

• To learn the fundamentals of Hardware/Software.

• To gain knowledge on Distributed operating system concepts that includes

architecture,

• To know the Mutual exclusion algorithms, Deadlock detection algorithms and remote

procedure calls.

• To gain insight on to the distributed resource management components viz. the

algorithms for implementation of distributed shared memory, recovery and commit

protocols.

• To know the components and management aspects of Real time Distributed Systems.

COURSE OUTCOMES:


• Demonstrate the Remote Procedure call, Mutual exclusion, Deadlock detection of

Distributed operating system.

• Demonstrate the various resource management techniques for distributed systems.

• Evaluate the different features of distributed file systems

• Modify existing open source kernels in terms of functionality or features used.

UNIT I

What is Distributed System? – Hardware Concepts – Software Concepts – Design

Issues – The Client – Server Model.

UNIT II

Remote Procedure Call – Clock Synchronization – Mutual Exclusion – Election

Algorithms – Deadlocks in Distributed Systems.

UNIT III

Threads – System Models – Processor Allocation – Fault Tolerance.

UNIT IV

Real-Time Distributed systems – Distributed File System Design – Distributed File

System Implementation – Trends in Distributed File Systems.

UNIT V

What is Shared Memory – Consistency Models – Page based Distributed Shared

Memory – Case Study: MACH.

83

REFERENCE BOOKS:

1. Andrew S.Tanenbaum, “Distributed Operating Systems “, Pearson Education, 2002.

2. George coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems Concepts

and Design”, Third Edition, Pearson Education Asia, 2002.

3. Hagit Attiya and Jennifer Welch, “Distributed Computing: Fundamentals, Simulations

and Advanced Topics “, Wiley, 2004.

4. Mukesh Singhal,” Advanced Concepts in Operating Systems”, McGrawHill Series in

Computer Science, 1994.

5. A.S.Tanenbaum, M.Van Steen,” Distributed Systems”, Pearson Education, 2004.

6. M.L.Liu, “Distributed Computing Principles and Applications”, Pearson Addison

Wesley, 2004.

WEB RESOURCES:

1. https://www.tutorialspoint.com/operating_system/

2. https://web.iiit.ac.in/~abhinav/OS/os.pdf

3. https://mcqsets.com/downloads/download-operating-systems-mcq-bank-pdf-file/

84



SEMESTER-III

ELECTIVE COURSE- IV : SOCIAL NETWORK ANALYSIS


COURSE OBJECTIVES:

• To understand about social network and its structure.

• To recognize and be able to give examples of social networks and their properties.

• To learn the basic ideas behind graph theory and study the network structure.

• To understand graph partitioning algorithms and apply in social networks.

• To appreciate the ability to create and interpret a hierarchical clustering; understand

the density of network.

• To discuss network sampling and data collection; understand the use of centrality and

its use in Google search.

• To understand the process of social diffusion, gain the knowledge about epidemics in

social networks and describes the transmission of contagious disease through

individuals.

COURSE OUTCOMES:


• Identify the network terminologies; analyze the relationship between the networking

groups.

• Demonstrate knowledge of fundamental concepts in graph theory and evaluate the

shortest path for the given network.

• Demonstrate the ability to create and interpret a hierarchical clustering; develop a

black model of a social network based on one of the grouping algorithm.

• Use any one of the centrality method to analyze power, influence, or other individual

characteristics of people in a social network.

• Perform case study on famous social media.

UNIT I

INTRODUCTION: Networks, Relations and Structure – Basic Network Concepts –

Adjacency Matrices – Graphs – Notation – Nodes and Links – Directed Network – Analyzing

Relationships to Understand People and Groups – What is Social Network? – Types of Social

Networkers - Social Networks vs. Link Analysis – Terrorists and Revolutionaries: The Power

of Social Networks. Social Network Data: Collection and Application.

UNIT II

GRAPH: Mathematical Representations of Social Networks – Notation – Graphs and

Matrices. Introduction to Graph theory – Graphs as Models of Networks - Hyper Graph –

Graph Traversals and Distances - Dividing Networks into Clusters - Graph Partitioning - The

Kernighan- Lin Algorithm - Spectral Partitioning Algorithm.

85

UNIT III

CLIQUE, CLUSTERS AND NETWORK MODELS: Subgraphs – Ego Networks –

Triads – Cliques – Clustering – Clustering Coefficients – Hierarchical Clustering - Triads,

Network Density, and Conflict. – Block Model – Random Graph.

UNIT IV

CENTRALITY, POWER, AND BOTTLENECKS: Snowball Sampling, Contact

Tracing, and Random Walks – Centrality – Centrality Measures – Degree Centrality – Find

the “Celebrities” – Find the Gossipmongers - Find the Communication Bottlenecks and/or

Community Bridges – PageRank – How Google Measures Centrality.

UNIT V

PREDICTING HUMAN BEHAVIOUR: Understanding and Predicting Human

Behaviour for Social Communities – User Data Management – Inference and Distribution –

Enabling new Human Experiences - Reality Mining – Context – Awareness – Privacy in

Online Social Networks – Trust in Online Environment – Trust Models based on Subjective

Logic – Trust Network Analysis – Trust Transitivity Analysis. Case studies: FaceBook –

Twitter – LinkedIn.

REFERENCE BOOKS:

1. Alexander Kouznetsov, Maksim Tsvetovat,” Social Network Analysis for Startups:

Finding Connections on The Social Web”, O'Reilly Publication, 1st Edition 2011.

2. Mark Newman,”Networks: An introduction”, Oxford University Press; 1st Edition

2010.

3. Wasserman S,Faust K., “Social Network Analysis: Methods and Applications”,

Cambridge University Press, Newyork, 4th

Edition-1999.

4. Peter Mika, “Social Networks and the Semantic Web”, First Edition, Springer 2007.

5. Borko Furht, “Handbook of Social Network Technologies and Applications”, 1st

Edition, Springer, 2010.

WEB RESOURCES:

1) https://www.saylor.org/site/wp-content/uploads/2013/01/BUS209-4.3.2-

SocialNetworkAnalysis.pdf

2) http://www.mjdenny.com/workshops/SN_Theory_I.pdf

3) http://nptel.ac.in/courses/106106146/21

4) https://www.youtube.com/watch?v=IEp0nVf26F0

86



SEMESTER-IV

ELECTIVE COURSE-V: LAMP TECHNOLOGIES


COURSE OBJECTIVES:

• To understand the importance of open source technologies

• To know the basics of LAMP technology.

• To feel the power of open source technologies.

• To learn to use the open source technologies like MySQL, PHP.

COURSE OUTCOMES:


• Demonstrate the features of open source technologies.

• Describe and interpret the basics of LAMP technology.

• Correlate the Linux, Apache, MySQL and PHP for building an application.

• Design and develop applications using open source technologies.

UNIT-I

Introduction to LAMP Technology: Characteristics and Advantage of LAMP,

Installation and Configuration of LAMP Stack. Understanding of Apache Web Server,

Understanding and Setting of various Configuration files of LAMP Stack.

UNIT-II

MySQL: Introduction to MySQL, Creation of MYSQL Database, Creating Tables,

Implementation of DDL and DML Queries on MYSQL database. PHP myadmin to Manage

MySQL database. MySQL Database Administration.

UNIT-III

PHP Programming fundamentals: Understanding Syntax and Variables of PHP,

Control Statements and Functions, Passing Information between PHP Pages, String

Handling, Arrays, Improving PHP/MySQL Efficiency.

UNIT-IV

Object Oriented programming with PHP : What Is Object-Oriented Programming?,

Basic PHP Constructs for OOP, Advanced OOP Features, Introspection Functions, Gotchas

and Troubleshooting, OOP Style in PHP, Advanced Array Functions, String and Regular

Expression Functions, Handling Session and Cookies in PHP.

UNIT-V

File Handling: Understanding PHP File Permissions, File Reading and Writing

Functions, File System and Directory Functions, Network Functions, Date and Time

Functions.

REFERENCE BOOKS :

1. Steve Suehring, Tim Coverse, Joyce Park, PHP MYSQL Bible, John Wiley & Sons.

2. Timothy Boronczyk, Elizabeth Naramore, Jason Gerner, Yann Le Scouarnec, Jeremy

Stolz, Michael K. Glass, “Beginning PHP6, Apache, MySQL Web Development”, Wiley.

87

3. James Lee, Brent Ware, “Open Source Web Development with LAMP: Using Linux,

Apache, MySQL, Perl, and PHP”, Addison-Wesley, 2003.

4. Eric Rosebrock, Eric Filson , “Setting up LAMP: Getting Linux, Apache, MySQL, and

PHP Working Together”, Wiley Publications, 2004.

WEB RESOURCES:

1. http://linux-training.be/linuxfun.pdf

2. https://linuxacademy.com/linux/courses?gclid=EAIaIQobChMIub-kioG-

1QIVzhNoCh0NbQeDEAAYASAAEgLm_vD_BwE

3. http://www.dedoimedo.com/computers/apache_book_part.html

4. http://www.tutorialspoint.com/php/php_tutorial.pdf

5. https://downloads.mysql.com/docs/apis-php-en.pdf

88



SEMESTER IV

ELECTIVE COURSE- V : INTERNET AND WEB PROGRAMMING


COURSE OBJECTIVES:

• To learn basics involved in publishing content on the World Wide Web.

• To understand the ‘language of the Web’ – HTML, the fundamentals of how the

Internet and the Web function.

• To learn Create web pages and write scripting using Javascript

• To gain basic understanding of graphic production with a specific stress on creating

graphics for the Web, and a general grounding introduction to more advanced topics

such as programming and scripting.

• To know basic tools and applications used in Web publishing.

COURSE OUTCOMES


• Basic concepts for network implementation.

• Basic working scheme of the Internet and World Wide Web.

• Fundamental tools and technologies for web design.

• Comprehend the technologies for Hypertext Mark-up Language (HTML).

• Create web pages and sites.

• Build dynamic web pages using JavaScript (Client side programming).

UNIT I

INTRODUCTION TO COMPUTERS AND THE INTERNET: History of the

World Wide Web –Hardware Trends – The key Software Trend: Object Technology – Java

Script: Object-Based Scripting for the Web - Browser Portability - Hyper Text Markup

Language :Introduction – Markup Languages – Editing HTML – Common Tags – Headers –

Text Styling – Linking – Images – Formatting Text with <FONT> – Special

Characters, Horizontal Rules and more Line Breaks – Intermediate HTML:

Introduction – Unordered Lists – Nested and Ordered Lists – Basic HTML Tables.

UNIT II

JAVA SCRIPT: Introduction – Memory Concepts – Arithmetic – Decision Making:

Equality and Relational Operators – Selection Structures: If, If Else, Switch – Repetition

Structures: While, For, Do/While - Break and Continue Statements – Labeled Break and

Continue Statements – Logical Operators - Functions: Introduction – Program

Modules in Java Script – Programmer – Defined Functions – Function Definitions –

Duration of Identifiers – Scope Rules – Recursion – Recursion Vs Iteration –

JavaScript Global Functions.

89

UNIT III

ARRAYS: Introduction – Arrays – Declaring and Allocating Arrays – References and

Reference Parameters – Passing Arrays to Functions – Sorting Arrays – Searching Arrays –

Multiple Subscripted Arrays – Objects: Introduction – Math, String, Date, Boolean and

Number Objects – Dynamic HTML: Cascading Style Sheets: Introduction– Inline Styles –

Creating Style Sheets with the STYLE Element – Conflicting Styles – Linking External

Style Sheets – Positioning Elements – Backgrounds – Element Dimensions – Text Flow

and the Box Model – User Style Sheets.

UNIT IV

OBJECT MODEL AND COLLECTIONS: Introduction – Object Referencing –

Collections all and Children – Dynamic Styles – Dynamic Positioning – Using the frames

Collection – navigator Object – Event Model: Introduction – Event ONCLICK – Event

ONLOAD – Error Handling with ONERROR – Tracking the Mouse with Event

ONMOUSEMOVE – Rollovers with ONMOUSEOVER and ONMOUSEOUT – form

processing with ONFOCUS and ONBLUR – more form processing with ONSUBMIT and

ONRESET - Client Side Scripting with VBScript: Introduction – Operators – Data Types

and Control Structures – VBScript Functions – Arrays – String Manipulation Classes and

Objects.

UNIT V

ACTIVE SERVER PAGES: Introduction – Work – Client–Side Scripting

Versus Server-Side Scripting – Using Personal Web Server or Internet Information Server –

Server-Side ActiveX Components – File System Objects – Session Tracking and

Cookies – Accessing a Database from an ASP CGI and Perl: Common Gateway Interface –

Introduction to Perl – Configuring Personal Web Server for Perl / CGI – String Processing

and Regular Expressions – Viewing Client/Server Environment Variables – Form Processing

and Business Logic – Server-Side Includes – Verifying a user name and password – Sending

E-Mail from a Web Browser – Using ODBC to Connect to a Database.

REFERENCE BOOKS:

1. H.M.Deitel, P.J.Deitel and T.R.Nieto, “Internet and World Wide Web – How to

Program”, Pearson Education Asia, 2012.

2. H.M.Deitel, P.J.Deitel and T.R.Nieto, “Internet and World Wide Web – How to

Program”, Pearson Education Asia, 2003.

3. Thomas A. Powell, “The Complete Reference HTML and XHTML”, Fourth

Edition, Tata McGraw Hill Pub. Company Ltd., 2006.

4. Achyut S. Godbole, Atul Kahate, “Web Technologies – TCP/IP to Internet Application

Architectures”, Tata McGraw Hill Pub. Company Ltd, 2003.

5. Ivan Bayross, “Web enabled Application Development using HTML, DHTML,

JAVASCRIPT, PERL, CGI”, BPB 2000.

WEB RESOURCES:

1. https://www.vssut.ac.in/lecture_notes/lecture1423183400.pdf

2. https://www.scss.tcd.ie/owen.conlan/CS7062/1_Web_Technologies_Handout.pdf

3. http://www.inf.unibz.it/~ricci/IT/slides/1-www.pdf

4. https://www.tutorialspoint.com/internet_technologies/pdf/internet_quick_guide.pdf

90

COURSE OBJECTIVES:

• To understand UNIX system Architecture.

• To learn the basic set of commands, utilities, library functions and system calls in

UNIX/Linux systems.

• To obtain a foundation for an advanced course in operating systems.

• To introduce the internals of UNIX/Linux Operating System

• To understand the concept of shell programming in UNIX like OS.

• To know the concept of thread programming in Linux.

• To learn the system administration operations in Linux environment.

• To be aware of security aspects in Linux.

COURSE OUTCOMES:


• Prefer to use Linux operating system.

• Use all Internal and External commands in UNIX/Linux environment.

• Write simple shell scripts.

• Develop, debug and implement Shell Programme.

• Demonstrate the system administration activities.

• Establish security features in Linux environment.

UNIT I

INTRODUCTION : The Unix Operating System - The UNIX Architecture and

Command Usage: The UNIX Architecture – Features of UNIX – Locating commands –

Internal and External Commands – Command Structure. General Purpose Utilities: cal,

date, echo, printf, bc, script, who, email basics, mailx, passwd, uname, tty, stty – The File

System: The file – The parent child relationship – pwd, cd, mkdir, rmdir – Absolute

Pathnames – relative Pathnames – ls.

UNIT II

THE UNIX FILE SYSTEM: Handling Ordinary files: cat, cp, rm, mv, more, file,

wc, od, cmp, comm., diff, dos2unix and unix2dos. Basic File Attributes: Listing File

Attributes – Listing Directory Attributes – File ownerships – File permissions – chmod –

Directory Permissions – changing File ownership - The vi Editor.

UNIT IV

SHELL PROGRAMMING: Need of Shell programming, Types of Shells in

Linux/Unix, Shell variables: User Defined Variables, Environment Variables, Predefined

Variables, Reading Values into User Defined Variables, Command Substitution Computation

on Shell Variable, Handling Shell Variables, Passing Arguments to the Shell, Shift Command,

GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM-7.

MASTER OF COMPUTER APPLICATIONS (BCA)

SEMESTER – IV

ELECTIVE COURSE –V : UNIX/LINUX AND SHELL PROGRAMMING


91

Conditional Execution Operators, Conditional Statements, Test Command, Iterative

Statements : For, While, Until, Break, Continue Statements, Practical Examples On Shell

Programming. Exercises on shell programming.

UNIT IV

CUSTOMIZING THE ENVIRONMENT: The Shells – Environment Variables -

More file Attributes : Hard Links – Symbolic Links. Find Simple Filters: pr, head, tail, cut,

paste, sort. Filters using Regular Expressions: grep, sed - Essential Shell Programming:

Shell Scripts – Read- Using Command Line Arguments – Exit – Conditional Execution - If –

Case – Expr – While – For - Looping with a List

UNIT-V

SYSTEM ADMINISTRATION & SECURITY: System Administration, Common

Administrative Tasks, Identifying Administrative Files Configuration and Log Files, Role of

System Administrator, Managing User Accounts – Adding and Deleting Users, Changing

Permissions and Ownerships, Creating and Managing Groups, Modifying Group Attributes,

Temporary Disable Users Account, Creating and Mounting File System, Checking and

Monitoring System Performance, File Security and Permissions, becoming Super User using

su.

REFERENCE BOOKS:

1. Sumitabha Das, “UNIX – Concepts and Applications”, 4th

Edition, Tata McGraw Hill,

2006.

2. Behrouz A. Forouzan and Richard F. Gilberg, “UNIX and Shell Programming”,

Cengage Learning, 2005.

3. Neil Matthew, Richard Stones, “Beginning Linux Programming (Linux

Programming Series)”, Wrox Press, 2010.

4. Parata, “Advanced Unix programming guide”, BPB Publications, 2010.

5. M.G. Venkateshmurthy, “UNIX & Shell Programming”, Pearson Education, 2005.

6. Yashavant P. Kanetkar, “UNIX Shell Programming”, BPB Publications, 2010.

WEB RESOURCES:

1. https://training.linuxfoundation.org/linux-courses/development-training

2. http://shop.oreilly.com/product/9780596009588.do

3. http://advancedlinuxprogramming.com/alp-folder/advanced-linux-programming.pdf

92



SEMESTER-IV

ELECTIVE COURSE -VI : SEMANTIC WEB


COURSE OBJECTIVES:

• To appreciate semantic technologies as they are being developed.

• To know the overall architecture of the semantic web.

• To understand the component technologies of the semantic web and explain their

roles.

• To gain the knowledge of design principles of the semantic web by applying the

technologies.

• To understand the limitations of the semantic web technologies.

• To be aware of the kinds of services it can and cannot deliver.

COURSE OUTCOMES:


• Demonstrate the fundamental concepts, advantages and limits of the semantic web

• Build ontology.

• Apply ontology in the context of Computer Science and the semantic web

• Apply reasoning on the semantic web.

• Use the tools for generating ontology.

UNIT I

INTRODUCTION TO THE SYNTACTIC WEB AND SEMANTIC WEB –

Evolution of the Web – The Visual and Syntactic Web – Levels of Semantics – Taxonomies -

Logics for Semantic Web – The Semantic Web Architecture and Technologies – Applications

of the Semantic Web.

UNIT II

ONTOLOGICAL ENGINEERING: What are Ontologies? – Methods and

Methodologies for Building Ontologies – Ontology Development Process and Life Cycle –

Methods for Ontology Learning – Ontology Evolution – Versioning – Ontology Languages.

UNIT III

EDITING TOOLS FOR ONTOLOGY CREATION – Protégé – OntoEdit – DOE

– IsaViz – Ontolingua Altova Semantic Works – OilEd – WebODE – pOWL – Swoop.

UNIT IV

THE KEY SEMANTIC WEB ONTOLOGY LANGUAGES – Semantic

Reasoning – Logical Implications and Descriptions – Technical Interpretations of Classes and

Predicates.

93

UNIT V

CASE STUDY: Resource Discovery in a Building – Reasoning about Knowledge

Base and Ontologies – Semantic Search Engines based on Data Integration Systems.

REFERENCES BOOKS:

1. Jorge Cardoso, "Semantic Web Services – Theory, Tools and Applications",

Information Science Reference, 2007.

2. Christopher Walton, "Agency and the Semantic Web", Oxford Univ Press, 2007.

3. AF Salam and Jason R Stevens, "Semantic Web Technologies and e-Business", Idea

Group Publications, 2007.

WEB RESOURCES:

1. http://www.w3.org/standards/semanticweb/

2. http://www.cambridgesemantics.com/semantic-university/introduction-semantic-web

3. http://www.webopedia.com/DidYouKnow/Internet/Semantic_Web.asp

4. http://www.w3.org/standards/semanticweb/ontology

5. http://www.obitko.com/tutorials/ontologies-semantic-web/

94



SEMESTER-IV

ELECTIVCOURSE-VI : INTERNET OF THINGS


COURSE OBJECTIVES:

• To understand the fundamentals of Internet of Things.

• To know the ways and means of making a small low cost embedded system using

Arduino / Raspberry Pi or equivalent boards.

• To apply the concept of Internet of Things in the personal and real-world scenario.

• To learn the latest applications of IoT.

• To study the pros and cons of IoT.

COURSE OUTCOMES:

• Realize the potential areas of applications of IoT.

• Demonstrate the scope of IoT in people’s life.

• Design a portable IoT using Arduino/ equivalent boards and relevant protocols.

• Develop web services to access/control IoT devices.

• Deploy an IoT application and connect to the cloud.

• Analyze applications of IoT in real time scenario

UNIT I

FUNDAMENTALS of IoT: Introduction – Characteristics – Physical Design -

Protocols – Logical Design – Enabling technologies – IoT Levels – Domain Specific IoTs –

IoT vs M2M.

UNIT II

IoT DESIGN METHODOLOGY: IoT Systems Management – IoT Design

Methodology – Specifications Integration and Application Development.

UNIT III

BUILDING IoT WITH RASPBERRY Pi: Physical Device – Raspberry Pi

Interfaces – Programming – APIs / Packages – Web services.

UNIT IV

BUILDING IoT WITH GALILEO/ARDUINO: Intel Galileo Gen2 with Arduino-

Interfaces – Arduino IDE – Programming - APIs and Hacks

UNIT V

CASE STUDIES AND ADVANCED TOPICS: Various Real time applications of

IoT- Connecting IoT to cloud – Cloud Storage for IoT – Data Analytics for IoT – Software &

Management Tools for IoT.

REFERENCE BOOKS:

1. Arshdeep Bahga, Vijay Madisetti, “Internet of Things – A hands-on approach”,

Universities Press, 2015.

2. Manoel Carlos Ramon, “Intel® Galileo and Intel® Galileo Gen 2: API Features and

Arduino Projects for Linux Programmers”, Apress, 2014.

95

3. Marco Schwartz, “Internet of Things with the Arduino Yun”, Packt Publishing, 2014.

WEB RESOURCES:

1. https://www.webnms.com/?gclid=EAIaIQobChMIjpu9tfG_1QIVFoaPCh3hsgjqEAA

YASAAEgKl1fD_BwE

2. https://www.sap.com/india/trends/internet-of-things.html?campaigncode=CRM-IN17-

PPC-1SCCA&source=PPC-India-DSC-

OO&gclid=CLCvvcTxv9UCFRPyjgodNWIILw&gclsrc=ds

3. https://www.analyticsvidhya.com/blog/2016/08/10-youtube-videos-explaining-the-

real-world-applications-of-internet-of-things-iot/

96



SEMESTER-IV

ELECTIVE COURSE-VI : DATA WAREHOUSING AND DATA MINING


COURSE OBJECTIVES:

• To know about data warehousing components, data cleaning and transformation

• To understand data mining principles and techniques

• To learn to use association rule mining for handling large data.

• To understand the concept of classification for the retrieval purposes.

• To know the clustering techniques in details for better organization and retrieval of

data.

• To identify Business applications and Trends of Data mining.

COURSE OUTCOMES:


• Build a data warehouse and transform for mining.

• Preprocess the data for mining applications.

• Apply the association rules for mining the data.

• Differentiate the classification and prediction

• Design and deploy appropriate classification techniques.

• List the major clustering methods and its applications.

• Cluster the high dimensional data for better organization of the data.

UNIT I

Introduction – Data mining as a Subject – DATA WAREHOUSING: Introduction –

Definition – Multidimensional Data Model – OLAP Operations – Warehouse Schema – Data

Warehousing Architecture – Warehouse Server – Meta Data – OLAP Engine – Data

Warehouse Backend Process – Other Features. DATA MINING: Introduction – Definitions –

KDD vs. Data Mining – DBMS vs. DM – DM techniques.

UNIT II

DATA PREPROCESSING: Need for Data Preprocessing – Data Cleaning – Data

Integration and Transformation – Data Reduction. ASSOCIATION RULES: Concepts –

Methods to discover Association Rules – Apriori Algorithm – Partition Algorithm – Pincer

Search Algorithm – Dynamic Itemset Counting Algorithm – FP-Tree Growth Algorithm –

Incremental Algorithm – Border Algorithm – Generalized Association Rule

UNIT III

CLASSIFICATION : Classification vs Prediction – Data Preparation for

Classification and Prediction – Classification by Decision Tree Introduction – Bayesian

Classification – Rule Based Classification – Classification by Back Propagation – Support

Vector Machines – Associative Classification – Other Classification Methods.

PREDICTION: Accuracy and Error Measures – Evaluating the Accuracy of a Classifier or

Predictor – Ensemble Methods –Model Section.

97

UNIT IV

CLUSTERING: Cluster Analysis – Types of Data in Cluster Analysis – A

Categorization of Major Clustering Methods – Partitioning Methods – Hierarchical methods

– Density-Based Methods – Clustering High – Dimensional Data – Constraint-Based Cluster

Analysis. OUTLIER : Outlier and Outlier Analysis – Outlier Detection methods – Statistical

Approaches- Proximity based Approaches - Clustering based Approaches.

UNIT V

RECENT TRENDS: Web Mining – Text Mining – Temporal Mining – Spatial

Mining – Multimedia Mining – TOOLS: WEKA – R Tool. CASE STUDIES: Business,

Agriculture and Information Retrieval.

REFERENCE BOOKS:

1) Arun K. Pujari, “Data Mining Techniques”, Universities Press India Pvt. Limited,

2008.

2) Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, Second

Edition, Elsevier, Reprinted 2008.

3) Alex Berson and Stephen J. Smith, “Data Warehousing, Data Mining & OLAP”, Tata

McGraw – Hill Edition, Tenth Reprint 2007.

4) K.P. Soman, Shyam Diwakar and V. Ajay, “Insight into Data mining Theory and

Practice”, Easter Economy Edition, Prentice Hall of India, 2006.

5) G. K. Gupta, “Introduction to Data Mining with Case Studies”, Easter Economy

Edition, Prentice Hall of India, 2006.

6) Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction to Data Mining”,

Pearson Education, 2007.

WEB RESOURCES:

1) http://www.tutorialspoint.com/data_mining/

2) https://cs.wmich.edu/~yang/teach/cs595/han/ch01.pdf

3) http://ccs1.hnue.edu.vn/hungtd/DM2012/DataMining_BOOK.pdf

4) https://www.youtube.com/watch?v=6rs55Wg46dI

5) https://www.youtube.com/watch?v=N7BI0CWfTaI

98



SEMESTER-V

ELECTIVE COURSE-VII : SOFTWARE DOCUMENTATION


COURSE OBJECTIVES:

• To understand the need for software documentation.

• To acquire the skill of preparing documents.

• To know the steps in planning a document and conducting usability tests.

• To learn the guidelines to be followed while preparing software documents.

COURSE OUTCOMES:


• Realize the need for software documentation.

• Carryout document planning and prepare schedule and checklist.

• Perform usability testing of software as well as document.

• Decide the layout of pages and check to correct if any.

• Devise guidelines for better documentation.

• Follow the documentation guidelines while creating software documents.

UNIT-I

INTRODUCTION: Need for Software Documentation – Understanding Task

Orientation – Analyzing Users – Writing User Scenarios – User Informational Needs –

Document Goals – User Work Motivations – User Analysis Checklist – Constructing a Task

List – Categorization – Writing Steps as Actions – Task Analysis.

UNIT-II

DOCUMENTATION PLANNING: Planning and Writing Documents – Task List and

Schedule – Guidelines – Documentation Process – Documentation Plan – Document Review

Form – Review Plan – Schedule – Checklist.

UNIT-III

DOCUMENTATION TESTING: Usability tests – Advantages of Field Testing –

Editing and Fine Tuning – Problems – Designing for Task Orientation – Page Showing

Elements of Document Design – Screen Showing Elements for Online Help Design –

Solutions to the Design Problem for Printed and Online Documentation.

UNIT-IV

DOCUMENTATION LAYOUTS: Laying out Pages and Screens – Elements of Page

and Screen Design – Designing Type – Effective Writing Style – Using Graphical that

support Decision Making – Functions of Graphics – Type and Elements of Graphics.

99

UNIT-V

DOCUMENTATION GUIDELINES: Writing to Guide – Procedures – Guidelines –

Writing to Support – Reference – Structural Reference Entry – Checklist – Designing Index –

User Oriented Index – Case Studies.

REFERENCE BOOKS:

1. Thomas T. Barker, “Writing Software Documentation – a Task Oriented Approach”,

Allyn & Bacon Series of Technical Communication, 1998.

2. Dan Jones, “Technical Writing Style”, Sam Dragga, Taxas University.

3. Lynda Felder, “Writing for the Web: Creating Compelling Web Content Using Words,

Pictures, and Sound”, Kindle Edition.

4. Kristina Halvorson, Melissa Rach, “Content Strategy for the Web (Voices That

Matter)”, Kindle Edition.

WEB RESOURCES:

1. www.abacon.com

2. https://www.process.st/software-documentation/

3. http://sce2.umkc.edu/BIT/burrise/pl/appendix/Software_Documentation_Templates/

100



SEMESTER-V

ELECTIVE COURSE-VII : SOFTWARE QUALITY MAMAGEMENT AND

ASSURANCE


COURSE OBJECTIVES:

• Software quality models.

• Quality measurement and metrics.

• Quality plan, implementation and documentation.

• Quality tools including CASE tools.

• Quality control and reliability of quality process.

• Quality management system models.

• Complexity metrics and Customer Satisfaction.

• International quality standards – ISO, CMM.

COURSE OUTCOMES:


• Discuss the issue of Software Quality and the activities present in a typical Quality

Management process.

• Discuss the advantages of difficulties presented by the use of Quality standards in

Software Engineering Explain the origins and rationale behind the ISO 9000

standards.

• Describe two complementary approaches to Quality Control.

• Define the term “Software Metric” and what is meant by an internal and external

quality attribute.

UNIT I

INTRODUCTION TO SOFTWARE QUALITY: Software Quality – Hierarchical

Models of Boehm and McCall – Quality Measurement – Metrics Measurement and Analysis

– Gilb’s Approach – GQM Model.

UNIT II

QUALITY CONTROL AND RELIABILITY: Tools for Quality – Ishikawa’s basic

Tools – CASE Tools – Defect Prevention and Removal – Reliability Models – Rayleigh

Model – Reliability Growth Models for Quality Assessment.

UNIT III

QUALITY MANAGEMENT SYSTEM : Elements of QMS – Rayleigh Model

framework – Reliability Growth Models for QMS – Complexity Metrics and Models –

Customer Satisfaction Analysis.

UNIT IV

QUALITY STANDARDS : Need for standards – ISO 9000 Series – ISO 9000-3 for

Software Development – CMM and CMMI – Six Sigma Concepts.

101

UNIT V

SOFTWARE QUALITY ASSURANCE: Quality Tasks – SQA Plan – Teams –

Characteristics – Implementation – Documentation – Reviews and Audits.

REFERENCE BOOKS:

1. Allan C. Gillies, “Software Quality: Theory and Management”, Thomson Learning,

2011.

2. Stephen H. Kan, “Metrics and Models in Software Quality Engineering”, Pearson

Education (Singapore), Pvt. Ltd., 2002.

3. Norman E. Fenton and Shari Lawrence Pfleeger, “Software Metrics” Thomson, 2003

4. Mordechai Ben – Menachem and Garry S.Marliss, “Software Quality”, Thomson Asia

Pvt. Ltd, 2003.

5. Mary Beth Chrissis, Mike Konrad and Sandy Shrum, “CMMI”, Pearson Education

(Singapore) Pvt. Ltd., 2003.

WEB RESOURCES:

1. https://www.cipl.net.in/courses/PDF/QA.pdf

2. https://www.fi.upm.es/docs/estudios/1127_18_01_13Software_Quality_Management-

.pdf

3. https://pdfs.semanticscholar.org/49fe/e6869554450a5d47ca006fefa6019a9cde64.pdf

4. http://www2.cs.uni-paderborn.de/cs/ag-

schaefer/Lehre/Lehrveranstaltungen/Vorlesungen/

SoftwareQualityAssurance/WS0405/SQA-I-p1-59.pdf

5. http://www.cs.ubbcluj.ro/~cretu/VVSS2014_2015/Bibliography/Naik____Wiley.S-

oftware.Testing.and.Quality.Assurance.Theory.and.Practice.Aug.2008.eBook-

DDU.pdf

102



SEMESTER-V

ELECTIVE COURSE-VII : ENTERPRISE RESOURCE PLANNING


COURSE OBJECTIVES:

• To understand and explain various fundamentals and modules of Enterprise Resource

Planning (ERP).

• To analyse and compare various decision making processes using ERP.

• To know the design the implementation of ERP life cycle, E-Business, E-Commerce,

SCM, CRM.

• To understand the introductory level implementation scenarios of various ERP

packages.

COURSE OUTCOMES:

On successful completion of the course, the students will be able to :

• Describe the concept of ERP.

• Do decision making with complete steps.

• Relate ERP life cycle, E-Business, E-Commerce.

• Implement SCM and CRM.

• Use ERP packages.

UNIT I

Nature and Types of Business Organizations - Introduction to Business Process -

Organization Structure Definition Complexity Formalization Outcomes for

Individuals Size Technology Internal Culture Environment National Cultures

IT Industry Scenario.

UNIT II

Recognizing a Creation Company – The WHOOSH Beginners Mind – Creation

Company Vs. Compliance Company.

UNIT III

Becoming a Creation Company Choosing to change the Art of Collaboration Models.

Leading a Creation Company Freedom and Focus Creation Leadership.

UNIT IV

Introduction to Business Process Reengineering Business Process Reengineering

through IT People view Case Study Empowering through IT.

UNIT V

Introduction to e-Business Rules of e-Business e-Business Execution Framework -

Trend Spotting Construction Steps of e-Business Design Case Studies: Constructing

the e-Business Architecture.

103

REFERENCE BOOKS:

1. Richard H. Hall, Organizations, Structures, Processes, and Outcomes, Pearson

Education, 2001.

2. M. S. Jayaraman et. al., Business Process Reengineering, Tata McGraw Hill

publications, 2001.

3. Tom McGehee, Whoosh: Business in the Fast Lane, Perseus Publication, 2002.

4. R. Kalakota and M. Robinson, e-Business: Roadmap for Success, Pearson

Education, 2000.

WEB RESOURCES:

1. http://erpstudymaterial.weebly.com/study-material-in-pdf.html

2. https://www.studynama.com/community/threads/372-Enterprise-resource-planning-

%28ERP%29-pdf-notes-ebook-download-for-mba

104



SEMESTER-V

ELECTIVE COURSE-VIII : SOFT COMPUTING


COURSE OBJECTIVES

• To know the key techniques of soft computing

• To know about the components of genetic algorithm.

• To understand the features of neural network and its applications

• To study to fuzzy logic components.

• To gain insight onto neuro fuzzy modeling and control.

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

COURSE OUTCOMES


• Implement machine learning through neural networks.

• Apply Genetic Algorithms.

• Write Genetic Algorithm to solve the optimization problem

• Use fuzzy concepts.

• Develop a Fuzzy expert system to derive decisions.

UNIT I

INTRODUCTION TO SOFT COMPUTING:Evolution of Computing - Soft

Computing Constituents – From Conventional AI to Computational Intelligence - Machine

Learning Basics.

UNIT II

GENETIC ALGORITHMS: Introduction, Building Block Hypothesis, Working

Principle, Basic Operators and Terminologies like Individual, Gene, Encoding, Fitness

Function and Production, Genetic Modeling: Significance of Genetic Operators, Inheritance

Operator, Crossover, Inversion & Deletion, Mutation Operator, Bitwise Operator, GA

Optimization Problems, JSPP (Job Shop Scheduling Problem), TSP (Travelling Salesman

Problem), Differences & Similarities between GA & other Traditional Methods, Applications

of GA.

UNIT III

NEURAL NETWORKS: Machine Learning using Neural Network, Adaptive

Networks – Feed Forward Networks– Supervised Learning Neural Networks – Radial Basis

Function Networks - Reinforcement Learning– Unsupervised Learning Neural Networks –

Adaptive Resonance Architectures – Advances in Neural Networks.

UNIT IV

FUZZY LOGIC: Fuzzy Sets – Operations on Fuzzy Sets – Fuzzy Relations –

Membership Functions-Fuzzy Rules and Fuzzy Reasoning – Fuzzy Inference Systems –

Fuzzy Expert Systems – Fuzzy Decision Making.

105

UNIT V

NEURO-FUZZY MODELING: Adaptive Neuro-Fuzzy Inference Systems –

Coactive Neuro-Fuzzy Modeling – Classification and Regression Trees – Data Clustering

Algorithms – Rule base Structure Identification – Neuro-Fuzzy Control – Case Studies.

REFERENCE BOOKS:

1. S. Rajsekaran & G.A. Vijayalakshmi Pai, “Neural Networks,Fuzzy Logic and Genetic

Algorithm:Synthesis and Applications”, Prentice Hall of India.

2. Jyh-Shing Roger Jang, Chuen-Tsai Sun, EijiMizutani, “Neuro-Fuzzy and Soft

Computing”, Prentice-Hall of India, 2003.

3. Kwang H.Lee, “First course on Fuzzy Theory and Applications”, Springer Verlag

Berlin Heidelberg, 2005.

4. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”,

Prentice Hall, 1995.

5. S.N.Sivanandam, S.N.Deepa, “Introduction to Genetic Algorithms”, Springer, 2007

6. James A. Freeman and David M. Skapura, “Neural Networks Algorithms,

Applications, and Programming Techniques”, Pearson Edn., 2003.

7. David E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine

Learning”, Addison Wesley, 2007.

8. Mitsuo Gen and Runwei Cheng, “Genetic Algorithms and Engineering Optimization”,

Wiley Publishers 2000.

9. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.

WEB RESOURCES:

1. https://www.nitw.ac.in/media/Scheme&Syllabus-2012/MCA%202012-13.pdf

2. http://www.bbau.ac.in/new/dept/CS/Syllabus%20MCA.pdf

3. http://www.myreaders.info/html/soft_computing.html

4. https://www.studynama.com/community/threads/224-Soft-computing-pdf-lecture-

notes-ebook-download

106



SEMESTER-V

ELECTIVE COURSE-VIII: GEOGRAPHIC INFORMATION SYSTEM


COURSE OBJECTIVES:

• To understand the basic concepts of Geographic information systems.

• To get an exposure to data structures for GIS.

• To know about the input, verification, storage and output for GIS.

• To introduce the concept of spatial interpolation and digital elevation.

• To realize the spatial data modeling and data analysis part of GIS.

COURSE OUTCOMES:


• Explain and comprehend the GIS concepts, hardware and software requirements for

GIS.

• Design data structures for GIS with respect to different types of data.

• Prepare input data and perform verification.

• Apply data correction before output preparation.

• Perform vector data analysis and output functions.

• Carryout spatial interpolation, spatial modelling and analysis.

• Design a GIS model for real world problem.

UNIT I

BASICS OF GIS: Definition - Usefulness of GIS - Components of GIS - Computer

Hardware, Software Modules and Organizational Context of GIS.

UNIT-II

DATA STRUCTURE: Data Structure in GIS - Types of Data (Points, Lines and

Polygons)- Database Structures (Raster Data Structures and Vector data Structures) - Data

Conversion, (Vector to Raster and Raster to Vector).

UNIT III

DATA INPUT, VERIFICATION, STORAGE AND OUTPUT: Spatial Data Input

Processes and Devices (Sources of Data, - Different Types of Data Entry Methods, viz.,

Manual Input, Run Length Code, Digitization, Automated Scanning, etc. – Vector to Raster

Conversion – Raster to Vector Conversion - Input devices) - Entry of Non-Spatial Data –

Linking of Spatial & Non-Spatial Data – Data Verification (Errors of different types) –

Correction (Rubber Sheet Transformation, Bilinear Interpolation, Cubic Convolution, etc.) –

GIS capabilities for Data correction – Data Output (Types of Output, GIS Capabilities for

Output, Output devices).

UNIT IV

METHODS OF SPATIAL INTERPOLATION AND DIGITAL ELEVATION

MODEL: Spatial Interpolation: Basic Principles of Interpolation – Methods of Interpolation

(Interpolation by Joining Boundaries, viz., Simple Vector Maps, Theisson Polygons) – Global

Methods of Interpolation, Local Interpolation (Trend Surface Analysis) – Local Interpolation

107

(Splines) - Optimal Interpolation (Kriging). Digital Elevation Modeling: Need for Three

Dimensional Models - Methods of DEM - Products of DTM (Contour Maps, Shaded Relief

Map, Maps Related to Slopes, Line of Sight Maps, Drainage Analysis, Volume Estimation,

etc.) - Usefulness of DEM/DTM.

UNIT V

DATA ANALYSIS AND SPATIAL MODELING: Simple Data Retrieval – Data

Retrieval through Boolean Logic – Map Overlaying and Cartographic Modeling (Two layers,

Multiple Layers, Binary, Index, Regression, and Process Models) – Overlay Analysis,

Capabilities (Point Operations, Regional Operations, Neighbourhood Operations) – Buffering

– Cartographic Modeling using Natural Language Commands – Advantages and

Disadvantages of Carto Modeling – Network Analysis.

REFERENCE BOOkS:

1. Burrough, P.A, “Principles of Geographical Information Systems for Land Resources

Assessment”, Clarandone Press, Oxford, 1986.

2. Kang - Tsung Chang, “Introduction to Geographic Information System”, MC Graw

Hill, Boston. 2002.

3. Campbell, J, “Introductory Cartography”, Printers Hall Englewood Cliffs, N.J, 1984.

4. Dent B.D, “Principles of Thematic Map Design”, Addition - Wesley, Reading, Mass.

1985.

5. Freeman, H and Pieroni, GG., “Map Data Processing”, Academic Press, New York.

1980.

6. Monmonier, M.A, “Computer Assisted Cartography - Principles and Prospects”,

Prentice Hall, Englewood Cliffs, NJ, 1982.

7. Tomlinson, R.F Calkins, H.S and. Marble, D.F, “Computer Handling of Geographic

Data”, UNESCO, Geneva. 1976.

WEB RESOURCES:

1. https://ocw.mit.edu/resources/res-str-001-geographic-information-system-gis-tutorial-

january-iap-2016/introduction-to-gis/

2. http://opensourcegis.org

3. http://ocw.usu.edu/instructional-technology-learning-sciences/blogs-wikis-new-

media-for-learning/gis.htm

108

COURSE OBJECTIVES:

• To understand the basic concepts of mobile computing

• To learn the basic concepts of MAC protocols.

• To have an exposure about wireless protocols - Bluetooth, WAP, ZigBee issues.

• To appreciate the Network, Transport Functionalities of Mobile communication

• To learn the GSM, GPRS Architecture and UMTS

• To understand the concepts of Adhoc and wireless sensor networks.

• To gain knowledge about different mobile platforms and application development

COURSE OUTCOMES:


• Relate the knowledge about various types of Wireless Data Networks and Wireless

Voice Networks to the present scenario.

• Demonstrate the architectures, challenges and the Solutions of Wireless

Communication those are in use.

• Utilize the role of Wireless Protocols in shaping the future Internet.

• Define the different types of Wireless Communication Networks and their

functionalities.

• Develop simple Mobile Application Using Android

• Use simulator tools and design Ad hoc networks

• Develop a mobile application.

UNIT – I

INTRODUCTION: Mobile Computing – Mobile Computing Vs Wireless

Networking – Mobile Computing Applications – Characteristics of Mobile Computing –

Structure of Mobile Computing Application. MAC Protocols – Wireless MAC Issues – Fixed

Assignment Schemes – Random Assignment Schemes – Reservation Based Schemes.

UNIT – II

MOBILE INTERNET PROTOCOL AND TRANSPORT LAYER: Overview of

Mobile IP – Features of Mobile IP – Key Mechanism in Mobile IP – Route Optimization.

Overview of TCP/IP – Architecture of TCP/IP – Adaptation of TCP Window – Improvement

in TCP Performance.

UNIT – III

MOBILE TELECOMMUNICATION SYSTEM: Global System for Mobile

Communication (GSM) – General Packet Radio Service (GPRS) – Universal Mobile

Telecommunication System (UMTS).



SEMESTER-V

ELECTIVE COURSE-VIII : MOBILE COMPUTING


109

UNIT – IV

MOBILE AD-HOC NETWORKS: Ad-Hoc Basic Concepts – Characteristics –

Applications – Design Issues – Routing – Essential of Traditional Routing Protocols –

Popular Routing Protocols – Vehicular Ad Hoc networks (VANET) – MANET Vs VANET –

Security.

UNIT – V

MOBILE PLATFORMS AND APPLICATIONS: Mobile Device Operating

Systems – Special Constrains & Requirements – Commercial Mobile Operating Systems –

Software Development Kit: iOS, Andriod, BlackBerry, Windows Phone – M-Commerce –

Structure – Pros & Cons – Mobile Payment System – Security Issues.

REFERENCE BOOKS:

1. Prasant Kumar Patttnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI

Learning Pvt. Ltd. New Delhi – 2012.

2. Dharma Prakash Agarvel, Qing and An Zeg, “Introduction to Wireless and Mobile

Systems”, Thomson Asia Pvt Ltd, 2005.

3. Uwe Hansmann, Lothar Merk, Martin S.Nicklons and Thomas Stober, “Principles of

Mobile Computing”, Springer, 2003.

4. William.C.Lee, “Mobile Cellular Telecommunications-Analog and Digital Systems”,

Second Edition, Tata Mc Graw Hill Edition, 2006.

5. C.K.Toh, AdHoc Mobile Wireless Networks”, First Edition, Pearson Education,

2002.

WEB RESOURCES:

1. https://www.tutorialspoint.com/mibliecomputing

2. https://edunotes.in/mobile-computing

3. https://www.readorrefer.in/arcticle/mobile-computing

4. https://textofvideos.nptel.iitm.ac.in

MASTER OF COMPUTER APPLICATIONS (MCA) Degree Programme · 2019-06-12 · • To excel in logical...

Documents

Transcript of MASTER OF COMPUTER APPLICATIONS (MCA) Degree Programme · 2019-06-12 · • To excel in logical...