MANAGEMENTANDENTREPRENEURSHIPFORITINDUSTRY

[AsperChoiceBasedCreditSystem(CBCS)scheme]
(Effectivefromtheacademicyear20162017)
SEMESTERV
SubjectCode 15CS51 IAMarks 20
NumberofLectureHours/Week 4 ExamMarks 80
TotalNumberofLectureHours 50 ExamHours 03
CREDITS04
Courseobjectives:Thiscoursewillenablestudentsto
Explaintheprinciplesofmanagement,organizationandentrepreneur.
Discussonplanning,staffing,ERPandtheirimportance
Infertheimportanceofintellectualpropertyrightsandrelatetheinstitutionalsupport
Module1 Teaching
Hours
IntroductionMeaning,natureandcharacteristicsofmanagement,scopeand10Hours
Functionalareasofmanagement,goalsofmanagement,levelsofmanagement,
brief overview of evolution of management theories,. Planning Nature,
importance,typesofplans,stepsinplanning,Organizingnatureandpurpose,
typesofOrganization,Staffingmeaning,processofrecruitmentandselection
Module2
Directingandcontrollingmeaningandnatureofdirecting,leadershipstyles, 10Hours
motivationTheories,CommunicationMeaningandimportance,Coordination
meaningandimportance,Controllingmeaning,stepsincontrolling,methodsof
establishingcontrol.
Module3
Entrepreneur meaning of entrepreneur, characteristics of entrepreneurs, 10Hours
classification and types of entrepreneurs, various stages in entrepreneurial
process,roleofentrepreneursineconomicdevelopment,entrepreneurshipin
Indiaandbarrierstoentrepreneurship.Identificationofbusinessopportunities,
marketfeasibilitystudy,technicalfeasibilitystudy,financialfeasibilitystudyand
socialfeasibilitystudy.
Module4
PreparationofprojectandERPmeaningofproject,projectidentification,10Hours
projectselection,projectreport,needandsignificanceofprojectreport,contents,
formulation,guidelinesbyplanningcommissionforprojectreport,Enterprise
ResourcePlanning:MeaningandImportanceERPandFunctionalareasof
ManagementMarketing/SalesSupplyChainManagementFinanceand
AccountingHumanResourcesTypesofreportsandmethodsofreport
generation
Module5
Micro and Small Enterprises: Definition of micro and small enterprises, 10Hours
characteristicsandadvantagesofmicroandsmallenterprises,stepsinestablishing
microandsmallenterprises,GovernmentofIndiaindusialpolicy2007onmicroand
smallenterprises,casestudy(Microsoft),Casestudy(CaptainGRGopinath),case
study(NRNarayanaMurthy&Infosys),Institutionalsupport:MSMEDI,NSIC,
SIDBI,KIADB,KSSIDC,TECSOK,KSFC,DICandDistrictlevelsinglewindow
agency,IntroductiontoIPR.
Courseoutcomes:Thestudentsshouldbeableto:
Definemanagement,organization,entrepreneur,planning,staffing,ERPandoutline
 theirimportanceinentrepreneurship
UtilizetheresourcesavailableeffectivelythroughERP
MakeuseofIPRsandinstitutionalsupportinentrepreneurship
Questionpaperpattern:
ThequestionpaperwillhaveTENquestions.
TherewillbeTWOquestionsfromeachmodule.
Eachquestionwillhavequestionscoveringallthetopicsunderamodule.
ThestudentswillhavetoanswerFIVEfullquestions,selectingONEfullquestionfromeach
module.
TextBooks:
1. PrinciplesofManagementP.C.Tripathi,P.N.Reddy;TataMcGrawHill,4th/6 th
Edition,2010.
2. DynamicsofEntrepreneurialDevelopment&ManagementVasantDesaiHimalaya
PublishingHouse.
3. EntrepreneurshipDevelopmentSmallBusinessEnterprisesPoornimaM
CharantimathPearsonEducation2006.
4. ManagementandEntrepreneurshipKanishkaBediOxfordUniversityPress2017
ReferenceBooks:
1. ManagementFundamentalsConcepts,Application,SkillDevelopmentRobertLusier
Thomson.
2. EntrepreneurshipDevelopmentSSKhankaSChand&Co.
3. ManagementStephenRobbinsPearsonEducation/PHI17thEdition,2003

 COMPUTERNETWORKS
[AsperChoiceBasedCreditSystem(CBCS)scheme]
(Effectivefromtheacademicyear20162017)
SEMESTERV
SubjectCode 15CS52 IAMarks 20
NumberofLectureHours/Week 4 ExamMarks 80
TotalNumberofLectureHours 50 ExamHours 03
CREDITS04
Courseobjectives:Thiscoursewillenablestudentsto
Demonstrationofapplicationlayerprotocols
DiscusstransportlayerservicesandunderstandUDPandTCPprotocols
Explainrouters,IPandRoutingAlgorithmsinnetworklayer
DisseminatetheWirelessandMobileNetworkscoveringIEEE802.11Standard
IllustrateconceptsofMultimediaNetworking,SecurityandNetworkManagement
Module1 Teaching
Hours
ApplicationLayer:PrinciplesofNetworkApplications:NetworkApplication 10Hours
Architectures, Processes Communicating, Transport Services Available to
Applications,TransportServicesProvidedbytheInternet,ApplicationLayer
Protocols. The Web and HTTP: Overview of HTTP, Nonpersistent and
Persistent Connections, HTTP Message Format, UserServer Interaction:
Cookies,WebCaching,TheConditionalGET,FileTransfer:FTPCommands&
Replies,ElectronicMailintheInternet:SMTP,ComparisonwithHTTP,Mail
MessageFormat,MailAccessProtocols,DNS;TheInternet'sDirectoryService:
ServicesProvidedbyDNS,OverviewofHowDNSWorks,DNSRecordsand
Messages,PeertoPeerApplications:P2PFileDistribution,DistributedHash
Tables, Socket Programming: creating Network Applications: Socket
ProgrammingwithUDP,SocketProgrammingwithTCP.
T1:Chap2
Module2
TransportLayer:IntroductionandTransportLayerServices:Relationship 10Hours
BetweenTransportandNetworkLayers,OverviewoftheTransportLayerinthe
Internet,MultiplexingandDemultiplexing:ConnectionlessTransport:UDP,UDP
Segment Structure, UDP Checksum, Principles of Reliable Data Transfer:
BuildingaReliableDataTransferProtocol,PipelinedReliableDataTransfer
Protocols,GoBackN,Selectiverepeat,ConnectionOrientedTransportTCP:
TheTCPConnection,TCPSegmentStructure,RoundTripTimeEstimationand
Timeout,ReliableDataTransfer,FlowControl,TCPConnectionManagement,
PrinciplesofCongestionControl:TheCausesandtheCostsofCongestion,
Approaches to Congestion Control, Networkassisted congestioncontrol
example,ATMABRCongestioncontrol,TCPCongestionControl:Fairness.
T1:Chap3
Module3
TheNetworklayer:What'sInsideaRouter?:InputProcessing,Switching, 10Hours
OutputProcessing,WhereDoesQueuingOccur?Routingcontrolplane,IPv6,A
BriefforayintoIPSecurity,RoutingAlgorithms:TheLinkState(LS)Routing
Algorithm,TheDistanceVector(DV)RoutingAlgorithm,HierarchicalRouting,
RoutingintheInternet,IntraASRoutingintheInternet:RIP,IntraASRouting
intheInternet:OSPF,Inter/ASRouting:BGP,BroadcastRoutingAlgorithms
andMulticast.
T1:Chap4:4.34.7
Module4
WirelessandMobileNetworks:CellularInternetAccess:AnOverviewof 10Hours
Cellular Network Architecture, 3G Cellular Data Networks: Extending the
InternettoCellularsubscribers,Onto4G:LTE,Mobilitymanagement:Principles,
Addressing,Routingtoamobilenode,MobileIP,Managingmobilityincellular
Networks,RoutingcallstoaMobileuser,HandoffsinGSM,Wirelessand
Mobility:ImpactonHigherlayerprotocols.
T1:Chap:6:6.46.8
Module5
MultimediaNetworking:Propertiesofvideo,propertiesofAudio,Typesof 10Hours
multimediaNetworkApplications,Streamingstoredvideo:UDPStreaming,
HTTPStreaming,AdaptivestreamingandDASH,contentdistributionNetworks,
casestudies:Netflix,YouTubeandKankan.
Network Support for Multimedia: Dimensioning BestEffort Networks,
ProvidingMultipleClassesofService,Diffserv,PerConnectionQualityof
Service(QoS)Guarantees:ResourceReservationandCallAdmission
T1:Chap:7:7.1,7.2,7.5
Courseoutcomes:Thestudentsshouldbeableto:
Explainprinciplesofapplicationlayerprotocols
RecognizetransportlayerservicesandinferUDPandTCPprotocols
Classifyrouters,IPandRoutingAlgorithmsinnetworklayer
UnderstandtheWirelessandMobileNetworkscoveringIEEE802.11Standard
DescribeMultimediaNetworkingandNetworkManagement
Questionpaperpattern:
ThequestionpaperwillhaveTENquestions.
TherewillbeTWOquestionsfromeachmodule.
Eachquestionwillhavequestionscoveringallthetopicsunderamodule.
ThestudentswillhavetoanswerFIVEfullquestions,selectingONEfullquestionfromeach
module.
TextBooks:
1. JamesFKuroseandKeithWRoss,ComputerNetworking,ATopDownApproach,
Sixthedition,Pearson,2017.
ReferenceBooks:
1. BehrouzAForouzan,DataandCommunicationsandNetworking,FifthEdition,
McGrawHill,IndianEdition
2. LarryLPetersonandBrusceSDavie,ComputerNetworks,fifthedition,ELSEVIER
3. AndrewSTanenbaum,ComputerNetworks,fifthedition,Pearson
4. MayankDave,ComputerNetworks,Secondedition,CengageLearning

 DATABASEMANAGEMENTSYSTEM
[AsperChoiceBasedCreditSystem(CBCS)scheme]
(Effectivefromtheacademicyear20162017)
SEMESTERV
SubjectCode 15CS53 IAMarks 20
NumberofLectureHours/Week 4 ExamMarks 80
TotalNumberofLectureHours 50 ExamHours 03
CREDITS04
Courseobjectives:Thiscoursewillenablestudentsto
Provideastrongfoundationindatabaseconcepts,technology,andpractice.
PracticeSQLprogrammingthroughavarietyofdatabaseproblems.
Demonstratetheuseofconcurrencyandtransactionsindatabase
Designandbuilddatabaseapplicationsforrealworldproblems.
Module1 Teaching
Hours
IntroductiontoDatabases:Introduction,Characteristicsofdatabaseapproach, 10Hours
AdvantagesofusingtheDBMSapproach,Historyofdatabaseapplications.
OverviewofDatabaseLanguagesandArchitectures:DataModels,Schemas,
and Instances. Three schema architecture and data independence, database
languages,andinterfaces,TheDatabaseSystemenvironment.ConceptualData
Modelling using Entities and Relationships: Entity types, Entity sets,
attributes,roles,andstructuralconstraints,Weakentitytypes,ERdiagrams,
examples,SpecializationandGeneralization.
Textbook1:Ch1.1to1.8,2.1to2.6,3.1to3.10
Module2
RelationalModel:RelationalModelConcepts,RelationalModelConstraints 10Hours
andrelationaldatabaseschemas,Updateoperations,transactions,anddealing
withconstraintviolations.RelationalAlgebra:UnaryandBinaryrelational
operations,additionalrelationaloperations(aggregate,grouping,etc.)Examples
ofQueriesinrelationalalgebra.MappingConceptualDesignintoaLogical
Design:RelationalDatabaseDesignusingERtoRelationalmapping.SQL:
SQLdatadefinitionanddatatypes,specifyingconstraintsinSQL,retrieval
queries in SQL, INSERT, DELETE, and UPDATE statements in SQL,
AdditionalfeaturesofSQL.
Textbook1:Ch4.1to4.5,5.1to5.3,6.1to6.5,8.1;Textbook2:3.5
Module3
SQL:AdvancesQueries:MorecomplexSQLretrievalqueries,Specifying 10Hours
constraintsasassertionsandactiontriggers,ViewsinSQL,Schemachange
statementsinSQL.DatabaseApplicationDevelopment:Accessingdatabases
fromapplications,AnintroductiontoJDBC,JDBCclassesandinterfaces,SQLJ,
Storedprocedures,Casestudy:TheinternetBookshop.InternetApplications:
ThethreeTierapplicationarchitecture,Thepresentationlayer,TheMiddleTier
Textbook1:Ch7.1to7.4;Textbook2:6.1to6.6,7.5to7.7.
Module4
Normalization:DatabaseDesignTheoryIntroductiontoNormalizationusing 10Hours
Functional and Multivalued Dependencies: Informal design guidelines for
relationschema,FunctionalDependencies,NormalFormsbasedonPrimary
Keys,SecondandThirdNormalForms,BoyceCoddNormalForm,Multivalued
DependencyandFourthNormalForm,JoinDependenciesandFifthNormal
Form.NormalizationAlgorithms:InferenceRules,Equivalence,andMinimal
Cover, Properties of Relational Decompositions, Algorithms for Relational
Database Schema Design, Nulls, Dangling tuples, and alternate Relational
Designs, Further discussion of Multivalued dependencies and 4NF, Other
dependenciesandNormalForms
Textbook1:Ch14.1to14.7,15.1to15.6
Module5
TransactionProcessing:IntroductiontoTransactionProcessing,Transaction 10Hours
and System concepts, Desirable properties of Transactions, Characterizing
schedules based on recoverability, Characterizing schedules based on
Serializability, Transaction support in SQL. Concurrency Control in
Databases:TwophaselockingtechniquesforConcurrencycontrol,Concurrency
control based on Timestamp ordering, Multiversion Concurrency control
techniques, Validation Concurrency control techniques, Granularity of Data
itemsandMultipleGranularityLocking.IntroductiontoDatabaseRecovery
Protocols:RecoveryConcepts,NOUNDO/REDOrecoverybasedonDeferred
update, Recovery techniques based on immediate update, Shadow paging,
Databasebackupandrecoveryfromcatastrophicfailures
Textbook1:20.1to20.6,21.1to21.7,22.1to22.4,22.7.
Courseoutcomes:Thestudentsshouldbeableto:
Identify,analyzeanddefinedatabaseobjects,enforceintegrityconstraintsona
databaseusingRDBMS.
UseStructuredQueryLanguage(SQL)fordatabasemanipulation.
Designandbuildsimpledatabasesystems
Developapplicationtointeractwithdatabases.
Questionpaperpattern:
ThequestionpaperwillhaveTENquestions.
TherewillbeTWOquestionsfromeachmodule.
Eachquestionwillhavequestionscoveringallthetopicsunderamodule.
ThestudentswillhavetoanswerFIVEfullquestions,selectingONEfullquestionfromeach
module.
TextBooks:
1. DatabasesystemsModels,Languages,DesignandApplicationProgramming,
RamezElmasriandShamkantB.Navathe,7thEdition,2017,Pearson.
2. Databasemanagementsystems,Ramakrishnan,andGehrke,3 rdEdition,2014,
McGrawHill
ReferenceBooks:
1. SilberschatzKorthandSudharshan,DatabaseSystemConcepts,6 thEdition,Mc
GrawHill,2013.
2. Coronel,Morris,andRob,DatabasePrinciplesFundamentalsofDesign,
ImplementationandManagement,CengageLearning2012.

 AUTOMATATHEORYANDCOMPUTABILITY
[AsperChoiceBasedCreditSystem(CBCS)scheme]
(Effectivefromtheacademicyear20162017)
SEMESTERV
SubjectCode 15CS54 IAMarks 20
NumberofLectureHours/Week 4 ExamMarks 80
TotalNumberofLectureHours 50 ExamHours 03
CREDITS04
Courseobjectives:Thiscoursewillenablestudentsto
IntroducecoreconceptsinAutomataandTheoryofComputation
IdentifydifferentFormallanguageClassesandtheirRelationships
DesignGrammarsandRecognizersfordifferentformallanguages
Proveordisprovetheoremsinautomatatheoryusingtheirproperties
DeterminethedecidabilityandintractabilityofComputationalproblems
Module1 Teaching
Hours
WhystudytheTheoryofComputation,LanguagesandStrings:Strings, 10Hours
Languages. A Language Hierarchy, Computation, Finite State Machines
(FSM): Deterministic FSM, Regular languages, Designing FSM,
NondeterministicFSMs,FromFSMstoOperationalSystems,Simulatorsfor
FSMs,MinimizingFSMs,CanonicalformofRegularlanguages,FiniteState
Transducers,BidirectionalTransducers.
Textbook1:Ch1,2,3,4,5.1to5.10
Module2
RegularExpressions(RE):whatisaRE?,Kleenestheorem,Applicationsof 10Hours
REs, Manipulating and Simplifying REs. Regular Grammars: Definition,
RegularGrammarsandRegularlanguages.RegularLanguages(RL)andNon
regularLanguages:HowmanyRLs,Toshowthatalanguageisregular,Closure
propertiesofRLs,toshowsomelanguagesarenotRLs.
Textbook1:Ch6,7,8:6.1to6.4,7.1,7.2,8.1to8.4
Module3
ContextFreeGrammars(CFG):IntroductiontoRewriteSystemsandGrammars, 10Hours
CFGs and languages, designing CFGs, simplifying CFGs, proving that a
Grammariscorrect,DerivationandParsetrees,Ambiguity,NormalForms.
PushdownAutomata(PDA):DefinitionofnondeterministicPDA,Deterministic
and Nondeterministic PDAs, Nondeterminism and Halting, alternative
equivalentdefinitionsofaPDA,alternativesthatarenotequivalenttoPDA.
Textbook1:Ch11,12:11.1to11.8,12.1,12.2,12,4,12.5,12.6
Module4
ContextFreeandNonContextFreeLanguages:WheredotheContextFree 10Hours
Languages(CFL)fit,Showingalanguageiscontextfree,Pumpingtheoremfor
CFL,ImportantclosurepropertiesofCFLs,DeterministicCFLs.Algorithmsand
DecisionProceduresforCFLs:Decidablequestions,Undecidablequestions.
TuringMachine:Turingmachinemodel,Representation,Languageacceptability
byTM,designofTM,TechniquesforTMconstruction.
Textbook1:Ch13:13.1to13.5,Ch14:14.1,14.2,Textbook2:Ch9.1to9.6
Module5
VariantsofTuringMachines(TM),ThemodelofLinearBoundedautomata: 10Hours
Decidability: Definition of an algorithm, decidability, decidable languages,
Undecidablelanguages,haltingproblemofTM,Postcorrespondenceproblem.
Complexity:Growthrateof functions,theclassesofPand NP,Quantum
Computation:quantumcomputers,ChurchTuringthesis.
Textbook2:Ch9.7to9.8,10.1to10.7,12.1,12.2,12.8,12.8.1,12.8.2
Courseoutcomes:Thestudentsshouldbeableto:
Acquirefundamentalunderstandingofthecoreconceptsinautomatatheory
andTheoryofComputation
Learn how to translate between different models of Computation (e.g.,
DeterministicandNondeterministicandSoftwaremodels).
DesignGrammarsandAutomata(recognizers)fordifferentlanguageclasses
and become knowledgeable about restricted models of Computation
(Regular,ContextFree)andtheirrelativepowers.
Developskillsinformalreasoningandreductionofaproblemtoaformal
model,withanemphasisonsemanticprecisionandconciseness.
ClassifyaproblemwithrespecttodifferentmodelsofComputation.
Questionpaperpattern:
ThequestionpaperwillhaveTENquestions.
TherewillbeTWOquestionsfromeachmodule.
Eachquestionwillhavequestionscoveringallthetopicsunderamodule.
ThestudentswillhavetoanswerFIVEfullquestions,selectingONEfullquestionfromeach
module.
TextBooks:
1. ElaineRich,Automata,ComputabilityandComplexity,1stEdition,Pearson
Education,2012/2013
2. KLPMishra,NChandrasekaran,3rdEdition,TheoryofComputerScience,PhI,2012.
ReferenceBooks:
1. JohnEHopcroft,RajeevMotwani,JefferyDUllman,IntroductiontoAutomataTheory,
Languages,andComputation,3rdEdition,PearsonEducation,2013
2. MichaelSipser:IntroductiontotheTheoryofComputation,3rdedition,Cengage
learning,2013
3. JohnCMartin,IntroductiontoLanguagesandTheTheoryofComputation,3 rdEdition,
TataMcGrawHillPublishingCompanyLimited,2013
4. PeterLinz,AnIntroductiontoFormalLanguagesandAutomata,3rdEdition,Narosa
Publishers,1998
5. BasavarajS.Anami,KaribasappaKG,FormalLanguagesandAutomatatheory,Wiley
India,2012
6. CKNagpal,FormalLanguagesandAutomataTheory,OxfordUniversitypress,2012.

 OBJECTORIENTEDMODELINGANDDESIGN
[AsperChoiceBasedCreditSystem(CBCS)scheme]
(Effectivefromtheacademicyear20162017)
SEMESTERV
SubjectCode 15CS551 IAMarks 20
NumberofLectureHours/Week 3 ExamMarks 80
TotalNumberofLectureHours 40 ExamHours 03
CREDITS03
Courseobjectives:Thiscoursewillenablestudentsto
DescribetheconceptsinvolvedinObjectOrientedmodellingandtheirbenefits.
Demonstrateconceptofusecasemodel,sequencemodelandstatechartmodelfora
givenproblem.
ExplainthefacetsoftheunifiedprocessapproachtodesignandbuildaSoftware
system.
TranslatetherequirementsintoimplementationforObjectOrienteddesign.
Chooseanappropriatedesignpatterntofacilitatedevelopmentprocedure.
Module1 Teaching
Hours
Introduction, Modelling Concepts and Class Modelling: What is Object 8Hours
orientation?WhatisOOdevelopment?OOThemes;Evidenceforusefulnessof
OO development; OO modelling history. Modelling as Design technique:
Modelling;abstraction;TheThreemodels.ClassModelling:ObjectandClass
Concept;Linkandassociationsconcepts;GeneralizationandInheritance;A
sampleclassmodel;Navigationofclassmodels;AdvancedClassModelling,
Advanced object and class concepts; Association ends; Nary associations;
Aggregation; Abstract classes; Multiple inheritance; Metadata; Reification;
Constraints;DerivedData;Packages.
TextBook1:Ch1,2,3and4
Module2
UseCase Modelling and Detailed Requirements: Overview; Detailed object 8Hours
orientedRequirementsdefinitions;SystemProcessesAusecase/Scenarioview;
IdentifyingInputandoutputsTheSystemsequencediagram;IdentifyingObject
BehaviourThestatechartDiagram;IntegratedObjectorientedModels.
TextBook2:Chapter6:Page210to250
Module3
ProcessOverview,SystemConceptionandDomainAnalysis:ProcessOverview: 8Hours
Developmentstages;DevelopmentlifeCycle;SystemConception:Devisinga
systemconcept;elaboratingaconcept;preparingaproblemstatement.Domain
Analysis:Overviewofanalysis;DomainClassmodel:Domainstatemodel;
Domaininteractionmodel;Iteratingtheanalysis.
TextBook1:Chapter10,11,and12
Module4
Use case Realization :The Design Discipline within up iterations: Object 8Hours
OrientedDesignTheBridgebetweenRequirementsandImplementation;Design
ClassesandDesignwithinClassDiagrams;InteractionDiagramsRealizingUse
Caseanddefiningmethods;DesigningwithCommunicationDiagrams;Updating
the Design Class Diagram; Package DiagramsStructuring the Major
Components;ImplementationIssuesforThreeLayerDesign.
TextBook2:Chapter8:page292to346
Module5
DesignPatterns:Introduction;whatisadesignpattern?,Describingdesign 8Hours
patterns,thecatalogueofdesignpatterns,Organizingthecatalogue,Howdesign
patternssolvedesignproblems,howtoselectadesignpatterns,howtousea
designpattern;Creationalpatterns:prototypeandsingleton(only);structural
patternsadaptorandproxy(only).
TextBook3:Ch1:1.1,1.3,1.4,1.5,1.6,1.7,1.8,Ch3,Ch4.
Courseoutcomes:Thestudentsshouldbeableto:
Describetheconceptsofobjectorientedandbasicclassmodelling.
Draw class diagrams, sequence diagrams and interaction diagrams to solve
problems.
Chooseandapplyabefittingdesignpatternforthegivenproblem.
Questionpaperpattern:
ThequestionpaperwillhaveTENquestions.
TherewillbeTWOquestionsfromeachmodule.
Eachquestionwillhavequestionscoveringallthetopicsunderamodule.
ThestudentswillhavetoanswerFIVEfullquestions,selectingONEfullquestionfromeach
module.
TextBooks:
1. MichaelBlaha,JamesRumbaugh:ObjectOrientedModellingandDesignwithUML,2 nd
Edition,PearsonEducation,2005
2. Satzinger,JacksonandBurd:ObjectOrientedAnalysis&DesignwiththeUnified
Process,CengageLearning,2005.
3. ErichGamma,RichardHelm,RalphJohnsonandjohnVlissides:DesignPatterns
ElementsofReusableObjectOrientedSoftware,
PearsonEducation,2007.
ReferenceBooks:
1. Grady Booch et. al.: ObjectOriented Analysis and Design with Applications,3rd
Edition,PearsonEducation,2007.
2. 2.FrankBuschmann,RegineMeunier,HansRohnert,PeterSommerlad,MichelStal:
PatternOrientedSoftwareArchitecture.Asystemofpatterns,Volume1,JohnWiley
andSons.2007.
3. 3. Booch, Jacobson, Rambaugh : ObjectOriented Analysis and Design with
Applications,3rdedition,pearson,Reprint2013

 INTRODUCTIONTOSOFTWARETESTING
[AsperChoiceBasedCreditSystem(CBCS)scheme]
(Effectivefromtheacademicyear20162017)
SEMESTERV
SubjectCode 15CS552 IAMarks 20
NumberofLectureHours/Week 3 ExamMarks 80
TotalNumberofLectureHours 40 ExamHours 03
CREDITS03
Courseobjectives:Thiscoursewillenablestudentsto
Differentiatethevarioustestingtechniques.
Analyzetheproblemandderivesuitabletestcases.
Applysuitabletechniquefordesigningofflowgraph.
Explaintheneedforplanningandmonitoringaprocess.
Module1 Teaching
Hours
BasicsofSoftwareTesting:Basicdefinitions,SoftwareQuality,Requirements, 8Hours
Behaviour and Correctness, Correctness versus Reliability, Testing and
Debugging,Testcases,InsightsfromaVenndiagram,Identifyingtestcases,
TestgenerationStrategies,TestMetrics,Errorandfaulttaxonomies,Levelsof
testing,TestingandVerification,StaticTesting.
Textbook3:Ch1:1.21.5,3;Textbook1:Ch1
Module2
Problem Statements: Generalized pseudo code, the triangle problem, the 8Hours
NextDatefunction,thecommissionproblem,theSATM(SimpleAutomatic
TellerMachine)problem,thecurrencyconverter,Saturnwindshieldwiper
FunctionalTesting:Boundaryvalueanalysis,Robustnesstesting,Worstcase
testing, Robust Worst testing for triangle problem, NextDate problem and
commissionproblem,Equivalenceclasses,Equivalencetestcasesforthetriangle
problem, NextDate function, and the commission problem, Guidelines and
observations,Decisiontables,Testcasesforthetriangleproblem,NextDate
function,andthecommissionproblem,Guidelinesandobservations.
Textbook1:Ch2,5,6&7,Textbook2:Ch3
Module3
FaultBasedTesting:Overview,Assumptionsinfaultbasedtesting,Mutation8Hours
analysis, Faultbased adequacy criteria, Variations on mutation analysis.
StructuralTesting:Overview,Statementtesting,Branchtesting,Condition
testing, Path testing: DD paths, Test coverage metrics, Basis path testing,
guidelinesandobservations,DataFlowtesting:DefinitionUsetesting,Slice
basedtesting,Guidelinesandobservations.
T2:Chapter16,12T1:Chapter9&10
Module4
TestExecution:Overviewoftestexecution,fromtestcasespecificationtotest 8Hours
cases,Scaffolding,Genericversusspecificscaffolding,Testoracles,Selfchecks
as oracles, Capture and replay Process Framework :Basic principles:
Sensitivity,redundancy,restriction,partition,visibility,Feedback,thequality
process, Planning and monitoring, Quality goals, Dependability properties
,AnalysisTesting,Improvingtheprocess,Organizationalfactors.
PlanningandMonitoringtheProcess:Qualityandprocess,Testandanalysis
strategies and plans, Risk planning, monitoring the process, Improving the
process,thequalityteam.
T2:Chapter17,20.
Module5
IntegrationandComponentBasedSoftwareTesting:Overview,Integration 8Hours
testingstrategies,Testingcomponentsandassemblies.System,Acceptanceand
RegressionTesting:Overview,Systemtesting,Acceptancetesting,Usability,
Regressiontesting,Regressiontestselectiontechniques,Testcaseprioritization
andselectiveexecution.LevelsofTesting,IntegrationTesting:Traditional
view of testing levels, Alternative lifecycle models, The SATM system,
Separatingintegrationandsystemtesting,AcloserlookattheSATMsystem,
Decompositionbased,callgraphbased,Pathbasedintegrations.
T2:Chapter21&22,T1:Chapter12&13
Courseoutcomes:Thestudentsshouldbeableto:
Derivetestcasesforanygivenproblem
Comparethedifferenttestingtechniques
Classifytheproblemintosuitabletestingmodel
Applytheappropriatetechniqueforthedesignofflowgraph.
Createappropriatedocumentforthesoftwareartefact.
Questionpaperpattern:
ThequestionpaperwillhaveTENquestions.
TherewillbeTWOquestionsfromeachmodule.
Eachquestionwillhavequestionscoveringallthetopicsunderamodule.
ThestudentswillhavetoanswerFIVEfullquestions,selectingONEfullquestionfromeach
module.
TextBooks:
1. PaulC.Jorgensen:SoftwareTesting,ACraftsmansApproach,3 rdEdition,Auerbach
Publications,2008.
2. MauroPezze,MichalYoung:SoftwareTestingandAnalysisProcess,Principlesand
Techniques,WileyIndia,2009.
3. AdityaPMathur:FoundationsofSoftwareTesting,PearsonEducation,2008.
ReferenceBooks:
1. SoftwaretestingPrinciplesandPracticesGopalaswamyRamesh,SrinivasanDesikan,2
ndEdition,Pearson,2007.
2. SoftwareTestingRonPatton,2ndedition,PearsonEducation,2004.
3. TheCraftofSoftwareTestingBrianMarrick,PearsonEducation,1995.
4. AnirbanBasu,SoftwareQualityAssurance,TestingandMetrics,PHI,2015
5. NareshChauhan,SoftwareTesting,OxfordUniversitypress.

 ADVANCEDJAVAANDJ2EE
[AsperChoiceBasedCreditSystem(CBCS)scheme]
(Effectivefromtheacademicyear20162017)
SEMESTERV
SubjectCode 15CS553 IAMarks 20
NumberofLectureHours/Week 3 ExamMarks 80
TotalNumberofLectureHours 40 ExamHours 03
CREDITS03
Courseobjectives:Thiscoursewillenablestudentsto
IdentifytheneedforadvancedJavaconceptslikeEnumerationsandCollections
ConstructclientserverapplicationsusingJavasocketAPI
MakeuseofJDBCtoaccessdatabasethroughJavaPrograms
Adaptservletstobuildserversideprograms
DemonstratetheuseofJavaBeanstodevelopcomponentbasedJavasoftware

Module1 Teaching
Hours
Enumerations, Autoboxing and Annotations(metadata): Enumerations, 8Hours
Enumeration fundamentals, the values() and valueOf() Methods, java
enumerations are class types, enumerations Inherits Enum, example, type
wrappers,Autoboxing,AutoboxingandMethods,Autoboxing/Unboxingoccurs
in Expressions, Autoboxing/Unboxing, Boolean and character values,
Autoboxing/Unboxinghelpspreventerrors,AwordofWarning.Annotations,
Annotationbasics,specifyingretentionpolicy,ObtainingAnnotationsatrun
timebyuseofreflection,AnnotatedelementInterface,UsingDefaultvalues,
MarkerAnnotations,SingleMemberannotations,BuiltInannotations.
Module2
ThecollectionsandFramework:CollectionsOverview,RecentChangesto 8Hours
Collections,TheCollectionInterfaces,TheCollectionClasses,Accessinga
collectionViaanIterator,StoringUserDefinedClassesinCollections,The
RandomAccessInterface,WorkingWithMaps,Comparators,TheCollection
Algorithms, Why Generic Collections?, The legacy Classes and Interfaces,
PartingThoughtsonCollections.
Module3
String Handling :The String Constructors, String Length, Special String 8Hours
Operations,StringLiterals,StringConcatenation,StringConcatenationwith
OtherDataTypes,StringConversionandtoString()CharacterExtraction,
charAt(),getChars(),getBytes()toCharArray(),StringComparison,equals()
andequalsIgnoreCase(),regionMatches()startsWith()andendsWith(),equals(
)Versus==,compareTo()SearchingStrings,ModifyingaString,substring(),
concat(),replace(),trim(),DataConversionUsingvalueOf(),Changingthe
CaseofCharactersWithinaString,AdditionalStringMethods,StringBuffer,
StringBuffer Constructors, length( ) and capacity( ), ensureCapacity( ),
setLength(),charAt()andsetCharAt(),getChars(),append(),insert(),reverse(
),delete()anddeleteCharAt(),replace(),substring(),AdditionalStringBuffer
Methods,StringBuilder
TextBook1:Ch15

Module4
Background; The Life Cycle of a Servlet; Using Tomcat for Servlet 8Hours
Development;AsimpleServlet;TheServletAPI;TheJavax.servletPackage;
ReadingServletParameter;TheJavax.servlet.httppackage;HandlingHTTP
RequestsandResponses;UsingCookies;SessionTracking.JavaServerPages
(JSP):JSP,JSPTags,Tomcat,RequestString,UserSessions,Cookies,Session
Objects
TextBook1:Ch31TextBook2:Ch11
Module5
TheConceptofJDBC;JDBCDriverTypes;JDBCPackages;ABriefOverview 8Hours
oftheJDBCprocess;DatabaseConnection;AssociatingtheJDBC/ODBC
BridgewiththeDatabase;StatementObjects;ResultSet;TransactionProcessing;
Metadata,Datatypes;Exceptions.
TextBook2:Ch06
Courseoutcomes:Thestudentsshouldbeableto:
InterprettheneedforadvancedJavaconceptslikeenumerationsandcollectionsin
developingmodularandefficientprograms
BuildclientserverapplicationsandTCP/IPsocketprograms
IllustratedatabaseaccessanddetailsformanaginginformationusingtheJDBCAPI
DescribehowservletsfitintoJavabasedwebapplicationarchitecture
DevelopreusablesoftwarecomponentsusingJavaBeans
Questionpaperpattern:
ThequestionpaperwillhaveTENquestions.
TherewillbeTWOquestionsfromeachmodule.
Eachquestionwillhavequestionscoveringallthetopicsunderamodule.
ThestudentswillhavetoanswerFIVEfullquestions,selectingONEfullquestionfromeach
module.
TextBooks:
th
1. HerbertSchildt:JAVAtheCompleteReference,7 /9thEdition,TataMcGrawHill,
2007.
2. JimKeogh:J2EETheCompleteReference,McGrawHill,2007.

ReferenceBooks:
th
1. Y.DanielLiang:IntroductiontoJAVAProgramming,7 Edition,PearsonEducation,
2007.
nd
2. StephanieBodoffetal:TheJ2EETutorial,2 Edition,PearsonEducation,2004.
3. UttamKRoy,AdvancedJAVAprogramming,OxfordUniversitypress,2015.

 ADVANCEDALGORITHMS
[AsperChoiceBasedCreditSystem(CBCS)scheme]
(Effectivefromtheacademicyear20162017)
SEMESTERV
SubjectCode 15CS554 IAMarks 20
NumberofLectureHours/Week 3 ExamMarks 80
TotalNumberofLectureHours 40 ExamHours 03
CREDITS03
Courseobjectives:Thiscoursewillenablestudentsto
Explainprinciplesofalgorithmsanalysisapproaches
Compareandcontrastanumbertheoreticbasedstrategies.
Describecomplexsignalsanddataflowinnetworks
Applythecomputationalgeometrycriteria.
Module1 Teaching
Hours
AnalysisTechniques:Growthfunctions,Recurrencesandsolutionofrecurrence 8Hours
equations;Amortizedanalysis:Aggregate,Accounting,andPotentialmethods,
StringMatchingAlgorithms:NaiveAlgorithm;RobinKarpAlgorithm,String
matching with Finite Automata, KnuthMorrisPratt and BoyerMoore
Algorithms
Module2
NumberTheoreticAlgorithms:Elementarynotions,GCD,Modulararithmetic, 8Hours
Solvingmodularlinearequations,TheChineseremaindertheorem,Powersofan
elementRSACryptosystem,Primalitytesting,Integerfactorization,Huffman
Codes, Polynomials. FFTHuffman codes: Concepts, construction, Proof
correctnessofHuffman'salgorithm;Representationofpolynomials
Module3
DFTandFFTefficientimplementationofFFT,GraphAlgorithms,BellmanFord 8Hours
AlgorithmShortestpathsinaDAG,Johnson'sAlgorithmforsparsegraphs,Flow
networksandtheFordFulkersonAlgorithm,Maximumbipartitematching.
Module4
ComputationalGeometryI:Geometricdatastructuresusing,C,Vectors,Points, 8Hours
Polygons,EdgesGeometricobjectsinspace;Findingtheintersectionofaline
andatriangle,Findingstarshapedpolygonsusingincrementalinsertion.
Module5
Computational GeometryII: Clipping: CyrusBeck and SutherlandHodman 8Hours
Algorithms;Triangulating,monotonicpolygons;Convexhulls,Giftwrapping
andGrahamScan;Removinghiddensurfaces
Courseoutcomes:Thestudentsshouldbeableto:
Explaintheprinciplesofalgorithmsanalysisapproaches
Applydifferenttheoreticbasedstrategiestosolveproblems
Illustratethecomplexsignalsanddataflowinnetworkswithusageoftools
Describethecomputationalgeometrycriteria.
Questionpaperpattern:
ThequestionpaperwillhaveTENquestions.
TherewillbeTWOquestionsfromeachmodule.
Eachquestionwillhavequestionscoveringallthetopicsunderamodule.
ThestudentswillhavetoanswerFIVEfullquestions,selectingONEfullquestionfromeach
module.
TextBooks:
1. ThomasH.Cormenetal:IntroductiontoAlgorithms,PrenticeHallIndia,1990
2. MichaelJ.Laszlo:ComputationalGeometryandComputerGraphicsinC'Prentice
HallIndia,1996
ReferenceBooks:
1. E.Horowitz,S.SahniandS.Rajasekaran,FundamentalsofComputerAlgorithms,
UniversityPress,Secondedition,2007
2. KennethABerman&JeromeLPaul,Algorithms,CengageLearning,FirstIndian
reprint,2008

 COMPUTERNETWORKLABORATORY
[AsperChoiceBasedCreditSystem(CBCS)scheme]
(Effectivefromtheacademicyear20162017)
SEMESTERV
SubjectCode 15CSL57 IAMarks 20
NumberofLectureHours/Week 01I+02P ExamMarks 80
TotalNumberofLectureHours 40 ExamHours 03
CREDITS02
Courseobjectives:Thiscoursewillenablestudentsto
Demonstrateoperationofnetworkanditsmanagementcommands
SimulateanddemonstratetheperformanceofGSMandCDMA
Implementdatalinklayerandtransportlayerprotocols.
Description(Ifany):
Fortheexperimentsbelowmodifythetopologyandparameterssetfortheexperimentand
takemultipleroundsofreadingandanalyzetheresultsavailableinlogfiles.Plotnecessary
graphsandconclude.UseNS2/NS3.
LabExperiments:
PARTA
1. Implementthreenodespointtopointnetworkwithduplexlinksbetweenthem.
Setthequeuesize,varythebandwidthandfindthenumberofpacketsdropped.
2. Implementtransmissionofpingmessages/tracerouteoveranetworktopology
consistingof6nodesandfindthenumberofpacketsdroppedduetocongestion.
3. ImplementanEthernetLANusingnnodesandsetmultipletrafficnodesandplot
congestionwindowfordifferentsource/destination.
4. ImplementsimpleESSandwithtransmittingnodesinwirelessLANbysimulation
anddeterminetheperformancewithrespecttotransmissionofpackets.
5. ImplementandstudytheperformanceofGSMonNS2/NS3(UsingMAClayer)or
equivalentenvironment.
6. ImplementandstudytheperformanceofCDMAonNS2/NS3(Usingstackcalled
Callnet)orequivalentenvironment.

PARTB
ImplementthefollowinginJava:
7. WriteaprogramforerrordetectingcodeusingCRCCCITT(16bits).
8. Writeaprogramtofindtheshortestpathbetweenverticesusingbellmanford
algorithm.
9. UsingTCP/IPsockets,writeaclientserverprogramtomaketheclientsendthefile
nameandtomaketheserversendbackthecontentsoftherequestedfileifpresent.
10.Writeaprogramondatagramsocketforclient/servertodisplaythemessageson
clientside,typedattheserverside.
11.WriteaprogramforsimpleRSAalgorithmtoencryptanddecryptthedata.
12.Writeaprogramforcongestioncontrolusingleakybucketalgorithm.

StudyExperiment/Project:
NIL
Courseoutcomes:Thestudentsshouldbeableto:
AnalyzeandComparevariousnetworkingprotocols.
Demonstratetheworkingofdifferentconceptsofnetworking.
 Implement,analyzeandevaluatenetworkingprotocolsinNS2/NS3
ConductionofPracticalExamination:
1.Alllaboratoryexperimentsaretobeincludedforpracticalexamination.
2.StudentsareallowedtopickoneexperimentfrompartAandpartBwithlot.
3.Strictlyfollowtheinstructionsasprintedonthecoverpageofanswerscript
4.Marksdistribution:Procedure+Conduction+Viva:80
PartA:10+25+5 =40
PartB:10+25+5 =40
5.Changeofexperimentisallowedonlyonceandmarksallottedtotheprocedureparttobe
madezero.

 DBMSLABORATORYWITHMINIPROJECT
[AsperChoiceBasedCreditSystem(CBCS)scheme]
(Effectivefromtheacademicyear20162017)
SEMESTERV
SubjectCode 15CSL58 IAMarks 20
NumberofLectureHours/Week 01I+02P ExamMarks 80
TotalNumberofLectureHours 40 ExamHours 03
CREDITS02
Courseobjectives:Thiscoursewillenablestudentsto
Foundationknowledgeindatabaseconcepts,technologyandpracticetogroom
studentsintowellinformeddatabaseapplicationdevelopers.
StrongpracticeinSQLprogrammingthroughavarietyofdatabaseproblems.
DevelopdatabaseapplicationsusingfrontendtoolsandbackendDBMS.
Description(Ifany):
PARTA:SQLProgramming(Max.ExamMks.50)
Design,develop,andimplementthespecifiedqueriesforthefollowingproblems
usingOracle,MySQL,MSSQLServer,oranyotherDBMSunder
LINUX/Windowsenvironment.
CreateSchemaandinsertatleast5recordsforeachtable.Addappropriate
databaseconstraints.
PARTB:MiniProject(Max.ExamMks.30)
UseJava,C#,PHP,Python,oranyothersimilarfrontendtool.All
applicationsmustbedemonstratedondesktop/laptopasastandaloneorweb
basedapplication(MobileappsonAndroid/IOSarenotpermitted.)
LabExperiments:
PartA:SQLProgramming
1 ConsiderthefollowingschemaforaLibraryDatabase:
BOOK(Book_id,Title,Publisher_Name,Pub_Year)
BOOK_AUTHORS(Book_id,Author_Name)
PUBLISHER(Name,Address,Phone)
BOOK_COPIES(Book_id,Branch_id,Noof_Copies)
BOOK_LENDING(Book_id,Branch_id,Card_No,Date_Out,Due_Date)
LIBRARY_BRANCH(Branch_id,Branch_Name,Address)
WriteSQLqueriesto
1. Retrievedetailsofallbooksinthelibraryid,title,nameofpublisher,
authors,numberofcopiesineachbranch,etc.
2. Gettheparticularsofborrowerswhohaveborrowedmorethan3books,but
fromJan2017toJun2017.
3. DeleteabookinBOOKtable.Updatethecontentsofothertablestoreflect
thisdatamanipulationoperation.
4. PartitiontheBOOKtablebasedonyearofpublication.Demonstrateits
workingwithasimplequery.
5. Createaviewofallbooksanditsnumberofcopiesthatarecurrently
availableintheLibrary.
2 ConsiderthefollowingschemaforOrderDatabase:
SALESMAN(Salesman_id,Name,City,Commission)
CUSTOMER(Customer_id,Cust_Name,City,Grade,Salesman_id)
ORDERS(Ord_No,Purchase_Amt,Ord_Date,Customer_id,Salesman_id)
WriteSQLqueriesto
1. CountthecustomerswithgradesaboveBangaloresaverage.
 2. Findthenameandnumbersofallsalesmanwhohadmorethanonecustomer.
3. Listallthesalesmanandindicatethosewhohaveanddonthavecustomersin
theircities(UseUNIONoperation.)
4. Createaviewthatfindsthesalesmanwhohasthecustomerwiththehighest
orderofaday.
5. DemonstratetheDELETEoperationbyremovingsalesmanwithid1000.All
hisordersmustalsobedeleted.
3 ConsidertheschemaforMovieDatabase:
ACTOR(Act_id,Act_Name,Act_Gender)
DIRECTOR(Dir_id,Dir_Name,Dir_Phone)
MOVIES(Mov_id,Mov_Title,Mov_Year,Mov_Lang,Dir_id)
MOVIE_CAST(Act_id,Mov_id,Role)
RATING(Mov_id,Rev_Stars)
WriteSQLqueriesto
1. ListthetitlesofallmoviesdirectedbyHitchcock.
2. Findthemovienameswhereoneormoreactorsactedintwoormoremovies.
3. Listallactorswhoactedinamoviebefore2000andalsoinamovieafter
2015(useJOINoperation).
4. Findthetitleofmoviesandnumberofstarsforeachmoviethathasatleast
oneratingandfindthehighestnumberofstarsthatmoviereceived.Sortthe
resultbymovietitle.
5. UpdateratingofallmoviesdirectedbyStevenSpielbergto5.
4 ConsidertheschemaforCollegeDatabase:
STUDENT(USN,SName,Address,Phone,Gender)
SEMSEC(SSID,Sem,Sec)
CLASS(USN,SSID)
SUBJECT(Subcode,Title,Sem,Credits)
IAMARKS(USN,Subcode,SSID,Test1,Test2,Test3,FinalIA)
WriteSQLqueriesto
1. ListallthestudentdetailsstudyinginfourthsemesterCsection.
2. Computethetotalnumberofmaleandfemalestudentsineachsemesterandin
eachsection.
3. CreateaviewofTest1marksofstudentUSN1BI15CS101inallsubjects.
4. CalculatetheFinalIA(averageofbesttwotestmarks)andupdatethe
correspondingtableforallstudents.
5. Categorizestudentsbasedonthefollowingcriterion:
IfFinalIA=17to20thenCAT=Outstanding
IfFinalIA=12to16thenCAT=Average
IfFinalIA<12thenCAT=Weak
Givethesedetailsonlyfor8thsemesterA,B,andCsectionstudents.
5 ConsidertheschemaforCompanyDatabase:
EMPLOYEE(SSN,Name,Address,Sex,Salary,SuperSSN,DNo)
DEPARTMENT(DNo,DName,MgrSSN,MgrStartDate)
DLOCATION(DNo,DLoc)
PROJECT(PNo,PName,PLocation,DNo)
WORKS_ON(SSN,PNo,Hours)
WriteSQLqueriesto
1. Makealistofallprojectnumbersforprojectsthatinvolveanemployee
whoselastnameisScott,eitherasaworkerorasamanagerofthe
departmentthatcontrolstheproject.
 2. ShowtheresultingsalariesifeveryemployeeworkingontheIoTprojectis
givena10percentraise.
3. FindthesumofthesalariesofallemployeesoftheAccountsdepartment,as
wellasthemaximumsalary,theminimumsalary,andtheaveragesalaryin
thisdepartment
4. Retrievethenameofeachemployeewhoworksonalltheprojects
controlledbydepartmentnumber5(useNOTEXISTSoperator).
5. Foreachdepartmentthathasmorethanfiveemployees,retrievethe
departmentnumberandthenumberofitsemployeeswhoaremakingmore
thanRs.6,00,000.
PartB:Miniproject
Foranyproblemselected,writetheERDiagram,applyERmappingrules,
normalizetherelations,andfollowtheapplicationdevelopmentprocess.
Makesurethattheapplicationshouldhavefiveormoretables,atleastone
triggerandonestoredprocedure,usingsuitablefrontendtool.
Indicativeareasinclude;healthcare,education,industry,transport,supplychain,
etc.
Courseoutcomes:Thestudentsshouldbeableto:
Create,Updateandqueryonthedatabase.
DemonstratetheworkingofdifferentconceptsofDBMS
Implement,analyzeandevaluatetheprojectdevelopedforanapplication.
ConductionofPracticalExamination:
1. AlllaboratoryexperimentsfrompartAaretobeincludedforpractical
examination.
2. Miniprojecthastobeevaluatedfor30Marks.
3. Reportshouldbepreparedinastandardformatprescribedforprojectwork.
4. Studentsareallowedtopickoneexperimentfromthelot.
5. Strictlyfollowtheinstructionsasprintedonthecoverpageofanswerscript.
6. Marksdistribution:
a) PartA:Procedure+Conduction+Viva:10+35+5=50Marks
b) PartB:Demonstration+Report+Vivavoce=15+10+05=30Marks
7. Changeofexperimentisallowedonlyonceandmarksallottedtotheprocedure
parttobemadezero.