2113124, 9:34 AM about:blank KL Deemed to be University Department of Computer Science and Engineering-Honors ~ KLAZIZ. Course Handout 2023-2024, Even Sem Course Title DATA STRUCTURES Course Code 238C1202 L-TP-S Structure 202-4 Pre-requisite Credits 4 Course Coordinator ‘Krishnamurthy Ramasubramanian Team of Instructors 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 Memory implementation of linear data structures: Singly Linked list, doubly linked list, circularly linked list, Applications of data structures: Polynomial Manipulation, Implementation of Stacks and Queues using Linked Lists, Circular Queue, Deque(Double ended queue), Applications of Stacks and Queues. Priority Queues (Heaps): Model, Simple Implementations, Binary Heap, Applications of Priority Queues. Hashing: Introduction to Hashing, Hash Function, Separate Chaining, Hash Tables without Linked Lists, Rehashing, Hash Tables in the Standard Library, Extendible Hashing, Trees: Introduction to trees, Binary Trees, Tree Traversals, The Search Tree: Binary Search Trees, AVL Trees, Splay Trees, B-Trees, Red black trees. Graph Data Structure: Introduction to Graph data structure — basic terminologies- transitive closure -representation of graphs: adjacency matrix, linked list- Graph traversals: Breadth First Search, Depth First Search)- minimal spanning trees: Prim’s &Kruskal’s Algorithm, Text Books :1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2010 , Second Edition, PearsonEducation. 2, Ellis Horowitz, Fundamentals of Data Structures in C: Second Edition, 2015 Reference Books :1. A.V.Aho, J. E. Hoperoft, and J. D. Ullman, “Data Structures And Algorithms”, Pearson Education, First Edition Reprint2003. 2. Horowitz, Sahni, Anderson Freed, “Fundamentals of datastructures in C” , Second Fdition-2007. 3. R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second Edition, Thomson India Ed ition, 2005 4. Robert Kruse, C.L. Tondo, Bruce Leung, Shashi Mogalla, “Data Structures & Program Design in C”, FourthEdition-2007. Web Links :1. https://nptel.ac.in/courses/106102064 2. https://nptel.ac.in/courses/106101060/4 3. https://www.edx.org/course/algorithms-and-data-structures-1 4, https://in.udacity.com/course/intro-to-algorithms-— 8215 5, htps:/www.coursera.org/learn/data-structuresaction=enroll Course Rationale :To elaborate the reason why this course is included and towards what skills does this map 1 elaborate how the course will be offered mentioning if it is offered through a project based learning or through case~ studies or through experiential learning, Course Objectives :The fundamental study, analysis, and implementation of basic data structures and algorithms for the development of realtime practical applications COURSE OUTCOMES (COs): Blooms co ‘Taxonomy. so Course Outcome (CO) POIPSO Level (@TL) col Understand various sorting algorithms and analyse the efficiency of the PO1,PO2 4 algorithms, aboutolank 322113124, 9:34 AM saboutblank applications, (Co2| Implement and evaluate Linear Data Structures and Demonstrate their PO2,PO3,PO1 techniques Co3| Implement and evaluate tree data structures and understand hashing PO1,PO2,PO3 (CO4| Understand graph data structures and apply graphs to solve problems |PO1,PO2 Cos] "Design, Develop and evaluate common practical applications for linear nog p10,p07 and nonlinear data structures." -PO10 "Skill the students in such a way that students will be able to develop C06] logic that help them to create programs on both linear and non-linear |PO7,PO9,PO10 datastructuresand its applications.” COURSE OUTCOME INDICATORS (COIs Outcome) Highest] Com corz cons cond cors | core Bu2 "Mathematical lbackground, model Bus Bud and running time "Demonstrate |"Demonstrate calculations, Bees External sorting |External cor 4 introductionto Running ime and Bucket sorting and sorting.Demonstrate|calculations | Sorting. Bucket Sorting. and Implement Analyze its | Analyze its Insertion Sort, Shell Efficiency." | Efficiency.” Sort, and Heap Sort.” Bis Introduction to Dynamic Memory Allocation and List-based ical of Bue implementation. [Be Mhustrate “List based | Priority queues Linked List Singly and cor |¢ Eka Egy "8 implementation of implementations sentation Creation, Insertion, | Hterent Hsts and of Queue and oF and Double Deletion, Display S [Ended Queue. applications.List_ applications.” | pnded Queue based applications.” implementations plications of Stack and Enumerate its applications." Bus "Introduction to Hashing table, Hashing function, | BtI3 Bilt Bue Separate chaining |"Tree traversal _| "Demonstrate cos 4 eine Concepts [an open and Search trees |Red-Black tree, addressing Double construction and | Splay tree and hashing, implementation"| B tree" Extendible hashing and Rehashing" aboutolank 213221324, 934 aM sboutank Biz "data structure — Basic Introduction to Graph terminologies ‘Transitive closure |p pus and representation |p inimum [Minimum co4 Bala of spanning tree~ | spanning tree— ‘Graph Terminology | graph techniques. /SP3" panning - Grepty Igorithm algorithm Traversing algori gorit Techniques Demonstrate Breadth First Search and Depth First Search" Bus Evaluate and Discriminate the significance cos |4 of both linear and nonlinear data structures with respect to real world applications.” Bild cos [3 skill Problems PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs) aboutolank Po Now Program Outcome pot [Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the solution of complex engineering problems Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering problems PO2 |reaching substantiated conclusions using first principles of mathematics, natural sciences and engineering sciences [Design/Development of Solutions: Design solutions for complex engineering problems and design system PO3. components or processes that mect the specified needs with appropriate consideration for the public health and safety, and the cultural, societal, and environmental considerations ‘Conduct Investigations of Complex Problems:Use research-based knowledge and research methods including og |design of experiments, analysis and interpretation of data, and synthesis of the 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. ‘Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern engineering and IT POS. |tools including prediction and modelling to complex engineering activities with an understanding of the limitations. PO6 |The Engineer and Society:Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional engineering 31322324, 334 aM sboutank practice po7 [Environment and Sustainability:Understand the impact ofthe professional engineering solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable development os Ethics: Apply ethical principles and commit t professional ethics and responsibilities and norms ofthe engineering practice 09 _|lndividual and Team Work: Function effectively as an individual, and as a member or leads in diverse teams, and in multidisciplinary settings (Communieation:Communicate effectively on complex engineering activities with the engineering community PO10|and with society at large, such as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions Project Management and Finance: Demonstrate knowledge and understanding of the engineering and POI {management principles and apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments. Life-long Learning: Recognize the need for, and have the preparation and ability to engage in independent and por2 lifelong learning in the broadest context of technological change. PSO1]An ability to design and develop software projects as well as Analyze and lest user requirements PSO2|An Ability to gain working Knowledge on emerging software tools and technologies. Lecture Course DELIVERY Plan: Teaching Sess.No.| CO | COL Topic NellPane Nel Learning | EvaluationComponents Methods Ref Book Introduction to data structures-_|[1],CH 3.1Page ALM.nd Semester ‘COL-| Mathematical background, Model, |no 57-58,Ref Exam Home 1 C1 Algorithm Analysis - Ruming [Book [1,CH | CPaTaIK | cSienment, SEM- time calculations 2.1Page no 31- EXAMI 36 Ref Book ‘cor, | Insertion Sort Analysis and ee Re ALMnd Semester 2 co1|$F| Implementation, Shell Sort 31-86 Ref chalk,PPT, Talk| EAT 2 | Analysis, and [implementation | B00K [1],CH Assignment,SEM- lysis, and Imp! 7.4Page no EXAMI 238-240 ALM,Continuous Evaluation - Lab Exercise,End Semester Ref Book [1], ; 3 'cor|COF| Quick Sort Analys CH 7.2 Page no | Chatk,PPT,Talk| E*am-Home 3 [Implementation peace Assignment,Retin, Global Platforms,SEM- EXAMI,Skilling Continuous Evaluation ALM,End Semester 4 Ref Book End Se 4 cor |COF | Merge Sort Analysis and [1],CH 7.4Page |Chalk, PPT, Talk | X8™-Home 4 {Implementation nen AssignmentEM- EXAMI s o1]Cor-|Demonstrate Bucket Sort, Ref Book | Chatk,PPT,Talk| ALM,End Semester 4 [Demonstrate Extemal Sorting _|[1],CH 7.7Page Exam,Home aboutolank 413221324, 934 aM sboutank Teaching- Sess.No.| CO | COL Topic NollPage Nol Learning | EvaluationComponents ‘es Methods ino 252-262, ‘Assignment, SEM- Ref Book [1], EXAMI CH7.11,Page no 250-352 ALM,Continuows Evaluation - Lab Exercise,Lind Semester Exam Home . - Ref Book [1], Assignment,Lab End 6 con] SOF Binaly Linked ist Creation, CH 3.1 Page no |Chalk,PPT; Talk| Semester Exam,Lab In » » Display 57-58 ‘Semester Exam,Ratings ‘on Global Platforms, SEM- EXAMI Skill In-Sem Exam Skilling Continuous Evaluation cor-|Singly Linked List Reverse Ref Book [1], ALMarnd Semester 7 (co2/ OF |operation, Count, Sorting CH 3.1 Page no |Chalk,PPT,Talk| Exe 3 Joperations, Sum of elements 57-58 -Assignment,SEM- P Z EXAMI ALM.End Semester Ref Book [1]. : * co2|COF Doubly Linked tist Creation, (SPOT. | cyan pprstane|ExamtTome 3 |Insertion, Deletion, Display | [S14 76.0 AssignmentSEM- EXAMI ALM.End Semester Ref Book [1], ‘ (COL-| Circular Linked list - Creation, Exam Home ° C023 Insertion, Deletion, Display Saag Be Be |CBRIKPPETON| a signment,SEM- EXAMI RefBook [1], ALM.End Semester cor ; ce (Ub CH7.I1, Exam,Home To [co2] FF /stack Using Singly Linked tse [LOM SS): [chalk PPT. Ta eee ey. 252 EXAMI ul |co2|OF| Queue Using Singly Linked List CH 21 Posen | chal: PPT-Talk| Bentone 4 ie Sinely Sse PPT AIK! ssignment,SEM- EXAMI Infix to Postfix Expression ALM,End Semester cole Ref Book [1], 12 |co2|COF Conversion, Implementation, OT ey pre tay|Extmtome 4 | Evaluation of postfix expression, CY! 82 Assignment,SEM- Balancing symbols EXAMI cor praetne setts pts 13 |€02)4° "Queue, Dequeue, Priority queue |}4 8? Page ne [ChalksPPT.TSIK| a ienment,SEM- EXAMI aboutolank 513221324, 934 aM sboutank Teaching Sess.No.| CO | COL Topic NollPage Nel Learning | EvaluationComponents ia ‘Methods cor-|Heshing ~ Hash function, Separate |Ref Book [1], ALMarnd Semester 14 |cos|©F chaining, Linear probing and |CH 5.3 Page no |Chalk,PPT,Talk| EX¢™! 1 | Quadratic probin 168-172 ‘Assignment SEM- proving EXAM2 ALM.End Semester Ref Book [1], ‘ ‘COL-|Double hashing, Rehashing and | Exam,Home 1s CO3)> | Extendible hashing Se teen ne |CBIRPPTOIK| assignment, SEM- EXAM2 ALM.End Semester . Ref Book [1], ‘ 16 |co3|COF Binary Tree «Tree traverals, [OTP ay pre tay Examlome 3 [Expression tree construction [CAS Assignment,SEM- EXAM2 con Binary Search Tree — Ref Book [1}, ALM nd Semester 17 |cos|©°F construction, Insertion, Deletion, |CH 4.2 Page no |Chalk,PPT, Talk| EX*™ 3 |imptementation 108 - 116 Assignment, SEM- " EXAM2 ALM,End Semester 7 seare Ref Book [1], : 18 [co3|COl|Binary Search Tree— Min, Max, [C14 4.9 page no |Chalk,PPT, Talk| EX@™-Home | 4 | search operations. wea AssignmentSEM- EXAM2 cop-|AVE Tree — Rotations and Ref Book [1], ALM End Semester 19 C03) "| Operations, AVL Tree CH 4.4 Page no |Chalk,PPT, Talk| S270". 4 | feuptementation 127-138 Assignment,SEM- EXAM2 Ref Book [1], con-|Binary Heap Sort Analysis and [O13 75 Page ne ALM End Semester 20 |co3|0°"| implementation, B~ Tree + T | chalk, PPT Talk| Exe explorer Book [1], CH AssignmentSEM- 4.7 Page no EXAM2 134-138 ALM,End Semester RefBook [1], y 3] COl|Splay tree operations, | Exam Home 21 [C34 Construction of Red-Black trees [8 4-).Pake ne [ChalksPPT.TSIK| g sienment,SEM- EXAM2 Graphs Representation — ALM.nd Semester “ms m Ref Book [1], © 22 [cog|COl-|Adiacency Matrix, Graphs CH 9.1 Page no | Chalk,PPT, Talk| 2¥4™-Home 1 [Representation Linked List, [C18 AssignmentSEM- ‘Transitive Closure EXAM2 23 |co4|COL-|Graph Traversal-BFS, DFS [Ref Book [1], |Chalk,PPT,Talk| ALM,End Semester 2 CH9.2 Page no Exam,HHome 302 - 306 aboutolank 61322113124, 9:34 AM aboutblank Teaching- Sess.No.| CO | COL Topic NollPage Nel Learning | EvaluationComponents es Methods ‘Assignment, SEM- EXAM2 ALM.nd Semester 1, [Ref Book [1], : ‘COL-| Minimum Spanning Tree — Prim’s h Exam Home 24 004), "Algorithm, Kruskal’s Algorithm |CH.9-5 Page no |Chall,PPT.Talk) ¢onment SEM- 330-332 EXAM2 Lecture Session wise Teaching ~ Learning Plan SESSION NUMBER : | No Session Outcomes are mapped Teaching- ‘Time(min) Topic BTL| Learning | Learning Methods | _ Methods = NOT 5 [Recap / Introduction 1 |chalk [APPLICABLE - Introduction to data structures. Mathematical background, - NOT 40 Model, Algorithm Analysis - Running time calculations and |3—_{ Talk APPLICABLE - finding the time complexities - NOT 5 (Conclusion 1 tak [APPLICABLE - SESSION NUMBER : 2 No Session Outcomes are mapped Teaching- ‘Active ‘Time(min) Topic 'BTL| Learning | Learning Methods | Methods = NOT 5 [Recap / Introduction 1 |chatk ‘APPLICABLE - 0 Insertion Sort Analysis and Implementation Shell Sort Analysis, [3 [pay [One minute land Implementation [paper | NOT 5 Conclusion 1 |Tak |APPLICABLE - SESSION NUMBER : 3 No Session Outcomes are mapped Teaching ‘Active ‘Time(min) ‘Topic BYL| Learning | Learning Methods | _ Methods aboutolank 71322113124, 9:34 AM saboutblank [NOT s ‘Recap /Introduetion 1 [tak [APPLICABLE - 40 lQuick Sort Analysis Implementation and analysis 3 | Talk eerie NOT s ‘Conclusion & Recap 1 [talk APPLICABLE - SESSION NUMBER : 4 No Session Outcomes are mapped Teaching- ‘Active ‘Time(min) Topic BTL| Learning | Learning Methods | Methods -NOT s [Recap / Introduction 1 fale [APPLICABLE - NOT 40 [Merge Sort Analysis and Implementation 3 {talk ‘APPLICABLE - -NOT s (Conclusion 1 {talk APPLICABLE - SESSION NUMBER : 5 No Session Outcomes are mapped Teaching- A ‘Time(min) Topic BTL| Learning | Learning Methods | Methods = NOT s [Recap / Introduction 1 fraik ‘APPLICABLE - NOT 30 Examples on Bucket and External sorting 3 [talk [APPLICABLE - -NOT 10 ALM 1 |chatk ‘APPLICABLE - -NOT s (Conclusion & Recap 1 [talk [APPLICABLE - SESSION NUMBER : 6 No Session Outcomes are mapped Teaching- ‘Active ‘Time(min) ‘Topic BYL| Learning | Learning Methods | Methods aboutolank 81322113124, 9:34 AM saboutblank [NOT s ‘Recap / Introduction 1 |raik [APPLICABLE - = NOT 40 ISingly Linked List - Creation, Insertion, Deletion, Display [3 | Talk ‘APPLICABLE - = NOT 5 IConctusion 1 |ratk ‘APPLICABLE - SESSION NUMBER : 7 No Session Outcomes are mapped ‘Active ‘Time(min) Topic BTL Learning Methods “NOT s [Recap /Introduetion 1 |raik [APPLICABLE - singly Linked List -Reverse operation, Count, Sorti NOT 40 yy . peration, Count, Sorting 3 |tak [APPLICABLE - loperations, Sum of elements A NOT s Conclusion 1 talk APPLICABLE - SESSION NUMBER : 8 No Session Outcomes are mapped Teaching- ‘Aetive ‘Time(min) Topic BTL| Learning | Learning Methods | Methods =-NOT s [Recap / Introduction 1 |Tali [APPLICABLE - ‘Doubly Linked list and its operations:Insertion, Deleti Nor 40 ly Linke jperations-Insertion, Deletion, sm pee apie. Display a = NOT s Conclusion 1 ral [APPLICABLE - SESSION NUMBER : 9 No Session Outcomes are mapped Active ‘Time(min) Topic BTL| Learning | Learning Methods | Methods -NOT s [Recap / Introduction 1 |chatk [APPLICABLE - aboutolank 91322113724, 9:34AM saboutblank [NOT 10 (Circular Linked list- Creation, and operations on CLLke || yy eee ABLE Insertion, Deletion, Display A = NOT s Conclusion 1 fraik ‘APPLICABLE - SESSION NUMBER : 10 No Session Outcomes are mapped Teaching- ‘Time(min) Topic BTL| Learning Methods | Methods “NOT s [Recap /Introduetion 1 |chatk APPLICABLE - “NOT 30 [Stack Using Singly Linked ist and implementation 3 |Taik [APPLICABLE - 10 ALM 1 talk (Group Discussion NOT s (Conclusion & Recap 1 {talk APPLICABLE - SESSION NUMBER : 11 No Session Outcomes are mapped Teaching- A ‘Time(min) Topic BTL| Learning | Learning Methods | Methods = NOT s [Recap / Introduction 1 |chatk ‘APPLICABLE - NOT 40 ‘Queue Using Singly Linked List and operations on it 3 fratk ‘APPLICABLE - -NOT 5 Conclusion 1 | talk ‘APPLICABLE - SESSION NUMBER : 12 No Session Outcomes are mapped Teaching- ‘Time(min) Topic BTL| Learning | Learning Methods | Methods = NOT s [Recap / Introduction 1 [chalk [APPLICABLE - aboutolank 1013221324, 9:34AM aboubank Infix to Postfix Expression Conversion, Implementat Pot 40 e A rememeons 3 |Talk APPLICABLE - [Evaluation of postfix expression, Balancing symbols A --NOT 5 (Conclusion 1 | Talk |APPLICABLE - SESSION NUMBER : 13 No Session Outcomes are mapped Teaching- Acti Time(min) Topie BTL Learning Methods Methods [NOT 5 [Recap / Introduction 1 | Chatk APPLICABLE - "Nor 30 ‘Types of Queues ie.,Circular Queue, Dequeue, Priority queue [3 | Talk |APPLICABLE - 0 (Quiz/Test 10 ALM 1 | Chalk Questions - NOT. 5 \Conclusion & Recap 1 | Talk APPLICABLE - SESSION NUMBER : 14 No Session Outcomes are mapped Teaching- Ae Time(min) Topic BTL| Learning Learning Methods Methods NOT 5 [Recap / Introduction 1 | Chalk |APPLICABLE - . NOT, 40 Hashing - Hash function, Separate chaining, Linear probing and |, | py. APPLICABLE - ‘Quadratic probing - NOT. 5 (Conclusion 1 | Talk |APPLICABLE - SESSION NUMBER : 15 No Session Outcomes are mapped Teaching- Time(min) Topic BTL) f Learning Methods Methods NOT 5 [Recap / Introduction 1 | Chalk |APPLICABLE - aboutolank 822324, 934 aM sboutank [NOT 40 [Double hashing, Rehashing and Extendible hashing 3 [tak [APPLICABLE - = NOT s Conclusion 1 fraik ‘APPLICABLE - SESSION NUMBER : 16 No Session Outcomes are mapped TTeaching- ‘Acti ‘Time(min) Topic BTL Learning Methods | Methods “NOT s [Recap /Introduetion 1 |enatk APPLICABLE - “NOT 30 Binary Tree - Tree traversals, Expression tree coustruction [3 | Talk [APPLICABLE - 10 ALM 1 [chalk Leading question NOT s (Conclusion & Recap 1 | tak APPLICABLE - SESSION NUMBER : 17 No Session Outcomes are mapped Teaching- rr ‘Time(min) Topic BTL| Learning | Learning Methods | Methods = NOT s [Recap / Introduction 1 |chak ‘APPLICABLE - NOT Introduction to Binary Search Tree — Construction, Insertion, ABLE 40 IDeletion, Implementation 3 | Talk APPLICABLE - -NOT 5 Conclusion 1 [tale ‘APPLICABLE - SESSION NUMBER : 18 No Session Outcomes are mapped Teaching- ‘Time(min) Topic BIL | Learning Methods | Methods = NOT s [Recap / Introduction 1 |enatk [APPLICABLE - aboutolank 121822113124, 9:34 AM saboutblank [—NoT 40 Binary Search Tree ~ Min, Max, search operations. 3 | Talk |APPLICABLE - NOT 5 (Conclusion 1 | Talk |APPLICABLE - SESSION NUMBER : 19 No Session Outcomes are mapped Teaching- Time(min) Topic BTL| Learning Methods Methods -—NoT 5 [Recap / Introduction 1 |Chatk APPLICABLE - "Nor 40 |AVL Tree - Rotations and Operations, AVL Tree Implementation |3 | Talk |APPLICABLE - --NOT 5 (Conclusion 1 |Talk |APPLICABLE - SESSION NUMBER : 20 No Session Outcomes are mapped Teaching- Time(min) Topic BTL| Learning Learning Methods Methods -—NoT 5 [Recap / Introduction 1 |Chatk |APPLICABLE - ‘Binary Heap Sort Analysis and Implementation, B ~Ts hor 40 wy eee ysis and Implementation, B~ Tree 3 |Talk 'APPLICABLE - (Construction A -NOT 5 (Conclusion 1 |Talk |APPLICABLE - ‘SESSION NUMBER : 21 No Session Outcomes are mapped ‘Active Time(min) Topic BTL| Learning Learning Methods Methods "NOT, 5 [Recap / Introduction 1 | Chatk |APPLICABLE - NOT, 30 ‘Splay tree operations, Construction of Red-Black trees 3 | Talk |APPLICABLE - aboutolane 191322324, 934 aM sboutank [NOT 10 ALM 2 | Chalk 'APPLICABLE - = NOT 3 ‘Conclusion & Recap 1 talk [APPLICABLE - SESSION NUMBER : 22 No Session Outcomes are mapped Teaching Time(min) Topic BTL! Methods | Methods <= NOT 5 [Recap / Introduction 1 [chalk APPLICABLE - |Graphs Representation — Adjacency Matrix, Graphs [NOT 40 [Representation ~ Linked List, Transitive Closure Ss [Talk APPLICABLE - = NOT 5 IConelusion 1 talk [APPLICABLE - SESSION NUMBER : 23 No Session Outcomes are mapped Teaching Time(min) Topic BTL| Learning | Learning Methods | Methods <=NOT 5 [Recap / Introduction 1 | Chalk 'APPLICABLE - = NOT 30 \Graph Traversal - BFS, DFS 3 | Tank 'APPLICABLE - 10 ALM 2 |Talk Bust in-time teaching -NOT 5 ‘Conclusion & Recap 1 [talk [APPLICABLE - SESSION NUMBER : 24 No Session Outcomes are mapped Teaching- Time(min) Topic BIL | Learning Methods Methods = NOT 5 [Recap / Introduction 1 [chalk [APPLICABLE - aboutolank 141322113724, 9:34AM saboutblank " 7 --NOT 50 ‘Minimum Spanning Tree — Prim’s Algorithm, Kruskal’s, 3 |r APPLICABLE - ‘Algorithm iM (Quiz/Test 10 ALM. 2 |Chalk [Questions -—-NOT 5 \Conclusion & Recap 1 | Talk APPLICABLE - Tutorial Course DELIVERY Plan: NO Delivery Plan Exists, ‘Tutorial Session wise Teaching — Learning Plan No Session Plans Exists Practical Course DELIVERY Plan: Tutorial Session ‘Topics ‘CO-Mapping no. 1 Develop a program to implement the sorting techniques. a, Insertion Sort b. Shell a Sort 2 Develop a program to implement the sorting technique. a. Quick Sort b. Merge Sort_ [COS 3 List Implementation- a, Singly Linked List cos 4 List Implementation-(Operations like search,sort,sum) a. Singly Linked List cos 5 Circular Linked List a, Circular Linked List b, Doubly Linked List cos 6 Linked Implementation of — a, Stack cos 7 Linked Implementation of — a, Queue cos 8 Stack Applications— a, Infix to Postfix Expression Conversion b, Postfix Expression | Evaluation 9 Hashing a, Separate chaining b. Open Addressing cos 10 __ [Binary search Tree a. Creation of BST b. Traversal-In-order, Pre-order, Post-order _|COS i AVL Tree-Self Balancing Tree cos 12___|Graphs~a. BFS b. DFS LAB IN-SEM EXAM-IL cos Practical Session wise Teaching — Learning Plan SESSION NUMBER : 1 No Session Outcomes are mapped aboutolank 181322113124, 9:34 AM saboutblank Teaching- ‘Active ‘Time(min) Topic BIL Learning Methods | Methods [Develop a to implement the sorting tech Nor 50 P a program to implement the sorting techniques. syne RPPeCABLE - Insertion Sort A = NOT 40 b. Shell Sort 3. |ure [APPLICABLE - -=NOT 10 Viva 2 | Talk [APPLICABLE - SESSION NUMBER : 2 No Session Outcomes are mapped ‘Active Time(min) Topic BIL Learning Methods Methods IDevelop a program to implement the sorting technique. a. Quick NOT 50 Ison ee " g fecha 3 |Lre APPLICABLE - NOT 40 b.Develp a program toimplement the sorting technique. Merge 1s |p APPICABLE - “NOT 10 Viva 2 | Talk [APPLICABLE - SESSION NUMBER : 3 No Session Outcomes are mapped “Teaching- ‘Active Time(min) Topic 'BTL| Learning | Learning Methods | _ Methods = NOT 50 List Implementation- a. Singly Linked List 3 |ure [APPLICABLE - = NOT 40 List Implementation. a. Singly Linked List 3 |ure [APPLICABLE - -=NOT 10 Viva 2 |tatk |APPLICABLE - SESSION NUMBER : 4 No Session Outcomes are mapped “Teaching ‘Active ‘Time(min) Topic BYL| Learning | Learning Methods | Methods aboutolank 161322324, 934 aM sboutank List Implementation-(Operations like search, sort, Singh Pot 50 plementation-(Operations like search sortsum) a. Singly |, | 7¢ eee ABLE Linked List A List Implementation-(Operations like search, sort, Singh pane 10 plementation-(Operations like search sortsum) a. Singly |, |. ¢ or BLE [Linked List A“ = NOT 10 Viva 2 |Talk "APPLICABLE - SESSION NUMBER : 5 No Session Outcomes are mapped Teaching- ‘Active ‘Time(min) Topic BTL Learning Methods | Methods “NOT 50 (Cireular Linked List a. Circular Linked List Lc [APPLICABLE - “NOT 40 [Doubly Linked List 3 |ure [APPLICABLE - “= NOT 10 Vive 2 | talk APPLICABLE - SESSION NUMBER : 6 No Session Outcomes are mapped Teaching- ‘etive ‘Time(min) Topic BTL] Learning | Learning Methods | Methods = NOT 50 [Linked Implementation of ~ a. Stack 3 fire [APPLICABLE - = NOT 40 [Linked Implementation of — a, Stack 3s |ure ‘APPLICABLE - = NOT 10 Viva 2 |ralk ‘APPLICABLE - SESSION NUMBER : 7 No Session Outcomes are mapped Teaching- Active ‘Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 4s [Linked Implementation of - a. Queue 3 |ure [APPLICABLE - aboutolank 71322324, 934 aM sboutank [NOT las [Linked Implementation of ~ a. Queue 3s fire [APPLICABLE - = NOT 10 Viva 2 [rai "APPLICABLE - SESSION NUMBER : 8 No Session Outcomes are mapped Teaching- ‘Time(min) Topic BIL Methods | Methods “NOT 45 ‘Stack Applications—a, Infx to Postfix Expression Conversion. irc APPLICABLE - “NOT 45 Postfix Expression Evaluation 3 |ure [APPLICABLE - = NOT 10 Viva 2 [ra [APPLICABLE - SESSION NUMBER : 9 No Session Outcomes are mapped Teaching- ‘Time(min) Topic BTL| Learning | Learning Methods | Methods “NOT 45 [Hashing a. Separate chaining 3 [Tc [APPLICABLE - = NOT 4s lb. Open Addressing 3 |urc [APPLICABLE - = NOT 10 Viva 2 |ralk ‘APPLICABLE - SESSION NUMBER : 10 No Session Outcomes are mapped ‘Active ‘Time(min) Topic BTL| Learning | Learning Methods | Methods [Binary search Tree a. Creation of BST b. Traversal-In-order, P NOT 4s ty ' 3 [ure [APPLICABLE - Pre-order, Post-order [Binary search Tree a. Creation of BST b. Traversal-In-order, Nor 4s u » 3 [ure [APPLICABLE - re-order, Post-order A shoutbank se922113724, 9:34 AM abourblank --- NOT 10 Viva 3 | Talk 'APPLICABLE - SESSION NUMBER : 11 No Session Outcomes are mapped ‘Teaching Active Time(min) Topic BTL| Learning Learning Methods Methods |-- NOT 45 |AVL Tree-Self Balancing Tree 3 |LTe |APPLICABLE - NOT 45 |AVL Tree-Self Balancing Tree Tc APPLICABLE - NOT 10 Viva 2 |Talk |APPLICABLE - SESSION NUMBER : 12 No Session Outcomes are mapped ‘Teaching- Active Time(min) Topic BTL| Learning Learning Methods Methods NOT 45 \Graphs—a, BFS LTC APPLICABLE - --- NOT 45 'b. DFS LTC APPLICABLE - "Nor, 10 Viva 2 |Talk |APPLICABLE - Skilling Course DELIVERY P! Skilling| session ‘Topics/Experiments ‘CO-Mapping no 1 Develop a program to implement the sorting techniques. a. Insertion Sort cos 2 Develop a program to implement the sorting techniques. b, Shell Sort ‘cos 3 Develop a program to implement the sorting technique. a. Quick Sort ‘cos 4 Develop a program to implement the sorting technique. b. Merge Sort ‘cos 5 Develop a program to implement the sorting technique. SLL ‘cos aboutolank 191322113724, 9:34AM saboutblank Skilling| session ‘Topics/Experiments CO-Mapping no 6 Develop a program to implement the sorting technique. SLL Operations ‘cos 7 List Implementation- Singly Linked List cos 8 List Implementation- Singly Linked List ‘cos 9 Develop a program to implement Doubly Linked List ‘cos 10 __|Develop a program to implement CLL ‘cos 11___|Linked Implementation of — a, Stack \coe 12___|Linked Implementation of — a. Stack(Operations) ‘cos 13, __|Linked Implementation of - a. Queue ‘cos 14___|Linked Implementation of — a. Queue cos 15 __|Stack Applications a. Infix to Postfix Expression Conversion ‘cos 16 __ |b. Postfix Expression Evaluation cos 17___|Hashing~ a. Separate chaining ‘cos 18 |b. Open Addressing \coe 19 __ [Binary search Tree a, Creation of BST ‘cos 20 __ |b. Traversal-In-order, Pre-order, Post-order ‘cos 21 | AVL Tree-Self Balancing Tree - Insertion. cos 22___ | AVL Tree-Self Balancing Tree- Deletion ‘cos 23 |Graphs— a. BFS cos 24 |Graphs-b. DFS ‘cos Skilling Session wise Teaching - Learning Plan. SESSION NUMBER : | No Session Outcomes are mapped ‘Teaching- Active Time(min) Topic BTL| Learning Learning Methods Methods aboutblank 2013221324, 9:34AM aboubank IDevelop a program to implement the sorting techniques. a, [NOT 50 Insertion Sort Skill Problem a ed APPLICABLE - -—NOT 40 [Skill Problem-2,3 3 |Lre |APPLICABLE - NOT 10 Viva 2 | Talk |APPLICABLE - ‘SESSION NUMBER : 2 No Session Outcomes are mapped ‘Active Time(min) Topic BTL) Learning Methods [Develop a program to implement the sorting techaiques. b. Shell Ener 50 sor em tome i techniques. b- 4 |Lre 'APPLICABLE - --NOT 40 [Skill Problem-2,3 3 |Lre |APPLICABLE - --NOT 10 Viva 2 | Talk APPLICABLE - SESSION NUMBER : 3 No Session Outcomes are mapped Teaching- ‘Active Time(min) Topic BTL| Learning Learning Methods Methods IDevelop a program to implement the sorting technique. a. Quick NOT 50 son ™ 8 techni 3 |LTc |APPLICABLE - -NOT 40 \Skill Problem-2,3 3 |Lre |APPLICABLE - -—-NOT 10 Viva 2 | Talk APPLICABLE - ‘SESSION NUMBER : 4 No Session Outcomes are mapped ‘Active ‘Time(min) Topic BTL| Learning Learning Methods Methods [Develop a program to implement the sorting technique. b. Merge axon 50 Pa progran ™ is techinig ee)s jure APPLICABLE ‘Sort aboutolank 211822324, 934 aM sboutank [NOT 40 Skil Problem-2,3 3 |ure [APPLICABLE - = NOT 10 Viva 2 |ratk ‘APPLICABLE - SESSION NUMBER : 5 No Session Outcomes are mapped Teaching- Acti ‘Time(min) Topic BTL Learning Methods | Methods “NOT 50 [Develop a program to implement the sorting technique. SLL_ [3 |ETC APPLICABLE - “NOT 40 Skil Problem-2,3 Lic [APPLICABLE - = NOT 10 Viva 1 | raik [APPLICABLE - SESSION NUMBER : 6 No Session Outcomes are mapped Teaching- ‘Time(min) Topic BTL| Learning | Learning Methods | Methods [Develop a to implement the sorting technique. SLL. PoNoT as p a program to implement the sorting technique 3 lere reo ABLE (Operations a = NOT 4s Skil Problem-2,3 3 |ure [APPLICABLE - = NOT 10 Vive 1 |taik ‘APPLICABLE - SESSION NUMBER : 7 No Session Outcomes are mapped Teaching- ‘Active ‘Time(min) Topic BTL| Learning | Learning Methods | Methods “NOT 4s List Implementation- Singly Linked List s |ure [APPLICABLE - NOT 4s Skil Problem-2,3 3 |ure [APPLICABLE - aboutolank 221822113724, 9:34AM saboutblank --NOT 10 ‘Viva 1 | Talk APPLICABLE - SESSION NUMBER : 8 No Session Outcomes are mapped “Teaching- Active ‘Time(min) Topic BTL| Learning Learning Methods Methods |--- NOT 45 List Implementation- Singly Linked List Tc APPLICABLE - --NOT 45 ‘Skill Problem-2,3 Tc APPLICABLE - NOT 10 Viva 2 | Talk 'APPLICABLE - SESSION NUMBER : 9 No Session Outcomes are mapped Teaching- ‘Active ‘Time(min) Topic BTL| Learning Learning Methods Methods |-- NOT 45 [Develop a program to implement Doubly Linked List LTC APPLICABLE - NOT 45 ‘Skill Problem-2,3 3 |rTc |APPLICABLE - NOT 10 Viva 1 | Talk |APPLICABLE - SESSION NUMBER : 10 No Session Outcomes are mapped Time(min) Topic BTL| Learning Learning Methods Methods |-- NOT 45 [Develop a program to implement CLL 3 |tTe |APPLICABLE - -NOT 45 ‘Skill Problem-2,3 1 |LTe 'APPLICABLE - NOT, 10 Viva 1 | Talk APPLICABLE - aboutolank 231322113124, 9:34 AM SESSION NUMBER : 11 No Session Outcomes are mapped saboutblank “Teaching- ‘Active ‘Time(min) ‘Topic BIL| Learning Learning Methods ‘Methods NOT, 4s [Linked Implementation of — a. Stack 3 [ure |APPLICABLE - |-- NOT 45 ‘Skill Problem-2,3 Tc |APPLICABLE - ---NOT 10 Viva 1 |Tatk APPLICABLE - SESSION NUMBER : 12 No Session Outcomes are mapped “Teaching- Active ‘Time(min) ‘Topic BTL| Learning Learning Methods Methods -NOT 4s Linked Implementation of - a. Stack(Operations) 3 |ure APPLICABLE - - NOT 45 ‘Skill Problem-2,3 Tc APPLICABLE - -NOT 10 Viva 1 {Talk |APPLICABLE - SESSION NUMBER : 13 No Session Outcomes are mapped “Teaching- Active ‘Time(min) ‘Topic BTL| Learning Learning Methods Methods --NOT 4s Linked Implementation of - a. Queue 3 |ure |APPLICABLE - - NOT 45 ‘Skill Problem-2,3 3 |ite |APPLICABLE - - NOT 10 ‘Viva 3 |Talk APPLICABLE - SESSION NUMBER : 14 No Session aboutolank Outcomes are mapped aise2113724, 9:34 AM abourblank Teaching- Active ‘Time(min) Topic BTL] Learning Learning Methods ‘Methods --NOT 45 ‘Linked Implementation of — a. Queue 3 |ure |APPLICABLE - --- NOT 4s ‘Skill Problem-2,3 3 |ure |APPLICABLE - |-- NOT 10 Viva 1 |Tatk |APPLICABLE - ‘SESSION NUMBER : 15 No Session Outcomes are mapped ‘Active Time(min) Topic ‘BTL Learning Methods -NOT 4s ‘Stack Applications a. Infix to Postfix Expression Conversion [3 |LTC APPLICABLE - --- NOT 4s ‘Skill Problems 2,3 3 |LTe APPLICABLE - NOT 10 Viva 1 |tre APPLICABLE - ‘SESSION NUMBER : 16 No Session Outcomes are mapped “Teaching- ‘Active Time(min) Topic BTL| Learning Learning Methods ‘Methods -NOT 45 'b. Postfix Expression Evaluation 3 |tre |APPLICABLE - -—-NOT 45 ‘Skill Problem 2,3 3 |LTe APPLICABLE - |-- NOT 10 Viva Talk APPLICABLE - SESSION NUMBER : 17 No Session Outcomes are mapped ‘Active ‘Time(min) ‘Topic BIL| Learning Learning ‘Methods ‘Methods aboutolank 251322113124, 9:34 AM saboutblank -- NOT 45 'Hashing- a, Separate chaining 3 |Lre 'APPLICABLE - NOT 45 ‘Skill Problems 2,3 3 |ure |APPLICABLE - --- NOT 10 Viva 3 | Talk |APPLICABLE - SESSION NUMBER : 18 No Session Outcomes are mapped ‘Active Time(min) Topic BTL) Learning Methods NOT 45 'b. Open Addressing 3 |LTc 'APPLICABLE - -NOT 4s \Skill Problem 2,3, 3 |Lre |APPLICABLE - --- NOT 10 Viva 1 | Talk APPLICABLE - ‘SESSION NUMBER : 19 No Session Outcomes are mapped ‘Active Time(min) Topic BTL} Learning ‘Methods ‘Methods NOT 45 [Binary search Tree a. Creation of BST 3 |tre |APPLICABLE - - NOT 45 \Skill problems 2,3 3 |ure |APPLICABLE - -—NOT 10 Viva 1 |Talk APPLICABLE - ‘SESSION NUMBER : 20 No Session Outcomes are mapped ‘Active Time(min) Topic BTL} Learning ‘Methods ‘Methods NOT, 30 ‘Binary search Tree b. Traversal-In-order, Pre-order, Post-order |3_— | LTC APPLICABLE - aboutolank 261322113724, 9:34 AM abourblank -- NOT 30 \Skill Problem 2,3 3 |Lre 'APPLICABLE - NOT 30 project review 1 | Talk |APPLICABLE - --- NOT 10 Viva 2 | Talk |APPLICABLE - SESSION NUMBER : 21 No Session Outcomes are mapped ‘Active Time(min) Topic BTL) Learning Methods NOT 45 'b. Traversal-In-order, Pre-order, Post-order LTC 'APPLICABLE - NOT 4s ‘Skill Programs 2,3 3 |tre |APPLICABLE - --- NOT 10 Viva 1 | Talk APPLICABLE - ‘SESSION NUMBER : 22 No Session Outcomes are mapped ‘Teaching- ‘Active Time(min) Topic BTL| Learning Learning ‘Methods ‘Methods -—NOT 45 |AVL Tree-Self Balancing Tree- Deletion 3 |Lre |APPLICABLE - NOT 45 \Skill Problem 2,3, 3 |Lre |APPLICABLE - -—NOT 10 Viva 1 |Talk. APPLICABLE - SESSION NUMBER : 23 No Session Outcomes are mapped ‘Active Time(min) Topic BIL} Learning ‘Methods ‘Methods NOT, 45 \Graphs—a. BFS 3 |ure APPLICABLE - aboutolank 271322113724, 9:34 AM abourblank NOT 45 ‘Skill Programs 2,3 3 |Lre 'APPLICABLE - NOT 10 Viva 1 (talk |APPLICABLE - SESSION NUMBER : 24 No Session Outcomes are mapped Acti Time(min) Topic BTL) Learning Methods Methods --- NOT 30 \Graphs—_b. DFS. Tc APPLICABLE - --- NOT 30 ‘Skill Problem 1,2 3 |Lre |APPLICABLE - "NOT, 30 [Project Review 1 Talk APPLICABLE - -- NOT 10 Viva 1 | Talk APPLICABLE - WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES ete: Week Assignment Assignment] i Type No Topic Details co COURSE TIME TABLE: Hour 1 2 3 4 Day [Component| ‘Theory |H-S3,H-S9 Mon! Tutorial | | Ss Ss Lab I~ -- - - Skilling |~ - ~ - Tue Theory |H-SS HSS H-S2 Tutorial | | J | aboutolank 281322113124, 9:34 AM saboutblank U-SiH- 1-81, nm {it Lab SLIES4H- SIIES4H- S303 831-83 SOUL Sou | s4 s4 so |s9 Skilling |— | - ~ Theory | an a -- - Tutorial | — Kf - - & Fe Wed ie | ie Lab — S282 |H-S2H-82 [soe |S6.H- | |S8,H- s6_|s6 s8 Skilling | a — — |HESI HSI s3 [iss [| Theory | os a -- rs Tutorial | |. - - Th = "Lab - - I - - L | AE Skilling H-S4,H-89 [ES4H-So | [HLS6 H-86 ssH- [ssn [| sv is7 Theory | - | - -~ - Tutorial | - I | - - - FE Fri > ™ |Lab - - I - - L | HSL Skilling [H-S3,H-S6 |H-S3,H-S6 | S2H-SSH- |H-S4 [HSA s8 Theory | ~ HSI - - - Tutorial | - | = - - Fe Sat Lab - - I fe - ~ fe Ee Skilling |H-S2 HS2H-S8 |HSs | an Hs9 |Hs9 [*) Theory |= = Le = = eR sun [Seorial [= = EF = = Tab = ~ = ~ ~ Skilling | = LE = = REMEDIAL CLASSES: ‘Supplement course handout, which may perhaps include special lectures and discussions that would be planned, and schedule notified according aboutolank 291322113124, 9:34 AM SELF-LEARNING: Assignments to promote self-learning, survey of contents from multiple sources. saboutblank S.no Topics co ALM References/MOOCS: DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS: Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and schedule notified accordingly. ‘Advanced Topics, Additional Reading, Research S.no papers and any co ALM References/MOOCS, EVALUATION PLAN: Evaluation | Evaluation i ‘Assessment | Duration a Component _|Weishtage/Marks| “SDN | tours) |CO1/CO2| Cos] Co4]cos|Cos Skill Sem-End | Weightage [8 100 a End Exam Max Marks [50 50 Semester End Semester |Weightage [24 6 |6 |e (6 ee [Exam ‘Max Marks [100 180 25 |25_ [25 [25 Evaluation fax Mark Total= 40 % |Lab End Semester|Weightage [8 100 8 Exam ‘Max Marks {50 50 [Ratings on Global |Weightage [2 0 2 Platforms ‘Max Marks [50 - 50 Skilling Weightage [5 5 ‘Continuous 100 In Semester |Evaluation Max Marks {50 5 Formative | 14 [Weightage [8 %0 2 2 p 2 Evaluation ‘Max Marks _|50 12.5 [12.5 [12.5 [12.5 Total= 24 % |r ome Assignment |Weightage [4 30 1 i iti and Textbook [Max Marks [50 : 12.5 [12.5 [12.5 [12.5 ‘Continuous Weightage [5 5 Evaluation - Lab 100 Exercise Max Marks |50 50 [Semester in Weightage [12 90 6 |s Exam-1 Max Marks [50 25 (25 In Semester |Semester in Weightage [12 90 6 |6 Summative |Exam-IT ‘Max Marks _|50 25 [25 Evaluation [Lab In Semester |Weightage | 6 100 6 Total= 36 % | Exam ‘Max Marks [50 50 ‘Skill In-Sem Weightage [6 100 6 Exam ‘Max Marks [50 50 ATTENDANCE POLICY: Every student is expected to be responsible for regularity of his/her attendance in class rooms and laboratories, to appear in scheduled tests and examinations and fulfill all other tasks assigned to hinv/her in every course aboutilank 30132213724, 9:34 AM sbourblank In every course, student has to maintain a minimum of 85% attendance to be eligible for appearing in Semester end examination of the course, for cases of medical issues and other unavoidable circumstances the students will be condoned if their attendance is between 75% to 85% in every course, subjected to submission of medical certificates, ‘medical case file and other needful documental proof to the concerned departments DETENTION POLICY : In any course, a student has to maintain a minimum of 85% attendance and In-Semester Examinations to be eligible for appearing to the Semester End Examination, failing to fulfill these conditions will deem such student to have been detained in that course. PLAGIARISM POLICY : ‘Supplement course handout, which may pethaps include special lectures and discussions (COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS: ‘Supplement course handout, which may perhaps include special lectures and discussions Devry | Sections | Chamber | Chamber Siggatre of Name of Faculty |Component of} of Consultation ‘Timines for each ‘Course Faculty | Faculty Day (s) ‘ay faculty: GREKHA L SMA LE - - GREKHA, P ALB LE - E GREKHA is SMA [- - : : Mahesh Babu L |. - - Arama Mahesh Babu > |. - - ‘Arrama Mahesh Babu s - | - - Arrama Krishnamurthy Ramasubramanian Krishnamurthy |, Ramasubramanian Krishnamurthy | i . . Ramasubramanian Jayasri R L - - - - JayastiR P - - - - Jayasti R s - - - DAYANIKA P i . . JARUGUMALLA Aashig Banu L - | - - aboutolank 311322113124, 9:34 AM about:blank Aashiq Banu P Aashiq Banu s GENERAL INSTRUCTIONS Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the Course Faculty to the class. NOTICES ‘Most of the notices are available on the LMS platform, All notices will be communicated through the institution email All notices concerning the course will be displayed on the respective Notice Boards, Signature of COURSE COORDINATOR (Krishnamurthy Ramasubramanian) Signature of Department Prof. Incharge Academies & Vetting Team Member Department Of CSE-Honors HEAD OF DEPARTMED Approval from: DEAN-ACADEMICS. (Sign with Office Seal) [object HTMLDivElement] aboutolank sae