BUNDELKHAND UNIVERSITY,JHANSI (UP)

EVALUATION SCHEME & SYLLABUS

First Year
FOR

MASTER OF COMPUTER
APPLICATION (MCA)
(Two Year Course)

As per
BUNDELKHAND UNIVERSITY (BU) (Adopted from AKTU)
MODEL CURRICULUM
(Effective from the Session:2020-21)
 Program Overview

Master of Computer Applications (MCA)

Department of Mathematical Sciences & Computer Application
Bundelkhand University, Jhansi

The broad objective of the Master of computer Application, 2 years (4-Semesters)programme is to

prepare post graduates students for dynamic careers in software and IT industry, corporate sector, Govt.
organizations and academic world by providing skill based environment for teaching and research in the
core and emerging areas of the discipline.
The Programmes driving force is on giving the students a thorough and sound background in theoretical
and skill-oriented courses relevant to the latest computer software development. The programme
emphasizes the application of software and IT technologies to solve mathematical, computing,
communications/networking and commercial problems. This Master’s Degree Programme has been
designed with a semester approach in mind. The first year courses are aimed at skills development in
computers using various technologies, the second year is more focused on core courses providing
conceptual frame work and provides thespecialization and the project work.

Programme Educational Objectives

The Master of Computer Applications Programme Educational Objectives aims to:

1. MCA graduates who will have successful careers based on their understanding of formal and
practical methods of Application Development using the concepts of computer programming,
software and design principles.

2. MCA graduates will demonstrate analytical and design skills including the ability to generate
creative solutions and foster team-oriented, professionalism through effective communication in
their careers.

3. MCA graduates who will exhibit effective work ethics and be able to adapt to the challenges of a
dynamic job environment.
Program Outcomes (POs)
The Master of Computer Applications (MCA) Programme will prepare its graduates to achieve:
PO1 Domain Knowledge The understanding to apply
knowledge of computing and
technological
advances appropriate to the
programme.
PO2 Skill Enhancement Skills to analyze a problem,
and identify and define the
logical modeling of solutions.
PO3 Design & Implementation An ability to design
implements and evaluate a
computer-based system,
process, component, or
programme to meet
stakeholder needs.
PO4 Project Management The knack to function
effectively in teams to
accomplish a common goal.
PO5 Ethics A sense of professional,
ethical, legal, security and
social issues and
responsibilities.
PO6 Communication Effectiveness in
communicating with a wide
range of audiences.
PO7 Investigation of complex problems. An ability to analyze the local
and global impact of business
solutions on
individuals, organizations, and
society.
PO8 Life-long Learning An identification of the need
to engage in continuing
professional
development.

Program Specific Outcomes (PSOs)

Program Specific Outcomes (PSOs): PSOs are statements that describe what the students of
MCA should be able to do.

PSO1:Produce knowledgeable and skilled human resources which are employable in IT and ITES.
PSO2:Impart knowledge required for planning, designing and building complex Application software
Systems as well as provide support to automated systems or application.

PSO3:Produce entrepreneurs who can develop customized solutions for smallto large Enterprises.

PSO4:To develop academically competent and professionally motivated personnel, equipped with
objective, critical thinking, right moral and ethical values that compassionately foster the scientific
temper with a sense of social responsibility.

PSO5:To develop students to become globally competent.

PSO6:To inculcate Entrepreneurial skills among students.

Ordinance, Course Structure & Syllabus
1. Introduction: The Master of Computer Applications (MCA) Programme has been designed with
asemester approach in mind. It is a three years degree course consisting six semesters and in each year
there are two semesters. Courses in semester I to V are aimed at skills development in computer science
and application using various recent technologies, while in VIth semester students has to develop a live
project in any Industry/Software co. or any of the reputed institutions. In each semester student has to
develop a software project (Practical) that can become students more expert in handling the
programming language and the programming logics.

2. The candidate who have passed BCA/ B.Sc. (Mathematics)/ B.Sc. (Computer Science)/ B.Sc.(IT)/
B.Sc.(Statistics) and Mathematics as core subject at 10+2 level will be considered for equivalent at the
entrance test for admission to the MCA Course, Subject to the admission procedure to be laid down by
the university from time to time.

3. The examination in all odd Semester papers shall be conducted at the end of odd semester and an
examination in all even semester papers shall be conducted at the end semesters.

4. Maximum duration of course will be six years.

5. English shall be the medium of instructions and examinations.

6. Evaluation– Marks and Grading System:

a) Evaluation will be done on a continuous basis. End semester practical examinations shall normally be
held before the theory examinations. The Student's performance in a course will be evaluated by
assigning a letter grade on the few point scale.
b) Semester examinations in each subject shall carry 100 marks. Syllabus of each paper will divided in
three units. After completion of each unit there will be sessional examination. Each paper has one
semester and three sessional examinations.
c) It is necessary that a candidate must secure 40% marks in each subject separately (theory, sessional
and practical examinations individually) in order to pass the examination.
d) If a candidate secure less than 40% marks in two subjects separately (theory, sessional and practical
examinations), He/She will be declared back paper in that subjects. The candidate shall be
provisionally promoted to the next higher semester with the condition that he/she pass the back paper
exam in one attempt of the subsequent semester examination.
e) If a candidate secure less than 40% marks in more than two subjects including separately (theory,
sessional and practical examinations), he/she will be declared fail in semester examination and the
whole semester has to be repeated.

1
f) The internal component of 30% shall be based on 10% of total course weightage for Ist unit test, 10%
of total course weightage for IInd unit test, and 10% of total course weightage for IIIrd unit test, be
evaluated by the instructor. Instructor will evaluate this on the basis of assignments, seminars,
quizzes, attendance and practical work etc. as announced at the beginning of the course.
g) Every candidate shall have to pass the MCA in I, II, III, IV, V & VI semester examinations separately
but the division shall be awarded on the basis of the aggregate of marks obtained by a candidate in all
six semester of the examination.
h) Division shall awarded on the basis of aggregate of the marks of the combined result of MCA in I, II,
III, IV, V & VI semester examinations. A candidate who has obtain 40% marks and above but less
than 50% marks in the aggregate shall be placed in the Third Division. A candidate who has obtain
50% marks and above but less than 60% marks in the aggregate shall be placed in the Second
Division. A candidate who has obtained 60% marks and above in the aggregate shall be placed in the
First Division. A Candidate who has obtained 75% marks and above in the aggregate shall be placed
in the First Division with Honors.

7. The minimum attendance for each paper for appearing the semester examination shall be 75 %.

8. Choice-Based Credit System (CBCS):

learn at their own pace,

Choose electives from a wide range of elective courses offered by the University departments,
Adopt an inter-disciplinary approach in learning, and Make best use of the expertise of available
faculty.

(a) Credits: Credit is a kind of weightage given to the contact hours to teach the prescribed
syllabus,which is in a modular form. Normally one credit is allocated to 15 contact hours.
(b) In each of the courses, credits will be assigned on the basis of the number of lectures / tutorials /
laboratory work and other forms of learning required for completing the course contents in
maximum 18 week schedule.
The instructional days as worked out by BU Jhansi for one academic year are 180 working days i.e.
90 days per semester.
Programmes have minimum five papers and one practical in each semester. It means student has to
complete 24 credits in each semester.
Mechanism of contact hours: As per BU Jhansi standard 42 hours per semester.
Mechanism of Credit Calculation: As per BU Jhansi standard, 1Credit = 14 hours of lectures.
Contact hours will include all the modes of teaching and it includes forms like lectures / tutorials /
laboratory work or other forms. In determining the number of hours of instruction required for a
course involving laboratory, 2 hours of laboratory is generally considered equivalent to 1 hour of
lecture.

© Credit Point, (P): Credit point is the value obtained by multiplying the grade point (G) by the credit
(C): P = GxC. Grade point is an integer indicating the numerical equivalent of the letter grade.

(d) Semester Grade Point Average (SGPA): Semester Grade Point Average (SGPA) is the
valueobtained by dividing the sum of credit points (P) earned by a student in various courses
taken in a semester by the total number of credits earned by the student in that semester. SGPA
shall be rounded off to two decimal places.

2
 (e) Cumulative Grade Point Average (CGPA): Cumulative Grade Point Average’(CGPA)is
thevalue obtained by dividing the sum of credit points in all the courses earned by a student for
the entire programme, by the total number of credits. CGPA shall be rounded off to two
decimal places. CGPA indicates the comprehensive academic performance of a student in a
programme.

An overall letter grade (Cumulative Grade) for the entire programme shall be awarded to a student
depending on his/her CGPA.

(f) Grading System:

The grade points are the numerical equivalent of letter grade assigned to a student in the 07 points
scale as given below:
% Mark Range Grade Grade Point
90 and above A+ 10
80-89 A 9
70-79 B+ 8
60-69 B 7
50-59 C+ 6
40-49 C 5
Below 40 F 0

(g) Extra Credits:Extra credits may be awarded to a student for achievements in co-curricular
activitiescarried out outside the regular class hours, as decided by the University. These credits shall
not be counted while considering the minimum credits for completing the programme. The University
shall frame detailed guidelines for the award of co-curricular credits and grades.

(h) Computation of (SGPA)and CGPA

The UGC recommends the following procedure to compute the Semester Grade Point Average
(SGPA) and Cumulative Grade Point Average (CGPA):

(i) 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
(Ci Gi)
SGPA(Si) Ci
where Ci is the number of credits of the ith course.
Gi is the grade point scored by the student in the ith course.

(ii) The CGPA is also calculated in the same manner taking into account all the courses undergone
by a student over all the semesters of a programme, i.e.

CGPA (Ci Si)

Ci
where Si is the SGPA of the ith semester.
Ci is the total number of credits in that semester.
The SGPA and CGPA shall be rounded off to 2 decimal points and reported in the transcripts.

3
Illustration for SGPA
Course Credit Grade Letter Grade Point Credit Point
Course 1 4 A+ 10 10x40=40
Course 2 4 B+ 8 8x4=32
Course 3 3 C 5 5x3=15
Course 4 3 B 7 7x3=21
14 108
Thus, SGPA =108/14 =7.71

Illustration for CGPA

Semester I Semester II Semester III Semester IV Semester V Semester VI
Credit: 26 Credit: 20 Credit: 25 Credit: 22 Credit: 19 Credit: 24
SGPA: 6.37 SGPA: 7.55 SGPA: 6.35 SGPA: 6.75 SGPA: 5.98 SGPA: 7.00
26x6.37 20x7.55 25x6.35 22x6.75 19x5.98 24x7.00
Thus, CGPA 6.63 136

9. Declaration of Results and Award of Degree:

For MCA the degree shall be awarded to the students on the basis of CGPA (Cumulative Grade
Point Average) after completion of all semester examination.
After completion of the evaluation process, result will be declared by the University, Candidate
declared successful may get the provisional degree certificate. Degree will be conferred at the time
convocation or as decided by the Vice Chancellor.

10. Successful candidate shall be classified on the basis of the combined results of semester I, II,
III, IV,V,VI examination as follows:
Candidate securing in aggregate:
75 % and above First Division with Distinction
60 % to less than 75 % First Division
50 % to less than 60 % Second Division
The minimum pass marks for the whole year would be 50%

11. Improvement Examinations: A candidate may be allowed to reappear in any two theory
papers
(maximum) of any of the semester in subsequent semester examinations to improve the division.

a) If a candidate has availed the chance of appearing in the back paper, he/she will not be allowed to
appear in an improvement examination in that next semester.
b) Improvement will not be allowed for practical examination.
c) Improvement will not be allowed in a special back examination.

12. Discontinuation: Discontinuation may be permitted on medical grounds. Discontinuation may

bepermitted in the first five semesters, and only for a maximum period of two semesters.

4
 13. Scrutiny: Scrutiny will be allowed to the student in two papers on payment of prescribed fees
asdecided by the University with the permission of V.C. provided the student applies for the same
within one month of declaration of result of particular semester.

14. Restructuring of course structure: The design course structure and content of the syllabi
ofMCA will be decided by the Board of Studies from time to time. The BOS may add a new theory
paper or practical or delete an already existing theory paper or practical from the course if necessary
based on the need of the time and trends in science.

15. Amendment: The rules described in the ordinance will be applicable for minimum period of
threeyears. After this period the rules may be reconsidered by the appropriate bodies of the
Universities if necessary. The BOS shall be the primary body which frames the ordinance.

5
 Structure of the Syllabus MCA (Two Year Course)
MCA- Semester-I
Paper Title of the Paper Contact Distribution of Marks for Credits
Code hours/ Examination
week Internal External Total
Fundamental of Computers & Emerging
6621(N)
Technologies 04 30 70 100 04
6622(N) Problem Solving using C 04 30 70 100 04
Principles of Management &
6623(N)
Communication 04 30 70 100 04
6624(N) Discrete Mathematics 04 30 70 100 04
6625(N) Computer Organization & Architecture 04 30 70 100 04
60626(N) Problem Solving using C Lab 02 - 100 100 04
Computer Organization & Architecture
60627(N)
Lab 02 - 50 50 02
60628(N) Professional Communication Lab 02 - 50 50 02
26 150 550 700 28

MCA- Semester-II

Paper Title of the Paper Contact Distribution of Marks for Credits

Code hours/ Examination
week Internal External Total
6626(N) Object Oriented Programming 04 30 70 100 04
Theory of Automata & Formal
6627(N) 04 30 70 100 04
Languages
6628(N) Database Management System 04 30 70 100 04
6629(N) Operating System 04 30 70 100 04
6630(N) Data Structure & Analysis of Algorithm 04 30 70 100 04
60631(N) Object Oriented Programming Lab 02 - 100 100 04
60632(N) DBMS Lab 02 - 50 50 02
Data Structure & Analysis of Algorithm
60633(N) 02 - 50 50 02
Lab
26 150 550 700 28
 MCA- Semester-III

Paper Title of the Paper Contact Distribution of Marks for Credits

Code hours/ Examination
week Internal External Total
7621(N) Artificial Intelligence 04 30 70 100 04
Elective-2
7622(N) 04 30 70 100 04
Web Technology
7623(N) Software Engineering 04 30 70 100 04
Elective-1
7624(N) 04 30 70 100 04
Cryptography & Network Security
7625(N) Computer Network 04 30 70 100 04
70626(N) Mini Project Lab 04 - 150 150 04
70627(N) Web Technology Lab 02 - 50 50 02
26 150 550 700 28

Elective-1 Cryptography & Network Security

Data Warehousing & Data Mining
Software Project Management
Cloud Computing
Compiler Design
Elective-2 Web Technology
Big Data
Simulation & Modeling
Software Testing & Quality Assurance
Digital Image Processing

MCA- Semester-IV

Paper Title of the Paper Contact Distribution of Marks for Credits

Code hours/ Examination
week Internal External Total
7631(A)
SET – (A) Soft Computing 04 30 70 100 04
(Elective-III)
(A) Internet of Things
7632(A) 04 30 70 100 04
(Elective-IV)
(A) Computer Graphics & Animation
7633(A) 04 30 70 100 04
(Elective-V)
70629(N) Major Project Based on
70634 04 - 200 200 08
Elective Papers (I To V)
70630(N) Presentation Based on Major
70635 04 - 100 100 04
Project
70631(N) Viva-Voce Based on Major
70636 04 - 100 100 04
Project
26 90 610 700 28
Paper Title of the Paper Contact Distribution of Marks for Credits
Code hours/ Examination
week Internal External Total
7631(B) SET – (B) Data Analytic 04 30 70 100 04
(Elective-III)
(B) Block Chain Architecture
7632(B) 04 30 70 100 04
(Elective-IV)
(B) Machine Learning
7633(B) 04 30 70 100 04
(Elective-V)
70629(N) Major Project Based on
70634 04 - 200 200 08
Elective Papers (I To V)
70630(N) Presentation Based on Major
70635 04 - 100 100 04
Project
70631(N) Viva-Voce Based on Major
70636 04 - 100 100 04
Project
26 90 610 700 28
 Syllabus

MCA1stYear
Ist Semester
 MCA(MASTEROFCOMPUTERAPPLICATION)FI
RSTYEARSYLLABUS
SEMESTER-I
MCA-6621:FUNDAMENTALOFCOMPUTERS&EMERGINGTECHNOLOGIES
Course Outcome(CO) Bloom’s KnowledgeLevel(KL)
At the end of course, the student will be able to
Demonstrate the knowledge of the basic structure, components, features and
CO1 K1,K2
Generations of computers.
Describe the concept of computer languages, language translators and construct
CO2 K2,K3
Algorithms to solve problems using programming concepts.
Compare and contrast features, functioning & types of operating system and
CO3 K4
computer networks.
Demonstratearchitecture,functioning&servicesoftheInternetandbasics of
CO4 K2
multimedia.
IllustratetheemergingtrendsandtechnologiesinthefieldofInformation
CO5 K1,K2
Technology.
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I Introduction to Computer: Definition, Computer Hardware&Computer
SoftwareComponents:Hardware–
Introduction,Inputdevices,Outputdevices,Central ProcessingUnit,Memory-
PrimaryandSecondary.Software-Introduction,Types
–SystemandApplication.
ComputerLanguages:Introduction,ConceptofCompiler,Interpreter&Assembler
Problemsolvingconcept:Algorithms–Introduction,Definition, Characteristics,
08
Limitations,Conditionsinpseudo-code,Loopsinpseudocode.

II Operatingsystem:Definition,Functions,Types,Classification,Elementsof
command based and GUIbased operating system.
08
ComputerNetwork:Overview,Types(LAN,WANandMAN),Data
communication, topologies.
III Internet:Overview,Architecture,Functioning,BasicserviceslikeWWW,FTP,
Telnet,Gopher etc.,Search engines,E-mail, Web Browsers.
InternetofThings(IoT):Definition,Sensors,theirtypesandfeatures,Smart Cities, 08
Industrial Internet of Things.
IV Blockchain:Introduction,overview,features,limitationsandapplicationareas
fundamentals of Block Chain.
Cryptocurrencies:Introduction,Applicationsanduse cases 08
CloudComputing:Itnatureandbenefits,AWS,Google,Microsoft&IBM
Services
V EmergingTechnologies: Introduction, overview, features, limitations and
applicationareasofAugmentedReality,VirtualReality,Gridcomputing,Green
08
computing,Bigdataanalytics,QuantumComputingandBrainComputer
Interface
SuggestedReadings:
1. RajaramanV.,“FundamentalsofComputers”,Prentice-HallofIndia.
2. NortonP.,“IntroductiontoComputers”,McGrawHillEducation.
3. GoelA.,“ComputerFundamentals”,Pearson.
4. BalagurusamyE.,“FundamentalsofComputers”,McGrawHill
5. TharejaR.,“FundamentalsofComputers”,OxfordUniversity Press.
6. BindraJ.,“TheTechWhisperer-onDigitalTransformationandtheTechnologiesthatEnableit”,Penguin
 MCA-6622:PROBLEMSOLVINGUSINGC
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto
Describethefunctionalcomponentsandfundamentalconceptsofa
CO1 K1,K2
digitalcomputersystemincludingnumbersystems.
CO2 Constructflowchartandwritealgorithmsforsolvingbasicproblems. K2,K3
Write‘C’programsthatincorporateuseofvariables,operatorsand
CO3 K2,K3
expressionsalongwithdatatypes.
Writesimpleprogramsusingthebasicelementslikecontrolstatements,
CO4 K2,K3
functions,arraysandstrings.
Writeadvancedprogramsusingtheconceptsofpointers,structures,
CO5 K2,K3
unionsandenumerateddatatypes.
Applypre-processordirectivesandbasicfilehandlingandgraphics
CO6 K2,K3
operationsinadvancedprogramming.
DETAILEDSYLLABUS 3-1-0
Unit Topic Proposed
Lecture
I Basicsofprogramming: Approaches to problem solving, Use of high 08
level programming language for systematic development of programs,
Concept of algorithm and flowchart, Concept and role of structured
programming.
BasicsofC: History of C, Salient features of C, Structure of C Program,
Compiling C Program, Link and Run C Program, Character set, Tokens,
Keywords,Identifiers,Constants,Variables,Instructions,Datatypes,
StandardInput/Output,Operatorsandexpressions.
II ConditionalProgramExecution: if, if-else, and nested if-else statements, 08
Switch statements, Restrictions on switch values, Use ofbreak and default
with switch, Comparison of switch and if-else.
LoopsandIteration: for, while and do-while loops, Multiple loop
variables, Nested loops, Assignment operators, break and continue
statement.
Functions: Introduction, Types, Declaration of a Function, Functioncalls,
Defining functions, Function Prototypes, Passing arguments to a
functionReturnvaluesandtheirtypes,Writingmultifunctionprogram,
Callingfunctionby value,Recursivefunctions.
III Arrays: Array notation and representation, Declaring one-dimensional 08
array, Initializing arrays, Accessing array elements, Manipulating array
elements, Arrays of unknown or varying size, Two-dimensional arrays,
Multidimensional arrays.
Pointers: Introduction, Characteristics, * and & operators, Pointer type
declarationandassignment, Pointer arithmetic, Call by reference,Passing
pointers to functions, arrayof pointers, Pointers to functions, Pointer to
pointer, Array of pointers.
Strings: Introduction, Initializing strings, Accessing string elements,
Array of strings, Passing strings to functions, String functions.
 IV Structure: Introduction, Initializing, defining and declaring structure, 08
Accessing members, Operations on individual members, Operations on
structures, Structure within structure, Array of structure, Pointers to
structure.
Union: Introduction, Declaring union, Usage of unions, Operations on
union. Enumerated data types
Storageclasses:Introduction,Types-automatic,register,staticand
external.
V DynamicMemoryAllocation:Introduction,Libraryfunctions– malloc, 08
calloc, realloc and free.
FileHandling: Basics, File types, File operations, File pointer, File
opening modes, File handling functions, File handling through command
line argument, Record I/O in files.
Graphics: Introduction, Constant, Data types and global variables
usedingraphics,Libraryfunctionsusedindrawing,Drawingandfilling
images,GUI interactionwithintheprogram.
SuggestedReadings:

1. KanetkarY.,“LetUsC”,BPBPublications.
2. Hanly J. R. and Koffman E. B.,“Problem Solving and Program Design in C”, Pearson
Education.
3. SchildtH.,“C-TheCompleteReference”,McGraw-Hill.
4. GoyalK.K.andPandeyH.M.,TroubleFreeC”,UniversitySciencePress
5. GottfriedB.,“Schaum’sOutlines- ProgramminginC”, McGraw-HillPublications.
6. KochanS.G.,“ProgramminginC”,Addison-Wesley.
7. Dey P. and Ghosh M., “Computer Fundamentals and Programming in C”, Oxford
University Press.
8.GoyalK.K.,SharmaM.K.andThapliyalM.P.“ConceptofComputerandC
Programming”,UniversitySciencePress.
 MCA- 6623 PrinciplesofManagement&Communication
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto
CO1 Describeprimaryfeatures,processesandprinciplesofmanagement. K1,K2
Explainfunctionsofmanagementintermsofplanning,decisionmakingand
CO2 K3,K4
organizing.
Illustratekeyfactorsofleadershipskillindirectingandcontrollingbusinessresources
CO3 K5,K6
andprocesses.
CO4 Exhibitadequateverbalandnon-verbalcommunicationskills K1,K3
CO5 Demonstrateeffectivediscussion,presentationandwritingskills. K3,K5
DETAILEDSYLLABUS 3-0-0
Unit Topic ProposedLe
cture
I Management: Need,Scope,MeaningandDefinition.TheprocessofManagement,
DevelopmentofManagementthoughtF.W.TaylorandHenryFayol,Horothorne 08
Studies,QualitiesofanEfficientManagement.
II Planning&Organising:Need,ScopeandImportanceofPlanning,Stepsinplanning,
Decisionmakingmodel.OrganisingneedandImportance,OrganisationalDesign, 08
Organisationalstructure,centralisationandDecentralisation,Deligation.
III Directing&Controlling: Motivation—Meaning, Importance, need.Theories of
Motivation,Leadership—meaning,needandimportance,leadershipstyle,Qualitiesof
effective leader, principles of directing, Basic control process, Different control 08
Techniques.
IV IntroductiontoCommunication: WhatisCommunication,Levelsofcommunication,
Barriers to communication, ProcessofCommunication, Non-verbalCommunication,
TheflowofCommunication:Downward,Upward,LateralorHorizontal(Peergroup)
08
Communication, Technology Enabled communication, Impact of Technology,
SelectionofappropriatecommunicationTechnology,ImportanceofTechnical
communication.
V Businessletters: Sales&Creditletters;ClaimandAdjustmentLetters;Job
application and Resumes.
Reports:Types;Structure,Style&WritingofReports.
TechnicalProposal:Parts;Types;WritingofProposal;Significance.
08
NuancesofDelivery;BodyLanguage;DimensionsofSpeech:Syllable;Accent;Pitch;
Rhythm; Intonation; Paralinguistic features of voice;
Communicationskills,Presentationstrategies,GroupDiscussion;Interviewskills;
Workshop; Conference; Seminars.
SuggestedReadings:

1. P.C.Tripathi,P.N.Reddy,"PrinciplesofManagement",McGrawHillEducation6thEdition.
2. C.B.Gupta,"ManagementPrinciplesandPractice",SultanChand&Sons3rdedition.
3. T.N.Chhabra,"BusinessCommunication",SunIndiaPublication.
4. V.N.AroraandLaxmiChandra,"ImproveYourWriting",OxfordUniv.Press,2001,NewDelhi.
5. MadhuRaniandSeemaVerma,"TechnicalCommunication:APracticalApproach",AcmeLearning, New
Delhi-2011.
6. MeenakshiRaman&SangeetaSharma,"TechnicalCommunication-PrinciplesandPractices",Oxford
Univ. Press, 2007, New Delhi.
7. KoontzHarold&WeihrichHeinz,"EssentialsofManagement",McGrawHill5thEdition2008.
8. RobbinsandCoulter, "Management",PrenticeHallofIndia,9 thedition.
9. JamesA.F.,Stoner,"Management",PearsonEducationDelhi.
10. P.D.Chaturvedi,"BusinessCommunication",PearsonEducation.
 MCA-6624DiscreteMathematics
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto
Usemathematicalandlogicalnotationtodefineandformallyreasonaboutbasic
CO1 K1,K2
discretestructuressuchasSets,RelationsandFunctions
Applymathematicalargumentsusinglogicalconnectivesandquantifierstocheck the
CO2 K2,K3
validity ofanargumentthroughtruthtablesandpropositionalandpredicatelogic
CO3 IdentifyandprovepropertiesofAlgebraicStructureslikeGroups,RingsandFields K3,K4
CO4 Formulateandsolverecurrencesandrecursivefunctions K3,K4
CO5 Applytheconceptofcombinatoricstosolvebasicproblemsindiscretemathematics K1,K3
DETAILEDSYLLABUS 3-0-0
Unit Topic ProposedLe
cture
I SetTheory:Introduction, SizeofsetsandCardinals, Venndiagrams,Combinationof sets, 08
Multisets, Ordered pairs and Set Identities.
Relation:Definition, Operationsonrelations,Compositerelations,Properties of relations,
Equality of relations, Partial order relation.
Functions:Definition,Classificationoffunctions,Operationsonfunctions, Recursively
defined functions.
II Posets,HasseDiagramandLattices:Introduction,Partialorderedsets,Combination 08
ofPartialordered sets,Hassediagram, Introductionoflattices,Propertiesoflattices–
Bounded, Complemented, Modular and Complete lattice.
BooleanAlgebra:Introduction,AxiomsandTheoremsofBooleanalgebra, Boolean
functions.SimplificationofBooleanfunctions,Karnaughmaps,Logicgates.
III Propositional:Propositions,Truthtables,Tautology,Contradiction,Algebraof 08
Propositions,Theoryof Inference and Natural Detection.
PredicateLogic:TheoryofPredicates,Firstorderpredicate,Predicateformulas,
Quantifiers, Inference theory of predicate logic.
IV AlgebraicStructures:Introduction to algebraic Structures and properties. Types of 08
algebraic structures:Semi group, Monoid, Group, Abelian group and Properties of
group. Subgroup, Cyclic group, Cosets, Permutation groups, Homomorphism and
Isomorphism of groups.
RingsandFields:DefinitionandelementarypropertiesofRingsandFields.
V NaturalNumbers: Introduction, Piano’s axioms, Mathematical Induction, Strong 08
Induction and Induction with Nonzero Base cases.
RecurrenceRelation&Generatingfunctions: Introduction and properties of
Generating Functions. Simple Recurrence relation with constant coefficients and
Linear recurrence relation without constant coefficients. Methods of solving
recurrences.
Combinatorics:Introduction,CountingtechniquesandPigeonholeprinciple,
Polya’sCountingtheorem.
SuggestedReadings:

1. KennethH.Rosen,"DiscreteMathematicsandItsApplications",McGrawHill,2006.
2. B.Kolman,R.CBusbyandS.CRoss,"DiscreteMathematicsStructures",PrenticeHall,2004.
3. R.PGirimaldi,"DiscreteandCombinatorialMathematics",AddisonWesley,2004.
4. Y.N.Singh,"DiscreteMathematicalStructures",Wiley-India,Firstedition,2010.
5. SwapankumarSarkar,"ATextbookofDiscreteMathematics”,S.Chand&CompanyPVT.LTD.V.
6. Krishnamurthy,"CombinatoricsTheory&Application",East-WestPressPvt.Ltd.,NewDelhi.
7. Liptschutz,Seymour,"DiscreteMathematics",McGrawHill.
8. J.P.Trembely&R.Manohar,"DiscreteMathematicalStructurewithapplicationtoComputerScience",
McGraw Hill.
 MCA - 6625COMPUTERORGANIZATION&ARCHITECTURE
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto
Describefunctionalunitsofdigitalsystemandexplainhowarithmeticandlogical
CO1 K2,K3
operationsareperformedbycomputers
Describetheoperationsofcontrolunitandwritesequenceofinstructionsforcarrying
CO2 K2,K4
outsimpleoperationusingvariousaddressingmodes.
CO3 Designvarioustypesofmemoryanditsorganization. K3
DescribethevariousmodesinwhichIOdevicescommunicatewithCPUandmemory.
CO4 K2,K3
Listthecriteriaforclassificationofparallelcomputeranddescribevarious
CO5 K1,K2
architecturalschemes.
DETAILEDSYLLABUS 3-1-0
Unit Topic Proposed
Lecture
I Introduction:Functionalunitsofdigitalsystemandtheirinterconnections,buses,bus 08
architecture, typesofbusesandbusarbitration.Register,busandmemorytransfer.
Processororganization:generalregistersorganization,stackorganizationand addressing
modes.
II Arithmeticandlogicunit:Lookaheadcarriesadders.Multiplication:Signedoperand 08
multiplication,Boothsalgorithmandarraymultiplier.Divisionandlogicoperations.
Floatingpointarithmeticoperation,Arithmetic&logicunitdesign.IEEEStandardfor
Floating Point Numbers.
III ControlUnit: Instructiontypes,formats,instructioncyclesandsubcycles(fetchand 08
executeetc),microoperations,executionofacompleteinstruction.ProgramControl,
Reduced Instruction Set Computer, Pipelining. Hardwire and micro programmed
control:micro-programsequencing,conceptofhorizontalandvertical
microprogramming.
IV Memory:Basicconceptandhierarchy,semiconductorRAMmemories,2D&21/2D 08
memoryorganization.ROMmemories.Cachememories:conceptanddesignissues&
performance,addressmappingandreplacementAuxiliarymemories:magneticdisk,
magnetictapeandopticaldisksVirtualmemory:conceptimplementation.
V Input/Output: Peripheral devices, I/O interface, I/O ports, Interrupts: interrupt 08
hardware, types of interrupts and exceptions. Modes of Data Transfer: Programmed
I/O,interruptinitiatedI/OandDirect MemoryAccess.,I/Ochannelsandprocessors.
Serial Communication: Synchronous & asynchronous communication, standard
communication interfaces.
SuggestedReadings:

1. JohnP.Hayes,"ComputerArchitectureandOrganization",McGrawHill.
2. WilliamStallings,"ComputerOrganizationandArchitecture-DesigningforPerformance",Pearson
Education.
3. M.MorrisMano,"ComputerSystemArchitecture",PHI.
4. CarlHamacher,ZvonkoVranesic,SafwatZaky,"ComputerOrganization",McGraw-Hill.
5. BehroozParahami,“ComputerArchitecture”,OxfordUniversityPress.
6. DavidA.PattersonandJohnL.Hennessy,“ComputerArchitecture-AQuantitativeApproach”,
ElsevierPub.
7. Tannenbaum,"StructuredComputerOrganization",PHI.
 MCA - 60626PROBLEMSOLVINGUSINGCLAB

CourseOutcome(CO) Bloom’s
Knowled
geLevel(
KL)

Attheendofcourse,thestudentwillbeableto

Write,compile,debugandexecuteprogramsinaCprogramming environment.
CO1 K3

Writeprogramsthatincorporateuseofvariables,operatorsand expressions
CO2 K3
along with data types.

Writeprogramsforsolvingproblemsinvolving useof decisioncontrol

CO3 K3
structures and loops.

Writeprogramsthatinvolvetheuseofarrays,structuresanduser defined
CO4 K3
functions.

CO5 Writeprogramsusinggraphicsandfilehandlingoperations. K3

1. Programtoimplementconditional statementsinClanguage.
2. Programtoimplementswitch-case statementinClanguage
3. ProgramtoimplementloopingconstructsinClanguage.
4. Programtoperformbasicinput-outputoperationsinClanguage.
5. ProgramtoimplementuserdefinedfunctionsinClanguage.
6. ProgramtoimplementrecursivefunctionsinClanguage.
7. Programtoimplementone-dimensionalarraysinClanguage.
8. Programtoimplementtwo-dimensionalarraysinClanguage.
9. Programtoperformvariousoperationsontwo-dimensionalarraysinClanguage.
10. Programtoimplementmulti-dimensionalarraysinC language.
11. ProgramtoimplementstringmanipulationfunctionsinClanguage.
12. Programtoimplementstructurein Clanguage.
13. Programtoimplement unioninClanguage.
14. ProgramtoperformfilehandlingoperationsinClanguage.
15. ProgramtoperformgraphicaloperationsinClanguage.

Note:TheInstructormayadd/delete/modifyexperiments,whereverhe/shefeelsinajustifiedman
ner.
 MCA - 60627COMPUTERORGANIZATION&ARCHITECTURELAB

CourseOutcome(CO) Bloom’s
Knowled
geLevel(
KL)

Attheendofcourse,thestudentwillbeableto

Designandverifycombinationalcircuits(adder,codeconverter, decoder,
CO1 multiplexer) using basic gates. K6

CO2 Designandverifyvariousflip-flops. K3

CO3 DesignI/OsystemandALU. K3

CO4 Demonstratecombinationalcircuitusingsimulator K2

1. ImplementingHALFADDER, FULLADDERusingbasiclogicgates.
2. ImplementingBinary-to-Gray,Gray-to-Binarycodeconversions.
3. Implementing3-8lineDECODER.Implementing4x1and8x1MULTIPLEXERS.
4. VerifytheexcitationtablesofvariousFLIP-FLOPS.
5. Designofan8-bitInput/Outputsystem withfour8-bitInternalRegisters.
6. Designofan8-bitARITHMETICLOGICUNIT.
7. Designthedatapathofacomputerfromitsregister transferlanguagedescription.
8. Design the control unit of a computer using either hardwiring or
microprogramming based on its register transfer language description.
9. Implementasimpleinstructionsetcomputerwithacontrolunitandadatapath.

Note:TheInstructormayadd/delete/modify/tuneexperiments,whereverhe/shefeelsinajustifie
dmanner.
 MCA- 60628PROFESSIONALCOMMUNICATIONLAB

CourseOutcome(CO) Bloom’s
Knowled
geLevel(
KL)

Attheendofcourse,thestudentwillbeableto

Developtheability towork asa teammember as anintegral activity in the

CO1 K3
workplace.

Increaseconfidenceintheirability toread,comprehend, organize,and retain

CO2 K4
written information. Improve reading fluency.

Write coherent speech outlines that demonstrate their ability to use

organizational formatswitha specificpurpose; Deliver effective speeches
CO3 K5,K6
that are consistent with and appropriate for the audience and purpose.

Developproperlisteningskills;articulateandenunciatewordsand sentences
CO4 K3
clearly and efficiently.

Show confidence and clarity in public speaking projects; be

CO5 K5
schooledinpreparation and research skills for oral presentations.

1. Group Discussion: participating in group discussions- understanding group

dynamics.
2. GD strategies-activities to improve GD skills. Practical based on Accurate and
Current Grammatical Patterns.
3. Interview Etiquette-dress code, body language attending job interview –
Telephone/Skype interview one to one interview &Panel interview.
4. Communication Skills for Seminars/Conferences/Workshops with emphasis on
Paralinguistic/ Kinesics, practicing word stress, rhythm in sentences, weak forms,
intonation.
5. Oral Presentation Skills for Technical Paper/Project Reports/ Professional Reports
based on proper Stress and Intonation Mechanics voice modulation ,Audience
Awareness, Presentation plan visual aids.
6. Speaking:-Fluency & Accuracy in speech- positive thinking, Improving Self
expression Developing persuasive speaking skills, pronunciation practice (foraccept
neutralization) particularly of problem sounds, in isolated words as well as
sentences.
7. IndividualSpeechDelivery/Conferenceswithskillstodefend Interjections/Quizzes.
8. ArgumentativeSkills/RolePlayPresentationwithStressandIntonation.
9. Comprehension Skills based on Reading and Listening Practical’s on a modelAudio-
Visual Usage.
 Syllabus

MCA1stYearI
IndSemester
 MCA(MASTEROFCOMPUTERAPPLICATION)FI
RSTYEARSYLLABUS
SEMESTER-II
MCA- 6627THEORYOFAUTOMATA&FORMALLANGUAGES
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto
Definevarioustypesofautomatafordifferentclassesofformal
CO1 K1,K2
languagesandexplaintheirworking.
CO2 Stateandprovekeypropertiesof formallanguages andautomata. K1,K3
Constructappropriateformalnotations(suchasgrammars,acceptors,
CO3 K3,K4
transducersandregularexpressions)forgivenformallanguages.
CO4 Convertamongequivalentnotationsforformallanguages. K3
ExplainthesignificanceoftheUniversalTuringmachine,Church-
CO5 K2
TuringthesisandconceptofUndecidability.
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I BasicConceptsandAutomataTheory:IntroductiontoTheory
ofComputation- Automata, Computability and Complexity, Alphabet,
Symbol, String, Formal Languages, Deterministic Finite Automaton 08
(DFA)- Definition, Representation, Acceptability of a String and
Language, Non Deterministic Finite Automaton (NFA), Equivalence of
DFAandNFA,NFAwithε-Transition,EquivalenceofNFA’swith
andwithoutε-Transition,FiniteAutomatawithoutput-Moore machine,
Mealy Machine, Equivalence of Moore and Mealy Machine,
MinimizationofFiniteAutomata,Myhill-NerodeTheorem,Simulation
ofDFAandNFA.
II RegularExpressionsandLanguages:RegularExpressions,Transition
Graph,Kleen’sTheorem,FiniteAutomataandRegularExpression-
Arden’stheorem,AlgebraicMethodUsingArden’sTheorem,Regular 08
andNon-Regular Languages- Closure properties of
RegularLanguages,PigeonholePrinciple,PumpingLemma,Applicationof
PumpingLemma,Decidability-Decisionproperties, Finite Automata
and Regular Languages, Regular Languages and
Computers, SimulationofTransitionGraphandRegular language.
III RegularandNon-RegularGrammars: Context Free Grammar(CFG)-
Definition,Derivations,Languages,Derivation Trees and Ambiguity,
Regular Grammars-Right Linear and LeftLinear grammars, 08
Conversion of FA into CFG and Regular grammar
intoFA,SimplificationofCFG,NormalForms-Chomsky
NormalForm(CNF),GreibachNormalForm(GNF),Chomsky
Hierarchy,ProgrammingproblemsbasedonthepropertiesofCFGs.
IV PushDownAutomataandPropertiesofContextFreeLanguages:
NondeterministicPushdownAutomata(NPDA)-Definition,Moves,
ALanguageAcceptedbyNPDA,DeterministicPushdown 08
Automata(DPDA)andDeterministicContextfreeLanguages(DCFL),
 Pushdown Automata for Context Free Languages, Context Free
grammars for Pushdown Automata, Two stack Pushdown Automata,
PumpingLemmaforCFL,ClosurepropertiesofCFL,Decision
ProblemsofCFL, Programming problems based on the properties of
CFLs.
V TuringMachinesandRecursiveFunctionTheory:Basic
TuringMachineModel, Representation of Turing Machines,Language
Acceptability of Turing Machines, Techniques for Turing Machine 08
Construction, Modifications of Turing Machine, Turing Machineas
Computer of Integer Functions, Universal Turingmachine, Linear
Bounded Automata, Church’s Thesis, Recursive and
RecursivelyEnumerablelanguage,HaltingProblem,Post
CorrespondenceProblem,IntroductiontoRecursiveFunctionTheory.
SuggestedReadings:
1. J.E.Hopcraft,R.Motwani,andUllman,"IntroductiontoAutomatatheory, Languages and
Computation", Pearson EducationAsia,2nd Edition.
2. J. Martin, "Introduction to languages and the theory of computation", McGraw
Hill,3rd Edition.
3. C.PapadimitrouandC.L. Lewis,"ElementsandTheoryof Computation",PHI.
4. K.L.P.MishraandN.Chandrasekaran,"TheoryofComputer ScienceAutomata
Languages and Computation" , PHI.
5. Y.N. Singh, "Mathematical Foundation of Computer Science", New Age
International.
 MCA - 6626OBJECTORIENTEDPROGRAMMING
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto
Listthesignificanceandkeyfeaturesofobjectorientedprogrammingandmodeling
CO1 K4
usingUML
Constructbasicstructural,behavioralandarchitecturalmodelsusingobjectoriented
CO2 K6
softwareengineeringapproach.
CO3 Integrateobjectorientedmodelingtechniquesforanalysisanddesignofasystem. K4, K5
CO4 UsethebasicfeaturesofdataabstractionandencapsulationinC++programs. K4
Usetheadvancedfeatures suchasInheritance,polymorphism andvirtualfunctionin
CO5 K3,K4
C++programs.
DETAILEDSYLLABUS 3-1-0
Unit Topic Proposed
Lecture
I Introduction: Object Oriented Programming: objects, classes, Abstraction, 08
Encapsulation, Inheritance,Polymorphism,OOPinJava,CharacteristicsofJava,The Java
Environment, Java Source File Structure, and Compilation. Fundamental
Programming Structures in Java: Defining classes in Java, constructors, methods,
accessspecifies,staticmembers,Comments,DataTypes,Variables,Operators,
ControlFlow,Arrays.
II Inheritance,Interfaces,andPackages: Inheritance: Super classes, sub classes, 08
Protected members, constructors in sub classes, Object class, abstract classes and
methods.Interfaces:defining an interface,implementing interface,differencesbetween
classes and interfaces and extending interfaces, Object cloning, inner classes.
Packages: Defining Package, CLASSPATH Setting for Packages, Making JAR Files
forLibraryPackages,ImportandStaticImportNamingConventionForPackages,
Networkingjava.netpackage.
III ExceptionHandling,I/O: Exceptions: exception hierarchy, throwing and catching 08
exceptions,built-in exceptions, creatingownexceptions, StackTraceElements. Input/
Output Basics: Byte streams and Character streams, Reading and Writing, Console
Reading and Writing Files.
IV MultithreadingandGenericProgramming:Differencesbetweenmulti-threading 08
andmultitasking,threadlife cycle,creatingthreads,synchronizing threads, Inter-thread
communication,daemonthreads,threadgroups.GenericProgramming:Generic classes,
genericmethods,BoundedTypes:Restrictionsand Limitations.
V EventDrivenProgramming:Graphicsprogramming:Frame,Components,working 08
with 2D shapes,Using colors, fonts, and images. Basics of event handling: event
handlers,adapterclasses,actions,mouseevents,AWTeventhierarchy.Introductionto
Swing: layout management, Swing Components: Text Fields, Text Areas, Buttons,
CheckBoxes,Radio Buttons,Lists,choices, Scrollbars,WindowsMenusandDialog
Boxes.
SuggestedReadings:
1. HerbertSchildt,"JavaThecompletereference",McGrawHillEducation,8thEdition,2011.
2. CayS.Horstmann,GaryCornell,"CoreJavaVolume–IFundamentals", PrenticeHall,9th
Edition,2013.
3. StevenHolzner,“JavaBlackBook”,Dreamtech.
4. BalagurusamyE,“ProgramminginJava”,McGrawHill
5. Naughton,Schildt,“TheCompletereferencejava2”,McGrawHill
6. KhalidMughal,“AProgrammer’sGuidetoJavaSE8OracleCertifiedAssociate(OCA)”,Addison-
Wesley.
 MCA- 6629 OPERATINGSYSTEMS
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto
CO1 Explainmaincomponents,services,typesandstructureofOperatingSystems. K2
Applythevariousalgorithmsandtechniquestohandlethevariousconcurrency
CO2 K3
controlissues.
CO3 Compareandapply variousCPUschedulingalgorithmsforprocessexecution. K2
CO4 Identifyoccurrenceofdeadlockanddescribewaystohandleit. K3
CO5 Explainandapplyvariousmemory,I/Oanddiskmanagementtechniques. K5
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I Introduction: Operating System Structure- Layered structure, System
Components, Operating system functions, Classification of Operatingsystems-
08
Batch,Interactive,Timesharing,RealTimeSystem,
MultiprocessorSystems,MultiuserSystems,MultiprocessSystems,
Multithreaded Systems, Operating System services, Reentrant Kernels,
Monolithic and Microkernel Systems.
II ConcurrentProcesses:ProcessConcept,PrincipleofConcurrency, Producer /
Consumer Problem, Mutual Exclusion, Critical Section Problem, Dekker’s 08
solution, Peterson’s solution, Semaphores, Test and Set operation, Classical
Problem in Concurrency- Dining Philosopher Problem, Sleeping
BarberProblem,InterProcessCommunicationmodelsandSchemes,
Processgeneration.
III CPUScheduling: Scheduling Concepts, Performance Criteria, ProcessStates,
Process Transition Diagram, Schedulers, Process Control Block(PCB),
Processaddress space, Processidentificationinformation, Threads and their 08
management, Scheduling Algorithms, Multiprocessor Scheduling. Deadlock:
System model, Deadlock characterization, Prevention, Avoidance and
detection,
Recoveryfromdeadlock.
IV MemoryManagement: Basic bare machine, Resident monitor,
Multiprogramming with fixed partitions, Multiprogramming with variable 08
partitions, Protection schemes, Paging, Segmentation,
Paged segmentation, Virtual memory concepts, Demand
paging,Performanceofdemandpaging,Pagereplacementalgorithms,Thrashing,
Cachememoryorganization,Localityofreference.
V I/OManagementandDiskScheduling:I/Odevices,andI/Osubsystems, I/O
buffering, Disk storage and disk scheduling, RAID. File System: File concept, 08
File organization and access
mechanism,Filedirectories,andFilesharing,Filesystemimplementation
issues,Filesystemprotectionandsecurity.
SuggestedReadings:
1. Silberschatz,GalvinandGagne,“OperatingSystemsConcepts”,WileyPublication.
2. SibsankarHalderandAlexAArvind,“OperatingSystems”,PearsonEducation.
3. HarveyMDietel,“AnIntroductiontoOperatingSystem”,PearsonEducation.
4. William Stallings, “Operating Systems: Internals and Design Principles”, 6th Edition,
Pearson Education.
5. Harris,Schaum'sOutlineOfOperatingSystems,McGrawHill
 MCA-6628:DATABASEMANAGEMENTSYSTEMS

CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto
Describethefeaturesofadatabasesystemanditsapplicationandcomparevarious
CO1 K2
typesofdatamodels.
ConstructanERModelfora givenproblemandtransformitintoarelationdatabase
CO2 K5,K6
schema.
FormulatesolutiontoaqueryproblemusingSQLCommands,relationalalgebra,tuple
CO3 K5,K6
calculusanddomaincalculus.
Explaintheneedofnormalizationandnormalizeagivenrelationtothedesirednormal
CO4 K2,K3
form.
CO5 Explaindifferentapproachesoftransactionprocessingandconcurrencycontrol. K2
DETAILEDSYLLABUS 3-0-0
Unit Topic ProposedLe
cture
I Introduction:Overview,DatabaseSystemvsFileSystem,DatabaseSystemConcept 08
andArchitecture,DataModelSchemaandInstances,DataIndependenceandDatabase
Language and Interfaces, Data Definitions Language, DML, Overall Database
Structure. DataModeling Using theEntityRelationship Model:ER ModelConcepts,
NotationforERDiagram,MappingConstraints,Keys,ConceptsofSuper Key,
Candidate Key, Primary Key, Generalization, Aggregation, Reduction of an ER
Diagrams toTables,ExtendedERModel,Relationship ofHigherDegree.
II RelationaldataModelandLanguage: Relational Data Model Concepts, Integrity 08
Constraints, Entity Integrity, Referential Integrity, Keys Constraints, Domain
Constraints, Relational Algebra, Relational Calculus, Tuple and Domain Calculus.
IntroductiontoSQL:CharacteristicsofSQL,AdvantageofSQL.SQLDataTypeand
Literals. Types ofSQLCommands.SQLOperatorsand their Procedure. Tables,Views
andIndexes.QueriesandSubQueries.AggregateFunctions.Insert,UpdateandDelete
Operations,Joins,Unions,Intersection,Minus,Cursors,Triggers,Proceduresin
SQL/PLSQL
III DataBaseDesign&Normalization: Functional dependencies, normal forms, first, 08
second, third normal forms, BCNF, inclusion dependence, loss less join
decompositions, normalization using FD, MVD, and JDs, alternative approaches to
database design
IV TransactionProcessingConcept: Transaction System, Testing of Serializability, 08
Serializability of Schedules, Conflict & View Serializable Schedule, Recoverability,
RecoveryfromTransactionFailures,LogBasedRecovery,Checkpoints,Deadlock
Handling. Distributed Database: Distributed Data Storage, Concurrency Control,
DirectorySystem
V ConcurrencyControlTechniques: Concurrency Control, Locking Techniques for 08
ConcurrencyControl, Time StampingProtocols for ConcurrencyControl, Validation
BasedProtocol,MultipleGranularity,MultiVersionSchemes,Recoverywith
ConcurrentTransaction,CaseStudyofOracle.
SuggestedReadings:
1. Korth,Silbertz,Sudarshan,”DatabaseConcepts”,McGrawHill.
2. DateCJ,“AnIntroductiontoDatabaseSystems”,AddisionWesley.
3. Elmasri,Navathe,“FundamentalsofDatabaseSystems”,AddisionWesley.
4. O’Neil,"Databases",ElsevierPub.
5. Ramakrishnan,"DatabaseManagementSystems",McGrawHill.
6. Leon&Leon,”DatabaseManagementSystems”,VikasPublishingHouse.
7. BipinC.Desai,“AnIntroductiontoDatabaseSystems”,GagotiaPublications.
8. Majumdar&Bhattacharya,“DatabaseManagementSystem”,McGrawHill.
 MCA-6630:DATASTRUCTURES&ANALYSISOFALGORITHMS
CourseOutcome(CO) Bloom’sKn
owledge
Level(KL)
Attheendofcourse,thestudentwillbeableto
Explaintheconceptof datastructure,abstractdatatypes, algorithms, analysis of
CO1 algorithms and basic dataorganization schemes suchas arrays and linked lists. K2

Describetheapplicationsofstacksandqueuesandimplementvarious
CO2 K3
operationsonthemusingarraysandlinkedlists.
Describethepropertiesofgraphsandtreesandimplementvarious
CO3 K3
operationssuchassearchingandtraversalonthem.
Compareincrementalanddivide-and-conquerapproachesofdesigning
CO4 K4
algorithmsforproblemssuchassortingandsearching.
ApplyandanalyzevariousdesignapproachessuchasDivide-and-Conquer,
CO5 K4
greedy anddynamicforproblemsolving.
DETAILEDSYLLABUS 4-0-0
Unit Topic Proposed
Lecture
I Introductiontodatastructure: Data, Entity, Information, Difference between
Data and Information, Data type , Build in data type, Abstract data 08
type,Definitionofdatastructures, Typesof DataStructures:Linear and Non-
Linear Data Structure, Introduction to Algorithms: Definition of Algorithms,
Difference between algorithm and programs, properties of algorithm,
Algorithm Design Techniques, Performance Analysis of Algorithms,
Complexity of various code structures, Order of Growth, Asymptotic
Notations.
Arrays: Definition, Single and Multidimensional Arrays, Representation of
Arrays: Row Major Order, and Column Major Order, Derivation of Index
Formulaefor1-D,2-DArrayApplicationofarrays,SparseMatricesand their
representations.
Linkedlists: Array Implementation and Pointer Implementation of Singly
Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a
Linked List. Insertion, Deletion, Traversal, Polynomial Representation and
Addition Subtraction & Multiplications of Single variable.
II Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array
and Linked Implementation of Stack in C, Application of stack: Prefix and 08
Postfix Expressions, Evaluation of postfix expression, Iteration and
Recursion- Principles of recursion, Tail recursion, Removal of recursion
Problem solving using iteration and recursion with examples such as binary
search, Fibonacci numbers, and Hanoi towers.
Queues: Operations on Queue: Create, Add, Delete, Full and Empty,Circular
queues, Array and linked implementation of queues in C, Dequeue and
Priority Queue.
Searching: Concept of Searching, Sequential search, Index
SequentialSearch,BinarySearch.ConceptofHashing&Collisionresolution
TechniquesusedinHashing.
 III Sorting: Insertion Sort, Selection Sort, Bubble Sort, Heap Sort, Comparison
of Sorting Algorithms, Sorting in Linear Time: Counting Sort and Bucket
Sort. 08
Graphs: Terminology used with Graph, Data Structure for Graph
Representations: Adjacency Matrices, Adjacency List, Adjacency. Graph
Traversal:DepthFirstSearchandBreadthFirstSearch,Connected
Component.
IV Trees: Basic terminology used with Tree, Binary Trees, Binary Tree
Representation: Array Representation and Pointer (Linked List) 08
Representation, Binary Search Tree, Complete Binary Tree, A Extended
Binary Trees, Tree Traversal algorithms: Inorder, Preorder and Postorder,
Constructing Binary Tree from given Tree Traversal, Operation of Insertion,
Deletion,Searching&ModificationofdatainBinarySearchTree.
Threaded Binary trees, Huffman coding using Binary Tree, AVL Tree and B
Tree.
V Divide and Conquer with Examples Such as Merge Sort, Quick Sort, Matrix
Multiplication: Strassen’s Algorithm 08
Dynamic Programming: Dijikstra Algorithm, Bellman Ford Algorithm, All-
pair Shortest Path: Warshal Algorithm, Longest Common Sub-sequence
GreedyProgramming:PrimsandKruskalalgorithm.
SuggestedReadings:

1. CormenT.H.,LeisersonC.E.,RivestR.L., andSteinC.,“IntroductiontoAlgorithms”,PHI.
2. Horowitz Ellis, Sahni Sartaj and Rajasekharan S., “Fundamentals of Computer Algorithms”,
2nd Edition, Universities Press.
3. DaveP.H.,H.B.Dave,“DesignandAnalysisofAlgorithms”,2ndEdition,PearsonEducation.
4. LipschutsS.,“TheoryandProblemsofDataStructures”,Schaum’sSeries.
5. Goyal K. K., Sharma Sandeep & Gupta Atul, “Data Structures and Analysis of Algorithms”,
HP Hamilton.
6. Lipschutz, DataStructuresWithC-SIE -SOS,McGraw Hill
7. SamantaD.,“ClassicDataStructures”,2nd EditionPrenticeHallIndia.
8. Goodrich M. T. and Tomassia R., “Algorithm Design: Foundations, Analysis and Internet
examples”, John Wiley and sons.
9. SridharS.,“DesignandAnalysisofAlgorithms”,OxfordUniv.Press.
10. Aho,UllmanandHopcroft,“DesignandAnalysisofalgorithms”,PearsonEducation.
11. R. Neapolitan and K. Naimipour, “Foundations of Algorithms”,4th edition, Jones an Bartlett
Student edition.
12. ReemaThareja,DataStructuresusingC,OxfordUniv.Press
 MC-60631:OBJECTORIENTEDPROGRAMMINGLAB

CourseOutcome(CO) Bloom’sK
nowledgeLe
vel(KL)

Attheendofcourse,thestudentwillbeableto

UsetheConceptofDataAbstractionandEncapsulationinC++ programs.
CO1 K3

DesignandDevelopC++programusingtheconceptsuchas polymorphism,
CO2 K3
virtual function, exception handling and template.

Applyobjectorientedtechniquestoanalyze,designanddevelopa complete
CO3 K3
solution for a given problem.

1. UseJavacompilerandeclipseplatformtowriteandexecutejava program.
2. Creatingsimplejavaprograms,
3. UnderstandOOPconceptsandbasicsofJavaprogramming.
4. CreateJavaprogramsusinginheritanceandpolymorphism.
5. Implementerror-handlingtechniquesusingexceptionhandlingandmultithreading.
6. Understandtheuseofjavapackages.
7. Filehandlingandestablishmentofdatabaseconnection.
8. Developacalculatorapplicationinjava.
9. DevelopaClientServer Application.
10. DevelopGUIapplicationsusingSwingcomponents.
 MC-60632:DATABASEMANAGEMENTSYSTEMSLAB

CourseOutcome(CO) Bloom’sK
nowledgeLe
vel(KL)

Attheendofcourse,thestudentwillbeableto

UsetheConceptofDataAbstractionandEncapsulationinC++ programs.
CO1 K6

CO2 WriteSQLcommandstoqueryadatabase. K3

WritePL/SQLprogramsforimplementingstoredprocedures,stored
CO3 K6
functions, cursors, trigger and packages.

1. Installingoracle/MYSQL.
2. CreatingEntity-RelationshipDiagramusingcasetools.
3. WritingSQLstatementsUsingORACLE/MYSQL:
a.Writing basic SQL SELECT statements.
b.Restricting and sorting data.c.Displaying
data from multiple tables. d.Aggregating
data using group function. e.Manipulating
data.
f.Creatingandmanagingtables.
4. Normalization.
5. Creatingcursor.
6. Creatingprocedureandfunctions.
7. Creatingpackagesandtriggers.
8. Designandimplementationof payrollprocessingsystem.
9. DesignandimplementationofLibraryInformationSystem.
10. Designandimplementationof StudentInformationSystem.
11. AutomaticBackupofFilesandRecoveryofFiles.
 MC-60633:DATASTRUCTURES&ANALYSISOFALGORITHMSLAB

CourseOutcome(CO) Bloom’sKn
owledgeLeve
l(KL)

Attheendofcourse,thestudentwillbeableto

Writeandexecuteprogramstoimplementvarioussearchingandsorting
CO1 K3
algorithms.

Writeandexecuteprogramstoimplementvariousoperationsontwo-
CO2 K3
dimensional arrays.

ImplementvariousoperationsofStacksandQueuesusingboth arrays and

CO3 linked lists data structures. K3

Implementgraphalgorithmtosolvetheproblemofminimum spanning
CO4 K3
tree

PrograminCorC++forfollowing:
1. Toimplementadditionandmultiplicationoftwo2Darrays.
2. Totransposea2Darray.
3. Toimplementstackusingarray
4. Toimplementqueueusingarray.
5. Toimplementcircularqueueusingarray.
6. Toimplementstackusinglinkedlist.
7. Toimplementqueueusinglinkedlist.
8. ToimplementBFS usinglinkedlist.
9. ToimplementDFSusinglinkedlist.
10. ToimplementLinearSearch.
11. 11.ToimplementBinary Search.
12. ToimplementBubbleSorting.
13. ToimplementSelectionSorting.
14. ToimplementInsertionSorting.
15. ToimplementMergeSorting.
16. ToimplementHeapSorting.
17. ToimplementMatrixMultiplicationbystrassen’salgorithm
18. FindMinimumSpanning TreeusingKruskal’sAlgorithm
SECONDYEARSYLLABUS
SEMESTER-III
 MC-7621:ArtificialIntelligence
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 Definethemeaningofintelligenceandstudyvariousintelligentagents. K1
CO2 Understand,analyzeandapplyAIsearchingalgorithmsindifferentproblem domains. K2,K3,K4

CO3 Studyandanalyzevariousmodelsforknowledgerepresentation. K1,K3

CO4 Understand the basic concepts of machine learning to analyze and implement K2,K4,K6
widely used learning methods and algorithms.
CO5 Understandtheconceptofpattern recognition and evaluate various K2,K5
classificationandclusteringtechniques
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I Artificial Intelligence: Introduction to artificial intelligence, Historical 08
development and foundation areas of artificial intelligence, Tasks and
applicationareasofartificialintelligence.Introduction,typesandstructureof
intelligentagents,ComputerVision,Naturallanguageprocessing.
II SearchingTechniques:Introduction,Problemsolvingbysearching,Searching for 08
solutions, Uniformed searching techniques, Informed searching techniques,
Localsearchalgorithms,Adversarialsearchmethods,Searchtechniquesused
ingames,Alpha-Betapruning.
III Knowledge Representation and Reasoning: Propositional logic, Predicate 08
logic, First order logic, Inference in first order logic, Clause form conversion,
Resolution. Chaining- concept, forward chaining and backward chaining,
Utility theory and Probabilistic reasoning, Hidden Markov model, Bayesian
networks.
IV Machine Learning: Introduction, types and application areas, Decision trees, 08
Statisticallearningmethods,Learningwithcompletedata-conceptandNaïve
Bayes models, Learning with hidden data- concept and EM algorithm,
Reinforcementlearning.
V Pattern Recognition: Introduction and design principles, Statistical pattern 08
recognition, Parameter estimation methods - Principle component analysis and
Linear discrimination analysis, Classification techniques - Nearest neighbor
rule and Bayes classifier, K-means clustering, Support vector machine.
SuggestedReadings:
1. RussellS.andNorvigP.,“ArtificialIntelligence–AModernApproach”,PearsonEducation.
2. RichE.andKnightK.,“ArtificialIntelligence”,McGrawHillPublications.
3. CharnikE.andMcDermottD.,“IntroductiontoArtificialIntelligence”,PearsonEducation.
4. PattersonD.W.,“ArtificialIntelligenceandExpertSystems”,PrenticeHallofIndiaPublications.
5. KhemaniD.,“AFirstCourseinArtificialIntelligence”,McGrawHill.
6. WinstonP.H.,“ArtificialIntelligence”,PearsonEducation.
7. Thornton C.and Boulay B.,” ArtificialIntelligence-Strategies,ApplicationsandModelsthrough
Search”, New Age International Publishers.
 MC-7623:Software Engineering
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Atthe endof course, thestudentwill beable to understand
CO1 Explainvarioussoftwarecharacteristicsandanalyzedifferentsoftware K1,K2
DevelopmentModels.
CO2 Demonstrate the contents of a SRS and apply basic software quality K1,K2
assurance practices to ensure that design, development meet or exceed
applicable standards.
CO3 Compareandcontrastvariousmethodsforsoftwaredesign. K2,K3
CO4 Formulatetestingstrategyfor softwaresystems, employtechniquessuch as
unit testing, Test driven development and functional testing. K3
CO5 Managesoftwaredevelopmentprocessindependentlyaswellasin
teamsandmakeuseofvarioussoftwaremanagementtoolsfor K5
development,maintenanceandanalysis.
DETAILEDSYLLABUS 3-1-0
Unit Topic Proposed
Lecture
I Introduction: Introduction to Software Engineering, Software 08
Components, Software Characteristics, Software Crisis, Software
Engineering Processes, Similarity and Differences from Conventional
Engineering Processes, Software Quality Attributes. Software
Development Life Cycle (SDLC) Models: Water Fall Model, Prototype
Model, Spiral Model, Evolutionary Development Models, Iterative
Enhancement Models.
II Software Requirement Specifications (SRS): Requirement 08
Engineering Process: Elicitation, Analysis, Documentation, Review and
Management of User Needs, Feasibility Study, Information Modelling,
Data Flow Diagrams, Entity Relationship Diagrams, Decision Tables,
SRS Document, IEEE Standards for SRS. Software Quality Assurance
(SQA):VerificationandValidation,SQAPlans,SoftwareQuality
Frameworks,ISO9000Models,SEI-CMMModel.
III Software Design: Basic Concept of Software Design, Architectural 08
Design, Low Level Design: Modularization, Design Structure Charts,
Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, Design
Strategies: Function Oriented Design, Object Oriented Design, Top-
Down and Bottom-Up Design. Software Measurement and Metrics:
Various Size Oriented Measures: Halestead’s Software Science,
FunctionPoint(FP)BasedMeasures,CyclomaticComplexityMeasures:
Control Flow Graphs.
IV Software Testing: Testing Objectives, Unit Testing, IntegrationTesting, 08
Acceptance Testing, Regression Testing, Testing for Functionality and
Testing for Performance, Top Down and Bottom- Up Testing Strategies:
Test Drivers and Test Stubs, Structural Testing (White
BoxTesting),FunctionalTesting(BlackBoxTesting),TestData
Suit Preparation, Alpha and Beta Testing of Products. Static Testing
Strategies:FormalTechnicalReviews(PeerReviews),WalkThrough,
 CodeInspection,CompliancewithDesignandCodingStandards.
V Software Maintenance and Software Project Management: 08
SoftwareasanEvolutionaryEntity,NeedforMaintenance,Categories of
Maintenance: Preventive, Corrective and Perfective Maintenance,
Cost of Maintenance, Software Re-Engineering, Reverse Engineering.
Software Configuration Management Activities, Change Control
Process,SoftwareVersionControl,AnOverviewofCASE
Tools.EstimationofVariousParameterssuchasCost,Efforts,
Schedule/Duration, Constructive Cost Models (COCOMO), Resource
Allocation Models, Software Risk Analysis and Management.

Suggested Readings:
1. RSPressman,“SoftwareEngineering:APractitionersApproach”,McGrawHill.
2. PankajJalote,“SoftwareEngineering”,Wiley
3. RajibMall,“FundamentalsofSoftwareEngineering”,PHIPublication.
4. KKAggarwalandYogeshSingh,“SoftwareEngineering”,NewAgeInternational
Publishers.
5. Ghezzi,M.Jarayeri,D.Manodrioli,“FundamentalsofSoftwareEngineering”,PHI
Publication.
6. IanSommerville,“SoftwareEngineering”,AddisonWesley.
7. KassemSaleh,“SoftwareEngineering”,CengageLearning
8. Pfleeger,“SoftwareEngineering”,MacmillanPublication
 MC-7625: Computer Networks
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Atthe endof course, thestudentwill beable to understand
CO 1 DescribecommunicationmodelsTCP/IP,ISO-OSImodel,network K2
topologiesalong withcommunicatingdevicesandconnectingmedia.
CO 2 Applyknowledgeoferrordetection,correctionandlearnconceptsof flow K3
control along with error control.
CO 3 ClassifyvariousIPaddressingtechniques,subnettingalongwith K4
network routing protocols and algorithms.
CO 4 Understand various transport layer protocols and their design K2
considerations along with congestion control to maintain Quality of
Service.
CO5 Understandapplications-layerprotocolsandelementarystandardsof K2
cryptographyandnetwork security.
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Data Communications: Introduction: Data communication
Components and characteristics, Data representation and Data flow.
Networks:LAN,WAN,MAN, Topologies.
Protocols and Standards: ISO-OSI model and TCP-IP Model.
I 08
NetworkConnectingDevices:HUB,Bridge,Switch,Routerand
Gateways.
TransmissionMedia:GuidedandunguidedMedia
ClassificationandArrangement:WiredLANsandWireless LANs
DataLinkLayer:
Error Detection and Error Correction:Types of errors, LRC, VRC,
Checksum, CRC, and Hamming Code.
Flow Control and Error Control: Stop and Wait Protocol, Sliding
II Window, Go-back-N-ARQ Protocol and Selective-Repeat ARQ 08
Protocol.
Channel Allocation Protocols: Random Access, Controlled and
Channelization techniques such as ALOHA, CSMA, CSMA/CD,
CDMA/CA, TDMA, FDMA, Token Passing, etc.
Network Layer:
SwitchingTechniques: CircuitSwitching,PacketSwitching,and
Message Switching.
Logicaladdressing: IPv4andIPv6Addressschemes,Classesand
III subnetting 08
NetworkLayerProtocols:ARP,RARP,BOOTPandDHCP
RoutingTechniques:InterdomainandIntradomainroutingwithexamples.

Transport Layer:
IV 08
Introduction to Transport Layer: Process-to-Process Delivery:
 Reliable and unreliable Connection, Port and Socket Addressing
TransportLayerProtocolswithpacketformats:UserDatagramProtocol
(UDP), Transmission Control Protocol (TCP), Stream Control
Transmission Protocol (SCTP).
Congestion Control: Techniques for handling the Congestion Control.
QualityofService(QoS):FlowCharacteristicsandtechniquestoimprove
QoS.
Application Layer:
Basic Concept of Application Layer: Domain Name System, World
Wide Web, Hyper Text Transfer Protocol, Electronic mail, File Transfer
V Protocol, Remote login. 08
Introduction to Cryptography: Definition, Goal, Applications,
Attacks, Encryption, decryption, public-key and private key
cryptography.
Suggested Readings:
1. BehrouzForouzan,“DataCommunicationandNetworking”,McGraw Hill
2. AndrewTanenbaum“ComputerNetworks”,PrenticeHall.
3. WilliamStallings,“DataandComputerCommunication”, Pearson.
4. KuroseandRoss,“ComputerNetworking-ATop-DownApproach”, Pearson.
5. Petersonand Davie,“Computer Networks:A SystemsApproach”, Morgan Kaufmann
6. W.A.Shay,“UnderstandingCommunicationsandNetworks”,CengageLearning.
7. D.Comer,“ComputerNetworksandInternets”,Pearson.
8. BehrouzForouzan,“TCP/IPProtocolSuite”,McGraw Hill.
ELECTIVE-1
 MC-7624:Cryptography&NetworkSecurity
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 Understandvarioussecurityattacksandtheirprotectionmechanism. K2
CO2 Applyandanalyzevariousencryptionalgorithms. K3, K4
CO3 Understand functions and algorithms to authenticate messages and study K1,K2,K3
andapply different digital signature techniques.
CO4 Analyzedifferenttypesofkeydistributions. K4
CO5 StudyandappraisedifferentIPandsystemsecuritymechanism. K1,K5
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I Introduction to security attacks, Services and mechanism, Classical encryption
techniques substitution ciphers and transposition ciphers, Cryptanalysis,
Steganography, Stream and block ciphers.
Modern Block Ciphers: Block ciphers principles, Shannon’s theory of 08
confusionanddiffusion,Feistelstructure,Dataencryptionstandard(DES),
Strength of DES, Idea of differential cryptanalysis, Block cipher modes of
operations, Triple DES
II Introduction to group, field, finite field of the form GF(p), Modular arithmetic,
Prime and relative prime numbers, Extended Euclidean Algorithm, Advanced
Encryption Standard (AES). 08
Fermat’s and Euler’s theorem, Primality testing, Chinese Remainder theorem,
Discrete Logarithmic Problem, Principals of public key crypto systems, RSA
algorithm, Security of RSA
III Message Authentication Codes: Authentication requirements, Authentication
functions, Message authentication code, Hash functions, Birthday attacks,
Security of hash functions, Secure hash algorithm (SHA). 08
Digital Signatures: Digital Signatures, Elgamal Digital Signature Techniques,
Digital signature standards (DSS), Proof of digital signature algorithm.
IV Key Management and distribution: Symmetric key distribution, Diffie-
HellmanKeyExchange,Publickeydistribution,X.509Certificates,Publickey
Infrastructure. 08
Authentication Applications: Kerberos Electronic mail security: pretty good
privacy (PGP), S/MIME.
V IPSecurity:Architecture,Authenticationheader,Encapsulatingsecurity payloads,
Combining security associations, Key management.
Introduction to Secure Socket Layer, Secure electronic transaction (SET). 08
System Security: Introductory idea of Intrusion, Intrusion detection, Viruses
and related threats, firewalls.
SuggestedReadings:
1. StallingsW.,“CryptographyandNetworkSecurity:PrincipalsandPractice”,Pearson Education.
2. FrouzanB.A.,“CryptographyandNetworkSecurity”,McGrawHill.
3. KahateA.,“CryptographyandNetworkSecurity”,TataMcGrawHill.
 MC-(E-I-2):DataWarehousing&DataMining
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Atthe end of course, thestudentwill beable to understand
CO1 Demonstrateknowledgeof DataWarehouse andits components. K1, K2
CO2 DiscusstheprocessofWarehousePlanningandImplementation. K1,K2
CO3 Discuss and implement various supervised and Non supervisedlearning K6
algorithms on data.
CO4 Explain the various process of Data Miningand decide best according to K2,K5
type of data.
CO5 Explainprocessofknowledgediscoveryindatabase(KDD).DesignData K2,K5
Mining model.
DETAILEDSYLLABUS 4-0-0
Unit Topic Proposed
Lecture
I Data Warehousing: Overview, Definition, Data Warehousing
Components, Building a Data Warehouse, Warehouse Database, Mapping 08
the Data Warehouse to a Multiprocessor Architecture, Difference between
DatabaseSystemandDataWarehouse,MultiDimensionalDataModel,
DataCubes,Stars,SnowFlakes,FactConstellations,Concept.
II Data Warehouse Process and Technology: Warehousing Strategy,
Warehouse /management and Support Processes, Warehouse Planning and
Implementation, Hardware and Operating Systems for Data Warehousing, 08
Client/ServerComputingModel&DataWarehousing.ParallelProcessors
& Cluster Systems, Distributed DBMS implementations, Warehousing
Software, Warehouse Schema Design
III Data Mining: Overview, Motivation, Definition & Functionalities, Data
Processing, Form of Data Pre-processing, Data Cleaning: Missing Values,
Noisy Data, (Binning, Clustering, Regression, Computer and Human 08
inspection), Inconsistent Data, Data Integration and Transformation. Data
Reduction:-Data Cube Aggregation, Dimensionality reduction, Data
Compression, Numerosity Reduction, Discretization and Concept
hierarchy generation, Decision Tree
IV Classification: Definition, Data Generalization, Analytical
Characterization, Analysis of attribute relevance, Mining Class
comparisons, Statistical measures in large Databases, Statistical-Based
Algorithms, Distance-Based Algorithms, Decision Tree-BasedAlgorithms.
Clustering: Introduction, Similarity and Distance Measures, Hierarchical 08
and Partitional Algorithms. Hierarchical Clustering- CURE and
Chameleon. Density Based Methods DBSCAN, OPTICS. Grid Based
Methods- STING, CLIQUE. Model Based Method – Statistical Approach,
Association rules: Introduction, Large Item sets, Basic Algorithms,Parallel
and Distributed Algorithms, Neural Network approach.

V DataVisualizationandOverallPerspective:Aggregation,Historical
information,QueryFacility,OLAPfunctionandTools.OLAPServers,
ROLAP,MOLAP,HOLAP,DataMininginterface,Security,Backupand
 Recovery, Tuning Data Warehouse, Testing Data Warehouse.
Warehousing applications and Recent Trends: Types of Warehousing
Applications, Web Mining, Spatial Mining and Temporal Mining. 08

SuggestedReadings:
1. AlexBerson,StephenJ.Smith“Data Warehousing,Data-Mining&OLAP”, TMH.
2. MarkHumphries,MichaelW.Hawkins,MichelleC.Dy,“DataWarehousing:Architecture
and Implementation”, Pearson.
3. I.Singh,“DataMiningandWarehousing”,KhannaPublishing House.
4. MargaretH.Dunham,S.Sridhar,”DataMining:IntroductoryandAdvancedTopics” Pearson
Education 5. Arun K. Pujari, “Data Mining Techniques” Universities Press.
5. PieterAdriaans,DolfZantinge,“Data-Mining”,PearsonEducation
 MC-(E-I-3):SoftwareProjectManagement
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 Identifyprojectplanningobjectives,alongwithvariouscost/effortestimationmodels. K3
CO2 Organize&scheduleprojectactivitiestocomputecriticalpathforriskanalysis K3
CO3 Monitorandcontrolprojectactivities. K4,K5
CO 4 FormulatetestingobjectivesandtestplantoensuregoodsoftwarequalityunderSEI-
K6
CMM
CO5 Configurechangesandmanagerisksusingprojectmanagementtools. K2,K4
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I Project Evaluation and Project Planning: Importance of Software Project
Management – Activities – Methodologies – Categorization of Software Projects – 08
Setting objectives – Management Principles – Management Control – Projectportfolio
Management – Cost-benefit evaluation technology – Risk evaluation – Strategic
program Management – Stepwise Project Planning.
II Project Life Cycle and Effort Estimation: Software process and Process Models –
Choice of Process models – RapidApplication development – Agile methods – 08
Dynamic System Development Method – Extreme Programming– Managing
interactiveprocesses–BasicsofSoftwareestimation–EffortandCost
estimationtechniques–COSMICFullfunctionpoints–COCOMOII–aParametric
ProductivityModel.
III ActivityPlanningandRiskManagement: ObjectivesofActivityplanning– Project
schedules – Activities – Sequencing and scheduling – Network Planning models –
Formulating Network Model – Forward Pass & Backward Pass techniques – Critical 08
path (CRM) method – Risk identification – Assessment – Risk Planning –Risk
Management––PERTtechnique–MonteCarlosimulation–ResourceAllocation
–CreationofCriticalpaths–Costschedules.
IV ProjectManagementandControl:FrameworkforManagementandcontrol–
Collectionofdata–Visualizingprogress–Costmonitoring–EarnedValueAnalysis 08
–PrioritizingMonitoring–Projecttracking–ChangecontrolSoftware
ConfigurationManagement–Managingcontracts–ContractManagement.
V Staffing in Software Projects: Managing people – Organizational behavior – Best
methodsofstaffselection–Motivation–The Oldham–Hackmanjob characteristic 08
model– Stress– Health and Safety – Ethical and Professional concerns – Working in
teams – Decision making – Organizational structures – DispersedandVirtualteams–
Communicationsgenres–Communicationplans–
Leadership.
SuggestedReadings:
1. BobHughes,Mike CotterellandRajib Mall:“SoftwareProjectManagement” –Fifth
Edition, McGraw Hill,New Delhi, 2012.
2. RobertK.Wysocki―“EffectiveSoftwareProjectManagement”–WileyPublication,2011.
3. WalkerRoyce:―“SoftwareProjectManagement”-Addison-Wesley,1998.
4. Gopalaswamy Ramesh, ― “Managing GlobalSoftware Projects”–McGraw HillEducation (India),
FourteenthReprint 2013.
5. KoontzHarold&WeihrichHeinz,"EssentialsofManagement",McGrawHill5 thEdition2008.
6. RobbinsandCoulter,"Management",PrenticeHallofIndia,9thedition.
7. JamesA.F.,Stoner,"Management",PearsonEducationDelhi.
8. P.D.Chaturvedi,"BusinessCommunication",PearsonEducation.
 MC-(E-I-4):CloudComputing
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 UnderstandtheconceptsofCloudComputing,keytechnologies, K1,K2
strengthsand limitationsof cloud computing.
CO2 Developtheabilitytounderstandandusethearchitecturetocompute and K1,K3
storage cloud, service and models.
CO3 Understandtheapplicationincloudcomputing. K4,K5
CO4 Learnthekeyandenablingtechnologiesthathelpinthedevelopmentof cloud. K3,K4

CO5 Explainthecoreissuesofcloudcomputingsuchasresource management and K2,K6

security.
DETAILEDSYLLABUS 3-1-0
Unit Topic Proposed
Lecture
I Introduction: Cloud Computing – Definition of Cloud – Evolution of 08
Cloud Computing – Underlying Principles of Parallel and Distributed,
History of Cloud Computing - Cloud Architecture - Types of Clouds -
BusinessmodelsaroundClouds–MajorPlayersinCloudComputing-
issuesinClouds-Eucalyptus-Nimbus-OpenNebula, CloudSim.
II Cloud Services: Types of Cloud services: Software as a Service- 08
Platform as a Service –Infrastructure as a Service - Database as aService
- Monitoring as a Service –Communication as services. Service
providers- Google, Amazon, Microsoft Azure, IBM, Sales force.
III Collaborating Using Cloud Services: Email Communication over the 08
Cloud - CRM Management – Project Management-EventManagement -
Task Management – Calendar - Schedules - Word Processing –
Presentation–Spreadsheet-Databases–Desktop-SocialNetworksand
Groupware.
IV Virtualization for Cloud: Need for Virtualization – Pros and cons of 08
Virtualization – Types of Virtualization –System VM, Process VM,
Virtual Machine monitor – Virtual machine properties - Interpretation
andbinarytranslation,HLLVM-supervisors–Xen,KVM, VMware,
VirtualBox,Hyper-V.
V Security, Standards and Applications: Security in Clouds: Cloud 08
security challenges – Software as a Service Security, Common
Standards: The Open Cloud Consortium – The Distributed management
Task Force – Standards for application Developers – Standards for
Messaging – Standards for Security, End user access to cloudcomputing,
Mobile Internet devices and the cloud.
Hadoop – MapReduce – Virtual Box — Google App Engine –
Programming Environment for Google App Engine
SuggestedReadings:
1. DavidE.Y.Sarna,“ImplementingandDevelopingCloudApplication”,CRCpress2011.
2. Lee Badger, Tim Grance, Robert Patt-Corner, Jeff Voas, NIST, Draft cloud computing
synopsis and recommendation, May 2011.
3. Anthony T Velte, Toby J Velte, Robert Elsenpeter, “Cloud Computing : A Practical
Approach”, Tata McGraw-Hill 2010.
4. Haley Beard, “Best Practices for Managing and Measuring Processes for On-demand
Computing, Applications and Data Centers in the Cloud with SLAs”, Emereo Pty Limited,
July 2008.
5. G. J. Popek, R.P. Goldberg, “Formal requirements for virtualizable third generation
Architectures, Communications of the ACM”, No.7 Vol.17, July 1974
 MC-(E-I-5):CompilerDesign
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto:

Acquireknowledgeofdifferentphasesandpassesofthecompilerandalsoabletousethe K3,K6
CO1 compiler tools like LEX, YACC, etc. Students will also be able to design different types of
compiler tools to meet the requirements of the realistic constraints of compilers.
Understandtheparseranditstypesi.e.Top-DownandBottom-upparsersandconstruction K2,K6
CO2
ofLL,SLR,CLR,andLALRparsingtable.
Implement the compiler using syntax-directed translation method and get knowledge about K4,K5
CO3
the synthesized and inherited attributes.
Acquireknowledgeaboutruntimedatastructurelikesymboltableorganizationand K2,K3
CO4
differenttechniquesusedinthat.
Understandthetargetmachine’sruntimeenvironment,itsinstructionsetforcode K2,K4
CO5
generationandtechniquesusedforcodeoptimization.
DETAILEDSYLLABUS 3-0-0
Unit Topic Propose
d
Lecture
Introduction to Compiler: Phases and passes, Bootstrapping, Finitestate machines and
regular expressions and their applications to lexical analysis, Optimization of DFA-Based
I Pattern Matchers implementation of lexical analyzers, lexical-analyzer generator, LEX 08
compiler, Formal grammars and their application to syntax analysis, BNF notation,
ambiguity,YACC.Thesyntacticspecificationofprogramminglanguages:Contextfree
grammars,derivationandparsetrees,capabilitiesofCFG.
Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top
down parsing, predictive parsers Automatic Construction of efficient Parsers: LR parsers,
II 08
the canonical Collection of LR(0) items, constructing SLR parsing tables, constructing
Canonical LR parsing tables, Constructing LALR parsing tables, using ambiguous
grammars, an automatic parser generator, implementation of LR parsing tables.
Syntax-directed Translation: Syntax-directed Translation schemes, Implementation of
Syntax-directed Translators, Intermediate code, postfix notation, Parse trees & syntax trees,
III three address code, quadruple & triples, translation of assignment statements, Boolean
08
expressions, statements that alter the flow of control, postfix translation, translation with a
topdownparser.Moreabouttranslation:Arrayreferencesinarithmeticexpressions,
procedurescall,declarationsandcasestatements.
Symbol Tables: Data structure for symbols tables, representing scope information. Run-
IV Time Administration: Implementation of simple stack allocation scheme, storage allocation
08
inblockstructuredlanguage.ErrorDetection&Recovery:LexicalPhaseerrors,syntactic
phaseerrorssemanticerrors.
Code Generation: Design Issues, the Target Language. Addresses in the Target Code,
Basic Blocks and Flow Graphs, Optimization of Basic Blocks, Code Generator. Code
optimization: Machine-Independent Optimizations, Loop optimization, DAG representation
V 08
of basic blocks, value numbers and algebraic laws, Global Data-Flow analysis.
Textbooks:
1. K.Muneeswaran,CompilerDesign,FirstEdition,OxfordUniversityPress.
2. J.P.Bennet,“IntroductiontoCompilerTechniques”,SecondEdition,TataMcGraw-Hill,2003.
3. HenkAlblasandAlbertNymeyer,“PracticeandPrinciplesofCompilerBuildingwithC”,PHI,2001.
4. Aho,Sethi&Ullman,"Compilers:Principles,TechniquesandTools”,PearsonEducation
5. VRaghvan,“PrinciplesofCompilerDesign”,TMH
6. KennethLouden,”CompilerConstruction”,CengageLearning.
7. CharlesFischerandRicardLeBlanc,”CraftingaCompilerwithC”,PearsonEducation
ELECTIVE-2
 MC-(E-2-I):WebTechnology
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto:
ApplytheknowledgeofHTMLandCSStodevelopwebapplicationand K3,K6
CO1 analyzetheinsightsofinternetprogrammingtoimplementcomplete application over
the web.
Understand,analyzeandapplytheroleofJavaScriptintheworkingsofthe web and K2,K3
CO2
web applications.
CO3 Understand,analyzeandbuilddynamicwebapplicationsusingservletandJSP. K2,K3
DevelopSpring-basedJavaapplicationsusingJavaconfiguration,XML K 2,K4,K6
CO4 configuration,annotation-basedconfiguration,beansandtheirscopes,and
properties.
CO5 DevelopwebapplicationusingSpringBootandRESTFulWebServices K3,K6
DETAILEDSYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Web Page Designing: Introduction and Web Development Strategies, History of
Web and Internet, Protocols Governing Web, HTML-Introduction, HTML Tags,
HTML-Grouping Using Div & Span, HTML-Lists, HTML-Images, HTML-
Hyperlink, HTML-Table, HTML-Iframe, HTML-Form, Introduction of CSS, CSS
I 08
Syntax, External Style Sheet using < link >, Multiple Style Sheets, Value Lengths
and Percentages, CSS-Selectors, CSS-Box Model, Floats, Clear, Introduction to
Bootstrap.

Scripting: Introduction to JavaScript, Creating Variables in JavaScript, Creating

Functions in JavaScript, UI Events, Returning Data from Functions, Working with
Conditions, looping in JavaScript, Block Scope Variables, Working with Objects,
II 08
Creating Object using Object Literals, Manipulating DOM Elements with
JavaScript

Web Application development using JSP & Servlets: Servlet Overview and
Architecture, Interface Servlet and the Servlet Life Cycle, Handling HTTP get
Requests, Handling HTTP post Requests, Redirecting Requests to OtherResources,
III Session Tracking, Cookies, Session Tracking with Http Session. Java Server Pages 08
(JSP): Introduction, Java Server Pages Overview, A First Java Server
PageExample,ImplicitObjects,Scripting,StandardActions,Directives,Custom
TagLibraries.
Spring:Spring Core Basics-Spring Dependency Injection concepts, Introductionto
Design patterns, Factory Design Pattern, Strategy Design pattern, Spring Inversion
IV of Control, AOP, Bean Scopes- Singleton, Prototype, Request, Session, 08
Application, WebSocket, Auto wiring, Annotations, Life Cycle Call backs, Bean
Configuration styles
Spring Boot: Spring Boot- Spring Boot Configuration, Spring Boot Annotations,
Spring Boot Actuator, Spring Boot Build Systems, Spring Boot Code Structure,
V SpringBootRunners,Logger,BUILDINGRESTFULWEBSERVICES,Rest 08
Controller, Request Mapping, Request Body, Path Variable, Request Parameter,
GET, POST, PUT, DELETE APIs, Build Web Applications
Textbooks:
1. Burdman,Jessica,“CollaborativeWebDevelopment”AddisonWesley
2. Xavier,C,“WebTechnologyandDesign”,NewAgeInternational
3. IvanBayross,”HTML,DHTML,JavaScript,Perl&CGI”,BPBPublication
4. Bhave,“ProgrammingwithJava”,PearsonEducation
6. HansBergsten,“JavaServerPages”,SPDO’Reilly
7. Naughton,Schildt,“TheCompleteReferenceJAVA2”,TMH
8. CraigWalls,“SpringBootinAction”
 MC-(E-2-2):BigData
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 DemonstrateknowledgeofBigDataAnalyticsconceptsanditsapplicationsin business. K1,K2

CO2 DemonstratefunctionsandcomponentsofMapReduceFrameworkandHDFS. K1,K2

CO3 DevelopqueriesinNoSQLenvironment. K6
CO4 ExplainprocessofdevelopingMapReducebaseddistributedprocessing applications. K2,K5

CO5 ExplainprocessofdevelopingapplicationsusingHBASE,Hive,Pigetc. K2,K5

DETAILEDSYLLABUS 4-0-0
Unit Topic Proposed
Lecture
I Introduction to Big Data: Types of digital data, history of Big Data innovation, 08
introduction to Big Data platform, drivers for Big Data, Big Data architecture and
characteristics, 5 Vs of Big Data, Big Data technology components, Big Data
importance and applications, Big Data features – security, compliance, auditing and
protection, Big Data privacy and ethics, Big Data Analytics, Challenges of
conventionalsystems,intelligentdataanalysis,natureofdata,analyticprocesses
andtools,analysisvsreporting,moderndataanalytictools.
II Hadoop: History of Hadoop, Apache Hadoop, the Hadoop Distributed File System, 08
components of Hadoop, data format, analyzing data with Hadoop, scaling out,
Hadoop streaming, Hadoop pipes, Hadoop Echo System.
Map-Reduce: Map-Reduce framework and basics, how Map Reduce works,
developing a Map Reduce application, unit tests with MR unit, test data and local
tests, anatomy of a Map Reduce job run, failures, job scheduling, shuffle and sort,
taskexecution,MapReducetypes,inputformats,outputformats,MapReduce
features,Real-worldMapReduce
III HDFS (Hadoop Distributed File System): Design of HDFS, HDFS concepts, 08
benefits and challenges, file sizes, block sizes and block abstraction in HDFS, data
replication, how does HDFS store, read, and write files, Java interfaces to HDFS,
command line interface, Hadoop file system interfaces, data flow, data ingest with
Flume and Scoop, Hadoop archives, Hadoop I/O: Compression, serialization, Avro
and file-based data structures. Hadoop Environment: Setting up a Hadoop cluster,
cluster specification, cluster setup and installation, Hadoop configuration,
securityinHadoop,administeringHadoop,HDFSmonitoring&maintenance,Hadoop
benchmarks,Hadoopinthecloud
IV Hadoop Eco System and YARN: Hadoop ecosystem components, schedulers, fair 08
and capacity, Hadoop 2.0 New Features – Name Node high availability, HDFS
federation, MRv2, YARN, Running MRv1 in YARN.
NoSQL Databases: Introduction to NoSQL MongoDB: Introduction, data types,
creating, updating and deleing documents, querying, introduction to indexing,
capped collections
Spark: Installing spark, spark applications, jobs, stages and tasks, Resilient
Distributed Databases, anatomy of a Spark job run, Spark on YARN
SCALA: Introduction, classes and objects, basic types and operators, built-in
control structures, functions and closures, inheritance.
V Hadoop Eco System Frameworks: Applications on Big Data using Pig, Hive and 08
HBase
Pig:IntroductiontoPIG,ExecutionModesofPig,ComparisonofPigwithDatabases,
Grunt, Pig Latin, User Defined Functions, Data Processing operators, Hive-
ApacheHivearchitectureandinstallation,Hiveshell,Hiveservices,Hive
 metastore,comparisonwithtraditionaldatabases,HiveQL,tables,queryingdataand user
defined functions, sorting and aggregating, Map Reduce scripts, joins &subqueries.
HBase – Hbase concepts, clients, example, Hbase vs RDBMS, advanced usage,
schemadesign, advance indexing, Zookeeper – how it helps in monitoringa cluster,
how to build applications with Zookeeper. IBM Big Data strategy, introduction to
Infosphere, BigInsights and Big Sheets, introduction to Big SQL.

SuggestedReadings:
1. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics:
EmergingBusiness Intelligence and Analytic Trends for Today's Businesses", Wiley.
2. Big-DataBlackBook,DTEditorialServices,Wiley.
3. DirkdeRoos,ChrisEaton, GeorgeLapis,PaulZikopoulos,Tom Deutsch,“Understanding Big Data
Analytics for Enterprise Class Hadoop and Streaming Data”, McGrawHill.
4. ThomasErl,WajidKhattak,PaulBuhler,“BigDataFundamentals:Concepts,DriversandTechniques”,
Prentice Hall.
5. BartBaesens“AnalyticsinaBigDataWorld:TheEssentialGuidetoDataScienceandits Applications
(WILEY Big Data Series)”, John Wiley & Sons
6. ArshdeepBahga,VijayMadisetti,“BigDataScience&Analytics:AHandsOnApproach“, VPT
7. AnandRajaramanandJeffreyDavidUllman,“MiningofMassiveDatasets”,CUP
8. TomWhite,"Hadoop:TheDefinitiveGuide",O'Reilly.
9. EricSammer,"HadoopOperations",O'Reilly.
10. ChuckLam,“HadoopinAction”,MANNINGPublishers
11. DeepakVohra,“PracticalHadoopEcosystem:ADefinitiveGuidetoHadoop-Related Frameworks and
Tools”, Apress
12. E.Capriolo,D.Wampler,andJ.Rutherglen,"ProgrammingHive",O'Reilly
13. LarsGeorge,"HBase:TheDefinitiveGuide",O'Reilly.
14. AlanGates,"ProgrammingPig",O'Reilly.
15. MichaelBerthold,DavidJ.Hand,“IntelligentDataAnalysis”,Springer.
16. BillFranks,“TamingtheBigDataTidalWave:FindingOpportunitiesinHugeDataStreamswith
Advanced Analytics”, John Wiley & sons.
17. GlennJ.Myatt,“MakingSenseofData”,JohnWiley&Sons
18. PeteWarden,“BigDataGlossary”,O’Reilly
 MC-(E-2-3):SimulationandModelling
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Atthe end ofcourse , thestudentwill beable to understand
CO 1 Studythe conceptofsystem,itscomponentsandtypes. K1
CO 2 Understandandanalyzenatureandtechniquesofmajorsimulationmodels. K2,K4

CO 3 Studyand analyze the idea of continuous and discrete system K1,K4

simulation.
CO 4 Understandthenotionofsystemdynamicsandsystemdynamics K2
diagrams.
CO 5 FindingcriticalpathcomputationandunderstandingPERT networks K1,K4
DETAILEDSYLLABUS 3-1-0
Unit Topic Proposed
Lecture
I System definition and components, stochastic activities, continuous and
discretesystems,Systemmodeling,Typesofmodels,staticanddynamic 08
physical models, staticand dynamic mathematicalmodels, fullcorporate
model,typesofsystemstudy.
II System simulation, Need of simulation, Basic nature of simulation,
techniques of simulation, comparison of simulation and analytical 08
methods, types of system Simulation, real time simulation, hybrid
simulation, simulation of pursuit problem, single-server queuing system
and an inventory problem, Monte-Carlo simulation, Distributed Lag
model, Cobweb model.
III Simulation of continuous Systems, analog vs digital simulation,
simulation of water reservoir system, simulation of a servo system,
simulation of an auto-pilot. Discrete system simulation, fixed time step 08
vs. event-to-event model, generation of random numbers, test of
randomness, Monte-Carlo computation vs. stochastic simulation.
IV Systemdynamics,exponentialgrowthmodels,exponentialdecaymodels,
logistic curves, system dynamics diagrams, world model. 08
V Simulationof PERTnetworks,criticalpathcomputation,uncertaintiesin
activityduration,resourceallocationandconsideration,Simulationlanguages, 08
object oriented simulation
Suggested Readings:
1. GeoffreyGordon,“SystemSimulation”,PHI
2. NarsinghDeo,“SystemSimulationwithdigitalcomputer”,PHI.
3. AverillM.LawandW.DavidKelton,“SimulationModellingandAnalysis”,
TMH.
 MC-(E-2-4):SoftwareTesting&QualityAssurance
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 Test the software by applying testing techniques to deliver a product free from K3
bugs.
CO2 Investigatethescenarioandselectthepropertestingtechnique. K1,K4
CO3 Explorethe test automationconceptsand tools and estimation of cost,schedule K2,K4
based on standard metrics.
CO4 Understandhowtodetect,classify,preventandremovedefects. K1,K2
CO5 Chooseappropriatequalityassurancemodelsanddevelopquality.Abilityto conduct K3,K4
formal inspections, record and evaluate results of inspections.
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I Software Testing Basics: Testing as an engineering activity, Role of processin 08
software quality, Testing as a process, Basic definitions, Software testing
principles,The tester’sroleina software developmentorganization,Originsof
defects, Defectclasses, Thedefect repository and testdesign, Defectexamples,
Developer / Tester support for developing a defect repository.
II Testing Techniques and Levels of Testing:Using White Box Approach to 08
Test design– Static Testing Vs. Structural Testing, Code Functional Testing,
Coverage and Control Flow Graphs, Using Black Box Approaches to TestCase
Design, Random Testing, Requirements based testing, Decision tables, State-
based testing, Cause-effect graphing, Error guessing, Compatibility testing,
Levels of Testing -Unit Testing, Integration Testing, Defect Bash
Elimination.SystemTesting-UsabilityandAccessibilityTesting,
ConfigurationTesting,CompatibilityTesting.
III SoftwareTestAutomationAndQualityMetrics:SoftwareTestAutomation, 08
Skills needed for Automation, Scope of Automation, Design and Architecture
for Automation, Requirements for a Test Tool, Challenges in Automation
Tracking the Bug, Debugging. Testing Software System Security - Six-Sigma,
TQM-ComplexityMetricsandModels,QualityManagementMetrics,
Availability Metrics, Defect Removal Effectiveness, FMEA, Quality Function
Deployment, Taguchi Quality Loss Function, Cost of Quality.
IV Fundamentals of Software Quality Assurance: SQA basics, Components of 08
the Software Quality Assurance System, software quality in business context,
planning for software quality assurance, product quality and process quality,
software process models, 7 QC Tools and Modern Tools.
V SoftwareAssuranceModels:ModelsforQualityAssurance,ISO-9000series, 08
CMM, CMMI, Test Maturity Models, SPICE, Malcolm Baldrige Model- P-
CMM.
Software Quality Assurance Trends: Software Process- PSP and TSP, OO
Methodology, Clean room software engineering, Defect Injection and
prevention,InternalAuditingandAssessments,Inspections&Walkthroughs,
CaseToolsandtheiraffectonSoftwareQuality.
SuggestedReadings:
1. SrinivasanDesikan,GopalaswamyRamesh,“SoftwareTesting:PrinciplesandPractices”,
Pearson.
2. DanielGalin,“SoftwareQualityAssurance:FromTheorytoImplementation”,Pearson
 AddisonWesley.
3. AdityaP.Mathur,“FoundationsofSoftwareTesting”,Pearson.
4. PaulAmmann,JeffOffutt,“IntroductiontoSoftwareTesting”,CambridgeUn
iversityPress.
5. PaulC.Jorgensen,“SoftwareTesting:ACraftsman'sApproach”,AuerbachP
ublications.
6. WilliamPerry,“EffectiveMethodsofSoftwareTesting”,WileyPublishing,Th
irdEdition.
7. Renu Rajani, Pradeep Oak, “Software Testing – Effective Methods,
Tools and Techniques”, Tata McGraw Hill.
8. StephenKan,“MetricsandModelsinSoftwareQuality”,Addison–
Wesley,SecondEdition.
9. S. A. Kelkar, “Software quality and Testing”, PHI
Learning Pvt, Ltd.
10.WattsSHumphrey,“ManagingtheSoftwareProcess”,Pearson
EducationInc.
 MC-(E-2-5):DigitalImageProcessing
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 Explainthebasicconceptsoftwo-dimensionalsignalacquisition,sampling, K1,K2
quantization and color model.
CO2 Applyimageprocessingtechniquesforimageenhancementinboththespatial K2,K3
andfrequencydomains.
CO3 Apply and compare image restoration techniques in both spatial and frequency K2,K3
domain.
CO4 CompareedgebasedandregionbasedsegmentationalgorithmsforROI K3,K4
extraction.
CO5 Explaincompressiontechniquesanddescriptorsforimageprocessing. K2,K3
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I DigitalImageFundamentals:StepsinDigitalImageProcessing– Components– 08
ElementsofVisualPerception–ImageSensingandAcquisition
–ImageSamplingandQuantization–Relationshipsbetweenpixels–Color
imagefundamentals–RGB,HSImodels,Two-dimensionalmathematical
preliminaries,2Dtransforms–DFT,DCT.
II Image Enhancement: Spatial Domain: Gray level transformations – 08
Histogram processing – Basics of Spatial Filtering–Smoothing and Sharpening
Spatial Filtering, Frequency Domain: Introduction to Fourier Transform–
Smoothing and Sharpening frequency domain filters – Ideal, Butterworth and
Gaussian filters, Homomorphic filtering, Color image enhancement.
III ImageRestoration:ImageRestoration–degradationmodel,Properties,Noise 08
models –MeanFilters– OrderStatistics–Adaptivefilters–BandrejectFilters
–BandpassFilters–NotchFilters–OptimumNotchFiltering–Inverse Filtering –
Wiener filtering
IV Image Segmentation: Edge detection, Edge linking via Hough transform – 08
Thresholding – Region based segmentation – Region growing – Region
splitting and merging – Morphological processing- erosion and dilation,
Segmentationbymorphologicalwatersheds–basicconcepts–Dam
construction–Watershedsegmentationalgorithm.
V Image Compression and Recognition: Need for data compression, Huffman, 08
Run Length Encoding, Shift codes, Arithmetic coding, JPEG standard, MPEG.
Boundary representation, Boundary description, Fourier Descriptor, Regional
Descriptors–Topologicalfeature,Texture–PatternsandPatternclasses–
Recognitionbasedonmatching.
SuggestedReadings:
1. Rafael C. Gonzalez, Richard E. Woods, “Digital Image Processing”, Pearson, Third Edition,
2010.
2. AnilK.Jain,“FundamentalsofDigitalImageProcessing”,Pearson,2002.
3. KennethR.Castleman,“DigitalImageProcessing”Pearson,2006.
4. D, E. Dudgeon and R M. Mersereau, “Multidimensional Digital Signal Processing”, Prentice
Hall Professional Technical Reference, 1990.
5. WilliamK.Pratt,“DigitalImageProcessing”JohnWiley,NewYork,2002.
6. MilanSonkaetal,“Imageprocessing,analysisandmachinevisionBrookes/Cole”,Vikas Publishing
House, 2nd edition,1999.
SECONDYEARSYLLABUS
SEMESTER-IV
ELECTIVE-3
 KCA031:PrivacyandSecurityinOnlineSocialMedia
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto:
CO1 Understandworkingofonlinesocialnetworks K2
CO2 Describeprivacypoliciesofonlinesocialmedia K2
AnalysecountermeasurestocontrolinformationsharinginOnlinesocial networks. K3
CO3
CO4 ApplyknowledgeofidentitymanagementinOnlinesocialnetworks K3
CO5 Comparevariousprivacyissuesassociatedwithpopularsocialmedia. K3
DETAILEDSYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction to Online Social Networks: Introduction to Social Networks, From
offline to Online Communities, Online Social Networks, Evolution of OnlineSocial
Networks, Analysis and Properties, Security Issues in Online Social Networks,
I Trust Management in Online Social Networks, Controlled Information Sharing in 08
Online Social Networks, Identity Management in Online Social
Networks,datacollectionfromsocialnetworks,challenges,opportunities,and
pitfallsinonlinesocialnetworks,APIs;CollectingdatafromOnlineSocialMedia.
Trust Management in Online Social Networks: Trust and Policies, Trust and
Reputation Systems, Trust in Online Social, Trust Properties, Trust Components,
Social Trust and Social Capital, Trust Evaluation Models, Trust, credibility, and
II 08
reputations in social systems; Online social media and Policing, Information
privacydisclosure,revelation,anditseffectsinOSMandonlinesocialnetworks;
PhishinginOSM&Identifyingfraudulententitiesinonlinesocialnetworks
Controlled Information Sharing in Online Social Networks: Access Control
Models, Access Control in Online Social Networks, Relationship-Based Access
III 08
Control,PrivacySettingsinCommercialOnlineSocialNetworks,ExistingAccess
ControlApproaches
Identity Management in Online Social Networks: Identity Management, Digital
Identity, Identity Management Models: From Identity 1.0 to Identity 2.0, Identity
IV 08
ManagementinOnlineSocialNetworks,IdentityasSelf-Presentation,Identity
thefts,OpenSecurityIssuesinOnlineSocialNetworks
Case Study: Privacy and security issues associated with various social media such
V 08
as Facebook, Instagram, Twitter, LinkedIn etc.
Textbooks:

1. SecurityandPrivacy-PreservinginSocialNetworks,Editors:Chbeir,Richard,AlBouna,
Bechara (Eds.), Spinger, 2013.
2. SecurityandTrustinOnlineSocialNetworks,BarbaraCarminati,ElenaFerrari,MarcoViviani,
Morgan & Claypool publications.
3. SecurityandPrivacyinSocialNetworks,Editors:Altshuler,Y.,Elovici,Y.,Cremers,A.B.,
Aharony, N., Pentland, A. (Eds.), Springer, 2013
4. Securityandprivacypreservinginsocialnetworks,ElieRaad&RichardChbeir,Richard
Chbeir& Bechara Al Bouna, 2013
5. SocialMediaSecurity:LeveragingSocialNetworkingWhileMitigatingRisk,MichaelCross, 2013
 MC- :SoftComputing
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)

Attheendofcourse,thestudentwillbeabletounderstand

CO1 Recognize the need of soft computing and study basic concepts and techniques K1,K2
of soft computing.
CO2 Understandthebasicconceptsofartificialneuralnetworktoanalyzewidely used K2,K4
neural networks.
CO3 Applyfuzzylogictohandleuncertaintyinvariousreal-worldproblems. K3
CO4 Studyvariousparadigmsofevolutionarycomputingandevaluategeneticalgorithm in K1,K5
solving optimization problems.
CO5 Applyhybridtechniquesinapplicationsofsoftcomputing. K3

DETAILEDSYLLABUS 3-0-0

Unit Topic Proposed

Lecture
I Introduction to Soft Computing: Introduction, Comparison with hard 08
computing,Conceptoflearningandadaptation,Constituentsofsoftcomputing,
Applications of soft computing.
Artificial Neural Networks: Basic concepts of neural networks, Human brain,
Biological neural network, History of artificial neural networks, Basic building
blocksofanartificialneuron,Neuralnetworkarchitectures,Activation
functions,Characteristicsandlimitationofneuralnetworks.
II Artificial Neural Networks: Learning methods - Supervised, Unsupervised, 08
Reinforcement, Hebbian, Gradient descent, Competitive, Stochastic.
Major classes of neural networks: Perceptron networks, Multilayer
perceptron model, Back-propagation network, Radial basis function network,
Recurrentneuralnetwork,Hopfield networks,Kohonenself-organizing feature
maps.
III Fuzzy Logic: Introduction to Fuzzy Logic, Comparison with crisp logic, 08
Properties of classical sets, Operations on classical sets, Properties of fuzzy
sets,Operationsonfuzzysets,Classicalrelations,Fuzzyrelations,Featuresand types
of fuzzy membership functions, Fuzzy arithmetic,Fuzzy measures.
Fuzzy Systems: Crisp logic, Predicate logic, Fuzzy logic, Fuzzy propositions,
Inferencerules,Fuzzyinferencesystems-Fuzzification,Inference,
Defuzzification,Typesofinferenceengines.
V Evolutionary Computing: Introduction, Evolutionary algorithm, Biological 08
evolutionary process, Paradigms of evolutionary computing – Genetic
algorithm and Genetic programming, Evolutionary strategies, Evolutionary
programming.
GeneticAlgorithm:Introduction,Traditionaloptimizationandsearch
techniques, Comparison with traditional algorithms, Operations- Encoding,
Selection, Crossover and Mutation, Classification of Genetic algorithm.
V Hybrid Soft Computing Techniques: Introduction, Classification of hybrid 08
systems, Neuro-fuzzy hybrid systems, Neuro-genetic hybrid systems, Fuzzy-
genetic hybrid systems.
OtherSoftComputingTechniques:TabuSearch,Antcolonybased
 optimization,SwarmIntelligence.

SuggestedReadings:
1. SivanandamS.N.andDeepaS.N.,“PrinciplesofSoftComputing”,Wiley-India.
2. RajasekaranS.andVijayalakshmiPaiG.A.,“NeuralNetworks,FuzzyLogicandGenetic Algorithms-
Synthesis and Applications”, PHI Learning.
3. Chakraverty S., Sahoo D.M. and Mahato N. R., “Concepts of Soft Computing- Fuzzy and
ANNwith Programming”, Springer.
4. KaushikS.andTiwariS.,“SoftComputing–Fundamentals,TechniquesandApplications’, McGrawHill
Education.
5. JangJ.-S.R.,SunC.-T.andMizutaniE.,“Neuro-FuzzyandSoftComputing”,Prentice-Hallof India.
6. Karray F. O. and Silva C. D., “Soft Computing and Intelligent Systems Design – Theory,
Toolsand Applications”, Pearson Education.
7. Freeman J. A. and SkapuraD. M., “Neural Networks: Algorithms, Applications and Programming
Techniques”, Pearson.
8. SimanH.,“NeuralNetowrks”,PrenticeHallofIndia.
 MC- :PatternRecognition
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 Study of basics of Pattern recognition.Understandthe designing principles and K1,K2
Mathematical foundation used in pattern recognition.
CO2 AnalysistheStatisticalPattenRecognition. K3,K4
CO3 UnderstandingthedifferentParameterestimationmethods. K1,K2
CO4 UnderstandingthedifferentNonparametricTechniques. K1, K2,
CO5 Understand and Make use of unsupervised learning and Clustering in K2K3,K4
Patternrecognition.
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I Introduction: Basics of pattern recognition, Design principles of pattern 08
recognition system, Learning and adaptation, Pattern recognition approaches,
Mathematical foundations – Linear algebra, Probability Theory, Expectation,
meanandcovariance,Normaldistribution,multivariatenormaldensities,Chi
squaredtest.
II StatisticalPattenRecognition:BayesianDecisionTheory,Classifiers, Normal 08
density and discriminant functions
III Parameter estimation methods: Maximum-Likelihood estimation, Bayesian 08
Parameter estimation, Dimension reduction methods - Principal Component
Analysis (PCA), Fisher Linear discriminant analysis, Expectation-
maximization(EM),HiddenMarkovModels(HMM),Gaussianmixture
models.
IV NonparametricTechniques:DensityEstimation,ParzenWindows,K- Nearest 08
Neighbor Estimation, Nearest Neighbor Rule, Fuzzy classification.
V UnsupervisedLearning&Clustering:Criterionfunctionsforclustering, 08
ClusteringTechniques:Iterativesquare-errorpartitionalclustering–Kmeans,
agglomerativehierarchicalclustering,Clustervalidation.
SuggestedReadings:
1. DudaR.O.,HartP.E.andStorkD.G.,“PatternClassification”,JohnWiley.
2. BishopC.M.,“NeuralNetworkforPatternRecognition”,OxfordUniversityPress.
3. SinghalR.,“PatternRecognition:Technologies&Applications”,OxfordUniversityPress.
4. TheodoridisS.andKoutroumbasK.,“PatternRecognition”,AcademicPress.
 MC- 7631(B):Data Analytics
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 DescribethelifecyclephasesofDataAnalyticsthroughdiscovery,planningand K1,K2
building.
CO2 UnderstandandapplyDataAnalysisTechniques. K2, K3
CO3 ImplementvariousDatastreams. K3
CO4 Understanditemsets,Clustering,frameworks&Visualizations. K2
CO5 ApplyRtoolfordevelopingandevaluatingrealtimeapplications. K3,K5,K6
DETAILEDSYLLABUS 4-0-0
Unit Topic Proposed
Lecture
I Introduction to Data Analytics: Sources and nature of data, classification of 08
data (structured, semi-structured, unstructured), characteristics of data,
introduction to Big Data platform, need of data analytics, evolution of analytic
scalability,analyticprocessandtools,analysisvsreporting,moderndataanalytic tools,
applications of data analytics.
DataAnalyticsLifecycle:Need,keyrolesforsuccessfulanalyticprojects,
various phases of data analytics lifecycle – discovery, data preparation, model
planning, model building, communicating results, operationalization
II Data Analysis: Regression modeling, multivariate analysis, Bayesian modeling, 08
inference and Bayesian networks, support vector and kernel methods, analysis of
time series: linear systems analysis & nonlinear dynamics, rule induction, Neural
Networks: Learning and generalisation, competitive learning, principal
componentanalysisandneuralnetworks,fuzzylogic:extractingfuzzymodels
fromdata,fuzzydecisiontrees,stochasticsearchmethods.
III Mining Data Streams: Introduction to streams concepts, stream data model and 08
architecture, stream computing, sampling data in a stream, filtering streams,
counting distinct elements in a stream, estimating moments, counting oneness in
a window, decaying window, Real-time Analytics Platform (
RTAP)applications,Casestudies–Realtimesentimentanalysis,stockmarket
predictions.
IV Frequent Itemsets and Clustering: Mining frequent itemsets, market based 08
modelling, Apriori algorithm, handling large data sets in main memory, limited
pass algorithm, counting frequent itemsets in a stream, Clustering techniques:
hierarchical, K-means, clustering high dimensional data, CLIQUE
andProCLUS,frequentpatternbasedclusteringmethods,clusteringinnon-euclidean
space,clusteringforstreamsandparallelism.
V Frame Works and Visualization: MapReduce, Hadoop, Pig, Hive, HBase, 08
MapR, Sharding, NoSQL Databases, S3, Hadoop Distributed File Systems,
Visualization: visual data analysis techniques, interaction techniques, systemsand
applications.
IntroductiontoR - R graphical user interfaces, data import and export, attribute
and data types, descriptive statistics, exploratory data analysis, visualization
before analysis, analytics for unstructured data.
SuggestedReadings:
1. MichaelBerthold,DavidJ.Hand,“IntelligentDataAnalysis”,Springer.
2. AnandRajaramanandJeffreyDavidUllman,“MiningofMassiveDatasets”,Cambridge University
Press.
3. BillFranks,“TamingtheBigDataTidalwave:FindingOpportunitiesinHugeDataStreams
 withAdvancedAnalytics”,JohnWiley&Sons.
4. John Garrett, “Data Analytics for IT Networks : Developing Innovative
Use Cases”, Pearson Education.
5. Michael Minelli, Michelle Chambers, and AmbigaDhiraj, "Big Data, Big
Analytics: Emerging Business Intelligence and Analytic Trends for
Today's Businesses", Wiley.
6. DavidDietrich,BarryHeller,BeibeiYang,“DataScienceandBigDataAnalyti
cs”,EMC Education Series, John Wiley.
7. Frank J Ohlhorst, “Big Data Analytics: Turning Big Data into Big
Money”, Wiley and SASBusiness Series.
8. ColleenMccue,“DataMiningandPredictiveAnalysis:IntelligenceGatherin
gandCrime Analysis”, Elsevier.
9. MichaelBerthold,DavidJ.Hand,”IntelligentDataAnalysis”,Springer.
10. PaulZikopoulos,ChrisEaton,PaulZikopoulos,“UnderstandingBigData:An
alyticsfor Enterprise Class Hadoop and Streaming Data”, McGraw Hill.
11. Trevor Hastie, Robert Tibshirani, Jerome Friedman, "The Elements of
Statistical Learning",Springer.
12. MarkGardner,“BeginningR:TheStatisticalProgrammingLanguage”,Wro
xPublication.
13. PeteWarden,“BigDataGlossary”,O’Reilly.
14. GlennJ.Myatt,“MakingSenseofData”,JohnWiley&Sons.
15. Peter Bühlmann, Petros Drineas, Michael Kane, Mark van der Laan,
"Handbook of Big Data", CRC Press.
16. JiaweiHan,MichelineKamber“DataMiningConceptsandTechniques”,Sec
ondEdition, Elsevier.
 MC:Software Quality Engineering
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto:
UnderstandbasicconceptsofSoftwareQualityalongwithitsdocumentsand process K2
CO1
CO2 ApplyknowledgeofSoftwareQualityinvarioustypesofsoftware K3
CO3 Comparethevariousreliabilitymodelsfordifferentscenarios K4
CO4 IllustratethesoftwareQualityPlanningandAssurance K2
CO5 Makeuseofvarioustestingtechniquesinsoftwareimplementation K3
DETAILEDSYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Software Quality: Definition, Software Quality Attributes and Specification, Cost
of Quality, Defects, Faults, Failures, Defect Rate and Reliability,
I DefectPrevention,Reduction,andContainment,OverviewofDifferentTypesofSoftwar 08
e
Review, Introduction to Measurement and Inspection Process, Documents and
Metrics.
Software Quality Metrics Product Quality Metrics: Defect Density, Customer
Problems Metric, Customer Satisfaction Metrics, Function Points, In-Process
II Quality Metrics: Defect Arrival Pattern, Phase-Based Defect Removal Pattern, 08
DefectRemovalEffectiveness,MetricsforSoftwareMaintenance:Backlog
ManagementIndex,FixResponseTime,FixQuality,SoftwareQualityIndicators.
Software Quality Management and Models:Modeling Process, Software
Reliability Models: The Rayleigh Model, Exponential Distribution and Software
III Reliability Growth Models, Software Reliability Allocation Models, Criteria for 08
ModelEvaluation,SoftwareQualityAssessmentModels:HierarchicalModelof
SoftwareQualityAssessment.
SoftwareQualityAssurance:QualityPlanningandControl,QualityImprovement
Process, Evolution of Software Quality Assurance (SQA), Major SQA Activities,
IV 08
MajorSQAIssues,ZeroDefectSoftware,SQATechniques,StatisticalQuality
Assurance,TotalQualityManagement,QualityStandardsandProcesses.
Software Verification, Validation & Testing: Verification and Validation,
Evolutionary Nature of Verification and Validation, Impracticality of Testing all
V Data and Paths, Proof of Correctness, Software Testing, Functional, Structural and 08
Error-OrientedAnalysis&Testing,StaticandDynamicTestingTools,
CharacteristicsofModernTestingTools.
Textbooks:

1. JeffTian,SoftwareQualityEngineering(SQE),Wiley-Interscience,2005;ISBN0-471-
71345 -7
2. MetricsandModelsinSoftwareQualityEngineering,StephenH.Kan,AddisonWesley
(2002), ISBN: 0201729156
3. NormanE.Fentonand ShariLawrencePfleeger, “SoftwareMetrics”Thomson, 2003
4. MordechaiBen–MenachemandGarryS.Marliss,“SoftwareQuality”,ThomsonAsia Pte
Ltd, 2003.
ELECTIVE-4
 MC-7632(B):Block chain Architecture
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 Studyandunderstandbasicconceptsofblockchainarchitecture. K1,K2
CO2 Analyzevariousrequirementsforconsensusprotocols. K4
CO3 Applyandevaluatetheconsensusprocess. K3, K5
CO4 UnderstandtheconceptsofHyperledgerfabric. K1
CO5 Analyzeandevaluatevarioususecasesinfinancialsoftwareandsupplychain. K4, K5
DETAILEDSYLLABUS 4-0-0
Unit Topic Proposed
Lecture
I IntroductiontoBlockchain:DigitalMoneytoDistributedLedgers,Design Primitives: 08
Protocols, Security, Consensus, Permissions, Privacy.
Blockchain Architecture and Design: Basic crypto primitives: Hash, Signature,
Hashchain to Blockchain, Bitcoin Basic, Basic consensus mechanisms.
II Consensus: Requirements for the consensus protocols, Proof of Work (PoW), 08
Scalability aspects of Blockchain consensus protocols, distributed consensus,
consensus in Bitcoin.
PermissionedBlockchains:Designgoals,ConsensusprotocolsforPermissioned
Blockchains
III HyperledgerFabric:Decomposingtheconsensusprocess,Hyperledgerfabric 08
components.
ChaincodeDesignandImplementationHyperledgerFabric:Beyond Chaincode:
fabric SDK and Front End, Hyperledger composer tool.
IV Usecase1:BlockchaininFinancialSoftwareandSystems(FSS):(i) Settlements, (ii) 08
KYC, (iii) Capital markets, (iv) Insurance.
Use case 2: Blockchain in trade/supply chain: (i) Provenance of goods, visibility,
trade/supply chain finance, invoice management discounting, etc.
V Usecase3:BlockchainforGovernment:(i)Digitalidentity,landrecordsand 08
otherkindsofrecordkeepingbetweengovernmententities,(ii)public
distributionsystemsocialwelfaresystems,BlockchainCryptography,Privacy and
Security on Blockchain
SuggestedReadings:
1. AndreasAntonopoulos,“MasteringBitcoin:UnlockingDigitalCryptocurrencies”,O’Reilly
2. MelanieSwa,“Blockchain”,O’Reilly
3. “HyperledgerFabric”,https://www.hyperledger.org/projects/fabric
4. Bob Dill, David Smits, “Zero to Blockchain - An IBM Redbooks course”,
https://www.redbooks.ibm.com/Redbooks.nsf/RedbookAbstracts/crse0401.html
 MC:Internet of Things
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 Demonstratebasicconcepts,principlesandchallengesinIoT. K1,K2
CO2 IllustratefunctioningofhardwaredevicesandsensorsusedforIoT. K2
CO3 AnalyzenetworkcommunicationaspectsandprotocolsusedinIoT. K4
CO4 ApplyIoTfordevelopingreallifeapplicationsusingArdunioprogramming. K3

CP5 TodevelopIoTinfrastructureforpopularapplications K2,K3

DETAILEDSYLLABUS 3-1-0
Proposed
Unit Topic
Lecture
Internet of Things (IoT): Vision, Definition, Conceptual Framework,
Architectural view, technology behind IoT, Sources of the IoT, M2M
I Communication, IoT Examples. Design Principles for Connected Devices: 08
IoT/M2Msystemslayersanddesignstandardization,communicationtechnologies,
dataenrichmentandconsolidation,easeofdesigningandaffordability
Hardware for IoT: Sensors, Digital sensors, actuators, radio frequency
identification (RFID) technology, wireless sensor networks, participatory sensing
II technology. Embedded Platforms for IoT: Embedded computing basics, Overview 08
ofIOTsupportedHardwareplatformssuchasArduino,NetArduino,Raspberrypi,
BeagleBone,IntelGalileoboardsandARMcortex.
Network&CommunicationaspectsinIoT:WirelessMediumaccessissues,
III MACprotocolsurvey,Surveyroutingprotocols,Sensordeployment&Node discovery, 08
Data aggregation & dissemination
ProgrammingtheArdunio:ArdunioPlatformBoardsAnatomy,ArdunioIDE,
IV coding,usingemulator,usinglibraries,additionsinardunio,programmingthe 08
ardunioforIoT.
Challenges in IoT Design challenges: Development Challenges, Security
Challenges, Other challenges IoT Applications: Smart Metering, E-health, City
V Automation, Automotive Applications, home automation, smart cards, 08
communicatingdatawithH/Wunits,mobiles,tablets,Designingofsmartstreet
lightsinsmartcity.
Textbooks:
1. OlivierHersent,DavidBoswarthick,OmarElloumi“TheInternetofThingskeyapplicationsand
protocols”,willey
2. JeevaJose,InternetofThings,KhannaPublishingHouse
3. MichaelMiller“TheInternetofThings”byPearson
4. RajKamal“INTERNETOFTHINGS”,McGraw-Hill,1STEdition,2016
5. ArshdeepBahga,VijayMadisetti“InternetofThings(Ahandsonapproach)”1STedition,VPI
publications,2014
6. AdrianMcEwen,HakinCassimally“DesigningtheInternetofThings”WileyIndia
 MC: Distributed Database Systems
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeableto:
CO1 Understandtheoreticalandpracticalaspectsofdistributeddatabasesystems. K2
Studyandidentifyvariousissuesrelatedtothedevelopmentofdistributed database K3
CO2
system
Understandthedesignaspectsofobject-orienteddatabasesystemandrelated K4
CO3
development
CO4 Equipstudentswithprinciplesandknowledgeofdistributedreliability. K3

Equipstudentswithprinciplesandknowledgeofparallelandobject-oriented databases. K5
CO5
DETAILEDSYLLABUS 4-0-0
Unit Topic Proposed
Lecture
Introduction: Distributed Data Processing, Distributed Database System,
Promises of DDBSs, Problem areas. Distributed DBMS Architecture:
I ArchitecturalModelsforDistributedDBMS,DDMBSArchitecture.Distributed 08
Database Design: Alternative Design Strategies, Distribution Design issues,
Fragmentation, Allocation.
Query processing and decomposition: Query processing objectives,
characterization of query processors, layers of query processing, query
II decomposition, localization of distributed data. Distributed query Optimization: 08
Queryoptimization,centralizedqueryoptimization,distributedquery
optimizationalgorithms.
Transaction Management: Definition, properties of transaction, types of
transactions, distributed concurrency control: Serializability, concurrency control
III 08
mechanisms & algorithms, time - stamped & optimistic concurrency control
Algorithms, deadlock Management.
Distributed DBMS Reliability: Reliability concepts and measures, fault-
toleranceindistributedsystems,failuresinDistributedDBMS,local&distributed
IV reliability protocols, site failures and network partitioning. Parallel Database 08
Systems:Paralleldatabasesystemarchitectures,paralleldataplacement,parallel
queryprocessing,loadbalancing,databaseclusters.
Distributed object Database Management Systems: Fundamental object
concepts and models, object distributed design, architectural issues, object
management, distributed object storage, object query Processing.
V 08
ObjectOrientedDataModel:Inheritance,objectidentity,persistent
programming languages, persistence of objects, comparison OODBMS and
ORDBMS
Textbooks:

M.TamerOZSUandPatuckValduriez:PrinciplesofDistributedDatabaseSystems,PearsonEdn.Asia, 2001. 2.
Stefano Ceri and Giuseppe Pelagatti: Distributed Databases, McGraw Hill. REFERENCE BOOKS: 1.
Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom: “Database Systems: The Complete Book”,
Second Edition, Pearson International Edition
ELECTIVE-5
 MC:Mobile Computing
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Atthe endof course, thestudentwill beable to understand
CO 1 Studyandaware fundamentalsofmobile computing. K1,K2
CO 2 Studyandanalyzewirelessnetworkingprotocols,applicationsandenvironmen K1,K4
t.
CO3 Understandvariousdatamanagement issuesinmobilecomputing. K2
CO 4 Analyzedifferent type of security issues in mobile computing K4
environment.
CO 5 Study,analyze,andevaluatevariousroutingprotocolsusedinmobile K1,K4,K5
computing.
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I Introduction, Issues in mobile computing, Overview of wireless
telephony, Cellular concept, GSM- air interface, channel structure; 08
Locationmanagement-HLR-VLR,hierarchical,handoffs;Channel
allocationincellularsystems, CDMA,GPRS,MACforcellular system.
II Wireless Networking, Wireless LAN Overview- MAC issues, IEEE
802.11, Blue Tooth, Wireless multiple access protocols, TCP over 08
wireless, Wireless applications, Data broadcasting, Mobile IP, WAP-
architecture, protocol stack, application environment, applications.
III Data management issues in mobile computing, data replication for
mobilecomputers,adaptiveclusteringformobilewirelessnetworks,File
system, Disconnected operations. 08

IV MobileAgentscomputing,Securityandfaulttolerance,Transaction
processing in mobile computing environment. 08
V Adhoc networks, Localization, MAC issues, Routing protocols, Global
state routing (GSR), Destination sequenced distance vector routing 08
(DSDV),Dynamicsourcerouting(DSR),Adhocondemanddistance
vector routing (AODV), Temporary ordered routing algorithm (TORA),
QoS in Adhoc Networks, applications
Suggested Readings:
1. SchillerJ.,“MobileCommunications”, Pearson
2. UpadhyayaS.andChaudhuryA.,“MobileComputing”,Springer
3. KamalR.,“MobileComputing”,OxfordUniversityPress.
4. TalukderA.K.andAhmedH.,“MobileComputingTechnology,Applications and
Service Creation”, McGraw Hill Education
5. GargK.,“MobileComputingTheoryandPractice”,Pearson.
6. KumarS.,“WirelessandMobileCommunication”,NewAgeInternational
Publishers
7. ManviS.S.and KakkasageriM.S.,“Wireless and Mobile Networks- Concepts and
Protocols”,WileyIndiaPvt.Ltd.
 MC-7633:Computer Graphics and Animation
CourseOutcome(CO) Bloom’sKnowledgeLevel(KL)
Attheendofcourse,thestudentwillbeabletounderstand
CO1 Understandthegraphicshardwareusedinfieldofcomputergraphics. K2
CO2 Understandtheconceptofgraphicsprimitivessuch aslinesandcirclebasedon K2,K4
different algorithms.
CO3 Applythe2Dgraphicstransformations,compositetransformationandClipping K4
concepts.
CO4 Applytheconceptsandtechniquesusedin3Dcomputergraphics,including viewing K2,K3
transformations, projections, curve and hidden surfaces.
CO5 Performtheconceptofmultimediaandanimationinreallife. K2,K3
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I Introduction and Line Generation: Types of computer graphics, Graphic 08
Displays- Random scan displays, Raster scan displays, Frame buffer and video
controller,Pointsandlines,Linedrawingalgorithms,Circlegenerating
algorithms, Mid-point circle generatingalgorithm, and parallel version of these
algorithms.
II Transformations: Basic transformation, Matrix representations and 08
homogenous coordinates, Composite transformations, Reflections andshearing.
Windowing and Clipping: Viewing pipeline, Viewing transformations, 2-D
Clipping algorithms- Line clipping algorithms such as Cohen Sutherland line
clippingalgorithm,LiangBarskyalgorithm,Lineclippingagainstnon
rectangular clip windows; Polygon clipping – Sutherland Hodgeman polygon
clipping, Weiler and Atherton polygon clipping, Curve clipping, Text clipping.

III Three Dimensional: 3-D Geometric Primitives, 3-D Object representation, 3- 08

D Transformation, 3-D viewing, projections, 3-D Clipping.
CurvesandSurfaces:Quadricsurfaces,Spheres,Ellipsoid,Blobbyobjects,
Introductory concepts of Spline, Bspline and Bezier curves and surfaces.
IV Hidden Lines and Surfaces: Back Face Detection algorithm, Depth buffer 08
method, A- buffer method, Scan line method, basic illumination models–
Ambientlight,Diffusereflection,SpecularreflectionandPhongmodel,
Combined approach, Warn model, Intensity Attenuation, Color consideration,
Transparency and Shadows.
V MultimediaSystems:DesignFundamentals,BackgroundofArt,Colortheory 08
overview, Sketching & illustration, Storyboarding, different tools foranimation.
Animation: Principles of Animations, Elements of animation and their use,
PowerofMotion,AnimationTechniques,AnimationFileFormat,Making
animation for Rolling Ball, making animation for a Bouncing Ball, Animation
for the web, GIF, Plugins and Players, Animation tools for World Wide Web.

SuggestedReadings:
1. HearnD.andBakerM.P.,“ComputerGraphicsCVersion”,Pearson Education
2. Foley,Vandam,Feiner,Hughes,“ComputerGraphicsprinciple”,PearsonEducation.
3. Rogers,“ProceduralElementsofComputerGraphics”,McGrawHill
4. NewmanW.M.,SproullR.F.,“PrinciplesofInteractivecomputerGraphics”,McGrawHill.
5. SinhaA.N.andUdaiA.D.,”ComputerGraphics”,McGrawHill.
6. Mukherjee,“FundamentalsofComputergraphics&Multimedia”,PHILearningPrivateLimited.
7. VaughanT.,“Multimedia,MakingITWork”,TataMcGrawHill.
 MC-7633(B):Machine Learning Techniques
CourseOutcome(CO) Bloom’sKnowledgeLevel
(KL)
Attheendofcourse,thestudentwillbeable:

CO1 Tounderstandtheneedformachinelearningforvariousproblemsolving K1,K2

Tounderstandawidevarietyoflearningalgorithmsandhowtoevaluate models K1,K3

CO2
generated from data
CO3 Tounderstandthelatesttrendsinmachinelearning K2,K3

Todesignappropriatemachinelearningalgorithmsandapplythealgorithmsto a K4,K6
CO4
real-world problems
Tooptimizethemodelslearnedandreportontheexpectedaccuracythat can K4,K5
CO5
beachievedbyapplyingthemodels
DETAILEDSYLLABUS 3-0-0
Unit Topic Proposed
Lecture
INTRODUCTION – Learning, Types of Learning, Well defined learning
problems, Designing a Learning System, History of ML, Introduction of Machine
I Learning Approaches – (Artificial Neural Network, Clustering, Reinforcement 08
Learning, Decision Tree Learning, Bayesian networks, Support Vector Machine,
GeneticAlgorithm),IssuesinMachineLearningandDataScienceVsMachine
Learning;
REGRESSION:LinearRegressionandLogisticRegression
BAYESIANLEARNING-Bayestheorem,Conceptlearning,BayesOptimal
II Classifier, Naïve Bayes classifier, Bayesian belief networks, EM algorithm. 08
SUPPORTVECTORMACHINE:Introduction,Typesofsupportvectorkernel
– (Linear kernel, polynomial kernel,and Gaussiankernel), Hyperplane – (Decision
surface), Properties of SVM, and Issues in SVM.
DECISION TREE LEARNING - Decision tree learning algorithm, Inductive
bias, Inductive inference with decision trees, Entropy and information theory,
III 08
Information gain, ID-3 Algorithm, Issues in Decision tree learning.
INSTANCE-BASED LEARNING – k-Nearest Neighbour Learning, Locally
Weighted Regression, Radial basis function networks, Case-based learning.
ARTIFICIAL NEURAL NETWORKS – Perceptron’s, Multilayer perceptron,
Gradient descent and the Delta rule, Multilayer networks, Derivation of
Backpropagation Algorithm, Generalization, Unsupervised Learning – SOM
Algorithm and its variant;
IV DEEP LEARNING - Introduction,concept of convolutional neural network , 08
Types of layers – (Convolutional Layers , Activation function , pooling , fully
connected),ConceptofConvolution(1Dand2D)layers,Trainingofnetwork,
CasestudyofCNNforegonDiabeticRetinopathy,Buildingasmartspeaker,
Self-derivingcaretc.
REINFORCEMENT LEARNING–Introduction to Reinforcement Learning ,
Learning Task,Example of Reinforcement Learning in Practice, Learning Models
V 08
forReinforcement – (Markov Decision process , Q Learning - Q Learning
function, QLearning Algorithm ), Application ofReinforcement
Learning,Introduction to Deep Q Learning.
 GENETIC ALGORITHMS: Introduction, Components, GA cycle of
reproduction, Crossover, Mutation,Genetic Programming, Models of Evolution
and Learning, Applications.

Textbooks:
1. TomM.Mitchell,―MachineLearning,McGraw-HillEducation(India)PrivateLimited,2013.
2. EthemAlpaydin,―IntroductiontoMachineLearning(AdaptiveComputationandMachineLearning), MIT
Press 2004.
3. StephenMarsland,―MachineLearning:AnAlgorithmicPerspective,CRCPress,2009.
4. Bishop,C.,PatternRecognitionandMachineLearning.Berlin:Springer-Verlag.
5. M.Gopal,“AppliedMachineLearning”,McGrawHillEducation