B. Sc. Artificial Intelligence and Data Science 學士人工智能和數(shù)據(jù)科學_第1頁
B. Sc. Artificial Intelligence and Data Science 學士人工智能和數(shù)據(jù)科學_第2頁
B. Sc. Artificial Intelligence and Data Science 學士人工智能和數(shù)據(jù)科學_第3頁
B. Sc. Artificial Intelligence and Data Science 學士人工智能和數(shù)據(jù)科學_第4頁
B. Sc. Artificial Intelligence and Data Science 學士人工智能和數(shù)據(jù)科學_第5頁
已閱讀5頁,還剩92頁未讀, 繼續(xù)免費閱讀

下載本文檔

版權說明:本文檔由用戶提供并上傳,收益歸屬內容提供方,若內容存在侵權,請進行舉報或認領

文檔簡介

B.Sc.ArtificialIntelligenceandDataScience

Syllabus

AFFILIATEDCOLLEGES

ProgramCode:***

2022–2023onwards

BHARATHIARUNIVERSITY

(AStateUniversity,Accreditedwith“A”GradebyNAAC,Ranked13thamongIndianUniversitiesbyMHRD-NIRF,

WorldRanking:Times-801-1000,Shanghai-901-1000,URAP-982)

Coimbatore-641046,TamilNadu,India

B.Sc.ArtificialIntelligenceandDataScience2022-23onwards-AffiliatedColleges-AnnexureNo.28(a)(8)

SCAADATED:30.06.2022

Page

PAGE

5

of84

ProgrammeEducationalObjectives(PEOs)

TheB.Sc.ArtificialIntelligenceandDataScienceprogramdescribeaccomplishmentsthatgraduatesareexpectedtoattainwithinfivetosevenyearsaftergraduation

PEO1

Applytheknowledgeofmathematics,science,engineeringfundamentals,andanengineeringspecializationtothesolutionofcomplexengineeringproblems.

PEO2

Identity,formulate,reviewresearchliteratureandanalyzecomplexengineeringproblemsreachingsubstantiatedconclusionsusingprinciplesofmathematics,naturalsciences.

PEO3

Designsolutionsforcomplexengineeringproblemsanddesignsystemcomponentsorprocessesthatmeetthespecifiedneedswithappropriateconsiderationforthepublichealth,safety,andthecultural,societal,andenvironmentalconsiderations.

ProgrammeSpecificOutcomes(PSOs)

AfterthesuccessfulcompletionofB.Sc.ArtificialIntelligenceandDataScienceprogramthestudentsareexpectedto

PSO1

GraduatesshouldbeabletoevolveAIbasedefficientdomainspecificprocessesforeffectivedecisionmakinginseveraldomainssuchasbusinessandgovernancedomainsforArtificialIntelligenceandDataScience

PSO2

Applythetechnicalandcriticalthinkingskillsinthedisciplineofartificial

IntelligenceandDataSciencetofindsolutionsforcomplexproblems.

PSO3

DevelopandCreate,select,applythetheoreticalknowledgeofAIandDataAnalyticsalongwithpracticalindustrialtoolsandtechniquestomanageandsolvewickedsocietalproblems

PSO4

Demonstratetheabilitytocreateinnovativesolutionsfromideatoproduct,applyingscientificmethodsandtools

PSO5

Provideinnovativeideastoinstigatenewbusinessventuresinthehospitalityindustry

ProgrammeOutcomes(POs)

OnsuccessfulcompletionoftheB.Sc.ArtificialIntelligenceandDataScience

PO1

Exhibitgooddomainknowledgeandcompletestheassignedtasks

effectivelyandefficientlyinparwiththeexpectedqualitystandards.

PO2

Applyanalyticalandcriticalthinkingtoidentify,formulate,analyzeandsolve

complexproblemsinordertoreachauthenticatedconclusions

PO3

Designanddevelopresearchbasedsolutionsforcomplexproblemswithspecifiedneedsthroughappropriateconsiderationforthepublichealth,safety,cultural,societal

andenvironmentalconcerns.

PO4

EstablishtheabilitytoListen,read,proficientlycommunicateandarticulate

complexideaswithrespecttotheneedsandabilitiesofdiverseaudiences.

PO5

Deliverinnovativeideastoinstigatenewbusinessventuresandpossessthe

qualitiesofagoodentrepreneur.

PO6

Acquirethequalitiesofagoodleaderandengageinefficientdecisionmaking.

PO7

Graduateswillbeabletoundertakeanyresponsibilityasanindividual/memberof

multidisciplinaryteamsandhaveanunderstandingofteamleadership

PO8

Functionassociallyresponsibleindividualwithethicalvaluesandaccountableto

ethicallyvalidateanyactionsordecisionsbeforeproceedingandactivelycontributetothesocietalconcerns.

PO9

Identifyandaddressowneducationalneedsinachangingworldinwayssufficienttomaintainthecompetenceandtoallowthemtocontributetotheadvancementof

knowledge

PO10

Demonstrateknowledgeandunderstandingofmanagementprinciplesandapply

thesetooneownworktomanageprojectsandinmultidisciplinaryenvironment.

BHARATHIARUNIVERSITY::COIMBATORE641046

B.Sc.ArtificialIntelligenceandDataScience(CBCSPATTERN)

(Forthestudentsadmittedfromtheacademicyear2022-2023andonwards)

SchemeofExamination

Part

TitleoftheCourse

Hours/Week

Examination

Credits

Duration

inHours

MaximumMarks

CIA

CEE

Total

SemesterI

I

Language-I

6

3

50

50

100

4

II

English-I

6

3

50

50

100

4

III

Core1:FundamentalsofComputerProgramming

4

3

50

50

100

4

III

Core2:DataStructures

4

3

50

50

100

4

III

CoreLab1:ComputerProgrammingLab

3

3

25

25

50

2

III

Allied1:LinearAlgebra

5

3

50

50

100

4

IV

EnvironmentalStudies*

2

3

-

50

50

2

***Add-onCourses-NaanMudhalvanScheme:LanguageProficiencyforEmployability

Total

30

275

325

600

24

SemesterII

I

Language–II

6

3

50

50

100

4

II

English–II

4

3

25

25

50

2

III

Core3:IntroductiontoPythonProgramming

5

3

50

50

100

4

III

CoreLab2:PythonProgrammingLab

3

3

25

25

50

2

III

CoreLab3:InternetBasicsLab

3

3

25

25

50

2

III

Allied2:OptimizationTechniques

5

3

50

50

100

4

IV

ValueEducation–HumanRights*

2

3

-

50

50

2

&NaanMuthalvan-SkillCourse

EffectiveEnglish

http://kb.naanmudhalvan.in/images/c/c7/Cambridge_Course_Details.pdf

2

2

25

25

50

2

Total

30

250

300

550

22

SemesterIII

III

Core4:InternetProgramming

6

3

50

50

100

4

III

Core5:FoundationofArtificialIntelligence

6

3

50

50

100

4

III

CoreLab4:InternetProgrammingLab

5

3

50

50

100

4

III

Allied3:OperatingSystemDesign

6

3

50

50

100

4

III

SkillbasedSubject1:DataAnalytics

5

3

30

45

75

3

IV

Tamil**/AdvancedTamil*(OR)Non-

majorelective-I(YogaforHumanExcellence)*/Women’sRights*

2

3

-

50

50

2

***Add-onCourses-NaanMudhalvanScheme:DigitalSkillsForEmployability

Total

30

230

295

525

21

SemesterIV

III

Core6:CognitiveScienceandAnalysis

6

3

50

50

100

4

III

Core7:DatabaseDesignandManagement

4

3

25

25

50

2

III

CoreLab5:DatabaseProgrammingLab

3

3

50

50

100

4

III

Allied4:DataandInformationSecurity

5

3

50

50

100

4

III

Elective–I:DataMining/SoftwareEngineering/CompilerDesign

5

3

50

50

100

4

III

SkillbasedSubject2Lab:CapstoneProjectWorkPhaseI

2

3

30

45

75

3

IV

Tamil**/AdvancedTamil*(OR)Non-majorelective-II(GeneralAwareness*)

2

3

-

50

50

2

***NaanMuthalvan–SkillCourse

OfficeFundamentals-Lab

http://kb.naanmudhalvan.in/Bharathiar_University

_(BU)

3

2

25

25

50

2

Total

30

280

345

625

25

SemesterV

III

Core8:EthicsofArtificialIntelligence

6

3

50

50

100

4

III

Core9:FundamentalsofDataScience

6

3

50

50

100

4

III

CoreLab6:DataScienceLab

3

3

50

50

100

4

III

Elective–II:WebApplicationSecurity/ClientServerComputing/ComputerNetworks

6

3

50

50

100

4

III

Elective–III:BigDataAnalytics/CyberSecurity/DeepLearning

6

3

50

50

100

4

III

SkillbasedSubject3Lab:CapstoneProjectWorkPhaseII

3

3

30

45

75

3

***Add-onCourses-NaanMudhalvanScheme:ITCourses-InfosysSpringboard

Total

30

280

295

575

23

SemesterVI

III

Core10:RoboticProcessAutomation

6

3

50

50

100

4

III

Core11:ProjectWorkLab%%

4

-

50

50

100

4

III

CorePractical–VII:ProgramminginUIPathAutomationLab

3

3

25

25

50

2

III

Elective–IV:EthicalHacking/DigitalForensicsScience/NaturalLanguageProcessing

6

3

50

50

100

4

III

Elective–V:InternetofThings/DataVisualization/SocialNetworkAnalysis

4

3

50

50

100

4

III

SkillBasedSubject4:MachineLearning

5

3

30

45

75

3

V

ExtensionActivities**

-

-

50

-

50

2

***NaanMuthalvan–SkillCoursesCyberSecurity

http://kb.naanmudhalvan.in/images/7/71/Cybersecurity.pdf

2

2

25

25

50

2

Total

30

330

295

625

25

GrandTotal

1645

1855

3500

140

*NoContinuousInternalAssessment(CIA).OnlyUniversityExaminations.

**NoUniversityExaminations.OnlyContinuousInternalAssessment(CIA).

&TheEnglishII-Universitysemesterexaminationwillbeconductedfor50marks

(AsperexistingpatternofExamination)anditwillbeconvertedfor25marks.

***NaanMudhalvan–skillcourses-external25markswillbeassessedbyIndustry

andinternalwillbeofferedbyrespectivecourseteacher.

.in

FirstSemester

CourseCode

FundamentalsofComputerProgramming

L

T

P

C

Core/Elective/Supportive

Core:1

4

0

0

4

Pre-requisite

Basic knowledge of CconceptsandC++Programming

BasicknowledgeinProcedureOrientedProgrammingconcepts

Syllabusversion

2022-23

Onwards

CourseObjectives

Themainobjectivesofthiscourseareto:

1.ToimpartknowledgeaboutComputerfundamentals

2.TounderstandtheconceptsandtechniquesinCProgramming

3.ToequipandindulgethemselvesinproblemsolvingusingC

4.TointroduceheconceptsofObjectOrientedProgrammingParadigminC++

CourseOutcomes

1

LearnabouttheComputerfundamentalsandtheProblemsolvingandunderstandthebasicconceptsofCandC++programming

K1

2

Demonstratethevariousbasicprogrammingconstructslikedecisionmaking

statements.Loopingstatementsandfunctions

K2

3

Analyzetheobjectorientedconceptslikeoverloading,inheritance,polymorphism,

virtualfunctions,constructorsanddestructors

K3

4

Comparethevariousfilestreamclasses;filetypes,usageoftemplatesandexception

handlingmechanisms,prosandconsofprocedureorientedlanguagewiththeconceptsofprogramminglanguage

K4

5

Developprogramsincorporatingtheprogrammingconstructsofobjectoriented

programmingconcepts

K5,K6

K1–RememberK2–UnderstandK3–applyK4-AnalyzeK5–evaluateK6-Create

UnitI

IntroductiontoC

12Hours

OverviewofC-Introduction-Characterset-Ctokens-keyword&Identifiers-Constants-Variables-Datatypes-Declarationofvariables-Assigningvaluestovariables-DefiningSymbolicConstants-Arithmetic,Relational,Logical,Assignment,Conditional,Bitwise,Special,IncrementandDecrementoperators-ArithmeticExpressions-Evaluationofexpression-precedenceofarithmeticoperators-Typeconversioninexpression–operatorprecedence&associativity-Mathematicalfunctions-Reading&Writingacharacter-Formattedinputandoutput.

UnitII

DecisionMaking,LoopingandArrays

15Hours

DecisionMakingandBranching:Introduction–if,if….else,nestingofif…elsestatements-elseifladder–Theswitchstatement,The?:Operator–ThegotoStatement.DecisionMakingandLooping:Introduction-Thewhilestatement-thedostatement–theforstatement-jumpsinloops.Arrays–CharacterArraysandStrings

UnitIII

C++

15Hours

IntroductiontoC++-keyconceptsofObject-OrientedProgramming–Advantages–ObjectOrientedLanguages–I/OinC++-C++Declarations.FunctionsinC++-inlinefunctions–FunctionOverloading.ClassesandObjects:DeclaringObjects–DefiningMemberFunctions–StaticMembervariablesandfunctions–arrayofobjects–friendfunctions–Overloadingmemberfunctions–Bitfieldsandclasses–Constructoranddestructorwithstaticmembers.

UnitIV

Inheritance

15Hours

OperatorOverloading:Overloadingunary,binaryoperators–OverloadingFriendfunctions–typeconversion–Inheritance:TypesofInheritance–Single,Multilevel,Multiple,Hierarchal,Hybrid,Multipathinheritance–VirtualbaseClasses–AbstractClasses.

UnitV

Pointers&Files

15Hours

Pointers–Declaration–PointertoClass,Object–thispointer–PointerstoderivedclassesandBaseclasses–Arrays–Characteristics–arrayofclasses.Files–Filestreamclasses–filemodes–SequentialRead/Writeoperations–BinaryandASCIIFiles–RandomAccessOperation–Templates–ExceptionHandling–Miscellaneousfunctions.

UnitVI

ContemporaryIssues

3Hours

ProblemSolvingthroughCProgramming–OnlineCoding

TotalLectureHours

60Hours

TextBook(s)

EBalagurusamy:ComputingFundamentals&CProgramming–TataMcGraw-Hill,SecondReprint2008

AshokNKamthane,Object-OrientedProgrammingwithAnsiandTurboC++,Pearson

Education,2003.

ReferenceBooks

AshokNKamthane:ProgrammingwithANSIandTurboC,Pearson,2002.

E.Balagurusamy,Object-OrientedProgrammingwithC++,TMH,1998

MariaLitvin&GrayLitvin,C++foryou,Vikaspublication,2002.

JohnRHubbard,ProgrammingwithC,2ndEdition,TMHpublication,2002

RelatedOnlineContents(MOOC,SWAYAM,NPTEL,Websitesetc)

\h

https://onlinecourses.swayam2.ac.in/aic20_sp06/preview

\h

https://onlinecourses.swayam2.ac.in/arp19_ap79/preview

CourseDesignedby:Dr.B.ARIVAZHAGAN,AssistantProfessor,SchoolofComputerScience,

VETInstituteofArtsandScience(Co-Education)College,Erode

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

CO1

M

L

L

L

L

L

L

L

L

L

CO2

M

L

L

L

L

L

L

L

L

L

CO3

S

M

L

L

L

L

L

L

L

L

CO4

S

M

L

L

L

L

L

L

L

L

CO5

S

M

L

L

L

L

L

L

L

L

*S-Strong;M-Medium;L-Low

CourseCode

ComputerProgrammingLab

L

T

P

C

Core/Elective/Supportive

CoreLab:1

-

-

3

2

Pre-requisite

BasicknowledgeofProcedureOrientedProgrammingconcepts

BasicknowledgeinCProgramming

Syllabusversion

2022-23

Onwards

CourseObjectives

TointroduceheconceptsofObject-OrientedProgrammingParadigmandprogrammingconstructsofC++

CourseOutcomes

1

Applythevariousbasicprogrammingconstructslikedecisionmakingstatements.

Loopingstatements,functions,conceptslikeoverloading,inheritance,polymorphism,virtualfunctions,constructorsanddestructors

K1,K3

2

IllustratetheconceptofVirtualClasses,inlinefunctionsandfriendfunctions

K2,K4

3

Comparethevariousfilestreamclasses;filetypes,usageoftemplatesandexception

handlingmechanisms.

K5

4

Comparetheprosandconsofprocedureorientedlanguagewiththeconceptsofobject

orientedlanguage

K5

K1–RememberK2–UnderstandK3–applyK4-AnalyzeK5–evaluateK6-Create

1.WriteaCprogramtofindthesum,average,standarddeviationforagivensetofnumbers.

2.WriteaCprogramtogeneratenprimenumbers.

3.WriteaCprogramtogenerateFibonacciseries.

4.WriteaCprogramtosortthegivensetofnumbersinascendingorder.

5.WriteaCprogramtocountthenumberofVowelsinthegivensentence.

6.WriteaC++Programtocreateclass,whichconsistsofEMPLOYEEDetaillikeE_Number,E_Name,

Department,Basic,Salary,Grade.Writeamemberfunctiontogetanddisplaythem.

7.WriteaC++ProgramtocreateaclassSHAPEwhichconsistsoftwovirtualfunctions

8.WriteaC++ProgramusingfunctionoverloadingtoreadtwomatricesofdifferentDataTypes

Suchasintegersandfloatingpointnumbers.

9.WriteaC++ProgramtocreateaFileandtodisplaythecontentsofthatfilewithlinenumbers.

10.WriteaC++Programtomergetwofilesintoasinglefile.

TotalLectureHours

36hours

TextBook(s)

EBalagurusamy:ComputingFundamentals&CProgramming–TataMcGraw-Hill,SecondReprint2008

AshokNKamthane,Object-OrientedProgrammingwithAnsiAndTurboC++,PearsonEducation,2003.

RelatedOnlineContents[MOOC,SWAYAM,NPTEL,Websitesetc.]

1.IntroductiontoProgramminginC–NPTEL

2.ProblemsolvingthroughProgramminginC-SWAYAM

3.CforEveryone:ProgrammingFundamentals–Course

CourseDesignedby:Dr.B.ARIVAZHAGAN,AssistantProfessor,SchoolofComputerScience,

VETInstituteofArtsandScience(Co-Education)College,Erode

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

CO1

S

S

M

L

L

L

L

L

L

L

CO2

S

S

M

L

L

L

L

L

L

L

CO3

S

S

M

L

L

L

L

L

L

L

CO4

S

S

M

L

L

L

L

L

L

L

*S-Strong;M-Medium;L-Low

CourseCode

DataStructures

L

T

P

C

Core/Elective/Supportive

Core:2

4

0

0

4

Pre-requisite

BasicunderstandingofDatastorage,retrievalandalgorithms.

Syllabusversion

2022-23

Onwards

CourseObjectives

TounderstandtheconceptsofADTs

Todesignlineardatastructures–lists,stacks,andqueues

Tounderstandsorting,searchingandhashingalgorithms

ToapplyTreeandGraphstructures

CourseOutcomes

1

Understandtheconceptofabstractdatatypes

K1

2

Analyzelineardatastructures,suchaslists,queues,andstacks,accordingtotheneedsofdifferentapplications

K2

3

Demonstratetheconceptoftreesanditsapplications

K3

4

Design,implementandanalyzeefficienttreestructurestomeetrequirementssuchassearching,indexing,andsorting

K4

5

Enhancetheknowledgetosolveproblemsasgraphproblemsandimplementefficientgraphalgorithmstosolvethem

K5,K6

K1–RememberK2–UnderstandK3–applyK4-AnalyzeK5–evaluateK6-Create

UnitI

AbstractDataTypes

12Hours

AbstractDataTypes(ADTs)–ADTsandclasses–introductiontoOOP–classesinPython–inheritance–

namespaces–shallowanddeepcopying.Introductiontoanalysisofalgorithms–asymptoticnotations–recursion–analyzingrecursivealgorithms.

UnitII

LinearStructures

15Hours

ListADT–array-basedimplementations–linkedlistimplementations–singlylinkedlists–circularlylinkedlists–doublylinkedlists–applicationsoflists–StackADT–QueueADT–doubleendedqueues

UnitIII

SortingandSearching

15Hours

Bubblesort–selectionsort–insertionsort–mergesort–quicksort–linearsearch–binarysearch–hashing–hashfunctions–collisionhandling–loadfactors,rehashing,andefficiency.

UnitIV

TreeStructures

15Hours

TreeADT–BinaryTreeADT–treetraversals–binarysearchtrees–AVLtrees–heaps–multi-waysearchtrees.

UnitV

GraphStructures

15Hours

GraphADT–representationsofgraph–graphtraversals–DAG–topologicalordering–shortestpaths–minimumspanningtrees.

UnitVI

ContemporaryIssues

3Hours

Expertlectures,onlineseminars-webinars

TotalLectureHours

60Hours

TextBook(s)

EllisHorowitz,SartajShani,DataStructures,GalgotiaPublication.

EllisHorowitz,SartajShani,SanguthevarRajasekaran,ComputerAlgorithms,GalgotiaPublication.

MichaelT.Goodrich,RobertoTamassia,andMichaelH.Goldwasser,“DataStructures&AlgorithmsinPython”,JohnWiley&SonsInc.,2013

Lee,KentD.,Hubbard,Steve,“DataStructuresandAlgorithmswithPython”SpringerEdition2015.

Aho,Hopcroft,andUllman,“DataStructuresandAlgorithms”,PearsonEducation,1983.

ReferenceBooks

Jean-Paul,Tremblay&PaulG.Sorenson,AnIntroductiontoDatastructureswithApplications

TataMcGrawHillCompany2008,2ndEdition.

Samanta.D,ClassicDataStructurePrenticeHallofIndiaPvtLtd2007,9thEdition

SeymourLipschutz,DataStructuresMcGrawHillPublications,2014,1stEdition

RanceD.Necaise,“DataStructuresandAlgorithmsUsingPython”,JohnWiley&Sons,2011.

ThomasH.Cormen,CharlesE.Leiserson,RonaldL.Rivest,andCliffordStein,“IntroductiontoAlgorithms",SecondEdition,McGrawHill,2002.

MarkAllenWeiss,“DataStructuresandAlgorithmAnalysisinC++”,FourthEdition,PearsonEducation,2014

RelatedOnlineContents(MOOC,SWAYAM,NPTEL,Websitesetc)

CourseDesignedby:Dr.B.ARIVAZHAGAN,AssistantProfessor,SchoolofComputerScience,

VETInstituteofArtsandScience(Co-Education)College,Erode

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

CO1

S

S

S

M

M

M

S

M

M

M

CO2

S

S

S

M

M

M

M

M

M

M

CO3

S

S

S

M

S

M

M

M

S

S

CO4

S

S

S

M

S

S

S

S

M

M

*S-Strong;M-Medium;L-Low

CourseCode

LinearAlgebraandNeuralNetworks

L

T

P

C

Core/Elective/Supportive

Allied:1

5

1

--

4

Pre-requisite

BasicknowledgeinMathematics

Syllabusversion

2022-23

Onwards

CourseObjectives

Tointroducethecomputationaltechniquesandalgebraicskillsessentialforthestudyofsystemsoflinearequations,matrixalgebra,andvectorspaces

Tointroducetheconceptsofneuralnetworksandfuzzysystems

Toexplainthebasicmathematicalelementsofthetheoryoffuzzysets.

CourseOutcomes

1

Explaintheconcept/theoryinlinearalgebra,todevelopdynamicandgraphicalviewstotherelatedissuesofthechosentopicsasoutlinedincoursecontentandtoformallyprovetheorems.

K1

2

Recognizethebasicapplicationsofthechosentopicsandtheirimportanceinthemodernscience.

K2

3

Developsimplemathematicalmodelsandapplybasiclinearalgebratechniqueslearnedfromthechosentopicstosolvesimpleproblems

K3

4

Reportandcommunicateeffectivelywithothersandpresentmathematicalresultsinalogicalandcoherentfashion

K4

5

Analyzetheapplicationsoffuzzylogicandneuralnetworkforvariousapplications.

K5

K1–RememberK2–UnderstandK3–applyK4-AnalyzeK5–evaluateK6-Create

UnitI

Matrix

15

Introduction-Determination-InverseofaMatrix-RankofaMatrix-EigenValueProblem-Transpose-PropertiesofTranspose-SolvingSimultaneouslinearequationsbymatrixmethod.

UnitII

SystemofSimultaneousLinearAlgebraicEquation

15

GaussEliminationMethod-GaussJordanMethod-SimpleProblems-GaussSeidelMethod-SimpleProblems.

UnitIII

NumericalDifferentiation&Integration

15

NumericalDifferentiation:Newton’sForwardDifference-Newton’sBackwardDifferenceFormula.NumericalIntegration:TrapezoidalRule-Simpson’sRule.

UnitIV

GraphTheory

15

GraphTheory:BasicTerminology-Paths,Cycle&Connectivity-SubgraphsandTypesofGraphs-RepresentationofGraphsinComputerMemory.Trees:PropertiesofTreesandBinaryTrees-TraversingBinaryTreesandComputerRepresentationofGeneralTrees

UnitV

FundamentalsofNeuralNetworks

15

Basicconceptsofneuralnetworks–Humanbrain-ModelofanArtificialneuron-Neuralnetworkarchitecture:SinglelayerFeedforwardnetwork-MultilayerFeedforwardnetwork–Recurrentneuralnetwork–Characteristicsofneuralnetworks–LearningMethods-TaxonomyofneuralnetworkArchitecture-Historyofneuralnetworkresearch

TotalLectureHours

75

TextBook(s)

Navanitham,P.A.,“BusinessMathematics&Statistics”,JaiPublishers,Trichy(UnitI)

VenkataramanM.K.,“NumericalMethodsinScience&Engineering”,NationalPublishingCompany,Chennai.(UnitII&III)

SharmaJ.K.,“DiscreteMathematics”,SecondEdition,MacMillanPublishersIndiaLimited,Chennai,2005(UnitIV)

RajasekaranS.andVijayalakshmiPaiG.A.,“NeuralNetworks,FuzzyLogic,andGeneticAlgorithms:SynthesisAndApplications”PrenticeHallofIndia(UnitV)

ReferenceBook(s)

1.Fuzzylogic&NeuralNetworks/ChennakesavaR.Alavala/NewAgeInternational,2008

2.NeuralNetworksforcontrol,MillonW.T,SuttonR.SandWerbosP.J,MITPress1992

3.FuzzysetsFuzzylogic,Klir,G.JanfdYuanB.BPrenticeHalloifIndiaPvt.Ltd.,,NewDelhi

4.IntroductiontoFuzzycontrol,DirankovD.HellendoornH,ReinfrankM.,NarosaPublicationsHouse,NewDelhi1996

RelatedOnlineContents(MOOC,SWAYAM,NPTEL,Websitesetc)

CourseDesignedby:Dr.C.RADHIKA,AssistantProfessor&Head,Dept.ofMathematics,

VETInstituteofArtsandScience(Co-Education)College,Erode

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

CO1

M

L

L

L

L

L

L

L

L

L

CO2

M

L

L

L

L

L

L

L

L

L

CO3

S

M

L

L

L

L

L

L

L

L

CO4

S

S

M

L

L

L

L

L

L

L

CO5

S

S

S

L

L

L

L

L

L

L

*S-Strong;M-Medium;L-Low

SecondSemester

CourseCode

IntroductiontoPythonProgramming

L

T

P

C

Core/Elective/Supportive

Core:3

5

0

-

4

Pre-requisite

Basic knowledgeofPythonProgramming.

KnowledgeinObjectOrientedProgramming

Concepts.

Syllabusversion

2022-23

Onwards

CourseObjectives

ToknowthebasicsofalgorithmicproblemsolvingwithreadandwritesimplePythonprograms.

TodevelopPythonprogramswithconditionalsandloops.

TodefinePythonfunctionsandcallthem.

TousePythondatastructures-lists,tuples,dictionariesandfixinput/outputwithfilesinPython.

ExpectedCourseOutcomes

1

Developalgorithmicsolutionstosimplecomputationalproblems

K1

2

Read,write,executebyhandsimplePythonprograms.StructuresimplePython

programsforsolvingproblems.

K2

3

DecomposeaPythonprogramintofunctions.

K3

4

RepresentcompounddatausingPythonlists,tuples,dictionaries.Readandwritedata

from/tofilesinPythonPrograms

K3

5

JudgetheprosandconsofPython

K4

K1–RememberK2–UnderstandK3–applyK4-AnalyzeK5–evaluateK6-Create

UnitI

AlgorithmicProblemSolving

16

Algorithms,buildingblocksofalgorithms(statements,state,controlflow,functions),notation(pseudocode,flowchart,programminglanguage),algorithmicproblemsolving,simplestrategiesfordevelopingalgorithms(iteration,recursion).

UnitII

Data,Expressions,Statements

15

Pythoninterpreterandinteractivemode,valuesandtypes:int,float,boolean,stringandlist;variables,expressions,statements,tupleassignment,precedenceofoperators,comments,modulesandfunctions,functiondefinitionanduse,flowofexecution,parametersandarguments.

UnitIII

ControlFlow,Functions

14

Conditionals:Booleanvaluesandoperators,conditional(if),alternative(if-else),chainedconditional(if-elif-else).Iteration:state,while,for,break,continue,pass.Fruitfulfunctions:returnvalues,parameters,localandglobalscope,functioncomposition,recursion.Strings:stringslices,immutability,stringfunctionsandmethods,stringmodule,Listsasarrays.

UnitIV

Lists,Tuples,Dictionaries

13

Lists:listoperations,listslices,listmethods,listloop,mutability,aliasing,cloninglists,listparameters.Tuples:tupleassignment,tupleasreturnvalue,Dictionaries:operationsandmethods,advancedlistprocessing-listcomprehension.

UnitV

Files,Modules,Packages

17

Filesandexception:textfiles,readingandwritingfiles,formatoperator,commandlinearguments,errorsandexceptions,handlingexceptions,modules,packages.

TotalLectureHours

75

TextBook(s)

1.AllenB.Downey,``ThinkPython:HowtoThinkLikeaComputerScientist’’,2ndedition,UpdatedforPython3,Shroff/O’ReillyPublishers,2016.

2.GuidovanRossumandFredL.DrakeJr,“AnIntroductiontoPython–RevisedandupdatedforPython3.2,NetworkTheoryLtd.,2011.

ReferenceBook(s)

1.JohnVGuttag,“IntroductiontoComputationandProgrammingUsingPython’’,Revisedand

expandedEdition,MITPress,2013

2.RobertSedgewick,KevinWayne,RobertDondero,“IntroductiontoProgramminginPython:An

Inter-disciplinaryApproach,PearsonIndiaEducationServicesPvt.Ltd.,2016.

3.TimothyA.Budd,“ExploringPython”,Mc-GrawHillEducation(India)PrivateLtd.,,2015.

4.KennethA.Lambert,“FundamentalsofPython:FirstPrograms”,CENGAGELearning,2012.

5.CharlesDierbach,“IntroductiontoComputerScienceusingPython:AComputationalProblem-

SolvingFocus,WileyIndiaEdition,2013.

6.PaulGries,

溫馨提示

  • 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請聯(lián)系上傳者。文件的所有權益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內容里面會有圖紙預覽,若沒有圖紙預覽就沒有圖紙。
  • 4. 未經(jīng)權益所有人同意不得將文件中的內容挪作商業(yè)或盈利用途。
  • 5. 人人文庫網(wǎng)僅提供信息存儲空間,僅對用戶上傳內容的表現(xiàn)方式做保護處理,對用戶上傳分享的文檔內容本身不做任何修改或編輯,并不能對任何下載內容負責。
  • 6. 下載文件中如有侵權或不適當內容,請與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準確性、安全性和完整性, 同時也不承擔用戶因使用這些下載資源對自己和他人造成任何形式的傷害或損失。

評論

0/150

提交評論