0% found this document useful (0 votes)
34 views9 pages

U20csot03-Basics of Artificial Intelligence

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
34 views9 pages

U20csot03-Basics of Artificial Intelligence

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 9
PROFILE OF AN INDIVIDUAL COURSE PART-A Introduction of the course: Artificial Tnteligence (Al) is a trending technology in all the domains such as Ferauerings industries, medisines, weather predictions and gaming ete, Machines can learn Fomthe labeled and non-labeled input tems for any kind ofpredictions. To achieve the right goal, human rust know about intelligent system based on logics, rules and decision making, activities COURSE U20csoma) CATEGORY BASICS OF ARTIFICIAL ['3—j-[o—}-$—| oO INTELLIGENCE Pre requisite: NIL Name of the Course coordinator: (Mrs. T. Usha Contact Hrs.: 45 Course offering Dept./School: |CSE/ School: of Computing Total Marks: 100 ‘Science and En; ineering Course Objective and Summary 1 intelligence and its real time applications. This cou mulation along with solving methods. Aer finishing th Papeetsful completion of the said course, students can able to undertone dasies of Al concepts, “present a problem with frst order and predicatc logics, design software agents to solve a problem Course Outcomes(COs) co Course outcome Blooms No. level cor Paestand the fandamentals oF the evaluation oF ; [Artificial Intelligence (AI) and its foundations C02 _|Apply problem solving techniques 3 C03 Analyze seme playing techniques and CSP Techniques 4 Cog [Examine logical Reasoning and knowledge representation aad : [Engincering COS [ize the concepts of Artificial Intelligence and its application 3 Mapping / Alignment of COs with PO & PSO PO PO PO |PO | PO] PO [PO Pos |PO | POT POI POITPSO [PSO | PSO 1 4 [5 |6 i7 9 fo {a [2 fi {2 [3 ieee ish ate |e ao] ea ae eo calee si -fa ] a FOR eae ae | evarel Pees earch eee sss Se Ee cece ee 1 z 2D Feat] ea seat | ey ese cee sc ees ee eH 1 = wr bitigizi-|.|-|,).1.7* eal ib tne Gee eae ne OS] 3 Ji [ata [- ee fea ape (ick mark or level of correlation: High, 2-Medium, I-Low) Part B- Content of the Course MODULE-I INTELLIGENT AGENTS 9 Foundation of AL and history of Al intelligent agents: Agents and Environments, the concept of Cauauality the nature of environments, Architecture for Intelligent Agents — Agent SOmmunication Negotiation and Bargaining ~ Argumentation among Agents MODULE-II PROBLEM SOLVING 9 Scarching- Searching for solutions, uniformed search Strategies — Breadth first search, depth first Search, Search with partial information (Heuristic search) Hill climbing, A* AO® Algorithms, peangt eduction, tinismax algorithm, optimal decisions ia muipleyer eancy, Alpha-Beta Proning,Evaluation functions. MODULE-I GAME PLAYING AND CSP. 9 Knowledge representation issues, predicate logic logic Programming, semantic nets- frames ana inheritance, constraint propagation, representing knowledge using rules, rules based eduction systems, Information Retrieval- Information Extraction = Nexeat Language Processing - Machine Translation MODULE- IV LOGICAL AGENTS 9 First order logic, Inference in frst order logic, propositional vs. first order inference, unification Alits forward chaining, Backward chaining, Resolution, Learning fom observation Indu Kearming, feinforcement learning — active reinforcement leaming generalization in reinforcement learning — policy search ~ inverse reinforcement learnings MODULE-V APPLICATIONS OF AI 9 AL applications — Language Models - Information Retrieval- Information Extraction — Natural panguage Processing ~ Machine Translation ~ Speech Recognition - Robot = Tlardvne Perception ~ Planning - Moving Total : 48 hours 2 Alignment of topics of the courses with COs St. cOUMMARY OF COURSE Hrs, foment 6:C0's 1 [Foundation of Al and history of Al inteligen| cor lagents 2 [Agents and environments 1 cor 3. {The concept of rationality 1 co 4 [he nature of environments 1 cor § {Architecture for intelligent agents i co 6 [Agent communication cor 7 |Negotiation cor 8 [Bargaining col 9 |Argumentation among agents cor 10 [Searching: solutions coz 11 [Uniformed search strategies coz 12 [Breadth frst search, depth first Search, co2 13 |Search with partial information(Heuistie search co2 i elimbing 14 |A*,AO* Algorichms coz 15_|Problem reduction, mini-max algorithm co2 16 [Optimal decisions in multiplayer games coz 17 |Alpha-Beta pruning coz 18 [Evaluation finetions 02 19 Knowledge representation issues cos 20 |Predicate logie and programming cos 21 [Semantic nets, frames and inheritance co3 22 [Constraint propagation C03 23 [Representing knowledge using rules cos 24 {Rules based deduction systems cos 25 {Information retrieval and extraction cos 26 [Natural language processing cos 27. |Machine translation cos 28 [First order logic, Inference in first order co4 oxic 29 [Propositional vs. First order inference| cos ification &list 30 _ | Forward and backward cl cos 31 [Resolution 1 co4 ad ag fiom observation inductive i ie 33. Reinforcement learning 1 cos 34 [Active reinforcement learning 1 co4 35 Caspian on nee 1 Gon 36 _ [Inverse reinforcement learning 1 co4 37 {Al applications 1 cos 38 Language Models 1 cos 39 [Information Reirieval 1 cos 40° flnformation Extraction 1 cos 41 (Natural Language Processing i C05 42° Machine Translation 1 cos 43 Speech Recognition, Robot 1 cos 44° Hardware , Perception 1 cos 4g. Planning Moving : ae Ege eee crsee secession sae CELEEEEEY 3. Lesson plan / Topic assigned with CO's, Teaching tools used COT Rete [Teach [Propose | Comp | Bloom’s 7 rene | mg a leted | Level e {Toot {Date | pate ta | ot 2 1 INTELLIGENT aGENrs [Foundation of Al and history of al) COI intelligent agents 2_ [Agents and environments coi} tai) tT 2 3. |The concept of rationality coi} epi | oT 2 4. {The nature of environments coi} rei | 12 2 5 [Architecture for intelligent agents | COL} TBI | Ti 2 6 [Agent communication cory tai | 71 2 7. |Negotiation col, ta} 71 8. Bargaining col} m2] 1 9 [Argumentation among agents | CO1! RBI | 12 1p PROBLEM SOLVING coz| Bt} 11 ‘Searching: solutions 11 [Uniformed search strategies — | C02] RB2 | Ty 12 [Breadth first search, depth first co! rBi | ty earch, earch with partial RB2] TI 13 |information(Heurstic search) Hill CO 2 climbin 14 |A*,AO* Algorithms co2| TB2 | 72 1s Problem reduction, minimal cg] Ta2 | TI 16 [Optimal decisions in mutiplaye| cg | TB2 | Ty mes 17 |Alpha-Bete pruning co2] 12} 1 18 [Evaluation functions coz} ta | or (CAME PLAYING ANDCsP |) tai | Ty 19 [Knowledge representation C03 issues 29 [Predicate togie and ¢o3| TB2 | 12 rogramming 2q [Semantic nets, fiames and co3] TB | Tr inheritance 22 |Constraint propagation cos| epi] om 23 [Representing knowledge using ¢o3| RB2 | To kules 24 [Ruks based deduction systems | CO3) TBL | 11 2g [information retrieval and ¢g3 | TB2 TL lextraction 26 Natural language processing | Co3| Tp2 | 71 27, Machine translation co3| mp2] 12 LOGICAL AGENTS 1 28 C04) RBI [First order logic, Inference is frst order logic 29 [Propositional vs. First orded coy | RB2 | TI 4 linference, Unification &list 30 [Fonward and backward coy | RBI] 12 4 ining 31 [Resolution cos] ta} 11 4 [Learning ftom — observatio 32 linductivetearain Cot] RB2 | TH : 33. Reinforcement learning cos} TB.) 12 4 34 Active reinforcement learning | CO4) RB2| TL 4 ‘eneralization in reinforeement 35 learning, policy search con Bei | 2 4 36 [inverse reinforcement teaming | CO4| RB2 | —T1 4 47 APPLICATIONS OF at cos| ™2| 72 2 |Al applications 38 |Language Models cos} er} 71 3 39 Information Retrieval cos} ma | m1 3 40 [Information Extraction cos} tai | om 3 ay Notural Language Processing | Cos] ra | ay i 42 [Machine Translation cos) rez] om 3 43 [Speech Recognition, Robot | COS| RB2| Ti 3 44 Hardware , Perception cos} RB2] 72 3 45 Planning Moving C05} RB2 rR 3 Assignment SN Questions CO | Category | BT Level 1 | Give the steps involved in reinforcement machine|og | Assignment ba learning algorithm for an image identification. 2 | Differentiate Teursios “and werarcbieal 55) acsgamon 3 planning methods with simple example, ‘Type code | Teaching Tool Planned TI Black Board T2 Power Point Presentation “I Reference eripti aa Description TBI « IS. Russel and P. Norvig, “Artificial Intelligence — A Modern |Approach”, Second Edition, Pearson Education Tp2 _—_‘[Pavid Poole, Alan Mackworth, Randy Goebel, “Computational intelligence : a logical approach”, Oxford University Press. RBI (G. Luger, “Antificial Intelligence: Structures and Strategies for {complex problem solving”, FourthEdition, Pearson Education aS: Nilsson, “Artificial Intelligence: A new Synthesis", Elsevier Publishers. Part C- Assessment and Evaluation Assessment Patten There ate 4 Continuous Leaming Assessment (CLA) for the subject and for CLA 1 for 30marks, CLA 2. for 30 Marks and CLA3 for 30 Marks and CLA 4 for 10 Marks, CO WEIGHTAGE co* Weighiage s (Theory) ‘COL 20 CO? 20 COs 20 ‘COs 20 COS 20 Syllabus for Assessm CLA 1 portions will be Unit 1 and half of Unit 2 with 30 Marks. CLA 2 portions will be half of Unit 2 and Unit 3 with 30 Marks. CLA 3 portions will Unit 4 and Unit 5 with 30 Marks. CLA 4 will be assignments. Continuous Learning Assessment (CLA) ~ Weightages (50%) cos ‘Tests (Mark) CLAS CLA CLA2 CLA3 | Assignments (mark) cor 20 co2 10 10 cos 20 cO4 15 3 [cos 15 5 Final Examination — Weightage 50% “co's Marks (Theory) col 20 co2 20 co3 20 C04 20 cos 20 RUBRICS FOR END TERM EXAM: ae PARTA PARTB | PARTC] TOTALCO ) (2 Marks) (4Marks) | (12Marks)| Values cot 4 4 12 20 co2 4 4 12 20 cos 4 4 12 20 co4 4 4 2 20 cos 4 4 12 20 Evaluation Summary: EXAMS ‘Total Marks split | WEIGHTAGE | TOTAL MARKS up Continuous Internal 100 Assessment Theory 50% of Average (CLA 1,CLA 2,CLA 3, CLA4) 100 Marks End Semester Exam 100 50% of Average theory Part D — Learning Resources TEXT BOOKS ; 1 S.Russel and P. Norvig, “Artifical Intelligence ~ A ModemApproach", Second Edition, Pearson Education, 2. David Poole, Alan Mackworth, Randy Goebel, “Computational Intelligence : * logical approach”, Oxford University Press. REFERENCE BOOKS: 1. G, Luger, “Artificial Intelligence: Structures and Strategies for complex problem solving”, Fourth Edition, Pearson Education, 2. J. Nilsson, “Artificial Intelligence: A new Synthesis”, Elsevier Publishers. ONLINE RESOURCES: 1. bttps://builtin.com/artificial-intelligence 2. https:(fwww.investopedia.com/terms/a/artficial-intelligence-ai,asp. 3. bltps://www. ibm.conv/in-en/cloud/learn/what-is-artificial-intelligence 4. hitps://www,sas,conven_usvinsights/analvties/what-is-artificial-intelligence.html //www.oracle, conv cial-intelligence/what-is-ai/ //nptel.ae.in/courses/1061

You might also like