Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Labs

Course No CAP511T

Cours Title DATA STRUCTURE

Course Planner 13069 :: Sandeep Sharma

Lectures Tutorial Practical Credits 3 0 0 3

Text Book:

1 Author: Seymour Lipschutz, Title: Schaum Outline Series, Publishers: Tata McGraw Hill, New Delhi, Year of Publication: 2006

Other Specific Book:

2 Mark Allen Weises, Data Structures & Algorithmic Analysis in C, Pearson Education 3 Adam Drozdek, Data Structure & Algorithms in C++. Thomson 4 Kruse, Data Structures & Program design, Prentice Hall of India, New Delhi. 5 Tanenbaum, Augenstein, & Langsam, Data Structures using C and C++, Prentice Hall of India, New Delhi 6 Sorenson and Tremblay: An Introduction to Data Structures with Algorithms.

Other Reading Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference) 7 Article on An Extensive Examination of Data Structures, http://msdn.microsoft.com/enus/ library/aa289148.aspx 8 Article on ADTTool: Learning Data Structures as Visual Abstract Data Types, http://www.actapress.com/PaperInfo.aspx?PaperID=14942&reason=500 Relevant Websites Sr. No. (Web adress) (only if relevant to the courses) 9 http://www.cse.unt.edu/~rada/CSCE3110/#syllabus 10 http://cpp.datastructures.net/ Salient Features Presentations on various topics of Data Structures Presentations on various topics of Data Structures

11 www.comp.nus.edu.sg/~tantc/ioi.../ApplicationofDataStructure Applications of data structure s.ppt 1 Approved for Spring Session 2011-12

Detailed Plan For Lectures

Week Number Lecture Number Lecture Topic Chapters/Sections of Pedagogical tool Textbook/other Demonstration/case reference study/images/anmatio n ctc. planned

Part 1
Week 1 Lecture 1 Lecture 2 Lecture 3 Week 2 Lecture 4 Lecture 5 Lecture 6 Week 3 Lecture 7 Lecture 8 Lecture 9 Week 4 Lecture 10 Basic concepts and notations: Abstract data type, data structure operations Complexity Analysis: algorithmic complexity and time space trade off ->Reference :1,1.2-1.4 PPTs ->Reference :1,1.5 ppt,discussion

Big O Notation,Best, average & worst case analysis ->Reference :1,2.5-2.6 ppt,discussion of algorithms Arrays: Linear arrays and representation multi-dimensional arrays and their representation operations on arrays sparse matrices and their representation Sorting & Searching: Bubble Sort Insertion Sort, Selection Sort Linear Search and Binary Search ->Reference :1,4.1-4.3 ppt,discussion ->Reference :1,4.9 ppt,discussion

->Reference :1,4.4-4.5 ppt,discussion ->Reference :1,4.14 ->Reference :1,4.6 ppt,discussion ppt,discussion

->Reference :1,9.3-9.4 ppt,discussion ->Reference :1,4.7-4.8 ppt,discussion

Part 2
Week 4 Lecture 11 Lecture 12 Week 5 Lecture 13 Lecture 14 Lecture 15 Week 6 Lecture 16 Lecture 17 overview of hashing Linked list: Linked list representation operations on linear linked lists double linked lists Header Lists and Circular Lists, multi-linked structures Test 1 Stacks: Definition, operations of Stack, Memory Representation ->Reference :1,6.2-6.3 ppt,discussion ->Reference :1,9.9 ppt,discussion ->Reference :1,5.2-5.3 ppt,discussion ->Reference :1,5.4-5.5 ppt,discussion ->Reference :1,5.10 ->Reference :1,5.9 ppt,discussion ppt,discussion

Approved for Spring Session 2011-12

Week 6 Week 7

Lecture 18 Lecture 19 Lecture 20 Lecture 21

applications of stacks such as evaluation of postfix expressions, quick sort, infix to postfix conversion Queues: Definition, Operations Representation & Types, Deques,priority queues term paper review

->Reference :1,6.4-6.6 ppt,discussion ->Reference :1,6.106.11 ->Reference :1,6.116.13 ppt,discussion ppt,discussion discussion

MID-TERM Part 3
Week 8 Lecture 22 Lecture 23 Lecture 24 Week 9 Lecture 25 Lecture 26 Lecture 27 Week 10 Lecture 28 Lecture 29 Recursion: Definition, Function Call & Recursion implementation Anatomy of Recursive Call, Complexity issues Trees: Basic terminology, binary trees representation in memory, Binary Search Trees Tree traversal methods operations on BSTs threading and threaded binary trees Term paper review ->Reference :1,6.7 ->Reference :1,6.8 ppt,discussion ppt,discussion

->Reference :1,7.1-7.2 ppt,discussion ->Reference :1,7.3 ppt,discussion

->Reference :1,7.4-7.5 ppt,discussion ->Reference :1,7.7-7.9 ppt,discussion ->Reference :1,7.6 ppt,discussion discussion

Part 4
Week 10 Week 11 Lecture 30 Lecture 31 Lecture 32 Lecture 33 Week 12 Lecture 34 Lecture 35 Lecture 36 Week 13 Lecture 37 Lecture 38 Lecture 39 3 Heaps: Intro to Heaps, building minheap & maxheap ->Reference :1,7.17 heapsort algorithm AVL Trees: Definition single and double rotations AVL operations AVL operations Graphs: Graphs Theory Terminology Graph Memory Representations Traversing BFS Traversing DFS ->Reference :1,7.17 ->Reference :1,7.10 ->Reference :1,7.117.12 ->Reference :1,7.117.12 ->Reference :1,7.117.12 ->Reference :1,8.3 ->Reference :1,8.7 ->Reference :1,8.7 ppt,discussion ppt,discussion ppt,discussion ppt,discussion ppt,discussion ppt,discussion

->Reference :1,8.1-8.2 ppt,discussion ppt,discussion ppt,discussion ppt,discussion Approved for Spring Session 2011-12

Spill Over
Week 14 Lecture 40 Lecture 41 Introduction to Red Black trees Introduction to concept of spanning trees in graphs ppt,discussion ppt,discussion

Details of homework and case studies

Homework No. Objective Topic of the Homework Nature of homework (group/individuals/field work Individual Evaluation Mode Allottment / submission Week 3/4

Homework 1

To give exposure to students about the subject in stating weeks

A set of 4-5 questions will be assigned to the students. After on week, their submissions will be evaluated.

Individual understanding of the task contents submitted by students after 6 weeks, and VIVA about topic Performance in the test

Term Paper 1

To give students one topic related to the subject will be assigned to the students exposure to study individually or max. 2 applications of the subject To test student's performance by the end of semester A one hour test will be conducted before MTE.

Individual

4 / 11

Test 1

Individual

6/7

Scheme for CA:out of 100*

Component Homework,Term Paper,Test Frequency 2 Total :Out Of 3 Each Marks Total Marks 10 10 20 20

* In ENG courses wherever the total exceeds 100, consider x best out of y components of CA, as explained in teacher's guide available on the UMS List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper) Sr. No. Topic 1 Applications and operations of Red black trees. 4 Approved for Spring Session 2011-12

2 Study of various crawling algorithms of search engines. 3 Study of various string matching techniques. 4 Role of data structure in graphics and artificial intelligence. 5 AVL trees and their applications. 6 In depth comparisons of all sorting algorithms and considering the cases in which a particular sorting algorithm most suitable to use. 7 Importance of Recursion and its applications. 8 Various applications of Queues. 9 Various Hashing Methods and applications. 10 Implementation of Doubly Linked Lists and its Applications. 11 Applications and implementation of Binary Heaps. 12 Importance of Algorithm complexity and various notations 13 Why we use pointers? Advantages and disadvantages of using pointers. 14 Various applications and operations of graphs. 15 Various traversing techniques of binary trees. 16 study of algorithms used to find minimum spanning trees in graphs

Approved for Spring Session 2011-12