ACADEMIC REGULATIONS, PROGRAM STRUCTURE AND SYLLABUS pdf/MCA/AR19 MCA... · MASTER OF COMPUTER...

ACADEMIC REGULATIONS,

PROGRAM STRUCTURE

AND SYLLABUS

For

MCA THREE YEARS DEGREE PROGRAM

(Applicable to the batches admitted from 2019-20)

ADITYA ENGINEERING COLLEGE An Autonomous Institution

Approved by AICTE, Affiliated to JNTUK & Accredited by NBA, NAAC with 'A' Grade

Recognized by UGC under the sections 2(f) and 12(B) of UGC act 1956

Aditya Nagar, ADB Road, SURAMPALEM - 533 437

MASTER OF COMPUTER

APPLICATIONS

AR19 MCA

Aditya Engineering College (A) 1

ABOUT ADITYA ENGINEERING COLLEGE

ADITYA ENGINEERING COLLEGE (AEC) was established in 2001 at

Surampalem, Kakinada, Andhra Pradesh in 125 Acres of pollution free and lush green

landscaped surroundings by the visionaries of Aditya Academy who are in the

glorious service field of education since last 33 years.

AEC believe in the holistic development of society at large and are

researching its efforts in multi-disciplinary activities. We shoulder the responsibility

of shaping the Intellect, Character and Physique of every student, because we believe

that these students would be the architects to develop a humanized and harmonious

society, and the nation as a whole.

Our vision is to impart education, in a conductive ambience, as comprehensive

as possible, with the support of all the modern technologies and produce graduates

and post graduates in engineering with the ability and passion to work wisely,

creatively, and effectively for the betterment of our society. It is our endeavor to

develop a system of Education which can harness students’ capabilities and the

muscles of the mind thoroughly trained to enable it to manifest the great feats of

intellectualism which it is capable of.

SALIENT FEATURES:

• An Autonomous Institution.

• Accredited by NAAC with “A” Grade in 2015 and NBA in 2008.

• Recognized by UGC under sections 2(f) & 12(B).

• Affiliated to JNTUK, Kakinada.

• Recognized by Scientific and Industrial Research Organizations (SIROs) of

Department of Scientific and Industrial Research, Ministry of Science and

Technology, Govt. of India.

• Rated as “GOLD” Category institute by AICTE-CII Survey of Industry –

Linked Technical Institutes 2016.

• Bagged Grade “A” (top grade) by the Govt. of A.P.

• Dept. of Science and Technology under Technology Development Board has

sanctioned Incubation Centre and only one College in the state received this

financial Assistance.

• Best Rankings & Ratings given to Aditya by reputed Magazines & journals in

their surveys :

AR19 MCA


➢ Grade AAA by careers 360.

➢ One of the best 20 Engineering colleges in India by The Sunday

Indian.

➢ South India IV rank by Digital Mailers.

➢ South India VI rank by Silicon India.

➢ India 13th Rank out of top 25thEngineering Colleges by 4Ps.

➢ Asia’s Top 100 colleges by WCRC Leaders.

➢ Higher Education Review 35thRank in India.

➢ South India’s 68thRank, India’s 99th Rank by the Week magazine.

➢ 8thRank in providing high quality infrastructure out of 10 engineering

Colleges in India by The Week magazineand more …….

• The college has students from 17 states across India & 13 foreign countries.

• 150+ foreign students.

• Honored with Best Placement Award by Chief Minister of Andhra Pradesh.

• Only one college in AP received Best Performance Award from Tech

Mahindra for its outstanding achievement in campus placements.

• Remarkable achievement of campus placements in CMM Level 5 Companies

• Students received Gold Medals at University level.

• Offering most job potential engineering courses of Petroleum Engineering,

Mining Engineering, and Agricultural Engineering in addition to the regular

courses of Mechanical, Civil, and EEE, ECE, CSE and IT at UG, PG and

Diploma Levels.

• Skill Development Centre with the collaboration of Govt. of A.P. (APSSDC)

• Siemens Centre of Excellence Campus.

• PMKVY Skill Development Centre Campus.

• South India’s first Microsoft Ed-vantage Platinum Campus.

• Campus of Microsoft innovation centre.

• Adobe’s Centre of Excellence Campus.

• Campus of CISCO Networking Academy.

• MOU with 4 Foreign Universities.

• MOU with Educational Consultants India Ltd., (EdCil).

• On campus Nationalized Bank with 8 ATMs facility.

• On campus hostels with world class infrastructure facilities &50+ resident

staff.

• Own transportation facility to pickup and drop the students and staff covering

all the villages in the District with more than 60 buses.

AR19 MCA


ADITYA ENGINEERING COLLEGE An Autonomous Institution

ACADEMIC REGULATIONS (AR19) FOR MCA

Applicable to the students of MCA admitted from the academic year 2019-20 onwards

1. AWARD OF MCA DEGREE

A student will be declared eligible for the award of MCA Degree if he fulfills the

following academic regulations.

1.1 If he pursued a program of study in not less than three and not more than six

academic years. After six academic years from the year of admission, he shall

forfeit his seat in MCA and his admission stands cancelled.

1.2 The student shall register for all 110 credits and secure all the 110 credits.

1.3 For Lateral Entry, the student must register for all 71 credits and secure all the 71

credits from III to VI Semesters of MCA.

2. EVALUATION - DISTRIBUTION AND WEIGHTAGE OF MARKS

2.1 The performance of a student in each semester shall be evaluated course-wise

with a maximum of 100 marks for Theory courses, Practical courses, Seminar and

Major Project.

2.2 For the theory courses, the distribution shall be 40 marks for Sessional

examinations and 60 marks for Semester End Examinations. The Sessional marks

shall be awarded based on the average of the marks secured in two Sessional

examinations. The first Sessional examination is conducted for first 2 ½ units and

second Sessional examination for remaining 2 ½ units for each course in a

semester. Each Sessional examination shall be conducted for duration of 120

minutes with 4 questions (no choice), each question is for 10 marks. The

Semester End examination is conducted for 60 marks for a duration of 180

minutes, which contains ten questions, two questions are from each unit and each

question may have sub-questions. The student has to write one question from

each unit. Each question carries 12 marks.

2.3 For practical courses, there shall be continuous evaluation during the semester for

40 Sessional marks and 60 End examination marks. The Sessional 40 marks shall

be awarded as, continuous evaluation -15 marks, Record-10 marks and laboratory

Exam -15 marks. The End examination shall be conducted by the concerned

teacher and external examiner appointed by the Principal from a panel of three

examiners submitted by HOD.

AR19 MCA


2.4 For Seminar in VI Semester, a student under the supervision of a faculty member

shall collect the literature on a topic and critically review the literature and submit

it to the department in a report form and shall make an oral presentation before

the Project Review Committee (PRC) consisting of Head of the Department,

Supervisor and two other senior faculty members of the department. For Seminar

there will be only internal evaluation for 100 marks. A candidate has to secure a

minimum of 50% of marks to be declared successful.

2.5 Students opting MOOCs as Elective Course should register and participate in 12

weeks courses in NPTEL / SWAYAM etc. with the approval of the Head of the

Department. The Head of the Department shall appoint one mentor for each of the

MOOCs offered. During the course, the mentor monitors the student’s assignment

submission at the end of every week. The student needs to submit all the

assignments given and needs to take final exam at the proctor center. The student

needs to earn a certificate by passing the examination. The student will be

awarded the credits given in the curriculum only upon submission of the

certificate.

2.6 For Major Project, there shall be continuous assessment during VI semester. The

Sessional Evaluation for 40 marks shall be done by the PRC based on two

presentations given by each student on the topic of his project. The End

Examination (Viva-Voce) for 60 marks shall be conducted by the committee that

consists of an External Examiner, Head of the Department and Supervisor of the

Project. For the Viva-Voce, every student shall submit a thesis or dissertation on

the topic approved by the PRC.

2.6.1 Registration of Dissertation: A student is permitted to register for the project

work after satisfying the attendance requirements of all the courses up to V

semester.

2.6.2 A student has to submit, in consultation with his project supervisor, the title,

objective and plan of action of his project work for approval. The student has to

initiate the Project work, only after obtaining the approval from the PRC after the

V Semester end examinations. The project duration is for one semester.

2.6.3 If a student wishes to change his supervisor or topic of the project, he can do so

with the approval of the PRC. However, the PRC shall examine whether or not

the change of topic / supervisor leads to a major change of his initial plans of

project proposal. If yes, his date of registration for the project work starts from the

AR19 MCA


date of change of Supervisor or topic as the case may be.

2.6.4 A student shall submit his status report at least with 2 reviews conducted by the

PRC with a gap of one month between them. The Sessional Evaluation shall be

made on the basis of these reviews and on the progress of the work evaluated by

PRC.

2.6.5 A student is permitted to submit Project Thesis only after successful completion

of theory and practical courses with the approval of PRC and not earlier than 20

weeks from the date of registration of the project work.

2.6.6 Three copies of the Project Thesis certified by the supervisor shall be submitted

to the College along with Plagiarism report (< 40%).

2.6.7 The external examiner shall be appointed by the Principal from the panel of

three examiners, who are eminent in that particular field given by the Head of

the Department. The project thesis is sent to the same examiner for the

adjudication.

2.6.8 If the report of the examiner is favorable, Viva–Voce examination shall be

conducted by PRC and the examiner who adjudicated the Thesis.

a. Student has to secure 40% of marks in the Viva–Voce examination and a

minimum aggregate of 50% of total marks in Viva–Voce examination and

Sessional evaluation taken together.

b. If the report of the Viva–Voce is fail, the student shall retake the Viva–Voce

examination only after three months. If he fails to get a satisfactory report at

the second Viva–Voce examination, the student has to re-register for the

project and complete the project within the stipulated time after taking the

approval from the Principal.

2.6.9 If the report of the examiner is unfavorable, the student shall revise and

resubmit the Thesis, in the time frame as decided by the PRC. If the report of

the examiner is unfavorable again, the thesis shall be summarily rejected. The

student has to re-register for the project and complete the project within the

stipulated time after taking the approval from the Principal.

3 ATTENDANCE REQUIREMENTS

3.1 A student shall be eligible to write the Semester End Examinations if he acquires

a minimum of 50% of attendance in each course and 75% of attendance in

aggregate of all the courses.

AR19 MCA


3.2 Condonation of shortage of attendance in aggregate up to 10% (65% and above

and below 75%) on medical grounds in a semester may be granted by the College

Academic Committee and a student can be condoned for a maximum of two times

only.

3.3 Shortage of Attendance below 65% in aggregate shall not be condoned.

3.4 Students whose shortage of attendance is not condoned in any semester are not

eligible to write their End examinations of that semester.

3.5 A medical certificate and a fee of Rs. 500/- shall be payable towards condonation

for the shortage of attendance.

3.6 A student will be promoted to the next semester if he satisfies the attendance

requirement of the present semester.

3.7 If any student fulfils the attendance requirement in the present semester, he shall

not be eligible for re-admission into the same semester.

3.8 A student who has shortage of attendance in a semester may seek re-admission

into that semester when offered within 4 weeks from the date of the

commencement of classwork.

4 MINIMUM ACADEMIC REQUIREMENTS

The following academic requirements have to be fulfilled by the students in addition

to the attendance requirements mentioned in item no.3.

4.1 A student is deemed to have passed a course and earns the credits allotted to that

course by securing not less than 40% of marks in the End examination, and a

minimum 50% of marks of the total marks (sum of Sessional marks and End

examination marks).

4.2 All the credit courses shall be considered for the calculation of SGPA and CGPA.

5 RE-REGISTRATION FOR IMPROVEMENT OF SESSIONAL MARKS

Following are the conditions to avail the benefit of improvement of Sessional marks.

5.1 A student shall be given one chance to re-register for each course provided the

Sessional marks secured by a student are less than 50% and has failed in the End

examination.

5.2 For re-registration, the student has to get approval from the Principal and has to

pay the requisite fee which is of one third of the semester tuition fee before the

start of the semester in which re-registration is required.

5.3 At any time, a student is permitted to re-register for a maximum of two courses in

addition to the regular semester.

AR19 MCA


5.4 In the event of the student taking re-registration, his Sessional marks and End

examination marks obtained in the previous attempt stand cancelled in that

course(s). The attendance shall be calculated separately for the re-registered

courses.

5.5 If the student gets required minimum attendance in any re-registered course(s), he

shall be eligible for writing the End examination in that course(s). Otherwise, he

shall not be permitted to write the End examination in that course(s). He shall re-

register again in that course(s) when next offered.

6 PROGRAM PATTERN

6.1 The entire program of study is for three academic years and all the years are in

semester pattern.

6.2 The medium of instruction for the entire program will be in English only.

6.3 A student is eligible to appear for the End examination in a course but absent from

it or has failed in the End examination, may write the examination in that course

when conducted next.

6.4 When a student is detained due to shortage of attendance, he may be re-admitted

into the same semester in which he has been detained.

7 AWARD OF DEGREE AND CLASS

After a student has satisfied the requirements prescribed for the completion of the

program and is eligible for the award of MCA degree, he shall be placed in one of the

following three classes:

Class Awarded CGPA secured

First Class with Distinction ≥ 7.75

First Class ≥ 6.75 to < 7.75

Second Class ≥ 5.75 to < 6.75

7.1 Cumulative Grade Point Average (CGPA)

The following procedure is to be adopted to compute the Semester Grade

Point Average (SGPA) and Cumulative Grade Point Average (CGPA).

AR19 MCA


For Credit Courses:

Range of Marks

(%)

Letter

Grade Level Grade Point

≥ 90 O Outstanding 10

≥ 80 to < 90 A+ Excellent 9

≥ 70 to < 80 A Very Good 8

≥ 60 to < 70 B+ Good 7

≥ 50 to < 60 B Fair 6

< 50 F Fail 0

AB Absent 0

COMPUTATION OF SGPA

The SGPA is the ratio of sum of the product of the number of credits with

the grade points scored by a student in all the courses taken by a student and

the sum of the number of credits of all the courses undergone by a student,

i.e.

=)(

).()(

i

ii

iC

GCSSGPA

Where Ci is the number of credits of the ith course and

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

COMPUTATION OF CGPA

i. The CGPA is also calculated in the same manner taking into

consideration all the courses undergone by a student over all the

semesters of the program, i.e.

=)(

).(

i

ii

C

SCCGPA

Where Si is the SGPA of the ith semester and

Ci is the total number of credits in that semester

ii. The SGPA and CGPA shall be rounded off to 2 decimal points and reported in

the transcripts.

iii. Grade Point Average can be converted into equivalent percentage using

Percentage of Marks = (CGPA - 0.75) x 10

AR19 MCA


8 MINIMUM INSTRUCTION DAYS

The minimum instruction days for each semester shall be 90 working days.

9 WITHHOLDING OF RESULTS

If the student has any dues in the college or involved in

indisciplinary/malpractice/court cases, his result will be withheld.

10 TRANSITORY REGULATIONS

Discontinued or detained students are eligible for re-admission into same or

equivalent courses as and when offered.

11 GENERAL

11.1 Wherever the words "he", "him", "his", occur in the regulations, they include

"she", "her", "hers".

11.2 The academic regulations should be read as a whole for the purpose of any

interpretation.

11.3 In case of any doubt or ambiguity in the interpretation of the above rules, the

decision of the Academic Council is final.

11.4 The college may change or amend the academic regulations or syllabi as and

when the need arises, and the changes or amendments made shall be applicable

to all the students with effect from the dates notified by the College.

***

AR19 MCA


Ragging Prohibition of ragging in

educational institutions Act 26 of 1997

Salient Features Ragging within or outside any educational institution is prohibited.

Ragging means doing an act which causes or is likely to cause Insult or Annoyance of Fear or

Apprehension or Threat or Intimidation or outrage of modesty or Injury to a student

Imprisonment Upto Fine Upto

+

+

+

+

+

Assaulting or Using

Criminal force or

Criminal intimidation

1 Year

Rs. 2,000/-

Wrongfully

restraining or

confining or causing

hurt

Rs. 5,000/-

2 Years

Causing grievous hurt,

kidnapping or Abducts

or rape or committing

unnatural offence

Rs. 10,000/-

5 Years

Causing death or

abetting suicide

Rs. 50,000/-

10 Years

In Case of Emergency CALL TOLL FREE NO. : 1800 - 425 - 1288

LET US MAKE ADITYA A RAGGING FREE CAMPUS

6 Months

Rs. 1,000/-

Teasing, Embarrassing

and Humiliation

AR19 MCA


Ragging ABSOLUTELY

NO TO RAGGING

1. Ragging is prohibited as per Act 26 of A.P.

Legislative Assembly, 1997.

2. Ragging entails heavy fines and/or imprisonment.

3. Ragging invokes suspension and dismissal from the

College.

4. Outsiders are prohibited from entering the College

and Hostel without permission.

5. Girl students must be in their hostel rooms by 7.00

p.m.

6. All the students must carry their Identity Cards and

show them when demanded

7. The Principal and the Wardens may visit the

Hostels and inspect the rooms any time.

LET US MAKE ADITYA A RAGGING FREE CAMPUS

In Case of Emergency CALL TOLL FREE NO. : 1800 - 425 - 1288

AR19 MCA


VISION & MISSION OF THE COLLEGE

VISION

To induce higher planes of learning by imparting technical education with International

standards, Applied research, Creative ability and Value based instruction to emerge as a

premier institute.

MISSION

Achieving academic excellence by providing globally acceptable technical education by

forecasting technology through

- Innovative research & development

- Industry institute interaction

- Empowered manpower

AR19 MCA


PROGRAM STRUCTURE

I SEMESTER

Course

Code Name of the Course

Total Number of contact hours Credits

(C) Lecture

(L)

Tutorial

(T)

Practice

(P)

Total

Hours

193MC1T01 Problem Solving with C 3 0 0 3 3

193MC1T02 Computer Organization 3 0 0 3 3

193MC1T03 Discrete Mathematical

Structures 3 0 0 3 3

193MC1T04 Probability and Statistics 3 0 0 3 3

193MC1T05 Accounting and Financial

Management 3 0 0 3 3

193MC1L01 English Language

Communication Skills Lab 0 0 3 3 1.5

193MC1L02 Problem Solving with C Lab 0 0 3 3 1.5

193MC1L03 IT Workshop (Lab) 0 0 3 3 1.5

TOTAL 15 0 9 24 19.5

II SEMESTER

Course



(C) Lecture

(L)

Tutorial

(T)

Practice

(P)

Total

Hours

193MC2T06 Data Structures 3 0 0 3 3

193MC2T07 Operating Systems 3 0 0 3 3

193MC2T08 Software Engineering 3 0 0 3 3

193MC2T09 OOP Through Java 3 0 0 3 3

193MC2T10 Optimization Techniques 3 0 0 3 3

193MC2L04 OOP Through Java Lab 0 0 3 3 1.5

193MC2L05 Data Structures Lab 0 0 3 3 1.5

193MC2L06 Operating Systems and

Linux Lab 0 0 3 3 1.5

TOTAL 15 0 9 24 19.5

III SEMESTER

Course



(C) Lecture

(L)

Tutorial

(T)

Practice

(P)

Total

Hours

193MC3T11 Database Management

Systems 3 0 0 3 3

193MC3T12 Computer Networks 3 0 0 3 3

193MC3T13 Design & Analysis of

Algorithms 3 0 0 3 3

193MC3T14 Advanced Java Programming 3 0 0 3 3

193MC3T15 Object Oriented Analysis and

Design 3 0 0 3 3

193MC3L07 Database Management

Systems Lab 0 0 3 3 1.5

193MC3L08 Advanced Java Programming

Lab 0 0 3 3 1.5

193MC3L09 OOAD through UML Lab 0 0 3 3 1.5

TOTAL 15 0 9 24 19.5

AR19 MCA


IV SEMESTER

Course



(C) Lecture

(L)

Tutorial

(T)

Practice

(P)

Total

Hours

193MC4T16 Data Warehousing & Data

Mining 3 0 0 3 3

193MC4T17 Full Stack Technologies 3 0 0 3 3

193MC4T18 Python Programming 3 0 0 3 3

Elective – I

193MC4E01 Embedded Computing

3 0 0 3 3 193MC4E02 Artificial Intelligence

193MC4E03 MOOCs-1

Elective – II

193MC4E04 Cloud Computing

3 0 0 3 3 193MC4E05 Multimedia Application

Development

193MC4E06 MOOCs-2

193MC4L10 Full Stack Technologies Lab 0 0 3 3 1.5

193MC4L11 Data Mining with R Lab 0 0 3 3 1.5

193MC4L12 Python Programming Lab 0 0 3 3 1.5

TOTAL 15 0 9 24 19.5

V SEMESTER

Course



(C) Lecture

(L)

Tutorial

(T)

Practice

(P)

Total

Hours

193MC5T19 Cryptography and Network

Security 3 0 0 3 3

193MC5T20 Big Data Analytics 3 0 0 3 3

193MC5T21 Machine Learning 3 0 0 3 3

Elective – III

193MC5E07 Digital Marketing

3 0 0 3 3 193MC5E08 Natural Language Processing

193MC5E09 MOOCs-3

Elective – IV

193MC5E10 Internet of Things

3 0 0 3 3 193MC5E11 DevOps

193MC5E12 MOOCs-4

193MC5L13 Cryptography and Network

Security Lab 0 0 3 3 1.5

193MC5L14 Big Data Analytics Lab 0 0 4 4 2

193MC5L15 Machine Learning with

Python Lab 0 0 3 3 1.5

TOTAL 15 0 10 25 20

AR19 MCA


VI SEMESTER

Course



(C) Lecture

(L)

Tutorial

(T)

Practice

(P)

Total

Hours

193MC6R01 Project Seminar 0 0 0 0 2

193MC6P01 Dissertation/ Thesis 0 0 0 0 10

TOTAL 0 0 0 0 12

MC: Mandatory Courses; MOOCs: Massive Open Online Courses; PROJ: Project.

AR19 MCA


PROBLEM SOLVING WITH C

I Semester L T P C

Course Code: 193MC1T01 3 0 0 3

Course Objectives:

COB 1: To impart adequate knowledge on the need of programming languages and

problem solving techniques and develop programming skills.

COB 2: To enable effective usage of Control Structures and Implement different

operations on arrays.

COB 3: To Demonstrate the use of Strings and functions.

COB 4: To impart the knowledge of pointers and understand the principles of

dynamic memory allocation.

COB 5: To Understand structures and unions.

Course Outcomes:

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

CO 1: Illustrate the Fundamental concepts of Computers and basics of computer

programming

CO 2: Make Use of Control Structures and Arrays in solving complex problems.

CO 3: Develop modular program aspects and Strings fundamentals.

CO 4: Demonstrate the ideas of pointers usage.

CO 5: Solve real world problems using the concept of Structures &Unions

operations.

Mapping of Course Outcomes with Program Outcomes

Mapping of Course Outcomes with Program Specific Outcomes

CO / PSO PSO 1 (K3) PSO 2 (K3) PSO 3 (K3)

CO1(K2) 2 2 2

CO2(K3) 3 3 3

CO3(K3) 3 3 3

CO4(K2) 2 2 2

CO5(K3) 3 3 3

UNIT-I:

Introduction to Computers: Introduction to computer programming, Algorithm, flow

chart, Program development steps. Computer languages: Machine level, Assembly level

and High- level language. Number System: Conversions- decimal, binary, octal,

hexadecimal. ‘C’ Fundamentals: Structure of a C-program, C-character set, C Tokens-

variables, constants, identifiers, data types and sizes, operators.

CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO11

(K3)

CO1(K2) 2 1 - - 1 - - - - - -

CO2(K3) 3 2 1 1 3 - - - - - -

CO3(K3) 3 2 1 1 3 - - - - - -

CO4(K2) 2 1 - - 2 - - - - - -

CO5(K3) 3 2 1 1 3 - - - - - -

AR19 MCA


UNIT-II:

I/O Functions: Header files, Standard I/O library functions-formatted I/O functions.

Decision making statements: simple if, if-else, nested if-else, else-if ladder, switch-

case statements and sample programs. Iterative Statements: for, while, do-while.

Jump Statements-break, continue, go to.

UNIT-III: Arrays: declaration, initialization, storing and accessing elements of 1-D, 2-D and

multidimensional arrays, Array Applications: addition, multiplication, transpose,

symmetry of a matrix, Strings: declaration, initialization, reading and writing

characters into strings, string operations, character and string manipulation functions.

UNIT-IV:

Functions- declaration, definition, prototype, function call, return statement, types of

functions, parameter passing methods, and function recursion, Pre-processor: #define,

#include Statement, #ifdef, #endif, and storage classes.

UNIT-V: Structure and Union: Declaration, initialization, storing and accessing elements by

using structure and union, Pointers: Introduction to pointers, defining a pointer

variable, Pointer to Pointer, Examples of pointers, using pointers in expressions,

pointers and arrays. Files: Definition, Input and output operation into file.

Text Books:

1. Programming in C, 3rdedition, Ashok N. Kamthane, Pearson.

2. Computer science, A structured programming approach using C, Third edition,

3. B.A. Forouzan and R. F. Gilberg, Thomson.

Reference Books: 1. The C Programming Language, B.W. Kernighan, Dennis M. Ritchie, PHI/

Pearson.

2. C Programming with problem solving, J.A. Jones & K. Harrow, Dreamtech Press.

3. Programming in C, 3rd Edition, Stephen G. Kochan, Pearso.

Web Links:

1. http://www.c4learn.com/

2. http://www.geeksforgeeks.org/c/

3. http://nptel.ac.in/courses/122104019/

4. http://www.learn-c.org/

5. https://www.tutorialspoint.com/cprogramming/

http://www.geeksforgeeks.org/c/

http://nptel.ac.in/courses/122104019/

http://www.learn-c.org/

https://www.tutorialspoint.com/cprogramming/

AR19 MCA


COMPUTER ORGANIZATION

I Semester L T P C


Course Objectives:

COB 1: To conceptualize the basics of organizational and architectural issues of a

digital computer. .

COB 2: To Learn the function of each element of a memory hierarchy.

COB 3: To Study various data transfer techniques in digital computer

Course Outcomes:


CO 1 : Understand the basic organization of computer, different computer

generations, performance and concept of pipelining

CO 2 : Understand and analyze the concept of segment registers, different

instruction formats and addressing modes.

CO 3 : Understand and analyze various issues related to memory hierarchy.

CO 4 : Evaluate various modes of data transfer between CPU and I/O devices.

CO 5 : Examine various inter connection structures of multi processors


CO/ PO PO1

(K5)

PO2

(K4)

PO3

(K5)

PO4

(K3)

PO5

(K3)

PO6

(K4)

PO7

(K6)

PO8

(K2)

PO9

(K2)

PO10

(K2)

PO11

(K4)

CO1 (K2) 3 - - - - 2 - - - -

CO2 (K2) 3 - 2 - - 2 - - - - -

CO3 (K2) 3 - 2 - - 2 - - - - -

CO4 (K5) 3 - 2 - - 2 - - - - -

CO5 (K4) 3 - 2 - - 3 - - - - -


CO / PSO PSO 1(K4) PSO 2(K 4) PSO 3 (K4)

CO1 (K2) 3 - 2

CO2 (K2) 3 - 2

CO3 (K2) 3 - 2

CO4 (K5) 3 - 2

CO5 (K4) 3 - 2

UNIT-I:

Basic Structure of Computers: Functional unit, Basic Operational concepts, Bus

structures, System Software, Performance- Processor clock, basic performance equation,

pipelining and super scalar operations, clock rate, CISC, RISC, performance

measurement, the history of computer development- generations.

UNIT-II:

Instruction and Instruction Sequencing: Register Transfer Notation, Assembly

Language Notation, Basic Instruction Types, Addressing Modes, Basic Input/output

Operations, role of Stacks and Queues in computer programming equation. Component

of Instructions: Logic Instructions, shift and Rotate Instructions.

AR19 MCA


UNIT-III:

Type of Instructions: Arithmetic and Logic Instructions, Branch Instructions, The

Memory Systems: Basic memory circuits, Memory System Consideration, Read-Only

Memory: ROM, PROM, EPROM, EEPROM, Flash Memory, Cache Memories:

Mapping Functions, interleaving, Secondary Storage: Magnetic Hard Disks, Optical

Disks

UNIT-IV:

Input/ Output Organization: Accessing I/O Devices, Interrupts: Interrupt Hardware,

Enabling and Disabling Interrupts, Handling Multiple Devices, Direct Memory Access,

Buses: Synchronous Bus, Asynchronous Bus, Interface Circuits, Standard I/O

Interface: Peripheral Component Interconnect (PCI) Bus, Universal Serial Bus (USB)

UNIT-V:

Processing Unit: Fundamental Concepts: Register Transfers, Performing an

Arithmetic or Logic Operation, Fetching a Word from Memory, Execution of Complete

Instruction, Hardwired Control, Micro programmed Control: Microinstructions, Micro

program Sequencing, Wide Branch Addressing Microinstructions with next –Address

Field

Text Books:

1. Computer Organization, 5th Edition, Carl Hamacher, Zvonks Vranesic,

SafeaZaky, McGraw Hill.

2. Computer Architecture and Organization,3rd Edition, John P. Hayes, McGraw

Hill.

Reference Books:

1. Computer Organization and Architecture, Sixth Edition, William Stallings,

Pearson/ PHI.

2. Structured Computer Organization, 4th Edition, Andrew S. Tanenbaum, PHI/

Pearson.

3. Fundamentals or Computer Organization and Design, Sivaraama Dandamudi

Springer Int. Edition.

Web Links:


2. http://nptel.ac.in/courses/106103068/2

3. https://onlinecourses.nptel.ac.in/noc17_cs35/preview

4. https://www.coursera.org/learn/comparch

****


http://nptel.ac.in/courses/106103068/2

https://onlinecourses.nptel.ac.in/noc17_cs35/preview

https://www.coursera.org/learn/comparch

AR19 MCA


DISCRETE MATHEMATICAL STRUCTURES

Course Objectives:

COB 1: To introduce the concepts of mathematical logic, graph theory in order to

develop critical thinking towards problem solving.

COB 2: To relate the concepts of discrete mathematics to various domains of

computer science.

COB 3: To provide the necessary back ground of discrete structures with particular

reference to the relationships between discrete structures and their data

structure counterparts including algorithm development.

Course Outcomes:


CO 1: Apply the principles of mathematical logic to statement calculus and

predicate calculus.

CO 2: Apply the principles of set theory and group theory

CO 3: Apply the principles of Binomial theorem and set exclusion-inclusion

principle.

CO 4: Solve recurrence relations by various methods

CO 5: Apply the concepts of graph theory to find euler paths, hamiltonian paths,

spanning trees, minimal spanning trees and chromatic number.

Mapping of Course Outcomes with Program Outcomes:

CO / PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO11

(K3)

CO 1 (K3) 3 2 - - - - - - - - -

CO 2 (K3) 3 2 - - - - - - - - -

CO 3 (K3) 3 2 - - - - - - - - -

CO 4 (K3) 3 2 - - - - - - - - -

CO 5 (K3) 3 2 - - - - - - - - -

Mapping of Course Outcomes with Program Specific Outcomes:

UNIT-I:

Mathematical Logic:

Statements and notations, Connectives, Well formed formulas, Truth tables, tautology,

equivalence implication, Normal forms, Theory of inference for the statement calculus,

Rules of inference, Consistency of premises and indirect method of proof, Automatic

Theorem Proving Predicate calculus: Predicates, statement functions, variables and

quantifiers, predicate formulas, free & bound variables, universe of discourse, inference

theory of predicate calculus.

I Semester L T P C


CO / PSO PSO1 PSO2 PSO3 PSO4

CO 1 (K3) 3 - - -

CO 2 (K3) 3 - - -

CO 3 (K3) 3 - - -

CO 4 (K3) 3 - - -

CO 5 (K3) 3 - - -

AR19 MCA


UNIT-II:

Set theory & Relations:

Introduction, Relations and ordering, Properties of binary Relations, Equivalence,

Compatibility Relations, Partial ordering, Hasse diagram. Functions: composition of

functions, Inverse Function, Recursive Functions, Lattice and its Properties, Pigeon hole

Principles and its application. Algebraic structures: Algebraic systems, Examples and

general properties, Semi groups and monoids, groups, sub groups, Definitions, Examples,

mom orphism, Isomorphism and related problems.

UNIT-III:

Elementary Combinatorics:

Basis of counting, Enumeration of Combinations & Permutations, Enumerating of

Combinations & Permutations with repetitions and constrained repetitions, Binomial

Coefficients, Binomial Multinomial theorems, principles of Inclusion – Exclusion.

UNIT-IV:

Recurrence Relations:

Generating Function of Sequences, Calculating Coefficient of generating functions,

Recurrence relations, Solving recurrence relation by substitution and Generating

functions, the method of Characteristic roots, Solution of Inhomogeneous Recurrence

Relation.

UNIT-V:

Graph Theory:

Representation of Graph, Spanning Trees, BFS, DFS, Kruskals Algorithm, Binary trees,

Planar Graphs, Graph Theory and Applications, Basic Concepts, Isomorphism and Sub

graphs, Multi graphs and Euler circuits, Hamiltonian graphs, Chromatic Numbers.

Text Books:

1. Discrete Mathematical Structures with Applications to computer science J.P

Tremblery, R.Manohar, TMH.

2. Discrete Mathematical for computer Scientists & Mathematicians “ J.L. Molt,

A.Kandel, T.P.Baker, PHI.

Reference Books:

1. Elements of Discrete Mathematics, C L Liu, D P Mohanpatra, TMH.

2. Discrete Mathematics, Schaum’s Outlines, Lipschutz, Lipson, TMH.

3. Discrete Mathematical Structures, 6 th edition, Kolman, Busby, Ross, PHI, 2009.

4. Discrete Mathematics, 6 th edition Johnsonbaugh, Pearson, 2005.

5. Discrete Mathematics, Malik, Sen, 6th ed., Cengage Learning, 2004.

6. Discrete Mathematics for computer science, Bogart, Stein and Drysdale, Springer,

2005.

Web Links:

1. https://en.wikipedia.org/wiki/Discrete_mathematics


3. http://mathworld.wolfram.com/classroom/classes/DiscreteMathematics.html

4. http://mathworld.wolfram.com/topics/NumberTheory.html

5. http://mathworld.wolfram.com/topics/GeneralLogic.html

AR19 MCA


PROBABILITY AND STATISTICS

Course Objectives:

COB 1: To acquaint students with the fundamental concepts of Probability and

Statistics.

COB 2: To develop an understanding of the role of Statistics in Science and

Engineering.

Course Outcomes:



CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO11

(K3)

CO1 (K3) 3 2 - - - - - - - - -

CO2 (K3) 3 2 - - - - - - - - -

CO3 (K3) 3 2 1 - - - - - - - -

CO4 (K3) 3 2 - - - - - - - - -

CO5 (K3) 3 2 - - - - - - - - -

CO6 (K4) 2 3 - - - - - - - - -

CO7 (K3) 3 2 - - - - - - - - -



CO1 (K3) 3 - -

CO2 (K3) 3 - -

CO3 (K3) 3 - -

CO4 (K3) 3 - -

CO5 (K3) 3 - -

CO6 (K4) 2 - -

CO7 (K3) 3 - -

UNIT-I:

Probability: Sample space and events, Probability – The axioms of probability, Some

Elementary theorems - Conditional probability, Baye’s theorem, Random variables,

Discrete and continuous distributions - Distribution function.

I Semester L T P C


CO 1: Apply various Probability distributions for both discrete and continuous

random variables.

CO 2: Compute various moments for both discrete and continuous Probability

distributions.

CO 3: Compute mean and variance of sample means with replacement and without

replacement.

CO 4: Apply various tests to test the hypothesis concerning mean, Proportion,

variance and perform ANOVA test.

CO 5: Apply the concepts of correlation and regression to the given statistical data.

CO 6: Examine quality of the product using control charts.

CO 7: Compute various performance measures of M/M/1 queuing model

AR19 MCA


UNIT-II:

Binomial, Poisson, normal distribution – related properties, Moment generating function,

Moments of standard distributions – properties.

UNI T-III:

Population and samples, Sampling distribution of mean (with known and unknown

variance), proportion, variances, Sampling distribution of sums and differences, Point

and interval estimators for means, variances, proportions.

UNIT-IV:

Statistical Hypothesis – Errors of Type I and Type II errors and calculation, One tail,

two-tail tests, Testing hypothesis concerning means, proportions and their differences

using Z-test, Tests of hypothesis using Student’s t-test, F-test and 2 test.. Test of

independence of attributes, ANOVA for one-way and two-way classified data.

UNIT-V:

Statistical Quality Control methods, Methods for preparing control charts, Problems

using x-bar, p, R charts and attribute charts, Simple Correlation and Regression, Queuing

Theory: Pure Birth and Death Process M/M/1 Model and Simple Problems.

Text Books:

1. Probability and Statistics for Engineers, Miller and John E. Freund, Prentice Hall

of India.

2. Probability and Statistics, D. K. Murugeson& P. Guru Swamy, Anuradha

Publishers.

Reference Books:

1. Probability, Statistics and Random processes. T. Veerrajan, Tata McGraw Hill,

India.

2. Probability, Statistics and Queuing theory applications for Computer Sciences,

2nd, Trivedi, John Wiley.

****

AR19 MCA


ACCOUNTING AND FINANCIAL MANAGEMENT

Course Objectives:

The main objectives of this course are

COB 1: To understand the basic concepts and processes used to determine product

costs.

COB 2: To be able to interpret cost accounting statements.

COB 3: To be able to analyze and evaluate information for cost ascertainment,

planning, control and decision making.

Course Outcomes (COs):

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

CO 1: Understand the balance sheet preparation and perform analysis.

CO 2: Understand the budget preparation and control of a company.

CO 3: Decide about the state of affairs of a particular firm / company.

CO 4: Ensure the preparation of fiscal policies of the organization.

CO 5: Ensure the factors to be considered in investment policies.


CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO11

(K3)

CO1 (K2) - - - - - - - - - 3 -

CO2 (K2) - - - - - - - - - 3 -

CO3 (K3) - - - - - - - - - - 2

CO4 (K2) - - - - - - - - 2 - -

CO5 (K3) - - - 2 - - - - 2 - -



CO1 (K2) - - -

CO2 (K2) - - -

CO3 (K3) - - -

CO4 (K2) - - -

CO5 (K3) - - -

UNIT-I:

Accounting Generally Accepted Accounting Principles (GAAP) & accounting standards,

Characteristics and limitations of single entry system, double entry system of accounting,

introduction of basis books of accounts, ledgers, Preparation of trail balance, Final

accounts, company final accounts, Users of Accounting Information, Role of Accountant

in modern Organizations.

UNIT-II:

Financial Management, meaning and scope, role, objectives of time value of money over

vitalization, under capitalization, profit maximization, wealth maximization, EPS

maximization. Ration Analysis, advantages, limitations, Fund flow analysis, meaning,

importance, preparation and interpretation of Funds flow and cash flow statements,

statements of changes in working capital.

I Semester L T P C Course Code: 193MC1T05 3 0 0 3

AR19 MCA


UNIT-III:

Costing: nature and importance and basic principles, Elements of cost, Absorption

costing Vs. Marginal costing, financial accounting Vs. cost Accounting Vs. management

accounting. Marginal costing and Break, even Analysis: nature, scope and importance,

practical applications of marginal costing, limitation and importance of cost, volume,

profit analysis, short run decisions.

UNIT-IV:

Standard costing and budgeting : nature, scope and computation and analysis, materials

variance, labour variance and sales variance, cash budget, sales, budget, flexible Budgets,

master budgets.

UNIT-V:

Introduction to computerized accounting system: coding logic and codes, master files,

transaction files, introduction documents used for data collection, processing of different

files and Outputs obtained.

Text Books:

1. Accounting for Managers, P. Vijaya Kumar, and Himalaya Publications.

2. Accounting for Management. Vijaya Kumar. TMH.

3. Financial Accounting, S.N Maheswari and S.K. Maheswari, Vikas.

4. Financial Accounting, A. Mukherjee and M. Heneef, TMH.

Reference Books:

1. Basic Financial Accounting for Management, Ambaresh Gupta, Pearson.

2. Accounts And Finance for Non accounts, Chatterjee, D.K.Himalaya.

3. Financial Analysis and Accounting, P. PremchandBabu and M. Madam Mohan,

Himalaya.

4. Essential of Financial Accounting, Ashish, K and Ballacharya, PHI.

5. Guide to Financial Management, John Tannent, Viva.

Web Links:

1. https://web.utk.edu › ~jwachowi › wacho_world

2. https://www.latrobe.edu.au/courses/master-of-accounting-and-financial-

management

3. https://www.cambridgecollege.co.uk/courses/accounting,-finance,-banking/

accounting-finance-in-management/

****

https://www.latrobe.edu.au/courses/master-of-accounting-and-financial-

https://www.cambridgecollege.co.uk/courses/accounting,-finance,-banking/

AR19 MCA


ENGLISH LANGUAGE COMMUNICATION SKILLS LAB

I Semester L T P C

Course Code: 193MC1L01 0 0 3 1.5

Course Objectives:

COB 1: To sensitize the students to the nuances of English speech sounds, word

accent, intonation and rhythm and understand the concepts of “neutralized

accent and phonetic transcription”.

COB 2: To enable students comprehend the concept of communication.

COB 3: Help improve speaking skills through participation in activities such as

plays, discussions and structured talks/oral presentations.

COB 4: To gain experience in extemporaneous speaking and oral presentation.

COB 5: To train students to use language appropriately for interviews, group

discussion and public speaking.

Course Outcomes:


CO 1: Ability to convert the understanding of phonetics in everyday practice.

CO 2: Better understanding of the nuances of language through audio-visual

experience and group activities.

CO 3: Speaking with clarity and confidence thereby enhancing employability

skills of the students.

CO 4: Relines professional writing and correspondence.


CO/PO PO1

(K5)

PO2

(K4)

PO3

(K5)

PO4

(K3)

PO5

(K3)

PO6

(K4)

PO7

(K6)

PO8

(K2)

PO9

(K2)

PO10

(K2)

PO11

(K4)

CO1 (K2) 3 - - - - 2 - - - -

CO2 (K2) 3 - 2 - - 2 - - - - -

CO3 (K2) 3 - 2 - - 2 - - - - -

CO4 (K5) 3 - 2 - - 2 - - - - -


CO / PSO PSO 1(K4) PSO 2(K4) PSO 3 (K4)

CO1 (K2) 3 - 2

CO2 (K2) 3 - 2

CO3 (K2) 3 - 2

CO4 (K5) 3 - 2

Suggested Software:

• Cambridge Advanced Learner’s English Dictionary with CD.

• Grammar made easy by Darling Kindersley.

• Punctuation made easy by Darling Kindersley.

• Clarity pronunciation power-part I.

• Clarity pronunciation power-part II.

• Oxford advanced learner’s compass 8th edition.

• Lingua TOEFL, CBT Inside by Dreamtech.

AR19 MCA


• TOEFL & GRE (KALPAN, AARCO & BARRONS, USA, Cracking GRE by

CLIFFS)

• English in mind (series 1-4), Herbert Puchta and Jeff Stranks with Meredith Levy,

Cambridge.

• English Pronunciation in Use (Elementary, Intermediate, Advanced) Cambridge

University Press.

• Tedx Talks.

S.

No. Topics

No. of

Sessions

1 Vowels, Consonants, Pronunciation, Phonetic Transcription 01

2 Syllabification, Stress, Intonation, Listening Comprehension,

Common errors in Pronunciation

02

3 In-house communication (situational dialogue/role play)

a. Individual to individual/group

i. Welcoming newcomers to the organization

ii. Introducing the workplace culture

iii. Explaining duties and responsibilities etc.

iv. Motivating (‘pep talk’)

v. Expressing / recording appreciation, praising

/rewarding a subordinate or junior.

b. Subordinate / Junior to superior

i. Reporting problems / difficulties

ii. Offering suggestions

01

4 Data interpretation, reading comprehension 01

Public speaking: power point presentations Group discussions,

Debates

04

5 Resume writing and interviews 03

6 Notices, Minutes of the meetings and e-Correspondence,

GRE/TOEFL Models.

02

Reference Books:

1. The Human Touch: personal Skills for Professional Success – by Debra Paul.

2. The Definitive Book of body Language – by Allan Pease, Barbara Pease.

3. How to Face Interviews – by Clive Fletcher.

4. The 7 Habits of Highly Effective People – by Stephen Covery.

5. Good English –by G.H Vallns

6. Better English – G.H Vallins

7. Best English – G.H. Vallins

8. How to Talk to Anyone: 92 little tricks for big success in Relationships by Leli

Lowndes.

9. English Pronunciation in use – Mark Hancock, Cambridge University Press.

10. English Phonetics and Phonology – Peter Roach, Cambridge University Press.

11. English Pronunciation in use – Mark Hewings, Cambridge University Press.

12. English Pronunciation Dictionary – Daniel Jones, Cambridge University Press.

AR19 MCA


PROBLEM SOLVING WITH C LAB

I Semester L T P C


Course Objectives:

COB 1: To impart knowledge on basic Linux commands, various Editors, Raptor.

COB 2: To make the students understand the concepts of C programming.

COB 3: To nurture the students on Control Structures and develop different

operations on arrays.

COB 4: To make use of String fundamentals and modular programming constructs.

COB 5: To implement programs using dynamic memory allocation.

COB 6: To explain the concepts of Structure, Unions and files for solving various

problems.

Course Outcomes:


CO 1: Develop the basic programs in C.

CO 2: Make Use of Conditional and Iterative statements to solve real time

scenarios in C.

CO 3: Apply the concept of Arrays, Modularity and Strings to handle complex

problems.

CO 4: Apply the Dynamic Memory Allocation functions using pointers.

CO 5: Develop programs using structures, and Files.


CO/PO PO1

(K3)

PO2

(K4)

PO3

(K5)

PO4

(K5)

PO5

(K3)

PO6

(K3)

PO7

(K2)

PO8

(K3)

PO9

(K2)

PO10

(K2)

PO11

(K3)

CO1 (K2) 2 1 - - 1 - - - - - -

CO2 (K3) 3 2 1 1 3 - - - - - -

CO3 (K3) 3 2 1 1 3 - - - - - -

CO4 (K3) 2 1 - - 3 - - - - - -

CO5 (K3) 3 2 1 1 3 - - - - - -



CO1 (K2) 2 2 2

CO2 (K3) 3 3 3

CO3 (K3) 3 3 3

CO4 (K3) 2 2 2

CO5 (K3) 3 3 3

Experiment l:

(a) Write a C Program to calculate the area of a triangle.

(b) Write a C program to find the largest of three numbers using ternary operator.

(c) Write a C Program to swap two numbers without using a temporary variable.

AR19 MCA


Experiment 2:

(a) Write a C program to find the 2’s complement of a binary number.

(b) Write a C program to find the roots of a quadratic equation.

(c) Write a C program, which takes two integer operands and one operator from

the user, performs the operation and then prints the result. (Consider the

operators +, -, *, /, % and use Switch Statement).

Experiment 3:

(a) Write a C program to find the sum of individual digits of a positive integer

and, also, find the reverse of the given number. (b) Write a C program to generate the first n terms of the Fibonacci sequence.

(c) Write a C program to generate all the prime numbers between 1 and n, where

n is a value supplied by the user.

Experiment 4:

(a) Write a C Program to print the multiplication table of a given number.

(b) Write a C Program to read a decimal number and find its equivalent binary

number.

(c) Write a C Program to check whether the given number is Armstrong number

or not.

Experiment 5: (a) Write a C program to interchange the largest and smallest numbers in the given

array.

(b) Write a C program to implement a liner search on a given set of values.

(c) Write a C program to implement binary search on a given set of values.

Experiment 6:

(a) Write a C program to implement sorting of an array of elements.

(b) Write a C program to input two m x n matrices, check the compatibility and

perform addition and multiplication of them.

Experiment 7:

Write a C program that uses functions to perform the following operations:

(a) To insert a sub-string into given main string at a given position.

(b) To delete n characters from a given position in a given string.

(c) To replace a character of string either from beginning or ending or at a specified

location.

Experiment 8:

Write a C program that uses functions to perform the following operations using

Structure:

(i) Reading a complex number (ii) Writing a complex number (iii) Addition of

two complex numbers (iv) Multiplication of two complex numbers.

Experiment 9:

Write C Programs for the following string operations without using the built in

functions:

(i) to concatenate two strings (ii) to append a string to another string (iii) to

compare two strings.

Experiment 10:

(a) Write a C Program to find the number of characters in a given string including

and excluding spaces.

(b) Write a C Program to copy the contents of one string to another string without

AR19 MCA


using string handling functions. (c) Write C Program to find whether a given string is palindrome or not.

(d) Write a C program to find both the largest and smallest number of an array of

integers using call by value and call by reference.

Experiment 11:

Write a C program using recursion for the following:

(a) To display sum of digits of given number.

(b) To find the factorial of a given integer.

(c) To find the GCD (greatest common divisor) of two given integers.

(d) To find the Fibonacci sequence.

Experiment 12:

(a) Write C Program to reverse a string using pointers.

(b) Write a C Program to compare two 2D arrays using pointers.

(c) Write a C program consisting of Pointer based function to exchange value of

two integers using passing by address.

Experiment 13:

Examples which explores the use of structures, union and other user defined

variables.

Experiment 14:

(a) Write a C program which copies one file to another.

(b) Write a C program to count the number of characters and number of lines in a

file.

(c) Write a C Program to merge two files into a third file, where the names of the

files must be entered using command line arguments.

Reference Books:

1. Let Us C Yashwanth Kanetkar, Eighth edition, BPB Publications.

2. Programming in C A-Practial Approach Ajay Mittal. Pearson Education.

3. The C programming Language, Dennis Richie and Brian Kernighan, Pearson

Education.

Web Links:

1. https://www.hackerrank.com/

2. https://www.codechef.com/

3. https://www.topcoder.com/

4. https://code-cracker.github.io/

5. https://nptel.ac.in/courses/106105085/2

*****

AR19 MCA


IT WORKSHOP (LAB)

I Semester L T P C


Course Objectives:

COB 1: To make the students aware of the importance of computers.

COB 2: To illustrate the fundamentals of computer hardware and software.

COB 3: To demonstrate applications like Microsoft Office Word, Excel,

Access and PowerPoint.

COB 4: To develop documents using LaTeX.

Course Outcomes:

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

CO 1 : Illustrate computer assembling and software installation.

CO 2 : Solve hardware, software trouble shooting problems.

CO 3 : Develop Documents using Word processors.

CO 4 : Build the computer using wired and wireless connections.

CO 5 : Develop presentations using presentation tool and Perform computations

using spreadsheet.



CO/ PSO PSO 1 (K3) PSO 2 (K3) PSO 3 (K3)

CO1 (K2) - 2 -

CO2 (K3) 3 3 -

CO3 (K3) - 3 3

CO4 (K3) - - 3

CO5 (K3) 3 3 3

List of Experiments:

Note: Faculty to consolidate the workshop manuals using the textbook and references.

Experiment 1:

Identification of the peripherals of a computer - Prepare a report containing the

block diagram of the computer along with the configuration of each component and

its functionality. Describe about various I/O Devices and its usage.

Experiment 2:

Practicing disassembling and assembling components of a PC.

Experiment 3:

Installation of Device Drivers, MS windows, Linux Operating system.

CO/PO PO 1

(K3)

PO2

(K4)

PO3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO 11

(K3)

CO1 (K2) 2 - - - 2 2 - - - - -

CO2 (K3) 3 2 1 1 3 3 - - - - -

CO3 (K3) 3 - 1 - 3 3 - - - - -

CO4 (K3) 3 2 1 1 3 3 - - - - -

CO5 (K3) 3 2 1 1 3 - - 3 - - -

AR19 MCA


Experiment 4:

Introduction to Memory and Storage Devices, I/O Port, Assemblers, Compilers,

Interpreters, Linkers and Loaders.

Experiment 5:

Demonstration of Hardware and Software Troubleshooting.

Experiment 6:

Demonstrating Importance of Networking, Transmission Media, Networking

Devices- Gateway, Routers, Hub, Bridge, NIC, Bluetooth Technology, Wireless

Technology,

Modem, DSL, and Dialup Connection.

Experiment 7:

Awareness of various threats on the Internet and its solutions.

Experiment 8:

Demonstration and Practice on Microsoft Word.

Experiment 9:

Demonstration and Practice on Microsoft Excel.

Experiment 10:

Demonstration and Practice on Microsoft Power Point.

Experiment 11:

Demonstration and Practice on LaTeX.

Text Books:

1. Computer Fundamentals, Anita Goel, Pearson India Education, 2017.

2. PC Hardware Trouble Shooting Made Easy, TMH.

Reference Books:

1. Upgrading and Repairing PCs, 18th Edition, Scott Mueller, QUE, Pearson, 2008.

2. Comdex Information Technology, Vikas Gupta, Dreamtech.

3. Essential Computer and IT Fundamentals for Engineering and Science Students,

Dr. N. B.Venkateswarlu, S. Chand Publishers.

4. Information Technology Workshop, 3rd Edition, G Praveen Babu, M V

Narayana, BS Publications.

AR19 MCA


DATA STRUCTURES II Semester L T P C Course Code: 193MC2T06 3 0 0 3

Course Objectives:

COB 1: To understand the concepts of data structures and recursive algorithms.

COB 2: Exposure to searching and sorting techniques.

COB 3: To introduce various techniques for representation of different types of data

in the real world.

COB 4: Exposure to list representation models in various types of applications.

COB 5: Implementation of tree in various forms and graphs.



CO 1: Apply recursive and non-recursive approaches to design an algorithm.

CO 2: Outline searching and sorting techniques.

CO 3: Develop stacks and queues using different approaches.

CO 4: Explain various operations using linked list.

CO 5: Develop a tree and its various traversals using various approaches.

CO 6: Demonstrate various graphs traversing techniques and spanning trees.



CO/ PSO PSO 1 (K3) PSO 2 (K3) PSO 3 (K3)

CO1 (K3) 3 3 3

CO2 (K2) 2 2 2

CO3 (K3) 3 - 3

CO4 (K2) 2 - 2

CO5 (K3) 3 - 3

CO6 (K2) 2 - 2

UNIT-I:

Data structure: Definition, types of data structures, Recursion Definition, Design

Methodology and Implementation of recursive algorithms, Linear and binary recursion,

recursive algorithms for factorial function, GCD computation, Fibonacci sequence.

Preliminaries of algorithms, analysis and complexity.

Searching Techniques: Linear Search, Binary Search and Fibonacci Search.

Sorting Techniques: Insertion sort, selection sort, exchange-bubble sort, quick sort and

merge sort.

CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K3)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO 11

(K3)

CO1 (K3) 3 2 1 1 3 - - - - - -

CO2 (K2) 2 1 3 3 2 - - - - - -

CO3 (K3) 3 2 - - 3 - - - - - -

CO4 (K2) 2 1 3 3 2 - - - - - -

CO5 (K3) 3 2 - - 3 - - - - - -

CO6 (K2) 2 1 - - 2 - - - - - -

AR19 MCA


UNIT-II:

Stacks: Basic Stack Operations, Representation of a Stack using Arrays, Applications of

Stack: Reversing list, Factorial Calculation, Infix to postfix Transformation, Evaluating

Arithmetic Expressions.

UNIT-III:

Queues: Basic Queues Operations, Representation of a Queue using array,

Implementation of Queue Operations using Stack. Applications of Queues-Circular

Queues, De-queue, Priority Queues.

UNIT-IV:

Linked Lists: Introduction, single linked list, representation of a linked list in memory,

Operations on a single linked list, reversing a single linked list, Circular linked list and

doubly linked list.

UNIT-V:

Trees: Binary Trees, terminology, representation and traversals- pre, post & in order

traversals. Graphs- terminology, representation and traversals (BFS & DFS), Spanning

trees, shortest path algorithms, Minimum spanning trees- Prim’s, Kruskal’s, Dijstra’s and

Warshall’s algorithms.

Text Books:

1. Fundamentals of Data Structures in C, Ellis Horowitz, Sartaj Sahani and Susan

Anderson Freed, 2 nd Edition, Universities Press

2. Data Structures with C, 2 ndEdition, Seymour Lipscutz, Schaum’s Outlines, TMH

3. Data structures using C, 2 ndEdition, Reema Thareja, Oxford higher education

Reference Books:

1. Data structures: A Pseudo code Approach with C, 2nd edition, R.F.Gilberg and

B.A.Forouzan, Cengage Learning.

2. Data structures and Algorithm Analysis in C, 2nd edition, M.A.Weiss, Pearson.

3. Data Structures using C, A.M.Tanenbaum, Y. Langsam, M.J.Augenstein,

Pearson.

Web Links:

1. http://scanftree.com/Data_Structure/

2. http://www.studytonight.com/data-structures/


4. http://www.geeksforgeeks.org/data-structures/

http://www.studytonight.com/data-structures/


AR19 MCA


OPERATING SYSTEMS

II Semester L T P C


Course Objectives:

COB 1: To introduce different types of operating systems.

COB 2: To learn process management techniques.

COB 3: To learn various memory management techniques.

COB 4: To introduce the architecture of Linux operating system.

COB 5: To learn basic Unix commands and to write shell scripts.

Course Outcomes:

At the end of this course the student will be able to:

CO 1: Understand the basics of operating systems like kernel, shell, types and views

of operating systems.

CO 2: Understands CPU scheduling algorithms and compare the results using Gantt

chart.

CO 3: Explain various memory management techniques and concept of thrashing.

CO 4: Apply disk scheduling algorithms for better utilization of external memory.

CO 5: Understand the architecture of Unix operating system.

CO 6: Write and execute shell programs.


CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO11

(K3) CO1 (K2) 2 1 - - - - - - - - -

CO2 (K3) 3 3 2 2 3 - - - - - -

CO3 (K2) 2 1 - - - - - - - - -

CO4 (K4) 3 3 2 2 3 - - - - - -

CO5 (K2) 3 2 1 - - - - - - - -

CO6 (K2) 2 1 - - 2 - - - - - -



CO1 (K2) 2 - -

CO2 (K3) 2 - 3

CO3 (K2) 2 - -

CO4 (K4) - 3 3

CO5 (K2) 3 - 3

CO6 (K2) - - 3

UNIT-I:

Introduction to Operating System Concept: Types of operating systems, operating

systems concepts, operating systems services, Introduction to System call, System call

types.

Process Management: Process concept, The process, Process State Diagram, Process

control block, Process Scheduling- Scheduling Queues, Schedulers, Operations on

Processes, Inter process Communication, Threading Issues, Scheduling-Basic Concepts,

Scheduling Criteria, Scheduling Algorithms.

AR19 MCA


UNIT-II:

Memory Management: Swapping, Contiguous Memory Allocation, Paging, structure of

the Page Table, Segmentation.

Virtual Memory Management: Virtual Memory, Demand Paging, Page-Replacement

Algorithms, Thrashing.

File system Interface: the concept of a file, Access Methods, Directory structure, File

system mounting, files sharing, protection.

File System implementation: File system structure, allocation methods, free-space

management, Disk scheduling.

UNIT-III:

Concurrency: Process Synchronization, The Critical- Section Problem, Synchronization

Hardware, Semaphores, Classic Problems of Synchronization, Monitors, Synchronization

examples.

Principles of deadlock: System Model, Deadlock characterization, Deadlock Prevention,

Detection and Avoidance, Recovery form Deadlock.

UNIT-IV:

Introduction to Unix operating system: History of Unix, features of Unix Operating

system, Architecture of Unix operating system, Unix File system, Unix environment,

Basic Unix commands. Using Vi editor, Different types of shells.

Shell Programming: Shell Variables, The Export Command, The Profile File a Script

Run During Starting, The First Shell Script, The read Command, Positional parameters,

The $? Variable knowing the exit Status-More about the Set Command, The Exit

Command.

UNIT-V:

Bourne shell Programming: Introduction, Writing and executing shell scripts,

Positional parameters, Branching Control Structures, Loop Control Structures, The

Continue and Break Statement, The expr Command: Performing Integer Arithmetic-Real

Arithmetic in Shell Programs, The here Document(<<), The Sleep Command-Debugging

Scripts, The Script Command, The eval Command.

Text Books:

1. Operating System Concepts, Abraham Silberschatz, Peter B Galvin and Greg

Gagne, 9th Edition, John Wiley and Sons Inc., 2016.

2. Operating Systems - Internals and Design Principles, William Stallings, 6th

Edition, Prentice Hall.

3. Unix network programming by W. Richard Stevens Reference Books:

1. Modern Operating Systems, Andrew S. Tanenbaum, Addison Wesley, 2nd

Edition.

2. Operating Systems: A Design-Oriented Approach, Charles Crowley, Tata

McGraw Hill Education, 1996.

3. Operating Systems: A Concept-Based Approach, D M Dhamdhere, 2nd

Edition,

Tata McGraw-Hill Education.

AR19 MCA


Web Links:

1. http://nptel.ac.in/downloads/106108101/

2. https://www.coursera.org/learn/iot/lecture/MrgxS/lecture-3-1-operating-systems

3. http://www.geeksforgeeks.org/operating-systems/

4. https://in.udacity.com/auth?next=/course/introduction-to-perating-systems--

ud923

5. https://www.tutorialspoint.com/operating_system

****

http://nptel.ac.in/downloads/106108101/

https://www.coursera.org/learn/iot/lecture/MrgxS/lecture-3-1-operating-systems

https://www.coursera.org/learn/iot/lecture/MrgxS/lecture-3-1-operating-systems

http://www.geeksforgeeks.org/operating-systems/

https://www.tutorialspoint.com/operating_system

AR19 MCA


SOFTWARE ENGINEERING

II Semester L T P C


Course Objectives:

COB 1: To impart knowledge on software development and software life cycle

models.

COB 2: To make students understand methods of capturing, specifying, visualizing

and analyzing software requirements.

COB 3: To make students understand methods of capturing, specifying, visualizing

and analyzing software requirements.



CO 1: Define various software application domains and remember different

process model used in software development.

CO 2: Explain needs for software specifications also they can classify different

types of software requirements and their gathering techniques.

CO 3: Make use of requirements model and convert into the design model and

demonstrate use of software and user interface design principles.

CO 4: Distinguish among SCM and SQA and can classify different testing

strategies and tactics and compare them.

CO 5: Justify role of SDLC in Software Project Development.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K1) 3 3 2 - - - - - - - -

CO2 (K2) 3 3 3 - 2 2 - 2 - - -

CO3 (K3) 3 2 3 - 2 2 - 2 - - -

CO4 (K4) 3 3 2 - 3 2 - 3 2 - -

CO5 (K5) 3 3 1 - 3 2 - 3 2 - -



CO1 (K1) 3 2 3

CO2 (K2) 3 3 3

CO3 (K3) 3 3 3

CO4 (K4) 3 3 3

CO5 (K5) 3 2 3

UNIT–I:

Introduction to Software Engineering: The evolving role of software, Changing Nature

of Software, Software myths. (Text Book 3), The software problem: Cost, schedule and

quality, Scale and change.

AR19 MCA


UNIT–II:

Software Process: Process and project, component software process, Software

development process models: Waterfall model, prototyping, iterative development,

relational unified process, time boxing model, Extreme programming and agile process,

using process models in a project, Project management process.

UNIT- III:

Software requirement analysis and specification: Value of good SRS, requirement

process, requirement specification, functional specifications with use-cases, other

approaches for analysis, validation, Planning a software project: Effort estimation,

project schedule and staffing, quality planning, risk management planning, project

monitoring plan, detailed scheduling.

UNIT– IV:

Software Architecture: Role of software architecture, architecture views, components

and connector view, architecture styles for C & C view, documenting architecture design,

evaluating architectures, Design: Design concepts, function-oriented design, object

oriented design, detailed design, verification, metrics.

UNIT-V:

Coding and Unit testing: Programming principles and guidelines, incrementally

developing code, managing evolving code, unit testing, code inspection, metrics, Testing:

Testing concepts, testing process, black-box testing, white-box testing, metrics.

Text Books:

1. A Concise introduction to software engineering (undergraduate topics in

computer science), Pankaj Jalote, Springer International Edition.

2. Software Engineering, A Precise approach, Pankaj Jalote, Wiley.

3. Software Engineering, 3/e, & 7e Roger S.Pressman, TMH.

Reference Books:

1. Software Engineering, 8/e, Sommerville, Pearson.

2. Software Engineering principles and practice, W S Jawadekar, TMH.

3. Software Engineering concepts, R Fairley, TMH.

AR19 MCA


OOP THROUGH JAVA

Course Objectives:

COB 1: To introduce the Object Oriented Programming concepts.

COB 2: To introduce the principles of inheritance and polymorphism and

demonstrate how they are related to the design of abstract classes.

COB 3: To introduce the implementation of packages and interfaces.

COB 4: To introduce the concept of multithreading and exception handling.

COB 5: To introduce the design of Graphical User Interface using applets and

swing controls.

Course Outcomes:


CO 1: Understand the use OOP concepts.

CO 2: Apply OOP concepts to solve real world problems.

CO 3: Understand the concepts of packages and interfaces.

CO 4: Understand the concepts of exception handing, multithread

applications with synchronization.

CO 5: Design the GUI based applications using AWT and Swings.

CO 6: Understand the concept of Collection Framework.


CO/PO PO1

(K3)

PO2

(K4)

PO3

(K5)

PO4

(K5)

PO5

(K3)

PO6

(K3)

PO7

(K2)

PO8

(K3)

PO9

(K2)

PO10

(K2)

PO11

(K3)

CO1 (K2) 2 1 - - 2 - - - - - -

CO2 (K3) 3 2 - - 3 - - - - - -

CO3 (K2) 2 1 - - 2 - - - - - -

CO4 (K2) 2 1 - - 2 - - - - - -

CO5 (K3) 3 2 - - 3 - - - - - -

CO6 (K2) 2 1 - - 2 - - - - - -



CO1 (K2) 2 - - CO2 (K3) 3 - - CO3 (K2) 2 - - CO4 (K2) 2 - - CO5 (K3) 3 - -

CO6 (K2) 2 - -

UNIT–I:

Basics of Object Oriented Programming (OOP):

Need for OO paradigm, A way of viewing world- Agents, responsibility, messages,

methods, classes and instances, class hierarchies (Inheritance), method binding,

overriding and exceptions, summary of OOP concepts, coping with complexity,

abstraction mechanisms.

II Semester L T P C

Course Code:193MC2T09 3 0 0 3

AR19 MCA


Java Basics:

Data types, variables, scope and life time of variables, arrays, operators, expressions,

control statements, type conversion and costing, simple java program, classes and

objects- concepts of classes, objects, constructors methods, access control, this keyword,

garbage collection, overloading methods and constructors, parameter passing, recursion,

string handling.

UNIT-II:

Inheritance:

Hierarchical abstractions, Base class object, subclass, subtype, substitutability, forms of

inheritance- specialization, specification, construction, extension, limitation,

combination, benefits of inheritance costs of inheritance. Member access rules, super

uses, using final with inheritance, polymorphism, abstract classes.

Packages and Interfaces:

Defining, Creating and Accessing a package, Understanding CLASSPATH, Importing

packages, differences between classes and interfaces, defining an interface, Implementing

interface, applying interfaces variables in interface and extending interfaces. UNIT-III: Exception handling and Multithreading:

Concepts of exception handling, benefits of exception handling, Termination or

presumptive models, exception hierarchy, usage of try, catch, throws and finally, built in

exceptions, creating own exception sub classes. Differences between multi-threading and

multitasking, thread life cycle, creating threads, synchronizing threads, daemon threads,

thread groups.

UNIT-IV: Event Handling:

Events, Event sources, Event classes, Event Listeners, Delegation event model, handling

mouse and keyboard events, Adapter classes, inner classes. The AWT class hierarchy ,

user-interface components- labels, button, canvas, scrollbars, text components, check

box, check box groups, choices, list panes- scroll pane, dialogs, menu bar, graphics,

layout manager- layout manager types- boarder, grid, flow, card and grid bag.

UNIT-V: Applets:

Concepts of Applets, differences between applets and applications, lifecycle of an applet,

types of applets, creating applets, passing parameters to applets, Swings: Introduction,

limitations of AWT, MVC architecture, components, containers, exploring swing-

JApplet, JFrame and JComponent, Icons and Labels, text fields, buttons-The JButton

class, Check boxes, Radio Buttons, Combo boxes, Tabbed panes, Scroll panes, Trees and

Tables.

AR19 MCA


Text Books:

1. Java-The complete reference,7/e, Herbert schildt, TMH.

2. JAVA: How to program, 8/e, Dietal, Dietal, PHI.

3. Introduction of programming with JAVA, S.Dean, TMH.

4. Introduction to Java programming, 6/e, Y.Daniel Liang, Pearson.

Reference Books:

1. Core Java 2, Vol 1(Vol 2) Fundamentals (Advanced), 7/e, Cay.S.Horstmann,

Gary Cornell, Pearson.

2. Big Java2,3/e, Cay.S. Horstmann, Wiley.

3. Object Oriented Programming through Java, P.Radha Krishna, University Press.

4. JAVA& Object Orientation an Introduction, 2/e, John Hunt, Springer.

5. Introduction to JAVA Programming, 7/e, Y. Daniel Liang, Pearson., TMH.

Web Links:

1. http://math.hws.edu/javanotes/

2. http://java.sun.com/docs/books/tutorial/

3. http://www.tutorialspoint.com/java

4. http://www.javatpoint.com

5. http://www.w3schools.com/java

****

http://math.hws.edu/javanotes/

http://java.sun.com/docs/books/tutorial/

http://www.w3schools.com/java

AR19 MCA


OPTIMIZATION TECHNIQUES

Course Objectives:

COB 1: To understand the theory of optimization methods and algorithms developed

for solving various types of optimization problems.

COB 2: To develop and promote research interest in applying optimization

techniques in problems of Engineering and Technology.

COB 3: To apply the mathematical results and numerical techniques of optimization

theory to concrete Engineering problems.

Course Outcomes:


CO 1 : Describe clearly a problem, identify its parts and analyze the individual

functions.

CO 2 : Feasibility study for solving an optimization problem.

CO 3 : Becoming a mathematical translation of the verbal formulation of an

optimization problem.

CO 4 : To design algorithms, the repetitive use of which will lead reliably to

finding an approximate solution.

CO 5 : Discovery, study and solve optimization problems.

CO 6 : Investigate, study, develop, organize and promote innovative solutions for

various applications.


CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO11

(K3)

CO1 (K4) 3 3 - - - - - - - - -

CO2 (K3) 3 1 - - - - - - - - -

CO3 (K3) 3 - 1 - - - - - - - -

CO4 (K6) - - 3 - - - - - - -

CO5 (K4) 3 3 - - - - - - - -

CO6 (K5) 3 3 1 1 - - - - - - -



CO1 (K4) 2 - -

CO2 (K2) 3 - -

CO3 (K3) 1 - -

CO4 (K6) 3 3 -

CO5 (K4) 3 - -

CO6 (K5) 3 - -

UNIT-I:

Development: Definition, Characteristics and Phrases, scientific method. Types of

models, general methods for solving, operations research modes, Allocation: introduction

linear programming formulation, graphical solution, simplex methods, artificial variable

technique, and duality principle.

II Semester L T P C


AR19 MCA


UNIT-II:

Transportation problem: Formulation, optimal solution, unbalanced transportation,

Assignment problem: formulation, optimal solution, variations problem, degeneracy i.e.

non square MXN) matrix, restrictions, Sequencing: Introduction, optimal solution for

processing each of n jobs through three machines, travelling salesman problem (i.e.)

shortest acyclic route models.

UNIT-III:

Replacement: Introduction, replacement of items that deteriorate when money value is

not counted and counted, and replacement of items that fail completely (i.e.) group

replacements, Waiting lines: Introduction, single channel, poisson arrivals, exponential

service time infinite population and unrestricted queue.

UNIT-IV:

Inventory: Introduction, single item, deterministic models, production is instantaneous

or at a constant rate , shortages are allowed or not allowed and with drawls from stock is

continuous, purchase inventory model with one price break, shortages are not allowed,

instantaneous production demand production or purchase cost is relevant, stochastic

models, simple problems.

UNIT-V:

Theory of Games: Introduction, minmax (maximum), criterion and optimal strategy

solution of games with saddle points, rectangular without saddle points. Dynamic

programming: Introduction, Bellman’s Principle of optimality, solutions for simple

problems, Project Management: PERT and CPM, difference between PERT and CPM,

PERT/CPM network components and precedence relations, Time Estimates for activities

Text Books:

1. Operations Research, S.D.Sharma, Ramnath, &Kedarnath co, Meeru.

2. Operations Research, An introduction, 8/e, Taha, Pearson.

Reference Books:

1. Operations Research, P.K.Gupta, D.S. Hira, S.Chand .

2. Operations Research, R.D.Asrhedkar, R.V.Kulkarni.

3. Operations Research, Problems &sollutons, 3/e, JKSharma, Macmillan.

4. Operations Research, 8/e, Hillier, Liberman, TMH.

5. Operations Research, 2/e, Panneerselvam.

Web Links:

1. http://www2.informs.org/Resources/.

2. http://www.mit.edu/~orc/.

3. http://www.ieor.columbia.edu/.

4. http://www.universalteacherpublications.com/univ/ebooks/or/Ch1/origin.htm.

5. http://www.wolfram.com/solutions/OperationsResearch/.

****

http://www2.informs.org/Resources/

http://www.mit.edu/~orc/

http://www.ieor.columbia.edu/

http://www.universalteacherpublications.com/univ/ebooks/or/Ch1/origin.htm

http://www.universalteacherpublications.com/univ/ebooks/or/Ch1/origin.htm

http://www.wolfram.com/solutions/OperationsResearch/

AR19 MCA


OOP THROUGH JAVA LAB

II Semester L T P C


Course Objectives:

Course Outcomes:

At the end of this course, the student will be able to:


CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO11

(K3) CO1 (K3) 3 - - - 3 - - - - - - CO2 (K3) 3 2 - - 3 3 - - - - - CO3 (K3) 3 2 - - 3 3 - - - - - CO4 (K3) 3 2 - - 3 3 - - - - - CO5 (K3) 3 2 - - 3 3 - - - - - CO6 (K6) 3 3 - - 3 3 - - - - -



CO1 (K3) 3 - -

CO2 (K3) 3 - -

CO3 (K3) 3 - -

CO4 (K3) 3 - -

CO5 (K3) 3 - -

CO6 (K6) 3 - -

COB 1: To understand how to design, implement, test, debug, and document

programs that use basic data types and computation, simple I/O,

conditional and control structures, string handling and functions.

COB 2: To understand the importance of Classes & objects along with

constructors, Arrays and Vectors.

COB 3: Discuss the principles of inheritance, interface and packages and

demonstrate though problem analysis assignments how they relate to the

design of methods, abstract classes and interfaces and packages.

COB 4: To understand importance of Multi-threading & different exception

handling mechanisms.

COB 5: To learn experience of designing, implementing, testing, and debugging

graphical user interfaces in Java using applet and AWT that respond to

different user events.

COB 6: To understand Java Swings for designing GUI applications based on

MVC architecture

CO 1: Apply OOP concepts to solve real world problems.

CO 2: Implement different forms of inheritance.

CO 3: Create packages and to reuse them.

CO 4: Implement multi-threaded programs using synchronization concepts.

CO 5: Create user defined exceptions.

CO 6: Design GUI applications using AWT and SWINGS.

AR19 MCA



1. The Fibonacci sequence is defined by the following rule. The first 2 values

in the sequence are 1, 1. Every subsequent value is the sum of the 2 values

preceding it. Write a Java Program that uses both recursive and non

recursive functions to print the nth value of the Fibonacci sequence.

2. Write a Java Program that prompts the user for an integer and then prints

out all the prime numbers up to that Integer.

3. Write a Java Program that checks whether a given string is a palindrome or

not. Ex. MALAYALAM is a palindrome.

4. Write a Java Program for sorting a given list of names in ascending order.

5. Write a Java Program that illustrates how runtime polymorphism is

achieved.

6. Write a Java Program to create and demonstrate packages.

7. Write a Java Program, using String Tokenizer class, which reads a line of

integers and then displays each integer and the sum of all integers.

8. Write a Java Program that reads on file name form the user then displays

information about whether the file exists, whether the file is readable/

writable, the type of file and the length of the file in bytes and display the

content of the using File Input Stream class.

9. Write a Java Program that displays the number of characters, lines and

words in a text/text file. Write a JAVA program to sort an array of strings

10. Write an Applet that displays the content of a file.

11. Write a Java Program that works as a simple calculator. Use a grid layout to

arrange buttons for the digits and for the +-*? % operations. Add a text field

to display the result.

12. Write a Java Program for handling mouse events.

13. Write a Java Program demonstrating the life cycle of a thread.

14. Write a Java Program that lets users create Pie charts. Design your own user

interface (with Swings & AWT).

15. Write a Java Program to implement a Queue, using user defined Exception

Handling (also make use of throw, throws). Write a JAVA program that

illustrates multi-level inheritance

Reference Books:

1. Core Java: An Integrated Approach – R. Nageswara Rao, John Wiley and

Sons Inc., First Edition,2015.

2. Java Tutorial: A Short Note on Basics - Sharon Biocca Zakhour, Soumya

Kannan, Raymond Gallardo, Oracle Corp, FifthEdition,2012.

3. Object Oriented Programming using Java – Simon Kendal First Edition, 2009.

4. Java: The fundamentals of Objects and Classes–David Etheridge First

Edition, 2009.

Web Links:

1. http://www.programmingtutorials.com/java.aspx

2. http://www.javacodegeeks.com

3. http://java.sun.com/developer/onlineTraining/

4. http://java.sun.com/learning

5. http://www.kodejava.org

****

AR19 MCA


DATA STRUCTURES LAB

II Semester L T P C


Course Objectives:




CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K3)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO 11

(K3)

CO1 (K3) 3 2 1 1 3 - - - - - -

CO2 (K3) 3 2 1 1 3 - - - - - -

CO3 (K3) 3 2 - - 3 - - - - - -

CO4 (K2) 2 1 3 3 2 - - - - - -

CO5 (K3) 3 2 - - 3 - - - - - -


CO/PSO PSO 1 (K3) PSO 2 (K3) PSO 3 (K3)

CO1 (K3) 3 3 3

CO2 (K3) 3 3 3

CO3 (K3) 3 - 3

CO4 (K2) 2 - 2

CO5 (K3) 3 - 3

Experiment 1:

Write recursive program which computes the nth Fibonacci number, for appropriate value

of n.

Experiment 2:

Write recursive program for the following

1.1 Write recursive and non recursive C program for calculation of Factorial of an

integer.

1.2 Write recursive and non recursive C program for calculation of GCD (n, m).

1.3 Write recursive and non recursive C program for Towers of Hanoi: N disks are to

be transferred from peg S to peg D with Peg I as the intermediate peg.

Experiment 3:

2.1 Write C program that use both recursive and non recursive functions to perform

Linear search for a Key value in a given list.

2.2 Write C program that use both recursive and non recursive functions to perform

COB 1: To impart knowledge on recursive algorithms.

COB 2: To implement operations like searching and sorting techniques.

COB 3: To make students to learn various data structures.

COB 4: To develop applications using data structure algorithms.

CO 1: Develop recursive and non-recursive approaches to design an algorithm.

CO 2: Apply sorting and searching algorithms to given numbers

CO 3: Develop various basic data structures and its operations.

CO 4: Demonstrate various tree operations.

CO 5: Build various graphs algorithms.

AR19 MCA


Binary search for a Key value in a given list.

Experiment 4:

3.1) Write C program that implement Bubble sort, to sort a given list of integers in

ascending order.

3.2) Write C program that implement Quick sort, to sort a given list of integers in

ascending order.

Experiment 5:

4.1) Write C program that implement heap sort, to sort a given list of integers in

ascending order.

4.2) Write C program that implement merge sort, to sort a given list of integers in

ascending order.

Experiment 6:

5.1) Write C program that implement stack (its operations) using arrays.

5.2) Write C program that implement stack (its operations) using Linked list.

Experiment 7:

6.1) Write a C program that uses Stack operations to Convert infix expression into

postfix expression.

6.2) Write C program that implement Queue (its operations) using arrays.

6.3) Write C program that implement Queue (its operations) using linked lists.

Experiment 8:

7.1) Write a C program that uses functions to create a singly linked list and perform

various operations on it.

Experiment 9:

8.1) Write a C program to store a polynomial expression in memory using linked list

and perform polynomial addition.

Experiment 10:

9.1) Write a recursive C program for traversing a binary tree in preorder, in order

and post order.

9.2) Write a non recursive C program for traversing a binary tree in preorder, in

order and post order.

Experiment 11:

10.1) Write a C program to implement Prims’ algorithm.

10.2) Write a C program to implement Kruskal’s algorithm.

Text Books:

1. Fundamentals of Data Structures in C, Ellis Horowitz, Sartaj Sahani and Susan

Anderson Freed, 2nd Edition, Universities Press.

2. Data Structures with C, 2nd Edition, Seymour Lipscutz, Schaum’s Outlines,

TMH.

3. Data structures using C, 2 ndEdition, Reema Thareja, Oxford higher education.

AR19 MCA


Reference Books:

1. Data structures: A Pseudo code Approach with C, 2nd edition, R.F.Gilberg and

B.A.Forouzan, Cengage Learning.

2. Data structures and Algorithm Analysis in C, 2nd edition, M.A.Weiss, Pearson.

3. Data Structures using C, A.M.Tanenbaum, Y. Langsam, M.J.Augenstein,

Pearson.

Web Links:

1. https://ocw.mit.edu/courses/...and.../6-006-introduction-to-algorithms-spring2008/

2. https://www.coursera.org/specializations/data-structures-algorithm

3. https://in.udacity.com/course/intro-to-algorithms--cs215

4. https://www.alljntuworld.in/jntu-lab-manuals/

https://www.coursera.org/specializations/data-structures-algorithm

https://in.udacity.com/course/intro-to-algorithms--cs215

AR19 MCA


OPERATING SYSTEMS AND LINUX LAB

II Semester L T P C


Course Objectives:


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


CO/ PO PO1

(K5)

PO2

(K4)

PO3

(K5)

PO4

(K3)

PO5

(K3)

PO6

(K4)

PO7

(K6)

PO8

(K2)

PO9

(K2)

PO10

(K2)

PO11

(K4)

CO1 (K3) 1 2 1 3 3 - - - - - -

CO2 (K2) 1 1 1 2 3 - - - - - -

CO3 (K3) 1 2 1 3 3 - - - - - -

CO4 (K3) 1 2 1 3 3 - - - - - -


CO / PSO PSO 1 (K4) PSO 2(K4) PSO 3 (K4)

CO1 (K3) 2 2 -

CO2 (K2) 1 1 -

CO3 (K3) 2 2 -

CO4 (K3) 2 2 -

Operating Systems Lab


1 Simulate the Following CPU Scheduling Algorithms.

A) FCFS B) SJF C) Priority D) Round Robin

2 Multiprogramming-Memory Management- Implementation of

fork(), wait(), exec() and exit()

3 Simulate The Following.

A) Multiprogramming with A Fixed Number Of Tasks (MFT)

B) Multiprogramming with A Variable Number Of Tasks (MVT)

4 Simulate Bankers Algorithm for Dead Lock Avoidance.

COB 1: Simulate various CPU scheduling algorithms and compare results.

COB 2: Demonstrate the working of various system calls and memory

management techniques.

COB 3: Simulate various Dead Lock concepts.

COB 4: Develop page replace algorithms and File Allocation strategies.

COB 5: Construct Shell Script using Shell commands and AWK.

CO 1: To implement CPU scheduling algorithms.

CO 2: To implement page replacement algorithms.

CO 3: To execute different types of Linux commands.

CO 4: To write shell scripts programs.

AR19 MCA


𝑐

5 Simulate Bankers Algorithm for Dead Lock Prevention.

6 Simulate The Following Page Replacement Algorithms.

A) FIFO B) LRU C) LFU

7 Simulate the Following File Allocation Strategies.

A) Sequenced B) Indexed C) Linked

LINUX LAB

1. Write a Shell program to check whether given number is prime or not.

2. Write a shell script which will display Fibonacci series up to the given range.

3. Write a shell script to check whether the given number is Armstrong or not.

4. Write a shell script to the calculate the value of𝑛𝑐𝑟.

5. Write a shell script to accept student number, name, marks in 5 subjects. Find

total, average and grade using the following rules:

a. Avg>=80 then grade A

Avg<80&&Avg>=70

then grade B

Avg<70&&Avg>=60

then grade C

Avg<60&&Avg>=50

then grade D

Avg<50&&Avg>=40

then grade E

6. Write a shell script to find minimum and maximum elements in the given list of

elements.

7. Write a shell program to check whether the given string is palindrome or not.

8. Write an awk program to print sum, avg of students marks list.

AR19 MCA


DATABASE MANAGEMENT SYSTEMS

III Semester L T P C


Course Objectives:

COB 1: To discuss the basic concepts of data base systems and its architectures. COB 2: To enable the students to learn various data models. COB 3: To illustrate the mechanisms involved in normalization of relational

databases. COB 4: To make use of SQL statements for performing operations on databases. COB 5: To impart knowledge on transaction management and concurrency

controls.

Course Outcomes:


CO 1: Identify various database characteristics and architectures. CO 2: Analyze relational database using SQL. CO 3: Make use of modeling techniques for database design. CO 4: Make use of normalization techniques to build good database. CO 5: Apply the mechanisms of transaction management. CO 6: Examine issues in data storage and query processing for appropriate

solutions.

Mapping of course outcomes with program outcomes



CO1 (K2) 2 2 1

CO2 (K4) 3 2 2

CO3 (K3) 2 3 2

CO4 (K3) 3 3 2

CO5 (K3) 3 2 2

CO6 (K4) 3 1 1

Syllabus:

UNIT–I:

Introduction:

Database system, Characteristics (Database Vs File System), Database Users (Actors on

Scene, Workers behind the scene), Advantages of Data base systems, Database

applications.

Brief introduction of different Data Models; Concepts of Schema, Instance and data

independence; Three tier schema architecture for data independence; Database system

structure, environment, Centralized and Client Server architecture for the database.

CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO11

(K3)

CO1 (K3) 2 2 - - - - - - - - -

CO2 (K4) 3 3 2 2 2 - - - - - -

CO3 (K3) 3 2 2 2 3 - - - - - -

CO4 (K3) 3 2 2 2 3 - - - - - -

CO5 (K3) 3 2 2 1 2 - - - - - -

CO6 (K4) 2 2 2 2 2 - - - - - -

AR19 MCA


UNIT–II:

Relational Model: Introduction to relational model, concepts of domain, attribute, tuple,

relation, importance of null values, constraints (Domain, Key constraints, integrity

constraints) and their importance.

BASIC SQL: Simple Database schema, data types, table definitions (create, alter),

different DML operations (insert, delete, update), basic SQL querying (select and

project) using where clause, arithmetic & logical operations, SQL functions(Date and

Time, Numeric, String conversion).

UNIT–III:

Entity Relationship Model: Introduction, Representation of entities, attributes, entity

set, relationship, relationship set, constraints, sub classes, super class, inheritance,

specialization, generalization using ER Diagrams.

SQL: Creating tables with relationship, implementation of key and integrity constraints,

nested queries, sub queries, grouping, aggregation, ordering, implementation of different

types of joins, view (updatable and non-updatable), relational set operations.

UNIT–IV:

Schema Refinement (Normalization): Purpose of Normalization or schema refinement,

concept of functional dependency, normal forms based on functional dependency (1NF,

2NF and 3 NF), concept of surrogate key, Boyce-codd normal form (BCNF), Lossless

join and dependency preserving decomposition, Fourth normal form(4NF).

UNIT–V:

Transaction Concept: Transaction State, Implementation of Atomicity and Durability,

Concurrent Executions, Serializability, Recoverability, Implementation of Isolation,

Testing for Serializability, Failure Classification, Storage, Recovery and Atomicity,

Recovery algorithm. INDEXING TECHNIQUES: B+ Trees: Search, Insert, Delete

algorithms, File Organization and Indexing, Cluster Indexes, Primary and Secondary

Indexes, Index data Structures, Hash Based Indexing: Tree base Indexing, Comparison of

File Organizations, Indexes and Performance Tuning.

Text Books:

1. Data base Management Systems, 3rd Edition, Raghu Ramakrishnan, Johannes

Gehrke, TMH ,2003

2. Data base System Concepts, VI edition, A.Silberschatz, H.F. Korth, S.Sudarshan,

McGraw hill, 2006

3. Fundamentals of Database Systems, 5th edition, RamezElmasri, Shamkant

Navathe, Pearson Education,2008

Reference Books:

1. Database Management System Oracle SQL and PL/SQL, P.K.Das Gupta, PHI.

2. Database System Concepts, Peter Rob & Carlos Coronel, Cengage Learning,

2008.

3. Database Systems, A Practical approach to Design Implementation and

Management Fourth edition, Thomas Connolly, Carolyn Begg, Pearson education.

4. Database Principles, Programming, and Performance, P.O’Neil, E.O’Neil, 2nd ed.,

ELSEVIER.

AR19 MCA


5. Fundamentals of Relational Database Management systems, S.Sumathi,

S.Esakkirajan, Springer.

6. Introduction to Database Management, Student Edition, M.L.Gillenson and

others, Wiley.

7. Database Development and Management, Lee Chao, Auerbach publications,

Taylor & Francis Group.

8. Introduction to Database Systems, C.J.Date, Pearson Education.

Web Links:

1. http://www.nptelvideos.in/2012/11/database-management-system.html

2. http://www.geeksforgeeks.org/dbms/

3. http://www.oracle.com/technetwork/database/features/plsql/index.html

4. https://www.lynda.com/Databases-training-tutorials/1458-0.html

5. https://beginnersbook.com/2015/05/normalization-in-dbms/

6. http://www.eazynotes.com/pages/database-management-system/transaction-

management.html

http://www.nptelvideos.in/2012/11/database-management-system.html

http://www.geeksforgeeks.org/dbms/

http://www.oracle.com/technetwork/database/features/plsql/index.html

https://www.lynda.com/Databases-training-tutorials/1458-0.html

https://beginnersbook.com/2015/05/normalization-in-dbms/

http://www.eazynotes.com/pages/database-management-system/transaction-management.html

http://www.eazynotes.com/pages/database-management-system/transaction-management.html

AR19 MCA


COMPUTER NETWORKS

Course Objectives:

COB 1: To facilitate the students on various networking and reference models.

COB 2: To enable the students to learn the role of physical layer in networking.

COB 3: To impart the knowledge on design issues of data link layer and

protocols.

COB 4: To create awareness on medium access schemas, network layer and

various routing algorithms.

COB 5: To make the students to learn the importance network security algorithms

and Application layer protocols.

Course Outcomes:


CO 1: Explain the computer network fundamentals and various topologies.

CO 2: Compare the OSI with TCP/IP reference model.

CO 3: Summarize the concepts of physical layer and switching techniques.

CO 4: Discuss the design issues of data link layer services.

CO 5: Demonstrate the concept of MAC and Channelization.

CO 6: Apply various routing algorithms and Congestion control techniques.

CO 7: Utilize the services provided by the transport layer and application layer.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K3)

PO 7

(K4)

PO 8

(K6)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K2) 3 2 - 2 - - - - - - -

CO2 (K2) 3 2 - - - - - - - - -

CO3 (K2) 3 2 2 - 2 - - - - - -

CO4 (K6) 2 2 - 2 - - - - - - -

CO5 (K2) 3 2 2 - - - - - - - -

CO6 (K3) 3 2 - 2 3 - - - - - -

CO7 (K3) 2 3 2 2 - - - - - - -



CO1 (K2) 3 2 -

CO2 (K2) 3 2 -

CO3 (K2) 3 2 -

CO4 (K6) 3 2 -

CO5 (K2) 2 2 -

CO6 (K3) 2 3 -

CO7 (K3) 2 3 -

UNIT-I:

Network Hardware reference model: Transmission media, Narrowband ISDN, Broad

band ISDN, ATM, The data Link layer: Design Issues, Error detection and correction,

Elementary Data Link Protocols, Sliding window protocols: Data link layer in HDLC,

Internet and ATM.



AR19 MCA


UNIT-II:

Channel allocation methods: TDM, FDM, ALOHA, Carrier sense Multiple access

protocols, Collision Free protocols – IEEE standard 802.11 for LANS – Ethernet, Token

Bus, Token ring, Bridges, Network layer Routing Algorithms: Shortest path, Flooding,

Flow based Distance vector, Link state, Hierarchical, Broadcast routing, Congestion

Control algorithms-General principles of congestion control, Congestion prevention

polices, Choke packets and Load shedding.

UNIT-III:

Internet Working: Tunneling, internetworking, Fragmentation, network layer in the

internet – IP protocols, IP address, Subnets, Internet control protocols, OSPF, BOP,

Internet multicasting, Mobile IP, Network layer in the ATM Networks – cell formats,

connection setup, routing and switching, service categories, and quality of service, ATM

LANs.

UNIT-IV:

The Transport Layer: Elements of transport protocols – addressing, establishing a

connection, releasing connection, flow control and buffering and crash recovery, end to

end protocols: UDP, reliable Byte Stream (TCP) end to end format, segment format,

connection establishment and termination, sliding window revisited, adaptive

retransmission, TCP extension, Remote Procedure Call – BLAST, CHAN, SELECT, and

DCE.

UNIT-V:

Application Layer: Network Security, Cryptographic Algorithms: DES, RSA. Security

Mechanisms: Authentication Protocols, Firewalls. Name service (DNS) Domains

Hierarchy, Name servers. Traditional Applications: SMTP, MIME, World Wide Web:

HTTP, Network Management: SNMP.

Text Books:

1. Computer Networks, 4/e, Andrew Tanenbaum, Pearson.

2. Data and computer communications, 8/e, stallings, PHI.

Reference Books:

1. Data communications and networking, 4/e Forouzan, TMH.

2. Computer Networks – A System Approach, 2/e, Peterson, Bruce Davie, and

Harcourt Asia 3. Compute communications and networking technologies, Gallo,

Hancock, and Cengage

3. An Engineering approach to compute networking, Kesha, Pearson

4. Communication networks, 2/e, Leon-Garcia, TMH

5. Computer networks, Anuranjan Misra, ACME Learning

Web Links:


2. http://www.jetking.com/hardware-and-networking-testimonia

3. http://freevideolectures.com/Course/2276/Computer-Networks

4. https://www.coursera.org/courses?languages=en&query=computer%20network

5. https://in.udacity.com/course/computer-networking--ud436

****

AR19 MCA


DESIGN & ANALYSIS OF ALGORITHM

Course Objectives:

COB 1: To enable the students, know the importance of algorithm and pseudo code.

COB 2: To make the students learn about recursive and non-recursive paradigms of an

Algorithm.

COB 3: To facilitate the students in measuring the performance of an algorithm in

terms of space and time complexity.

COB 4: To create awareness on different problem-solving strategies.

COB 5: To impart the knowledge on principle of optimality.

COB 6: To make the students learn select the optimal solution for a set of problems

Course Outcomes:

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

CO 1: Develop algorithms for various computational problems.

CO 2: Analyze time and space complexities of an algorithm.

CO 3: Construct sorting and searching algorithms using Divide and Conquer

Approach.

CO 4: Apply Greedy method with heuristic approach in tracing the global optimal

Solution from local optimal solutions.

CO 5: Compare the benefits of using Dynamic programming over Greedy method

CO 6: Solve problems using Backtracking strategy.

CO 7: Relate real time problems that exploit Branch and Bound method and NP

complete problems.


CO/PO PO1

(K3)

PO2

(K4)

PO3

(K5)

PO4

(K5)

PO5

(K3)

PO6

(K3)

PO7

(K2)

PO8

(K3)

PO9

(K2)

PO 10

(K2)

PO11

(K3)

CO1(K3) 3 2 1 1 3 - - - 3 - -

CO2(K3) 3 3 2 2 - 3 - - - 3 -

CO3(K3) 3 2 1 1 3 - - - - - -

CO4(K2) 3 2 1 1 3 - - - - - -

CO5(K3) 3 3 2 2 3 - - - - - -

CO6(K3) 3 2 1 1 3 - - - - - -

CO7(K2) 2 1 - - - - - - - - -



CO1(K3) 3 3 3

CO2(K3) 3 3 -

CO3(K3) 3 3 3

CO4(K2) 3 - -

CO5(K3) - - -

CO6(K3) - - -

CO7(K2) - - -



AR19 MCA


UNIT-I:

Introduction: Algorithm, Pseudo code for expressing algorithms, performance Analysis-

Space complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega

notation, Theta notation and Little oh notation, probabilistic analysis, Amortized

analysis. Disjoint Sets- disjoint set operations, union and find algorithms, spanning trees,

connected components and bi-connected components.

UNIT-II:

Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort,

Stassen’s matrix multiplication. Greedy method: General method, applications-Job

sequencing with deadlines, 0/1 knapsack problem, Minimum cost spanning trees, Single

source shortest path problem.

UNIT-III:

Dynamic Programming: General method, applications-Matrix chain multiplication,

Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem,

Travelling sales person problem, Reliability design.

UNIT-IV:

Backtracking: General method, applications-n-queen problem, sum of subsets problem,

graph coloring, Hamiltonian cycles.

UNIT-V:

Branch and Bound: General method, applications - Travelling salesperson problem, 0/1

knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution.

NP-Hard and NP-Complete problems: Basic concepts, non-deterministic algorithms, NP

- Hard and NP Complete classes, Cook’s theorem.

Text Books: 1. Ellis Horowitz, Sartaj Sahni and Rajasekaran, Fundamentals of Computer

Algorithms, 2nd Edition, 2012, University Press.

2. Parag Himanshu Dave and Himanshu Bhalchandra Dave, Design and Analysis of

Algorithms, Second Edition, Pearson Education.

Reference Books: 1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third

Edition, Pearson Education, 2012.

2. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein,

“Introduction to Algorithms”, Third Edition, PHI Learning Private Limited, 2012.

3. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and

Algorithms”, Pearson Education, Reprint 2006.

4. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson

Education, 2009. Steven S. Skiena, “The Algorithm Design Manual”, Second

Edition, Springer, 2008.

5. http://nptel.ac.in/

AR19 MCA


Web Links:

1. https://nptel.ac.in/courses/106101060/18

2. https://www.coursera.org/lecture/delivery-problem/branch-and-bound-UyBJC

3. https://www.coursera.org/lecture/advanced-algorithms-and-complexity/3-

satbacktracking-2fbIl

4. https://discrete.gr/complexity/

5. https://people.eecs.berkeley.edu/~vazirani/algorithms/chap2.pdf

****

AR19 MCA


ADVANCED JAVA PROGRAMMING



Course Objectives:

COB 1: To understand the concepts of naming and directory services.

COB 2: To learn distributed computing using RMI.

COB 3: To acquire knowledge on creation of software components using JAVA

Beans.

COB 4: To learn Server-Side Programming using Servlets.

COB 5: To learn the creation of pure Dynamic Web Application using JDBC.

Course Outcomes:


CO 1: Explain the concepts of Java Naming and Directory Interface, Lightweight

Directory Access Protocol.

CO 2: Select the remote methods in an application using Remote Method

Invocation (RMI).

CO 3: Implement the multi-tier architecture of web-based enterprise applications

using Enterprise JavaBeans (EJB).

CO 4: Explain about network and security programming using Java and know about

the application of dynamic page functionality in web pages Servlets.

CO 5: Make use of different JDBC drivers for establishing a connection between

front end and back end in a project.


CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO 11

(K3)

CO1 (K2) 2 1 - - - - - - - - -

CO2 (K3) 3 2 1 - - - - - - - -

CO3 (K3) 3 2 1 - - - - - - - -

CO4 (K2) 2 1 - - - - - - - - -

CO5 (K3) 3 2 1 - - - - - - - -


CO/ PSO PSO1 (K3) PSO2 (K3) PSO3 (K2)

CO1 (K2) 2 - -

CO2 (K3) 3 - -

CO3 (K3) 3 - 3

CO4 (K2) 2 - -

CO5 (K3) 3 - 3

UNIT-I:

Directory Services and JNDI:

Naming and Directory Services, Using JNDI, Java and LDAP, LDAP operations, Searching

an LDAP Server.

AR19 MCA


UNIT-II:

Distributed Computing Using RMI:

RMI Architecture, Locating Remote Objects and Developing Applications with RMI,

Parameter passing in RMI, RMI firewalls and HTTP.

UNIT-III:

Java Beans:

Introduction to Java Beans, Advantages of Java Beans, BDK Introspection, Using Bound

properties, Bean Info Interface, Constrained properties Persistence, Customizes, Java

Beans API, Introduction to EJB’s, EJB Architecture and Design: EJB Container and its

services, Working with EJBs, Design of the EJB Tier.

UNIT-IV:

Web Servers and Servlets:

Tomcat web server, Introduction to Servlets: Lifecycle of a Servlet, JSDK, The Servlet

API, The java x. servlet Package, Reading Servlet parameters, Reading Initialization

parameters. The java x. servlet HTTP package, Handling Http Request & Responses,

Using Cookies-Session Tracking, Security Issues.

UNIT-V:

Database Access:

Database Programming using JDBC, Studying Java x. sql.* package, J2EE and Web

Services: Web Service Technologies (SOAP, WSDL, and UDDI), Developing Web

services, making Services smarter.

Text Books:

1. Professional Java Server Programming, J2EE 1.3 edition, APRESS

publications. (Units 1,2,4,8).

2. The complete Reference Java 8th Edition by Patrick Naughton and Herbert

Schildt, TMH. (Units 3,5,6,7).

Reference Books:

1. Programming world wide web-Sebesta, Pearson.

2. Core SERVLETS AND JAVA SERVER PAGES VOLUME 1: CORE

TECHNOLOGIES By Marty Hall and Larry Brown Pearson.

3. Internet and World Wide Web – How to program by Dietel and Nieto

PHI/Pearson Education Asia.

4. Murach’s beginning JAVA JDK 5, Murach, SPD.

5. An Introduction to web Design and Programming –Wang-Thomson.

6. Web Applications Technologies Concepts-Knuckles, John Wiley.

7. Web Warrior Guide to Web Programmming-Bai/Ekedaw-Thomas.

8. Beginning Web Programming-Jon Duckett WROX.

Web Links:

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

2. https://lecturenotes.in/notes/22458-note-for-advanced-java-programming-ajp-by-

umesh-kumar

3. https://www.scribd.com/document/348664683/Advanced-Java-Programming-

Notes

4. https://lecturenotes.in/subject/368/advanced-java-programming-ajp

****

https://lecturenotes.in/notes/22458-note-for-advanced-java-programming-ajp-by-umesh-kumar

https://lecturenotes.in/notes/22458-note-for-advanced-java-programming-ajp-by-umesh-kumar

https://www.scribd.com/document/348664683/Advanced-Java-Programming-Notes

https://www.scribd.com/document/348664683/Advanced-Java-Programming-Notes

https://lecturenotes.in/subject/368/advanced-java-programming-ajp

AR19 MCA


OBJECT ORIENTED ANALYSIS AND DESIGN

Course Objectives:

COB 1: To understand the Object-based view of Systems.

COB 2: To develop robust object-based models for Systems.

COB 3: To inculcate necessary skills to handle complexity in software design.

COB 4: To focus on design rather than implementation. COB 5: To enable the students learn different case studies with modeling aspects.

Course Outcomes:


CO 1: Develop software projects with management perspective.

CO 2: Explain the object-oriented software development process and

methodologies.

CO 3: Compare various object relationships like inheritance, association, whole-

part and dependency relationships.

CO 4: Apply rational software suite for the construction of UML models by using

appropriate notations.

CO 5: Analyze and model software specifications.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 3 3 3 - 2 - - 3 - - -

CO2 (K2) 3 2 3 - 2 - - 2 - - -

CO3 (K3) 3 3 3 - 2 - - 3 - - -

CO4 (K3) 3 3 3 - 2 - - 3 - - -

CO5 (K5) 3 3 3 - 2 - - 3 - - -



CO1 (K3) 3 3 2

CO2 (K2) 3 2 2

CO3 (K3) 3 3 2

CO4 (K3) 3 3 2

CO5 (K5) 3 3 2

UNIT-I:

Introduction to UML: The meaning of Object-Orientation, object identity,

encapsulation, information hiding, polymorphism, genericity, importance of modelling,

principles of modelling, object oriented modelling, conceptual model of the UML,

Architecture.



AR19 MCA


UNIT-II:

Basic structural Modelling: Classes, relationships, common mechanisms, diagrams,

Advanced structural modelling: advanced relationships, interfaces, types & roles,

packages, instances, Class & object diagrams: Terms, concepts, examples, modelling

techniques, class & Object diagrams.

UNIT-III:

Collaboration diagrams: Terms, Concepts, depicting a message, polymorphism in

collaboration diagrams, iterated messages, use of self in messages.

Sequence diagrams: Terms, concepts, differences between collaboration and sequence

diagrams, depicting synchronous messages with/without priority call back mechanism

broadcast message.

UNIT-IV:

Behavioral Modelling: Interactions, use cases, use case diagrams, activity diagrams,

Advanced Behavioral Modelling: Events and signals, state machines, processes &

threads, time and space, state chart diagrams.

UNIT-V:

Architectural Modelling: Terms, concepts, examples, modelling techniques for

component diagrams and deployment diagrams

Text Books:

1. The Unified Modelling Language User Guide, Grady Booch, Rambaugh, Ivar

Jacobson, PEA, 2nd Edition.

2. Fundamentals of Object Oriented Design in UML, Meilir Page Jones, Addison

Wesley, 1st Edition.

Reference Books:

1. Head First Object Oriented Analysis & Design, Mclaughlin, SPD O’Reilly, 2006

2. Object oriented Analysis& Design Using UML, Mahesh, PHI

3. The Unified Modeling Language Reference Manual, 2/e, Rambaugh, Grady

Booch, etc., PEA.

4. Object Oriented Analysis & Design, Satzinger, Jackson and Thomson

5. Object Oriented Analysis Design & Implementation, Dathan, Ramnath,

University Press.

6. Object Oriented Analysis & Design, John Deacon, PEA.

7. Fundamentals of Object Oriented Analysis and Design in UML, M Pages Jones,

PEA.

8. Object-Oriented Design with UML, Barclay, Savage, Elsevier, 2008.

Web Links:

1. https://www.udemy.com/course/oo-analysis-design-programming/

2. https://swayam.gov.in/nd1_noc19_cs48/preview.

3. https://www.coursera.org/learn/object-oriented-design.

4. https://www.tutorialspoint.com/object_oriented_analysis_design/index.htm.

5. https://www.geeksforgeeks.org/unified-modeling-language-uml

****

https://www.udemy.com/course/oo-analysis-design-programming/

https://swayam.gov.in/nd1_noc19_cs48/preview

https://www.coursera.org/learn/object-oriented-design

https://www.tutorialspoint.com/object_oriented_analysis_design/index.htm

http://www.geeksforgeeks.org/unified-modeling-language-uml

AR19 MCA


DATABASE MANAGEMENT SYSTEMS LAB



Course Objectives:

COB 1: To impart the fundamentals on the relational data model.

COB 2: To make the students to implement SQL and procedural interfaces to SQL.

COB 3: To illustrate the components of SQL and its applications.

COB 4: To interpret the concepts and techniques relating to query processing by SQL.

COB 5: To impart knowledge on the development of packages.

Course Outcomes:

At the end of the course student will be able to:

CO 1: Make use of the concepts of relational model techniques for database design.

CO 2: Build a database schema for a given problem-domain.

CO 3: Apply Normalization techniques on a database to avoid anomalies.

CO 4: Build queries on a database using SQL DML/DDL commands.

CO 5: Apply integrity constraints on a database using RDBMS.

CO 6: Develop PL/SQL stored procedures, stored functions, cursors and packages.

CO 7: Build GUI applications using 4GL.




1. Execute all DDL, DML and DCL commands on sample tables.

2. Implementation of different types of operators and built-in functions with suitable

examples

3. Create views, partitions, Sequence, Indexes and locks for a particular DB.

CO/PO PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO11

(K3)

CO1 (K3) 3 2 2 1 2 - - - - - -

CO2 (K3) 3 2 2 2 2 - - - - - -

CO3 (K3) 3 2 2 2 2 - - - - - -

CO4 (K3) 3 2 2 2 2 - - - - - -

CO5 (K3) 3 2 2 2 2 - - - - - -

CO6 (K3) 3 2 2 2 2 - - - - - -

CO7 (K3) 3 2 2 2 2 - - - - - -


CO1 (K3) 3 1 2

CO2 (K3) 3 1 2

CO3 (K3) 3 1 2

CO4 (K3) 3 1 2

CO5 (K3) 3 1 2

CO6 (K3) 3 1 2

CO7 (K3) 3 1 2

AR19 MCA


4. Implement different types of constraints on relations.

5. Implementation of sub queries and nested queries.

6. Implementation of different types of joins with suitable examples

7. Write PL/SQL block for an application using exception handling.

8. Write PL/SQL block for an application using cursors and all types of triggers.

9. Write a DBMS program to prepare Pl/SQL reports for an application using

functions.

10. Write a PL/SQL block for transaction operations of a typical application using

package.

11. Design and develop an application using any front end and back end tool (make

use of ER diagram and DFD).

12. Typical Applications – Banking, Electricity Billing, Library Operation, Pay

roll, Insurance, Inventory etc.

Text Books:

1. ORACLE PL/SQL by example. Benjamin Rosenzweig, Elena Silvestrova,

Pearson Education 3rd Edition

2. ORACLE DATA BASE LOG PL/SQL Programming SCOTT URMAN, Tata

Mc-Graw Hill.

3. SQL & PL/SQL for Oracle 10g, Black Book, Dr.P.S. Deshpande.

4. Data Base Management System, Oracle SQL and PL/SQL, Pranab kumar Das

Gupta, P Radha Krishna, PHI.

Web Links:


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

3. https://www.plsql.co/

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

http://nptel.ac.in/courses/106106093/6

http://www.tutorialspoint.com/plsql/

https://www.plsql.co/

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

AR19 MCA


ADVANCED JAVA PROGRAMMING LAB

Course Objectives:

COB 1: To demonstrate client-server applications.

COB 2: To enable the students in developing web applications using Servlets.

COB 3: To impart knowledge on Java Beans and its applications.

COB 4: To impart knowledge on JDBC connectivity.

Course Outcomes:


CO 1: Develop Client Server applications using TCP-IP and UDP sockets.

CO 2: Develop a web application using Servlets.

CO 3: Make use of different properties of Java Beans.

CO 4: Develop enterprise applications using Entity Bean, Entity-Session

Bean and Message-Driven Beans.

CO 5: Construct stand-alone applications using JDBC concepts.




1. Write a Program for Sending e-mail in Java.

2. Write a Program to implement Single Client-Server Communication.

3. Write a Java Program to implement Client – Server Communication using RMI.

4. Write a Java Servlet Program to implement and demonstrate get() and post()

methods(Using HTTP Servlet Class).

5. Write a Program for Displaying Multiplication Table in Servlet for a Number

Entered in Html Page.

6. Write a Program for Designing a Login Form Using Html and Displaying the

Contents of the Login Form along with Date and Time in Servlet (Html to

Servlet Communication)



CO/PO

PO 1

(K3)

PO 2

(K4)

PO 3

(K5)

PO 4

(K5)

PO 5

(K3)

PO 6

(K3)

PO 7

(K2)

PO 8

(K3)

PO 9

(K2)

PO 10

(K2)

PO 11

(K3)

CO1 (K3) 3 2 1 - - - - - - - -

CO2 (K3) 3 2 1 - - - - - - - -

CO3 (K3) 3 2 1 - - - - - - - -

CO4 (K3) 3 2 1 - - - - - - - -

CO5 (K3) 3 2 1 - - - - - - - -


CO1 (K3) 3 - -

CO2 (K3) 3 - 3

CO3 (K3) 3 - 3

CO4 (K3) 3 - -

CO5 (K3) 3 - 3

AR19 MCA


7. Write a Java Servlet Program to Auto Web Page Refresh (Consider a webpage

which is displaying Date and time or stock market status. For all such type of

pages, you would need to refresh your web page regularly; Java Servlet makes

this job easy by providing refresh automatically after a given interval).

8. Write a Program Login Form Validation using JavaBeans.

9. An EJB application that demonstrates Session Bean (with appropriate business

logic).

10. An EJB application that demonstrates MDB (with appropriate business logic).

11. An EJB application that demonstrates persistence (with appropriate business

logic).

12. Write a Program to implement the Login_Id Form using JDBC.

13. Write a Program to implement the SQL commands using JDBC.

14. Implement a program to execute selected query using JDBC.

15. Write a program to update the customer information using JDBC.

16. Write a Program for Marks List Processing in Servlet with Records Taken from

MS-Access (Servlet and JDBC connectivity)

References:

1. Programming world wide web-Sebesta, Pearson.

2. Internet and World Wide Web – How to program by Dietel and Nieto PHI/Pearson

Education Asia.

3. Core SERVLETS AND JAVA SERVER PAGES VOLUME 1: CORE

TECHNOLOGIES By Marty Hall and Larry Brown Pearson.

Web Links:

1. https://www.annauniversityplus.com/plus/showthread.php?tid=1522

2. https://www.geeksforgeeks.org/enterprise-java-beans-ejb/

3. https://www.geeksforgeeks.org/establishing-jdbc-connection-in-java/

4. https://www.geeksforgeeks.org/socket-programming-in-java/

5. https://www.tutorialspoint.com/servlets/

****

https://www.annauniversityplus.com/plus/showthread.php?tid=1522

https://www.geeksforgeeks.org/enterprise-java-beans-ejb/

https://www.geeksforgeeks.org/establishing-jdbc-connection-in-java/

https://www.geeksforgeeks.org/socket-programming-in-java/

https://www.tutorialspoint.com/servlets/

AR19 MCA


OOAD THROUGH UML LAB

Course Objectives:

COB 1: To know the practical issues of the different object oriented analysis and

design concepts.

COB 2: Inculcate the art of object oriented software analysis and design.

COB 3: Apply forward and reverse engineering of a software system.

COB 4: Carry out the analysis and design of a system in an object oriented way.

COB 5: To enable the students learn different case studies with modeling aspects

Course Outcomes:


CO 1: Explain the syntax of different UML diagrams.

CO 2: Create use case documents that capture requirements for a software

system.

CO 3: Develop class diagrams that model both the domain model and design

model of a software system.

CO 4: Create interaction diagrams that model the dynamic aspects of a

software system.

CO 5: Construct code that builds a software system.

CO 6: Develop simple applications.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K2) 3 2 2 - 2 - - 2 - - -

CO2 (K6) 3 3 3 - 2 - - 2 - - -

CO3 (K6) 3 3 3 - 2 - - 2 - - -

CO4 (K6) 3 3 3 - 2 - - 2 - - -

CO5 (K6) 3 3 3 - 2 - - 2 - - -

CO6 (K6) 3 3 3 - 2 - - 2 - - -



CO1 (K3) 3 3 2

CO2 (K3) 3 2 2

CO3 (K1) 3 3 2

CO4 (K3) 3 3 2

CO5 (K3) 3 3 2

CO6 (K3) 3 3 2

Note: For performing the experiments consider any case study (ATM/ Banking/ Library

/Hospital management systems).

Week 1

1.1) Familiarization with Rational Rose or Umbrella environment



AR19 MCA


Week 2

2.1) Identify and analyze events

2.2) Identify Use cases

2.3) Develop event table

Week 3

3.1) Identify &analyze domain classes

3.2) Represent use cases and a domain class diagram using Rational Rose

3.3) Develop CRUD matrix to represent relationships between use cases and problem

domain classes

Week 4

4.1) Develop Use case diagrams

4.2) Develop elaborate Use case descriptions & scenarios

4.3) Develop prototypes (without functionality)

Week 5

5.1) Develop system sequence diagrams and high-level sequence diagrams for each use

case

5.2) Identify MVC classes / objects for each use case

5.3) Develop Detailed Sequence Diagrams / Communication diagrams for each use case

showing interactions among all the three-layer objects

Week 6

6.1) Develop detailed design class model (use GRASP patterns for responsibility

assignment)

6.2) Develop three-layer package diagrams for each case study

Week 7

7.1) Develop Use case Packages

7.2) Develop component diagrams

7.3) Identify relationships between use cases and represent them

7.4) Refine domain class model by showing all the associations among classes.

Week 8

8.1) Develop sample diagrams for other UML diagrams - state chart diagrams, activity

diagrams and deployment diagrams

Reference Books:

1. Object-oriented analysis and design using UML, MaheshP. Matha, PHI.

2. Head first object-oriented analysis and design, Brett D. McLaughlin, Gary Pollice,

Dave West, O ‟Reilly.

3. Object-oriented analysis and design with the Unified process, John W. Satzinger,

Robert B. Jackson, Stephen D. Burd, Cengage Learning,

4. The Unified modeling language Reference manual, James Rumbaugh, Ivar

Jacobson, Grady Booch, Addison-Wesley.

5. Object Oriented Analysis &Design, Atul Kahate, The McGraw-Hills Companies.

AR19 MCA


Web Links:

1. https://www.udemy.com/course/oo-analysis-design-programming/

2. https://swayam.gov.in/nd1_noc19_cs48/preview.

3. https://www.coursera.org/learn/object-oriented-design.

4. https://www.tutorialspoint.com/object_oriented_analysis_design/index.htm.

5. https://www.geeksforgeeks.org/unified-modeling-language-uml

****

https://www.udemy.com/course/oo-analysis-design-programming/

https://swayam.gov.in/nd1_noc19_cs48/preview

https://www.coursera.org/learn/object-oriented-design

https://www.tutorialspoint.com/object_oriented_analysis_design/index.htm

http://www.geeksforgeeks.org/unified-modeling-language-uml

AR19 MCA


DATA WAREHOUSING AND DATA MINING

IV Semester L T P C


Course Objectives:

COB 1: Be familiar with mathematical foundations of data mining tools.

COB 2: Understand and implement classical models and algorithms in data

warehouses and data mining.

COB 3: Characterize the kinds of patterns that can be discovered by association rule

mining, classification and clustering.

COB 4: Master data mining techniques in various applications like social, scientific

and environmental context .

COB 5: Develop skill in selecting the appropriate data mining algorithm for solving

practical problems.

Course Outcomes:


CO 1: Make use of data pre processing techniques in data mining.

CO 2: Identify appropriate data mining algorithms to solve real world problems.

CO 3: Analyze classification, prediction problems and Association rule discovery.

CO 4: Apply appropriate clustering algorithm on data.

CO 5: Explain the spatial data and web mining techniques.

Mapping of course outcomes with program outcomes:

CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 1 - 1 3 3 - - - - 3 2

CO2 (K3) - 1 - 3- 3 - - - - 3 2

CO3 (K4) - 3 2 3 3 - - - - 2 3

CO4 (K3) 2 - 1 3 3 - - - - 3 2

CO5 (K2) 1 - - - 1 - - - - 3 -

Mapping of course outcomes with program Specific Outcomes:


CO1 (K3) - - 2

CO2 (K3) 2 2 2

CO3 (K4) 2 3 3

CO4 (K3) 1 2 2

CO5 (K2) 2 2 2

UNIT-I:

Introduction to Data mining, types of Data, Data Quality, Data Processing, Measures

of Similarity and Dissimilarity, Exploring Data: Data Set, Summary Statistics,

Visualization, OLAP and multi dimensional data analysis.

UNIT-II:

Classification: Basic Concepts, Decision Trees and model evaluation: General

approach for solving a classification problem, Decision Tree induction, Model over

fitting: due to presence of noise, due to lack of representation samples, Evaluating the

performance of classifier. Nearest Neighborhood classifier, Bayesian Classifier,

Support vector Machines: Linear SVM, Separable and Non Separable case.

AR19 MCA


UNIT-III:

Association Analysis: Problem Definition, Frequent Item-set generation, rule

generation, compact representation of frequent item sets, FP-Growth Algorithms.

Handling Categorical, Continuous attributes, Concept hierarchy, Sequential, Sub

graph patterns.

UNIT-IV:

Clustering: Over view, K-means, Agglomerative Hierarchical clustering, DBSCAN,

Cluster evaluation: overview, Unsupervised Cluster Evaluation using cohesion and

separation, using proximity matrix, Scalable Clustering algorithm.

UNIT-V:

Web data mining: Introduction, Web terminology and characteristics, Web content

mining, Web usage mining, web structure mining, Search Engines: Characteristics,

Functionality, Architecture, Ranking of Web Pages, Enterprise search.

Text Books:

1. Introduction to Data Mining: Pang-Ning tan, Michael Steinbach, Vipin kumar,

Addision- Wesley.

2. Introduction to Data Mining with Case Studies: GK Gupta; Prentice Hall.

Reference Books:

1. Data Mining: Concepts and Techniques, Jiawei Han and Micheline Kamber, 2nd

Edition, Elsevier

2. Data Mining: Introductory and Advanced Topics, Margaret H Dunham,

Pearson, 2008.

3. Data Mining Techniques and Applications An Introduction, Hongbo Du, 1 st

Edition, Cengage India, 2013

4. Data Warehousing, Data Mining and OLAP, Alex Berson, Stephen J. Smith,

McGraw-Hill series .

5. Data Mining Techniques, Arun K Pujari, Universities Press.

Web Links:

1. https://nptel.ac.in/courses/106105174/

2. https://www.kdnuggets.com/

3. https://www.import.io/post/data-scientists-vs-data-analysts-why-the- distinction-

matters/

4. http://www.computerscijournal.org/vol8no1/a-comparative-study-of-

classification-techniques-in-data-mining-algorithms/

5. https://www.techopedia.com/definition/30306/association-rule-mining

https://www.import.io/post/data-scientists-vs-data-analysts-why-the-

AR19 MCA


FULL STACK TECHNOLOGIES

IV Semester L T P C


Course Objectives:

COB 1: Translate user requirements into the overall architecture and implementation

of new systems and Manage Project and coordinate with the Client.

COB 2: Write backend code in Python/Java, PHP languages and Writing optimized

front end code HTML and JavaScript

COB 3: Understand, create and debug database related queries and Create test code to

validate the applications against client requirement.

COB 4: Monitor the performance of web applications & infrastructure and

Troubleshooting web application with a fast and accurate a resolution.

Course Outcomes:


CO 1: Illustrate the Basic Concepts of Web & Markup Languages.

CO 2: Develop web Applications using Scripting Languages & Frameworks.

CO 3: Build Applications using JSP libraries.

CO 4: Make use of Angular JS and Nested Forms with ng-from to develop Our

First Controller and form validations.

CO 5: Working with the Files in React JS and Constructing Elements with Data.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K2) 1 1 - - 2 - - - - 3 -

CO2 (K3) 2 2 1 - 3 - - - - 3 -

CO3 (K3) 2 2 1 - 3 - - - - - -

CO4 (K3) 2 2 1 - 3 - - - - - -

CO5 (K3) 2 2 - - 3 - - - - 3 -



CO1 (K2) 1 1 1

CO2 (K3) 2 2 2

CO3 (K3) 2 - 2

CO4 (K3) 2 - 2

CO5 (K3) 2 - 2

UNIT-I:

HTML:

Web Essentials: Clients, Servers, and Communication. The Internet-Basic Internet

Protocols -The World Wide Web-HTTP request message-response message-Web

Clients Web Servers. Markup Languages: XHTML an Introduction to HTML,

History, Versions, Basic, XHTML Syntax and Semantics Some Fundamental HTML

Elements-Relative URLs-Lists-tables-Frames-Forms-HTML 5.0.

UNIT-II:

Cascading Style Sheets (CSS):

Style Sheets: CSS-Introduction to Cascading Style Sheets-Features-Core Syntax-

Style Sheets and HTML- Style Rule Cascading and Inheritance-Text Properties-Box

AR19 MCA


Model Normal Flow Box Layout beyond the Normal Flow-CSS3.0, Boot strap

basics, Boot strap CSS3, Introduction to Java Script, Jscript basics, JScripts objects,

JSON, Don.

UNIT-III:

Jscript:

Separating Programming and Presentation: JSP Technology, Introduction to JSP and

Servlets-Running JSP Applications, Basic JSP-JavaBeans Classes and JSP-Tag

Libraries and Files-Support for the Model-View-Controller Paradigm- Mongo DB,

JQuery, Mean stack Fundamentals

UNIT-IV:

Angular Js:

Introducing Angular JS, Starting Out with Angular JS, Basic Angular JS, Directives

and Controllers, Angular JS Modules, Creating First Controller, working with and

Displaying, Arrays, more Directives, working with ng-repeat, Unit Testing in

Angular JS, Forms, Inputs, and Services, Working with ng-model, Working with

Forms, Leverage Data-Binding and Models, Form Validation and States, Error

Handling with Forms, ng Model Options, Nested Forms with ng-form, Other Form

Controls.

UNIT-V:

React JS:

Introduction to React, Obstacles and Roadblocks, keeping Up with the Changes,

Working with the Files, Pure React, Page Setup, The Virtual DOM, React Elements,

React DOM, Children, Constructing Elements with Data, React Components, DOM

Rendering, Factories

Text Books:

1. Jeffrey C. Jackson, "Web Technologies--A Computer Science Perspective",

Pearson Education, 2006

2. Robert. W. Sebesta, "Programming the World Wide Web", Fourth Edition,

Pearson Education, 2007.

3. Angular JS: Up and Running Enhanced Productivity with Structured Web Apps

By Brad Green, Shyam Seshadri Publisher: O'Reilly Media

4. Learning React Functional Web Development with React and Redux By Alex

Banks, Eve Porcello Publisher: O'Reilly Media

5. Head First Java, 2nd Edition by Bert Bates, Kathy Sierra Publisher: O'Reilly

Media, Inc

Web Links:

1. https://www.udacity.com/course/full-stack-web-developer-nanodegree--nd0044

2. https://www.w3schools.com/whatis/whatis_fullstack.asp

3. https://www.coursera.org/specializations/full-stack-mobile-app-development

4. https://www.edureka.co/blog/how-to-become-a-full-stack-web-developer/

5. https://www.geeksforgeeks.org/what-is-full-stack-development/

AR19 MCA


PYTHON PROGRAMMING

IV Semester L T P C


Course Objectives:

COB 1: To impart basic programming skills in core Python.

COB 2: To facilitate the students, apply control statements in Python Scripts.

COB 3: To make the students learn lists, tuples, sets and dictionaries in Python.

COB 4: To impart the knowledge on handling functions and modules.

COB 5: To demonstrate the Object Oriented Concepts, exceptions, standard

libraries and testing in python.

Course Outcomes:


CO 1: Develop programs using fundamental concepts in python.

CO 2: Develop programs using control statements in python.

CO 3: Utilize data structures in Python to solve various problems.

CO 4: Develop programs using functions.

CO 5: Apply Object Oriented Programming concepts, exceptions and testing in

building real time applications.

CO 6: Develop programs using Standard libraries like math, turtle, tkinter, re etc.

in building real time applications.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 2 2 2 - 3 - - - - - -

CO2 (K3) 2 2 2 - 3 - - - - - -

CO3 (K3) 2 2 2 - 3 - - - - - -

CO4 (K3) 2 2 2 - 3 - - - - - -

CO5 (K3) 2 2 2 - 3 - - - - - -

CO6 (K3) 2 2 2 - 3 - - - - - -



CO1 (K3) 1 2 2

CO2 (K3) 1 2 2

CO3 (K3) 1 2 2

CO4 (K3) 1 2 2

CO5 (K3) 1 2 2

CO6 (K3) 1 2 2

UNIT-I:

Introduction:

History of Python, Need of Python Programming, Applications Basics of Python

Programming Using the REPL(Shell), Running Python Scripts, Variables,

Assignment, Keywords, Input-Output, Indentation.

UNIT-II:

Types, Operators and Expressions:

Types - Integers, Strings, Booleans; Operators- Arithmetic Operators, Comparison

(Relational) Operators, Assignment Operators, Logical Operators, Bitwise Operators,

Membership Operators, Identity Operators, Expressions and order of evaluations

AR19 MCA


Control Flow- if, if-elif-else, for, while, break, continue, pass.

UNIT-III:

Data Structures-Lists- Operations, Slicing, Methods, Tuples, Sets, Dictionaries,

Sequences, Comprehensions.

UNIT-IV:

Functions - Defining Functions, Calling Functions, Passing Arguments, Keyword

Arguments, Default Arguments, Variable-length arguments, Anonymous Functions,

Fruitful Functions (Function Returning Values), Scope of the Variables in a Function

- Global and Local Variables

Modules: Creating modules, import statement, from. Import statement, name spacing

Python packages, Introduction to PIP, Installing Packages via PIP, Using Python

Packages.

UNIT-V:

Object Oriented Programming OOP in Python: Classes, 'self variable', Methods,

Constructor Method, Inheritance, Overriding Methods, Data hiding.

Error and Exceptions: Difference between an error and Exception, Handling

Exception, try except block, Raising Exceptions, User defined Exceptions.

Brief Tour of the Standard Library - Operating System Interface - String Pattern

Matching, Mathematics, Internet Access, Dates and Times, Data Compression,

Multithreading, GUI Programming, Turtle Graphics.

Testing: Why testing is required?, Basic concepts of testing, Unit testing in Python,

Writing Test cases, Running Tests.

Text Books:

1. Python Programming: A Modern Approach, Vamsi Kurama, Pearson

2. Learning Python, Mark Lutz, Orielly

Reference Books:

1. Think Python, Allen Downey, Green Tea Press.

2. Core Python Programming, W.Chun, Pearson.

3. Introduction to Python, Kenneth A. Lambert, Cengage.

Web Links:

1. https://www.python.org

2. https://www.coursera.org/courses?query=Python%20programming

3. https://www.learnPython.org/

4. https://www.tutorialspoint.com/python3/python_tutorial.pdf

5. http://www.geeksforgeeks.org/Python/

AR19 MCA


EMBEDDED COMPUTING

IV Semester L T P C

Course Code: 193MC4E01 3 0 0 3

Course Objectives:

COB 1: Develop an understanding of the technologies behind embedded computing

systems.

COB 2: Introduce students to the various software components involved in

embedded system design and development.

COB 3: Expose students to the recent trends in embedded system design.

Course Outcomes:


CO 1: Understand the differences between the general computing system and the

embedded system, also recognize the classification of embedded systems.

CO 2: Analyze the characteristics of different computing elements and select the

most appropriate one for an embedded system.

CO 3: Model the operation of a given embedded system.

CO 4: Understand different software modules in the development of an embedded

system.

CO 5: Illustrate simple tasks to run on an RTOS and examine the latest trends

prevalent in embedded system design.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K2) 1 1 1 2 2 2 - - - - -

CO2 (K4) 2 3 - 3 3 3 - - - - -

CO3 (K3) 1 2 - 3 3 2 - - - - -

CO4 (K2) 1 1 1 - 2 2 - 2 2 - -

CO5 (K2) 1 1 1 - 2 1 - 2 2 - -



CO1 (K2) 1 2 1

CO2 (K4) 2 3 3

CO3 (K3) 2 2 3

CO4 (K2) 1 1 1

CO5 (K2) 1 1 1

UNIT-I:

Introduction to Embedded System: Understanding the Basic Concepts, The Typical

Embedded System – Characteristics and Quality attributes.

UNIT-II:

Hardware Software Co-Design and Program Modelling – Fundamental Issues,

Computational Models- Data Flow Graph, Control Data Flow Graph, State Machine,

Sequential Model, Concurrent Model, Object oriented model, UML.

UNIT-III:

Design and Development of Embedded Product – Firmware Design and Development –

Design Approaches, Firmware Development Languages.

AR19 MCA


UNIT-IV:

Integration and Testing of Embedded Hardware and Firmware- Integration of Hardware

and Firmware. Embedded System Development Environment – IDEs, Cross Compilers,

Disassemblers, Decompilers, Simulators, Emulators and Debuggers.

UNIT-V:

RTOS based Design – Basic operating system services. Interrupt handling in RTOS

environment. Design Principles. Task scheduling models. How to Choose an RTOS.

Embedded Product Development Life Cycle – Description – Objectives -Phases –

Approaches. Recent Trends in Embedded Computing.

Text Books:

1. Shibu K.V., Introduction to Embedded Systems, McGraw Hill Education (India),

2009.

2. Raj Kamal, Embedded Systems: Architecture, Programming and Design, Third

Edition, McGraw Hill Education (India).

Reference Books:

1. Jean J. Labrose, Micro C OS II: The Real Time Kernel, Second Edition, CRC

Press.

2. Steave Heath, Embedded System Design, Second Edition, Elsevier.

3. J Staunstrup and Wayne Wolf, Hardware / Software Co-Design: Principles and

Practice, Prentice Hall.

Web Links:

1. https://books.google.co.in/books?isbn=1111781389





AR19 MCA


ARTIFICIAL INTELLIGENCE

IV Semester L T P C


Course Objectives:

COB 1: Gain a historical perspective of AI and its foundations.

COB 2: Become familiar with basic principles of AI toward problem solving,

inference, perception, knowledge representation, and learning.

COB 3: Investigate applications of AI techniques in intelligent agents, expert

systems, artificial neural networks and other machine learning models.

COB 4: Experience AI development tools such as an ‘AI language’, expert system

shell, and/or data mining tool. Experiment with a machine learning model

for simulation and analysis.

COB 5: Explore the current scope, potential, limitations, and implications of

intelligent systems.

Course Outcomes:


CO 1: Demonstrate knowledge of the building blocks of AI as presented in terms

of intelligent agents.

CO 2: Analyze and formalize the problem as a state space, graph, design heuristics

and select amongst different search or game based techniques to solve them

CO 3: Develop intelligent algorithms for constraint satisfaction problems and also

design intelligent systems for Game Playing

CO 4: Attain the capability to represent various real life problem domains using

logic based techniques and use this to perform inference or planning

CO 5: Solve problems with uncertain information using Bayesian approaches.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K2) 1 1 - 1 1 - - - - - -

CO2 (K4) 2 3 - 3 2 - - - - - -

CO3 (K3) 1 2 - 3 3 - - - - - -

CO4 (K3) 1 2 - 3 3 - - - - - -

CO5 (K3) 1 2 - 3 3 - - - - - -


CO / PSO PSO 1(K5) PSO 2(K4) PSO 3(K4)

CO1 (K2) 1 2 2

CO2 (K4) 2 3 3

CO3 (K3) 1 2 -

CO4 (K3) 1 2 2

CO5 (K3) 2 3 3

UNIT-I: Introduction to Artificial Intelligence: Introduction, Brief History, Intelligent Systems, Foundations of AI, Applications, Tic-Tac-Toe Game Playing, Development of AI Languages, Current Trends in AI. Problem Solving: State-Space Search and Control Strategies: Introduction, General Problem Solving, Characteristics of Problem, Exhaustive Searches, Heuristic Search Techniques, Iterative-Deepening A*, Constraint Satisfaction.

AR19 MCA


UNIT-II: Problem Reduction and Game Playing: Introduction, Problem Reduction, Game Playing, Alpha-Beta Pruning, Two-Player Perfect Information Games. Logic concepts: Introduction, propositional calculus, propositional logic, natural deduction system, axiomatic system, semantic tableau system in propositional logic, resolution refutation in propositional logic, predicate logic.

UNIT-III: Knowledge representation: Introduction, approaches to knowledge representation, knowledge representation using semantic network, extended semantic networks for KR, knowledge representation using frames. Advanced knowledge representation techniques: Introduction, conceptual dependency theory, script structure, cyc theory, case grammars, semantic web. Expert system and Applications:

Introduction, phases in building expert systems, expert system architecture, expert

system versus traditional systems, rule-based expert systems, application of expert

systems, list of shells and tools.

UNIT-IV:

Uncertainty measure: probability theory:

Introduction, probability theory, Bayesian belief networks, certainty factor theory,

dempster-shafer theory. Fuzzy sets and fuzzy logic: Introduction, fuzzy sets, fuzzy set operations, types of membership functions, multi valued logic, fuzzy logic, fuzzy propositions, inference rules for fuzzy propositions, fuzzy systems.

UNIT-V:

Machine learning paradigms:

Introduction, machine learning systems, supervised and unsupervised learnings,

inductive learning, deductive learning, clustering, support vector machines, case-based

reasoning and learning,

Artificial neural networks:

Introduction, artificial networks, single layer feed forward networks, multi layered

forward networks, design issues of artificial neural networks.

Text Books:

1. Artificial Intelligence- Saroj Kaushik, CENGAGE Learning.

2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter Norvig,

PEA.

3. Artificial Intelligence-3rd ed Rich, Kevin Knight, Shiy Shankar B Nair, TMH.

4. Introduction to Artificial Intelligence, Patterson, PHI

Reference Books:

1. Artificial intelligence, structures and Strategies for Complex problem solving, -

George F Lugar, 5th ed, PEA.

2. Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer.

3. Artificial Intelligence, A new Synthesis, Nils J Nilsson, Elsevier.

AR19 MCA


Web Links:

1. https://nptel.ac.in/courses/106/105/106105079/

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

3. https://onlinecourses.nptel.ac.in/noc17_cs30/

4. https://www.slideshare.net/girishnaik/artificial-intelligence-3638681/

5. https://www.mindmeister.com/44054594/expert-systems/

https://www.tutorialspoint.com/artificial_intelligence/

https://onlinecourses.nptel.ac.in/noc17_cs30/

https://www.slideshare.net/girishnaik/artificial-intelligence-3638681/

AR19 MCA


CLOUD COMPUTING IV Semester L T P C


Course Objectives:

COB 1: To impart knowledge on fundamentals of Cloud Computing.

COB2: To create awareness on Virtualization, Task Scheduling algorithms.

COB 3: To make the students apply Map-Reduce concept to applications.

COB 4: To help the students to build Private Cloud.

COB 5: Broadly educate to know the impact of engineering on legal and societal

issues involved.

Course Outcomes:


CO 1: Explain the key dimensions of Cloud Computing and Parallel &

Distributed Systems.

CO 2: Analyze the Cloud Infrastructures and cloud computing for own

organization.

CO 3: Demonstrate the basic concepts of virtualization, Resource Management

and Scheduling.

CO 4: Illustrate the Cloud Storage Systems and Security Risks.

CO 5: Apply the Cloud programming on any real Cloud Development Platforms.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K2) 1 - - - - - - - - - -

CO2 (K4) 2 3 2 - 3 - - - - - -

CO3 (K2) - - - - - - - - - - -

CO4 (K2) - - - - - - - - - - -

CO5 (K3) 1 2 1 3 3 - - - - - -



CO1 (K2) 1 2 -

CO2 (K4) 1 3 -

CO3 (K2) 1 2 -

CO4 (K2) 2 1 -

CO5 (K3) 1 2 -

UNIT-I:

Introduction:

Network centric computing, Network centric content, peer-to –peer systems, cloud

computing delivery models and services, Ethical issues, Vulnerabilities, Major

challenges for cloud computing.

Parallel and Distributed Systems:

Introduction, architecture, distributed systems, communication protocols, logical clocks,

message delivery rules, concurrency, and model concurrency with Petri Nets.

UNIT-II:

Cloud Infrastructure:

At Amazon, The Google Perspective, Microsoft Windows Azure, Open Source Software

Platforms, Cloud storage diversity, Inter cloud, energy use and ecological impact,

AR19 MCA


responsibility sharing, user experience, Software licensing,

Cloud Computing:

Applications and Paradigms: Challenges for cloud, existing cloud applications and new

opportunities, architectural styles, workflows, The Zookeeper, The Map Reduce

Program model, HPC on cloud, biological research.

UNIT-III:

Cloud Resource virtualization:

Virtualization, layering and virtualization, virtual machine monitors, virtual machines,

virtualization- full and para, performance and security isolation, hardware support for

virtualization, Case Study: Xen, vBlades,

Cloud Resource Management and Scheduling:

Policies and Mechanisms, Applications of control theory to task scheduling, Stability of

a two-level resource allocation architecture, feedback control based on dynamic

thresholds, coordination, resource bundling, scheduling algorithms, fair queuing, start

time fair queuing, cloud scheduling subject to deadlines, Scheduling Map Reduce

applications, Resource management and dynamic application scaling.

UNIT-IV:

Storage Systems:

Evolution of storage technology, storage models, file systems and database, distributed

file systems, general parallel file systems. Google file system. Apache Hadoop, Big

Table, Megastore (text book 1), Amazon Simple Storage Service(S3) (Text book 2),

Cloud Security:

Cloud security risks, security – a top concern for cloud users, privacy and privacy

impact assessment, trust, OS security, Virtual machine security, Security risks.

UNIT-V:

Cloud Application Development:

Amazon Web Services : EC2 – instances, connecting clients, security rules, launching,

usage of S3 in Java, Installing Simple Notification Service on Ubuntu 10.04, Installing

Hadoop on Eclipse, Cloud based simulation of a Distributed trust algorithm, Cloud

service for adaptive data streaming ( Text Book 1),

Google: Google App Engine, Google Web Toolkit (Text Book 2),

Microsoft: Azure Services Platform, Windows live, Exchange Online, Share Point

Services, Microsoft Dynamics CRM (Text Book 2).

Text Books:

1. Cloud Computing, Theory and Practice, Dan C Marinescu, MK Elsevier.

2. Cloud Computing, A Practical Approach, Anthony T Velte, Toby J Velte, Robert

Elsenpeter, TMH.

Reference Books:

1. Mastering Cloud Computing, Foundations and Application Programming, Raj

Kumar Buyya, Christen vecctiola, S Tammarai selvi, TMH.

Web Links:

1. https://aws.amazon.com/getting-started/tutorials/


3. https://www.coursera.org/learn/cloud-computing/lecture/VOIHP/introductionto-

cloud-computing-concepts-part-1

4. https://www.udemy.com/amazon-web-services-for-web-hosting-cloudcomputing/

5. https://www.lynda.com/Cloud-Computing-training-tutorials/1385-0.html

AR19 MCA


MULTIMEDIA APPLICATION DEVELOPMENT IV Semester L T P C


Course Objectives:

COB 1: To analyze and explain various technologies involved to support multimedia

application development.

COB2: To understand multimedia authoring and Understanding the constraints on

multimedia systems and the range of technologies available to multimedia systems

designers and integrators.

COB 3: To understand how the quality of multimedia systems is perceived and how this

Relate to the design of multimedia input, output and editing systems.

COB 4: To understand different compression principles and different compression

technique and to know the mathematics involved in digital and analog conversion

of components of multimedia.

COB 5: To design and develop multimedia systems according to the requirements of

multimedia application and understand the particular issues of virtual reality.

Course Outcomes:


CO 1: Explain the fundamental concepts in Text and image.

CO 2: Illustrate the concept of video and digital audio.

CO 3: Develop the real world application frame work.

CO 4: Analyze the multimedia Data compression and basic video compression

techniques.

CO 5: Make use of different multimedia networks.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K2) 2 - 1 2 1 - - - - - -

CO2 (K2) 2 1 - 1 - 2 - - - - -

CO3 (K3) 1 2 - 1 - 1 - - - - -

CO4 (K4) 1 2 3 3 2 - - - - - -

CO5 (K3) 1 - 3 1 - 2 - - - - -



CO1 (K2) 1 - 2

CO2 (K2) 2 - 1

CO3 (K3) 1 1 3

CO4 (K4) - 1 2

CO5 (K3) 1 2 -

UNIT-I:

Fundamental concepts in Text and Image: Multimedia and hypermedia, World Wide

Web, overview of multimedia software tools. Graphics and image data representation

graphics/image data types, file formats,

Color in image and video: color science, color models in images, color models in

video.

UNIT-II:

Fundamental Concepts in Video and Digital Audio: Types of video signals, analog

video, and digital video, digitization of sound, MIDI, quantization and transmission of

AR19 MCA


audio.

UNIT-III:

Action Script I: Action Script Features, Object-Oriented Action Script, Data types and

Type Checking, Classes, Authoring an Action Script Class,

Action Script II: Inheritance, Authoring an Action Script 2.0 Subclass, Interfaces,

Packages, Exceptions, Application Development: An OOP Application Frame work,

Using Components with Action Script Movie Clip Subclasses.

UNIT-IV:

Multimedia Data Compression: Lossless compression algorithm: Run-Length Coding,

Variable Length Coding, Dictionary Based Coding, Arithmetic Coding, Lossless Image

Compression, Lossy compression algorithm: Quantization, Transform Coding, Wavelet-

Based Coding, Embedded Zero tree of Wavelet Coefficients Set Partitioning in

Hierarchical Trees (SPIHT),

Basic Video Compression Techniques: Introduction to video compression, video

compression based on motion compensation, search for motion vectors, MPEG, Basic

Audio Compression Techniques.

UNIT-V:

Multimedia Networks: Basics of Multimedia Networks, Multimedia Network

Communications

and Applications: Quality of Multimedia Data Transmission, Multimedia over IP,

Multimedia over ATM networks, Transport of MPEG- 4, Media-on- Demand (MOD).

Text Books:

1. Fundamentals of Multimedia, Ze-Nian Li , Mark S. Drew, PHI/ PEA.

2. Multimedia Systems, Parag Havaldar, Gerard Medioni, cengage, 2009.

3. Essentials Action Script 3.0, Colin Moock, SPD O, Reilly, 2007.

Reference Books:

1. Multimedia Applications, Steinmetz, Nahrstedt, Springer.

2. Digital Multimedia, Nigel Chapman, Jenny Chapman, Wiley- Dreamtech.

3. Multimedia & Communications Technology, Steve Heath, Elsevier.

4. Multimedia Technology & Applications, David Hilman , Galgotia.

5. Multimedia Technologies, Banerji, Mohan Ghosh, MGH.

Web Links:

1. https://www.computer.org/csdl/magazine/cg/1991/04/mcg1991040052/13rRUEgs2

vs

2. https://nptel.ac.in/noc/courses/noc17/SEM2/noc17-cs40/

3. https://www.bachelorsportal.com/studies/193519/multimedia-applications-develop

ment.html

4. https://www.xoriant.com/interactive-multimedia-applications-development

5. https://www.lynda.com/Cloud-Computing-training-tutorials/1385-0.html

https://www.bachelorsportal.com/studies/193519/multimedia-applications-develop

AR19 MCA


FULL STACK TECHNOLOGIES LAB IV Semester L T P C


Course Objectives:

COB 1: Learn the core concepts of both the frontend and backend programming

course.

COB2: Get familiar with the latest web development technologies.

COB 3: Learn all about SQL and Mongo databases.

COB 4: Learn complete web development process.

Course Outcomes:


CO 1: Develop web Applications using HTML, CSS, Scripting Languages &

Frameworks.

CO 2: Creating & Running Applications using JSP libraries.

CO 3: Creating Our First Controller Working with and Displaying in Angular Js

and Nested Forms with ng-form.

CO 4: Working with the Files in React JS and Constructing Elements with Data.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 3 2 1 - 3 - - - - 3 -

CO2 (K3) 3 2 1 - 3 - - - - - -

CO3 (K3) 3 2 1 - 3 - - - - - -

CO4 (K3) 3 2 - - 3 - - - - - -



CO1 (K3) 3 3 3

CO2 (K3) 3 3 3

CO3 (K3) 3 - 3

CO4 (K3) 3 - 3


Experiment 1:

Implementation of ‘get’ and ‘post’ methods.

Experiment 2:

CSS implementation in colors, boarder padding.

Experiment 3:

CSS3 implementation button frames tables, navigation bars.

Experiment 4:

Create registration and login forms with validations using Jscript query.

Experiment 5:

Jscript to retrieve student information from student database using database

connectivity.

Experiment 6:

Angular Js data binding.

AR19 MCA


Experiment 7:

Angular JS directives and Events.

Experiment 8:

Using angular Js fetching data from MySQL.

Experiment 9:

Using React Js creating constructs data elements.

Experiment 10:

Using React Js implementations DoM

Experiment 11:

Invoking data using Jscript from Mongo DB.

Experiment 12:

Create an Online fee payment form using JSCript and MangoDB.

Reference Books:

1. Jeffrey C. Jackson, "Web Technologies--A Computer Science Perspective",


2. Robert. W. Sebesta, "Programming the World Wide Web", Fourth Edition,


3. Angular JS: Up and Running Enhanced Productivity with Structured Web Apps

By Brad Green, Shyam Seshadri Publisher: O'Reilly Media.

4. Learning React Functional Web Development with React and Redux By Alex

Banks, Eve Porcello Publisher: O'Reilly Media.

5. Head First Java, 2nd Edition by Bert Bates, Kathy Sierra Publisher: O'Reilly

Media, Inc.

Web Links:

1. https://www.udacity.com/course/full-stack-web-developer-nanodegree--nd0044

2. https://www.w3schools.com/whatis/whatis_fullstack.asp

3. https://www.coursera.org/specializations/full-stack-mobile-app-development

4. https://www.edureka.co/blog/how-to-become-a-full-stack-web-developer/

5. https://www.geeksforgeeks.org/what-is-full-stack-development/

AR19 MCA


DATA MINING WITH R LAB IV Semester L T P C


Course Objectives:

COB 1: To understand the mathematical basics quickly and covers each and every

condition of data mining in order to prepare for real-world problems.

COB2: The various classes of algorithms will be covered to give a foundation to

further apply knowledge to dive deeper into the different flavors of

algorithms.

COB 3: Students should aware of packages and libraries of R and also familiar with

functions used in R for visualization.

COB 4: To enable students to use R to conduct analytics on large real life datasets.

COB 5: To familiarize students with how various statistics like mean median etc. can

be collected for data exploration in R.

Course Outcomes:


CO 1: Determine different steps for pre-processing in Data mining.

CO 2: Use data mining software system for solving data mining problems.

CO 3: Experiment with real data sets in data mining tool R.

CO 4: Apply algorithms for Association rule mining.

CO 5: Apply Classification methods for data mining.

CO 6: Demonstrate Clustering approaches in data mining.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 3 - 2 - 3 - - - 3 3 3

CO2 (K3) 3 - 2 - 3 - - - 3 3 3

CO3 (K3) 3 - 2 - 3 - - - 3 1 3

CO4 (K3) 3 - 2 - 3 - - - 3 3 3

CO5 (K3) 3 - 2 - 3 - - - 3 3 -

CO6 (K2) 2 - 1 - 2 - - - 3 3 3



CO1 (K3) 3 3 3

CO2 (K3) 3 3 3

CO3 (K3) 3 3 3

CO4 (K3) 3 3 3

CO5 (K3) 3 3 3

CO6 (K2) 2 2 3


Experiment 1:

Implement all basic R commands.

Experiment 2:

Interact data through .csv files (Import from and export to .csv files).

Experiment 3:

Get and Clean data using swirl excercises. (Use ‘swirl’ package, library and install that

topic from swirl).

AR19 MCA


Experiment 4:

Visualize all Statistical measures (Mean, Mode, Median, Range, Inter Quartile Range

etc., using Histograms, Boxplots and Scatter Plots).

Experiment 5:

Create a data frame with the following structure.

EMP ID EMP NAME SALARY START DATE

1 Satish 5000 01-11-2013

2 Vani 7500 05-06-2011

3 Ramesh 10000 21-09-1999

4 Praveen 9500 13-09-2005

5 Pallavi 4500 23-10-2000

a. Extract two column names using column name.

b. Extract the first two rows and then all columns.

c. Extract 3rd and 5th row with 2nd and 4th column.

Experiment 6:

Write R Program using ‘apply’ group of functions to create and apply normalization

function on each of the numeric variables/columns of iris dataset to transform them into

i. 0 to 1 range with min-max normalization.

ii. a value around 0 with z-score normalization.

Experiment 7:

Create a data frame with 10 observations and 3 variables and add new rows and columns

to it using ‘rbind’ and ‘cbind’ function.

Experiment 8:

Write R program to implement linear and multiple regression on ‘mtcars’ dataset to

estimate the value of ‘mpg’ variable, with best R2 and plot the original values in ‘green’

and predicted values in ‘red’.

Experiment 9:

Write R Programs to implement k-means clustering.

Experiment 10:

Write R Programs to implement k-medoids clustering.

Experiment 11:

Write R Programs to implement density based clustering on iris dataset.

Experiment 12:

Write a R Program to implement decision trees using ‘readingSkills’ dataset.

Experiment 13:

Implement decision trees using ‘iris’ dataset using package party and ‘rpart’.

Experiment 14:

Use a Corpus() function to create a data corpus then Build a term Matrix and Reveal

word frequencies.

AR19 MCA


Reference Books:

1. www.tutorialspoint.com/r

2. www.r-tutor.com

3. R and Data Mining: Examples and Case Studies Yanchang Zhao.

4. https://towardsdatascience.com/

Web Links:

1. https://nptel.ac.in/courses/106105174/

2. www.r-tutor.com

3. https://www.kdnuggets.com/

4. https://hackernoon.com/what-steps-should-one-take-while-doing-datapreprocessing

-502c993e1caa

http://www.tutorialspoint.com/r

http://www.r-tutor.com/

http://www.r-tutor.com/

https://hackernoon.com/what-steps-should-one-take-while-doing-datapreprocessing%20-502c993e1caa

https://hackernoon.com/what-steps-should-one-take-while-doing-datapreprocessing%20-502c993e1caa

AR19 MCA


PYTHON PROGRAMMING LAB IV Semester L T P C


Course Objectives:

COB 1: To enable the students apply basic concepts and Control Structures in

python.

COB2: To make the students utilize data structures and associated methods in

Python.

COB 3: To make the students learn the fundamentals of standard Python libraries.

COB 4: To impart the knowledge on Object Oriented Concepts.

COB 5: To illustrate the concepts of files.

Course Outcomes:


CO 1: Develop programs using conditional and iterative statements.

CO 2: Make use of different data structures in solving complex problems.

CO 3: Apply standard libraries in building real time applications.

CO 4: Analyze the Object Oriented concepts in Python.

CO 5: Solve real world problems using testing in python.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 3 2 1 - 3 - - - - - -

CO2 (K3) 3 2 1 - 3 - - - - - -

CO3 (K3) 3 2 1 - 3 - - - - - -

CO4 (K4) 3 3 2 2 3 - - - - - -

CO5 (K3) 3 2 1 - 3 - - - - - -



CO1 (K3) 3 2 2

CO2 (K3) 3 2 2

CO3 (K3) 3 2 2

CO4 (K4) 3 2 -

CO5 (K3) 3 2 2


Experiment 1 - Basics

a) Running instructions in Interactive interpreter and a Python Script.

b) Write a program to purposefully raise Indentation Error and Correct it.

Experiment 2 - Operations

a) Write a program to compute distance between two points taking input from the user

(Pythagorean Theorem).

b) Write a program add.py that takes 2 numbers as command line arguments and prints

its sum.

Experiment - 3 Control Flow

a) Write a Program for checking whether the given number is a even number or not.

b) Write a program using a for loop that loops over a sequence.

c) Find the sum of all the primes below two million. Each new term in the Fibonacci

sequence is generated by adding the previous two terms. By starting with 1 and 2, the

AR19 MCA


first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

Experiment 4 - DS

a) Write a program to count the numbers of characters in the string and store them in a

dictionary data structure.

b) Write a program to use split and join methods in the string and trace a birthday with a

dictionary data structure.

Experiment - 5 DS - Continued

a) Write a program combine_lists that combines these lists into a dictionary.

b) Write a program to count frequency of characters in a given file. Can you use

character frequency to tell whether the given file is a Python program file, C program

file or a text file?

Experiment - 6 Files

a) Write a program to print each line of a file in reverse order.

b) Write a program to compute the number of characters, words and lines in a file.

Experiment - 7 Functions

a) Write a function ball_collide that takes two balls as parameters and computes if they

are colliding. Your function should return a Boolean representing whether or not the

balls are colliding. Hint: Represent a ball on a plane as a tuple of (x, y, r), r being the

radius. If (distance between two balls centers) <= (sum of their radii) then (they are

colliding).

b) Find mean, median, mode for the given set of numbers in a list.

Experiment - 8 Functions - Continued

a) Write a function nearly_equal to test whether two strings are nearly equal. Two

strings a and b are nearly equal when a can be generated by a single mutation on b.

b) Write a function dups to find all duplicates in the list.

c) Write a function unique to find all the unique elements of a list.

Experiment - 9 - Functions - Problem Solving

a) Write a function cumulative_product to compute cumulative product of a list of

numbers.

b) Write a function reverse to reverse a list. Without using the reverse function.

c) Write function to compute gcd, lcm of two numbers. Each function shouldn’t exceed

one line.

Experiment 10 - Multi-D Lists

a) Write a program that defines a matrix and prints.

b) Write a program to perform addition of two square matrices.

c) Write a program to perform multiplication of two square matrices.

Experiment 11 - Modules

a) Install packages requests, flask and explore them using (pip).

b) Write a script that imports requests and fetch content from the page.

c) Write a simple script that serves a simple HTTP Response and a simple HTML Page.

Experiment 12- OOP

a) Class variables and instance variable and illustration of the self variable.

i) Robot ii) ATM Machine.

Experiment 13 - GUI, Graphics

AR19 MCA


a) Write a GUI for an Expression Calculator using tk.

b) Write a program to implement the following figures using turtle.

Experiment 14 - Testing

a) Write a test-case to check the function even _numbers which return True on passing a

list of all even numbers.

b) Write a test-case to check the function reverse_string which returns the reversed

string. Experiment 15 - Advanced

a) Build any one classical data structure.

b) Write a program to solve knapsack problem.

Reference Books:

1. Python for Everybody Exploring Data in Python 3, Charles Russell Severance,

Sue Blumenberg.

2. Learning Python, Mark Lutz, Orielly.

3. Introduction to Python, Kenneth A. Lambert, Cengage.

Web Links:

1. https://www.hackerrank.com/

2. https://www.codechef.com/

3. https://www.topcoder.com/

4. http://code-cracker.github.io/ *

AR19 MCA


CRYPTOGRAPHY AND NETWORK SECURITY V Semester L T P C


Course Objectives:

COB 1: To teach the basic concepts of the classical systems, symmetric block

ciphers (DES, AES, and other contemporary symmetric ciphers)

COB2: To discuss with students on Public-key cryptography (RSA, discrete

logarithms).

COB 3: To provide knowledge on various algorithms and discrete logarithms,

cryptographic protocols, hash functions, authentication.

COB 4: To illustrate the basic concepts of key management, key exchange

techniques.

COB 5: To make the students learn services of transport layer and application layer.

Course Outcomes:


CO 1: Explain the network security fundamentals and various public key

cryptographic algorithms.

CO 2: Compare various symmetric encryption techniques.

CO 3: Summarize the concepts of asymmetric encryption techniques.

CO 4: Discuss the functioning of digital signature standards and data integrity.

CO 5: Utilize the services provided by the PGP, S/MIME & SSL, TLS.

CO 6: Describe the concept of IP Security.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO 1(K2) 2 1 - - 2 - - - - - -

CO 2(K4) 3 3 - - 3 3 - - - - -

CO 3(K2) 2 1 - - 2 2 - - - - -

CO 4(K2) 2 1 - - 2 2 - - - - -

CO 5(K3) 3 2 - - 3 3 - - - - -

CO 6(K2) 2 1 - - 2 2 - - - - -



CO 1(K2) 2 2 3

CO 2(K4) 3 3 3

CO 3(K2) 2 2 3

CO 4(K2) 2 2 3

CO 5(K3) 3 3 2

CO 6(K2) 2 2 3

UNIT-I:

Basic Principles: Security Goals, Cryptographic Attacks, Services and Mechanisms,

Mathematics of Cryptography.

UNIT-II:

Symmetric Encryption: Mathematics of Symmetric Key Cryptography, Introduction to

Modern Symmetric Key Ciphers, Data Encryption Standard, Advanced Encryption

Standard.

AR19 MCA


UNIT-III:

Asymmetric Encryption: Mathematics of Asymmetric Key Cryptography, Asymmetric

Key Cryptography.

UNIT-IV:

Data Integrity, Digital Signature Schemes & Key Management: Message Integrity

and Message Authentication, Cryptographic Hash Functions, Digital Signature, Key

Management.

UNIT-V:

Network Security-I: Security at application layer: PGP and S/MIME, Security at the

Transport Layer: SSL and TLS, Network Security-II: Security at the Network Layer:

IP Sec, System Security.

Text Books:

1. Cryptography and Network Security, 3rd Edition Behrouz A Forouzan, Deb deep

Mukhopadhyay, McGraw Hill.

2. Cryptography and Network Security, William Stallings, (6e) Pearson.

3. Everyday Cryptography, Keith M.Martin, Oxford.

Reference Books:

1. Network Security and Cryptography, Bernard Meneges, Cengage Learning.

Web Links:

1. https://www.coursera.org/browse/computer-science 2. https://www.tutorialspoint.com/gsm 3. https://sgar91.files.wordpress.com/2011/10/mobile_communications_schiller_2e.

pdf

4. https://www.sciencedirect.com/science/article/pii/S1877050915019882

5. http://www.dauniv.ac.in/downloads/Mobilecomputing/MobileCompChap06L01U

DP&TCP.pdf

https://sgar91.files.wordpress.com/2011/10/mobile_communications_schiller_2e

AR19 MCA


BIG DATA ANALYTICS V Semester L T P C


Course Objectives:

COB 1: To teach the data structures using java collection framework.

COB 2: To facilitate the students to learn the building blocks of Hadoop.

COB 3: To create awareness on Map Reduce approach to solve data analytics

problems.

COB 4: To nurture the students to learn Hadoop I/O.

COB 5: To make the students learn PIG programming tool of Hadoop echo system.

COB 6: To train the students install and learn Hive and Hive query language.

Course Outcomes:


CO 1: Develop various data structures using java collection framework.

CO 2: Demonstrate Building blocks of Hadoop.

CO 3: Choose map reduce approach to solve big data Problems.

CO 4: Make use of Hadoop I/O to perform Input, Output Operationsq

CO 5: Model the Pig Framework and work with big data.

CO 6: Utilize Hive to Structure the Data.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 3 2 1 - 3 - - - - - -

CO2 (K2) 2 1 - - 2 2 2 - - 2 2

CO3 (K3) 3 2 - - 3 3 - - 3 3 3

CO4 (K3) 3 2 - - 3 3 - - 3 3 3

CO5 (K3) 3 2 - - 3 3 - - 3 3 3

CO6 (K3) 3 2 1 1 3 3 - - 3 3 3



CO1 (K3) 3 3 2

CO2 (K2) 2 2 2

CO3 (K3) 3 3 2

CO4 (K3) 3 3 2

CO5 (K3) 3 3 2

CO6 (K3) 3 3 2

UNIT-I:

Data structures in Java: Linked List, Stacks, Queues, Sets, Maps; Generics: Generic

classes and Type parameters, Implementing Generic Types, Generic Methods, Wrapper

Classes, Concept of Serialization.

UNIT-II:

Working with Big Data: Google File System, Hadoop Distributed File System

(HDFS), Building blocks of Hadoop (Name node, Data node, Secondary Name node,

Job Tracker, Task Tracker), Introducing and Configuring Hadoop cluster (Local,

Pseudo-distributed mode, Fully Distributed mode), Configuring XML files.

AR19 MCA


UNIT-III:

Writing Map Reduce Programs: A Weather Dataset, Understanding Hadoop API for

Map Reduce Framework (Old and New),

Basic programs of Hadoop Map Reduce: Driver code, Mapper code, Reducer code,

Record Reader, Combiner, Partitioner.

UNIT-IV:

Hadoop I/O: The Writable Interface, Writable Comparable and comparators,

Writable Classes: Writable wrappers for Java primitives, Text, Bytes Writable, Null

Writable, Object Writable and Generic Writable, Writable collections, Implementing a

Custom Writable: Implementing a Raw Comparator for speed, Custom comparators.

UNIT-V:

Pig: Hadoop Programming Made Easier, Admiring the Pig Architecture, Going with the

Pig Latin Application Flow, Working through the ABCs of Pig Latin, Evaluating Local

and Distributed Modes of Running Pig Scripts, Checking out the Pig Script Interfaces,

Scripting with Pig Latin,

Applying Structure to Hadoop Data with Hive: Saying Hello to Hive, Seeing How

the Hive is Put Together, Getting Started with Apache Hive, Examining the Hive

Clients, Working with Hive Data Types, Creating and Managing Databases and Tables,

Seeing How the Hive Data Manipulation Language Works, Querying and Analyzing

Data.

Text Books:

1. Big Java 4th Edition, Cay Horstmann, Wiley John Wiley & Sons, INC.

2. Hadoop: The Definitive Guide by Tom White, 3rd Edition, O’Reilly.

3. Hadoop in Action by Chuck Lam, MANNING Publ.

4. Hadoop for Dummies by Dirk deRoos, Paul C.Zikopoulos, Roman

B.Melnyk,Bruce Brown and Rafael Coss.

Reference Books:

1. Hadoop in Practice by Alex Holmes, MANNING Publ.

2. Hadoop MapReduce Cookbook, Srinath Perera, Thilina Gunarathne.

Web Links:

1. Hadoop: https://hadoop.apache.org/

2. Hive: https://cwiki.apache.org/confluence/display/Hive/Home/

3. Piglatin: https://pig.apache.org/docs/r0.7.0/tutorial.html

AR19 MCA


MACHINE LEARNING V Semester L T P C


Course Objectives:

COB 1: Introduce the characteristics of machine learning and its applications to real-

world Problems.

COB 2: Characterizing machine learning algorithms as supervised, semi-supervised,

and Unsupervised.

COB 3: Importance of statistical methods in machine learning applications.

COB 4: Need for support vector machines in machine learning.

COB 5: Introduce the concept decision tree learning for non-linear functions in

machine learning.

Course Outcomes:


CO 1: Recognize the characteristics of machine learning that make it useful to real-

world Problems.

CO 2: Characterize machine learning algorithms as supervised, semi-supervised, and

Unsupervised.

CO 3: Be able to use statistical methods in machine learning applications.

CO 4: Be able to use support vector machines.

CO 5: Understand the concept decision tree learning for non-linear functions.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 3 2 - 2 - - - - - - -

CO2 (K3) 3 3 - 3 3 - - - - - -

CO3 (K3) 3 3 - 3 3 - 2 - 3 - -

CO4 (K3) 3 3 - 3 3 - - - - 3 -

CO5 (K3) 3 3 - 3 3 - - - - - 2



CO1 (K3) 3 - -

CO2 (K3) 3 3 -

CO3 (K3) 3 3 2

CO4 (K3) 3 3 2

CO5 (K3) 2 2 -

UNIT-I:

Introduction-Towards Intelligent Machines, Well posed Problems, Example of

Applications in diverse fields, Data Representation, Domain Knowledge for Productive

use of Machine Learning, Diversity of Data: Structured / Unstructured, Forms of

Learning, Machine Learning and Data Mining, Basic Linear Algebra in Machine

Learning Techniques.

UNIT-II:

Supervised Learning- Rationale and Basics: Learning from Observations, Bias and

Why Learning Works: Computational Learning Theory, Occam's Razor Principle and

Over fitting Avoidance Heuristic Search in inductive Learning, Estimating

Generalization Errors, Metrics for assessing regression, Metris for assessing

AR19 MCA


classification.

UNIT-III:

Statistical Learning- Machine Learning and Inferential Statistical Analysis, Descriptive

Statistics in learning techniques, Bayesian Reasoning: A probabilistic approach to

inference, K-Nearest Neighbor Classifier. Discriminant functions and regression

functions, Linear Regression with Least Square Error Criterion, Logistic Regression for

Classification Tasks, Fisher's Linear Discriminant and Thresholding for Classification,

Minimum Description Length Principle.

UNIT-IV:

Support Vector Machines (SVM)- Introduction, Linear Discriminant Functions for

Binary Classification, Perceptron Algorithm, Large Margin Classifier for linearly

seperable data, Linear Soft Margin Classifier for Overlapping Classes, Kernel Induced

Feature Spaces, Nonlinear Classifier, Regression by Support vector Machines.

Learning with Neural Networks: Towards Cognitive Machine, Neuron Models,

Network Architectures, Perceptrons, Linear neuron and the Widrow-Hoff Learning

Rule, The error correction delta rule.

UNIT-V:

Multilayer Perceptron Networks and error back propagation algorithm, Radial Basis

Functions Networks.

Decision Tree Learning: Introduction, Example of classification decision tree,

measures of impurity for evaluating splits in decision trees, ID3, C4.5, and CART

decision trees, pruning the tree, strengths and weakness of decision tree approach.

Text Books:

1. Applied Machine Learning, M. Gopal, McGraw Hill Education.

2. Machine Learning: A Probabilistic Perspective, Kevin Murphy, MIT Press, 2012.

3. The Elements of Statistical Learning, Trevor Hastie, Robert Tibshirani, Jerome

Friedman, Springer 2009 (freely available online).

Reference Books:

1. Pattern Recognition and Machine Learning, Christopher Bishop, Springer,2007.

2. Programming Collective Intelligence: Building Smart Web 2.0 Applications –

Toby Segaran.

3. Building Machine Learning Systems with Python – Willi Richert, Luis Pedro

Coelho.

Web Links:

1. https://www.coursera.org/learn/machine-learning

2. https://classroom.udacity.com/courses/ud120

3. http://videolectures.net/Top/Computer_Science/Machine_Learning/

4. https://onlinecourses.nptel.ac.in/noc18_cs26

5. https://www.youtube.com/channel/UCR4_akQ1HYMUcDszPQ6jh8

AR19 MCA


DIGITAL MARKETING V Semester L T P C


Course Objectives:

COB 1: To equip the students with the basic inputs of basic HTML5, DHTML tags

using CSS and XML, the overview of W3C DOM.

COB 2: To train the students in Scripting CSS Classes, Scripting Style Sheets, Java

Script.

COB 3: To impart the knowledge on Search engine Marketing, search Engine

optimization and development and execution of search advertising campaign.

COB 4: To enable the student develop the social media advertising strategy and

Mobile marketing strategy

Course Outcomes:


CO 1: Explain about web pages with basic HTML5, DHTML tags using CSS and

XML, the overview of W3C DOM.

CO 2: Discuss the key elements of a digital Java Scripts.

CO 3: Apply search engine optimization techniques to a website.

CO 4: Illustrate how the effectiveness of a digital marketing campaign can be

measured.

CO 5: Demonstrate advanced practical skills in common digital marketing tools such

as SEO, SEM, Social media and Blogs.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K2) - - - - - 1 2 - - - -

CO2 (K3) - - - - - 3 - - - - -

CO3 (K3) -- - - - - - - - - 3 -

CO4 (K2) - - - - - - - - - 3 -

CO5 (K2) - - - - - - - 3 - -



CO1 (K2) - - 1

CO2 (K3) - 1 -

CO3 (K3) - - 1

CO4 (K2) - 1 -

CO5 (K2) - 1 -

UNIT-I:

HTML: Introduction, HTML5, Audio Elements, Video Elements, Organizing Elements.

Scripting Documents: Dynamic Document content, Document properties, Legacy

DOM, Document Collections, Overview of the W3C DOM, Traversing a Document,

Finding Elements in a Document, Modifying a Document, Adding Content to a

Document Example.

UNIT-II:

Cascading Style Sheets and Dynamic HTML: Overview of CSS, CSS for DHTML

Scripting inline Styles, Scripting computed styles, Scripting CSS Classes, Scripting

Style Sheets, Java Script and XML: Obtaining XML Documents, Manipulating XML

AR19 MCA


with the DOM API, Transforming XML with XSLT querying XML with X path,

Serializing XML, Example, XML and Web services.

UNIT-III:

Search Engine Optimization (SEO): Searching Engine Marketing, Search Engine

Optimization, Measuring SEO Success, Mapping with SEO Journey,

Search Advertising: Online Advertising Payment Models, Search Advertising (Desktop

& Mobile Devices), Planning & Executing a search Advertising Camping, Strategic

Implications of Advertising on the search Network.

UNIT-IV:

Search Media Marketing: What is Social Media? Social Media Marketing, Social

Media Marketing Strategy, Adopting Social Media in Organizations: Internal Learning,

Paid-Owned-Earned Media, Social CRM,

Mobile Marketing: Mobile Internet in India, What is Mobile Marketing? Email

Marketing Strategy, Forms of Mobile Marketing, Mobile Advertising, M-Commerce.

UNIT-V:

E-Mail Marketing: E-Mail Marketing in India, What is E-Mail Marketing? E-Mail

Marketing Strategy, Executing E-Mail Marketing,

Internet Marketing: Internet Marketing Strategy, Content Marketing, Content

Marketing in India.

Text Books:

1. Programming the World Wide Web, Robet W Sebesta, Pearson, 8th edition, 2015.

2. Java Script: The Definite Guide David Flanagan, O’ Reilly Publisher.

3. Internet Marketing- A Practical approach in the India Context by Moutusy Maity,

Oxford.

Web Links:

1. https://learndigital.withgoogle.com/digitalunlocked/

2. https://digitalskills.fb.com/en-in/

3. https://www.hubspot.com/digital-marketing

AR19 MCA


NATURAL LANGUAGE PROCESSING V Semester L T P C


Course Objectives:

This course introduces the fundamental concepts and techniques of natural language

processing (NLP).

COB 1: Students will gain an in-depth understanding of the computational properties

of natural languages and the commonly used algorithms for processing

linguistic information.

COB 2: The course examines NLP models and algorithms using both the traditional

symbolic and the more recent statistical approaches.

COB 3: Enable students to be capable to describe the application based on natural

language processing and to show the points of syntactic, semantic and

pragmatic processing.

Course Outcomes:


CO 1: Understand key concepts from NLP are used to describe and analyze

language.

CO 2: Explain POS tagging and context free grammar for English language.

CO 3: Make use of the rule based system to tackle morphology/ syntax of a

language.

CO 4: Demonstrate semantics and pragmatics of English language for processing.

CO 5: To compare and contrast the use of different statistical approaches for

different types of NLP applications.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K2) 2 1 3 3 2 - - - - - -

CO2 (K2) 2 1 3 3 1 - - - - - -

CO3 (K3) 3 3 1 1 3 - - - - - -

CO4 (K2) 2 1 1 1 2 - - - - - -

CO5 (K2) 2 1 1 1 2 - - - - - -



CO1 (K2) 2 2 -

CO2 (K2) 2 - 3

CO3 (K3) 3 3 2

CO4 (K2) 2 3 2

CO5 (K2) 2 3 2

UNIT-I:

Introduction : Origins and challenges of NLP – Language Modelling: Grammar-based

LM, Statistical LM – Regular Expressions, Finite-State Automata – English

Morphology, Transducers for lexicon and rules, Tokenization, Detecting and Correcting

Spelling Errors, Minimum Edit Distance.

UNIT-II:

Word Level Analysis: Unsmoothed N-grams, Evaluating N-grams, Smoothing,

Interpolation and Back off – Word Classes, Part-of-Speech Tagging, Rule-based,

AR19 MCA


Stochastic and Transformation based tagging, Issues in PoS tagging – Hidden Markov

and Maximum Entropy models.

UNIT-III:

Syntactic Analysis: Context-Free Grammars, Grammar rules for English, Treebank’s,

Normal Forms for grammar – Dependency Grammar – Syntactic Parsing, Ambiguity,

Dynamic Programming parsing – Shallow parsing – Probabilistic CFG, Probabilistic

CYK, Probabilistic Lexicalized CFGs – Feature structures, Unification of feature

structures.

UNIT-IV:

Semantics And Pragmatics: Requirements for representation, First-Order Logic,

Description Logics – Syntax-Driven Semantic analysis, Semantic attachments – Word

Senses, Relations between Senses, Thematic Roles, selectional restrictions – Word

Sense Disambiguation, WSD using Supervised, Dictionary & Thesaurus, Bootstrapping

methods – Word Similarity using Thesaurus and Distributional methods.

UNIT-V:

Discourse Analysis And Lexical Resources: Discourse segmentation, Coherence –

Reference Phenomena, Anaphora Resolution using Hobbs and Centering Algorithm –

Co reference Resolution – Resources: Porter Stemmer, Lemmatizer, Penn Treebank,

Brill’s Tagger, WorldNet, Prop Bank, Frame Net, Brown Corpus, British National

Corpus (BNC).

Text Books:

1. Daniel Juraf sky, James H. Martin―Speech and Language Processing: An

Introduction to Natural Language Processing, Computational Linguistics and

Speech, Pearson Publication, 2014.

2. Steven Bird, Ewan Klein and Edward Loper, ―Natural Language Processing with

Python, First Edition, O’Reilly Media, 2009.

Reference Books:

1. ck Baldwin, ―Language processing with Java and Ling Pipe Cookbook, Atlantic

Publisher, 2015.

2. Richard M Reese, ―Natural Language Processing with Java, O’Reilly Media,

2015.

3. Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language

Processing, Second, Chapman and Hall/CRC Press, 2010.

4. Tanveer Siddiqui, U.S. Tiwary, ―Natural Language Processing and Information

Retrieval, Oxford University Press, 2008.

Web Links:


2. http://www.geeksforgeeks.org/theory-of-computation-automata-tutorials/

3. http://www.geeksforgeeks.org/compiler-design-tutorials/


AR19 MCA


INTERNET OF THINGS V Semester L T P C


Course Objectives:

This course introduces the fundamental concepts and techniques of natural language

processing (NLP).

COB 1: To present interconnection and integration of the physical world and the

cyber space.

COB 2: To demonstrate Communication and Connectivity in Internet of Things.

COB 3: To introduce communication protocols used in Internet of Things.

COB 4: To impart knowledge of analytics and computing in Internet of Things.

Course Outcomes:


CO 1: Describe the usage of the term 'the internet of things' in different contexts.

CO 2: Illustrate diversified layered architectures and design principles for

IoT/M2M.

CO 3: Discover the various network protocols used in IoT.

CO 4: Define the role of big data, cloud computing and data analytics in a typical

IoT system.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K1) 1 1 - - - - - - 1 - 1

CO2 (K2) 1 2 - - - - - - - - -

CO3 (K4) 1 1 - - - - - 1 - - -

CO4 (K1) 1 1 - - 1 1 - 1 1 - 1


CO / PSO PSO 1(K5) PSO 2 (K4) PSO 3(K4)

CO1 (K1) 1 1 -

CO2 (K2) 1 1 -

CO3 (K4) 2 1 1

CO4 (K1) 2 1 1

UNIT-I:

The Internet of Things: An Overview of Internet of things, Internet of Things

Technology, behind Io Ts Sources of the Io Ts, M2M Communication, Examples of

IoTs, Design Principles For Connected Devices Internet Connectivity Principles,

Internet connectivity, Application Layer Protocols: HTTP, HTTPS, FTP, Telnet.

UNIT-II:

Business Models for Business Processes in the Internet of Things ,IoT/M2M systems

LAYERS AND designs standardizations ,Modified OSI Stack for the IoT/M2M

Systems ,ETSI M2M domains and High-level capabilities ,Communication

Technologies, Data Enrichment and Consolidation and Device Management Gateway

Ease of designing and affordability.

UNIT-III:

Design Principles for the Web Connectivity for connected-Devices, Web

Communication protocols for Connected Devices, Message Communication protocols

AR19 MCA


for Connected Devices, Web Connectivity for connected-Devices.

UNIT-IV:

Data Acquiring, Organizing and Analytics in IoT/M2M, Applications /Services

/Business Processes, IOT/M2M Data Acquiring and Storage, Business Models for

Business Processes in the Internet Of Things, Organizing Data, Transactions, Business

Processes, Integration and Enterprise Systems.

UNIT-V:

Data Collection, Storage and Computing Using a Cloud Platform for IoT/M2M

Applications/Services, Data Collection, Storage and Computing Using cloud platform

Everything as a service and Cloud Service Models, IOT cloud-based services using the

Xively (Pachube/COSM), Nimbits and other platforms Sensor, Participatory Sensing,

Actuator, Radio Frequency Identification, and Wireless, Sensor Network Technology,

Sensors Technology, Sensing the World.

Text Books:

1. Internet of Things: Architecture, Design Principles And Applications, Rajkamal,

McGraw Hill Higher Education.

2. Internet of Things, A.Bahgya and V.Madisetti, Univesity Press, 2015.

Reference Books:

1. Designing the Internet of Things, Adrian McEwen and Hakim Cassimally, Wiley.

2. Getting Started with the Internet of Things CunoPfister , Oreilly.

Web Links:

1. https://onlinecourses.nptel.ac.in/noc18_cs46/preview

2. https://swayam.gov.in/courses/public?keyword=Introduction%20to%20internet%

20of%20things

3. https://swayam.gov.in/courses/public?keyword=Design%20for%20internet%20of

%20things

4. https://swayam.gov.in/courses/public?keyword=Design%20for%20internet%20of

%20things

https://swayam.gov.in/courses/public?keyword=Introduction%20to%20internet%20of%20things

https://swayam.gov.in/courses/public?keyword=Introduction%20to%20internet%20of%20things

https://swayam.gov.in/courses/public?keyword=Design%20for%20internet%20of%20things

https://swayam.gov.in/courses/public?keyword=Design%20for%20internet%20of%20things

AR19 MCA


DevOps V Semester L T P C


Course Objectives:

DevOps improves collaboration and productivity by automating infrastructure and

workflows and continuously measuring applications performance.

Course Outcomes:


CO 1: Understand the principles of continuous development and deployment,

automation of configuration management, inter-team collaboration, and IT

service agility.

CO 2: Describe DevOps & Dev Sec Ops methodologies and their key concepts.

CO 3: Explain the types of version control systems, continuous integration tools,

continuous monitoring tools, and cloud models.

CO 4: Set up complete private infrastructure using version control systems and

CI/CD tools.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 2 2 - 2 2 1 - - - - -

CO2 (K3) 2 2 - 2 2 1 - - - - -

CO3 (K3) 2 2 - 2 3 1 - - - - -

CO4 (K3) 2 2 - 2 3 1 - - - - -



CO1 (K3) 1 1 -

CO2 (K3) 2 1 -

CO3 (K3) 2 1 1

CO4 (K3) 2 1 1

UNIT-I:

Phases of Software Development life cycle. Values and principles of agile software

development.

UNIT-II:

Fundamentals of DevOps: Architecture, Deployments, Orchestration, Need, Instance of

applications, DevOps delivery pipeline, DevOps eco system.

UNIT-III:

DevOps adoption in projects: Technology aspects, Agiling capabilities, Tool stack

implementation, People aspect, processes.

UNIT-IV:

CI/CD: Introduction to Continuous Integration, Continuous Delivery and Deployment ,

Benefits of CI/CD, Metrics to track CICD practices.

UNIT-V:

Devops Maturity Model: Key factors of DevOps maturity model, stages of Devops

maturity model, DevOps maturity Assessment.

AR19 MCA


Text Books:

1. The DevOPS Handbook: How to Create World-Class Agility, Reliability, and

Security in Technology Organizations by Gene Kim , John Willis , Patrick Debois,

Jez Humb, O’Reilly publications.

2. What is Devops? Infrastructure as code By in Mike Loukides, O’Reilly

publications.

3. Continuous Delivery: Reliable Software Releases Through Build, Test, and

Deployment Automation, by Jez Humble and David Farley.

4. Achieving DevOps: A Novel About Delivering the Best of Agile, DevOps, and

Microservices by Dave Harrison, Knox Lively.

Reference Books:

1. Building a DevOps Culture by Mandi Walls, O’Reilly publications.

2. The DevOps 2.0 Toolkit: Automating the Continuous Deployment Pipeline With

Containerized Microservices by Viktor Farcic.

Web Links:

1. https://www.softwaretestinghelp.com/devops-tutorials/

2. https://www.javatpoint.com/devops

3. https://www.guru99.com/devops-tutorial.html

4. https://www.tutorialspoint.com/devops_tutorials.htm

5. https://intellipaat.com/blog/tutorial/devops-tutorial/

https://www.softwaretestinghelp.com/devops-tutorials/

https://www.javatpoint.com/devops

https://www.guru99.com/devops-tutorial.html

https://www.tutorialspoint.com/devops_tutorials.htm

AR19 MCA


CRYPTOGRAPHY AND NETWORK SECURITY LAB

V Semester L T P C


Course Objectives:

COB 1: To learn basic understanding of cryptography, how it has evolved, and some

key encryption techniques used today

COB 2: To understand and implement encryption and decryption using Ceaser Cipher,

Substitution Cipher, Hill Cipher.

COB 3: To provide knowledge on various Ciphering Techniques involved in

cryptography.

COB 4: To illustrate the basic algorithms like DES, Blow Fish, Rijndael, RSA.

COB 5: To make the students learn Key exchange techniques & SHA

Course Outcomes:


CO 1: Explain the basics of string operations involved in Cryptography.

CO 2: Summarize different encryption & decryption algorithms.

CO 3: Discuss the various Cryptographic ciphering techniques.

CO 4: Apply different algorithms for improving the security for real time

applications.

CO 5: Describe the key exchange techniques for improving the security.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 3 2 1 1 3 - - - - - -

CO2 (K3) 3 2 1 1 3 - 3 - - - -

CO3 (K3) 3 2 1 1 3 3 3 3 - 3 -

CO4 (K3) 3 2 1 1 3 3 3 3 3 3 -

CO5 (K3) 3 2 1 1 3 3 3 3 3 - -



CO1 (K3) 3 3 2

CO2 (K3) 3 3 2

CO3 (K3) 3 3 2

CO4 (K3) 3 3 2

CO5 (K3) 3 3 3


Experiment 1:

Write a C program that contains a string (char pointer) with a value \Hello World’. The

program should XOR each character in this string with 0 and displays the result.

Experiment 2:

Write a C program that contains a string (char pointer) with a value \Hello World’. The

program should AND or and XOR each character in this string with 127 and display the

result.

Experiment 3:

Write a Java program to perform encryption and decryption using the following

algorithms:

a) Ceaser Cipher.

AR19 MCA


b) Substitution Cipher.

c) Hill Cipher.

Experiment 4:

Write a Java program to implement the DES algorithm logic.

Experiment 5:

Write a C/JAVA program to implement the BlowFish algorithm logic

Experiment 6:

Write a C/JAVA program to implement the Rijndael algorithm logic.

Experiment 7:

Using Java Cryptography, encrypt the text “Hello world” using BlowFish. Create your

own key using Java key tool.

Experiment 8:

Write a Java program to implement RSA Algoithm.

Experiment 9:

Implement the Diffie-Hellman Key Exchange mechanism using HTML and JavaScript.

Consider the end user as one of the parties (Alice) and the JavaScript application as

other party (bob).

Experiment 10:

Calculate the message digest of a text using the SHA-1 algorithm in JAVA.

Text Books:

1. W. Richard Stevens, Stephen A Rago, Advanced Programming in the UNIX

Environment, AddisonWesley / PHI, 2nd Edition, 2011.

2. Maurice J. Bach, The Design of Unix Operating System, PHI. 2009.

Reference Books:

1. Terrence Chan: UNIX System Programming Using C++, Prentice Hall India,

1999.

2. Kay A Robbins and Steve Robbins, Unix Systems Programming, Pearson

Education, 2004.

3. Marc J. Rochkind: Advanced UNIX Programming, 2nd Edition, Pearson

Education, 2005.

Web Links:

1. https://www.coursera.org/browse/computer-science

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

3. https://sgar91.files.wordpress.com/2011/10/mobile_communications_schiller_2e.

pdf



DP&TCP.pdf

https://sgar91.files.wordpress.com/2011/10/mobile_communications_schiller_2e.%20pdf

https://sgar91.files.wordpress.com/2011/10/mobile_communications_schiller_2e.%20pdf

http://www.dauniv.ac.in/downloads/Mobilecomputing/MobileCompChap06L01UDP&TCP.pdf

http://www.dauniv.ac.in/downloads/Mobilecomputing/MobileCompChap06L01UDP&TCP.pdf

AR19 MCA


BIG DATA ANALYTICS LAB

V Semester L T P C

Course Code: 193MC5L14 0 0 4 2

Course Objectives:

COB 1: To impart knowledge on linear and non linear data structures.

COB 2: To enable the students installing hadoop in various modes.

COB 3: To train the students adding, retrieving and deleting files in hadoop file

system.

COB 4: To help the students write map reduce approach for solving big data

problems.

COB 5: To impart knowledge on Pig Latin.

COB 6: To illustrate the students handle big data using Hive.

Course Outcomes:


CO 1: Develop linear and nonlinear data structures using Java Collection frame

work.

CO 2: Build the Hadoop Cluster using various installation modes.

CO 3: Apply hadoop commands to interact with HDFS.

CO 4: Solve Big Data Problems using Map Reduce approach.

CO 5: Analyse the big data using Pig Latin.

CO 6: Build queries using Hive Query Language.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 3 - - - 3 - - - - - -

CO2 (K3) 3 - - - 3 - - - - - -

CO3 (K3) 3 - 1 - 3 - - - - - -

CO4 (K3) 3 2 1 1 3 3 3 - 3 3 3

CO5 (K3) 3 3 2 2 3 3 3 - 3 3 3

CO6 (K2) 3 2 1 1 3 3 3 - 3 3 3



CO1 (K3) 3 3 2

CO2 (K3) 3 3 2

CO3 (K3) 3 3 2

CO4 (K3) 3 3 2

CO5 (K3) 3 3 2

CO6 (K2) 3 3 2


Experiment 1:

Implement the following Data structures in Java.

a)Linked Lists b) Stacks c) Queues d) Set e) Map.

Experiment 2:

(i)Perform setting up and Installing Hadoop in its three operating modes:

Standalone, Pseudo distributed and Fully distributed.

(ii)Use web based tools to monitor your Hadoop setup.

Experiment 3:

AR19 MCA


Implement the following file management tasks in Hadoop:

• Adding files and directories

• Retrieving files

• Deleting files

Hint: A typical Hadoop workflow creates data files (such as log files) elsewhere and

copies them into HDFS using one of the above command line utilities.

Experiment 4:

Run a basic Word Count Map Reduce program to understand Map Reduce Paradigm.

Experiment 5:

Write a Map Reduce program that mines weather data.

Weather sensors collecting data every hour at many locations across the globe gather a

large volume of log data, which is a good candidate for analysis with MapReduce, since

it is semi structured and record oriented.

Experiment 6:

Implement Matrix Multiplication with Hadoop Map Reduce.

Experiment 7:

Install and Run Pig then write Pig Latin scripts to sort, group, join, project, and filter

your data.

Experiment 8:

Install and Run Hive then use Hive to create, alter, and drop databases, tables, views,

functions, and indexes.

Text Books:

1. Big Java 4th Edition, Cay Horstmann, Wiley John Wiley & Sons, INC.

2. Hadoop: The Definitive Guide by Tom White, 3rd Edition, O’reilly.

3. Hadoop in Action by Chuck Lam, MANNING Publ.

4. Hadoop for Dummies by Dirk de Roos, Paul C.Zikopoulos, Roman B.Melnyk,

Bruce Brown, Rafael Coss.

Reference Books:

1. Hadoop in Practice by Alex Holmes, MANNING Publ.

2. Hadoop MapReduce Cookbook, Srinath Perera, Thilina Gunarathne.

Web Links:

1. https://www.coursera.org/browse/computer-science

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

3. https://sgar91.files.wordpress.com/2011/10/mobile_communications_schiller_2e.

pdf



DP&TCP.pdf

https://sgar91.files.wordpress.com/2011/10/mobile_communications_schiller_2e

AR19 MCA


MACHINE LEARNING WITH PYTHON LAB V Semester L T P C


Course Objectives:

COB 1: To learn and understand different Data sets in implementing the machine

learning algorithms

COB 2: Implement the machine learning concepts and algorithms in any suitable

language of choice.

Course Outcomes:


CO 1: Apply basic machine learning algorithms to different types of data sets.

CO 2: Implement suitable algorithms to build decision trees for the given data sets.

CO 3: Apply suitable algorithms to build ANN.

CO 4: Implement Bayesian models on appropriate data sets.

CO 5: Implement distance based methods in clustering applications.


CO/PO PO 1

(K5)

PO 2

(K4)

PO 3

(K5)

PO 4

(K3)

PO 5

(K3)

PO 6

(K4)

PO 7

(K6)

PO 8

(K2)

PO 9

(K2)

PO 10

(K2)

PO11

(K4)

CO1 (K3) 3 2 - 2 - - - - - - -

CO2 (K3) 3 3 - 3 3 - - - - - -

CO3 (K3) 3 3 - 3 3 - 2 - 3 - -

CO4 (K3) 3 3 - 3 3 - - - - 3 -

CO5 (K3) 3 3 - 3 3 - - - - - 2



CO1 (K3) 3 - -

CO2 (K3) 3 3 -

CO3 (K3) 3 3 2

CO4 (K3) 3 3 2

CO5 (K3) 2 2 -


Experiment 1:

a. Hypothesis based on thyroid dataset.

b. Implement and demonstrate the FIND-S algorithm for finding the most specific.

Experiment 2:

For a given diabetic dataset, implement and demonstrate the Candidate-Elimination

algorithm to output a description of the set of all hypotheses consistent with the

training examples.

Experiment 4:

Build an Artificial Neural Network by implementing the Back propagation

algorithm and test the same using appropriate data sets.

Experiment 5:

a. Write a program to implement the naïve Bayesian classifier for Iris data set.

b. Compute the accuracy of the classifier, considering few test data sets.

Experiment 6:

AR19 MCA


a. Assuming a set of documents that need to be classified, use the naïve Bayesian.

b. Classifier model to perform this task. Built-in Java classes/API can be used to write

the program. Calculate the accuracy, precision, and recall for your data set.

Experiment 7:

a. Write a program to construct a Bayesian network considering medical data. Use this

model to demonstrate the diagnosis of heart patients using standard Heart Disease

b. Data Set. You can use Java/Python ML library classes/API.

Experiment 8:

Apply EM algorithm to cluster a Heart Disease Data Set. Use the same data set for

clustering using k-Means algorithm. Compare the results of these two algorithms and

comment on the quality of clustering. You can add Java/Python ML library

classes/API in the program.

Experiment 9:

Write a program to implement k-Nearest Neighbor algorithm to classify the iris data

set. Print both correct and wrong predictions.

Experiment 10:

Implement the non-parametric Locally Weighted Regression algorithm in order to fit

data points. Select appropriate data set for your experiment and draw graphs.

Reference Books/ Preferred Text Books:

1. Applied Machine Learning, M. Gopal, McGraw Hill Education.

2. Machine Learning: A Probabilistic Perspective, Kevin Murphy, MIT Press, 2012.

3. The Elements of Statistical Learning, Trevor Hastie, Robert Tibshirani, Jerome

Friedman, Springer 2009 (freely available online).

4. Programming Collective Intelligence: Building Smart Web 2.0 Applications –

Toby Segaran.

5. Building Machine Learning Systems with Python - WilliRichert, Luis Pedro

Coelho.

Web Links:

1. https://www.coursera.org/learn/machine-learning

2. https://classroom.udacity.com/courses/ud120

3. http://videolectures.net/Top/Computer_Science/Machine_Learning/

4. https://onlinecourses.nptel.ac.in/noc18_cs26

5. https://www.youtube.com/channel/UCR4_akQ1HYMUcDszPQ6jh8

****

ACADEMIC REGULATIONS, PROGRAM STRUCTURE AND SYLLABUS pdf/MCA/AR19 MCA... · MASTER OF COMPUTER...

Documents

Transcript of ACADEMIC REGULATIONS, PROGRAM STRUCTURE AND SYLLABUS pdf/MCA/AR19 MCA... · MASTER OF COMPUTER...