7-8th Sem Syllabus

Syllabus of VII & VIII Semester B.E. 2021-22 / Computer Science &Engg.
VII &VIII SEMESTER

Department of
Computer Science and Engineering
College Calendar 2021-22

(An Autonomous Institution affiliated to VTU, Belgavi)

NITTE-574110, Karkala Taluk, Udupi District, Karnataka, India
ISO 9001:2015 Certified, Accredited by NAAC with “A” Grade
COLLEGE CALENDAR
2020-21
(III & IV Semester)
(An Autonomous Institution affiliated to VTU, Belgavi)

NITTE-574110, Karkala Taluk, Udupi District, Karnataka, India
ISO 9001:2015 Certified, Accredited by NAAC with “A” Grade
Vision Statement
Pursuing Excellence, Empowering people, Partnering in Community

Development
Mission Statement
To develop N.M.A.M. Institute of Technology, Nitte, as Centre of Excellence by

imparting Quality Education to generate competent,
Skilled and Humane Manpower to face emerging Scientific, Technological,
Managerial and Social Challenges
with Credibility, Integrity, Ethics and Social Concern.
Sl.No. Name of the Faculty Designation

1. Dr. Niranjan N. Chiplunkar Principal
2. Mr. YogeeshHegde Registrar/Chief Warden
3. Dr. ShrinivasaRao B. R. Vice Principal/Controller of
Examinations / Professor
4. Dr. I. Ramesh Mithanthaya Vice Principal / Dean
(Academics)/ Professor
5. Dr. SudeshBekal Dean (R&D)/Professor
6. Dr. Rajesh Shetty K. Dean (Admissions & Alumni
Affairs)/ Professor
7. Dr. Muralidhara PG Coordinator/Professor
8. Prof. Shalini K. Sharma Head, Counseling, Welfare,
Training & Placement
9. Dr. Srinath Shetty K. Resident Engineer/Professor
HEADS OF DEPARTMENTS
1. Dr. Arun Kumar Bhat Civil Engg.
2. Dr. Jyothi Shetty Computer Science &Engg.
3. Dr. Karthik Pai B. H. Information Science &Engg.
4. Dr. C. VamanRao Biotechnology Engg.
5. Dr. ShashikanthKarinka Mechanical Engg.
6. Dr. SSSS Sairam Electronics & Communication Engg.
7. Dr. Nagesh Prabhu Electrical & Electronics Engg.
8. Dr. Kumudakshi Mathematics
9. Dr. Shobha R. Prabhu Physics
10. Dr. ShivaprasadShetty M. Chemistry
11. Dr. Surendra Shetty MCA
12. Mrs. Rashmi D. Hegde Humanities
st
13. Dr. NarasimhaBailkeri 1 year Coordinator
14. Dr. DivakaraBhat Senior Grade Librarian
15. Dr. GururajUpadhyaya Asso. Prof./Workshop Supdt.
16. Dr. Udaya Kumar Shenoy In charge of BE in CCE
17. Dr. Sharad U Shenoy In Charge of BE, AI & MLE
SPORTS DEPARTMENT
1. Sri. ShyamSundar M. P.E.D

2. Sri. Ganesh Poojary P.E.D
3. Ms. Sowjanya M. P.E.I
4. Mr. Ravi Prakash C. Anpur Basket Ball Coach
STUDENT WELFARE CELL

1. Dr. SubrahmanyaBhat K. Dean - Student Welfare
2. Sri. ShekarPoojari Student Welfare Officer
ENTREPRENEURSHIP DEVELOPMENT CELL
1. Dr. Ramakrishna B. Professor/EDC- Incharge

2. Mrs. GeethaPoojarthi Co-ordinator
OFFICE SECTION HEADS
1. Mr. KeshavaMugeraya Sr. Supdt., Academic Section/

Purchase In-Charge
2. Mrs. Suneetha R. Shetty Sr. Supdt., Administrative
Section
3. Mr. Suresh Achar Sr. Supdt., Stores
4. Mrs. Jayashree Sr. Programmer
5. Mrs. Shailaja V. Shetty Supdt., Accounts Section
DEPARTMENT OF TRAINING & PLACEMENT

1. Mr. Bharath G. Kumar Lead Placements
DEPARTMENT OF MATHEMATICS
1. Dr. Shashirekha B. Rai Professor

2. Dr. P. Shankaran Professor
3. Dr. Kumudakshi Asso. Professor/ HoD
4. Dr. Sharad M. Hegde Asst. Professor Gd III
5. Mrs. Ambika N. Asst. Professor Gd I
6. Mrs. Vinaya Acharya Asst. Professor Gd I
7. Mrs. Anitha D. Bayar Asst. Professor
8. Mrs. Bhavya K. Asst. Professor
9. Ms. Chaithra K. Asst. Professor
10. Mrs. Bhavya. D. Asst. Professor
11. Mrs. Sharmila Asst. Professor
12. Mrs. Anjana Pai Asst. Professor
13. Mrs. Soumya Asst. Professor
14. Mrs. Smitha G. V. Asst. Professor
DEPARTMENT OF PHYSICS
1. Dr. Manjunath K. B. Asst. Professor Gd III

2. Dr. Shobha R. Prabhu Asst. Professor Gd III/

HoD
3. Dr. Nagaraja B. S. Asst. Professor Gd III
4. Dr. RaghavendraBairy Asst. Professor
5. Dr. Shyam Prasad K. Asst. Professor
DEPARTMENT OF CHEMISTRY
1. Dr. JanardhanaNayak Professor

2. Dr. Ramesh Bhat Asso. Professor
3. Dr. ShivaprasadShetty M. Asst. Professor Gd III/HoD
4. Dr. Aarti S. Bhat Asst. Professor Gd III
5. Dr. SubrahmanyaIshwarBhat Asst. Professor Gd III
DEPARTMENT OF HUMANITIES
1. Dr. Ramakrishna B. Asso. Professor

2. Mrs. Rashmi D. Hegde Asso. Professor/HoD
3. Mr. Vishwanatha Asst. Professor Gd III
4. Dr. Joy ElvineMartis Asst. Professor Gd III
5. Ms. Sonia Lobo Asst. Professor Gd I
6. Mr. SandeepKharvi Asst. Professor
7. Mr. SrinivasNekkar Asst. Professor
8. Mrs. Sudeeksha S. Pai Asst. Professor
PUBLIC RELATIONS OFFICER

1. Mr. KrishnarajaJoisa
HOSTEL SUPERINTENDENT / MANAGER
1. Mr. John D’Souza Sr. Manager, Gents Main

Hostel
2. Mr. Manjunath Suvarna Manager, Gents PG Hostel
3. Mrs. GayathriKamath Supdt. Ladies PG Hostel
4. Mrs. Chethana Sharma Supdt.Ladies Main Hostel
5. Mrs. Hema S. Hegde Supdt., Hostel Office
SECURITY DEPARTMENT
1. Mr. HiriannaSuvarna Security Supervisor

REGULATIONS
2021-22
(Applicable for admission batch 2018-19 onwards)
COMMONTO ALL B.E.(CREDITSYSTEM)

DEGREE PROGRAMMES
CONTENTS
REGULATIONS
1. INTRODUCTION
2. DEGREE PROGRAMMES
3. REGISTRATION
4. ADD/DROP/AUDITOPTIONS
5. COURSE STRUCTURE
6. ATTENDANCE REQUIREMENT
7. WITHDRAWALFROMTHEPROGRAMME
8. EVALUATIONSYSTEM
9. EVALUATIONOFPERFORMANCE
10. COMMUNICATIONOFGRADES
11. VERTICAL PROGRESSION
12. AWARDOFCLASS
13. APPEALFORREVIEWOFGRADES
14. AWARD OF DEGREE
15. GRADUATIONREQUIREMENTSANDCONVOCATION
16. AWARDOFPRIZES,MEDALS,CLASSANDRANKS
17. CONDUCTANDDISCIPLINE
18. EARNING OF ACTIVITY POINTS FOR THE AWARD OF DEGREE
19. LISTSOFMAJOR SCHOLARSHIPS
REGULATIONSCOMMONTOALLB.E.(CREDITSYSTEM)DEGREEPROGRAM
MESOF
NMAMINSTITUTEOFTECHNOLOGY,NITTE
Karkala, UdupiDist., Karnataka
1. INTRODUCTION
1.1 ThegeneralregulationsarecommontoallB.E.(CreditSystem)DegreeProgrammescond
uctedattheNMAMIT,NitteCampusandshallbecalled“NMAMITRegulations”.
1.2 Theprovisionscontainedinthissetofregulationsgovernthepoliciesandproceduresonth
eRegistrationofstudents,impartingInstructionsofcourse,conductoftheexaminationa
ndevaluationandcertificationofstudent’sperformanceandallamendmentsrelatedtot
hesaidDegreeprogramme(s).
1.3 ThissetofRegulations,onapprovalbytheAcademicCouncilandGoverningCouncil,shall
supersedeallthecorrespondingearliersetsofregulationsoftheBEDegreeprogram(ofV
TU)alongwithalltheamendmentsthereto,andshallbebindingonallstudentsundergoin
gtheGraduateDegreeProgramme(s)(CreditSystem)conducted at the NMAMIT,
Nitte with effect from its date of
approval.ThissetofRegulations,mayevolveandgetmodifiedorchangedthrough
appropriateapprovalsfromtheAcademicCouncil/GoverningCouncilfromtimet
otime,andshallbebindingonallstakeholders(TheStudents,Faculty,StaffofDep
artmentsofNMAMIT,Nitte).ThedecisionoftheAcademic
Council/GoverningCouncilshallbefinalandbinding.
1.4 Inordertoguaranteefairnessandjusticetothepartiesconcernedin view of the periodic
evolutionary refinements, any specific issuesor matters of concern shall be
addressed separately, by the appropriateauthorities,asandwhenfoundnecessary.
1.5 The Academic Council may consider any issues or matters of
ConcernrelatingtoanyoralltheacademicactivitiesofNMAMITcoursesforappropriatea
ction,irrespectiveofwhetherareferenceismadehereinthissetofRegulationsorotherwi
se.
1.6 Thecourseshallbecalled BachelorofEngineeringcourseabbreviatedasB.E.
(Subjectofspecialization)–CreditSystem.
1.7 DURATIONOF THECOURSE
(a) Thecourseshallextendoveraperiodoftotaldurationof 4years.
(b) Eachyearshallhavethefollowingschedulewith5½ daysaweek.
SuggestedBreakdownof AcademicYearintoSemesters
1.No. ofSemesters / Year Three;TwobeingMainsemesters(odd,

even)andonebeingasupplementarysemester; after 2
main semesters.
(Note:Supplementarysemesterisprimarilytoassistwe
akand/orfailedstudentsthroughmakeupcourses.
However, Autonomous Colleges may use this semester
to arrange Add-On courses
forotherstudentsand/orfordeputingthem for practical
training elsewhere.)
2.Semester Duration Main semester (odd, even) each 19 Weeks;Supplementary

Semester8 Weeks
3.Academic Activities Main Semester
(Weeks): RegistrationofCourses&CourseWork (16.0)

Examination Preparation and Examination (3.0)
Total (19)
Supplementary Semester
RegistrationofCourses&CourseWork (5.0)
Examination Preparation and Examination (3.0)
Total (8)
Declaration of results: 2 weeks from the
date of last examination
Inter- Semester Recess:
After each Main Semester (2)
Total Vacation:10weeks (forthosewho
do not register for supplementary
semester)and4weeks(forthosewho
register for supplementary semester)
(Note: In each semester, there will be provision for students for Registrationof courses at
the beginning, dropping of courses in the middle and withdrawalfrom courses towards the
end, under the advice of faculty
member.Thesefacilitiesareexpectedtoenhancethelearningcapabilitiesofstudents,minimizi
ngtheirchancesoffailureincoursesregisteredandalsoensuretheir better monitoring by
Faculty Advisors).
Acandidateshallbeallowedamaximumdurationofeightyearsfromthefirstsemesterof
admissiontobecomeeligiblefortheawardofBachelorDegree.
ThecalendarofeventsinrespectofthecourseshallbefixedbytheSenate from time to time, but

preferably in line with the academic calendaroftheVTU.
2. DEGREEPROGRAMMES
2.1 UndergraduateB.E.DegreeProgrammesareofferedinthefollowingdisciplines by
therespectiveprogramme hostingdepartments listed below:
i) Biotechnology Engineering (BT)
ii) Civil Engineering (CV)
iii) ComputerScience&Engineering (CS)
iv) Electronics&CommunicationsEngineering (EC)
v) Electrical&ElectronicsEngineering (EE)
vi) InformationScience&Engineering (IS)
vii) MechanicalEngineering (ME)
viii) Artificial Intelligence and Machine Learning (AM)*
ix) Computer and communication Engineering (CC)*
Otherteachingdepartmentsare–
i) Mathematics (MA)
ii) Physics (PH)
iii) Chemistry (CY)
iv) Humanities,SocialSciencesandManagement (HU)
2.2 TheprovisionsoftheseRegulationsshallbeapplicabletoanynewdiscipline*thatmaybei
ntroducedfromtimetotimeandappendedtotheabovelist.
3. REGISTRATION
3.1 EverystudentafterconsultinghisFacultyAdvisorinparentdepartmentshallregisterapp
rovedcourses(coreandelective)toearncreditsformeetingtherequirementsofdegreepro
gramat
thecommencementofeachSemesteronthedaysfixedforsuchregistrationandnotifiedint
heacademiccalendar.Studentswhofailtoregisteronorbeforethespecifieddatewillhavet
opayalatefee.Suchcoursestogetherwiththeirgradeandcreditsearnedwillbeincludedint
hegradecardissuedbythecollegeattheendofeachsemester,likeodd,even,supplementa
ryanditformsthebasisfordeterminingthestudent’sperformanceinthatsemester.
3.2 LowerandUpperLimitsforCourseCreditsRegisteredinaSemester
Course Credit Assignment
AllcoursescompriseofspecificLecture/Tutorial/Practical(L-T-P) schedule.The
course credits are fixed based on the followingnorms.
Lecture/Tutorials/ Practical:
i) OnehourLectureperweekisassignedoneCredit.
ii) 2-hourTutorialsessionperweekisassigned1.0 Credit.
iii) 2-hourLab.sessionperweekisassigned1.0credit.
Forexample,atheorycoursewithL-T-Pscheduleof3-2-0hourswillbeassigned4.0credits.
AlaboratorypracticalcoursewithL-T-Pscheduleof0-0-2hourswillbeassigned1.0credit.
CalculationofContactHours/Week–ATypicalExample
TypicalCourseLoadperSemester
No. of Courses Credits / Total Contact
Course Credits HoursperWeek
2LectureCourses 3:0:0 6 6
2Lec.cumLabCourses 3:0:1 8 10
2Lec.cumTut.Courses 3:1:0 8 10
1Lec.Tut.cumLabCourse 1:1:1 3 5
s
Total 10:2:2 25 31
Astudentmustregister,asadvisedbyFacultyAdvisor,betweenaminimumof16creditsa
nduptoaMaximumof28credits.
3.3 Mandatory Pre-Registrationfor highersemester
InordertofacilitateproperplanningoftheacademicactivitiesoftheSemester,itisnecessa
ryforthestudentstodeclaretheirintentiontoregisterforcoursesofhighersemesters(3rda
ndabove)atleasttwoweeksbeforetheendofthecurrentsemesterchoosingthecoursesof
feredbyeachdepartmentinthenexthighersemesterwhichisdisplayedontheDepartmen
tNoticeBoardatleast4weekspriortothelastworkingdayofthesemester.
Registrationtoahighersemesterisallowedonlyifthestudentfulfillsthefollowingcondition
s-
i) satisfiedalltheacademicrequirementstocontinuewiththeprogrammeofstudieswit
houttermination
ii) clearedallInstitute,hostelandlibraryduesandfines,ifany,oftheprevioussemester
iii) paidallrequiredadvancepaymentsoftheInstituteandthehostelforthecurrentsem
ester
iv) has not been debarred from registering on any specific groundsbytheInstitute.
4. ADD/DROP/AUDIToptions
4.1 Registrationofcourses
Each studentshall haveto registerfor coursework atthe
beginningofasemesterwithin2to3daysofcommencementafterdiscussingwithsubjectte
acherandunderfacultyadvice.Thepermissiblecourseloadtobeeitheraveragecredits(=
22)ortobewithinthelimitsofminimum(=16)andmaximum(=28)credits.
4.2 DROP-option
Duringaspecifiedperiodatthemiddleofasemesterstudent’sperformanceinCIEisreview
edbythefacultyadvisor.Followingpoorperformancebyastudenthe/shecanbefacilitatedt
odropidentifiedcourse(s)(up
totheminimumcreditsspecifiedforthesemester).Suchcourse(s)willnotbementionedin
theGradecard.Suchcoursestobere-
registeredbythesestudentsandtakenupforstudyatalatertime.
4.3 Withdrawal from courses

Duringaspecificperiodspecifiedtowardstheendofthesemester,student’sperformancei
nCIEisreviewedbytheFacultyadvisors.Followingpoorperformancebyastudentinidentif
iedcourse(s) he/sheisadvisedtowithdrawfromsuchcourse(s)(up
totheminimumcreditsspecifiedforthesemester)withmentionintheGradecard(Grade‘
W’).Suchcoursestobere-
registeredbythesestudentsandtakenupforstudyatalatertime.
4.4 AUDIT-option
Astudentcanregisterforcoursesforauditonly,withaviewtosupplementhis/herknowledg
eand/orskills.Thestudent’sgradesinsuchcourse(s)willhavetobereflectedinthegradec
ard.However,COREcoursesshallnotbemadeavailableforaudit.Buttheseshallnotbeta
kenintoaccountindeterminingthestudent’sacademicperformanceinthesemester.‘U”
gradeisawardedtosuchcoursesonsatisfyingtheattendancerequirements and
CIE requirements. The candidate need not appearforSEEinsuchcourses.
5. COURSESTRUCTURE:
5.1 Typical Breakdown for the B.E. Degree Curriculum:
No. Course Category Credit Range
1. Basic Sciences (BSC) 24-30
2. Engineering Sciences (ESC) 15 -20
3. Humanities, Social Sciences and Management 7- 10
4. Professional Courses (PCC) – core 70 - 90
5. Professional Courses (PEC) – elective 18
6. Open Elective Courses (OE) 06
7. Project Work (PROJ) 15
(VII-3,VIII-12)
Seminar on Current Topic 01
8. Internship 03
9. Mandatory Learning courses Non-Credit
Note: Student can register between 16 to 28 credits per semester
Total Credits to be earned : 175
5.2 TheDepartmentUndergraduateCommittee(DUGC)
willdiscussandrecommendtheexactcreditsofferedfortheprogrammefortheabove
components‘a’to‘g’,thesemesterwisedistributionamongthem,as
wellasthesyllabiofallundergraduatecoursesofferedbythe
departmentfromtimetotimebeforesendingthesametotheBoardof
Studies(BOS).TheBOSwillconsidertheproposalsfromthe
departmentsandmakerecommendationstothesenatefor
considerationandapproval.
5.3 TheearnedCreditRequirementfortheB.E.Degreeis 175.

Degreeisawardedbyprescribingthetotalnumberofcreditstobeearned,ratherthanbyusi
ngtheprogramduration,givingflexibilitytostudenttoplantheircareer.
5.4 MandatoryLearning Courses
Thesearecoursesthatmustbecompletedbythestudentatappropriatetimeorathisconv
enience.The‘PP’gradeisawardedforaPassinthecourseand‘NP’gradeisawardedforaFa
ilinthecourse.Incase‘NP’gradeisawarded,thestudenthastore-
registerforthesamecoursewhereinhehasnoalternativeoptions.However,he/shecanopt
forothercoursesifhe/shehasbeenprovidedwithmultipleoptions.
The‘PP’and‘NP’gradesdonotcarrygradepointsandhencenotincludedintheSemester
GradePointAverage(SGPA)andCumulativeGradePointAverage(CGPA)computation
s.Howeversuchnon-
creditmandatorycoursesarerequiredtobeincludedinthestudents’performancerec
ord(transcript)withPassorFail(PPorNP).
Coursesthatcomeunderthiscategoryarethefollowing.
MoralandEthicalValues,Communicationskills,EntrepreneurshipDevelopmentProg
ramme,Environmentalissues,ConstitutionofIndia,ProficiencyinaLanguageetc.
Suchcourseswillnotcarryanycreditsfortheawardofdegree,butapassineachofsuchcour
seduringtheprogrammeshallbeanecessaryrequirementforthestudenttoqualifyfordegr
eeaward.
5.5 PROJECT
i) Projectworkat8thsemestershallbecompletedbatchwise.
Thebatchshallconsistofamaximumof4students.
ii) Project viva-voce examination shall be conducted individually.
5.6 ELECTIVES
i) Acandidateshalltakeelectivesineachsemesterfromgroupsofelectives,commencing
from5thsemester.
ii) The minimum number of students to be registered for an y Elective offered
shall not be less than ten.
iii) A candidate shall opt for his/her choice of electives and
registerforthesameifpre-
registrationisnotdone,atthebeginningofeachof5th,6th,7 thand8thsemesters.The
candidateispermittedtooptforchangeofelectivewithin15daysfromthe date of
commencement of the semester as per the academiccalendarofthecollege.
6. ATTENDANCEREQUIREMENT:
6.1 Eachsemesterisconsideredasaunitandthecandidatehastoputinaminimumattendance
of85%ineachsubjectwithaprovisionofcondoning10%oftheattendancebyPrincipalfo
rreasonssuchasmedicalgrounds,participationinUniversitylevelsports,culturalactiviti
es,seminars,workshopsandpaperpresentation.
6.2 ThebasisforthecalculationoftheattendanceshallbetheperiodoftermprescribedbytheC
ollegebyitscalendarofevents.Forthefirstsemesterstudents,thesameisreckonedfrom
thedateofadmissiontothecourse(asperCET/COMED-KorManagementallotment).
6.3 Thestudentsshallbeinformedabouttheirattendancepositioninthefirstweekofeverymon
thbytheCollegesothatthestudentsshallbecautionedtomakeuptheshortage.
6.4 A candidate having shortage of attendance (<75%) in any
course(s)registeredshallnotbeallowedtoappearforSEEofsuchcourse(s).Suchst
udentswillbeawarded‘NE’gradeinthesecourses.
He/sheshallhavetorepeatthosecourse(s).Suchstudentsshallre-
registerforthesamecourse(s)coreorelective,asthecasemaybewhentheparticularcour
seisofferednexteitherinamain(odd/even)orsupplementarysemester.
6.5 AttendanceinCIEandSEE:AttendanceatallexaminationsbothCIEandSEEofeachco
urseregisteredshallbecompulsoryandthereshallnotbeanyprovisionforre-
examinations.Anystudentagainstwhomanydisciplinaryactionispendingshallnotbep
ermittedtoattendanySEEinthatsemester.
7. WITHDRAWAL FROM THEPROGRAMME

7.1 TemporaryWithdrawal
a) Astudentwhohasbeenadmittedtoadegreeprogrammeofthecollegemaybepermitted
onceduringthecoursetowithdrawtemporarily,foraperiodofonesemester,onthegrou
ndsofprolongedillnessorgravecalamityinthefamilyetc., provided–
i) ThestudentappliestotheCollegewithin6weeksofthecommencementof
thecollege
statingfullythereasonsforwithdrawaltogetherwithsupportingdocument
sandendorsementfromhisparent/guardian.
ii) TheCollegeissatisfiedaboutthegenuinenessofthecaseandthatevenbytakin
gintoaccounttheexpectedperiodofwithdrawal,thestudenthasthepossibilityto
completetheprogrammerequirements(175credits)withinthetimelimitsspec
ifiedbytheuniversity.
iii) ThestudentdoesnothaveanyduesordemandsattheCollege/Universityincludi
ngtuitionandotherfeesaswellaslibrarymaterial.
iv) Astudentavailingoftemporarywithdrawalshallberequiredtopaysuchfeesan
d/orchargesasmaybefixedbythecollegeuntilsuchtimeashis/hernameappe
arsontheStudent’srolllist.Thefees/chargesoncepaidshallnotberefunded.
v) Astudentwillbeentitledtoavail the
temporarywithdrawalfacilityonlyonceduringhis/herstudentship.However,a
nyotherconcession for the
concernedstudentshallhavetobeapprovedbytheacademiccouncil.
7.2 PermanentWithdrawal
AnystudentwhowithdrawsadmissionbeforetheclosingdateofadmissionfortheAcademi
cSessioniseligiblefortherefundofthedepositsonly.Feesoncepaidwillnotberefundedon
anyaccount.
Oncetheadmissionfortheyearisclosed,thefollowingconditionsgovernwithdrawalofad
missions.
(a) AstudentwhowantstoleavetheCollegeforgood,willbe
permittedtodoso(andtakeTransferCertificatefromtheCollege,ifneeded),onlyafter
remittingtheTuitionfeesasapplicable for all the remaining semesters and
clearing all otherduesifany.
(b) Thosestudentswhohavereceivedanyscholarship,stipendorotherformsofassistan
cefromtheCollegeshallrepayall such amounts.
(c) ThedecisionofthePrincipaloftheCollegeregardingwithdrawalofastudentisfinal
andbinding.
8. EVALUATION SYSTEM
8.1 TheAcademicPerformanceEvaluationofastudentshallbeaccordingtoaLetterGradi
ngSystem,basedontheClassPerformanceDistribution.
8.2 TheLettergrades S, A, B, C, D, E, Findicatethelevelofacademic
achievement,assessedonadecimal(0-10)scale.
8.3 TheLettergradeawardedtoastudentinacourse,forwhichhe has
registeredshallbebasedonhisperformanceinquizzes,tutorials,assignmentsetc.,as
applicable,inadditiontotwomid-semester
examinationsandonesemesterendexamination.Thedistributionof
weightageamongthesecomponentsmaybeasfollows.
SemesterEndExamination(SEE) : 50%(50marks)
ContinuousInternalEvaluation(CIE) : 50% (50 marks)
i) Quizzes,Tutorials,Assignments,
Seminars, m iniprojects,tutorialsetc. : 10marks
ii) Mid-semesterExamination : 40marks
Anyvariation,otherthantheabovedistribution,requirestheapprovalofthepertinentDU
GCandAcademicCouncil.
8.4 The letter grade awarded to a studentin a 0-0-P (Practical) course,is

basedonanappropriatecontinuousevaluationschemethatthe course instructor shall
evolve, with the approval of the
pertinentDUGCandtheperformanceinSEEheldonspecifiedperiodinasemester.
8.5 ThecourseInstructorshallannounceintheclassand/ordisplayattheFacultydoor/websit
ethedetailsoftheEvaluationScheme,including the
distributionoftheweightageforeachofthecomponentsand
methodofconversionfromtherawscorestotheletter-gradeswithin
thefirstweekofthesemesterinwhichthecourse isoffered, so
thattherearenoambiguitiesincommunicatingthesametoallthe
studentsconcerned.
8.6 Passing standards
EvaluationMethod Passing Standard

Sessional(CIE) Score:≥40%(≥20marks)
Terminal(SEE) Score:≥40%(≥20marks)
i) Projectworkevaluation:TheevaluationofCIEoftheprojectworkshallbebasedonth
eprogressofthestudentinthework assigned by the project supervisor,
periodically
evaluatedbyhim/hertogetherwithaDepartmentcommitteeconstitutedforthis
purpose.Seminarpresentation,projectreport and final oral examination
conducted by
projectevaluationcommitteeatthedepartmentlevelshallformtheSEEoftheproject
work.
ii) Inthecaseofotherrequirements,suchas,seminar,industrialinternship,fieldwork,c
omprehensivevivavoce,ifany,theassessmentshallbemadeaslaiddownbytheAc
ademiccouncil.
iii) Thereshallbenore-examinationforanycourseinthecreditsystem.
However, students
 whohaveabstainedfromattendingCIEorSEEwithoutvalidreasons(‘NE’gr
ade),or
 whohavefailed(‘F’grade)tomeettheminimumpassingstandardsprescri
bedforCIEand/or SEE,or
 whohavebeendetainedforwantofattendance,or
 whohavewithdrawn(‘W’grade),
 whohavedroppedanycourse
shallberequiredtore-
registerforsuchcourse(s)andgothroughCIEandSEEagainandobtainagradeequalt
oorbetterthanEineachcase.Whilesuchstudents shouldre-
registerforsamecourse(s)ifcore,theycanre-registerforalternativecourse(s)
fromamongtheelectivecourses,asthecasemaybe.There-
registrationshallbepossiblewhentheparticularcourseisofferedagaineitherinamain
(Odd/Even)orasupplementarysemester.
8.7 i) Gradepointscaleforabsolutegrading
Level Out Excellent Very Good Average Poor Fail
Standing Good
Grade S A B C D E F
GradePoints
10 09 08 07 06 04 00
Score
(Marks)
≥ 90 < 90 - < 80- < 70- < 60 - < 50 - < 40
Range
≥80 ≥70 ≥60 ≥50 ≥40
(%)
ii)
Thegradepointsgivenabovehelpintheevaluationofcreditpointsearnedbythestudentinaco
urseasthecreditpointsareequaltothenumberofcreditsassignedtothecoursemultipliedbyt
hegradepointsawardedtothestudentinthatcourse.Thisshallbeusedinarrivingatthecrediti
ndexofthestudentforthatsemester,asitisthesumtotalofallthecreditpointsearnedbythest
udentforallthecoursesregisteredinthatsemester.
8.8 EarningofCredits
Astudentshallbeconsideredtohavecompletedacoursesuccessfullyandearnedthecre
ditsifhe/shesecuresanacceptableletter grade in the range S-E. Letter grade ‘F’ in any
course impliesfailureofthestudentinthatcourseandnocreditsearned.
8.9 TheTransitionalGrades‘I’,‘W’and‘X’wouldbeawardedbythe
teachersinthefollowingcases.
Thesewouldbeconvertedintooneortheotherofthelettergrades(S-
F)afterthestudentcompletesthe courserequirements.
1. Grade‘I’:Toastudenthavingsatisfactoryattendanceatclassesandmeetingthepass
ingstandardatCIE,butremainedabsentfromSEEforvalid&convincingreasonsacc
eptabletotheCollege,like:
i) Illness or accident, which disabled him/her fromattendingSEE;
ii) AcalamityinthefamilyatthetimeofSEE,whichrequiredthestudenttobeawayfro
mtheCollege;
2. Students who remain absent for Semester End Examinations due to valid
reasons and those who are absent due to health reasons are required to
submit the necessary documents along with their request to the Controller of
Examinations to write Make up Examinations within 2 working days of that
particular examination for which he or she is absent, failing which they will not
be given permission. This is admissible only for students who have more than
45 CIE marks.
3. Grade‘W’:Toastudenthavingsatisfactoryattendanceatclasses,butwithdrawingf
romthatcoursebeforetheprescribeddateinasemesterunderFacultyAdvice
4. Grade‘X’:
Toastudenthavingattendance≥85%andCIErating(90%),inacoursebutSEEperfor
manceobservedtobepoor,whichcouldresultinaFgradeinthecourse.(No
‘F’grade awarded in this case but student’s performance record
maintained separately).
5. GradeCard:EachstudentshallbeissuedaGradeCard(orTranscript)attheendof
eachsemester.Thiswillhavealistofallthecoursesregisteredbyastudentinthesem
ester,togetherwiththeircredits,thelettergradeswithgradepointsawarded.On
lythosecoursesregisteredforcreditandhavinggradepointsshallbeincludedinthe
computation of the students performance like SGPA and
CGPAandthecoursestakenforauditwillnotformpartofthiscomputation.Theres
ultsofmandatorycourses,whichareofthenon-
credittypeshallalsobereflectedintheGradecardasPP(forPassed)orNP(fornotpas
sed).EachUGstudentshallhavetoobtainthegradePPineachmandatorycour
setoqualifyfortheDegreeawardedbytheuniversity.
6. THEMAKEUPEXAMINATION
TheMakeUpExaminationfacilitywouldbeavailabletostudentswhomayhavemissedtoatt
endtheSEEofoneormorecourse(s)inasemesterforvalidreasonsandgiventhe‘I’grade;
Also,studentshavingthe‘X’gradeshallbeeligibletotakeadvantageofthisfacility.Themak
eupexaminationwouldbeheldasperdatesnotifiedintheAcademicCalendar.However,it
wouldbepossibletoholdamakeupexaminationatanyothertimeinthesemesterwiththepe
rmissionoftheAcademicCouncilofthe College.
Inallthesecases,thestandardofmakeupexaminations
shallbesameastheregularSEEforthecourse(s).
1. IntheeventofastudentinthefinalsemesterfailinginaLaboratorycourseand/orinCI
Eofacourse,he/shecouldbegiven‘I’gradeforthecourse.Insuchacasetheconcern
edcourse
instructorwouldhavethepossibilitytograntthestudentextratimenotexceeding12
weeksforcompletingthecourse,withtheconcurrenceoftheDepartment/College.If
nosuchextratimeissought/granted,theconcernedstudentwouldhavetore-
registerforthecourseinasucceedingsemesterandtakestepstofulfilltherequirem
entsoftheDegree.
2. Allthe‘I’and‘X’gradesawardedtothestudentswouldbeconvertedtoappropriatele
ttergrades after the make-up
examinations.Anyoutstanding‘I’and‘X’gradesafterthelastscheduledmake-up
examinations shallbeautomaticallyconvertedto‘F’grade.
3. Allthe‘W’gradesawardedtothestudentswouldbeeligibleforconversiontotheappr
opriatelettergradesonly aftertheconcernedstudentsre-
registerforthesecoursesin
amain/supplementarysemesterandfulfillthepassingstandardsfortheirCIEand(C
IE+SEE).
9. EVALUATION OFPERFORMANCE
Theoverallperformanceofastudentwillbeindicatedbytwoindices:
SGPA;whichistheSemesterGradePointAverage,andCGPAwhichistheCumulativeGr
adePointAverage.
SGPAforasemesteriscomputedasfollows.
∑ [(coursecredit)X(Gradepoint)](forallcoursesinthatsemester)
SGPA =
∑[(course credits)]
CGPAiscomputedasfollows:
∑[(coursecredits)X(Gradepoints)](forallcoursesexcludingthosewithFgradesu
ntilthatsemester)
CGPA =
∑(coursecredits)](forallcoursesexcludingthosewithFgradesuntilthatsemest
er)
10. COMMUNICATIONOFGRADES
TheSGPAandCGPArespectively,facilitatethedeclarationofacademicperformanceof
astudentattheendofasemesterandattheendofsuccessivesemesters.Bothofthemwo
uldbenormallycalculatedtotheseconddecimalposition,sothattheCGPA,inparticular,c
anbemadeuseofinrankorderingthestudents’performanceataCollege.Iftwostudentsg
etthesameCGPA,thetiecouldberesolvedbyconsideringthenumberoftimesastudentha
sobtainedhigherSGPA;But,ifitisstillnotresolved, the number of times a student has
obtained higher gradeslikeS,A,Betc.couldbetakenintoaccount.
11. Vertical progression (Promotion / Eligibility to higher semesters)

11.1 There shall be no restriction for promotion from an odd semester to the next even
semester, provided the student has fulfilled the attendance requirement.
11.2 A Student shall be declared fail if he / she
(i) Has not satisfied the CIE requirements of any Course/s.
(ii) Has not registered for the SEE even after satisfying the attendance and CIE
requirements.
11.3 (A) Vertical Progression in case of students admitted to First year:
(a) Students having not more than four F grades in the two semesters of first year
of the Programme shall be eligible to move to second year.
(a.1) Students having not more than four F grades in the four semesters of I and
II year shall be eligible to move to III year.
(a.2) Students who have earned all the prescribed credits of I year, and having
not more than four F grades in the four semesters of II and III year shall be
eligible to move to IV year.
(B) Vertical Progression in case of Diploma students admitted to Second year

(lateral entry):
(a) Students having not more than four F grades (excluding the Fail or pass status
of Additional Mathematics I and II) in the two semesters of II year of the
Programme shall be eligible to move to III Year.
(a.1) Students having not more than four F grades (excluding the Fail or pass
status of Additional Mathematics I and II, if any) in the four semesters of II
and III year shall be eligible to move to IV year.
(b) The mandatory non-credit Courses Additional Mathematics I and II prescribed

at III and IV semesters respectively, to lateral entry Diploma holders admitted
to III semester of B.E/B.Tech. Programmes shall attend the classes during the
respective semesters to satisfy attendance and CIE requirements and to
appear for the University examinations.
(b.1) In case, any student fails to satisfy the attendance requirement of the
Courses Additional Mathematics I and II, he/she shall not be eligible to
appear for the Semester End Examinations of that semester and shall not be
permitted to take admission to next higher semester. The candidate shall be
required to repeat that semester during the subsequent year.
(b.2) Students who have satisfied the attendance requirement but not the CIE
requirements of the Courses Additional Mathematics I and II shall be
p e rm it t e d t o r e g is t e r a f r es h a nd a p p e a r f or S E E a f t er s a t isf yi n g t h e C I E
requirements in the sam e Course/s (with or without satisfying the
attendance requirement) when offered during subsequent semester/s.
(c) Completion of Additional Mathematics I and II shall be mandatory for the

award of degree.
(C) Vertical Progression in case of B.Sc students admitted to Second year

(Lateral entry):
(a) Students having not more than four F grades (excluding the Fail or pass status
of Engineering Graphics and Elements of Civil Engineering and Mechanics of
First Year Engineering Programme) in the two semesters of II year of the
Programme shall be eligible to move to III year.
(a.1) Students having not more than four F grades (excluding the Fail or pass
status of Engineering Graphics and Elements of Civil Engineering and
Mechanics of First Year Engineering Programme, if any) in the four semesters
of II and III year shall be eligible to move to IV year.
(b) The prescribed mandatory non-credit Courses Engineering Graphics and

Elements of Civil Engineering and Mechanics of First Year Engineering
Programme to lateral entry B. Sc holders admitted to III semester of B.E/B.
Tech Programmes, shall attend the classes during the respective semesters to
complete CIE and attendance requirements and to appear for the University
examinations.
(b.1) In case, any student fails to satisfy the attendance requirement of the
above said Courses; he/she shall not be eligible to appear for the
Semester End Examinations of that semester and shall not be permitted
to take admission to next higher semester. The candidate shall be
required to repeat that semester during the subsequent year.
(b.2) Students who have satisfied the attendance requirement but not the CIE
requirements of the above said Courses, shall be permitted to register afresh
and appear for SEE after satisfying the CIE requirements in the same
Course/s (with or without satisfying the attendance requirement) when offered
during subsequent semester/s.
(c) Completion of Engineering Graphics and Elements of Civil Engineering and

Mechanics shall be mandatory for the award of degree.
The Principal of each college shall make suitable arrangements in the timetable to
facilitate the B. Sc students to attend the above mentioned courses to satisfy the
CIE and attendance requirements and to appear for the University examinations.
11.4 Termination from theprogramme

Astudentshallberequiredtowithdraw(discontinue)fromtheprogrammeandleavethecol
legeonthefollowinggrounds.
i) FailuretosecureaCGPA=5.0onthreeconsecutiveoccasions.
ii) Failuretoearnacreditof175(135forlateralentrystudents)in8years
(6yearsforlateralentrystudents)ofdurationfromtheyearofadmissioninclu
dingthedurationoftemporarywithdrawal(leaveofabsence).
iii) Absencefromclassesformorethansixweeksatatimeinasemesterwithoutleave
ofabsencebeinggrantedbycompetentauthorities.
iv) Failuretomeetthestandardsofdisciplineasprescribedbythecollegefromtimetotim
e.
12. AWARDOFCLASS
Sometimes, itwould be necessarytoprovide equivalence of
theseaverages,viz.,SGPAandCGPAwiththepercentagesand/orClassawardedasinthe
conventionalsystemofdeclaringtheresultsofUniversityexaminations.Thiscanbedoneb
yprescribingcertain specific thresholdsinthese averages
forDistinction,FirstClassandSecondClass.ThiscanbeseenfromthefollowingTable.
PercentageEquivalenceofGradePoints(Fora10-PointScale)
GradePoint PercentageofMarks
5.75 50 (secondclass)
6.25 55
6.75 60 (Firstclass)
7.25 65
7.75 70(Distinction)
8.25 75
Percentage = (GPA - 0.75) x 10
13. APPEAL FORREVIEWOFGRADES
a. Theentireprocessofevaluationshallbemadetransparentandthecourseinstru
ctorshallexplaintoastudentwhyhe/shegetswhatevergradehe/sheisawarded
,ifandwhenrequired.A
mechanismforreviewofgradeisincorporatedintheevaluationsystem.However
,beforeappealingforsuchreview,astudentshallfirstapproachtheconcernedco
urseInstructorandthentheconcernedDUGC,withtherequesttodotheneedful;a
ndonlyinsituationswheresatisfactoryremedialmeasureshavenotbeentaken,
thestudentmaythenappealtotheDepartmentAcademicAppealsBoards(DAAB
)beforethedatespecifiedin AcademicCalendar,bypayingtheprescribed fees.
b. ThefeeforsuchanappealwillbedecidedbytheSenatefromtimetotime.Iftheappe
alisupheldbyDAAB,thenthefeeamountwillberefundedtothestudent.
14. AWARD OF DEGREE

14.1 (1) B.E. Degree
a) Students shall be declared to have completed the Programme of B.E./B.Tech.
degree and is eligible for the award of degree, provided the students have
undergone the stipulated Course work of all the semesters under the Scheme
of Teaching and Examinations and has earned the prescribed number of
credits (175 credits for regular students registered for 4 year degree
programmes& 135 for lateral entry students).
b) For the award of degree, a CGPA≥5.00 at the end of Programme shall be
mandatory.
c) Completion of Additional Mathematics I and II, shall be mandatory for the award
of degree to lateral entry diploma students.
d) Completion of Engineering Graphics and Elements of Civil Engineering and
Mechanics of First Year Engineering Programme shall be mandatory for the
award of degree to lateral entry B.Sc. graduates.
e) (i) Over and above the academic credits, every Day College regular student
admitted to the 4 years Degree Programme and every student entering 4 years
Degree Programme through lateral entry, shall earn 100 and 75 Activity Points
respectively through AICTE Activity Point Programme for the award of degree.
Students transferred from other Universities/Autonomous colleges under VTU
to fifth semester are required to earn 50 Activity Points from the year of entry to
VTU. The Activity Points earned shall be reflected on the student’s eight
semester Grade Card.
(ii) Activity Points (non-credit) have no effect on SGPA/CGPA and shall not
be considered for vertical progression.
In case students fail to earn the prescribed activity Points before the
th
commencement of 8 semester examinations, eighth semester Grade Card
shall be issued only after earning the required activity Points. Students shall
be admitted for the award of degree only after the release of the Eighth
semester Grade Card.
(2)B.E. (Honors) Degree
VTU, Belagavi has framed the guidelines for applying for the award of Bachelor of
Engineering (Honors) degree.
These Regulations are applicable for the following students:
1. Admitted to I semester / I year from the academic year 2018-19(i.e. USN
XXX18XXXXX)
2. Admitted to III semester / II year from the academic year 2019-20 (i.e.
USN XXX19XX4XX)
3. These Regulations are uniformly applicable to Affiliated, Autonomous and
Constituent Colleges under VTU.
Eligibility criterion
(i) Students have to earn 18 or more additional credits through MOOCs.
(ii) Students shall register for this course from fifth semester onwards.
(iii) Students shall obtain a grade ≥ D in all the courses in first attempt only in
th
all the semesters till 5 .
(iv) Students shall obtain CGPA of 8.5 and above at the end of fourth semester.
(v) For Diploma students, they shall complete Additional Mathematics I and II
rd th
during 3 and 4 semesters in first attempt only.
Requirements:
th th
(i) Students shall maintain a grade D in all courses from 5 to 8 semester in
‘first attempt’ only.
(ii) Students not having CGPA greater than or equal to 8.5 at the end of the
B.E. programme shall not be eligible for the award of Honors degree, even
if they have satisfied the requirement of additional credits.
(iii) Students shall take up additional course work, other than the regular
th th
courses prescribed by the University from 5 to 8 semester from NPTEL
and other platforms notified by the University and complete the same in any
number of attempts with a final score (online assignments: 25 % +
Proctored examination: 75 %) leading to the following certificates – ELITE
(60 to 75 %) or ELITE + SILVER (76 to 89 %) or ELITE + GOLD ( ≥ 90 %)
before closure of eighth semester as per the academic calendar.
(iv) Students shall be permitted to drop the registered course work (s) and
select alternative course work (s) in case they cannot give proctored
examination.
(v) Students have to take courses from the list of MOOCs approved by the
University, which can be from NPTEL / SWAYAM / other platforms.
(vi) Students shall select courses in consultation with their Class Advisor, such
that the content / syllabus of them are not similar to that of the core
courses, professional electives or open electives, which the students may
chose in the program.
(vii) Students shall earn the additional credits for these courses through MOOCs,
by only appearing in person to the proctored examinations conducted by
NPTEL / SWAYAM / other platform. The method of assessment shall be as
per NPTEL online platform.
(viii) The Credit equivalence shall be as follows - 4 weeks of online course
duration – 1 credit, 8 weeks of online course duration – 2 credits and 12
weeks of online course duration – 3 credits.
Registration:
(i) Any student meeting the eligibility criteria and interested to register for
Honors degree qualification shall apply to the University through the
Principal in the prescribed form along with the prescribed application fees
within 15 working days after notification by the University.
(ii) The Registrar shall notify the registration of the student and it will be
notified to the student and the student shall pay a one-time, non-refundable
registration fees as prescribed by the University to confirm the registration.
Award of Honors Qualification:
(i) Students who successfully complete the MOOCs prescribed by the
University and submit their E-certificates to the University through the
Principal against the notification issued by the Registrar in time before the
closure of eighth semester, as per the academic calendar shall be eligible
for B.E. (Honors) degree. If a student does not submit the certificates in
time on or before the last date, their request shall not be considered, even if
they have earned the requisite number of credits.
(ii) The Honors degree shall be awarded only if the CGPA at the end of the
B.E. programme is equal to or greater than 8.5.
(iii) A student who has earned the requisite number of credits and who has
submitted the certificates in time and has been accepted by the University
will get B.E. degree with Honors suffixed indicating recognition of higher
achievement by the student concerned.
(iv) Further students fulfilling all the above requirements shall be entitled to
receive their transcripts indicating both the achievement of the student
concerned.
(v) The award of the Honors degree shall be recommended by the Academic
Senate and approved by the Executive Council of the University.
14.2 (1)Noncompliance of CGPA ≥ 5.00 at the end of the Programme
(a) Students, who have completed all the courses of the Programme but not
having a CGPA ≥ 5.00 at the end of the Programme, shall not be eligible for
the award of the degree.
(b) In the cases of 14.2 (1) a, students shall be permitted to appear again for SEE
in course/s (other than Internship, Technical seminar, Project (Mini and Main),
and Laboratories) of any Semester/s without the rejection of CIE marks for any
number of times, subject to the provision of maximum duration of the
Programme to make up the CGPA equal to or greater than 5.00 for the award
of the Degree.
(c) In case, the students earn improved grade/s in all the reappeared course/s,
the CGPA shall be calculated considering the improved grade/s. If it is ≥5.00,
the students shall become eligible for the award of the degree. If CGPA <5.00,
the students shall follow the procedure laid in 14.2 (1) b
(d) In case, the students earn improved grade/s in some course/s and the same
or lesser than the previously earned pass grade/s in the other reappeared
course/s, the CGPA shall be calculated considering the improved grade/s and
the pass grades earned before the reappearance. If it is ≥5.00, the students
shall become eligible for the award of the degree. If CGPA<5.00, the students
shall follow theprocedure laid in 14.2 (1) b
(e) In case, the students earn improved grade/s in some courses and fail in the
other reappeared course/s, the CGPA shall be calculated by considering the
improved grade/s and the previously earned pass grade/s of the reappeared
course/s in which the students have failed. If it is≥5.00, the students shall
become eligible for the award of the degree. If CGPA <5.00, the students
shall follow the procedure laid in 14.2 (1) b
(f) In case, the students fail (i.e., earns F grade) in all the reappeared course/s,
pass grade/s of the course/s earned by the students before reappearance
shall be retained. In such cases, the students shall follow the procedure laid in
14.2 (1) b
(g) Students shall obtain written permission from the Registrar (Evaluation) to
reappear in SEE to make up the CGPA equal to or greater than 5.00.
(2) Noncompliance of Mini-project

(a) The mini-project shall be considered as a head of passing and shall be
considered for the award of degree. Those, who do not take-up/complete the
mini-project shall be declared fail in that course and shall have to complete the
same during subsequent University examinations after satisfying the Mini-
project requirements. Also, mini-project shall be considered for eligibility to VII
semester.
(3) Noncompliance of Internship
(a) All the students of B.E/B.Tech shall have to undergo mandatory internship of 4
weeks during the vacation. A University examination shall be conducted
during VIII semester. Internship shall be considered as a head of passing and
shall be considered for the award of degree. Those, who do not take-
up/complete the internship shall be declared fail in that Course and shall have
to complete the same during subsequent University examinations after satisfy
the internship requirements.
14.3 The maximum duration for a student for complying to the Degree
requirements is 16 – semesters from the date of first registration for his first
semester (8 years from the date of admission to first year, (12 semesters / 6
years from the date of admission for lateral entry student)).
15 GRADUATIONREQUIREMENTS ANDCONVOCATION
15.1 Astudentshallbedeclaredtobeeligiblefortheawardofthedegreeifhe/shehas
a) Fulfilled “ A w a r d o f Degree”Requirements
b) No Dues to the College, Departments, Hostels, Library,
CentralComputerCentreandanyothercentres
c) Nodisciplinaryactionpendingagainsthim/her.
15.2 TheawardofthedegreemustberecommendedbytheSenate
15.3 Convocation
Degreewillbeawardedforthestudentswhohavegraduatedduringtheprecedingacade
micyear.StudentsarerequiredtoapplyfortheConvocationalongwiththeprescribe
dfees,afterhavingsatisfactorily completed all the degree requirements (refer
‘Award of
Degree’)withinthespecifieddateinordertoarrangefortheawardofthedegreeduringconv
ocation.
16 AWARDOFPRIZES,MEDALS,CLASS&RANKS
FortheawardofPrizesandMedals,theconditionsstipulatedbytheDonormaybeconsider
edasperthestatutesframedbytheCollegeforsuchawards.
Sometimes,itwouldbenecessarytoprovideequivalenceoftheseaverages,viz.,SGPAa
ndCGPAwiththepercentagesand/orClassawardedasintheconventionalsystemofdecl
aringtheresultsofUniversityexaminations.Thiscanbedoneby prescribing
certainspecific thresholdsinthese averages
forDistinction,FirstClassandSecondClassasdescribedin12.
17 CONDUCTANDDISCIPLINE
17.1 Students shall conduct themselveswithin and outsidethe
premisesoftheCollegeinamannerbefittingthestudentsofanInstitutionofNationalImpor
tance.
17.2
AspertheorderofHonorableSupremeCourtofIndia,ragginginanyformisconsid
eredasacriminaloffenceandisbanned.
Anyformofraggingwillbeseverelydealtwith.
17.3 Thefollowingactsofomission/orcommissionshallconstitutegrossviolationoftheCodeof
Conductandareliabletoinvokedisciplinarymeasures:
a) Ragging.
b) Lackofcourtesyanddecorum;indecentbehaviouranywherewithi norouts idethec
ampus.
c) Willful damage or stealthy removal of any
property/belongingsoftheCollege/Hosteloroffellowstudents/citizens.
d) Possession,consumptionordistributionofalcoholicdrinksoranykindofhallucinog
enicdrugs.
e) MutilationorunauthorizedpossessionofLibrarybooks.
f) Noisyandunseemlybehaviour,disturbingstudiesoffellowstudents.
g) Hackingincomputersystems(suchasenteringintootherPerson’sareawithoutpri
orpermission,manipulationand/orDamageofcomputerhardwareandsoftwareo
ranyotherCybercrimeetc.).
h) Plagiarismofanynature.
i) AnyotheractofgrossindisciplineasdecidedbytheSenatefromtimetotime.
j) UseofMobileinthecollegeAcademicarea.
k) SmokinginCollegeCampusandsuparichewing.
l) Unauthorizedfundraisingandpromotingsales.
Commensuratewiththegravityofoffencethepunishmentmaybe:
reprimand,expulsionfromthehostel,debarringfroman examination, disallowing the
use of certain facilities of the
College,rusticationforaspecifiedperiodorevenoutrightexpulsionfromtheCollege,orev
enhandingoverthecasetoappropriatelawenforcement authorities orthe judiciary,
asrequired by thecircumstances.
17.4 Foranoffencecommittedin(i)ahostel(ii)adepartmentorinaclassroomand(iii)elsewhere
,theChiefWarden,theHeadoftheDepartmentandtheDean(Academics),respectively,s
hallhavetheauthoritytoreprimandorimposefine.
17.5 AllcasesinvolvingpunishmentotherthanreprimandshallbereportedtothePrincipal.
17.6 Casesofadoptionofunfairmeansand/oranymalpracticeinanexaminationshallbereport
edtotheControllerofExaminationsfor takingappropriateaction.
18. EARNING OF ACTIVITY POINTS FOR THE AWARD OF DEGREE

18.1 As per VTU guidelines, every students entering 4 year degree programme should
earn 100 activity points & every students entering 4 year degree programme
through Lateral Entry should earn 75 activity points for the award of the Engineering
Degree.
18.2 The Activity Points earned will be reflected on the student’s eighth semester Grade
Card.
18.3 The activities can be spread over the years (duration of the programme) any time
during the semester weekends and holidays, as per the interest & convenience of
the students from the year of entry to the programme.
18.4 Activity Points (non-credit) have no effect on SGPA/CGPA point.
18.5 In case students fail to earn the prescribed Activity Points, Eighth semester Grade
Card shall be issued only after earning the required Activity Points.
Note: Students are required to be inside the examination hall, 20 minutes
before the commencement of examination. This is applicable for all
examinations (Semester end/Supplementary/makeup) henceforth. Students
will not be allowed inside the examination hall after the commencement,
under any circumstances.
**********
LISTOFMAJORSCHOLARSHIPS
Applicable Types of scholarship Method Website
to
For Income : Below Online
SC/ST Rs.2,50,000/- application
Students
Income : Above Hardcopy Will be published

Rs.2,50,000/- to in the
Rs.10,00,000/- Notice Board
Category I : Online
application
For Others Category 2A, 3A, 3B,& Online

GM application
Income Below
Rs.1,00,000/-
Minority students Online

Income Below application
Rs.2,50,000/-
Parents Beedi Scholarship Online scholarships.gov.in

must have application or
Beedi Id. nsp.gov.in
Card
st
1 year Central Sector Online scholarships.gov.in
Students Scholarship (MHRD) application or
nsp.gov.in
st
1 year AICTE-Pragati.etc Online www.aicte-india.org
Students application
1. Scholarship details will be published in the notice board near College Academic
Section. Students must see the notice board and submit the application before
due dates.
2. All SC/ST and Category I students who have not paid any fee in CET must apply
for Fee concession or Scholarship. Otherwise they must pay the tuition fee and
college fee.
3. The students, who are applying for any of the above scholarship through online,
must submit the hardcopy with supporting documents (with attestation) to the
academic section in time.
DEPARTMENT: COMPUTER SCIENCE & ENGINEERING

Sl.
Faculty Name Qualification Designation
No.
1. Dr. Niranjan N. Chiplunkar Ph.D Professor &

Principal
2. Dr. Jyothi Shetty Ph.D Professor & Head
3. Dr. D. K. Sreekantha Ph.D Professor
4. Dr. Sarika Hegde Ph.D Asso. Prof
5. Dr. Venugopala P.S. Ph.D Asso. Prof
6. Dr. Roshan Fernandes Ph.D Asso. Prof
7. Dr. Sudeepa K.B Ph.D Asso. Prof
8. Dr. Aravinda C V Ph.D Asso. Prof
9. Dr. Vikram Raju R Ph.D Asso. Prof

10. Dr. Radhakrishna Ph.D Asso. Prof
11. Mr. Raju K M.Tech, (Ph.D) Asso. Prof
12. Mr. Pradeep Kanchan M.Tech. (Ph.D) Asst. Prof Gd III
13. Mr. VijayaMurari T. M.Tech. (Ph.D) Asst. Prof Gd III
14. Mrs. Pallavi K N M.Tech. ( Ph.D) Asst. Prof Gd III
15. Dr. Anisha P Rodrigues Ph.D Asst. Prof Gd III
16. Mr. Ganesh Pai M.Tech. (Ph.D) Asst. Prof Gd III
17. Mr. Raghunandan KR M.Tech. (Ph.D) Asst. Prof Gd II
18. Mr. RameshaShettigar M.Tech. Asst. Prof Gd II
19. Mrs. Minu P. Abraham M.Tech. (Ph.D) Asst. Prof Gd II
20. Mr. SampathKini M.Tech. Asst. Prof Gd II
21. Mr. Mahesh Kini. M M.Tech. Asst. Prof Gd II
22. Mrs. AsmitaPoojary M.Tech. (Ph.D) Asst. Prof Gd II
23. Ms. Shruthi M M.Tech. (Ph.D) Asst. Prof Gd II
24. Ms. Keerthana B. Chigateri M.Tech. (Ph.D) Asst. Prof Gd II
25. Mr. Sannidhan M.S M.Tech. (Ph.D) Asst. Prof Gd II
26. Mr. Sandeep Kumar Hegde M.Tech. (Ph.D) Asst. Prof Gd II
27. Mrs. Shwetha G K M.Tech, (Ph.D) Asst. Prof Gd II
28. Mrs. Savitha M.Tech. (Ph.D) Asst. Prof Gd II
29. Dr. ShabariShedthi. B Ph.D Asst. Prof Gd II
30. Mr. Krishna Prasad Rao M.Tech. Asst. Prof Gd II
31. Mr. Puneeth R. P M.Tech. Asst. Prof Gd II
32. Mrs. Rajalaxmi S Hegde M.Tech. (Ph.D) Asst. Prof Gd II
33. Mrs. Manasa G.R M.Tech. Asst. Prof Gd II
34. Mr. Shashank Shetty M.Tech, (Ph.D) Asst. Prof Gd II
35. Mr. Pawan Hegde M.Tech. Asst. Prof Gd II
36. Mr. Sunil Kumar Aithal M.Tech. Asst. Prof Gd II
37. Mrs. Divya Jennifer D’Souza M.Tech. (Ph.D) Asst. Prof Gd I
38. Ms. Ankitha A Nayak M.Tech. (Ph.D) Asst. Prof Gd I
39. Ms. Rajashree M.Tech. Asst. Prof Gd I
40. Mrs. ShilpaKaregoudar M.Tech. Asst. Prof Gd I
41. Mrs. AnushaAnchan M.Tech. Asst. Prof Gd I

42. Mrs. JoylinPriya Pinto M.Tech Asst. Prof Gd I
43. Mrs. Aishwarya D. Shetty M.Tech Asst. Prof Gd I
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

VISION:
To be a center of excellence in Computer science & Engineering education and research,
empower the lives of individuals to fulfill their academic excellence, professional passions,
and partnership for community development.
MISSION:
 To impart both theoretical and practical knowledge through the state-of-the-art
concepts and technologies in Computer Science and Engineering.
 To inculcate values of professional ethics, leadership qualities and lifelong learning.
 To prepare professionals for employment in industry, research, higher education,
and entrepreneurship to benefit the society.
Program Educational Objectives (PEOs):
After three years of graduation, our graduates in Computer Science & Engineering should
be able to:
1. Apply appropriate theory, practices, and tools to the specification, design,
implementation, maintenance, and evaluation of software systems of Computer
Science & Engineering in the workplace, for advanced studies or for societal needs.
2. Function effectively in the workplace or maintain employment through lifelong
learning such as professional conferences, certificate programs or other
professional educational activities, ethics, and societal awareness.
3. Contribute to their computing profession and society by working in teams to design,
implement, and/or maintain components of computer software systems.
Program Outcomes (POs):

Engineering Graduates will be able to:
1. Engineering knowledge: Apply the knowledge of mathematics, science,
engineering fundamentals, and an engineering specialization to the solution of complex
engineering problems.
2. Problem analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first principles
of mathematics, natural sciences, and engineering sciences.
3. Design/development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified needs
with appropriate consideration for the public health and safety, and the cultural, societal,
and environmental considerations.
4. Conduct investigations of complex problems: Use research-based knowledge

and research methods including design of experiments, analysis and interpretation of
data, and synthesis of the information to provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge
to assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
7. Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities
and norms of the engineering practice.
9. Individual and team work: Function effectively as an individual, and as a member
or leader in diverse teams, and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with
the engineering community and with society at large, such as, being able to
comprehend and write effective reports and design documentation, make effective
presentations, and give and receive clear instructions.
11. Project management and finance: Demonstrate knowledge and understanding of
the engineering and management principles and apply these to one’s own work, as a
member and leader in a team, to manage projects and in multidisciplinary
environments.
12. Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.
Program Specific Outcomes (PSOs):
1. Foundations of Computing: Apply the knowledge of principles and working of the
hardware and/or software aspects of computer systems in the domains of Systems
Engineering, Network Engineering, Software Engineering, Data Engineering and
Intelligent Systems.
2. Foundations of Software Design & Development: Design & develop algorithms,
programs, and projects using modern software tools for the solution of engineering
problems in the discipline.
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHEME OF TEACHING AND EXAMINATION
VII SEMESTER B.E.
Sub.
Sl. Subject L+T+P Credits
Code C.I.E S.E.E
No.
1 18CS701 Software Testing 3+0+0 50 50 3
2 18CS702 Compiler Design 3+0+0 50 50 3
3 18CSEXX Elective-IV 3+0+0 50 50 3

4 18CSEXX Elective-V 3+0+0 50 50 3
5 OEC Open Elective-I 3+0+0 50 50 3
6 18CS703 Project Phase-I 0+0+6 50 -- 3
7 18CS704 Seminar 0+2+0 50 -- 1
Software Testing
8 18CS705 0+0+2 50 50 1
Lab
Compiler Design
9 18CS706 0+0+2 50 50 1
Lab
TOTAL 450 350 21
SCHEME OF TEACHING AND EXAMINATION

VIII SEMESTER B.E.
Sub. Theory
Sl. No. Subject Credits
Code /Tuto. /Prac. C.I.E S.E.E
1 18CSEXX Elective-VI 3+0+0 50 50 3
2 18XXXXX Open Elective-II 3+0+0 50 50 3
3 18CS801 Project Phase-II 0+0+24 100 100 12
4 18CS802 Internship 0+6+0 50 50 3

Total 250 250 21
PROFESSIONAL CORE ELECTIVES

Group – 1 Group – 2
Architecture, Embedded Systems & General
Course Course
Course Name Course Name
Code Code
PARALLEL COMPUTER
18CSE11 ARCHITECTURE & 18CSE21 Internet of Things
PROGRAMMING
18CSE12 Embedded Systems 18CSE22 Adv. Compilation Tech.
18CSE13 Operations Research 18CSE23 Advanced Algorithms
Advanced Computer
18CSE14 CAD for VLSI & VHDL 18CSE24
Architecture
Software Engineering & Development
Course Course
Code Code
18CSE31 Advanced Unix Programming 18CSE41 Web Programming
18CSE32 Program Verification 18CSE42 Mobile App Development
18CSE33 Cloud Computing 18CSE43 Software Architecture
Object Oriented Modeling
18CSE44
and Design
Systems, Networks & Security
Course Course
Code Code
18CSE51 System Simulation & Modelling 18CSE61 Distributed Systems
18CSE52 Signals & Systems 18CSE62 Digital Signal Processing
18CSE53 Ad hoc Wireless Networks 18CSE63 Adv. Computer Networks
18CSE54 Cryptography & Network Security 18CSE64 Cyber Security
18CSE55 Blockchain Technology
Intelligent Systems & Analytics
Course Course
Code Code
18CSE71 Artificial Intelligence 18CSE81 Big Data Analytics
18CSE72 Pattern Recognition 18CSE82 Image Processing
18CSE73 Social & Web Analytics 18CSE83 Natural Lang. Processing
18CSE74 Neural Network& Deep Learning 18CSE84 Soft Computing
18CSE75 Business Intelligence

SOFTWARE TESTING
Course Code : 18CS701 CIE Marks : 50
Teaching Hours /Week : 3-0-0-0 SEE Marks : 50
(L:T:P:S)
Total Hours : 39 Credits : 03
Course Objectives:
This Course will enable students to:
1. Explain the concept of testing and the testing life cycle.
2. Use the testing frameworks, process and test management to generate the
test plans.
3. Generate the test plans for a business.
4. Illustrate the use of automation in testing.
5. Perform defect management and data management.
UNIT – I 14 Hours
INTRODUCTION TO TESTING – WHY AND WHAT:

Why is testing necessary? What is testing? Role of Tester, Testing and Quality,
Overview of STLC
SOFTWARE TESTING LIFE CYCLE – V MODEL:
SDLC vs STLC, different stages in STLC, document templates generated in
different phases of STLC, different levels of testing, different types of testing:
Functional Testing, API Testing, Usability Testing, Exploratory Testing, Ad-hoc
Testing.Static Testing:
Static techniques, reviews, walkthroughs
BASICS OF TEST DESIGN TECHNIQUES:
Various test categories, test design techniques for different categories of tests.
Designing test cases using MS-Excel.
UNIT – II 16 Hours
TEST MANAGEMENT:
Documenting test plan and test case, effort estimation, configuration management,
project progress management. Use of Testopia for test case documentation and
test management.
DEFECT MANAGEMENT:
Test Execution, logging defects, defect lifecycle, fixing / closing defects. Use of
Bugzilla for logging and tracing defects.
TEST DATA MANAGEMENT:
Test Data Management –Overview, Why Test Data Management, Test Data Types,
Need for Test Data Setup, Test Data Setup Stages, Test data management
Challenges. Creating sample test data using MS-Excel.
UNIT – III 09 Hours
BASICS OF AUTOMATION TESTING:

Introduction to automation testing, why automation, what to automate, tools
available for automation testing.
BASICS OF AUTOMATION TESTING USING SELENIUM:

Introduction to Selenium, using Selenium IDE for automation testing, using
Selenium Web driver for automation testing, understanding TestNG framework with
Selenium Web driver for automation testing, Introduction to Maven automation tool.
Course Outcomes:
Upon Completion of this course students will be able to:
1. Apply the knowledge of engineering to understand the various terms and

techniques used in testing domain.
2. Identify the different phases of software testing life cycle and types of
testing.
3. Analyze test management and test data management processes.
4. Analyze defect management life cycle and use open source tool for
defect management.
5. Design test case and formulate automation testing with demonstration
of open source testing tool.
Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Conduct investigation of complex problems
4. Modern tool usage
5. The engineer and society
6. Ethics
7. Life-long Learning
TEXT BOOKS:
1. Rex Black , “Managing the Testing Process”,2nd edition, John Wiley & Sons,
2001
2. Dorothy Graham, Erik van Veenendaal, Isabel Evans, Rex Black,”
Foundations of software testing”, Cengage Learning EMEA, 2008.
3. Elfriede Dustin, “Implementing Automated Software Testing: How to Save
Time and Lower Costs While Raising Quality”, Addison-Wesley
Professional,2009
REFERENCE BOOKS:
1. Paul C. Jorgensen,” Software Testing, A Craftsman’s Approach”, Third

Edition, Auerbach Publications, 2008
2. Mauro Pezze, Michal Young,” Software Testing and Analysis –Process”,
Principles and Techniques, Wiley India, 2009.
E-Books / Online Resources:

1. https://www.softwaretestinghelp.com/selenium-tutorial-1/
2. http://softwaretestingfundamentals.com/software-testing-methods/
3. https://www.tutorialspoint.com/software_testing/software_testing_tutorial.pdf
4. http://docs.seleniumhq.org/docs/
5. http://www.seleniumhq.org/download/
MOOC:
1. http://nptel.ac.in/courses/106105150/
2. https://freevideolectures.com/course/3625/testing-with-selenium
COMPILER DESIGN
(L:T:P:S)
Course Learning Objectives:
This Course will enable students to

1. Outline lexical analysis, use of regular expressions, transition diagrams,
scanner-generator tools and context free grammars.
2. Get the idea of major parsing techniques top-down (recursive-descent, LL(1))
and Bottom up parsers.
3. Discuss LR parsers using items sets and parsing tables.
4. Make use of the principal ideas in syntax-directed definitions, syntax-directed
translations and intermediate code representations for assignment statements

and boolean expressions.
5. Describe how to construct the basic blocks from intermediate code, code
optimization techniques and code generation algorithm.
UNIT – I 15 Hours
INTRODUCTION:
A Simple Compiler, The Phases of a Compiler.
LEXICAL ANALYSIS:
Lexical Analysis, Input Buffering, Specifications of Tokens, Recognition of Tokens,
A Language for Specifying Lexical Analyzer, LEX programming.
SYNTAX ANALYSIS:
Context-free Grammars, ambiguity
SYNTAX ANALYSIS:
The Role of the Parser, Top-down Parsing: No recursive Predictive parsing, LL (1)
grammars, Bottom-up Parsing: shift reduce conflicts.
UNIT – II 15 Hours
SYNTAX ANALYSIS:
Introduction to LR Parsers –Simple LR (SLR), LR (0) item set, LR (1) item set,
Canonical LR (CLR), Look Ahead LR (LALR) Parsers, YACC programming.
SYNTAX-DIRECTED DEFINITIONS
Constructions of Syntax Trees, Bottom-up Evaluation of S-attributed definitions, L-
attributed definitions.
INTERMEDIATE CODE GENERATION:
Intermediate Languages, Assignments, Boolean Expressions
Target Machine, Basic blocks and Flow graphs, Next-use information, A Simple
Code Generator, Register Allocation and Assignment, The DAG representation of
Basic Blocks
Introduction, The Principle of Optimization, Optimization of Basic Blocks, Loops in

flow graphs.
Course Outcomes:
At the end of the course the student will be able to:

1. Explain the various phases of compiler. Build the regular expressions and
transition diagrams by applying the knowledge of finite automata. Develop and
Implement tokenizer using high level programming language anf LEX Tool
2. Develop top down parsers by applying the knowledge of context free grammar
and parsing algorithms.
3. Construct LR item sets by applying the knowledge of Closure and Go to

functions. Make use of SLR, CLR and LALR parsing tables to parse the language
constructs. Design and Implement parser using high level programming language
anf YACC Tool.
4. IllustrateSyntax-Directed translation scheme for engineering problems.

Applythree address code representations togenerate an intermediate code for
assignment statement and Boolean expressions.
5. Build a code generator for the intermediate code by applying the knowledge of
Basic blocks, address, register descriptors and next use information. Apply code
optimization techniques to optimize the target code.
Table: Mapping Levels of COs to POs / PSOs
COs Program Outcomes (POs) PSOs

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 2 3 3 1 1 1 3
CO2 1 2 3 3 1 1 1 3
CO3 1 2 3 3 1 1 1 3
CO4 1 2 3 1 1 1 1 3
CO5 1 2 3 1 1 1 1 3
H: Substantial (High) M: Moderate (Medium) L: Poor (Low)
TEXT BOOKS:
ica S. Lam, 1. Ravi Sethi, Jeffrey D Ullman, “Compilers- Principles, Techniques and Tools”,
Addison-Wesley, Second edition, 2007.
REFERENCE BOOKS:
1. Andrew W Apple, “Modern Compiler Implementation in C”, Cambridge
University Press, 1997.
2. Kenneth C Louden, “Compiler Construction Principles & Practice”,
Thomson Education, 1997.
3. John R. Levine, Tony Mason, Doug Brown, “LEX and YACC”, O’Reilly
Publication,1999.

1. https://www.tutorialspoint.com/compiler_design/index.htm
2. http://hjemmesider.diku.dk/~torbenm/Basics/basics_lulu2.pdf
3. http://cnp3book.info.ucl.ac.be/2nd/cnp3bis.pdf
1. http://www.nptelvideos.in/2012/11/compiler-design.html
SOFTWARE TESTING LAB

(L:T:P:S)
Total Hours : Credits : 01
Part A:
1. Open flipkart.com and locate element using name . For the same write a test
suite containing minimum 3 test cases using IDE record and playback
2. Open airasia.com search flight process to automate and locate web element
using id. For the same write a test suite containing minimum 3 test cases using
IDE record and playback
3. Open snapdeal.com and search for any web element using name. For the
same write a test suite containing minimum of 3 test cases using IDE record
and playback
4. Open Mercury Tours homepage and locate web element using xpath. For the
same write a test suite containing minimum 3 test cases using IDE record and
play back
5. Open https://www.google.co.in, automate the following using the specified
locators in the Selenium IDE:
 Verify Google sign-in using id.
 Verify the working of Google Search button for the specified search using
name.
 Verify the link to Gmail homepage in Google homepage using linktext.
 Verify the link to Google images homepage in Google homepage using
xpath.
Part B:
1. Openwww.facebook.com application and record login and logout using

Selenium IDE. Write test cases by locating the web elements using the CSS
Selectors as mentioned below.
 Locate the email input box using tag and class.
 Locate the password input box using tag and id.
 Locate the login button using tag and attribute.
 Locate the 'Email or Phone' and 'Password' input boxes using tag, class and
attribute.
2. Automate the following scenario using selenium web driver script.

• Fetch Mercury Tour’s homepage.
• Verify its title.
• Print out the result of the comparison.
• Close it before ending the entire program.

• Launch the browser and open “Gmail.com”.
• Verify the title of the page and print the verification result.
• Enter the username and password.
• Click on the Sign in button.
• Close the web browser.
• Launch the Firefox browser.
• Open website, “https://www.flipkart.com”.
• Print message to display that the website is opened successfully.
• Wait for 5 seconds.
• Close the browser.
*******************
COMPILER DESIGN LAB

(L:T:P:S)
Total Hours : Credits : 01
1. Implementation of lexical analyzer programs (Lex programs).

2. Implementation of programs related to compilers (YACC programs)
3. Design and implementation of a mini project related to the area of compiler
design. (Ex: Assemblers, lexical analyzer, any phase of compiler etc.)
*******************
PARALLEL COMPUTER ARCHITECTURE & PROGRAMMING
Course Code : 18CSE11 CIE Marks : 50

Teaching Hours /Week (L: : 3-0-0-0 SEE Marks : 50
T:P:S)
1. Outline the principles of multi-core design.
2. Illustrate the concept of parallelization and develop threaded parallel
programs.
3. Develop parallel programs on shared memory and distributed memory
parallel computers.
4. Debug and optimize the parallel programs.
5. Develop parallel programs on Graphics Processing Units.
UNIT – I
Introduction to multi-core architecture:
Introduction, Moore’s law, Amdhal’s law, Gustafson’s law, Motivation for Multi-core
processors, Types and levels of parallelism, Flynn’s classification of multi-
processors, Introduction to parallelization and vectorization: Data dependencies,
SIMD technology, Hardware Multithreading vs. Software multi threading, Hyper
threading, SMT, Case Study of multi-core processors: Intel, AMD multicore
processors. (Chapter-1 and chapter-2 of Textbook-1)
Thread programming: Definition of thread and process, Parallel programming
models, Parallel Programming constructs: Synchronization, Deadlock, Critical
sections, Threading APIs-POSIX threads. (Chapter-4 Textbook-1) 15 Hours
UNIT – II
Shared and distributed memory parallel programming:
MPI Model: Collective communication, Data decomposition, Communicators and
topologies, point-to-point communication, MPI Library, OpenMP: Directives and
clauses, environment variables, Programs using OpenMP and MPI. Introduction to
intel TBB, Thread-Safeness.
(Chapter-4 Textbook-1)
Multithreaded program debugging:
Benchmarks and other performance analysis tools, vTune Performance Analyzer,
Thread Checker, Thread Profiler, hotspots, performance issues in algorithms,
branch misprediction, cache organization, cache loads, efficiency, hardware and

software prefetch.
(Chapter-2,3, and 4 of Textbook-2) 15 Hours
UNIT – III
Introduction to GPUs and CUDA programming:
Introduction to GPU Computing, Evolution of Graphics Processing Units, CUDA
Device Architecture - Architecture of Modern GPUs, Generalized structure of CUDA
Enabled GPU Device, CUDA Enabled NVIDIA GeForce 8800 GPUs. CUDA Thread
Model, CUDA Thread Scheduling, Compute Capability, SIMD and SIMT, CUDA
Memory Model, Introduction to CUDA C Programming -Structure of a Typical
CUDA C Program -Data Transfer Between the Host and Device, CUDA programs
with 1D Grid of 1D Blocks, 2D Grid of 2D Blocks, Tile-based Algorithms using
Shared Memory- Matrix multiplication.
(Chapter-7 Textbook-1) 9 Hours
Course Outcomes:
1. Indentify the concept of multi-core architecture and motivation behind it.
2. Design parallel program using the multithreading concept.
3. Develop parallel programs using parallel programming frameworks.
4. Describe the concept of multithreaded program debugging.
5. Develop GPU programs using CUDA.
Mapping of POs & COs:

POs
a b c d E f g h i j k l
COs
1 H H H L H
2 H H H H L M H H
3 H H H H H L M H H
4 H H H L M H H
5 H H H H H L M H H
H : High M: Medium L : Low
TEXT BOOKS
1. Introduction to Parallel Computing, by Niranjan N. Chiplunkar, Raju
K.,Wiley, 2020.
2. The software optimization cookbook- High performance Recipes for IA-32

Platforms – Richard Gerber, AartJ.C.Bik, Kevin B.Smith, Xinmin Tian, Intel
press
REFERENCE BOOKS
1. Multicore programming- Increasing performance through software
multithreading,-- Shameem Akhter and Jason Roberts, Intel press
2. Advanced Compiler Design Implementation- Steven S. Muchnick, Morgan
Kaufman Publishing 2000
EMBEDDED SYSTEMS
Course Objectives:
This course will enable students to:
1. Explain the concepts and principles of Embedded system design.
(L:T:P:S)
2. Identify basic building blocks of an embedded system.
3. Assess the benefits of Intel Atom based embedded system in terms of
power consumption,
4. Analyze features of various RTOS.
5. Use Intel Atom boards in typical design of systems.
6. Compare various shared data handling techniques
UNIT - I
Embedded system definition, characteristics, design metrics; Processor, IC and
design technologies; Embedded system examples, Digital Camera building blocks,
Combinational and sequential building blocks. Use of DSP Processors, SoCs and
Microcontrollers in embedded systems. Overview of 8051 microcontroller.
Timers, ADCs, Keypad controllers, LCD controllers, stepper motor and DC motor
control, Custom Single Purpose processor design examples: GCD Generator, 4-bit
multiplier, Communication bridge. Memory – Composing memory, memory
hierarchy and Cache memory, interfacing-Serial, Parallel and Wireless Protocols.
15 Hours
UNIT – II
Introduction to Real – Time Operating Systems, features, Examples of RTOS,
typical RTOS functions. Interrupt handling and latency, Shared data problems,
Tasks and Task States, Task scheduling, Inter-task communication and
synchronization, Semaphores, Message Queues, Mailboxes and Pipes, Reentrant

functions, Typical software architectures, Embedded Software development and
testing tools, JTAG debugger, typical system boot flow diagram. Intel ATOM
Processor Architecture, Platform architecture and Micro architecture details.
15 Hours
UNIT-III
Overview of Assembly language programming of ATOM Processor, Low power
issues of ATOM processor, ATOM processor series.Intel ATOM Processor kit
details, I/O options available, Keyboard and Mouse interface, GPS, GSM and RFID
interface – Hands On, Overview of Device drivers.
9 Hours
Course Outcomes:
Upon completion of this course, students will be able to:
1. Identify basic building blocks of embedded systems.
2. Explain General purpose processor and the purpose of peripherals.
3. Illustrate the uses of RTOS.
4. Explain different features of real time operating systems.
5. Design an embedded system using Intel Atom boards.
Table-1: Mapping of COs to PIs, POs and BTL

Program
Course
Outcomes Performance Bloom's Taxonomy
Outcomes
(POs) Indicators (PI) Level (BTL)
(COs)
Addressed
CO1 1 1.3.1, 1.4.1 L1, L2
1.3.1, 2.1.2,
CO2 1,2 L1, L2
2.2.1,
1.4.1, 2.1.3,
CO3 1,2 L2, L3
2.2.3, 2.3.1
CO4 1,2 1.1.1, 1.3.1, 2.1.2 L1, L2
2.2.2, 2.2.3,
CO5 2,3 L2, L3
2.3.1, 3.1.1
Table-2: Mapping Levels of COs to POs / PSOs

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 3
CO2 3 2 1 3
CO3 3 3 2 3
CO4 3 2 3
CO5 2 3 3 3
3: Substantial (High) 2: Moderate (Medium) 1: Poor (Low)
TEXTBOOKS:
1. Frank Vahid and Tony Givargis, “Embedded Systems Design – A unified
Hardware/Software Introduction”, John Wiley, 2002 (Chapter 1, 2, 4).
2. David E.Simon, “An Embedded Software Primer”, Pearson Education Asia,
First Indian Reprint 2000. (Chapter 6,7, 8, 9).
3. Kenneth Ayala, “8051 Microcontroller Architecture, Programming and
Applications”, West publishing, 1991 (Selected chapters on Architecture of
8051).
REFERENCE BOOKS:
1. Lori Matassa and Max Domeika, “Break away with Intel Atom Processors: A
guide to Architecture Migration”, Intel Press, 2010 (Chapter 3, selected
topics of Chapter 4 & 5).
2. Peter Barry, Patrik Crowley, “Modern Embedded Computing”, Morgn
Kaufmann publishers, ISBN: 978-0-12-391490-3 2012.

1. https://www.intel.com/content/www/us/en/products/processors/atom.html
2. https://en.wikipedia.org/wiki/Embedded_system
SEE Scheme:
There will be 8 questions of 20 marks each in the question paper divided
into3 Units as per the syllabi & contact hours and the student will have to
answer 5 full questions, selecting 2 full questions from Unit - I &
Unit – II and 1 full question from Unit – III.
************************
OPERATIONS RESEARCH

(L:T:P:S)
1. Describe the scope and limitations of OR methods and outline the role of
OR techniques in supporting the decisions.
2. Explain the concept of Linear Programming Model (LPM) and formulate
Linear Programming problems.
3. Describe the various methods like Simplex Method, revised simplex
Method, Big M Method, Two Phase Method, Dual Simplex Method and
duality theory and use it on Linear Programming Problems.
4. Describe the formulation of Transportation problems, different methods in
Transportation problems like North West Corner Rule, Row minima method,
Column minima method, Matrix minima method, Vogel’s approximation
method, U-V method and use those methods on the respective real-world
problems.
5. Describe the formulation of Assignment problems, use Hungarian method in
Assignment problems, CPM and PERT (project management techniques)
and use it on the respective real-world problems.
UNIT – I
INTRODUCTION
Introduction to OR, nature and meaning, applications, modeling in OR, phases of
OR study
LINEARPROGRAMMING
Introduction to Linear Programming through an example, graphical method,
formulation of LP model from practical problems, assumptions and properties of
linear programming, simplex method, Big M method, 2 phase method,Revised
simplex method, Duality theory, Primal and dual relationship.
(Text Book-1: Chapter 2,3,5,6,7,8)15 Hours
UNIT – II
TRANSPORATION PROBLEMS
Transportation problems, methods to find initial feasible solution and modification to
obtain optimal solution (Degeneracy in transportation problems, unbalanced
transportation problems
ASSIGNMENTPROBLEM
Mathematical formulation of an assignment problem, unbalanced assignment
problem, Travelling Salesman Problem (TSP), Hungarian method.
(Text Book-1: Chapter 15,16) 15 Hours
UNIT – III
CPM, PERT
Representation of a project by a network, activities and events, starting times,
finishing times, floats, slacks, CPM, Idea of crashing probabilistic times and PERT
analysis
(Text Book-1: Chapter 31)9 Hours
Course Outcomes:

1. Describe the basics of OR, modelling and applications of OR and the linear
programming model.
2. Construct linear programming problem and apply methods like Simplex
method, revised simplex method, Big M method, 2 phase method and Dual
simplex method tosolvethe different use cases of linear programming
problem.
3. Apply the North West Corner Rule, Row minima method, Column minima
method, Matrix minima method, Vogel’s approximation method and U-V
method to solve the Transportation Problems.
4. Apply the Hungarian method to solvethe Assignment Problems and
Travelling Salesman Problems.
5.Apply the CPM and PERT project management techniques on the respective
use cases to solve the problems related to the use cases.

Program
Course Bloom's
Outcomes Performance Indicators
Outcomes Taxonomy Level
(POs) (PI)
(COs) (BTL)
Addressed
CO1 1 1.4.1 L2
1.1.1,2.1.1,2.2.3,
CO2 1,2 L3
2.2.4,2.3.2,2.4.4
1.1.1,2.1.1,2.2.3,2.2.4,
CO3 1,2 L3
2.3.2,2.4.4
1.1.1,2.1.1,2.2.3,2.2.4
CO4 1,2 L3
2.3.2,2.4.4
1.1.1,2.1.1,2.2.3,
CO5 1,2 L3
2.2.4,2.3.2,2.4.4

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3
CO2 2 3 3
CO3 2 3 3
CO4 2 3 3
CO5 2 3 3
TEXTBOOK:
1. Operations Research, S. D. Sharma, 17th Revised edition,2014.
REFERENCE BOOKS:
1. Operations Research,Er. PremkumarGupta,Dr. D.S. Hira, 4th edition, 2015.
2. Introduction to Operations Research - A Computer Oriented Algorithmic
Approach, Gillelt B G, McGraw Hill, 2008.
3. Operations Research – An introduction, Hamdy A Taha, PHI, 8th
edition,2007.

1. https://www.tutorialspoint.com/linear_programming/index.asp
2. https://www.cs.toronto.edu/~stacho/public/IEOR4004-notes1.pdf
3. http://people.brunel.ac.uk/~mastjjb/jeb/or/contents.html
MOOCs:
1. Fundamentals of Operations Research IIT Madras Course, Prof. G.
Srinivasan:https://swayam.gov.in/
SEE Scheme:
into 3 Units as per the syllabi & contact hours and the student will have to
answer 5 full questions, selecting 2 full questions from Unit - I & Unit – II
and 1 full question from Unit – III.
***************
CAD FOR VLSI AND VHDL

(L:T:P:S)

1. Explain the VLSI and the fabrication process.
2. Carryout synthesis process
3. Give the algorithmic approach for the fabrication
4. Explain the logical synthesis process.
UNIT - I
OVERVIEW OF VLSI DESIGN:

Overview of VLSI Design: Digital Systems and VLSI: Why Design Integrated
Circuits, Integrated Circuit manufacturing, CMOS Technology, Integrated Circuit
Design Techniques, Fabrication Process, Transistors, Wires and Vias, Design
Rules, Layout Design and Tools, Static Complementary gates, Wires and delay,
switch logic, layout design methods, Combinational Logic Testing, Sequential
Machines: Introduction, latches and flip flops, FPGAs, PLAs.
HIGH LEVEL SYNTHESIS:

Synthesis, Y-chart Partitioning in High level Synthesis, Introduction, Partitioning,
Basic Partitioning Methods: Random Selection, Clustering Growth, Hierarchical
Clustering
The Min-Cut Partitioning, Scheduling in High level Synthesis, Introduction, Basic
Scheduling Algorithms, Time-Constrained Scheduling, Integer Linear Programming
Method, Force-Directed Heuristic Method, Resource-Constrained Scheduling, DFG
Restructuring
14 Hours
UNIT - II
Data Path Allocation in High level Synthesis, Introduction, Allocation Tasks, Unit
Selection, Functional- Unit Binding, Storage Binding, Interconnection Binding,
Interdependence and Ordering, Allocation Methods, Greedy Constructive
Approaches, Decomposition Approaches, Clique Partitioning, Left-Edge Algorithm,
Weighted Bipartite-Matching Algorithm. Logic Synthesis: Algebraic and Boolean
Division Shannon’s expansion theorem, Binary Decision Diagrams (BDD), ROBDD,
ITE graphs, Combinational Optimization.
16 Hours
UNIT - III
PLAs, Two level optimization PLA Folding, Multilevel logic circuits and
Optimization, Physical Synthesis: Floor Planning Placement and Routing,
Compaction. VHDL, language constructs, entity and architecture, behavioral
description, structural description, examples, Sequential Statements , Testbenches.
09 Hours
Course Outcomes:
1. Explain the concepts and terms related to VLSI design and illustrate high
level synthesis.
2. Select the synthesis process and process of VLSI circuit.
3. Apply the allocation algorithm for the VLSI design.
4. Illustrate the logic synthesis process.
5. Apply the VLSI method to design and synthesis a real time circuit.

Course Program
Performance Indicators Bloom's Taxonomy
Outcomes Outcomes (POs)
(PI) Level (BTL)
(COs) Addressed
CO1 1 1.4.1 L2
CO2 1,2 1.1.1,2.1.1,2.2.3 L3
CO3 1,2 1.1.1,2.1.1,2.2.3,2.2.4 L3
CO4 1 1.1.1,2.1.1,2.2.3 L2
CO5 1,2 1.1.1,2.1.1,2.2.3 L3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2
CO2 2 3 2
CO3 2 3 3
CO4 3 2
CO5 2 3 2
TEXTBOOKS:
1. Niranjan N. Chiplunkar and ManjunathKothari,” VLSI CAD “, PHI Learning
Pvt. Ltd. New Delhi, 2011.
2. Wayne Wolf,” Modern VLSI Design “, Prentice Hall, Second Edition,1998.
3. Douglas Perry,” VHDL Programming”, Third edition, McGraw-Hill, 2002.
4. Daniel Gajski, Nikhil Dutt, Allen C-HWunand Steve Y-L Lin,” High level
synthesis Introduction to chip and system design”, Kluwer Academic,
Norwell,1992.
REFERENCE BOOKS:
1. Gary Hatchel and Fabio somenzi, “Logic synthesis and Verification
Algorithms”, Kluwer Academic, Norwell,2001.
2. Naveed Sherwani,” Algorithms for VLSI Physical Design Automation”, Third
Edition, Springer International, 1998.
E-BOOKS / ONLINE RESOURCES:
1. http://www.facweb.iitkgp.ernet.in/~isg/CAD/index.html
2. http://www.serc.iisc.ernet.in/~viren/Courses/2008/E0285.html
MOOC:
1. https://www.coursera.org/learn/vlsi-cad-logic
SEE Scheme:
into 3 Units as per the syllabi & contact hours and the student will have to
answer 5 full questions, selecting 2 full questions from Unit - I & Unit – II
and 1 full question from Unit – III.
************************
INTERNET OF THINGS

(L:T:P:S)
Course Objectives:
1. Learn the IoT Definitions, Design aspects
2. Identify the IoT hardware and software requirements
3. Describe IoT logical and physical design concepts
4. ImplementArduino based IoT Projects
5. Implement Raspberry PibasedIoT Projects
UNIT – I
Introduction
Introduction to IoT: Definition and characteristics, Physical design, Logical design,
Enabling technologies, Levels and deployment templates, Examples: Domain
specific IoTs
IoT Design and System Engineering
Discuss IoT Requirements, Hardware & Software; Study of IoT sensors, Tagging
and Tracking, Embedded Products; IoT Design, (U) SIM Card Technology, IoT
Connectivity and Management, IoT Security & IoT Communication.
Python Programming
Data types, Data structures, Control flow, Functions, Modules, Packages, File
Handling, Date and time operation, Classes, Python packages of IoT
(Text Book-1:, Chapter 1 to 4) 15 Hours
UNIT – II
IoT Logical Design: IoT Physical Design, Basic building blocks, Raspberry Pi,
Linux on Raspberry Pi, Interfaces, Programming on Raspberry Pi with Python
Arduino Based IoT ProjectsDevelopment
Arduino for Project development using components such as LED/Buzzer, Push
button/Digital sensor (IR/LDR), Interface motor using relay, Sensing Temperature
and Humidity smart phone using Bluetooth.
Raspberry Pi
Raspberry Pi for Project Development: Raspberry Pi platform, GPIO, Establishment
and setting, of Raspberry Pi software
(Text Book-1: Chapter 4,5,6 ,7)15 Hours
UNIT – III
Raspberry Pi based IoT Project Implementation:

Developing projects using components such as LED/Buzzer, Push button/Digital
sensor (IR/LDR), Interface motor using relay, Sensing Temperature and Humidity
smart phone using Bluetooth.
(Text Book-1: Chapter 10,11,12, 139Hours
Course Outcomes:
1. Explain IoT Definitions, Requirements, Systems Design, Sensors, Tags,
security communications and apply IoT knowledge in understanding IoT
systems and applications
2. Describe Python basics, Control structures, Functions, Modules, Packages,
File Handling, Date and time operation, Classes, Python packages of
IoTAnalyze the and Develop Simple programs using Python
3. Outline IoT systems Logical and Physical Design Aspects, Develop Arduino
simple programmes for LED, Buzzer, Push button, Digital sensors
4. Develop and Implement the simple IoT projects usingArduino boards.
5. Develop and Implement the simple IoT projects usingRaspberry Pi boards
Course Program Bloom's

Performance
Outcomes Outcomes (POs) Taxonomy Level
Indicators (PI)
(COs) Addressed (BTL)
CO1 1,2 1.3.1, 1.4.1 L3

1.3.1, 1.4.1, 2.1.1,
CO2 1,2,3 L3
2.1.2
CO3 1,2,3 1.3.1, 2.2.4, 3.2.1, 3.2.2 L3
1.3.1, 1.4.1, 3.4.2,

CO4 1,3,5 L4
3.4.3, 5.1.1, 5.2.1, 5.2.2
1.3.1, 1.4.1, 3.4.2,
CO5 1,3,5 L4
3.4.3, 5.1.1, 5.2.1, 5.2.2

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1 1 1 3
CO2 2 3 1 1 1 3
CO3 3 1 1 1 1 3
CO4 3 2 3 1 1 1 1 3
CO5 3 2 3 1 1 1 1 3
TEXTBOOKS:
1. ArshdeepBahga, Vijay Madisetti, “Internet of Things: A Hands-On
Approach,VijayMadisetti”, 2014.
2. Donald Norris, “The Internet of Things: Do-It-Yourself at Home Projects for
Arduino,Raspberry Pi and BeagleBone Black”, 1st Edition, McGraw Hill, 2015.
REFERENCE BOOKS:
1. Dr. SRN Reddy, RachitThukral and Manasi Mishra,” Introduction to Internet of
Things: A practical Approach”, ETI Labs
2. Pethuru Raj and Anupama C. Raman,“The Internet of Things: Enabling
Technologies, Platforms, and Use Cases”, CRC Press
3. JeevaJose,”Internet of Things”, Khanna Publishing House,Delhi
4. Adrian McEwen,”Designing the Internet of Things”, Wiley
5. Raj Kamal, “Internet of Things: Architecture and Design”, McGraw Hill
6. CunoPfister, “Getting Started with the Internet of Things”, O Reilly Media

1. Object-Oriented Analysis and Design with Applications, Grady Booch, Robert
A. Maksimchuk, Michael W. Engel,Bobbi J. Young, Jim Conallen,Kelli A.
Houston, Third Edition The Addison-Wesley Object Technology Series, 2007
2. Object-Oriented Modeling and Design with UML, James R Rumbaugh, Michael

R. Blaha Pearson Education, 21-Nov-2011
3. Object-Oriented Analysis and Design, Ramnath, Sarnath, Dathan, Brahma,
ISBN 978-1-84996-522-4,, Springer Publications, 2011.
MOOC:
1. https://www.coursera.org/specializations/internet-of-things
2. https://www.udemy.com/course/iot-internet-of-things-automation-using-
raspberry-pi/
3. https://www.udemy.com/course/arduino-iot-cloud/
LIST OF PRACTICALS
1. Familiarization with Arduino/Raspberry Pi and perform necessary software
installation.
2. To interface LED/Buzzer with Arduino/Raspberry Pi and write a program to turn
ON LED for 1 sec after every 2 seconds.
3. To interface Push button/Digital sensor (IR/LDR) with Arduino/Raspberry Pi
and write a program to turn ON LED when push button is pressed or at sensor
detection.
4. To interface DHT11 sensor with Arduino/Raspberry Pi and write a programe to
print temperature and humidity readings.
5. To interface motor using relay with Arduino/Raspberry Pi and write a programe
to turn ON motor when push button is pressed.
6. TO interface OLED with Arduino/Raspberry Pi and write a program to print
temperature and humidity readings on it.
7. To interface Bluetooth with Arduino/Raspberry Pi and write a program to send
sensor data to smartphone using Bluetooth.
8. To interface Bluetooth with Arduino/Raspberry Pi and write a program to turn
LED ON/OFF when ‘1’/’0’ is received from smartphone using Bluetooth.
9. Write a program on Arduino/Raspberry Pi to upload temperature and humidity
data to thingspeak cloud.
10. Write a program on Arduino/Raspberry Pi to retrieve temperature and humidity
data from thingspeak cloud.
SEE SCHEME
There will be 8 questions of 20 marks each in the question paper divided into3
Units as per the syllabi & contact hours and the student will have to answer 5 full
questions, selecting 2 full questions from Unit - I &Unit – II and 1 full question from
Unit – III.
************************
ADVANCED COMPILATION TECHNIQUES

(L:T:P:S)
Course Objectives:
1. Outline issues in compiler design and optimization
2. Bring out the issues in code generation.
3. Perform data flow analysis, Partial-redundancy elimination, Region-based
analysis; Symbolic analysis.
4. Perform Basic-block scheduling; Global code scheduling; Software
pipelining.
5. Describe instruction level parallelism and optimizing for parallelism.
UNIT – I
Introduction and Review: Language processors; The structure of a Compiler; The
evolution of programming languages; The science of building a compiler;
Applications of Compiler technology; Programming language basics.
Topics in Code Generation: Issues in the design of Code Generator; Peephole
optimization; Register allocation and assignment; Instruction selection by tree
rewriting; Optimal code generation for expressions; Dynamic programming code
generation.
15 Hours
UNIT – II
Machine-Independent Optimizations: The principle sources of optimization;
Introduction to data flow analysis; Foundations of data flow analysis; Constant
propagation; Partial-redundancy elimination; Loops in flow graphs; Region-based
analysis; Symbolic analysis.
Instruction-Level Parallelism: Process architectures; Code-scheduling
constraints; Basic-block scheduling; Global code scheduling; Software pipelining.
15 Hours
UNIT – III
Optimizing for Parallelism and Locality: Basic concepts; An example of matrix
multiplication; Iteration spaces; Affine array indexes; Data reuse; Array data –
dependence analysis; Finding synchronization-free parallelism; Synchronization
between parallel loops; Pipelining; Locality optimizations.
09 Hours
Course Outcomes:

1. Describe the basic issues in Compiler design and Code generation.
2. Apply the code generation techniques to generate an optimal code for a
given high level constructs.
3. Perform flow analysis, Partial-redundancy elimination, Region-based
analysis; Symbolic analysis to optimize the code.
4. Construct Basic-block scheduling; Global code scheduling for generating
an optimized code.
5. Exploit parallelism and locality concepts for optimizing the given code.

Program
Course
Outcomes
(COs)
Addressed
CO1 1 1.1.1 L2
CO2 1,2 1.4.1, 2.1.3, 2.2.3 L4
CO3 1,2 1.4.1, 2.1.3, 2.2.3 L3
1.4.1, 2.1.3, 2.2.3,

CO4 1,2,3 L4
2.3.1, 3.2.1
CO5 1,2 1.4.1, 2.1.3, 2.2.3 L3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2
CO2 2 3 1 3
CO3 2 3 1 3
CO4 2 2 3 1 3
CO5 2 3 2
TEXTBOOK:
1. Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman: “Compilers -
Principles, Techniques and Tools”, 2nd Edition, Pearson, 2007.
REFERENCE BOOKS:
1. Charles N. Fischer, Richard J. leBlanc, Jr,” Crafting a Compiler with C”,
Pearson, 1991.
2. Andrew W Apple,” Modern Compiler Implementation in C”, Cambridge
University Press, 1997.
3. Kenneth C Louden,” Compiler Construction Principles & Practice”,
Cengage Learning, 1997.

1. http://www.cs.tau.ac.il/~msagiv/courses/acd/introscribe.doc
2. http://infolab.stanford.edu/~ullman/dragon/w06/w06.html
MOOC:
2. https://www.mooc-list.com/course/compilers-coursera
SEE SCHEME
Unit – III.
************************
ADVANCED ALGORITHMS
(L:T:P:S)
Course Objectives:
1. To learn the graph search algorithms.
2. To study about pattern matching and string processing algorithms.
3. To understand the network flow and basic complexity classes of
randomized algorithms.
UNIT - I
Review of Analysis Techniques: Growth of Functions: Asymptotic notations;
Standard notations and common functions; Recurrences and Solution of
Recurrence equations- The substitution method, The recurrence – tree method,

The master method; Amortized Analysis: Aggregate, Accounting and Potential
Methods. Graph Algorithms: Bellman - Ford Algorithm; Single source shortest paths
in a DAG.
14 Hours
UNIT - II
Johnson’s Algorithm for sparse graphs, String-Matching Algorithms: Naïve string

Matching; Rabin - Karp algorithm; String matching with finite automata; Knuth-
Morris-Pratt algorithm; Boyer – Moore algorithms.
15 Hours
UNIT - III
Flow networks and Ford-Fulkerson method; Maximum bipartite matching;
Probabilistic and Randomized Algorithms: Probabilistic algorithms; Randomizing
deterministic algorithms, Monte Carlo and Las Vegas algorithms; Probabilistic
numeric algorithms.
10 Hours
Course Outcomes:
1. Explain the algorithmic problem solving, algorithm design techniques and
standard asymptotic notations. Apply the general procedure of non-
recursive and/or recursive algorithms to obtain worst-case running times of
algorithms using asymptotic analysis.
2. Develop graph search algorithms for solving searching problems in graphs.
3. Develop the optimized pattern matching and string processing algorithms to
search the given string in a sentence.
4. Develop and apply the network flow problems for a given a specific
application.
5. Describe the probabilistic and randomized algorithms.

Course Program
Performance Bloom's Taxonomy
Outcomes Outcomes (POs)
Indicators (PI) Level (BTL)
(COs) Addressed
CO1 1,2 1.1.1, 2.1.3, 2.2.3 L3
1.4.1, 2.1.3, 2.2.3,
CO2 1,2,3 L4
2.3.1, 3.2.1
CO3 1,2 1.4.1, 2.1.3, 2.2.3 L3
1.4.1, 2.1.3, 2.2.3,
CO4 1,2,3 L4
2.3.1, 3.2.1
1.4.1, 2.1.3, 2.2.3,
CO5 1,2 L3
2.3.2

Cos Program Outcomes (POs) PSOs
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 2
CO2 2 2 3 1 1 3
CO3 2 3 1 1 3
CO4 2 2 3 1 1 3
CO5 2 3 2
TEXTBOOKS:
1. T Cormen, C Leiserson, R Rivest, and Stein, “Introduction to Algorithms”, 3rd
edition, PHI, 2007.
2. Kenneth A. Berman, Jerome L. Paul,” Algorithms”, Cengage Learning, 2002.
REFERENCE BOOKS:
1. Ellis Horowitz, SartajSahini,” Fundamentals of Computer Algorithms”,
Second Edition,Galgotia Publications,2008.
2. S.G. Akl, “Design and Analysis of Parallel Algorithms”, Prentice Hall,1989.

1. https://www.cs.duke.edu/courses/fall08/cps230/Book.pdf
2. http://people.csail.mit.edu/moitra/854.html
MOOC:
1. https://www.coursera.org/learn/advanced-algorithms-and-complexity
2. https://onlinecourses.nptel.ac.in/noc17_cs20/preview
SEE SCHEME
Unit – III.
************************
ADVANCED COMPUTER ARCHITECTURE

Teaching Hours /Week : 3–0–0–0 SEE Marks : 50

(L:T:P:S)

1. Outline the preamble of quantitative principles of computer architecture,
various parallel computer models and fundamentals of parallel processing
2. Make use of the concept of pipelining and apply in Linear and Non Linear
pipelining processors
3. Learn how to enhance a MIPS processor’s ability by understanding
challenges like hazards and techniques like static and dynamic scheduling
4. Get an idea of Synchronization mechanism in Multiprocessors and
Optimizations in Cache and memory.
5. Summarize the fundamental aspects of Instruction Level Pipelining and
utilize in case studies of Itanium and Intel IA-64 Architecture along with the
Hardware and Software.
UNIT – I
FUNDAMENTALS OF COMPUTER DESIGN:

Introduction, Classes of Computers, measuring, reporting and summarizing
performance, quantitative principles of computer design (Text 1, chapter: 1).
PARALLEL COMPUTER MODELS:
Shared memory multiprocessors, Distributed-Memory multicomputers (Text 3: chap
1.2). Introduction to Parallel processing: Concepts of concurrent and parallel
execution, types and levels of parallelism. (Text 2: chapter 3)
PIPELINING:
Introduction, the major hurdle of pipelining- pipeline hazards, How is pipelining
implemented. (Text 1, Appendix A). Linear pipeline processors and Non-linear
pipeline processors (Text 3, chapter 6).
15 Hours
UNIT – II
EXPLOITING INSTRUCTION LEVEL PARALLELISM:

Concepts and Challenges, Basic compiler techniques for exposing ILP, Reducing
branch cost with prediction, overcoming data hazards with dynamic scheduling,
hardware based speculation, exploiting ILP using multiple issues and static
scheduling, exploiting ILP using Dynamic scheduling, multiple issue and
speculation, advanced techniques for instruction delivery and speculation.
(Text 1, chapter 2)
MEMORY HIERARCHY DESIGN:
Introduction; review of concepts. Basic six cache optimization. Eleven Advanced
optimizations of Cache performance (self-study); Memory technology and
optimizations. (Text 1, chapter 5: 5.1,5.2,5.3)
15 Hours
UNIT – III
HARDWARE AND SOFTWARE FOR VLIW AND EPIC:

Introduction: Exploiting Instruction-Level Parallelism Statically; Detecting and
Enhancing Loop-Level Parallelism; Scheduling and Structuring Code for
Parallelism; Hardware Support for Exposing Parallelism: Predicated Instructions;
Hardware Support for Compiler Speculation; The Intel IA-64 Architecture and
Itanium Processor; Conclusions. (Text 1, Appendix G)
9 Hours
Course Outcomes:
1. Describe the principles of computer design using Amdahl’s law, principle of
locality and parallelism.

2. Demonstrate instruction level parallelism in MIPS processor using
instruction pipelining.
3. Elaborate how processor performance is enhanced using software and
hardware techniques.
4. Compare cache optimization techniques and choose the suitable one to
improve processor performance.
5. Illustrate the hardware and software support for VLIW and EPIC with the
case study of Intel IA-64 architecture

Program
Course Bloom's
Outcomes Performance
(POs) Indicators (PI)
(COs) (BTL)
Addressed
CO1 1, 2 1.4.1, 2.2.5 L3
1, 2 1.4.1, 2.2.2, 2.2.3, L3

CO2
2.2.4
CO3 1, 2 1.4.1, 2.2.3, 2.2.4 L3
CO4 1, 2 1.4.1, 2.2.3, 2.2.4 L4
1, 2 1.4.1, 2.2.2, 2.2.3, L3

CO5
2.4.3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 1 1 1 3
CO2 2 3 1 1 1 3
CO3 2 3 1 1 1 3
CO4 2 3 1 1 1 3
CO5 2 3 1 1 1 3
TEXTBOOKS:
1. John L. Hennessey and David A. Patterson, “Computer Architecture,
A
Quantitative Approach”, 4th Edition, Elsevier, 2007
2. DezsoSima, Terence Fountain, Peter Kacsuk, “Advanced Computer
Architectures- A Design space approach”, Pearson Education 1997.
3. Kai Hwang, “Advanced Computer Architecture Parallelism,
Scalability”, Tata
McGrawhill, 2003
REFERENCE BOOKS:
1. Computer Architecture and Organization, John P. Hayes, Volume 2,

McGraw-Hill, 2012
2. Computer Organization and Architecture: Designing for Performance,
William Stallings, PHI 9 edition, 2012

1. Computer Architecture and Organization - Design Principles and
Applications, B. Govindarajalu, Mcgrawhill HED, Edition: 2nd Edition, 2010
2. Fundamentals of computer organization and architecture, M Abd-El-Barr
and Hesham El-Rewini, Wiley Interscience, 2005
MOOC:
1) NPTEL course on Computer Architecture, by Prof. MadhuMutyam, PACE
Laboratory, Department of computer Science and Engineering, Indian
Institute of Technology Madras. Online:
https://www.youtube.com/watch?v=Tz7kMR-MAuk
2) NPTEL course on Advanced Computer Architecture, by Dr. John Jose,
Department of computer Science and Engineering, Indian Institute of
Technology Guwahati. Online:
https://www.youtube.com/watch?v=6oiKaIH7BKU
3) NPTEL course on Parallel computer Architecture, by Dr. MainakChaudhuri,

Department of Computer Science and Engineering, Indian Institute of
Technology Kanpur.Online:
https://nptel.ac.in/courses/106/104/106104024/
SEE Scheme:
Unit – III.
***********************************
ADVANCED UNIX PROGRAMMING

(L:T:P:S)
Course Objectives:
1. List the file APIs and design the programs to perform file handling
operations.
2. Illustrate the concept of processes and its environment.
3. Implement programs to handle processes in Linux platform.
4. Demonstrate the concepts of signals and timers.
5. Apply inter process communication concept for data exchange between
programs.
UNIT – I
The POSIX standards. File types. General File APIs, File handling programs,
Makefile - introduction, creation and execution of make file.The Process:
Introduction,Mechanism for creating process. The UNIX Kernel support for process.
The environment of a UNIX process: Introduction, main function, Process
Termination, Command line arguments, Environment List, Memory layout of a C
program,Memory allocation, Environment variables, functions.
15 Hours
UNIT – II
Setjmp and longjmp functions, getrlimit, setrlimit Process Control: Introduction,

Process Identifiers, fork, vfork, exit, wait, waitpid, Wait3, wait4 functions, Race
conditions, exec functions, Interpreter files, System Function.Signals: The Unix
Kernel Support for signals, Signal, Signal mask, Sigaction,The SIGCHLD Signal
and waitpidfunctions,Thesigsetjmp and siglongjmp Functions, Kill, Alarm, Interval
Timers. Daemon processes: Introduction, Daemon Characteristics, and Coding
Rules. 15 Hours
UNIT – III
Interprocess communications: Overview of IPC Methods, Pipes, popen, Pclose

functions, FIFOs, SOCKETS: Introduction, functions, Client/Server Message
Handling Example. 9 Hours
Course Outcomes:
1. Define and discuss the POSIX standard and different types of files under
UNIX platform.
2. Apply various file APIs for developing the file handling programs that can
work on UNIX platform.
3. Illustrate the representation of a process and its environment in UNIX and
design programs that can use various process APIs for creating and handing
the processes in UNIX.
4. Demonstrate the concept of signal and signal handling methods. Use the
signal handling APIs for developing programs to handle operating system
issues in UNIX platform.
5. Describe the concepts of demon process and inter process communication,
design programs to demonstrate the working of inter process communication
using suitable APIs of UNIX for achieving the computer communication.

Performance
Indicators (PI)
1.4.1, 2.1.2,
CO1 1,2 L3
2.2.3,2.3.1
1.4.1, 2.1.1,2,1,2,
CO2 1,2,3 L3
2.3.1, 3.2.1,3.4.2
1.4.1, 2.1.1,2,1,2,
CO3 1,2,3 L3
2.3.1, 3.2.1,3.4.2
1.4.1, 2.1.1, 2.1.2,
CO4 1,2,3 2.1.3, 2.2.3, 2.3.1, L3
3.2.2, 3.2.1,3.4.2
1.4.1, 2.1.1,2,1,2,
CO5 1,2,3 L3
2.3.1, 3.2.1,3.4.2

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 3 2
CO2 2 2 3 2 3
CO3 2 2 3 2 3
CO4 2 2 3 2 3
CO5 1 2 3 2 3
TEXTBOOKS:
1. Terrence Chan, “UNIX System Programming Using C++”, Prentice Hall

India, 1999. (Chapters 1, 5, 6, 7, 8, 9, 10)
2. W.Richard Stevens,” Advanced Programming in the UNIX Environment”,
Addison –Wesley/PHI, 2013. (Chapters 7, 8, 9, 13, 14, 15)
3. Sumitaba Das, “UNIX-Concepts and Applications”, Fourth Edition, Tata
McGraw Hill, 2006. (Chapter 9).
REFERENCE BOOKS:
1. Maurice.J.Bach,”The Design of the Unix Operating System”, Pearson

Education /Prentice Hall of India, First Edition, 1986.
2. UreshVahalia,” UNIX Internals, Pearson Education”, ASIA, 2001.
3. R. Stones, N. Matthew, “Beginning Linux Programming”, Wrox publication,
Fourth Edition,2007.
1. http://www.codeman.net/wp-content/uploads/2014/04/APUE-3rd.pdf
1. richard.esplins.org/static/downloads/linux_book.pdf
MOOC
1. http://nptel.ac.in/courses/106101163/56
SEE SCHEME
Unit – III.
**************
PROGRAM VERIFICATION
(L:T:P:S)
Course Objectives:
1. Apply the mathematical and logical concepts for programming.
2. Explain various Programming paradigms.
3. Identify the specifications of a sequential program.
4. Write simple program using Dafny.
5. Perform program verification using Dafny.
UNIT - I
BACKGROUND AND INTRODUCTION:
Sequential, concurrent, and reactive systems, Programming languages and
paradigms, Type systems of programming languages, Assigning meaning to
programs, operational semantics denotational semantics, Partial and total
correctness, Hoare triples, Logic for Program Design: Propositional Calculus,
Predicate Calculus.
MATHEMATICAL AND LOGICAL FOUNDATIONS:
Mathematics for Specification: Sets, Relations, Functions and Sequences. Pre-
conditions, Post conditions Loop invariants. 15 Hours
UNIT - II
SPECIFICATION OF PROGRAMS:
Variant functions, the state model of programs, Partial and total correctness,
Weakest precondition, Guarded commands, Why functional programming matters,
Algebraic data types, Higher order functions.
PROGRAM VERIFICATION USING DAFNY PART-I
Methods and functions, pre and post conditions, Assertions, loop invariants,
termination, quantifiers, framing, Binary search—an example. 15 Hours
UNIT -III
PROGRAM VERIFICATION USING DAFNY PART-II:
Predicates, sets, sequences, collections, Lemmas, modules: Declaring a new
module, Import and export new module, opening modules. 9 Hours
Course Outcomes:
1. Identify various paradigms related to programming.
2. Build logical and mathematical specifications for program
3. Testing for specifications of the program.
4. Design and write simple Dafny programs and learn basic syntax.
5. Apply advanced Dafny tool for program verification.

Program
Course Bloom's
Outcomes
Outcomes Performance Indicators (PI) Taxonomy
(POs)
(COs) Level (BTL)
Addressed
CO1 1,2 1.1.1, 1.1.2,2.1.3,2.4.1 L4
CO2 1,2 1.3.1,1.4.1, 2.2.4, L3
CO3 1,2 1.3.1,1.4.1,2.1.2,2.1.3 L3
CO4 1,2 1.1.1,1.3.1,2.3.1,2.4.2 L3
1.4.1,
CO5 1,2,3 L4
2.1.3,2.2.3,2.4.1,3.1.6,3.2.1,3.4.3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 1 3 3 3
CO2 3 3 2 1 3
CO3 1 1 3 3 3
CO4 3 1 3 2 3
CO5 1 1 3 2 3
TEXTBOOKS:
1. Geoff Dromey, “Program Derivation”, International Computer Science
Series. Addison-Wesley. 1989.
2. Michael Huth and Mark Ryan,” Logic in Computer Science - Modeling and
Reasoning about Systems”, Cambridge University Press. 2004.
REFERENCE BOOKS:
1. Jacques Loeckx, Kurt Sieber,” The Foundation of Program Verification”,
Second Edition, Wiley, India,2013.

1. http://research.microsoft.com/en-us/projects/dafny/Microsoft Research.
2. https://www.springer.com/in/book/9780792319658
MOOC:
SEE SCHEME
Unit – III.
************************
CLOUD COMPUTING

(L:T:P:S)
Course Objectives:
1. Outline the fundamental ideas behind Cloud computing, and the evolution of
the paradigm, its applicability; benefits as well as current and future
challenges.
2. Get the basic idea and principles in Datacenter design and Management and
find the importance of Virtualization in Cloud.
3. Get the idea of different Cloud deployment models and Cloud Delivery
Models and their security issues.
4. Tellhow Cloud Computing solves different problems in the present by
considering different Cloud Vendors and their Cloud Design architecture.
UNIT – I
Eras of computing, Parallel vs. Distributed Computing, Elements of Parallel

Computing- (What is parallel computing, hardware architecture for Parallel
processing, approaches to parallel programming, levels of parallelism, Laws of
caution). Elements of Distributed Computing- (General concepts and definitions,
components of a distributed system, Architectural styles for distributed computing,
models for inter-process communication, Technologies for distributed Computing-
Remote procedure call, Service oriented computing).
Classic data center, its elements, challenges and benefits. Data center
management Steps in transitioning to cloud- consolidation, automation, IT as a
service.
Cloud computing Architecture: - Introduction, Cloud reference models-
(Architecture, Infrastructure/Hardware as a service, Platform as a service, Software
as a service), Types of cloud – (Public Clouds, Private Clouds, Hybrid Clouds,
Community Clouds), Economics of cloud, Open challenges. 15
Hours
UNIT – II
Virtualization: – Introduction, characteristics of virtualized environments, taxonomy
of virtualization technique- (execution of virtualization, other types of Virtualization-
Compute, Storage, Network, Desktop, Application). Virtualization and cloud
computing, Pros and Cons of virtualization, Technology examples- XEN, VMware,
Microsoft Hyper-V.
Security Concerns, Risk Issues: - Cloud Computing- Security Concerns. A Closer
Examination: Virtualization, A Closer Examination: Provisioning.
Securing the Cloud: Key Strategies and Best Practices: - Overall Strategy:
Effectively Managing Risk-Risk Management: Stages and Activities. Overview of
Security Controls, Cloud Security Controls Must Meet Your Needs, NIST Definitions
for Security Controls, Unclassified Models, Classified Model the Cloud Security
Alliance Approach. The Limits of Security Controls - Security Exposure Will Vary
over Time, Exploits Don’t Play Fair. Best Practices: Best Practices for Cloud
Computing- First Principals, Best Practices across the Cloud Community. Other
Best Practices for Cloud Computing- Cloud Service Consumers, Cloud Service
Providers. Security Monitoring.
15 Hours
UNIT –III
The Purpose of Security Monitoring, Transforming an Event Stream, The Need for
C.I.A. in Security Monitoring, the Opportunity for MaaS.
Case studies: Public cloud- AWS, Windows Azure, Google App Engine. Private
Cloud- Open stack, Eucalyptus.9 Hours
Course Outcomes:
1. Define the concept of cloud computing business need and various
networking methods.
2. Express the infrastructure management for cloud environment.
3. Describe the Virtualization at all levels used by XEN, Vmware, Hyper-v
4. Explain the security concepts in cloud computing
5. Practice the case studies of public cloud such as AWS, Google App Engine
and private cloud such as Open Stack.

Program
Course Bloom's
Outcomes Performance
Outcomes Taxonomy
(POs) Indicators (PI)
(COs) Level (BTL)
Addressed
CO1 1,2 1.3.1, 2.2.2 L3
CO2 1,2 1.4.1, 2.2.1 L3
CO3 1,2 1.3.1, 2.2.3 L3
CO4 1,2 1.4.1, 2.2.3 L3
CO5 1,2 1.3.1, 1.4.1,2.2.2 L3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 2 3
CO2 3 3 2 3
CO3 3 3 1 3
CO4 3 3 2 3
CO5 3 3 1 3
TEXTBOOKS:
1. Buyya, Rajkumar, Christian Vecchiola and ThamaraiSelvi, "Mastering Cloud
Computing Fundamentals and Applications Programming", McGraw Hill,
2013.
2. Winkler, Vic (J.R), "Securing the Cloud - Cloud Computer Security
Techniques and Tactics.",ElsevierInc, 2012.
REFERENCE BOOKS:
1. Hurwitz, Judith, "Cloud computing for dummies.”, Wiley India Pvt Ltd, 2011.
2. Rittinghouse, John,"Cloud computing – implementation, management and
security",CRC Press, First edition, 2009.
3. Velte, Toby, Anthony Velte and Robert Elsenpete. "Cloud Computing, A
Practical Approach.",Tata McGraw-Hill Authors, 2010.

1. www.motc.gov.qa/sites/default/files/cloud_computing_ebook.pdf
2. http://eddiejackson.net/web_documents/The_Definitive_Guide_to_Cloud_C
omputing.pdf
MOOC:
2. https://www.coursera.org/learn/cloud-computing
SEE SCHEME
Unit – III.
************************
WEB PROGRAMMING
(L:T:P:S)
Course Objectives:
1. Design static web pages using HTML5 and Cascading Style Sheets (CSS).
2. Develop client-side validations using JavaScript.
3. Develop the server-side script using PHP and introduce AJAX concepts.
4. Design modern web applications using Bootstrap.
5. Develop AngularJS script at the client side
UNIT – I
HTML5:
Overview of HTML5, New features in HTML5, Removed elements from HTML,

HTML5 Semantic elements, HTML5 input types, HTML5 new form elements and
attributes, HTML5 Video and Audio.
CASCADING STYLE SHEETS (CSS): Introduction, Levels of style sheets, style
specification formats, selector forms, Property Value forms, Font properties, List
properties, Color, Alignment of Text, The Box model, Background images, The
<span> and <div> tags, Conflict resolution.
THE BASICS OF JAVASCRIPT:
Overview, Object orientation and JavaScript, General syntactic characteristics,
Primitives, Operations, and Expressions, Screen output and keyboard input, control
statements, Object creation and modification, Arrays, Functions, Constructors,
Patterns matching using Regular Expressions, Errors in Scripts.
JAVASCRIPT
The JavaScript Execution Environment, The Document object model, Element
access in JavaScript, Events and Event handling, Handling events from Body
elements, Handling events from Button elements, Handling events from Text Box
and Password elements.
15 Hours
UNIT - II
INTRODUCTION TO PHP:
Origins and uses of PHP, Overview of PHP, General syntactic characteristics,
Primitives, Operations and Expressions, Output, Control statements, Arrays,
Functions, Pattern Matching, Form handling, Files, Cookies, Session tracking,
Database access with PHP and MySQL.
INTRODUCTION TO AJAX:
Overview of Ajax, the basics of Ajax, Example programs using GET and POST
method.
BOOTSTRAP:
What is Bootstrap? Why use Bootstrap? Where to get Bootstrap? Bootstrap CDN,
First Web Page with Bootstrap, Bootstrap Grid system, Contextual Colors and
Backgrounds, Bootstrap Tables, Bootstrap Images, Bootstrap Jumbotron and Page
Header, Bootstrap Wells, Bootstrap Alerts, Bootstrap Buttons, Bootstrap Badges
and Labels, Bootstrap Progress Bars, Bootstrap List Groups, List Group With
Badges, Tabs, Tabs With Dropdown Menu, Pills, Bootstrap Navigation Bar,
Bootstrap Forms, Bootstrap Form Inputs, Bootstrap Media Objects,
Bootstrap Carousel Plugin.
16 Hours
UNIT - III
UNIT - III
AngularJS:
Introduction, AngularJS Expressions, Numbers, Strings, Objects, Arrays, AngularJS
Expressions vs. JavaScript Expressions, AngularJS Modules, AngularJS
Directives, Data Binding, Repeating HTML Elements, Create New Directives,

AngularJS Controllers, Controller Methods, AngularJS ng-model Directive,
AngularJS Scope, AngularJS Filters, AngularJS Services
NodeJS: Introduction to Node.js- Installing Node.js - Using Events, Listeners,
Timers, and Callbacks in Node.js, Introduction to Mongo DB- Accessing MongoDB
from Node.js.
8 Hours
Course Outcomes:
1. Design static web pages using HTML5 and Cascading Style Sheets (CSS).
2. Develop client-side validations using JavaScript.
3. Develop the server-side script using PHP and AJAX concepts.
4. Design modern web applications using Bootstrap.
5. Develop interactive AngularJS script at the client side.

Program
Course
Outcomes
(COs)
Addressed
CO1 1,2,3 1.4.1, 2.2.1, 3.2.1 L1, L2, L3
CO2 1,2 1.4.1, 2.2.2, 2.3.2 L1, L2, L3
CO3 1,2 1.4.1, 2.1.2 L1, L2, L3
CO4 1,2,3 1.4.1, 2.2.1, 3.2.1 L1, L2, L3
CO5 1,2 1.4.1, 2.2.2, 2.3.2 L1, L2, L3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 2 3 3
CO2 2 3 3
CO3 2 3 3
CO4 1 2 3 3
CO5 1 2 3
TEXTBOOKS:
1. Robert W. Sebesta, “Programming the World Wide Web”, Fourth Edition,

Pearson, 2014.
2. Jake Spurlock, “Bootstrap-Responsive Web Development”, O’Reilly
publications, 2013.
3. Ari Lerner, Ng-book, “The complete book on Angular JS”, 2013.
REFERENCE BOOKS:
1. M. Deitel, P.J. Deitel, A. B. Goldberg,”Internet& World Wide Web How to
Program”, Third Edition, Pearson education, 2004.
2. Chris Bates,”Web Programming Building Internet Applications”, Third
Edition, Wiley India, 2006

1. https://www.cs.uct.ac.za/mit_notes/web_programming.html
2. http://www.multitech.ac.ug/uploads/IntroductiontoWebProgramming.pdf
MOOCs:
2. https://www.coursera.org/learn/web-development
SEE Scheme:
Unit – III.
******************************
MOBILE APPLICATION DEVELOPMENT

(L:T:P:S)
Course Objectives:
1. Describe the architecture and overview of android.
2. Develop a mobile application on android platform using UI components and
Android Components.
3. Demonstrate data handling in Android Develop a mobile application on
android platform using SQLite
4. Build an Android web service.

5. Develop application to demonstrate google map and navigation.
UNIT – I
INTRODUCTION AND OVERVIEW:
Mobility landscape, Mobile platforms, Mobile apps development, Overview of
Android Platform, setting up the mobile app development environment along with
an emulator in Android Studio, Hello World Example.
USER INTERFACE DESIGNING:
App user interface designing – mobile UI Layout (Layout, View) UI Control
(TextView, EditText, Button, ImageButton, ToggleButton, RadioGroup,
RadioButton,CheckBox,ProgressBar,Spinner,DayPicker,TimePicker), Draw-able,
Menu(Option, Context, Popup).
Textbook1 , Chapters: 1, 2, 4) 15 Hours
UNIT – II
ANDROID APPLICATION COMPONENT:
Activity –states and life cycle, interaction amongst activities. Services – state and
lifecycle. Notifications, Broadcast Receivers, Content Provider, Fragments. Intents:
Implicit and Explicit Intent
APP FUNCTIONALITY BEYOND USER INTERFACE:
Threads, Async task, Notification, Location Based Service, Telephony and SMS
APIs, Text to Speech, Camera.
Android Web Service, Android Google Maps, Android Bluetooth, Navigation.
(Textbook1 , Chapters: 4, 5,10)15 Hours
UNIT – III
DATA HANDLING:
Shared preferences, mobile databases such as SQLite, and enterprise data
access, Android multimedia: Multimedia-audio/video playback and record. Sensors:
Location awareness and native hardware access (sensors such as accelerometer
and gyroscope).
(Textbook1 , Chapters: 6, 9)9 Hours
Course Outcomes:
1. Understand the tool like Android Platform and Android Studio Environment
to familiarize with android development environment.
2. Design the user interface using the Android UI Components and Android
Application Components.
3. Apply the concepts such as SQLite, shared preference, files,
broadcast, notifications, and other APIs for developing the android
applications.
4. Develop Application using Sensor telephony APIs.
5. Apply the google APIs to build location-based app development

Program
Course Bloom's
Outcomes Taxonomy
(POs) (PIs)
(COs) Level (BTL)
Addressed
1.4.1,2.1.2,2.2.2,3.1.1,3.4.2,
1,2,3,5,6,8,9, 5.1.2, 6.1.1, 8.1.1,9.1.2,
CO1 L3
10,11,12 9.2.1,9.3.1,10.1.2,10.3.1,
11.1.1,11.3.1,12.1.2,12.2.2
1.4.1,2.1.2,2.2.2,3.1.1,3.4.2,
1,2,3,5,6,8,9, 5.1.2, 6.1.1, 8.1.1,9.1.2,
CO2 L3
10,11,12 9.2.1,9.3.1,10.1.2,10.3.1,
11.1.1,11.3.1,12.1.2,12.2.2
1.4.1,2.1.2,2.2.2,3.1.1,3.4.2,
1,2,3,5,6,8,9, 5.1.2, 6.1.1, 8.1.1,9.1.2,
CO3 L3
10,11,12 9.2.1,9.3.1,10.1.2,10.3.1,
11.1.1,11.3.1,12.1.2,12.2.2
1.4.1,2.1.2,2.2.2,3.1.1,3.4.2,
1,2,3,5,6,8,9, 5.1.2, 6.1.1, 8.1.1,9.1.2,
CO4 L3
10,11,12 9.2.1,9.3.1,10.1.2,10.3.1,
11.1.1,11.3.1,12.1.2,12.2.2
1.4.1,2.1.2,2.2.2,3.1.1,3.4.2,
1,2,3,5,6,8,9, 5.1.2, 6.1.1, 8.1.1,9.1.2,
CO5 L3
10,11,12 9.2.1,9.3.1,10.1.2,10.3.1,
11.1.1,11.3.1,12.1.2,12.2.2

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3 1 1 2 2 1 2 1 2 3
CO2 3 3 3 1 1 2 2 1 2 1 2 3
CO3 3 3 3 1 1 2 2 1 2 1 2 3
CO4 3 3 3 1 1 2 2 1 2 1 2 3
CO5 3 3 3 1 1 2 2 1 2 1 2 3
TEXTBOOKS:
1. AnubhavParadhan, Anil V Deshpande, “Mobile apps Development”,First
Edition, Wiley, 2014.
2. Barry Burd , “Android Application Development All in one for Dummies”,

Second Edition Wiley, 2015.
3. SAMS,”Teach Yourself Android Application Development in 24
Hours”,FirstEdition,Sams Publishing,2010.
REFERENCE BOOKS:
1. Wei-Meng Lee,” Beginning Android Application Development”, Wrox
Publication, 2011.
2. Reto Meier,” Professional Android 4 Application Development”, Wrox
Publication, 2012.

1. https://www.tutorialspoint.com/android/index.htm
2. https://www.javatpoint.com/android-tutorial
3. https://developer.android.com/guide/
MOOC:
2. https://www.youtube.com/watch?v=SYoNOvdZ3M&list=PLonJJ3BVjZW6Ct
AMbJz1XD8ELUs1KXaTD&index=19
SEE SCHEME
Unit – III.
************************
SOFTWARE ARCHITECTURE
(L:T:P:S)
Course Objectives:
1. Outline the various architectural influences and its qualities on the
organizational requirements.
2. Make use of different case studies to critically evaluate the suitability of a
software architecture.
3. Develop the architecture using different architecture styles.
4. Choose the different architectural pattern and design patterns to design the
architecture that enhances the architectural capabilities.
5. Document the software architecture to communicate the system evolution
strategy to the stakeholder.
UNIT - I
INTRODUCTION:
The Architecture Business Cycle: Where do architectures come from? Software
processes and the architecture business cycle; What makes a “good” architecture?
What software architecture is and what it is not; Other points of view; Architectural
patterns, reference models and reference architectures; Importance of software
architecture; Architectural structures and views (Text Book-1: Chapter 1: 1.1
,1.2,1.3, Chapter 2: 2.1,2.2,2.3,2.4,2.5)
QUALITY: Functionality and architecture; Architecture and quality attributes;

System quality attributes; Quality attribute scenarios in practice; Other system
quality attributes; Business qualities; Architecture qualities. Achieving Quality:
Introducing tactics; Availability tactics; Modifiability tactics; Performance tactics;
Security tactics; Testability tactics; Usability tactics.
(Text Book-1: Chapter 4: 4.1, 4.2,4.3,4.4,4.5,4.6,4.7, Chapter
5:5.1,5.2,5.3,5.4,5.5,5.6, 5.7).
15 Hours
UNIT - II
ARCHITECTURAL STYLES AND CASE STUDIES: Architectural styles; Pipes and

filters; Data abstraction and object-oriented organization; Event-based, implicit
invocation; Layered systems; Repositories; Interpreters; Process control; Other
familiar architectures; Heterogeneous architectures. Case Study: Mobile robotics.
(Text Book-2: Chapter 2: 2.1, 2.2,2.3,2.4,2.5,2.6,2.7,2.8,2.9,2.10, Chapter 3:3.3)
ARCHITECTURAL PATTERNS: Introduction, Distributed Systems: Broker;
Interactive Systems: MVC, Presentation-Abstraction-Control. Adaptable Systems:
Microkernel.
(Text Book-2: Chapter 2: 2.1, 2.3,2.4,2.5)15 Hours
UNIT - III
DESIGNING AND DOCUMENTING SOFTWARE ARCHITECTURE: Architecture

in the life cycle; designing the architecture; Forming the team structure; Creating a
skeletal system. Uses of architectural documentation; Views; choosing the relevant
views; Documenting a view; Documentation across views. (Text Book-1: Chapter
7: 7.1, 7.2,7.3,7.4, Chapter 9: 9.1,9.2,9.3,9.4,9.5)
9 Hours
Course Outcomes:
1. Identify the requirements which influence the architecture and development

strategy.
2. Analyze the architecture using different case studies and quality attributes.
3. Recognize architecture styles to design the architecture.
4. Apply different architecture patterns and design patterns to develop
architecture that yields the system that has new organizational capabilities
and requirements.
5. Describe the different views to document the architecture.

Program
Course
Outcomes
(COs)
Addressed
CO1 1,2 1.3.1, 2.1.1 L2
CO2 1,2,3 1.4.1,2.2.3,3.2.2 L3
CO3 1,2,3 1.3.1,2.1.2 L2
CO4 1,2,3 1.4.1, 2.1.2,3.2.1 L3
CO5 1,2 1.4.1, 2.1.3 L2

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 2 3
CO2 1 2 3 2 3
CO3 1 2 3
CO4 1 2 3 3
CO5 2 3 3
TEXTBOOKS:
1. Len Bass, Paul Clements, Rick Kazman,“Software Architecture in
Practice”,SecondEdition, Pearson Education, 2003.
2. Frank Buschmann, RegineMeunier, Hans Rohnert,PeterSommerlad,
Michael Stal, “Pattern-Oriented Software Architecture”, A System of
Patterns -Volume 1 , John Wiley and Sons, 2006.
3. Mary Shaw and David Garlan, “Software Architecture-Perspectives on an

Emerging Discipline”, Prentice-Hall of India, 2007.
REFERENCE BOOKS:
1. E. Gamma, R. Helm, R. Johnson, J. Vlissides, “Design Patterns- Elements
of Reusable Object-Oriented Software “, Addison- Wesley, 1995.

1. http://www.hillside.net/patterns/
2. https://www.cs.cmu.edu/afs/cs/project/vit/ftp/pdf/intro_softarch.pdf
3. https://www.ics.uci.edu/~yuzok/software-architecture.html
MOOC:
1. http://www.nptel.ac.in/syllabus/106104027/
2. https://www.coursera.org/learn/software-architecture
SEE Scheme:
Unit – III.
************************
OBJECT ORIENTED MODELLING AND DESIGN
Course Code : 18CSE44 CIE : 50

Marks
Teaching Hours /Week : 3-0-0-0 SEE : 50
(L:T:P:S) Marks
Course Objectives:
1. Recall the object-oriented concepts, three pillars of object-orientation and their
benefits.
2. Illustrate the various models that can be used to demonstrate the object-
oriented design of any real world software systems.
3. Make use of use-cases for interpreting the requirements and develop class
diagrams that model both the domain state model and design model of a
software system.
4. Examine the dynamic aspects of a software system, model the interaction
diagrams to justify those aspects.
5. Relate how the UML constructs are used to represent various models.
UNIT – I
Introduction:
What is Object Orientation? What is OO development? OO themes; Evidence for
usefulness of OO development; OO modeling history.
Modeling as Design Technique: Modeling; abstraction; The three models. Class
Modeling: Object and class concepts; Link and associations concepts;
Generalization and inheritance; A sample class model; Navigation of class models;
Practical tips.
Advanced Class Modeling: Advanced object and class concepts; Association
ends; N-ary associations;
(Text Book-1: Chapter 1 to 4.3)
Advanced Class Modeling: Aggregation; Abstract classes; Multiple inheritance;
Metadata; Reification; Constraints; Derived data; Packages; Practical tips.
State Modeling: Events, States, Transitions and Conditions; State diagrams; State
diagram behavior; Practical tips.
Advanced State Modeling: Advanced State Modeling: Nested state diagrams;
Nested states; Signal generalization; Concurrency; A sample state model; Relation
of class and state models; Practical tips.
Interaction Modeling: Use case models; Sequence models; Activity models; Use
case relationships; Procedural sequence models; Special constructs for activity
models
(Text Book-1: Chapter 4.4,5,6 ,7) 15
Hours
UNIT - II
Process Overview, System Conception: Development stages; Development life
cycle, Devising a system concept; Elaborating a concept; Preparing a problem
statement.
Domain Analysis: Overview of analysis; Domain class model; Domain state
model; Domain interaction model; Iterating the analysis.
Application Analysis: Application Analysis: Application interaction model;
Application class model; Application state model; Adding operations.
(Text Book-1: Chapter 10,11,12, 13)
System Design: Overview; Estimating performance; Making a reuse plan;
Breaking a system in to subsystems; Identifying concurrency; Allocation of sub-
systems; Management of data storage; Handling global resources; Choosing a
software control strategy; Handling boundary conditions; Setting the trade-off
priorities; Common architectural styles; Architecture of the ATM system as the

example.
(Text Book-1: Chapter 14 )
15 Hours
UNIT – III
Class Design: Overview of class design; Bridging the gap; Realizing use cases;
Designing algorithms; Re-cursing downwards, Re-factoring; Design optimization;
Reification of behavior; Adjustment of inheritance; Organizing a class design; ATM
example
Implementation Modeling: Overview of implementation; Fine- tuning classes;
Fine-tuning generalizations; Realizing associations; Testing
Legacy Systems: Reverse engineering; Building the class models; Building the
interaction model; Building the state model; Reverse engineering tips; Wrapping;
Maintenance.
(Text Book-1: Chapter 15,16,17,23
9Hours
Course Outcomes:
1. Acquire Knowledge about different software systems modelling techniques,
class design and associations by making use of concept diagrams
2. Illustrate Advanced Class, State and Interaction models of software
systems utlilizingclass, state and interaction diagrams
3. Outline the system concepts, Development Life Cycle, Analyse and Define
Problem Statement, Analyse the system domain, application, class, state
and interaction models
4. Overview of system design, estimate performance, divide it into
subsystems, managing resources, selecting appropriate architectural styles
5. Describe class design, Implementation modelling, Legacy systems and
Reverse engineering concepts, realizing use cases, associations, Fine
Tuning Classes, Constructing Interaction and State models.

Program
Course Bloom's
(POs) (PI)
(COs) (BTL)
Addressed
1.2.1, 1.3.1, 1.4.1, 1,4,2
CO1 1,2 L3
2.1.1,2.2.3
1.4.1, 2.1.3, 2.2.3, 2.3.1,
CO2 1,2,3 L3
3.2.2
CO3 1,2 1.4.1, 2.1.3, 2.2.3, 2.3.1 L4
1.4.1, 2.1.3, 2.2.3, 2.3.1,

CO4 1,2,3 L4
2.3.2, 3.2.2
1.4.1, 2.1.3, 2.2.3, 2.3.2
CO5 1,2 L3
2.2.1, 2.2.2

CO Program Outcomes (POs) PSOs
s 1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO
2 3 1 1 2
1
CO
2 2 3 1 1 2
2
CO
2 3 1 1 2
3
CO
2 2 3 1 1 1
4
CO
1 3 1 1 1
5
TEXTBOOKS:
1. Object-Oriented Modeling and Design with UML, Michael Blaha, James
Rumbaugh, 2nd Edition, Pearson Education, 2005
REFERENCE BOOKS:
1. Object-Oriented Analysis and Design with Applications, Grady Booch et al, 3rd
Edition, Pearson Education, 2007.
2. Practical Object-Oriented Design with UML, Mark Priestley, 2nd Edition, Tata
McGraw-Hill, 2003.
3. Object-Oriented Design with UML and JAVA, K. Barclay, J. Savage, Elsevier,
2008.
4. The Unified Modeling Language User Guide,Booch, G., Rumbaugh, J., and
Jacobson I, 2nd Edition, Pearson, 2005.
5. Object-Oriented Systems Analysis and Design Using UML, Simon Bennett,

Steve McRobb and Ray Farmer, 2nd Edition, Tata McGraw-Hill, 2002.

1. Object-Oriented Analysis and Design with Applications, Grady Booch, Robert
A. Maksimchuk, Michael W. Engel, Bobbi J. Young, Jim Conallen, Kelli A.
2. Object-Oriented Modeling and Design with UML, James R Rumbaugh, Michael
R. Blaha Pearson Education, 21-Nov-2011
3. Object-Oriented Analysis and Design, Ramnath, Sarnath, Dathan, Brahma,
ISBN 978-1-84996-522-4, Springer Publications, 2011.
MOOC:
1. Object-Oriented Design, https://www.coursera.org/learn/object-oriented-design
Object-Oriented Analysis and Design ,
https://nptel.ac.in/courses/106/105/106105153/#
SEE Scheme:
Unit – III.
***********************
SYSTEM SIMULATION & MODELLING

(L:T:P:S)
Course Objectives:
1. Describe the appropriateness of the simulation, its application, types of
simulation model, steps in simulation study and general principles in
simulation and concepts in discrete-event simulation.
2. Describe the generation of random numbers and pseudo-random numbers
and apply techniques for generating random numbers.
3. Illustrate and apply the techniques of random variate generation, Accept-
Rejection techniquesand input modelling on relevant exercise problems.
4. Explain the verification, validation and calibration of simulation models.
5. Describe the high-level computer simulation, CPU simulation and memory
simulation.
UNIT – I
INTRODUCTION TO SIMULATION:
When Simulation is the Appropriate Tool; When Simulation Is Not Appropriate;
Advantages and Disadvantages of Simulation; Areas of Application; Systems and
System Environment; Components of a System; Discrete and Continuous Systems;
Model of a System; Types of Models; Discrete-Event System Simulation; Steps in a
Simulation Study. General Principles: Concepts in Discrete-Event Simulation: The
Event-Scheduling / Time-Advance Algorithm, World Views, Manual simulation
Using Event Scheduling.
(Text Book-1: Chapter 1, Chapter 3: 3.1)
15 Hours
UNIT – II
RANDOM-NUMBER GENERATION:
Properties of Random Numbers; Generation of Pseudo-Random Numbers;
Techniques for Generating Random Numbers; Tests for Random Numbers.
Random-Variate Generation: Inverse Transform technique: Exponential
Distribution, Uniform Distribution, Discrete Distributions; Acceptance-Rejection
Technique: Poisson Distribution. Input Modeling: Data Collection; Identifying the
distribution with Data; Parameter Estimation; Goodness of Fit Tests; Selecting Input
Models without Data; Multivariate and Time-Series Input Models.
(Text Book-1: Chapter 7, Chapter 8: 8.1.1,8.1.2,8.1.7,8.2.1,
Chapter 9:9.1,9.2,9.3,9.4,9.6,9.7)
15 Hours
UNIT – III
VERIFICATION AND VALIDATION OF SIMULATION MODELS:

Model Building, Verification and Validation; Verification of Simulation Models;
Calibration and Validation of Models. Simulation of Computer Systems:
Introduction; Simulation Tools; Model Input; High-Level Computer-System
Simulation; CPU Simulation; Memory Simulation.
(Text Book-1: Chapter 10, 14)
9 Hours
Course Outcomes:
1. Describe the appropriateness of the simulation, its application, types of
simulation model, steps in simulation study and general principles in
simulation and concepts in discrete-event simulation.
2. Describe the generation of random numbers and pseudo-random numbers
and apply techniques for generating random numbers.
3. Illustrate and apply the techniques of random variate generation, Accept-
Rejection techniques, input modelling on relevant exercise problems.
4. Illustrate the verification, validation and calibration of simulation models.
5. Illustrate the high-level computer simulation, CPU simulation and memory

simulation.

Performance
Outcomes Outcomes (POs) Taxonomy
Indicators (PI)
(COs) Addressed Level (BTL)
CO1 1,2 1.4.1, 2.2.2, 2.2.4 L2
1.1.1, 1.1.2, 1.3.1,
CO2 1,2 L2, L3
2.1.1,2.1.3,2.2.3,2.2.4.1
1.1.1, 1.1.2, 1.3.1,
CO3 1,2 L2, L3
2.1.1,2.1.3,2.2.3,2.2.4.1
CO4 1,2 1.4.1, 2.2.2, 2.2.4 L2
CO5 1,2 1.4.1, 2.2.2, 2.2.4,2.3.1 L2

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 3 1
CO2 3 3 3 1
CO3 3 3 3 1
CO4 3 3 3 1
CO5 3 3 3 1
TEXTBOOK:
1. Jerry Banks, John S. Carson, Barry L. Nelson, David M. Nicol, “Discrete-
Event System Simulation”,Third Edition, Prentice-Hall India,2000
REFERENCE BOOKS:
1. Averill M. Law, W. David Kelton, “Simulation Modeling and Analysis” ,Third
Edition, McGrawHill,2000.
2. Geoffrey Gordon, “System Simulation”, Second Edition, Prentice-Hall
India,1978.

1. https://ptolemy.berkeley.edu/books/Systems/PtolemyII_DigitalV1_02.pdf
2. https://epdf.tips/system-modelling-and-simulation.html
MOOCs:
1. https://www.coursera.org/learn/modeling-simulation-natural-processes
2. https:// swayam.gov.in
SEE Scheme:
Unit – III.
SIGNALS AND SYSTEMS

(L:T:P:S)
Course Objectives:
This course will enable the student to:
1. Explain the concept of signals.
2. Formulate the signal in the form of equations.
3. Represent the signal in Fourier form and apply this.
4. Demonstrate system using differential/difference equation
5. Perform Z transform on the signals.
UNIT – I
INTRODUCTION:
Definitions of a signal and a system, classification of signals, basic operations on
signals, elementary signals, systems viewed as interconnections of operations,
properties of systems. Time-domain representations for LTI Systems:Convolution,
impulse response representation, properties of impulse response representation,
differential and difference equation representations, block diagram representations.
15 Hours
UNIT – II
FOURIER REPRESENTATION FOR SIGNALS :
Introduction, Fourier representations for four signal classes, orthogonality of
complex sinusoidal signals, DTFS representations, continuous-tine-Fourier-series
representations, DTFT and FT representations, properties of Fourier
representations. Application of Fourier representations : Frequency response of LTI
systems, solution of differential and difference equations using system function,
Fourier transform representations for periodic signals, sampling of continuous time
signals and signal reconstruction.
15Hours
UNIT – III
Z-TRANSFORMS
Introduction, Z-transform, properties of ROC, properties of Z-transforms, inversion
of Z-transforms, transforms analysis of LTI systems, transfer function, stability and
causality, unilateral Z-transforms and its application to solve difference equations
9 Hours
Course Outcomes:
1. Classify different types of signals and systems.
2. Find the output of a LTI system.
3. Formulate the basic operations on signals.
4. Demonstrate system using differential/difference equation
5. Analyze signals & LTI systems in frequency & Z domain.

Program
Course
Outcomes
(COs)
Addressed
1.1.1,1.3.1,2.1.3,
CO1 1,2 L2, L3
2.4.1
1.3.1,2.1.3,
CO2 1,2 L2, L3
2.3.1,2.4.1
1.3.1,2.1.3,2.2.3,2.
CO3 1,2 L2, L3
4.1
CO4 1,2 1.3.1,2.1.3,2.4.1 L2, L3
1.3.1,2.1.3,2.2.4,2.
CO5 1,2 L2, L3, L4
4.1

s
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO
3 3 3
1
CO
3 3 3
2
CO
3 3 3
3
CO
3 3 3
4
CO
3 3 3
5
TEXTBOOK:
1. Simon Haykin and Barry Van Veen, “Signals and Systems”, John Wiley and
Sons, 2001, Reprint 2002(Chapters: 1.1 to 1.8, 2.2 to 2.5, 3.1 to 3.6, 4.2 to
4.3, 4.7, 7.1 to 7.6, 7.8).
REFERENCE BOOKS:
1. Alan V. Oppenheim, Alan S. Willsky and S. Hamid Nawab, “Signals and
Systems”, Pearson Education Asia,Second edition, 1997, Indian reprint
2002.
2. Dr. D.ganeshRao and Satish Tunga, “Signals and Systems-A Simplified
Approach”, Sanguine Technical Publishers, 2003-04.

1. http://jpkc.gnnu.cn/jpkc/Signal/ziliaoxiazai/OppenheimSignalsAndSystems.p
df
2. https://web.itu.edu.tr/hulyayalcin/Signal_Processing_Books/Signals_and_Sy
stems.pdf
MOOC:
1. https://ocw.mit.edu/resources/signals-and-systems-spring-2011/video-
lectures/
2. https://www.coursera.org/courses/signalsandsystems
SEE Scheme:
Unit – III.
************************
ADHOC WIRELESS NETWORKS

(L:T:P:S)
Course Objectives:
1. Distinguish the characteristics of ad hoc Wireless networks with other
Wireless networks.
2. Identify Ad-Hoc Wireless networks, issues, classification of MAC Protocols.
3. Describe and distinguish different types of ad hoc Routing Protocols, TCP
over Ad hoc Protocol and a brief introduction to security issues in ad hoc
Wireless networks.
UNIT – I
Review of Wireless Networks: IEEE Wireless Standard, Basic 802.11 MAC layer
mechanisms, CSMA/CA mechanisms and other MAC layer functionalities.
Ad hoc Networks: Introduction, Issues in Ad Hoc Wireless networks, Ad hoc
Wireless internet.
MAC Protocols for Ad hoc Wireless Networks: Introduction, Issues in designing
a MAC Protocol for Ad hoc Wireless Networks, Design goals of a MAC protocol for
Ad hoc Wireless Networks.
Classification of MAC Protocols: Contention based protocols: MACAW, FAMA
busy tone protocols, receiver-initiated protocol: MARCH. Contention based
protocols with reservation mechanisms: DPRMA, HRMA, FPRP. Contention-based
MAC protocols with scheduling mechanism: DPS&MA.
Routing protocols for Ad hoc Wireless Networks: Introduction, Issues in
designing a routing Protocol for Ad hoc Wireless Networks, Classification of routing
Protocols.
15 Hours
UNIT – II
Table drive routing protocol: DSDV, WRP, CGSR. On-demand routing protocol:
DSR, AODV, LAR, FORP.
Hybrid routing protocol: CEDAR, ZRP. Hierarchical routing protocols: FSR.
Metrics used by power aware routing protocols.
Transport layer protocols for Ad hoc Wireless Networks: Introduction, Issues in
designing a transport layer Protocol for Ad hoc Wireless Networks, Design goals of
a transport layer protocol for Ad hoc Wireless Networks, Classification of transport
layer solutions, TCP over Ad hoc Wireless Networks: TCP-F, TCP with ELFN, TCP-
BuS, ATCP, Split TCP. Other transport layer protocols for Ad hoc Wireless
Networks: ACTP, ATP. 15 Hours
UNIT –III
Security in Wireless Ad hoc Wireless Networks: Network Security requirements,
Issues & Challenges in security provisioning, Network security attacks, Key
Management, Secure routing in Ad hoc Wireless Networks: SAR, SEAD, Security-
Aware AODV.
Quality of service in Ad hoc Wireless Networks: Introduction, Issues & challenges in
providing QoS in Ad hoc Wireless Networks, Classification of QoS solutions, MAC
layer solutions, network layer solutions. 9 Hours
Course Outcomes:
1. Explain the Wireless networks and MAC layer functionalities.
2. Identify and discuss the contentions-based MAC protocolsand routing
protocols of ad hoc Wireless networks.
3. Identify and interpret the network protocols that would facilitate the
exchange of data between the Wireless networks.

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 Outcomes (POs) Performance 3 Level
Outcomes Taxonomy
CO2(COs)
3 Indicators (PI) 3
Addressed (BTL)
CO3 3 3 1.1.1, 1.4.1, 2.1.2, 2.1.3, 3
CO1 1,2 L2
CO4 3 1 2.2.2 3
CO5CO23 1.1.2, 1.4.1, 2.1.1, 2.3.2,
3 1 3
L2
2.4.3
1.1.1, 1.1.2, 1.3.1, 2.1.1,
CO3 1,2 L3
2.2.3, 2.3.2, 2.4.4
CO4 1, 2 1.4.1, 2.2.1, 2.4.3 L2
CO5 1, 2 1.4.1, 2.1.1, 2.3.2, 2.4.3 L2
4. Discuss the issues related to TCP/IP Transport layer protocols.
5. Describe the security and QoS issues and challenges with ad hoc Wireless
networks.
TEXTBOOKS:
1. Siva Ram Murthy and B S Manoj, “Ad Hoc Wireless Networks: Architectures
and Protocols”, Second Edition, C. Pearson Education, 2005.
REFERENCE BOOKS:
1. PrasantMohapatra and Srikanth Krishnamurthy, “Ad Hoc Networks:
Technologies and Protocols”, Springer Science, 2005.
2. Subir Kumar Sarkar, T G Basavaraju and C Puttamadappa, “Ad Hoc Mobile
Wireless Networks: Principles, Protocols, and Applications”, Auerbach

Publications, 2007.
3. SudipMisra, Isaac Woungang, Subhas Chandra Misra, “Guide to Wireless
Ad Hoc Networks”, Springer-Verlag, 2009.
4. Mohammad Ilyas , “The Handbook of Ad Hoc Wireless Networks”, Editor,
CRC Press, 2003.
5. C. K. Toh ,”Ad hoc Mobile Wireless Networks: Protocols & Systems”,
Prentice-Hall PTR, 2002.
3. https://www.sciencedirect.com/journal/ad-hoc-networks
MOOC:
1. https://swayam.gov.in/course/4408-Wireless-adhoc-and-sensor-networks
3.https://onlinecourses.nptel.ac.in/noc17_cs07/
SEE Scheme:
Unit – III.
************************
CRYPTOGRAPHY AND NETWORK SECURITY

(L:T:P:S)
Course Objectives:
1. Outline the basic principles of Network security and its applications .
2. Design various block ciphers and design various cryptographic algorithms .
3. Use the theorems needed for cryptographic operations and compare &
contrast different types of cryptography.
4. State the concepts & uses of Digital signature and web security.
5. Demonstrate the need and summarize the concept of Secure Electronic
Transactions & Intrusion detection system.
UNIT – I
Overview: Services, Mechanisms and Attacks. A Model of Network Security.

ConventionalEncryptionTechniques :SymmetricCipher Model, Substitution
Techniques, Transposition Techniques, Steganography.
Block Cipher and the Data Encryption Standard: Simplified DES. Block Cipher
Principles. The Data Encryption Standard, the Strength of DES, Block Cipher
Design Principles, Block Cipher Modes of Operations. Triple DES, Blowfish,
Random Number Generation 15 Hours
UNIT – II
Number Theory: Group, cyclic groups, Modular arithmetic operation, GCD

operation. Prime Numbers, Fermat’s and Euler’s Theorems, Public-Key
Cryptography and RSA: Principles of Public-Key Cryptosystems, The RSA
Algorithm, attacks on RSA, Key Management: Diffie- Hellman Key Exchange.
Digital signature, DSS, Elliptic Curve Cryptography.
Network Security: Electronic Security, pretty good privacy, IP Security overview,
IP Security architecture, Authentication Header, encapsulating security payload,
Combining Security Associations.
15 Hours
UNIT – III
Web Security: Web Security Requirements, Secure Sockets Layer and Transport
Layer Security, Secure Electronic Transaction. Intruders, Viruses, and Worms:
Viruses and Related Threats, Firewalls: Firewall Design Principles, Trusted
Systems.
9 Hours
Course Outcomes:
1. Identify Explain basic network security model and its applications.
2. Design and Classifyvarious block ciphers and its usages.
3. Apply and Illustrate the concept public key cryptography & apply digital
signatures in email processing.
4. Describe different techniques used in key exchange protocols.
5. Apply the knowledge of usages of email-security, IP security and web
security.

Performance
Indicators (PI)
CO1 1, 2, 1.1.1, 1.3.1, 2.1.3, L1, L2,
2.1.1, 2.1.2, 2.3.1,
CO2 2,3 L2, L3
3.1.1,3.1.2,3.1.3,
3.2.1,3.2.2
CO3 1, 2, 1.4.1, 2.1.3, 2.3.2 L2, L3
1.4.1, 2.1.3, 2.3.2,
CO4 1, 2, 3 L2, L3
3.2.2
CO5 1, 2, 1.4.1, 2.3.1 L2, L3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 2 3
CO2 2 3 2 2
CO3 2 3 3 3
CO4 2 2 3 2 3
CO5 2 3 2 3
TEXTBOOKS:
1. William Stallings, “Cryptography and Network Security”, Third Edition, Pearson
Education, 2003.
2. W. Stallings, Prentice Hall, 2005. Applied cryptography, 2nd edition, B.
Schneier, John Wiley & Sons, 1996.
REFERENCE BOOKS:
1. Charlie Kaufman, Radia Perlman, Mike Speciner, “Network Security: Private
communication in a Public World”, Second Edition, Pearsdon Education Asia,
2002.
2. AtulKahate, “Cryptography and Network Security”, Tata McGraw Hill, 2003.

1. https://wanguolin.github.io/assets/cryptography_and_network_security.pdf
2. https://www.wileyindia.com/cryptography-and-security.html
MOOC:
2. https://www.mooc-list.com/tags/cybersecurity
SEE Scheme:
Unit – III.
************************
BLOCKCHAIN TECHNOLOGY
(L:T:P:S)
Course Objectives:
1. Understand conceptual working of block chain technology.
2. Devise the block chain technology to innovate and improve business
processes.
3. Get the idea of working with Ethereum and Smart Contracts in Block Chain
Environment.
4. Solving real-world problems using Remix IDE and Truffle.
5. Describe and illustrate the idea of Hyperledger Fabric.
UNIT – I
Introduction: What Is the Blockchain? What is Bitcoin? The Connected World and
Blockchain: The Fifth Disruptive Computing Paradigm. How blockchain works?
How blockchain accumulates blocks? Tiers of blockchain technology, Features of a
blockchain, Types of blockchain.
Blockchain Currency: Technology Stack: Blockchain, Protocol, Currency, The
Double-Spend and Byzantine Generals’ Computing Problems, How a
Cryptocurrency Works.
Benefits and limitations of blockchain : Technical Challenges, Business Model
Challenges, Scandals and Public Perception, Government Regulation, Privacy
Challenges for Personal Records, Overall: Decentralization Trends Likely to
Persist.
Consensus: Consensus mechanism, Types of consensus mechanisms, Consensus
in blockchain, CAP theorem and blockchain
(Test Book 1 : Chapter 1,6 TextBook 2 : Chapter 1)
15 Hours
UNIT - II
Decentralization: Decentralization using blockchain, Methods of decentralization,
How to decentralize, Computing power and decentralization, DO,
DAO,DAC,DAS,Dapps,
Ethereum and Smart Contracts: Definition, Ricardian contracts, Deploying smart
contracts on a blockchain, EthereumBlockchain, Ethereum Network, Components
of the Ethereum, ecosystem, Ether cryptocurrency, Introducing Solidity, Global
Variables and Functions, Expressions and Control Structures, Writing Smart
Contracts, Truffle Basics and Unit Testing, Debugging Contracts Remix IDE:
Programs execution.
(TextBook 2: Chapter 1,2,9,10TextBook 3: Chapter 3,4,5,6,9,10)
15 Hours
UNIT - III
Hyperlegder:Fabric,The reference architecture, Requirements and design goals of
Hyperledger Fabric, Membership services, Blockchain services, Components of the
fabric, Chain code implementation, The application model, Consensus in
Hyperledger Fabric, The transaction life cycle in Hyperledger Fabric
(TextBook 2: Chapter 15)
9 Hours
Course Outcomes:
1. Explain the block chain technology.
2. Understand the significance of Consensus and working of cryptocurrency.
3. Develop block chain-based solutions and write smart contract using Remix IDE
and Ethereum frameworks.
4. Build and deploy block chain application using Truffle Suite.
5. Create and deploy a block chain network using Hyperledger Fabric SDK

Performance
Indicators (PI)
CO1 1,2 1.3.1, 1.4.1, 2.2.1 L2
CO2 1,2 1.3.1, 2.2.4, 2.4.3, 6.2.1 L2
1,2,3 1.4.1, 2.1.3, 2.2.3,
CO3 L3
2.3.1, 3.2.1, 3.4.2,3.4.3
1,2,3 1.4.1, 2.1.3, 2.2.3,
CO4 L3
2.3.1, 3.2.1, 3.4.2,3.4.3
CO5 1,2,3 1.4.1, 2.1.3, 3.4.2,3.4.3 L3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2
CO2 2 2 1 1 2
CO3 2 3 2 2 3 2 1 2
CO4 2 3 2 2 3 1 1 2
CO5 2 3 2 2 3 1 1 2
TEXTBOOKS:
1. Melanic Swan, “Block Chain: Blueprint for a New Economy”, O’Reilly, 2015.
2. Imran Bashir, “Mastering Block Chain: Distributed Ledger Technology,
Decentralization and Smart Contracts Explained”, Packt Publishing.
3. RiteshModi, “Solidity Programming Essentials: A Beginner’s Guide to Build
Smart Contracts for Ethereum and Block Chain”, Packt Publishing
REFERENCE BOOKS:
1. AnshulKaushik, “Block Chain and Crypto Currencies”, Khanna Publishing
House, Delhi.
2. Salman Baset, Luc Desrosiers, Nitin Gaur, Petr Novotny, Anthony O’Dowd,
Venkatraman Ramakrishna, “Hands-On Block Chain with Hyperledger:
Building Decentralized Applications with Hyperledger Fabric and
Composer”, Import, 2018.
3. Josh Thompsons, “Block Chain: The Block Chain for Beginners-Guide to
Block chain Technology and Leveraging Block Chain Programming”.
4. Daniel Drescher, “Block Chain Basics”, Apress; 1st edition, 2017.
MOOC Courses:
1.https://www.coursera.org/specializations/blockchain
2. https://www.edx.org/learn/blockchain
3. https://nptel.ac.in/courses/106/105/106105184/
SEE Scheme:
Unit – III.
DISTRIBUTED SYSTEMS

(L:T:P:S)
Course Objectives:
1. Identify the issues involved in designing distributed systems.
2. Describe various synchronization methods of distributed methods.
3. Analyze process migration approach and distributed deadlock management.
4. Describe features distributed shared memory and file system.
5. List and describe load balancing mechanisms in distributed systems.
UNIT – I
Introduction to distributed systems: Fundamentals: -What is Distributed Computing
Systems? Distributed Computing System Models, what is DOS? Issues in
designing a DOS.
Remote Procedure Calls: The RPC model, Transparency of RPC, Implementing
RPC mechanism, Stub generation, RPC messages, Marshaling Arguments and
results. Server management, Parameter passing semantics, call semantics,
communication protocols RPC’s. Complicated RPCs,Client –server binding,
Exception handling, Security. Synchronization in distributed Systems: Clock
synchronization – logical clocks – physical clocks – clock synchronization
algorithms, Mutual exclusion – A centralized algorithm – A distributed algorithm – a
token ring algorithm, Comparison of the three algorithms, Election algorithms – the
Bully algorithm – ring algorithm.
15Hours
UNIT – II
Synchronization in distributed Systems: Dead locks in distributed systems –

distributed deadlock avoidance algorithms – distributed deadlock prevention
algorithms, distributed deadlock detection algorithms: Centralized approach,
Hierarchical approach and Fully distributed approach.
Process Migration: Desirable Features of a Good Migration Mechanism, Process
Migration Mechanisms, Threads: Introduction, Motivation for using Threads, Models
for Organizing Threads, Issues in Designing Threads Package, Implementing
Thread Package. Distributed Shared Memory: General structure, Design and
implementation issues of DSM, Granularity, Structure of shared memory space,
Consistency Models, Replacement Strategy, Thrashing.
15Hours
UNIT – III
Distributed File Systems: Desirable features of a good distributed file system, file
models, file accessing models, file sharing semantics, file Replication. Resource
Management: Desirable features, task management approach, load balancing
approach, load sharing approach. Naming: Introduction, Desirable Features of
Good Naming System, System-Oriented Names, Object-Location

Mechanism,Human Oriented Names, Name Cache.
9 Hours
Course Outcomes:
1. Determine the benefits and issues involved in designing distributed
systems.
2. Explain various synchronization methods of distributed methods.
3. Compare various process migration approaches and distributed deadlock
management approaches.
4. Apply features of distributed shared memory and file system.
5. Describe load balancing mechanisms in distributed systems.

Program
Course
Outcomes
(COs)
Addressed
CO1 1,2 1.3.1, 2.2.1 L2, L3
CO2 1,2 1.4.1, 2.2.2 L2, L3
CO3 1,2 1.3.1, 2.2.3 L2, L3
CO4 1,2 1.4.1, 2.2.3 L2, L3
CO5 1,2 1.4.1,2.2.2 L2, L3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 2 3
CO2 3 3 2 3
CO3 3 3 1 3
CO4 3 3 2 3
CO5 3 3 1 3
TEXTBOOK:
1. Pradeep K Sinha,” Distributed Operating Systems, Concepts & Design”,
PHI,2009.
REFERENCE BOOKS:
1. Lampson (Ed), Distributed Systems, Singer – Verlay NY 1981.
2. MukeshSinghal, NiranjanG,”Advanced Concepts in Operating Systems”,
Tata McGraw-Hill Education, 2001.

1. http://www.gecg.in/papers/ds5thedn.pdf
2. http://cs-www.cs.yale.edu/homes/aspnes/classes/465/notes.pdf
MOOC:
1. nptel.ac.in/courses/117102060/
2. https://www.coursera.org/learn/distributedsystem.
SEE Scheme:
Unit – III.
************************
DIGITAL SIGNAL PROCESSING

(L:T:P:S)
Course Objectives:
1. Describe the behavior of discrete time systems in time& frequency domain.
2. Explain and Analyze the FFT algorithms.
3. Analyze the discrete time systems
4. Explain the features of TMS320c25 and TMS32067 processors.
5. Apply the numbering system for problem solving in signal processing.
UNIT – I
THE DISCRETE FOURIER TRANSFORM: ITS PROPERTIES AND

APPLICATIONS:
Frequency Domain Sampling: The Discrete Fourier Transform: Frequency Domain
Sampling and Reconstruction of Discrete-Time Signals, The Discrete Fourier
Transform (DFT), The DFT as a Linear Transformation, Relationship of the DFT to
other Transforms. Properties of the DFT: Periodicity, Linearity and Symmetry
Properties, Multiplication of Two DFT’s and Circular Convolution, Additional DFT
Properties. Linear Filtering Methods Based on the DFT: Use of the DFT in Linear
Filtering, Filtering of Long Data Sequences. Frequency Analysis of Signals using
the DFT. Efficient Computation of the DFT: FFT Algorithms: Direct Computation
of the DFT, Divide-and-Conquer Approach to Computation of the DFT, Radix-2 FFT
Algorithms, Radix-4 FFT Algorithms, Split-Radix FFT Algorithms, Implementation of
FFT Algorithms. Applications of FFT Algorithms: Efficient computation of the DFT of
Two Real Sequences, Efficient computation of the DFT of a 2N-Point Real

Sequence, Use of the FFT Algorithm in Linear filtering and Correlation.
15 Hours
UNIT –II
Efficient Computation of the DFT: A Linear filtering approach to Computation of the
DFT: The Goertzel Algorithm, The Chirp-Z Transform Algorithm. Quantization
Effects in the Computation of the DFT: Quantization Errors in the Direct
Computation of the DFT, Quantization Errors in FFT Algorithms. Implementation of
Discrete-Time Systems: Structures for the Realization of Discrete-Time Systems.
Structures for FIR Systems: Direct-Form Structures, Cascade-Form Structures,
Frequency-Sampling Structures, Lattice Structure. Structures for IIR Systems:
Direct-Form Structures, Signal Flow Graphs and Transposed. Structures, Cascade-
Form Structures, Parallel-Form Structures, Lattice and Lattice-Ladder Structures for
IIR Systems. State-Space System Analysis and Structures: State-Space
Descriptions of Systems Characterized by Difference Equations, Solution of the
State Space Equations, Relationships between Input-Output and State-Space
Descriptions, State-Space Analysis in the Z-Domain, Additional State Space
Structures.
15 Hours
UNIT – III
Representation of Numbers: Fixed-Point Representation of Numbers, Binary
Floating-Point Representation of Numbers, Errors Resulting from Rounding and
Truncation. Quantization of Filter Coefficients: Analysis of Sensitivity to
Quantization of Filter Coefficients, Quantization of Coefficients in FIR Filters.
Round-Off Effects in Digital Filters: Limit-Cycle Oscillations in Recursive Systems,
scaling to Prevent Overflow, Statistical Characterization of Quantization effects in
Fixed-Point Realizations of Digital Filters, Digital Signal Processors: Architecture,
features and instructions of Fixed and Floating Point Processors. (TMS320c25 and
TMS32067).
9 Hours
Course Outcomes:
After studying this subject, the student should be able to:
1. Analyze the behavior of discrete-time systems in time & frequency domain.
2. Analyze and implement FFT algorithms.
3. Relate theoretical concepts to practical applications.
4. Summarize the working of TMS320c25 and TMS32067 processors.
5. Apply the numbering system for problem solving in signal processing.

Program
Course
Outcomes
(COs)
Addressed
1.1.1,1.3.1,2.1.3,
CO1 1,2 L2, L3, L4
2.3.1,2.4.1
1.3.1,2.1.3,
CO2 1,2 L2, L3, L4
2.3.1,2.4.1
1.3.1,2.1.3,2.4.1,3
CO3 1,2,3 L2, L3
.2.1
1.3.1,2.1.2,2.2.1,2
CO4 1,2 L2, L3
.3.2
1.1.1,1.3.1,2.1.3,2
CO5 1,2 L2, L3
.4.1

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3 3
CO5 3 3 3
TEXTBOOKS:
1. John G. Proakis and Dimitris G. Manolakis , “Digital Signal Processing”,
PHI, Third Edition 2003.
2. McLellan, Schafer and Yoder, “Signal Processing”,Pearson, 2003.
3. RulphChassaing , “Digital signal Processing with C and TMS 320c30”, John
Wiley,First Edition,1992.
REFERENCE BOOKS:
1. Paulo S. R. Diniz, Eduardo A. B. da Silva And Sergio L. Netto , “Digital
Signal Processing System Analysis and Design”, Cambridge University
Press, 2002.
2. Sanjit K. Mitra , “Digital Signal Processing:A Computer Based Approach” ,
Tata Mcgraw-Hill Edition 2001.
3. Steven W. Smith, “The Scientist and Engineers Guide to Digital Signal
Processing “, SecondEdition, California Technical Publishing 1999.
4. Texas Instruments DSP Processors (320 family) data hand book,1988.
5. Jeff Bier, AmitShoham and Edward A Lec, S.Chand ,”DSP Processor
Fundamentals Phil Lapsley”, Delhi – 2000.

1. https://lecturenotes.in/subject/44/digital-signal-processing-dsp
MOOC:
SEE Scheme:
Unit – III.
****************
ADVANCED COMPUTER NETWORKS

(L:T:P:S)
Course Objectives:
1. Describe the 802.11 Wireless LANs and cellular internet access.
2. Explain the Mobile IP and mobility management principles in cellular
networks and its impact on higher layer protocols.
3. Describe the network support for multimedia, streaming stored video,Voice-
over-IP and protocols for real-time conversational applications.
4. Explain the principles of cryptography, digital signatures, end point
authentication, secure e-mail and TCP connections.
5. Describe the IPsec, virtual private networks, security of Wireless LANs,
firewalls and intrusion detection systems.
UNIT – I
Wireless and Mobile Networks:
Introduction, Wireless links and network characteristics, WiFi:802.11 Wireless
LANs, Cellular Internet Access, Mobiltiy Management: Principles, Mobile IP,
Managing Mobility in Cellular Networks, Wireless and Mobility: Impact on Higher-
Layer Protocols. (Text Book1 Chapter 6
15 Hours
UNIT – II
Multimedia and Networking:
Multimedia Networking Applications, Streaming stored video, Voice-over-IP,
Protocols for Real-Time Conversational Applications, Network support for
Multimedia. (Text Book-1: Chapter 7)15 Hours
UNIT – III
Security in Computer Networks:
What is network security?,Principles of cryptography,Message Integrity and Digital
Signatures, End-point Authentication, Securing E-mail, Securing TCP
Connections:SSL, Network Layer Security: IPsec and Virtual Private
Networks,SecuringWireless LANs, Operational Security: Firewalls and Intrusion
Detection Systems.(Text Book-1: Chapter 8)
9 Hours
Course Outcomes:
1. Describe and analyze the 802.11 Wireless LANs and cellular internet
access.
2. Explain the Mobile IP and mobility management principles in cellular
networks and its impact on higher layer protocols
3. Express, Analyze and Evaluate the opportunities and challenges in
multimedia data over the network. Apply best protocols and methods
towards real problems in multimedia processing.
4. Describe the principles of cryptography, digital signatures, end point
authentication, secure e-mail and TCP connections. Identify the necessity
cryptography during the transmission of data over the network.
5. Describe the IPsec, virtual private networks, security of Wireless LANs,
firewalls and intrusion detection systems. Identify the necessity,
opportunities and challenges in protecting the data during transmission over
the network.

Program
Course Bloom's
Outcomes
(POs)
(COs) Level (BTL)
Addressed
1.3.1,1.4.1, 2.1.1,2.1.2,2.2.4,
CO1 1,2 L2
2.4.3
1.3.1,1.4.1, 2.1.1,2.1.2,2.2.4,
CO2 1,2 L2
2.4.3
1.3.1,1.4.1, 2.1.1,2.1.2,2.2.4,
CO3 1,2 L4
2.3.2,2.4.3
1.3.1,1.4.1,2.1.1,2.1.2,2.2.4,
CO4 1,2 L2
2.4.3
CO5 1,2 1.3.1,1.4.1,2.1.1,2.1.2,2.2.4,2.4.3 L2

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3 1
CO2 3 3 3 1
CO3 3 3 3 1
CO4 3 3 3 1
CO5 3 3 3 1
TEXTBOOK:
1. James F. Kurose and Keith W. Ross, “Computer Networking- A Top-Down
Approach Featuring the Internet”, Sixth Edition, Pearson Education,2017.
REFERENCE BOOKS:
1. Manvi,SunilkumarS,Wireless and Mobile Networks, Concepts and
Protocols, Second Edition,Wileyindia Pvt. Ltd,2016.
2. Fred Halsall,Multimedia Communications Applications Networks Protocols
and Standards, First Edition,Pearson India,2015.
3. William Stallings,Cryptography and Network Security: Principles and
Practice,Seventh Edition,2017.

1. http://etutorials.org
2. https://www.net.t-labs.tu berlin.de/teaching/computer_networking/
MOOCs:
1. https://swayam.gov.in/explorer?category=NPTEL_Domain
2. https://www.coursera.org/browse/information-technology/networking
3. https://www.udemy.com/topic/computer-network/
SEE Scheme:
Unit – III.
************************
CYBER SECURITY

(L:T:P:S)
Course Objectives:

1. Understand the fundamental concepts of cyber security and the attacker
techniques and impact.
2. Understand the behavior, types and the impact of malicious code on to the
cyber system and the techniques used by the hackers.
3. Understand the various defensive tools and policies need to be followed.
UNIT - I
INTRODUCTION TO COMPUTER SECURITY:
Introduction, How Seriously Should You Take Threats to Network Security,
Identifying Types of Threats - Malware, Compromising System Security, Denial of
Service Attacks, Web Attacks, Session Hijacking, DNS Poisoning; Assessing the
Likelihood of an Attack on Your Network, Basic Security Terminology - Hacker
Slang, Professional Terms; Concepts and Approaches, How Do Legal Issues
Impact Network Security? Online Security Resources – CERT, Microsoft Security
Advisor, F-Secure, SANS Institute.
CYBER STALKING, FRAUD, AND ABUSE:
Introduction, How Internet Fraud Works - Investment Offers, Auction Frauds;
Identity Theft – Phishing; Cyber Stalking - Laws about Internet Fraud; Protecting
Yourself against Cyber Crime - Protecting against Investment Fraud, Protecting
against Identity Theft, Secure Browser Settings.
DENIAL OF SERVICE ATTACKS:
Introduction, Denial of Service, illustrating an Attack - Common Tools Used for DoS,
DoS Weaknesses, Specific DoS attacks, Land Attack, Distributed Denial of Service
(DDoS).
15 Hours
UNIT – II
MALWARE:
Introduction, Viruses - How a Virus Spreads, Recent Virus Examples, W32/Netsky-
P, Troj/Invo-Zip, MacDefender, The Sobig Virus, The Mimail Virus, The Bagle
Virus, A Nonvirus Virus, Rules for Avoiding Viruses; Trojan Horses, The Buffer-
Overflow Attack, The Sasser Virus/Buffer Overflow, Spyware - Legal Uses of
Spyware, How Is Spyware Delivered to a Target System? Obtaining Spyware
Software;
Other Forms of Malware – Rootkit, Malicious Web-Based Code, Logic Bombs,
Spam; Detecting and Eliminating Viruses and Spyware - Antivirus Software,
Antispyware Software.
TECHNIQUES USED BY HACKERS:
Introduction, Basic Terminology, The Reconnaissance Phase - Passive Scanning

Techniques, Active Scanning Techniques; Actual Attacks - SQL Script Injection,
Cross-Site Scripting, Password Cracking.
INDUSTRIAL ESPIONAGE IN CYBERSPACE:
Introduction, What Is Industrial Espionage? Information as an Asset, Real-World
Examples of Industrial Espionage - Example 1: VIA Technology, Example 2:
General Motors, Example 3: Interactive Television Technologies, Inc, Example 4:
Bloomberg, Inc, Example 5: Avant Software, Industrial Espionage and You; How
Does Espionage Occur? - Low-Tech Industrial Espionage, Spyware Used in
Industrial Espionage, Steganography Used in Industrial Espionage; Phone Taps
and Bugs, Protecting against Industrial Espionage, Industrial Espionage Act, Spear
Phishing.
15 Hours
UNIT – III
COMPUTER SECURITY SOFTWARE:
Introduction, Virus Scanners - How Does a Virus Scanner Work? Virus-Scanning
Techniques, Commercial Antivirus Software; Firewalls - Benefits and Limitation of
Firewalls, Firewall Types and Components, How Firewalls Examine Packets,
Firewall Configurations, Commercial and Free Firewall Products, Firewall Logs;
Antispyware, Intrusion-Detection Software - IDS Categorization, IDS Approaches,
Snort, Honey Pots, Other Pre-emptive Techniques.
SECURITY POLICIES:
Introduction, What Is a Policy, Defining User Policies – Passwords, Internet Use,
Email Usage, Installing/Uninstalling Software, Instant Messaging, Desktop
Configuration, Final Thoughts on User Policies; Defining System Administration
Policies - New Employees, Departing Employees, Change Requests, Security
Breaches, Virus Infection, Denial of Service Attacks, Intrusion by a Hacker; Defining
Access Control, Developmental Policies, Standards, Guidelines, and Procedures.
9 Hours
Table-2:
Table-1: Mapping
Mapping Levels
of COs of
to COs to POs
PIs, POs and/ PSOs
BTL
COs Program
Program Outcomes (POs) PSOs
Course
1 2 3Outcomes
4 5 6 7 8 9 10 11 12 Bloom's
1 2
CO1 3 3 (POs) 3
(COs) Level (BTL)
CO2 3 3 Addressed 3
CO3CO12 3 1, 2 1.3.1, 2.1.2, 2.2.2, 2.4.3 3L2
CO4 3 2 3
CO5CO23 2 1, 2 1.3.1,12.1.2, 2.2.2, 2.4.3 3 3L3
CO3 1, 2 1.3.1, 2.1.2, 2.2.1, 2.4.3 L2
CO4 1, 2 1.3.1, 2.4.4 L3
CO5 1, 2, 8, 12 1.3.1,2.4.4, 8.1.1,12.2.2 L3
Course Outcomes:
1. Discuss the various threats approaches on the cyber system.
2. Interpret the threat impact on the cyber system.
3. Identify the nature and varying structures of the malicious code and the
techniques used by the hackers that is harm to the security.
4. Recognize the defense tools available to protect the cyber systems.
5. Interpret the associated security policies need to be followed.
TEXTBOOK:
1. Chuck Easttom, “Computer Security Fundamentals”, Pearson publication,
second edition.
REFERENCE BOOKS:
1. William Stalling, “Cryptography and Network Security: Principles and
Practice”, Sixth edition, Pearson Education.
2. Karen Scarfone, Peter Mell“Guide to Intrusion Detection and Prevention
Systems (IDPS)”, NIST special publication 800-94.
3. Cyber Security –Nina godbole, SunitBelapure, Publication: John Wiley,
2012.
4. Allan Friedman and P. W. Singer, “Cybersecurity and Cyberwar: What
Everyone Needs to Know”, Oxford University Press, published in 2013.
5. Yuri Diogenes, ErdalOzkaya, “Cybersecurity - Attack and Defense
Strategies: Infrastructure security with Red Team and Blue Team tactics
(Kindle Edition)”, published by Packt publishing ltd. 2018.
6. Don Franke, “Cyber Security Basics: Protect Your Organization by Applying
the Fundamentals”, CreateSpace Independent Publishing Platform, 2016.
7. Joseph Steinberg, “Cybersecurity for Dummies”, John Wiley & Sons, 2019.
8. RaefMeeuwisse, “Cybersecurity for Beginners”, Cyber Simplicity, 2017.
9. Amelia Phillips, Bill Nelson, and Christopher Steuart, “Guide to Computer
Forensics and Investigations”, Cengage Learning, 2009, fourth edition.
10. Scott Augenbaum, “The Secret to Cybersecurity: A Simple Plan to Protect

Your Family and Business from Cybercrime”, publisher-Simon and
Schuster, 2019.
E-BOOKS / ONLINE RESOURCES:

1. https://heimdalsecurity.com/pdf/cyber_security_for_beginners_ebook.pdf
2. http://larose.staff.ub.ac.id/files/2011/12/Cyber-Criminology-Exploring-
Internet-Crimes-and-Criminal-Behavior.pdf
3. http://docshare04.docshare.tips/files/21900/219006870.pdf
4. http://www.uou.ac.in/sites/default/files/slm/FCS.pdf
5. https://cyber-cops.com/book_detail
6. https://www.sans.org/security-resources/
7. https://www.springboard.com/blog/free-cybersecurity-resources/
8. https://www.eccouncil.org/free-cybersecurity-resources/
MOOC:
1. www.coursera.org/course/inforisk
2. https://www.cyberdegrees.org/resources/free-online-courses/
3. https://swayam.gov.in/nd2_cec20_cs15/preview
4. https://www.classcentral.com/course/swayam-cyber-security-13978
5. https://www.futurelearn.com/courses/introduction-to-cyber-security
6. https://www.my-mooc.com/en/categorie/cybersecurity
SEE Scheme:
Unit – III.
************************
************************************
ARTIFICIAL INTELLIGENCE

(L:T:P:S)
Course Objectives:
1. Analyze the most fundamental knowledge to the students so that they can
understand what the AI is.
2. Gain a historical perspective of AI and its foundations
3. Investigate applications of AI techniques in intelligent agents, expert
systems, artificial neural networks and other machine learning models.
4. Experience AI development tools such as an ‘AI language’, expert system
shell, and/or data mining tool.
5. Explore the current scope, potential, limitations, and implications of
intelligent systems.
UNIT – I
INTRODUCTION: INTELLIGENT AGENTS
What is AI? Foundation of AI, State of Art, Agents of Environment, Structure of
agents. (Textbook-1: Chapter 1: 1.1 to 1.4 and 2.1 to 2.4)
PROBLEM SOLVING:
Problem solving agents, Example Problems, searching for solutions, Uniformed
and Informed search strategies, Heuristic Functions
(Textbook-1: Chapter 3: 3.1, 3.6), 15 Hours
UNIT – II
UNCERTIAN KNOWLEDGE AND REASONING:
Acting under uncertainty, Basic Probability Notation, Inference using full joint
distributions, Bayes Rule and its use.
(Textbook-1: Chapter 13: 13.1, 13.5)
PROBABILISTIC REASONING OVER TIME:
Time uncertainty, Temporal Models, Hidden Markov Models.
(Textbook-1: Chapter 15: 15.1, 15.3) 15 Hours
UNIT – III
REINFORCEMENT LEARNING:
Introduction, Passive Reinforcement Learning, Active Reinforcement Learning,
Generalization in Reinforcement Learning, Applications of Reinforcement Learning.
(Textbook-1: Chapter 21: 21.1 to 21.6)
9 Hours
Course Outcomes:
1. Explain the fundamental understanding of the history of artificial intelligence (AI)

and its foundation.
2. Interpret the basic principles of AI in solutions that require problem solving,
inference, perception, knowledge representation, and learning.
3. Describe the awareness and a fundamental understanding of various
applications of AI techniques in intelligent agents, expert systems, artificial
neural networks and other machine learning models.
4. Identify and explain the proficiency developing applications in an 'AI language',
expert system shell, or data mining tool.
5. Determine an ability to share in discussions of AI, its current scope
andlimitations, and societal implications.

Program
Course
Outcomes
(COs)
Addressed
CO1 1,2 1.1.1, 2.1.3, 2.2.3 L3
1.4.1, 2.1.3, 2.2.3,
CO2 1,2 L3
2.3.1,
1.4.1, 2.1.3, 2.2.3,
CO3 1,2 L3
2.3.1
1.4.1, 2.1.3, 2.2.3,
CO4 1,2,3 L4
2.3.1, 3.2.2
1.4.1, 2.1.3, 2.2.3,
CO5 1,2,3 L4
2.3.2.1

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3
CO2 3 3 3
CO3 3 3 3
CO4 3 3 2 3 2
CO5 3 3 2 3 2
TEXTBOOK:
1. Stuart Russel and Peter Nerving, “Artificial Intelligence A Modern
Approach”, Pearson 3rdEdition, 2016
REFERENCE BOOKS:
1. DAN W PATTERSON,” Introduction to Artificial Intelligence and Expert
Systems”, PEARSON, 1st edition 2015.
2. Tom. M. Mitche, “Machine Learning”, McGraw Higher Ed, 1st edition 2013.
3. Elaine Rich, “Artificial Intelligence”, Mc Graw Hill 3rd Edition, 2017.
4. Er. Rajiv Chopra, “Artificial Intelligence – A practical approach”, Chand
publication, 1st edition 2012
MOOC:
1. Artificial Intelligence -http://www.nptelvideos.in/2012/11/artificial-
intelligence.html
3. https://www.edx.org/course/artificial-intelligence-ai-columbiax-csmm-101x-4
4. https://www.udemy.com/artificial-intelligence
E-books:
1. Practical Artificial Intelligence Programming with Java, Third Edition, Mark
Watson
SEE Scheme:
Unit – III.
********************
PATTERN RECOGNITION
(L:T:P:S)
Course Objectives:
1. Explain the concepts Machine Perception, Pattern Recognition, Design
cycle, learning and Bayesian Decision Theory2
2. Explain the concepts Machine Perception, Pattern Recognition, Design
cycle, learning and Bayesian Decision Theory
3. Perform likelihood estimation, parameter estimation and complex analysis,
Demonstrate nearest neighbour rule, metrics and nearest-neighbour
classification and fuzzy classification
4. Explain the linear discriminant functions, Perceptron criterion function and
squared-error procedures
5. Apply the principles of Learning, clustering, component analysis and
multidimensional scaling.
UNIT – I
Introduction: Machine Perception, Pattern Recognition systems, Design cycle,
learning and adaptation (1.1, 1.3, 1.4, 1.5 of Ref.1) Bayesian Decision Theory:
Introduction, Bayesian Decision theory – continuous features, classifiers,
discriminant functions, and decision surfaces, normal density and discriminant
functions, Bayes decision theory – discrete features (2.1, 2.2, 2.4, 2.5, 2.6, 2.9 of
Ref. 1). Maximum likelihood and Bayesian parameter estimation: Introduction,
maximum likelihood estimation, Bayesian Estimation, Bayesian parameter
estimation, problem of dimensionality, sufficient and exponential family, complex
analysis & discriminants, (3.1 to 3.8 of Ref.1).
15 Hours
UNIT – II
Nonparametric Techniques: Introduction, Density Estimation, Parzen Windows,

k-nearest neighbour estimation, nearest neighbour rule, metrics and nearest-
neighbour classification, fuzzy classification, reduced coulomb energy,
approximations by series expansions (4.1 – 4.9 of Ref.1)
Linear discriminant functions: Introduction, linear discriminant functions,
generalized linear discriminant functions, minimizing the Perceptron criterion
function, relaxation procedures, non-separable behaviours, minimum squared-error
procedures, Ho-Kashyap procedures (5.1 to 5.9 of Ref.1 ).
15 Hours
UNIT – III
Unsupervised learning and clustering: Mixture densities and identifiability,

maximum-likelihood estimates, application to normal mixtures, unsupervised
Bayesian learning, data decryption and clustering, criterion functions and
clustering, hierarchical clustering, on-line clustering. Component analysis, low-
dimensional representations and multidimensional scaling (10.1 to 10.14 except
10.8, 10.12 of Ref. 1) Syntactic pattern Recognition: Overview, qualifying structure
in pattern description and recognition, grammar-based approach, elements of
formal grammar (Chap. 3 of Ref. 2)
9 Hours
Course Outcomes:
1. Recall the basics of pattern recognition systems and Bayesian Decision
Theory.
2. Determine the maximum likelihood and Bayesian parameter estimation.
3. Express the nonparametric techniques such as density estimation and
nearest neighbour estimation.
4. Examine linear discriminant functions, minimizing the perception criterion
function and minimum squared-error procedures
5. Describe the various unsupervised learning and clustering methods.

Program
Course
Outcomes
(COs)
Addressed
CO1 1,2 1.1.1, 2.1.3, 2.2.3 L2, L3
CO2 1,2 1.3.1, 2.1.3, 2.3.1, L2, L3
1.4.1, 2.1.3, 2.2.3,
CO3 1,2 L2, L3
2.3.1
1.4.1, 2.1.3, 2.2.3,
CO4 1,2,3 L2, L3, L4
2.3.1, 3.2.2
1.4.1, 2.1.2, 2.2.3,
CO5 1,2,3 L2, L3, L4
2.3.2.1

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3
CO2 3 3 3
CO3 3 3 3
CO4 3 3 2 3 2
CO5 3 3 2 3 2
TEXTBOOKS :
1. Richard O. Duda, Peter E. Hart and David G Stork,” Pattern Classification”,
John Wiley & Sons, Inc.2nd Ed. 2001.
2. Robert Schalkoff, “Pattern Recognition: Statistical, Structural and Neural
Approaches”, John Wiley & Sons, Inc.1992.
REFRENCE BOOKS:
1. Christopher M. Bishop, "Pattern recognition and machine learning
(information science and statistics).” Springer -Verlag New York Inc,2006.
2. Anzai, Yuichiro,”Pattern recognition and machine learning”, Elsevier, 2012.

1. http://www.37steps.com/data/pdf/PRIntro_medium.pdf
MOOC:
1. https://www.mooc-list.com/tags/pattern-recognition
SEE SCHEME
There will be 8 questions of 20 marks each in the question paper divided into
3 Units as per the syllabi & contact hours and the student will have to answer 5 full
Unit – III.
************************
SOCIAL AND WEB ANALYTICS

(L:T:P:S)
Course Objectives:
1. Understand social media, web and social media analytics, and their
potential impact.
2. Determine how to Leverage social media for better services and
Understand usability metrics, web and social media metrics
3. Use various data sources and collect data relating to the metrics and key
performance indicators
4. Identify key performance indicators for a given goal, identify data relating to
the metrics and key performance indicators
5. Use ready-made web analytics tools (Google Analytics) and be able to
understand a statistical programming language (R), also use its graphical
development environment (Deduce) for data exploration and analysis.
UNIT – I
Introduction to web and social analytics: Overview of web & social media (Web
sites, web apps, mobile apps and social media), Impact of social media on
business, Social media environment, , How to leverage social media for better
services, Usability, user experience, customer experience, customer sentiments,
web marketing, conversion rates, ROI, brand reputation, competitive advantages.
Need of using analytics, Web analytics technical requirements., current analytics
platforms, Open Source vs licensed platform, choosing right specifications &
optimal solution, Web analytics and a Web analytics 2.0 framework (clickstream,
multiple outcomes Relevant Data And its Collection using statistical Programming
language R.:Data (Structured data, unstructured data, metadata, Big Data and
Linked Data), Participating with people centric approach, Data analysis basics
(types of data, metrics and data, descriptive statistics, comparing, Basic overview
of R:R-Data Types, R-Decision Making, R-Loops, R-functions, R-Strings, Arrays, R-

Lists, R-Data Frame, R-CSV Files, R-Pie Charts, R-Bar charts, R-Barplots. Basic
Text Mining in R and word cloud.
15 Hours
UNIT – II
Kpi/Metrics: Understand the discipline of social analytics, Aligning social objectives
with business goals, Identify common social business objectives, developing KPIs;
Standard vs Critical metrics. PULSE metrics (Page views, Uptime, Latency, Seven-
day active users) on business and technical Issues, HEART metrics (Happiness,
Engagement, Adoption, Retention, and Task success) on user behaviour issues;
Bounce rate, exit rate, conversion rate, engagement, strategically aligned KPIs,
Measuring Macro & micro conversions, On-site web analytics, off-site web
analytics, the goal-signal-metric process. Case study on Ready-made tools for Web
and social media analytics (Key Google Analytics metrics, dashboard, social
reports, Tableau Public and KNIME
Mining Twitter: Exploring Trending Topics, Discovering What People Are
Talking About, and More: Why Is Twitter All the Rage?, Exploring Twitter’s API,
Fundamental Twitter Terminology, Creating a Twitter API Connection, Exploring
Trending Topics, Searching for Tweets, Analyzing the 140 Character, Extracting
Tweet Entities, Analyzing Tweets and Tweet Entities with Frequency Analysis,
Computing the Lexical Diversity of Tweets, Examining Patterns in Retweets,
Visualizing Frequency Data with Histograms.
Mining Facebook: Analysing Fan Pages, Examining Friendships, and More:
Overview, Exploring Facebook’s Social Graph API, Understanding the Social Graph
API, Understanding the Open Graph Protocol, Analyzing Social Graph
Connections, Analyzing Facebook Pages, Examining Friendships.
15 Hours
UNIT –III
Data Mining in Social Media :Introduction, Data Mining in a Nutshell, Social
Media, Motivations for Data Mining in Social Media, Data Mining Methods for Social
Media, Data Representation, Data Mining - A Process, Social Networking Sites:
Illustrative Examples, The Blogosphere: Illustrative Examples, Related Efforts,
Ethnography and Netnography, Event Maps
Text Mining in Social Networks
Introduction, Keyword Search, Query Semantics and Answer Ranking, Keyword
search over XML and relational data, Keyword search over graph data,
Classification Algorithms, Clustering Algorithms, Transfer Learning in
Heterogeneous Networks
9 Hours
Course Outcomes:
1. Understand social media, web and social media analytics, and their potential
impact.
2. Identify and explain ready-made web analytics tools (Google Analytics) and
able to understand a statistical programming language (R).

3. Identify key performance indicators for a given goal, identify data relating to the
metrics and key performance indicators.
4. Determine how twitter mining can be done for better services.
5. Explain text mining and data mining in social networks.

Program
Course Bloom's
Outcomes Taxonomy
(POs) (PI)
(COs) Level (BTL)
Addressed
CO1 1,2,3 1.1.2,1.1.2,1.3.1 L4
2.1.1 ,2.1.2 ,2.1.3 ,2.2.2,
CO2 1,2 L3
2.2.3
CO3 1,2 1.1.2,1.4.1,2.1.2 ,2.1.3, L3
CO4 1,2 1.2.1,1.3.1,1.4.1,2.4.1, L3
CO5 1,2 1.2.1,1.3.1,1.4.1,2.1.3 L4

s 1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO 2 2 2
1
CO 3 2 3 3
2
CO 2 3 1
3
CO 1 2 2
4
CO 2 2 2
5
TEXTBOOKS:
1. Matthew A. Russell,” Mining of Social web, O′Reilly”, Second Edition ,ISBN-
13: 978-1449367619, 2013,
2. Charu C Agarwal, “Social Network Data Analytics”, Springer; October 2014.
REFERENCE BOOKS:
1. Hand, Mannila, and Smyth,”Principles of Data Mining”, Cambridge, MA: MIT
Press, ISBN: 026208290X, 2001.

2. AvinashKaushik, “Web Analytics 2.0: The Art of Online Accountability and
Science of Customer Centricity”, John Wiley &Sons; Pap/Cdr Edition, 2009.
3. Tom Tullis, Bill Albert, “Measuring the User Experience: Collecting,
Analyzing, and Presenting Usability Metrics”, First Edition, Morgan
Kaufmann ,2008.
4. Jim Sterne, Social Media Metrics: “How to Measure and Optimize Your
Marketing Investment”, John Wiley & Sons ,2010.
5. Brian Clifton, “Advanced Web Metrics with Google Analytics”, Third Edition,
John Wiley & Sons ,2012.

1. http://www.webpages.uidaho.edu/~stevel/504/Mining-the-Social-Web-2nd-
Edition.pdf
2. http://dbmanagement.info/Books/MIX/Computer_Science_Mit_Press_Princi
ples_Of_Data_Mining_Big_Data.pdf
MOOC:
1. Stanford: http://library.stanford.edu/projects/r
2. http://nptel.ac.in/courses/106106146/21#watch
3. https://www.coursera.org/learn/social-media-data-analytics
SEE Scheme:
Unit – III.
*********************
NEURAL NETWORKS AND DEEP LEARNING

(L:T:P:S)
Course Objectives:
1. Explain the importance and basics of deep learning
2. Outline the structure of neural network and the process of training in neural
networks
3. Describe the structure and working of convolution neural networks.
UNIT - I
Introduction: What is Deep Learning? What are Neural Networks? Neural
networks basics: cost functions, hypotheses and tasks; training data; maximum
likelihood-based cost, cross entropy, MSE cost; feed-forwardnetworks; MLP,
sigmoid units; neuroscience inspiration;
15 Hours
UNIT - II
Neural Networks Training:Learning in neural network: output vs hidden layers;
linear vs nonlinear networks; Back propagation: learning via gradient descent;
recursive chain rule (backpropagation); if time: bias-variance tradeoff,
regularization; output units: linear, softmax; hidden units: tanh, RELU; Deep
learning strategies: GPU training, regularization, RLUs, dropout.
Convolution Neural Networks: Invariance, stability, Variability models
(deformation model, stochastic model), Scattering networks, Group Formalism,
Properties of CNN representations: invertibility, stability, invariance,
15 Hours
UNIT - III
Covariance/invariance: capsules and related models, Connections with other
models: dictionary learning, LISTA, localization, regression, Embeddings (DrLim),
inverse problems, Extensions to non-Euclidean domains.
Deep Neural Networks for Sequences: Recurrent Neural Networks: RNN for
language modelling and other tasks
9 Hours
Course Outcomes:
1. Demonstrate the importance and basic of deep learning.
2. Illustrate the various training methods of neural network.
3. Explain the cocept of convolution and apply this for neural network design.
4. Explore and develop neural network models
5. Apply Convolution neural networks and recurrent neural networks for real world
Problems

Course Bloom's
Program Outcomes Performance
(POs) Addressed Indicators (PI)
(COs) (BTL)
CO1 1,2 1.1.1, 2.1.3, 2.2.3 L2, L3
1.4.1, 2.1.3, 2.2.3,
CO2 1,2 L2, L3
2.3.1,
1.4.1, 2.1.3, 2.2.3,
CO3 1,2,3 L2, L3
2.3.1
1.4.1, 2.1.2, 2.2.5,
CO4 1,2 L2, L3, L4
2.3.1, 3.2.2
1.4.1, 2.1.3, 2.2.3,

CO5 1,2,3 L2, L3, L4
2.3.2

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3
CO2 3 3 3
CO3 3 3 2 3
CO4 3 3 2 3
CO5 3 3 2 3 2
TEXTBOOK:
1. Ian Goodfellow, YoshuaBengio, Aaron Courville , “Deep
Learning”,Cambridge: MIT press, 2016.
REFERENCE BOOKS:
1. Duda, R.O., Hart, P.E., and Stork, D.G.,”Pattern Classification”, Wiley-
Interscience. Second Edition. 2001.
2. Theodoridis, S. and Koutroumbas, K.,”PatternRecognition”,Fourth Edition,
Academic Press, 2008.
3. Russell, S. and Norvig, N, Artificial Intelligence: “A Modern Approach”,
Prentice Hall Series in ArtificialIntelligence. 2003.
4. Bishop, C. M.,”Neural Networks for Pattern Recognition”, Oxford University
Press. 1995.
5. Hastie, T., Tibshirani, R. and Friedman, J,”The Elements of Statistical
Learning”, Springer. 2001.

1. http://cs224d.stanford.edu/syllabus.html
2. https://www.cs.colorado.edu/~mozer/Teaching/syllabi/DeepLearningFall201
7/
MOOC:
1. https://www.class-central.com/course/kadenze-creative-applications-of-
deep-learning-with-tensorflow-6679
2. https://www.class-central.com/course/practical-deep-learning-for-coders-
part-1-7887
SEE SCHEME
There will be 8 questions of 20 marks each in the question paper divided into 3
questions, selecting 2 full questions from Unit - I & Unit – II and 1 full question from
Unit – III.
BUSINESS INTELLIGENCE
(L:T:P:S)
1. Identify various sources of data and identify the methods to process them.
2. Explain the ETL process and carryout the ETL process for a given data set.
3. Design a suitable schema for a given problem.
4. Illustrate the concepts of data mining.
5. Demonstrate the Classification and clustering methods.
UNIT – I
INTRODUCTION TO BUSINESS INTELLIGENCE:
Types of digital data – Structured, semi structured and unstructured – sources,
characterises, challenges; Introduction to OLTP, OLAP and Data Mining; BI
Definitions & Concepts; BI Framework, Who is BI for, BI Users, BI Applications;BI
Roles & Responsibilities,
Need for data warehouse – definition, data mart, Approaches for data warehouse,
ETL, Basics of Data Integration – approaches, advantages.
Text Book 1 Chapter [2.3-2.5] [(3.1-3.5), (3.8)] [5.1-5.5] [(6.1-6.3), (6.5-6.10)]
15 Hours
UNIT – II
Introduction to data quality, data profiling, Multidimensional data modelling –
Basics, types of data model, Concepts of dimensions, facts, cubes, attribute,
hierarchies, star and snowflake schema; Dimension model life cycle.
Measure, metrics, KPIs and performance management, salient attributes of a good
metric, SMART test.
Introduction to enterprise reporting – perspectives, standardization and
presentation, balanced scorecards. Concepts of dashboards- types, steps.
Text Book 1 Chapter [6.10-6.12] [7.2-7.8] [(8.2-8.3)] [((9.1-9.2) (9.4-9.7)]
15 Hours
UNIT – III
Data Mining—On What Kind of Data? Data Mining Functionalities—What Kinds of
Patterns Can Be Mined? Mining Association rules: Basic concepts, frequent item
set mining methods - Apriori Algorithm, Generating Association Rules from
Frequent Item sets.
Text Book 2: Chapter [1.1-1.4][6.1-6.2(6.2.1-6.2.4)]
9 Hours
Course Outcomes:

1. Identify the sources of data based on its type for a business application and
apply OLTP, OLAP operations. (L3)
2. Apply the knowledge of BI operation to determine various roles in a BI
application and design the ETL process for handling the data from a given
application. (L3)
3. Relate the data warehousing concepts for a real time business application
to model a star, snowflake schema for a multi-dimensional data of a given
problem. (L3)
4. Explain data quality and profiling methods, identify the quality of the data
using data profiling techniques. Apply the measures and metrics to the data
to design an enterprise report. (L3)
5. Apply the concepts of mathematics and computer algorithm to illustrate the
data mining concepts using association rules. (L2)

Course Program Performance Bloom's
Outcomes Outcomes (POs) Indicators (PI) Taxonomy Level
CO1 1,2 1.4.1, 2.2.2 L2
CO2 1,2,3 1.4.1, 2.2.3, 3.2.2 L3
1.4.1, 2.1.1, 2.1.2,
CO3 1,2,3 L3
3.2.2,3.2.3
1.4.1, 2.1.2, 2.2.2,
CO4 1,2,3 L3
3.2.2
CO5 1,2 1.4.1,2.1.3,2.4.1 L2

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 1 1 1 1 3
CO2 1 2 3 1 1 1 3
CO3 1 2 3 1 1 1 3
CO4 1 2 2 1 1 1 3
CO5 2 3 1 1 1 3
3: Substantial (High) 2: Moderate (Medium) 1: Poor
(Low)
TEXTBOOKS:
1. R N Prasad and Seema Acharya, “Fundamentals of Business Analytics”,

Wiley-India, 2011
2. Jiawei Han and MichelineKamber, “Data Mining: Concepts and

Techniques”,
Morgan Kaufmann Publishers, (ISBN: 1-55860-489-8), 2000.
3. David Loshin, “Business Intelligence -The Savvy Manager's Guide”, Morgan
Kaufmann Publishers,2003.
REFERENCE BOOKS:
1. Carlo Vercellis “Business Intelligence-Datamining and Optimization for
Decision Making”,Wiley,2009
2. Uddagiri Chandrasekhar S.K. Shinde,”Data Mining and Business
Intelligence”, Dreamtech Press,2015.

1. https://cdn.ttgtmedia.com/searchDataManagement/downloads/Data_Wareh
ouse_Design.pdf
2. http://download.101com.com/tdwi/ww24/WhatWorks24DigitalEdition.pdf
MOOC:
2. https://freevideolectures.com/course/3635/microsoft-business-intelligence
SEE SCHEME
Unit – III.
*******************************
BIG DATA ANALYTICS

(L:T:P:S)
Course Objectives:
1. Study andcomprehend in depth the fundamental issues behind Big Data

problem.
2. UnderstandvariousBig Data technologies, different databases and Hadoop
Components.
3. Learn various NoSQL systems and Compare NoSQL systems with other and
relational systems.
4. Determinevarious techniques for analyzing the data such as Pig and Hive.
5. Study and Relate Different Analytics associated with Big Data problem.
UNIT – I
Chapter 1: What Is Big Data and Why Is It Important? Challenges of Big Data.
The Evolution of Data Management, Understanding the Waves of Managing Data,
creating manageable data structures, Web and content management,Managing big
data. Defining Big Data, building a Successful Big Data Management Architecture,
beginning with capture, organize, integrate, analyze, and act, Setting the
architectural foundation, Performance matters, Traditional and advanced analytics.
Chapter 2: Examining Big Data Types and its Sources.

Defining Structured Data Exploring sources of big structured data, Understanding
the role of relational databases in big data Defining Unstructured Data, exploring
sources of unstructured data, Understanding the role of a CMS in big data
management. Looking at Real-Time and Non-Real-Time Requirements, Putting Big
Data Together, managing different data types, integrating data types into a big data
environment.
Chapter 3: Technology Foundations of Big Dat.
Exploring the Big Data Stack: - Layer 0: Redundant Physical Infrastructure -

Physical redundant networks, Managing hardware: Storage and servers,
Infrastructure operations - Layer 1: Security Infrastructure, Interfaces and Feeds to
and from Applications and the Internet- Layer 2: Operational Databases. Layer 3:
Organizing Data Services and Tools. Layer 4: Analytical Data Warehouses, Big
Data Analytics, Big Data Applications.
(Text Book-1: chapter 1,2,4)
15 Hours
UNIT – II
Chapter 4 : Big Data Management. Introduction to NoSQL, NewSQL

Introduction to NoSQL, Uses, Features and Types, Need, Advantages,
Disadvantages and Application of NoSQL, Overview of NewSQL. RDBMSs Are
Important in a Big Data Environment. PostgreSQL relational database.
Nonrelational Databases. Key-Value Pair Databases - Riak key-value database.
Document Databases MongoDB, CouchDB . Columnar Databases, HBase
columnar database. Graph Databases- Neo4J graph database.
Chapter 5 : MapReduce Fundamentals

Tracing the Origins of MapReduce. Understanding the map Function, Adding the
reduce Function Putting map and reduce together.
(Text Book-1: Chapter 7,8)
15 Hours
UNIT – III
Chapter 6 : Hadoop Eco System and Analytics of Big data.

Explaining Hadoop, Understanding the Hadoop Distributed File System (HDFS)
NameNodes. Data nodes, Under the covers of HDFS. Hadoop MapReduce.
Getting the data ready, Let the mapping begin. Reduce and combine. Building a
Big Data Foundation with the Hadoop Ecosystem, Managing Resources and
Applications with Hadoop YARN, Storing Big Data with HBase, Interacting with Pig
and Pig latin, Sqoop, Zookeeper.
Chapter 7: Defining Big Data Analytics.Basic analytics, Advanced analytics,
Operationalized analytics, Monetizing analytics. Modifying Business Intelligence
Products to Handle Big Data, Studying Big Data Analytics Examples.
(Text Book-1: Chapter 9,10,12)
9 Hours
Course Outcomes:
15 Outline the theory of big data, and explain applications of big data.
16 Analysethe technological foundations for Big data with hadoop and design
of hadoop distributed file system.
17 Get the idea of NoSQL databases, different types of NoSQL/NewSQL
datastores.
18 Understand the concept of MapReduce workflow.
19 Understand the need of Big Data Analytics and Analyze Hadoop
Ecosystem.

Program
Course
Outcomes
(COs)
Addressed
CO1 1,2 2.1.3, 2.2.3,2.2.4 L3
1.4.1, 2.1.3, 2.2.3,
CO2 1,2,3 L3
2.3.1, 3.2.2
1.4.1, 2.1.3, 2.2.3,
CO3 1,2 L3
2.3.1
1.4.1, 2.1.3, 2.2.3,
CO4 1,2,3 L4
2.3.1, 3.2.2
1.4.1, 2.1.3, 2.2.3,
CO5 1,2 L4
2.3.2

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3
CO2 3 3 3 3
CO3 3 3 3
CO4 2 2 3 3
CO5 3 3 3
TEXTBOOK:
1. Judith Hurtiwz, Alan Nugent, Dr. Fern Halper, Marica Kaufman “Big Data for
Dummies” A wiley Brand.
REFERENCE BOOKS:
1. Minelli, Chambers, Dhiray,“Big Data Big Analytics”, Wiley,2013.
2. Bart Baesens , “Analytics in a Big Data World”, Wiley,2014.
3. Boris Lublinsky, Kevin T. Smith, “Hadoop Solutions”, Wrox, First
Edition,2013
4. Chuck Lam, “Hadoop in Action”, Dreamtech, 2011.
5. SeemaAcharya, SubhashiniChellappan, “Big Data and Analytics”,
Wiley,2017.
6. Alex Holmes,“Big Data Black Book”, Dreamtech, 2015.

ftp://public.dhe.ibm.com/software/pdf/at/SWP10/Big_Data_Analytics.pdf
https://www.wileyindia.com/big-data-analytics-2ed.html
MOOCs:
1. https://www.coursera.org/specializations/big-data
2. nptel.ac.in/courses/106104135/48
SEE SCHEME
Unit – III.
************************
IMAGE PROCESSING
(L:T:P:S)
Course Objectives:
1. Outline the theory behind the basics of digital image processing, the
relation between the components of image processing system. Make use
ofElectromagnetic Spectrum, find the equivalence between pixels.
2. Make use of spatial and frequency domain, smoothing and sharpening
filters.
3. Make use ofHomomorphic Filtering and how to simplifyDetection of
Discontinuities.
4. Get the idea of Models Elements of Information, find the equivalence
between Dilation and Erosion, Opening and Closing, and identifythe Hit-or-
Miss Transformation. Understand different compression model.
5. TellhowComponents of an Image Processing System works, their design,
and get the feeling of Histogram Processing.
UNIT – I
Introduction-What Is Digital Image Processing? Examples of Fields that Use

Digital Image Processing, Fundamental Steps in Digital Image Processing,
Components of an Image Processing System. Digital Image Fundamentals -
Elements of Visual Perception, Light and the Electromagnetic Spectrum, Image
Sensing and Acquisition, Image Sampling and Quantization, Some Basic
Relationships between Pixels.
Intensity Transformations and Spatial Filtering -Background, Some Basic
Intensity Transformation Functions, Histogram Processing-Histogram Equalization,
Histogram Matching. Local Histogram Processing, Fundamentals of Spatial
Filtering, Smoothing Spatial Filters, Sharpening Spatial Filters.
[Text book chapters 1,2,3]
15 Hours
UNIT – II
Filtering in Frequency Domain – Background, Sampling and the Fourier
Transform of Sampled Functions, The Discrete Fourier Transform (DFT)of
Functions of one continuous variable, Image smoothing using Frequency-Domain
Filters – Ideal Lowpass Filters, Butterworth Lowpass Filters, Gaussian Lowpass

Filters, Image Sharpening using Frequency Domain Filters -Ideal Highpass Filters,
Butterworth Highpass Filters, Gaussian Highpass Filters, Homomorphic Filtering.
[Text book chapter 4.1,4.3,4.4,4.8,4.9]
Image Compression – Fundamentals- Coding Redundancy, Spatial and Temporal
Redundancy, Image Compression Model. Some Basic Compression Model –
Huffman Coding, Arithmetic Coding, LZW coding, Bit-Plane Coding, Run -Length
Coding.
[Text book chapter 8.1,8.2]
Morphological Image Processing – Preliminaries, Dilation and Erosion, Opening
and Closing, the Hit-or-Miss Transformation, Some Basic Morphological Algorithms
-Boundary Extraction, Thinning, Thickening
[Text book chapter 9.1,9.2,9.3,9.4,9.5]
15 Hours
UNIT- III
Image Segmentation – Point, Line and Edge Detection – Background, Detection

of Isolated Points, Line Detection, Edge Model, Basic Edge Detection, Edge Linking
and Boundary Detection, Thresholding- Foundation, Basic Global Thresholding,
Region Based Segmentation Region growing, splitting and merging.
[Text book chapter 10.1,10.2,10.3,10.4]
9 Hours
Course Outcomes:
1. Apply the concept of Digital Image Processing andSteps in Digital Image
Processing, Able to applytheKnowledgeofImage Sampling and
QuantizationandIllustrate Some Basic Relationships between Pixels using
Knowledge of 4-8 and M adjacency.
2. Design and Formulate Histogram processing. Analyze Smoothing Spatial
Filters, Sharpening Spatial Filters by applying mathematicalknowledge.
3. Explain Frequency domain and illustrate Smoothing Frequency-Domain
Filters. Analyze Sharpening Frequency-Domain Filters.
ApplyandDesignImage Compression Standards and models.
4. Analyzethe concept of Morphological Image Processing by applying
mathematical knowledge.
5. Design and Formulate Image segmentation techniques and prove the
properties Region-Based Segmentation.
Table 1: Mapping of COs to PIs, POs and BTL

Performance
Indicators (PI)
CO1 1,2,3 1.4.1, 2.4.2, 3.2.2 L2
CO2 2 2.1.3, 2.4.2 L3
1.4.1, 2.4.2
CO3 1,2 L2
CO4 1,3,4 1.4.1, 3.2.2, 4.2.1 L3
CO5 2,4 2.4.2, 4.2.1 L3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 2 3 3 2
CO2 3 3
CO3 2 3 3
CO4 2 3 3 2
CO5 2 3 3 2
TEXTBOOK:
1. Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”,
Pearson Education, Third Edition.
REFERENCE BOOKS:
1. Digital Image Processing withMatlab&LabviewVipula Singh Published by
Reed Elsevier India Pvt.Ltd | Language - English | Binding - Paper Back.
2. Anil K Jain, “Fundamentals of Digital Image Processing”, Prentice-Hall of
India Pvt. Ltd., 1997.
3. Milan Sonka, Vaclav Hlavac and Roger Boyle, “Image Processing, Analysis
and Machine Vision”, Thomoson Learning, Brooks/Cole, Second Edition.
2001.
4. B.Chanda, D DuttaMajumder, “Digital Image Processing and Analysis”,
Prentice- Hall, India, 2002.
5. StevenW.Smith,“The Scientist and Engineers Guide to Digital Signal
Processing “, California Technical Publishing, SecondEdition, 1999.

1. iitlab.bit.edu.cn/HandbookofImageandVideoProcessing.pdf
2. http://www.cs.ukzn.ac.za/~sviriri/Books/Image-Processing/book4.pdf
MOOC:
1. https://nptel.ac.in/courses/117105079/
2. https://swayam.gov.in/nd1_noc19_ee55/preview
3. https://www.coursera.org/learn/image-processing
4. https://www.coursera.org/learn/image-processing
SEE SCHEME
Unit – III.
************************
NATURAL LANGUAGE PROCESSING

(L:T:P:S)
Course Objectives:
This course will enable students to

1. Explain the importance of NLP and breaking of words.
2. Outline the syntax, semantics and pragmatics in speech language.
3. Describe the models for different applications of NLP.
UNIT - I
Knowledge in speech and language processing; Ambiguity; Models and

algorithms; Regular expressions - Basic Regular Expression Pattern, Disjunction,
Grouping, and Precedence, A Simple Example, A More Complex Example,
Advanced Operators(2.1.1 - 2.1.5), Using an FSA to Recognize Sheep-talk,
Formal Languages, Another Example, Non-Deterministic FSAs, Using an NFSA to
Accept String(2.2.1 - 2.2.5); Words and Transducers - Inflectional Morphology,
Derivational Morphology, Cliticization, Non-concatenative Morphology,
Agreement(3.1.1 - 3.1.5); Finite-state morphological parsing(3.2); Detecting and
correcting spelling errors, Minimum edit distance(3.10 - 3.11), N-Grams - Counting
words in corpora, Simple(un-smoothed) n-grams(4.1 - 4.2); Part – of - Speech
Tagging - English word classes, tagsets for English(5.1 - 5.2), Hidden Markov
Models - Markov chains, The Hidden Markov Model(6.1 - 6.2).
(Refer Text Book 1)15 Hours
UNIT – II
Syntactic Parsing: Grammars and syntax structure, A top down parser, Depth first
strategy vs Breadth first strategy, Bottom up chart parser, Efficiency considerations,
Transition Network Grammars, Top down chart parser.
(Refer Text Book 2)
Representing Meaning: Computational desiderata for representations, Meaning
structure of language, Model theoretic semantics, First order logic. (17.1 – 17.4)
Computational Semantics: Syntax driven semantic analysis, Semantic
augmentations to context-free grammar rules, Quantifier scope ambiguity and
under specification, Unification based approaches to semantic analysis. (18.1 –
18.4)
Applications:Information Extraction - Named entity recognition, Relation detection
and classification, Temporal and event processing, Template filling (22.1-22.4).
(Refer Text Book 1)15 Hours
UNIT – III
Question Answering and Summarization – Information retrieval, Factoid question
answering, Summarization, Multi document summarization (23.1 – 23.4); Dialog
and Conversational Agents - Properties of human conversations, Basic dialogue
systems, VoiceXML (24.1-24.3)
9 Hours
(Refer Text Book 1)
Course Outcomes:
1. Explain the understanding of core tasks in NLP.
2. Demonstrate the syntax, semantics and pragmatics in speech language.
3. Implement and experiment the models for different applications of NLP.
4. Demonstrate understanding of state-of-the-art algorithms and techniques
for text-based processing of natural language.
5. Demonstrate understanding of human languages and be familiar with the
most mainstream descriptive and theoretical frameworks for handling their
properties.

Performance
Indicators (PI)
CO1 1,2 1.3.1, 1.4.1, 2.1.3 L3
CO2 1,2,3 1.3.1, 1.4.1, 2.1.2 L3
CO3 1,2 1.3.1, 1.4.1, 2.1.3 L3
CO4 1,2,3 1.3.1, 1.4.1, 2.1.2 L3
CO5 1,2 1.3.1, 1.4.1, 2.1.2 L3

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 3
CO2 1 2 3 3
CO3 2 3 3
CO4 1 2 3 3
CO5 2 3 3
TEXTBOOKS:
1. Jurafsky, D. and J. H. Martin,” Speech and language processing: An
Introduction to Natural Language Processing, Computational Linguistics, and
Speech Recognition”, Second Edition, Prentice Hall, 2008.
2. Allen, James,“Natural Language Understanding”, Second
Edition,Benjamin/Cumming, 1995.
REFERENCE BOOKS:
1. Steven Bird, S., Klein, E., Loper, E, “Natural Language Processing with
Python-Analyzing Text with the Natural Language Toolkit”, O'Reilly Media,
2010.
2. Grant S Ingersoll, Thomas S. Morton, and Andrew L. Farris,”Taming text: how
to `find, organize, and manipulate it” Manning Publications Co., 2013.
3. Feldman Ronen, and James Sanger,”The text mining handbook: advanced
approaches in analyzing unstructured data”,Cambridge university press,2007.
4. Christopher D Manning, and HinrichSchütze,” Foundations of statistical
natural language processing”,MIT press, 1999.

1. http://www.allitebooks.in/mastering-natural-language-processing-python/
2. https://github.com/hayderimran7/free-tech-ebooks-from-
packtpub/tree/master/Natural%20Language%20Processing%20with%20Java%
20and%20LingPipe%20Cookbook
MOOC:
1. https://www.experfy.com/training/courses/natural-language-processing-for-retail
2. https://www.class-central.com/course/coursera-natural-language-processing-
9603
SEE SCHEME
Unit – III.
************************
SOFT COMPUTING
(L:T:P:S)
Course Objectives:
1. Differentiate hard and soft computing, Define SC constitutes, List Applications,
Outline Intelligent systems architecture
2. Design conceptual GA algorithm, Illustrate Mutation and Cross over operations,
define learning strategies, List ML applications, Describe the architecture of
learning agent
3. Explain the structure and function of Biological Neuron, discuss MFF networks,
represent back propagation
4. Demonstrate fuzzy operations, membership function, compare fuzzy models,
derive fuzzy rules, outline Fuzzy inference systems
5. Analyse decision making strategies, list expert system features, tools, explain
expert’s system architecture
UNIT – I
Introduction to Soft Computing:
Evolution of Computing, Soft and Hard Computing, Soft Computing characteristics,
Constituents and Applications, AI Definitions and Intelligent systems architecture.
Genetic Algorithms:
Introduction to Genetic Algorithms (GA) – Conceptual GA algorithm, Reproduction
operators Mutation and Cross over, Applications of GA, Learning Definitions,
strategies, Machine Learning Approach, applications and architecture of learning
agent
(Text Book-1:, Chapter 1 .1 to 1.3)(Text Book-3:, Chapter 1 )
(Text Book -4; ,Chapter 1 and 215 Hours
UNIT – II
NEURAL NETWORKS:
Introduction to Neural Networks, Applications, Structure and function of Biological
Neuron, ANN introduction,Perceptron, Multi-layer feed forward Networks with Back
propagation
FUZZY LOGIC:
Fuzzy Sets,Operations on Fuzzy Sets, MembershipFunctions, Fuzzy Rules,
Models,Fuzzy Reasoning and Fuzzy Inference Systems.
(Text Book-1:, Chapters (2 ,3 and 4), 8.1 to 8.315 Hours
UNIT - III
Decision Making and Expert Systems:
Single person, Multi person, Multi criteria and Multi stage decision making, Expert
system features, architecture and applications
(Text Book-2:, Chapter s (1 , 2 and 3 ) 9 Hours
Course Outcomes:
1. Acquire Knowledge about different constitutes of Soft Computing making use
of diagrams and its applications
2. IllustrateGenetic Algorithms (GA) – Conceptual GA algorithm, Reproduction
operators Mutation and Cross over, Applications of GA. Utilize learning
approaches and agents
3. Outline the neural networks basics, network architectures, back propagation
algorithm and applications
4. Overview of Fuzzy logic concepts, MembershipFunctions, Fuzzy Rules
andDescribe Fuzzy Models,Fuzzy Reasoning and Fuzzy Inference Systems
5. Explain Single person, Multi person, Multi criteria and Multi stage decision
making.Acquire knowledge on Expert system features, architecture and
applications

Performance
Indicators (PI)
1.2.1, 1.3.1, 1.4.1, 1,4,2
CO1 1,2 L3
2.1.1,2.2.3
CO2 1,2 1.4.1, 2.1.3, 2.2.3, 2.3.1 L3
CO3 1,2 1.4.1, 2.1.3, 2.2.3, 2.3.1 L3

1.4.1, 2.1.3, 2.2.3, 2.3.1,
CO4 1,2 L3
2.3.2
1.4.1, 2.1.3, 2.2.3, 2.3.2
CO5 1,2 L3
2.2.1, 2.2.2

1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 2 3 1 1 2 2
CO2 2 3 3 1 1 2 2
CO3 2 2 3 1 1 2 2
CO4 2 2 2 1 1 1 3
CO5 1 2 3 1 1 1 3
TEXTBOOKS:
1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, EijiMizutani, Neuro-Fuzzy and Soft

Computing, Prentice-Hall of India, 2003.
2. Zimmermann, Hans-Jürgen, Fuzzy Sets, Decision Making, and Expert
Systems, ISBN 978-94-009-3249-4, Kluwer Academic Publishers, Boston,
1987
3. Mitchell Melanie, An Introduction to Genetic AlgorithmsA Bradford Book The
MIT Press, Cambridge, Massachusetts, London, England, Fifth printing, 1999
4. EthemAlpaydın, Introduction to Machine Learning Second Edition The MIT
Press Cambridge, Massachusetts London, England
REFERENCE BOOKS:
1. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.
2. David E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine
Learning”, Addison Wesley, 1997.
3. S. N. Sivanandam, S. Sumathi and S. N. Deepa, “Introduction to FuzzyLogic
using MATLAB”, Springer, 2007.
4. S.N.Sivanandam · S.N.Deepa, “ Introduction to Genetic Algorithms”, Springer,
2007.
5. Jacek M. Zurada, “Introduction to Artificial Neural Systems”, PWS Publishers,
1992.

1. https://www.wileyindia.com/principles-of-soft-computing-2nd-ed.html
2. http://dl.offdownload.ir/ali/Neuro-FuzzyAndSoftComputing.pdf
MOOC:
1. https://onlinecourses.nptel.ac.in/noc18_cs13/course
2. www.soft-computing.de/link.html
3. nptel.ac.in/courses/106105173/
SEE SCHEME
Unit – III.
Open Electives
DATA STRUCTURES AND ALGORITHMS

Course Code : 18CS8x54 CIE Marks : 50
(L:T:P:S)
Course Objectives:
1. Outline the concepts of data structures, its types, structures and
pointers.
2. Understand linear data structures, namely, stack, queue, singly linked
list and doubly linked list.
3. Analyzenonlineardata structures, namely, binary tree and graphs.
4. Analyze the non-recursive and recursive algorithms and to represent
Efficiency of these algorithms in terms of the standard Asymptotic
notations.
5. Explain the various algorithm design techniques and apply them to
solve various real world problems.
UNIT – I
INTRODUCTION:
Data Structure, Classification (Primitive and non-primitive), data structure
operations.
POINTERS:
Definition and Concepts, Accessing variables through pointers, Arrays and
pointers. Structures, pointers to structures.
LINEAR DATA STRUCTURES – STACKS:

Introduction and Definition, Representation of stack: Array and structure
representation of stacks, Operations on stacks using C functions (Push(), Pop(),
IsStackFull(), IsStackEmpty()).
LINEAR DATA STRUCTURES – QUEUES:
Introduction and Definition Representation of Queue: Array and Structure

representation of queue, Operations on Ordinary Queue using C functions
(Insert(), Remove(), IsQueueFul(), IsQueueEmpty()) 15 Hours
UNIT – II
LINEAR DATA STRUCTURES - SINGLY LINKED LISTS:
Dynamic Memory allocation functions. Definition and concepts singly linked List:
Representation of link list in memory, Operations on singly Linked List using C
functions (Insert node at front, Remove a node from front, display singly linked
list).
LINEAR DATA STRUCTURES - DOUBLY LINKED LISTS:
Doubly Linked List: Representation. (Operations not included).
NONLINEAR DATA STRUCTURES – BINARY TREES:
Binary Trees: Properties, Linked representation of Binary Tree, Binary Tree
Traversals, Introduction to Binary Search Tree.
INTRODUCTION TO ALGORITHMS:
What is an Algorithm? Fundamentals of Algorithmic Problem Solving,
understanding and representing graphs using adjacency matrix and linked list.
FUNDAMENTALS OF THE ALGORITHMS EFFICIENCY:
Analysis Framework, Asymptotic Notations and Basic Efficiency Classes,
Mathematical Analysis of Non-recursive and Recursive Algorithms.
15 Hours
UNIT – III
DECREASE & CONQUER:
Concept of Decrease and Conquer, Graph traversal algorithms - Depth First
Search, Breadth First Search.
DYNAMIC PROGRAMMING:
Concept of Dynamic Programming, Computing a Binomial Coefficient.
GREEDY METHOD:
Concept of Greedy technique, Prims algorithm.
BACKTRACKING:
Concept of Backtracking technique, N-Queens problem.9 Hours
Course Outcomes:
1. Acquire the fundamental knowledge of various types of data structures
and pointers using that knowledge, analyze and design the programs
using pointers
2. Apply the fundamental programming knowledge of data structures to
analyze and design linear data structures, namely, stack, queue, singly
linked list and doubly linked list and use them for solving problems.
3. Implement and apply the concept of binary trees and graph data
structures and also understand their traversals.
4. Analyze non-recursive or recursive algorithm and to represent in terms
of standard Asymptotic notations.
5. Apply Divide and Conquer, Decrease and Conquer, Dynamic
programming, Greedy, and Backtracking algorithm design techniques to
solve real time problems.
TEXT BOOKS:
1. Aaron M. Tenenbaum, YedidyahLangsam& Moshe J. Augenstein, “Data
Structures using C”, Pearson Education/PHI, 2006.
2. AnanyLevitin, “Introduction to the Design & Analysis of Algorithms”, 2nd
Edition, Pearson Education, 2007.
REFERENCE BOOKS:
1. Ellis Horowitz and SartajSahni, “Fundamentals of Data Structures in C”,
2nd edition, Universities Press, 2014.
2. Seymour Lipschutz, “Data Structures, Schaum’s Outlines”, Revised 1st
edition, McGraw Hill, 2014.
3. Thomas H. Cormen, Charles E.Leiserson, Ronal L. Rivest, Clifford Stein,
“Introduction to Algorithms”, 2nd Edition, PHI, 2006.
MOOC:
1. Introduction to Data Structures by edx, URL:
https://www.edx.org/course/
2. Advance Data Structures by MIT OCW , URL:
https://www.mooclab.club/
3. Data Structure by Harvard Extension School, URL:
http://www.extension.harvard.
*********************
ESSENTIALS OF INFORMATION TECHNOLOGY

Course Code : 18CS8X15 CIE Marks : 50
(L:T:P:S)
Course Learning Objectives: This Course will enable students to
1. Outline the fundamentals of python programming.

2. Implement the object oriented concepts using python programming.

3. Describe the basic concepts of Relational Database Management System.
4. Apply the normalization to the Databases and develop databases using
SQL and PL/SQL Queries.
5. Develop the data base connectivity in integration with python and perform
various Database operations.
UNIT - I
PROGRAMMING FUNDAMENTALS Introduction to Programming: Why

Programming, What is Computer Program, What is an Algorithm, Flowchart,
Pseudo Code; Python Fundamentals: – Introduction to python, Variables and Data
Types, Comments, Input Function, Operators, Coding Standards, Integrated
Development Environment(IDE) ;Control Structures: Selection Control Structures,
,Looping/Iterative Control Structures; Data Structures: String , List, Dictionary and
Tuple ,Set, Functions: Built-in functions, User-defined Functions, Recursion.
OBJECT ORIENTED PROGRAMMING USING PYTHON Introduction to Object
Oriented Paradigm: Abstraction and Entity, Encapsulation and Data hiding, Class
and Object, Unified Modelling Language (UML), Object Oriented Approach, Class
Variables, Class methods and Static Methods, Documentation, Inheritance &
Polymorphism: UML: is-a relationship
(Generalization), Types of Inheritance, Multiple Inheritance, Polymorphism,
Benefits of OOP,
Memory Management in Python, Relationships: has-a relationship: Aggregation &
Composition, uses-a relationship; File handling, Exception Handling, Raising
Exceptions 15 Hours
UNIT - II
RELATIONAL DATABASE MANAGEMENT SYSTEM Data and Need for DBMS:
Data – Is it important, What is Data, Do we need to store data, How to Store /
Handle Data, What is DBMS and its Models, Functional Needs of DBMS, Data
perspectives in DBMS; Relational Model and Keys: What is RDBMS, Data
representation in RDBMS, Keys in RDBMS; Database Development Life Cycle;
Data Requirements; Logical Database Design: Different Approaches in Logical
Design, ER Modeling, ER Notations, Steps in ER Modeling; Physical Database
Design: Converting ER Model to Relational Schema ;Normalization: Functional
Dependency, First
Normal Form: 1NF, Second Normal Form: 2NF, Third Normal Form: 3NF,
Normalization
Guidelines;
Implementation with SQL: What is SQL, Data types and Operators in SQL, SQL
Statements: SQL - Built-in Functions; SQL - Group by and Having Clauses Joins:
Inner Join, Outer Join, Self-Join, Sub Queries: Independent Sub queries,
Correlated Sub queries, Index, Views, Transactions, PL/SQL

15 Hours
UNIT - III
PYTHON DATABASE INTEGRATION Why Database Programming, Python
Database
Integration – Pre-requisites and Installation, SELECT Operation: Retrieve Data
from Database, Attributes of Cursor object, Bind variables, CREATE and INSERT
Operation: Creating a table, Insert Operation, Inserting Multiple Records, UPDATE
Operation, DELETE Operation, Exception Handling
09 Hours
Course Outcomes: At the end of the course the student will be able to:
1. Explain the basic program constructs of Python Programming.

2. Design and apply the object oriented programming construct using Python
to build the real world application.
3. Summarize the concepts related to Relational Database Management
System.
4. Design and develop databases from the real world by applying the concepts
of Normalization using SQL and PL/SQL.
5. Perform the various Database operations by connecting Python with
Database.
TEXT BOOKS:
1. Kenneth A. Lambert, “The Fundamentals of Python: First Programs, 2012”,

Cengage Learning.
2. Magnus Lie Hetland, “Beginning Python from Novice to Professional”,
Second Edition.
3. Mark Summerfield, Programming in Python 3 – “A Complete Introduction to
the Python Language”, Second Edition.
4. Elmasri, Navathe, "Fundamentals of Database Systems", Third edition, Addison

Wesley
REFERENCE BOOKS:
1. Y. Daniel Liang, “Introduction to Programming Using Python”, Pearson,

ISBN:9780-13274718-9, 2013.
2. Raghu Ramakrishnan and Johannes Gehrke : “Database Management
Systems”(Third Edition), McGraw-Hill, 2003.
**********************
INTERNET OF THINGS - (IoT)

[As per Choice Based Credit System (CBCS) scheme]

(L:T:P:S)

1. Learn the IoT Definitions, Design aspects
3. Describe IoT logical and physical design concepts
4. Implement Arduino based IoT Projects
5. Implement Raspberry Pi based IoT Projects
UNIT – I
15 Hours
Introduction
Introduction to IoT : Definition and characteristics, Physical design, Logical design,
Enabling technologies, Levels and deployment templates, Examples: Domain
specific IoTs, IoT Design and System Engineering, Discuss IoT Requirements,
Hardware & Software; Study of IoT sensors, Tagging and Tracking, Embedded
Products; IoT Design, (U) SIM Card Technology, IoT Connectivity and
Management, IoT Security & IoT Communication.
(Text Book-1:, Chapter 1 to 4)
UNIT – II
15 Hours
Design Concepts:
IoT Logical Design:
Data types, Data structures, Control flow, Functions, Modules, Packages, File
Handling, Date and time operation, Classes, Python packages of IoT, IoT Physical
Design, Basic building blocks, Raspberry Pi, Linux on Raspberry Pi, Interfaces,
Programming on Raspberry Pi with Python, Arduino Based IoT Project
Implementation, Arduino for Project development, Internet enabled Arduino
powered garage door opener, Irrigation control system, Light controller Message,
controller and cloud Services
(Text Book-1: Chapter 4,5,6 ,7)

Raspberry Pi based IoT Project Implementation:
Raspberry Pi for Project Development: Raspberry Pi platform, GPIO,
Establishment and setting, of Raspberry Pi software, LAMP project, Home
temperature, monitoring system, Webcam and Raspberry Pi camera project (Text
Book-1: Chapter 10,11,12, 13
Course Outcomes:
1. Acquire the fundamental knowledge of IoT Definitions, Design aspects
3. Design IoT logical and physical architecture
4. Implement Arduino based IoT Projects
5. Implement Raspberry Pi based IoT Projects
TEXT BOOKS:
1. ArshdeepBahga, Vijay Madisetti, “Internet of Things: A Hands-On
Approach,VijayMadisetti”, 2014.
2. Donald Norris, “The Internet of Things: Do-It-Yourself at Home Projects for
Arduino,Raspberry Pi and BeagleBone Black”, 1st Edition, McGraw Hill, 2015.
REFERENCE BOOKS:
1. Dr. SRN Reddy, RachitThukral and Manasi Mishra, “Introduction to Internet of
Things: A practical Approach”, ETI Labs
2. Pethuru Raj and Anupama C. Raman,“The Internet of Things: Enabling
Technologies, Platforms, and Use Cases”, CRC Press
3. JeevaJose,”Internet of Things”, Khanna Publishing House,Delhi
4. Adrian McEwen,”Designing the Internet of Things”, Wiley
5. Raj Kamal, “Internet of Things: Architecture and Design”, McGraw Hill
6. CunoPfister, “Getting Started with the Internet of Things”, O Reilly Media

1. Object-Oriented Analysis and Design with Applications, Grady Booch, Robert A.
Maksimchuk, Michael W. Engel, Bobbi J. Young, Jim Conallen,Kelli A.
2. Object-Oriented Modelling and Design with UML, James R Rumbaugh,
Michael R. Blaha Pearson Education, 21-Nov-2011
3. Object-Oriented Analysis and Design, Ramnath,
Sarnath, Dathan, Brahma, ISBN 978-1-84996-522-4,, Springer Publications,
2011.
MOOC:
1. https://www.coursera.org/specializations/internet-of-things
2. https://www.udemy.com/course/iot-internet-of-things-automation-using-
raspberry-pi/
3. https://www.udemy.com/course/arduino-iot-cloud/
************************
PROGRAMMINGIN JAVA

(L:T:P:S)
Course Objectives:

1. Learn fundamental features of object oriented language and JAVA
programming constructs.
2. Develop and run simple Java programs using OOPS concepts of java
3. Create multi-threaded programs and event driven Graphical User Interface
(GUI) programming using swing package.
UNIT – I
Introduction to Java: Java’s magic: The Byte code; Java Development Kit (JDK);
the Java Buzzwords, Object-oriented programming; Simple Java programs. Data
types, variables and arrays, Operators, Control Statements.
Classes, Inheritance: Classes fundamentals; Declaring objects; Call by value and

Call by Reference, array of objects, Constructors, this keyword, and usage of static
keyword.
Inheritance: inheritance basics, using super, creating multi-level hierarchy, method
Overriding, abstract classes, final classes.
15 Hours
UNIT – II
Exception handling, packages and interfaces: Exception handling in Java, use
of try, catch blocks, multiple catch blocks, finally block, use of throw and throws
clauses, creating custom exceptions. Packages, Access Protection, Importing
Packages, Interfaces. IO Streams for file handling.
Multi-Threaded Programming:
What are threads? How to make the classes threadable; Extending threads;
Implementing runnable interface; creating multiple threads, join and is Alive
methods of Thread class, Thread Synchronization; achieving thread
synchronization among multiple threads. Thread priorities, methods to get and
set thread priority
15 Hours
UNIT – III
Event Handling: Two event handling mechanisms; The delegation event
model; Event
classes; Sources of events; Event listener interfaces; Using the delegation
event model;
Swings:
The origins of Swing; Two key Swing features; Components and Containers; The
Swing Packages; A simple Swing Application; Create a Swing Applet; Jlabel and
ImageIcon; JTextField;The Swing Buttons; JTabbedpane; JScrollPane; JList;
JComboBox; JTable.
09 Hours
Course Outcomes:
1.Apply the object-oriented concepts to solve real world problems using JAVA
programming features
2.Illustrate the basic constructs and object orients features of the Java
language
3.Design a multi-threaded program using Java with exception handling
4.Develop Java programs that includes packages and interfaces and preform
file operations in Java
5.Develop simple GUI interfaces for a computer program to interact with
users, and to understand the event-based GUI handling principles using
swings
Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Design/Development of Solutions
2. Problem Analysis
3. Modern tool usage
Text Book:
1. Herbert Scheldt, Java the Complete Reference, 7th Edition, Tata McGraw Hill,
2007. (Chapters 2-11, 22-24, 29,30)
Reference Books:
1. Mahesh Bhave and Sunil Patekar, "Programming with Java", First Edition,
Pearson Education, 2008, ISBN:9788131720806
2. RajkumarBuyya,SThamarasiselvi, xingchen chu, Object oriented
Programming with Java, Tata McGraw Hill education private limited.
3. Richard A Johnson, Introduction to Java Programming and OOAD,
CENGAGE Learning.
4. E Balagurusamy, Programming with Java A primer, Tata McGraw Hill
companies.

1. Online course material by Oracle :
http://docs.oracle.com/javase/tutorial/index.html
2. https://www.udemy.com/courses/search/?q=java&price=price-
free&view=grid
MOOC:
1. Oracle:www.oracle.com/events/global/en/java.../java-a-beginners-guide-
1720064.pdf
2. NPTEL:www.nptelvideos.com/java/java_video_lectures_tutorials.php

7-8th Sem Syllabus

Uploaded by

Copyright:

Available Formats

7-8th Sem Syllabus

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

7-8th Sem Syllabus

Uploaded by

Copyright:

Available Formats

Syllabus of VII & VIII Semester B.E. 2021-22 / Computer Science &Engg.

VII &VIII SEMESTER

College Calendar 2021-22

(An Autonomous Institution affiliated to VTU, Belgavi)

(An Autonomous Institution affiliated to VTU, Belgavi)

Pursuing Excellence, Empowering people, Partnering in Community

To develop N.M.A.M. Institute of Technology, Nitte, as Centre of Excellence by

Sl.No. Name of the Faculty Designation

1. Sri. ShyamSundar M. P.E.D

STUDENT WELFARE CELL

ENTREPRENEURSHIP DEVELOPMENT CELL

1. Dr. Ramakrishna B. Professor/EDC- Incharge

OFFICE SECTION HEADS

1. Mr. KeshavaMugeraya Sr. Supdt., Academic Section/

DEPARTMENT OF TRAINING & PLACEMENT

1. Dr. Shashirekha B. Rai Professor

1. Dr. Manjunath K. B. Asst. Professor Gd III

2. Dr. Shobha R. Prabhu Asst. Professor Gd III/

1. Dr. JanardhanaNayak Professor

1. Dr. Ramakrishna B. Asso. Professor

PUBLIC RELATIONS OFFICER

HOSTEL SUPERINTENDENT / MANAGER

1. Mr. John D’Souza Sr. Manager, Gents Main

1. Mr. HiriannaSuvarna Security Supervisor

COMMONTO ALL B.E.(CREDITSYSTEM)

1.No. ofSemesters / Year Three;TwobeingMainsemesters(odd,

2.Semester Duration Main semester (odd, even) each 19 Weeks;Supplementary

3.Academic Activities Main Semester

(Weeks): RegistrationofCourses&CourseWork (16.0)

ThecalendarofeventsinrespectofthecourseshallbefixedbytheSenate from time to time, but

4.3 Withdrawal from courses

5.3 TheearnedCreditRequirementfortheB.E.Degreeis 175.

7. WITHDRAWAL FROM THEPROGRAMME

8.4 The letter grade awarded to a studentin a 0-0-P (Practical) course,is

EvaluationMethod Passing Standard

11. Vertical progression (Promotion / Eligibility to higher semesters)

(B) Vertical Progression in case of Diploma students admitted to Second year

(b) The mandatory non-credit Courses Additional Mathematics I and II prescribed

(c) Completion of Additional Mathematics I and II shall be mandatory for the

(C) Vertical Progression in case of B.Sc students admitted to Second year

(b) The prescribed mandatory non-credit Courses Engineering Graphics and

(c) Completion of Engineering Graphics and Elements of Civil Engineering and

11.4 Termination from theprogramme

14. AWARD OF DEGREE

(2) Noncompliance of Mini-project

18. EARNING OF ACTIVITY POINTS FOR THE AWARD OF DEGREE

Income : Above Hardcopy Will be published

For Others Category 2A, 3A, 3B,& Online

Minority students Online

Parents Beedi Scholarship Online scholarships.gov.in

DEPARTMENT: COMPUTER SCIENCE & ENGINEERING

1. Dr. Niranjan N. Chiplunkar Ph.D Professor &

9. Dr. Vikram Raju R Ph.D Asso. Prof

41. Mrs. AnushaAnchan M.Tech. Asst. Prof Gd I

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Program Outcomes (POs):

4. Conduct investigations of complex problems: Use research-based knowledge

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

1 18CS701 Software Testing 3+0+0 50 50 3