218/23, 10:16 PM ‘about blank K L Deemed to be University Department of Computer Science and Engincering-Honors ~ KLVZA, Course Handout 2022-2023, Even Sem (Course Tile ‘DATA STRUCTURES ‘Course Code 2281202 L-EP-S Stueture 302-4 Prerequisite (Credits 3 ‘Course Coordinator ‘SIVA KUMAR PATHURT “Team of Instuctors “Teaching Associates ‘Syllabus :Algorithm Analysis: Mathematical Background, Model, Analyze, Running Time Calculations. Sorting Introduction to Sorting Algorithm, Insertion Sort, Shell sort, Heap sort, Merge sort, Quick sort, Bucket Sort, External Sorting. Dynamic Memary implementation of linear data structures ‘ingly Linked lst, doubly linked list, circularly linked list, Applications of data structures: Polynomial Manipulation, Implementation of Slacks and {Queues using Linked Lists, Cireular Queue, Deque(Double ended queue), Applications of Stacks and Queues, Priority Queues (Heaps): Model, ‘Simple Implementations, Binary Heap, Applications of Priority Queues, Hashing: Inioducion to Hashing, Hash Function, Separate Chaining, Hash “ables without Linked Lists, Rebashing, Hash Tables in the Standard Library, Extendible Hashing, Trees: Inodution to trees, Binary Trees, Tree “Traversals, The Search Tree: Binary Search Trees, AVL Trees, Splay Trees, B-Irees, Red black tees. Graph Data Structure: Introduction to Graph data structure ~ basic terminologies-ransitive closure representation of graphs: adjacency matrix, linked lst-Graph taversals: Breadth Fist Search, Depth Fist Search)-minimal spanning res: Prim’s &Kruskal’s Algorithm ‘Teal Books :1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2010 , Second Editon, PearsonBducation. 2. Elis Horowitz Fundamentals of Data Structures in C: Second Edition, 2013 [Reference Books :1.A.V.Aho, JF, HopcroR, and JD. Ullman, "Data Stuctures And Algorihms”, Peatson Education, First Edition Reprint2003. 2. Horowitz, Sabi, Anderson Freed, “Fundamentals of daastructures in C” , Second Eaition-2007. 3. RF. Gilberg, B. A. Forouzin, “Data Structures”, ‘Second Eaition, Thomsoa India Fd ition, 2005 4, Robert Kruse, CL. Tondo, Bruce Leung, Shashi Mogalla, “Data Structures & Program Design in C" FourthEdition-2007 "Web Links :1.hupsnptel.acinourses/106102064 2. hifps/inpel.acin'courses 10610106074 3. hiips:/vww-edx omg courselalgorthms-and-lat- structures-1 4 hups:in udacity conveourselintro-e-slgorithms~cs215 5. hips:/www-courseraorg/leam data-stractures?action=enrol COURSE OUTCOMES (COs loons co aronomy co Conse Ontcome (CO) rorrso enon om GOT Und vars saring alge and nae ie iy Pie gars FOLPOT a (602 linpomentand vue Lina Dat Sactsres and Demonstrations. Po2Po3 FOI a (O3_lnpementand value Ge din Sutures nd udetnd sing tecnigues POI PO2PO3| a (oa [Undestnd pop ta siucrs and ply gaps to sae robles Poi.poz a cos sit Deepa sae commerce pais rina nT IRA oy " counse ovToME nDIcATORS COM (uicome Highs Home] Bighes co cou cors cova cous a 3 Pe ea nasi soning. eitontpivide BAA ay - lathematicl Demonstrate and land Conquer Approach, Demonstrate External cot [4 betas moet and fering a Buck ecko fleet irerion [Denna ead (ena Bake ing in ‘Sor, Shell Sort and [implement ege Sort [Sone Analy | Heap Sort. Jand Quick Sort. pfficiency. co Invedution to Dynamic ba Senor Atoeton and 8 Bas eer rnin ees List-based st asec ist bas land Implementation of coz i+ limplementations of [implementations of 7 implementation, i me |Binary Heap and sat iplemenain|Stekand Emam Que and Emerita of different Lists and its |9PP" ‘PP lapplications, sosteatons mI [bu 3 bw con |g |fntotutionto Hashing Ipochiehashing, [Tree avers and___|Demonstate Redlack a Haig ncn, DOM Dating, | le ntingand|Sech wes eansrcon face Spiny wean 8 Separate chaining and IR etashiny |and implementation tree. open addressing = " cor mit Ba 3 in Intestin Gaph [Gre aveing. —_/tinam seming se [Mtinmam senig se aboutblank 124218123, 10.16 PM ‘about blank data structure Basic [techniques — ms algorithm | Kruskal’s algorithm, terminologies. Transitive Demonstrate Breadth closure and First Search and Depth representation of graphs | First Search Bas [Evaluate and Discriminate the cosa significance of both linear and nonlinear data structures with respect to real world applications. PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (PO?SOs) Po re Program Outcome ‘por _ [Engineering Knowledge:Apply the knowledge of mathematics, science, engineering Fundamenlals and an engineering specialization tothe solution of complex engineering problems. ‘pop [Problem Analysis: Identify, formulate, review research Iterture, and analyse complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences and engineering sciences [Design/Developzent of Solutions: Desiga solutions for complex engineering problems and design system components or provesies that mest Ite specified needs with appropriate consideration fr the public heath and safer, and the cultural, societal and envionmental considerations |Conduct Investigations of Complex Problems: Use research-based knowledge and research methods including design of experiments, analysis POs and interpretation of dat, and synthesis ofthe information to provide valid conclusions for complex problems that cannot be solved by straightforward application of knowledge, theories and techniques applicable to the engineering discipline. ‘pos [Modem Tool Usoge:Create, sleet, and apply appropriate technique, resources, nd modem engineering and IT tools inluding predietion and modelling to complex engineering activites wilh an understanding of the limitation. The Engineer and Society:Apply reasoning informed by the conlexual knowledge to assess societal, health, safe land the consequent responsibilities relevant tothe professional engineering practice ‘po7 [Environment and Sustainabifty:Understand the impact ofthe profesional engineering solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable development ‘POS [Ethics Apply chica principles and commit to professional ethics and responsibilities and norms of the engineering practice 'PO9 [Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse teams, and in mullidiseiplinary settings [Communication:Communieate effectively on complex engineering activites wih the engineering community and with society at large, such ‘POLO |as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions ‘pot [Project Management and Finance: Demonstrate knowledge and understanding ofthe engineering and management prineples and apply these to one’s own work, es a member and lead in team, to manage projects and in molidsciplinary environments fe-long Leaming: Recognize the nced fo, and have the preparation and ability to engage in independent and lifelong learning inthe broadest context of technological change. ‘PSO1 [An ability to design and develop software projects as well as Analyze and West user requirements, 'PSO2 [An Ability to gain working Knowledge on emerging sofware tools and technologies. P03 Tegal and cultural issues Poi [Lecture Course DELIVERY Plan: Took [CH Nay] eching Cenraig ese |co |co1 Topi = SOICHNG| [Tai arn] quatnCompeeas attend Sones Fam one vouctote dts seus Maemateat IRet Assume ain: wee 101 SOF ttn da sacs Matera Ret Book) CH. caacperriq pms SEN EAN Sa i * a /in-Sem Exam,Skilling Ecsite Eau AtNtconinsus Pataion- [Exomons Aine a ee con erBok{t}.cH21 2 [e016 eit Anisis-Raring tin sons SEBEL C2 ya or arsine Contmous Eva atyttndSenesecFamsone . Aswesteings or Cbd 5 [c01|0fasetionsue Anayssandtngteenatin — [REBOKLU-CH72 cyan errant SEMPRA Sh es : Isom am Shling Contes Beate fe feor|corfpnensonAniyitand implemen [Repose ncn |ctaerrnie [ALMend Semen tum sone f Paco 20 Asseamen fates welt aoe arse aboutblank 2124218/23, 10:16 PM ‘about blank \Sess.No. co cor ‘Topic ‘Book No[CH No} [Page No] "Teaching- Learning| Methods EvaluationComponents Sem Exam Skilling \Continuous Evaluation cor (Quick Sort, [Ref Book (1), CH 7.7 [Page no 252- 262 (Chalk, PPT, Talk |ALM.End Semester ExamHome ‘Assignment Ratings on Giobal Platforms SEM-EXAM1 Skill T-Sem Exam Skilling \Continuous Evaluation con {Quick Sort Implementation [Ref Book [1], CH 3.1 [Page no S7- 38 \Chalk,PPT,Talk |ALM,Continuous Evaluation - Lab Exercise,End Semester Exam,Fiome Assignment,Lab In Semester Exam,Ratings on \Globat Pltforms,SEM- EXAM Skilling Continuous Evaluation cor cor IMerge Sort Analysis and Implementation [Ret Book (1), CH 7.6 [Page no 246 250 (Chalk. PPT.Talk |ALM.Ead Semester ExamJlome ‘Assignment Ratings on Giobal Platforms, SEM-EXAM 1 Sill In-Sem Exam Skilling (Continuous Evaluation icor \cor Ipucket Sort analyze the time complexity [Ref Book (1), CH 7.5 [Page no 242-245 |ALM,End Semester Exam Home Assignment Ratings on Global iatforms,SEM-EXAM] Skil Ja-Sem Exam Skilling \Continuous Evaluation icon cor lexternal sorting [RefBook {1} {1}. CH. 17.11 Page no 250-252 \Chalk,PPT.Tatk |ALM.Ead Semester ExamJome ‘Assignment Ratings on Giobal [Platforms SEM-EXAMI Skill In-Sem Exam Skil Continuous Evaluation 10 Icon \cor- \singy Linked List- Cre [Deletoa, Display [Ref Book [1], CH 3.1 [Page no 57-58 (Chalk,PPT, Talk |ALM,End Semester Exam Home ‘Assignment Ratings on Global Platforms,SEM-EXAM] Still In-Sem Exam Skilling \Continuous Evaluation n icon cor [Doubly Linked list -Creation, Insertion, [Deletion, Display [Ret Book (1), CH 3.2 Page no $9. 68 \Chalk,PPT.Tatk /ALM,End Semester Exam Home ‘Assignment,Ratings on Global Platforms, SEM-EXAM] Skill In-Sem Exam Skilling Continuous Evaluation 2 Icon cor [circular inked list operations [Ret Book (1), CH 32 [Page no 59- 68 \Chalk,PPT,Talk |ALM,Continuous Evaluation - Lab Exercise End Semester Exam,Hiome Assignment Ratings on Global Platforms SEM- EXAMI,Skill In-Sem Exam, Skill Sem-End Exam, Skilling Continuous [Evaluation Ico (cor. [stack Using Singly Linked ist [Ref Book (1), CH 33 [Page no 78- 101 (Chalk, PPT; Tale ALM nd Semester Exam, Home Assignment Ratings on Global iaformsSEM-EXAMI Skil is-Sem Exam Skiling \Continuous Evaluation 4 ‘con \cor- {queue Using Singly Linked List [Ref Rook [1),CH [3.3Page no 78-101 (Chalk,LTC,PPT.Tak| |ALM.End Semester Exam.Home ‘Assignment Ratings on Global Platforms, SEM-EXAM] Sill In-Sem Exam Skilling \Continuous Evaluation \co2, cor lint to Postfix Expression Conversion [Ref Book [1],C1 13. 3Page no 78-93 (Chalk, LTC,PPT,Talk| |ALM,End Semester Exam Home Assignment Ratings on Global Platforms SEM-EXAM 1 Skill In-Sem Exam Skilling \Continuous Evaluation aboutblank 3124218/23, 10:16 PM ‘about blank \Sess.No. co cor ‘Topic ‘Book No[CH No} [Page No] "Teaching- Learning| Methods EvaluationComponents cor lnfx to Postfix Expression Conversion |implementation [Ref Book (1), C135 [Page no 78-93 \Chalk,PPT.Talk ALMEnd Semester Exam HA Ratings on Global Platforms SEM-EXAM | Skill ‘Sem-End Exam, Skilling [Continuous Evaluation 7 Icon (cor. [Evaluation of postfix expression, Balancing Isymbols [Ref Book (1), CH 33 [Page no 88.50 |Chalk,PPT, Talk |ALM.End Semester Exam.HiA,Home ‘Assignment Ratings on Global Platforms, SEM-EXAMI Skilling \Continuous Evaluation 18 coz cor [Types of Queue ~Cireular Queue types or Queue — (Circular Queue (Chalk PPT.Talk ALM,End Semester Exam Home ‘Assignment Ratings on Giobal [Platforms SEM-EXAMI Skill In-Sem Exam Skilling Continuous Evaluation Icon (cor. [types af Queue — Dequeue [Ref Book (1), CH 34 [Page no 95-101 PPT, Tale |ALMEnd Semester Exam, Home |Assignmeat Ratings on Global iatforms,SEM-EXAM] Skil T-Sem Exam Skilling \Continuous Evaluation 0 ‘co, \cor- [Types of Queue —Dequeve [Ret Book [1], CH 3.4 [Page no 95- 101 \Chalk,PPT,Tatk /ALM.Ead Semester Exam Tome ‘Assignment Ratings on Giobal Platforms,SEM-EXAM] Skill In-Sem Exam Skilling Continuous Evaluation 2 Ico \cor- [Hashing - Hash function, Separate chaining [Ref Book (1), CH 53 [Page no 168 -172 (Chalk, PT; Tale |ALM,End Semester Exam Home Assignment Ratings on Global iatformsSEM-EXAM2,Skil In-Sem Exam Skilling \Continuous Evaluation cos, \cor- [Linear probing and Quadratic probing [Ret Book [1), CH 5.4 [Page no 173- 180) \Chalk,PPT,Tatk |ALM.End Semester Exam.Jlome ‘Assignment Ratings on Global Platforms, SEM-EXAM2, Skill In-Sem Exam, Skilling \Continuous Evaluation 2 \co3 cor [Double hashing [Ret Book (1), CH 54 [Page no 180-181, (Chalk, PPT, Talk |ALM,End Semester Exam Home ‘Assignment Ratings on Global itforms SEM-EXAM2,Skil T-Sem Exam Skilling \Continuous Evaluation \cor- IRehashing and Extendible hashing Ref Rook (1), CH 5.4 [Page no 168-180 (Chalk. PPT.Tatk |ALMEnd Semester Exam Home ‘Assignment Ratings on Global Platforms, SEM-EXAM2, Skill In-Sem Exam, Skilling [Continuous Evaluation 2s \co3 cor [Binary Tree - Tree raversals, Expression tree [construction [Ret Book [1], CH 42 [Page no 108 116 (Chalk, PPT, Talk |ALM,Home Assignment Ratings ‘on Global Platforms SEM- EXAM2,SkillIn-Sem 'ExamSlilling Continuous Evaluation 26 \cor- |Binary Search Tree [Deletion ‘onstruction, Insertion, [Ref Book (1),CH. 4. 3Page no 116-123, \Chalk,PPT,Tatke |ALM.End Semester Exam.Home ‘Assignment Ratings on Global [Platforms SEM-EXAMD, Skill In-Sem Exam Skilling | Continuous Bvaluat 27 Ico (cor. lBinary Search Tree Implementation [Ref Book (1],CH 14. 3Page no 116-123 (Chalk, PPT, Tale |ALM,Global \Certification,HA,Home /AssignmentLab In Semester Exam Ratings on Giobal Platforms SEM-EXAM2 Skilling| [Continuous Evaluation aboutblank 4124218/23, 101 PM ‘about blank \Sess.No. co cor ‘Topic ‘Book No[CH No} [Page No] "Teaching- Learning| Methods EvaluationComponents 28 cor |AVL. Tree ~ Rotations and Operations [Ref Book (1), CH 44 [Page no 127-138 \Chalk,PPT.Talk |ALM,End Semester Exam.Jlome ‘Assignment Ratings on Global Plaforms,SEM-EXAM2, Skill In-Sem Exam Skilling [Continuous Evaluation 2» cos, cor [AVL Tree Implementation cua 138 (Chalk. PPT.Talk |ALM,Continuous Evaluation - Lab Exercise,End Semester Exam,Fiome Assignment Ratings loa Global Platforms SEM- EXAM2,SkillIn-Sem Exam, Skilling Continuous Evaluation 30 cos cor Ieap Soxt Analysis and Implementation [Ret Book (1), CH 7.5 [Page no 242-245 (Chalk. PPT.Talk |ALM.End Semester ExamJlome ‘Assignment Ratings on Giobal Platforms SEM-EXAND, Skill In-Sem Exam Skilling Continuous Evaluation 31 Ico \cor- ls 1B Tree Construction 17 Book [1], CH4.7 [Page no 134-138, |ALM,End Semester Exam Home ‘Assignment Ratings on Global itformsSEM-EXAM2,Skil In-Sem Exam Skilling \Continuous Evaluation 32 cos, (cor. [splay tee operations [Ref Book [1], CH |4.5.Page no 138-141 \Chalk,PPT.Talk |ALM,End Semester Exam,tlome ‘Assignment Ratings on Giobal Platforms, SEM-EXAM2, Skill In-Sem Exam Skilling Continuous Evaluation 33 \co3 cor ls \Construction of Red-Black trees [Ref Book (1, CH 14.6, Page no 134- 140] (Chalk, PPT, Talk |ALM,End Semester Exam Home | Assignment Ratings on Global itforms SEM-EXAM2 Skil In-Sem Exam Skilling \Continuous Evaluation M cow (cor. (Graphs Representation -Adjaceney Matrix [Ret Book (1), CH 9.1 Page no 300-302 \Chalk,PPT,Tatk |ALM,End Semester Exam.}lome ‘Assignment Ratings on Global Platforms, SEM-EXAM2,Skll In-Sem Exam, Stalling \Continuous Evaluation 35 cow cor (Graphs Representation Linked List [Ref Book [1], CH 9.1 [Page no 300- 302 (Chalk, PPT, Talk |ALM,End Semester Exam Home | Assignment Ratings on Global Platforms SEM-EXAM2,Siall T-Sem Exam Skilling \Continuous Evaluation Icoa \cor- [Transitive Closure [Ref Rook [1], CH 9.1 [Page no 299. 300 \ChalkPPT Talk |ALM,Coatinuous Evaluation - Lab ExerciseEnd Semester Exam,FTome Assignment Rati [on Global Platforms SEM EXAM2,SKill In-Sem Exam, Skill Sem-End Exam, Skilling Continuous Evaluation 38 cow \cor- Is [Minimum Spanning Tree — Prim’s Algorithm [Ret Book [1), CH 9.5 [Page no 330-332 \Chatk,PPT.Talk |ALM.End Semester Exam.JIome ‘Assignment Ratings on Global Patforms,SEM-EXAM2 Skill In-Sem Exam, Skilling [Continuous Bvaluat 39 lcoa cor ls [Minimum Spanning Tree - Kruskal’s Algorithm [Ret Book [1], CH 9.5 Page no 332335, (Chalk, PPT, Talk /ALM,End Semester Exam Home Assigment.Ratings on Global Platforms SEM-EXAM2,Skill T-Sem Fxam Skilling \Continuous Evaluation Lecture Session wise Teaching — Learning Plan aboutblank si24218/23, 10:16 PM ‘about blank ‘SESSION NUMBER : | Session Outcome: I Students come to know the types of data structures, Session Out (come: 2 Students come to know asymptotic notations and complexity analysis /Time(anin ‘Topic BIL [Teaching- Learning] ‘Active Learning std eho =xor 5 |atentmes 1 fat ee pos ro [nding Dia Sarre ad Slabs and EPPS StosLasun TB), ag = NOT |the classification of Data Structures - Linear & Non-Linear. al APPLICABLE — 10 [teste Explain casifnton fat Stectues-Linar& Nowtine [2 fink Fe enous Tein Naina Boskrond,Dfatons oF Asya noitns a, AG). Nor 20 fantom Best Average nd ot Cae Hef chor of Das suctaes ond 2 rae eo sate Stgrtin ani ty Nalin Weis > [eonisin an Summary 1 fa eee SBSSION NUMBER: 2 Session Ontome: I Sens a come o now sot runing tne selon Senn Outcome 2. Suen can deny he increment oder oie comple Weching- earaag] naive Laraing /Time(main)| ‘Topic BTL ‘Methods ‘Methods =xor 5 |reap/tnraucion 1 fw Fx aoe Taine: Runnin lens Asingle ample Gera bs Ak Nor 20 fsasons tone uming ine of lowing problems: Deblem orn; fern ee Fey mnt 07) Probl foto) For 0 ~ [Tsiare2: Delve smotenetel elon oruming ine o spigot naib suo to alee Algor: Tine ke 1) Stat 02) pu jo [Raden 1) nla cnet 2) fovas sumone) | gy Nor PT yoECSen) goo siop 4a pin um 18) Sop aemtteasue oro snein conto) Sn 4K cape? of Daa sce analgrin ys Cy Mare Alen Wes ; nor 5 [contusion Recap 1 fa Rernicaste— SESSION NUMBER: 5 Session Outcome: 1 Suen le understand insertion sor Session Outcome: 2 Sens an inpemeninsetn srt , ching earng]| Ace Lara [Time(min)| Topic BTL ‘Methods Methods: Nor [atone 1 fra ee Sip 1 (ax) Bln How ronson wa nd anal Ts 5 Nor 0 |complexity with an example 2 [talk | APPLICABLE ~~ actos session: Consider ae ae 0 goa manor Sa Tal ov ang to [tckes tem cuner ange the pep ofmenbewin eine secon tote et |p (ry vor ota pcm Th igh of pom pve income a flows T6573 15, opuicasue— Tats 813, 1,10, 151 Afer ah aon, rw th omens in aa. [racice session 2: Deh Gy, whee pace pevalb mos of ene, Na everyone Soh an ee though Carly na Raj, ose ei et Kon [but fe Raj hs oncom managed o Be somo Banglore ry to [eteckanddoinoy ciy hecowaznie,bematis hem instvar |) |r Nor Powe: Afr energie enc ito poe eee he eco opuicasue— anges dr Al icons arnged necting sed anno he power ic powes ae gens 12 $810,735 2221 6518 5 mpl’ eto sr rg osnge powers in undng oe Nor > [eontsion an Summary > tam Fee SESSION NUMBER: 4 Session Outame: 1 Suen ial know sou sel sot Session Outcome: 2 Suen an implemen sel sat218/23, 10:16 PM ‘about blank [Teaching- Learning] “Active Learaing |Time(ain Topic BEL | Methods Methods . —-NoT s |Atendance v frow enue io [Ssblopie + (Lecture) Explain how sll son works sing selfs ogial sequences [y [ray Nor IN/2, Ni. I epetely divide by 2), Explsin Hibbard, Sedgwick inerements APPLICABLE — Practge session 1: Ask the students to implemeat shell sot by using insertion sor ay [independently for cach pas. Algrim: I) Read elements asimputinaras.2) |p fray Process /* Identity and prin the each passes elements */ 3) Display the sorted 3s elements ouput [Subtopie 2 (Leer): Analyze the Hine complexity of sell sor. Dives what Nor 10 | sadvantages of insertion sort docs the shell sor overcome. [Classic Data Stuctares [2 [Talk le Nd Ea. By Samant, SamantaDebasis] [APPLICABLE ~~ Soman and Summary > fram SNOT SESSION NUMBER :5 Session Outcome: 1 Students able ro understand the quick sort Session Outcome: 2 Students able to analyz the ime complexity of quick sort oo Tope on [gs as] ate ° Nor s |Atendance 1 fra Teepe 20 [sus Not ub-opic Lecture): Explain Quick sr algorithm with best case derivation. 2 fra ee apne — 10 __[Pracdee session 1: Ask the students to sorte following data using quick sor |p fry Nor, 5511.2,9955,3, 788,33 and then analyze the Best ease for Quick sot APPLICABLE — 10 | Subpic2 (Lecture: Expin Quik sor lpr with worst eas ei > [raw TN ate [Nor s \Concusion and Summary 2 fra speeeApLE SESSION NUMBER : 6 Session Outcome: 1 Students able to implement quick sort algorithn ‘ Teaching: Learning] Active Learning [Fime(min)| Topic BIL Methods: Methods 5 [Recap / Introduction 1 fra fee ape 20 fimpienetaon of Quick ort 5 raw SNOT ate a 5 _lere Leading question s \Concusion & Recap 1 fra Lee aE — SESSION NUMBER :7 Session Outcome: 1 Students come to understand the concep and implementation of merge sor Session Outcome: 2 Students aber analyze the time complexity of merge srt, Fieaching- Learning] Active Learnin Timecnin) Topic na, [Testing Learning] Active Learning 5 [Recap / Introduction 2 [ema SN ACABLE — [Nor 10 |ubiopie-1ectre): Explain Merge sort an its bases with an example 2 frat seeeAnte Prato session ~ 1 Hee is a avay of wn tegen’ 53 89 170264 Draw tis Nor 20 —__Janayaferthe TWO recursive cll of merge sort ar complctcd, nd before the final |2 [Talk rere merge step has occured APPLICABLE ~ Subtopie-2fetre: Analyze te complenty of merge so algo [MergeSortart} 1.1) Itr> 1{1- Find the male pot middle m= (122. Call Nor 10 mexgeSont for fst haf Call mergeSor(n I,m} 3 Call mergeSot for second halt |3.—_ [Tak Lat ape [Call mergeSor(ar, +1, 1) 4 Merge the two halves sored instep 285: Call ~ mergetars, Im.) NOT 5 [Conciusion 2 fra ee eapLE — SESSION NUMBER : 8 Session Outcome: 1 Students able to understand the basic concept of bucket Sort, aboutblank ie218/23, 10:16 PM ‘about blank Session Outcome: 2 Suen le aay tein omplexiy imei Tepe wr |Pesling Carag] Acie Learning nor iS recap 2 [eee APPLICABLE — 10 |Sub topic. © NOT ib pi —1 Let: apn Bucket Sot and its Basi concept > fia Fie sore Go eal ian Aa des wor te lowing dat bake? | Ip Nor [Sinazonss, 78K APPLICABLE — 10 [subtopic Leta: Ay the compe of bucket sr agin fer Fae ore : Nor 5 [eonsion b fram Sar ame SESSION NUMBER: 9 Session Outcome: 1 Suen le understnd the extemal sori Session Outame: 2 Students abe asi te tne amply ral sarting x eching.Laarang] Ave Lanning [Time(min) Br ‘Methods ‘Methods No Seep tarot 1 fra Fe sore so Soir Kalan Earl warng and we pass feel one [pag = NOt Sop Mage paw cape. APPLICA — To Tits ssion=1-Asktie tds wtsanagoin ooo cones ne |) ag NOT Exel soning tnique an slo anes tin comply. epuicasue — [ractceSesin.TC Aa ie stuns wre and exectea Cogan oso folowing exnple N= 14 MS (acolo on pe To, memory apes 3 wor 20 fends ie 8:2, 0,24 18 59 lore Heh amok eat |S fa ae {romps Pstomng, lune Song ad Sesching, Sond Eon haaton West Jenson ae aT Quo SESSION NUMBER: 10 Session Outeme: 1 Suen ome tok about sn inked is operations Session Outcome: 2 Sen le implement sing inked ist mca Tone wn [Fos teresa Lwin Kor ne beam eae so [ess Ex sig Td stops wih gan’S RT agro ag = NOT 20 [ftctres and lari anim by Mask len ets [onutcapu— acice Session [Supos the Pesone lea sal enpany conte owing dnt fora fe splayess $3 Gosden mer Name an slay. A ao fined uedtosoretedan Ask estdanstowntea incon esate | ayy —nor eco used on SSN pode {noch an ame sue, APPLICABLE — [cstnanat dou ACT Tres ACD fre ACS fn, Sr, Ge fae: HO et "Dats Stu by Fran 5 |eoniusin 1 fra eee SESSION NUMBER: 1 Session Outcome: 1 Students amet kn about duly ke is peratons Session Outcome: 2 Suen et nplamen doubly inked ist rien Tope wi [ting Lenaing] Active Learning =xor 5 [accap imei: > [ene Be sate sp [tes Ben dot Tnke Tit options wih dam's Rot SaioFoFBa yay = NOT |structures and algorithm analysis in C by wt | APPLICABLE — cice Session: Ina browsing et, te avvoma Khas siting a Compe {nlowscs ics bok Ons heap nce ask he wns ome ape oF ay _|btond as snd gavea ttend med andconebocetshshomeyageandopes | fouy nor [his other friend Lalitha’s page and read all her status and going on doing like ths. al APPLICABLE — plement this as an operation of ereation, insertion, deletion and Searching of trends lusing Double Linked List. aboutblank iz218/23, 10:16 PM ‘about blank s [Conclusion [rate [Nor APPLICABLE — SESSION NUMBER : 12 Session Outcome: I Students come to know about eccular linked list aperatons Session Outcome: 2 Students able to implement circular linked list, ‘Time(min) ‘Topic BTL "Teaching- Learning] ‘Active Learning that will appear on the stack atone time during the conversion ofthis expression? [Reference : hiip:/es.nywedu/courssiFalll2/CSCI-GA.1133-002, Meied netioas 5 |asaprtacoauion 1 fra Feo Tens Een ston of ara agi ti gre poten md oad Nor 20 [gpmstow cf SL, Cher Sivan DLL Aue ssakaw wexcowe dent |S [Tk Nee gn nd cd option n SLL Ca SLs and DLL 2 AL fae eae Sly SNOT 5 [eoncusin & Resp 1 fram ae ase SESSION NUMBER: 13 Session Outcome: 1 Sens an dest ck operons Session Ontome: 2 Svs abe mplament sk xing Inks it echiog- earaing] Aa Laraing Time] pie wr, |Peehing en ie Lara ; =Nor 5 |aeptaseanon 1 eta Feo 20 [Linked ist memento af chs p fra Feast. bo ASK ede ows and cone open Taponent Neck wsg URET YF = NOT pois opuicapue— ; Not 5S [eonsion 1 fine Fee ae SESSION NUMBER: 14 Session Outcome: 1 Suen ome to kno about eu opertns Session Ontome: 2 Sens able meme ques sin inks st — < Pacing Lag] halve Laralag [Time(min) Tori etl Methods Methods 5 eaptareoin 1 feta a aun 20 [restr Lined inpemenaton of aru > ieee aa soe asic Sesion a lay sation an engin meso ih he Nun oF [Bogswhic se comes none dens fom engine teat bop ; Nor 0 | mplementthis as an operation of creation, insertion, deletion and searching of e JChall APPLICABLE —~ opiingSingeinca ; =NOF 5 [eonsin 1 fin ara SESSION NUMBER: 15 Session Outcome: 1 Sues ome to know abut pets of sack Sesion Outcome 2 Suns alo son init postion Reaching Learn] Atv Carag ‘imeni] Topi wr, |Peshing ea ie Lara bs ' Nor cu: Epa hw sont ai xpos pic eing eke 1 fe Gx amie aces Sis & Conse he ven ic xpeon (BY Ca AT [Sesion Sopos ate nga Suk coer cove he wor as [eras fount opetis actin Whsisthe sam nner ofsménl 2 [err GN aie SESSION NUMBER : 16 Session Outcome: 1 Students able to implement infix to postfix expression conversion aboutblank siz218/23, 10:16 PM ‘about blank Session Outcome: 2 Students abe to analyze the time complexity of infix to postfix expression conversion aboutblank Teaching: earning] Astve Larang imei Tole wr [Peeing aa fe Lara 5 [recaparodon 1 feta 20 [Last Expin tow to cone an infix xpress to postin wing sacs pram Raize Sesion Tefiniapvie singe dewing ie nab fests to uke. Atti te wll cul Mins ath in ain sting ie rng vdpostn oxpresin coming ges, bay ope 0 |-, *, / and $) andparenthesis, Every integer, operator and parenthesis will be 2 Per orplorysepaniedyaSPACE They dentsbeeno! expen urns hy cya educouneuPal SCOR 138002 5 [eonssin an Summary 1 fax SESSION NUMBER: 17 Session Outame: 1 Suen ale tevin poste eresons using stack Session Outcome: 2 Suen le ete resus ant now pes of weusins Teaching: earaing]—AsiveLarning eat Tone wr tng fe Lar 5 =Nor 5 [aecaptorodcton 1 feta eae 10 fespointeevahaton of pot xpresion wing sack > fram se sone To Paes Seta Take owe program fr okays Towne |; [ppp = NOT Post expsn wing sek 123" 4 Rete pepasun om Arruteawte 10 [Explain aburaancing symbols 1a ee oe aces Sesion 2 Geno open ans wane = NOT to | whether the pairs and the orders of "{*,")”, ‘are correct in exp 1 [rate APPLICABLE ~~ “NOT 5 |eonsasion an snmary 1 ak Te aoe SESSION NUMBER: 18 Session Outeme: 1 Suen ale to understand the pes of queues Crear Queue Session Outcome: 2 Suen le sole else problems sing ques Teaching] tive Lerang [Time(nuin)| ‘Topic BTL | Learning Methods ‘Methods | > [recap /tmroacion 1 lena Tie use cones plane owing wp eT son wee teu ues ra tewoked comps ye yo pohly sae pir ay [aihotarisot Wien yourcqusttopintatiegyoureqestcadeedwthepat |) |r fous When yourequst reaches he onto tpt quae your ie ie. senses ton ne pono at tes ace wth tr and has, ces shows te sre saves he ues in Chula ues iplomttin, Use Cure dts stutro pint Binary umber om Ton) Catan pty eva ong 2) ogc eit ay mer" ue 3) Now ran sop 20 | Brgusratand rings Binry Nunes) Duet Pant tena? |2— Tk ts) Appenathcndofionticmandengeaces) append a he dof onion and nguaeic 2 nuw-3 Oupa 1011100401 5 [eonsin an Summary + fra SESSION NUMBER: 19 Sesion Outcome: 1 Suen be understand the apizaton of ues Double nde gues Session Outame: 2 Students alt npemen elie problems sing queues | Basle] Ase Larag Fw Tope Leaning Methods |" Methods Not 5 [asap /tacoausion 1 [cian FRE cue 0 ven an gern i af blended ass ands ops, iloms he FETE (uit Goss aout ened gun. Ques a defined ss low’* > nsotan cent othe 012421823, 10:16 PM ‘about blank front end » 2 x > inser an element x to the rear end 3 > delete an element from frontend +4 -> delete an element from rear end Use Quove data stricture to print binary numbers from 1 ton. 1) Create an empty [queue of strings 2) Enqueue the ist binary number “I” to queve. 3) Now run a loop 10 Hor generating and printing n Binary Numbers.) Dequeue and Print the front of [2 | Talk |queue. 6) Append0"attheendoffronttemandenqueueit.c) Append “I” atthe end of front item and enqueue it 2 Inputs n-5 Output: 1,10,11,100,101 10 [Ask the students to execute practice session-2 3 |Talk 5 \Conclusion and Summary 1 |tatk [APPLICABLE SESSION NUMBER : 20 Session Outcome: 1 Students come to know about priority queues ‘Session Outcome: 2 Students able to implement binary heap ‘Time(min) ‘Topic BIL, [Teaching- Learning| “Active Learaing Methods Methods 5 [Explain te concept of Ps and their applicet 1 {cat ave xplainthe concept of Priority queves and tei apliestions a eee aaLE [Practice Session I: Consider a bank with one service counter. The persons will stand {in queue. For example iteustomer I needs 30 mins to finish and custome 2,3 needs 2g [only 2 mins each, servicing the customer | and then 2,3 leads fo unnecessary delay rae —-NoT land thereby the decreases he eficieney. Fg: ithe queue along with service time APPLICABLE — leach customer. Now remove the one with ow service time. Do this at all the customers are serviced and show the queue configuration at each instant ‘Subtopic-: Types of privity queues I. Ascending PQ-Flement with least pony 9 |femoved irst2 Descending PO. Element wi highest priority removed first 5 leer Nor [Subtopic 2- Operations on Priovty Queue I. Creation 2. Insertion 3 Deletion 4. APPLICABLE — Display 5 (Conclusion frat APPLICABLE — SESSION NUMBER : 21 ‘Session Outcome: 1 Students come to know about the concept af separate chaining Session Outcome: 2 Students able to resolve collisions using separate chaining ‘Time(muin| ‘Topic BTL. [Teaching Learning] ‘Active Learning Methods Methods —NoT. 5 [Recap / Introduction: 1 lca APPICABLE eI (Lecture): Explanation of separate chaining using hashing technique Nor 10 Initilization routine for separate chaining hash table, Reference: Data structures by || Talk > Mark Allen Weiss APPLICABLE ~~ ic-2 (Lecture): Explanation of separate chaining sing hashing tecbnique Nor 10 mn routine for separate chaining hashtable, Reference: Data siuctures by |1 | Tale > [Mark Allen Weiss. 1 APPLICABLE ~~ TO Practic session: Ask the stadens To construct hash table using separa chaining Nor 10 for the following elements of table size 15, design your own hash function. 2 |per Se [23,27,986,17,51,77,72,36.53. Ask the students to implement initialization function 2 ‘APPLICABLE TO Practice session: Ask te students to implement te fllowing operations on hash Nor 10 table using separate chaining insert () 2. search () Reference: Data structures by [4 | PPT. ee, Mark Allen Weiss. 4 APPLICABLE ~~ NOT 5 '5 Conclusion > {atk Seon ABLE SESSION NUMBER : 22 Session Outcome: I Studens she to resolve collisions using different collision resolution techniques, Session Outcome: 2 Students able to implement linear probing, quadratic probing [Teaching- Learning] ‘Active Learning, [Fime(ain) Topic Br. [ON Methods Methods 5 |aowap/tnroson 1 cia Fea 5 pie-1 (Lac Eclat of Open AGoSing and al peso Seacrest Colson, Expo of Lina ping nd emenaton nor 20 _|aetoance Daastutes y Mat lly Wes Sublet Lect) tapinaton | Hak ee gue probing ens iplomentton Reece: Das acres by Mare ~ hn Wes aboutblank 128218/23, 10:16 PM ‘about blank [Practice session 1: ®ASK the students to inser keys (43, 35,27, 73, 67) ino hash [Nor eo lable of size 11 > [chalk APPLICABLE — , ~- NOT, 5 ‘Summary &conelusion 1 fran SPO ABLE SESSION NUMBER : 23, Session Outcome: 1 Students able to resolve collisions using diferent collision resolution techniques Session Outcome: 2 Students able to implement double hashing TTeaching- | Active Learning [Pime(mln) Pele BTL | Learning Methods | Methods 5 [Recap / Ineoduction 1 Jenatk [Sub topie-1 (Lecture): Explanation of Open Addressing and different types of 20 strategis to resolve Collision. Explanation of double hashing and its implementation. [3 {Talk Reference: Data structures by Mark Allen Weiss [APPLICABLE — [Practice session I *Ask te stdents to insert keys (18,41, 22,44, 59, 32, 31, 73) ino Nor 20 hash able of size 13 Reference-hip:/www.eccs yorkuca/course_archivel3004- [3 {Talk nee ABLE — |Os/W/2011N/Notes/nash_tables_2 pd *Implement double hashing to inser keys. ‘ Nor 5 ‘Summary &conelusion 1 frank Laon ABLE Session Outcome: I. Students able to resolve collisions SESSION NUMBER : 24 ing diferent collision resolution techniques Session Outcome: 2 Students able to implement linear probing, quadrate probing, double hashing [Teaching- Learning] Active Learning (Time(anin)| Topic BIL Methods Methods Not 5 Recap Introduction: 1 {cate APPLICABLE — [Sub topie-1 (Lecture): Explanation of rehashing concept and ts importance Ask the NOT 0 ‘students to construct hash lable with the keys 19, 28, 98, 72, 10, 31, 63, $4 1 [per SPDCABLE — [Reference: Data structures by Mark Allen Weiss “ ‘Sub topie-1 (Lecture): Explanation of extendible hashing consept and is importance — w 'Ask the students to construct hashtable with the keys 94, 82,39, 29, 61,13, 36,45. [3 [Talk APD ICABLE Reference: Data structures by Mark Allen Weiss = Nor 5 ‘Summary &conelusion 2 [came APPLICABLE — SESSION NUMBER : 25, Session Outcome: 1 Studens come to know about ee taversals Sesion Outcome: 2 Student abet solve real word prota problems on expression see Teaching: Learning] Acive Learning Timea) ‘Topic pr [Te#ehing: Tem ive Learn 5 Nor 5 Recapitmoduction 1 [chase Sieenapee b [Subipie— 1 (Lecture) Explain expression te constuction, and wee waverals— Tne NOT 20 [order re-rde and Posteri. po per [APPLICABLE — a [Prete session I: Ask the students wo constueta binary wee forte given elements | [ray -—Nor 17.4458,19,20.25,31,12. And print inorder preorde, and poston. APPLICABLE ~ spain Fapresson Tice constuction, rates session 2: Ask the stadia tq feonsiruct an expression tee forthe following expressionAVB)*(C-DYIE'F) could | [yy Nor be represented ths (ENF means Erased tothe F power (Data Stuctres and APPLICABLE — /Agoritm Analysis in C, Mark Allen Weiss, Alichaper question] NOT 5 [Conciusion 4 [eax een aate ‘SESSION NUMBER : 26 Session Outcome: I Students come to know about constuction of binary search tee Session Outcome: 2 Students able to perform binary search tree operations vert, | Tetching- Learning] “Active Learaing /Time(min)| ‘Topic ‘Methods: Methods s Recap codution 1 {erat APPLICABLE — aboutblank 2124218123, 10:16 PM ‘about blank 20 [Explain Tree terminology, Binary Tree - Construction and displ. 1 {rae [Nor APPLICABLE — Session Outcome: I Students abe to implement binary sear ‘SESSION NUMBER : 27 twee operations ‘Active Learning that has two child nodes [Teaching- Learning] ‘Time(min) Topic wrx, | Teaching: Les we Lara Nor 5 [RecapiIntroduction 1 |ehatk SPPLICABLE —- [Explanation of BST Tee Construction and Display Write function to perform the Lo following operations on a BST: Tree Traversal (Inordr, Prcorder and Postordcr) lk |—Nor [2.Inser a node in BST. Finding the minimum and maximum in BST using recursive ft APPLICABLE —- land iterative approaches [Ask the studens to write function in BST to perform the following: 4Deleting a child Nor 20 \deave) node. 5.Deltinga subtree node that has one child. Deleting a sub tee node |1 [PPT Tec apte SESSION NUMBER : 28, Session Outcome: I, Students come to know about AVL tree rotations ‘Active Learning aboutblank iments Tt wr | eeing Caring) Acne Lar Nor s Recapatodvetion 1 cau faa ABLE to Sebsopie- Cesta) Explain AVE Tree end advanioges of AVL Tree wie taf [gy [Nor lonarizaton, Reference: Data Structures by Mark Allen Weiss a [APPLICABLE — Practice session -I a. Construct an AVL oe withthe following date 25, 9,101, 13, Not 20 _|7, 32,106. Find balancing fetor of node 7c, Find resultant AVL tee afer deleing 2 |p Oey ot. Reference;wuvesanfoundarycom = 'Sub-opie-3 (Lecture): Neod for rbalancing the AVI Tee sing Single rotation 1 [Discusion of single let otaon and single ight rotation. Conseuctan AVL wee with |y | ny |—Nor ine following node values: 13, 1,7, 30, 35,5, 3 ad identify the single left rtations a [APPLICABLE — and single ight oltions. Reference wwwepropams co [Nor 5 [Concision 1 tak Ree vane SESSION NUMBER :29 Session Outcome: 1 Studets abet implement operations on AVL tee Teaching Learning| Active Learning ‘Timein) Topic veri [Tone Len we tearm 5 [Recap / Introduction 1 [Talk APPLICABLE — Sp [Sabpie= 1 (Lecar) AVE wes ADT eeaion along wih required fncion Ink Nor prototypes. Reference: Dat Srutures by Mark Allen Weiss [APPLICABLE — 20 aLM [ere (One minste paper Nor 5 [Conclusion & Recap 1 fran Serpe — SESSION NUMBER :30 Session Outcome: 1 Students ele to implement heap sort Session Outcome: 2 Students able analyz ime completes of heap sort Teaching: Learning] Active Learning me(rtn Tonle pr. | N Methods Methods : Nor 5 Recap /Inoduetion: 2 [ehatk APPLICABLE — Subiopie=I(ooune): Explain Heap onder propor and two phases of heap son [Heap Creation 2. Sorting via deletion) with an example Explain Max and Mis Heap 1g _|Heap Property: AIl nodes are either greater than or equal to oressthan or equal 0. | fray Nor each ofits children. Ite parent nodes are reas han thee cild node, heap is nl APPLICABLE — called a Max-Heap, and ifthe parent nodes are smaller han thei hid nodes, heap is called Min-Hcup. [Practice session - I Ask the students to write an algorithm to sort he elements using Nor 20 heap sor technique and aso analyse ste complexity. Aralysistime Complexity of fpr sPeeeanee Heap Sor = 10 ]Pracce session 2 Suppose we are sorting an aay of eight integer wing heapsor, [4 Tak Nor and we have just finshed some heapty (either maxhespty or minheapty) operations APPLICABLE — 312421823, 10:16 PM ‘about blank [The array now looks like tht: 16 14 15 10 12.27 28 How many heapty operations Ihave been performed on root of heap? Conclusion [Talk Nor APPLICABLE — SESSION NUMBER : 31 Session Outcome: 1 Students come to know about B ree construction Session Outcome: 2 Students abe to perform insert and delete operation on B tee FTeaching- Learning] Active Learning [Fmt ‘Tople Br | iN Methods. Methods Sree Imraan [eva SNOT oe Le ‘Subiopie~ I (Lecture: Explain consruction of B Wee (BST) withan ample. Give [> faye =-NOT the importance of Mew search ee a [APPLICABLE — [Practice session I Ask the studens to construe Bee with te Keys 25,8534, 5. =-NOT pe 45,10, 28, 41, 67,19, 7, 30 and order 4 2 er APPLICABLE — = NOT s [conclasion 1 frat Soo aptE SESSION NUMBER 32 Session Outcome: 1 Students comes to know sbout splay tree constriction Session Outcome: 2 Students are able to perform spay tre operations Teaching: Fimeteny Terie BTL | Learning Methods 5 Recap! Introduction 1 ra [Sub-topie-1 (Lecture) Explain selective splaying.vig-vig and rg-7ag rotations and Pe Ihow it overcomes normal splaying. Reference: Data Stucturs by Mark Allen Weiss [crate [Practice session -I: Create splay Tee with following Keys with root 38 25 132,3,4,8,65,42,34,819,32,56,54,38,66,77.44 apply splaying at node 54, Reference: [3 [PPT [Data Structures by Mark Allen Weis 5 [Conclusion 1 rae SESSION NUMBER: 33 Session Outcome: 1 Students comes to know about red black tee constuction Session Outcome: 2 Students ae able o perform re blak tree operations ‘ ‘ FTeaching- Learning] Active Learning ‘Time(in| ‘Topic wr, [Teaching Lea ive Learn =O 5 [recep /tnvoaion 1 fram No ae 10 |Sub topic — 1 (Lecture): Explain Red Black tree and its properties 2 calle SPLICABLE — 10 [Subropie—2 Leta: apn ner operion of Red Bick eeRColring) [2 (atk FO ote 20 [Sub topic =2 (Lecture): Explain Insert operation of Red Black wee(Rotation) 2__|ere Quizr Test Questions NOT 5 (Conclusion 2 |e Ten apte SESSION NUMBER : 34 Session Outcome: 1 Students come to understand the representing of graphs Teaching: Learning] ‘Time(min) ‘Topic ser, [Teaching Les 5 [Recap / Introduction 1 fra se naBLE 20 [Explanation of Graph representation ~ adjaceney matrix 2 per lar McICABLE — 20 [race sesion epee he given gph in aeeney maa > cua NT ate Nor s [conclusion 1 frat Lee BLE — SESSION NUMBER : 35, aboutblank wiz218/23, 10:16 PM ‘about blank Session Outcome: I Students come to understand the representing of graphs [Teaching- Learning] Active Learning ‘Timea Topic ‘Methods Methods 5 |pecp /tncoduction [ae icasue — 20 [Explanation of Graph representation adjacency list representation per APPLICABLE — 20 [practice session: represent the given graph in list representation [crate PRIGABLE— 5 |eonnsin fra [APPLICABLE — SESSION NUMBER : 36 Session Outcome: I Students come to understand th transitive closure "Teaching- Learning] Active Learning ‘Time(anin Tepke Methods Methods NOT. 5 [Recap / Introduction ‘Talk SPN CABLE —- [Explain Definitions of DAG, Transitive closure, Lecture: Example applications of _ Nor 20 graphs such asthe airport system, Trai flow modeling ce, Practice Session: Ask alk SPCICABLE —- ‘students to find transitive closure forthe given graph 20 [ALM Ere [Think / Pair? Shar == NOT 5 (Conclusion & Recap ‘talk Seno apie SESSION NUMBER : 38 Session Outcome: I Students able 10 derive minimum spanning te from 2 given erap. Session Out: 2 Students le epi’ gor. . Teaching. Learaeg] Acne Lanning Fini Toe ‘isi Methods =Ke 5 [reap tna [cae Neue So [aah Minima sng ae Expl Pn loin wi lp oP hax = NOT eed ph APPLICABLE — SNe 20 [aby rimsalgrihn ona weghd graph get minima sain tse br ie pote = NOT 5S [eonsin ha ee SESSION NUMBER : 39 ‘Session Outcome: I Students able to understand the use and applications of minimum speaning tee, Session Outcome: 2 Students able to understand Kruskal’s minimum spanning tree algorithm a [Teaching- Learning] Active Learning ‘Time(mnin ‘Topic ‘Methods Methods ; NOT. 5 [Recap / Introduction: [ratk rN ABLE — 0 [Explain what s spanning ee and minimum spanning te. Explain applications of bra minimum spanning tee Explain about Krashkal’s minimum spanning tree algorithm and bow i used wo find uizrTest Questions Po minimum spacing tree using diagrams. lure QuiarTest Quest 10 " = NOT |Ask the students to analyze the time complexity of Krushikal's algorithm. (chalk SPO CABLE — Nor [Conclusion fra SP ICABLE —- ‘Tutorial Course DELIVERY Plan: NO Delivery Plan Exists ‘Tutorial Session wise Teaching — Learning Plan [No Session Plans Exists Practical Course DELIVERY Plan: aboutblank 19124218/23, 10:16 PM ‘about blank aboutblank Tutorial] Session ‘Topics (CO-Mapping 1) ImplementinsertionSort GivenalistotNarrayelements appyinsertionsortoarray.InputFormat 1 | ThefirstlinecontanstheintegerN thesizeofthearray-ThenexllineconlainsN space-separatedintegers. Constains* | gs 1<=Ne=1000 + -1000¢=afi}<=1000 Output Format Print the aay asa row of space-separated inters each iteration 11 |T- mplement Quick sort: GivenalstofNerrayelements spplyshellsortonarray. There will be two lines of input: =o the size ofthe array + then numbers ofthe array Print every partitioned sub-array ona new line Given alist of N any element apply Merge sot. Merge Sorts a Divide and Conquer algorithm. I divides 45 |inputarayintwohalvescallsitselffortetwobalvesandthenmergesthetwosortedhalves.Thefirstlinecontinsan agg integer, N, the numberof elements in Array. The second line contains N space-separated intgers. Print the arrayasarowolspace-separatedintegersineachiteration, 1. InsortingaNodetntoaSortedDoublylinkedL ist Given a reference tothe head of e doubly-linke list and an 4 [integer data, erate anewDoublyLinkedListNodeobjecthaving datavaluedateandinserttatheproperiecatonto [COS Imaintainthesor S__[Reversea List cos 6 | Maximum Element 7 __[1. Max in Queue cos 8 | Bvaluate Postfix Expression lcos 9 | Hashing~a, Separate chaining b. Open Addtessing Icos 10 | Binary search Troe a Creation of BST b, Traversal-In-order Pre-order Post-order cos 11__ AVL Tree Self Balancing Tree cos 12 | Graphs. BFS b. DES Icos sion wise Teaching — Learning Plan SESSION NUMBER : | Session Outcome: 1 Student will able to apply sor ‘Teaching | Active Learning [Fime(anin) Terie BIE | earning Methods} Methods |GivenalistoiNanrayeTements applyinsertionsortonarray. InputFormat Not so | ThefirslinecontanstheintegerNthesizcofthearray-ThenexllinecontainsN space 5 |chatk SP OCARLE separatedinegers [APPLICABLE Inps:/ww hackerrank com/contess Tes 11 02/challengesi3-e-imploment-inserion =NOT so sort B {cratk APPLICABLE — SESSION NUMBER : 2 Session Outcome: I Student will able to Quick sort "Teaching [Timetenin) ‘Tople BTY | Learning Methods (GivenalisiofNarvayelements applyshelisoronariay. There willbe two Tnes of input += Nor so the size ofthe array + then numbers ofthe array Print every partitioned sub-array on |3 [Challe Keon vate— a now line so ny s Nor ipstwwwhackerrank.com/challenges/guicksort2iproblem Is |cuamk NOT ABLE SESSION NUMBER : 3 Session Outcome: I Student will able to Quick sort [Teaching] Active ‘Time(min Topic [BTL | Learning | Learning Methods | Methods Ey (Givena list of N array clement apply Merge sort Merge Sor isa Divide and Conguer algorithm [3 [Chalk [NOT aivides [APPLICABLE inpurarrayintwohalves callsitselforthewohalvesandihenmergesthetwosortedhalves, Thefirstinecontainsa| - 6124218123, 1016 PM ‘about blank ‘the arrayaserowofepace-separstedintegersineachiteration, integer, N, the number of elements in Array. The second line contains N space-separated integers. Print Nor 0 fitpustwwchackerak.com/contes Tes! O2/hllengesnerge-sots Is frm [apticante SESSION NUMBER 4 Sesion Outome: 1 Studet wil abe o Tsering a odin doubly linked ist Tenching | Aeive Lean [Time(min) Tople BTL | Learning Methods ‘Methods T Teng dent SoedDoublyLinkedLi Given a weseace To We hea ofa 5 __|Soubylinted ist anda integer dat create sham Nor SiewDoublyLinkedLsNodesbesthaving [APPLICABLE dutavalucdstanndinecriatsprperocatonto mainsnthesor pecker com/chalenssnser--node-inos-, ArtyDiksta'salgoihotinsivetpuromnol tall oernoks Tore [5 Yay Shing Course DELIVERY Plan: son Topeaperinets co-mappng 1 taston Sorand se ont cor 2 | sinay Linked Lit con sox cos lens cos ins cos Shiling Session ws Teaching Learning Pan SHSSION NUMBER: 1 Session Outcome: 1 neon Sr and Stl Son a Tope wi | sting: Lerang] Acie Learaing Soa Nor 50 | oe Som Cuming nvrions 5 fram Feet =-NOT So [suri son > am ae ae SESSION NUMBER: 2 Session Outeame: 2 il , eching.Learag] Ave Lanai [Time(min) Topic BTL ‘Methods Methods218/23, 10:16 PM ‘about blank [Nor so [Prine the Elements ofa Linked List Is {rate |APPLICABLE— 5 --- NOT. 50 |Compare two linked lists 3 [pk |APPLICABLE— SESSION NUMBER : 3 Session Outcome: 3 Skill . Teaching: Learning] Active Learain Tet Tonle br [IS Mfehods | Methods S50 [Sudhana ana Books 5 frm eo aoe 50 ayankand wks 5 fram ne SESSION NUMBER 4 Session Outcome: 4 Skil Teaching: Learning] Active Learnin Time(nin) Topic pr | Taehng: earning] Active Learning 0 [BFS: Shortest Reach in a Graph 3 {tate Seen aRLE (Not 50 uta greph 8 fran Noo ALE SESSION NUMBER :5 Session Outcome: § Skill ‘ i Teachings | Active Learning Time(mi ‘Topic BTL | ca an oas| Menane Prins (MIST) = Special Subwe= 50 |hntpseww hacerrank com ehallenges/rimsmstubipoblem i a Go [Finding pois ianp:Fwwwhackereath conypratellgoritims/gopinepi-tist. | [ay scarch pracuce-roblemsalgorifind-pairn 4499085 a [APPLICABLE — ‘Week| Assignment Type |**signment ie Detail ° tgnment Type | SR Topi * ‘COURSE TIME TABLE Hour 7 2 3 a 3 é 7 * > Day [Component V-82,V-83,¥- |VA85,V-86V-_|V85,V-86,- Sisvisi9NV- _|SaV50V- [SIVSEV. (SINS ca vsigve SORIA theory séav.sisv.lsrvesiay. |ssrvsiny. XSUMSIAY fetusiny | | | | S46,VS47.V-|S30,V-S41.N-|S301V.S4L.V- . SsovSstv- S48 so saa Ssv ss ‘Mon Towa [= = E E = - EEE Le Wwsiavsiay- [vsovsiow (SX, vswne|vsanv i, sisvsis [sis (So isso [sso (S32 Siig visa E E a aboutblank 9124ivzs. 1018 svoutlrk Reaver Biovsiny. esate |ysei iavsisy. peste fusea icay _|soanesisye|aaanesaay 8 Stevswy. : Besxe Sasne Eanes Ssovss.y. sac. fase savssny. a ve (RTE : E E E = Le hsinvsia hsiveew. fvssuvfussiv Sy. Siow Ever Reo so” iivswe Skilling $37,V-S38,V- |V-SIO vsio |... |. ss Sowa |sunv-siov- Bavse [sive 8, ; lsivsew erent si0 Savor Sawer Tart = = E E = = EEE - Re Wed Lab |— |— |V-S21,V-S22,V- IV-SSV-S6V- |V-S53V- V-S53,V-] 45 Rosson pavse’™ Rar fice Sa soe see NSIWSINN Iysy ning [Sotesstve|sennesene lesuwsee. wane” (USI ‘Ming | $52,V-$53,¥-]852,V-853,V- saevisas " |saa-sisy. [SV SI - Enamel Sissi sive ary hsio fusion |. Saivsn Tara = E E = = EOE ‘Thu ve Le» - . - [Sse Se : VONSTLE NWSI [esi vaanwe SS suing |¥SS¥55%-|ssvsene Raves esiveny tw LO | : : se i sa este — Ihcay [oontsanne|vsao — (ESS¥S6 | st hss OL sav Ni Frat = = E E = = = EOE a soe |vsoye hsiaysian sews Siovsiiy- piovsiny- Biswsiey” Bavsow. suiting [Stovessrye[sioyessre Siovssoy. [emversy —|sthvesio - Ssavsssssavsiev. sive. feseveww —[suvszsx. sais Ssvesr [eenvesty (sar SSSVSSSvisse pes: ica | - fievsivw. |. - - - FE 0 Frat = = E = = EEE Sat Lab ~ ~ 5 |. |. S _ _ 43,\- Se VSIVSRY SIVSRY WSR. Saw Savane. [pavinine pasvsasy- lesiaysiaye SIN. Suiting S3INisioye|saivesianefsanvsaive SENSI [Sishisien (slavsisy |~ | souvent [souvent [si ° Fis és = Tor = E Sun Tab — — — siting = FE E FE E EEE Supplement course handout, which may perhaps include special lectures and discussions that would be planned, and schedule notified according SELF-LEARNING: aboutblank 20124218/23, 10:16 PM ‘about blank Assignments to promote sel-leaming survey of contents fom mulple sources [sie | “Topies [co | AtM | Refereneeantooes DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS: ‘Content beyond syllabus covered (i'any) should be delivered to al students that would be planned, and schedule notified accordingh Sino | Advanced Topi, Adina Reading, Research papers and any | -CO™ [ALM etrenceiMOOCS EVALUATION PLAN: ation Type Balaton Companeat” | Weightag Mars [Assessment Dats [aration eur) [CO1 [07 [03 C03 COS |Skill Sem-End Ex [Weightege_[8 100, a End semester ers [0 os Summatne raghage jz ‘Evaluation End Semester Exam Max Marks [100 180 25 |2s_ [2s [25 Betat- 40 $4 Lab Kind Somestor E [Weightage [8 100 ls ‘ab End Semester Exam Max Marks [50 [so Neignage [4 ih Ratings on Global Platforms Max Marks [50 100 12.5 [12.5 [12.5 [125 Weignage [4 sos Jos lox law Skiing Continuous Balaton two in semeter sat fo fo fie fo fo ornatve cide ‘Evaluation |ALM Max Marks [50 100 12.5 [12.5 [12.5 [12.5 foe 20% , eigage [4 i ji Tome Anigament and Textbook (WoBHE | wo Tt ' icape d contnos Braunton Lab Exerc [WEBER | 100 E weiegs 2 ond [Semester in Exam-1 Max Marks [50 po 25 [25 [Weiehrage [12 | ie _|e ‘In Semester yemester in Exam- ‘Summative [Semester in Exam-I1 Max Marks |50_ po 2s [2s Evaluation Weigitage [5 1 5 oaks [Lab Semester Exam Peiemes 5 100 E [Weiehiaee [5 1 i {tf fe [Skill In-Sem Exam Max Marks [50 t00 io fio [io [io fio ATTENDANCE POLICY: Every student is expected tobe responsible for egularity of hisher attendance in class rooms and laboratories to appear in scheduled tests and ‘examinations and fulfil all othe tasks assigned to himvher in every course In every course, student has to maintain a minimum of 85% attendance to be clgible for appearing in Semester end examination ofthe course, for cases ‘of medical issues and ther unavoidable circumstances the students willbe condoned if ei attendance is between 75% to 85% in every course, subjected to submission of medical certificates, medical case file and athernecdful documenta proof tothe concerned departments DETENTION POLICY: TInany course, a student has to maintain « minimum of 85% attendance and In-Semester Examinations to be eligible for appearing othe Semester End Examination, filing to fulfill these conditions will deem such student to have been detained in tat course PLAGIARISM FOLICY: ‘Supplement course handout, which may perhaps include special lectures and discussions (COURSE TEAM MEMIERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS: Supplement course handout, which may perhaps include special lectures and discussions name otvacaty | cot op | Secomot | ggaCMREt | Chamber Coasiaton Signature ot apne Faculty “Timings for each day Course faculty: reat AMAR suanceazia fb ees i [ 5 MAS MAR suas era c : : aboutblank 228218/23, 10:16 PM ‘about blank [HARITHA [DONAVALLI IE MA C [PAVAN KUMAR Nidumolu IE s8Ma i PAVANKUMAR |p aMAae C Nigumolu MA [PAVAN KUMAR Nidumolu s s8MA TTEMAZI DAMAANAND —|L ire L TEMAZI DAMAANAND —|P Me . DAMAANAND — |S MZ L SIVAKUMAR L L PATHURT SIVAKUMAR |p PATHURI LC ‘SIVA KUMAR s PATHURT i KARIMUNNISA |, SYED LC KARIMUNNISA |p C SYED KARIMUNNISA |g SYED i UHARITA IL L UHARITA lp |. UHARITA s L YYamini Tondepe—_[P i CHIRANIEEVE |p . KOTHAPALLL CCHIRANIEEVE |p KOTHAPALLI LC CHIRANIEEVE |g TMA KOTHAPALLL MA ‘Agrabaram Kumar [L Sea E ‘Agraharam Kumar |S S8MA E 2SMAST- Lavanya Chunduri—|L 25s L [Lavanya Chandar’ _|[P 25-0 E 25-MAST- Lavanya Chunduri |S Fe . Poranki ven Sudha _[L 16-MA FE oranki vin Sudha |P 1s MAAO L Poranki vIn Sudha . ‘Deepak Panda i ‘Deepak Panda [Deepak Panda [Bhaskar Marapeli |. [Bhaskar Marapelli | P L [Bhaskar Marapelli |S |. Gandla Kanth 5 L Gandla Keath IP . Gandla Kanth s L 20-MA 2 BBechoo Lat 5 a aboutblank 22108218/23, 10:16 PM ‘about blank 2oMADe [Rechoo Lal 5 2 - - | L BBechoo Lat s 20-MA2E | . . - SUPRIVAMENON |L. - L . L SUPRIYAMENON |P - ‘SUPRIVAMENON |s - L . L ‘Shankar Miva 5 - ‘Shankar Mitra lp : - |. L 19-MAZS ‘Shankar Mitra s ae - . i - POTHULA HYMAVATAL IE oma b tC E POTHULA 7 [HYMAVATHI F srMa i i - ‘POTHULA HYMAVATAL s oma b tC E (Chintalapadi Anil | TMA (> E E E (Chintalapadi Anil —_[P TOMA [- E E L (Chintalapadi Anil |S 10MA [> E E E DINESHNATH |, eEMAs0- | L L L GOPINATH. MA DINESHNATH |p EMAS0- GOPINATH. MA - i L - DINESHNATH |g EMA. | L L i: GOPINATH. MA 2-MA,St ‘Abdul Hanan 5 ae : . . - ‘Abdel Hannan P s4MA_ | E E E laa-MASe ‘Abdul Hannan s a - |. |. L MOHD DASTAGIR_[L a5MA_ | E E E ‘MOHD DASTAGIR_|P asMa |= E E L MOHD DASTAGIR |S asMa |e E E L ‘Hanumantha Rao een 5 ama |e - . - ‘Tanumantha Rao aa lp lama |- - |. L ‘Hanumantha Rao een s ama fe - . - “Tanaya Ganguly [L RMA | FE FE 5 ‘Tenaya Ganguly |[P ZMA | “Tanaya Ganguly |S MA | F FE 5 KOMMU VARA |, MAST. KUMAR MA - LC [ E KOMMUVARA |p FMAST | C L L KUMAR MA KOMMUVARA |g MAST KUMAR MA - i L - “Arumalla Raju cL 26MA | E E E “Arumalla Raju iP 26MA | E E E “Arumalla Raju s 26MA | E E E UUshasree Linginedt —[L ISMA_ [> E 5 [Ushasree Linginedt _[P ISMA_[- E E E UUshasree Linginedt |S ISMA_[- E E E ‘DHARMENDRA Pat L soma |e |. |. L DHARMENDRA Pe IP soma |e - . - DHARMENDRA HAR s soma |e - |. L (GENERAL INSTRUCTIONS aboutblank 2124218/23, 10:16 PM ‘about blank Students should come prepared for classes and cary the text book(s) oF materials) as prescribed by the Course Faculty to te class. Most ofthe notices are evailable on the LMS platform. All notices will be commicoted trough the institution email All notices concerning the course will be displayed on the respective Notice Boards Signature of COURSE COORDINATOR (SIVA KUMAR PATHURD) Signature of Department Prof. Incharge Academics & Vetting Team Member Department OF DBES-1 HEAD OF DEPARTMENT: Approval from: DEAN-ACADEMICS (Sign with Office Seal [object HTMLDivEtemest aboutblans 2128