SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING COURSE PLAN : CS0201 : Data

Structures using C++ : III : Jan May 2009

A Timing 9.20 10.10 8.30 9.20 3.10 4.00 1.30 2.20 B Timing 10.20 11.10 2.203.10 10.2011.10 2.203.10 SECTION C Hour Timing 8.301 9.20 11.104 12.00 2 2 10.2011.10 10.2011.10 D Timing 8.30 9.20 9.20 10.10 9.20 10.10,2.20 3.10 E Timing 9.20 10.10 8.30 9.20 3.10 4.00 1.30 2.20

Course Code Course Title Semester Course Time

Day

Hour Monday Tuesday Wednesday Thursday Friday 2 1 7 5

Hour 3 6 3 6

Hour 1 2 2,6 -

Hour 2 1 7 5

LOCATION: S.R.M.E.C Tech Park FACULTY DETAILS Sec. Name A B C D E D.Manikandan Mr.S.Ganesh kumar Ms.G.Abirami Ms. Sasi Rekha Sankar N.Snehalatha Office Hi-Tech Block ITPARK Block Tech Park Hi-Tech Block Hi-Tech Block Office hour Monday to Friday Monday - Friday Monday to Friday Monday to Friday Monday to Friday Mail id dmanicse@gmail.com sganeshkumar@cse.srmuniv.ac.in abirami@cse.srmuniv.ac.in rekhas_2006@yahoo.co.in snehalatha@cse.srmuniv.ac.in

REQUIRED TEXT BOOKS: 1. RICHARD F.GILBERG AND BEHROUZAN DATA STRUCTURES A Pseudo code Approach with C++, THOMAS ASIA, 2005. REFERENCE BOOKS: 1. HERBERT SCHILDT The Complete Reference C++ Fourth Edition, TataMcGraw Hill Edition 2003. 2. YEDIDYAH LANGSAN, MOSHE J. AUGENSTEIN AND AORON M. TANENBAUM Data Structures using C and C++, Prentice-Hall of India Pvt Ltd, 2004. 3. SARTAJ SAHNI Data Structures, Algorithm and Application in C++, McGraw-Hill International Edition, 2000. 4. MARK ALLEN WEISS, Data Structures and Algorithm Analysis in C++, Addison-Wesley Publishing Company, 1994. 5. AHO, HOPCROFT, ULLMAN Data Structures and Algorithms Pearson Education 1983.

6. JEAN PAUL TREMBLAY & PAUL SORENSON An Introduction to Data Structures with Apllications TMH 1984. WEB RESOURCES http://www.cmpe.boun.edu.tr/~akin/cmpe223/homepage.htm http://www.csie.ndhu.edu.tw/~rschang/dscontent.htm PREREQUISITE: NIL OBJECTIVES 1. 2. 3. 4. 5. Exposure to several data structures concept like stacks, queues, linked list, trees and graph. Gain better insight into linear and nonlinear data structures. Exposure to various sorting and searching techniques. Emphasize the applications of data structures. Good understanding of problem solving using data structure tools and techniques.

Assessment Details Cycle Test I Surprise Test I Cycle Test II Surprise Test II Model Exam TEST SCHEDULE S.No. 1 2 3 DATE TEST Cycle Test - I Cycle Test - II Model Exam TOPICS Unit I & II Unit III & IV All 5 units DURATION 2 periods 2 periods 3 Hrs : : : : : 10 Marks 8 Marks

10 Marks 7 Marks

15 Marks

OUTCOMES
Students who have successfully completed this course will have full understanding of the following concepts Course outcome Program outcome To understand several data structure concepts like stacks, queues, linked list, trees and files Application of data structures Problem solving using data structure tools and techniques Master a variety of advanced Abstract Data Type (ADT) and data structures and their implementations. Master different algorithm design techniques (Brute-force, divide and conquer, greedy, etc.) Basic ability to analyze algorithms and to deter mine algorithm correctness and time efficiency class

Ability to apply and implement learned algorith m design techniques and data structures to solve problems.

DETAILED SESSION PLAN

INTRODUCTION Introductory concept of C++ - Data types Control Structures Definition of Data Structures and algorithm The Abstract Data Type Algorithm Efficiency Searching List Structures Hashed List Structures Implementation Case Studies. Sessi Time Teaching on Topics to be covered Ref Testing Method (min) Method No. Definition of Data Structure and Group discussion 1 50 1 BB Algorithm Quiz Objective type test 2 Pseudocode 50 1 BB Quiz Quiz 3 Abstract Data Type 50 1 BB Quiz 4 Algorithm Efficiency 50 1 BB Quiz 5 Linear Search 50 1 BB Quiz 6 Binary Search 50 1 BB Objective type test Quiz, Assignment 7 List Structures 50 1 BB Group discussion Hashed List Structures 50 1 BB 8 Comparative study Group discussion 9 Hashing Methods 50 1 BB Comparative study LINKED LIST Linear and Linked List concepts Linked List Algorithms Processing a Linked List List Application Complex Linked List Structures Implementation Case Studies. Quiz 10 Linear and Linked List - Concept 50 1 BB Linked List Algorithms Quiz 11 50 1 BB Brain storming Linked List Algorithms Quiz 12 50 1 BB Surprise Test Processing Linked Lists Group discussion 13 50 1 BB Quiz Processing Linked Lists Group discussion, 14 50 1 BB Quiz List Applications Quiz, Assignment 15 50 1 BB 16 17 18 Complex Linked List Complex Linked List Implementation 50 50 50 1 1 1 BB BB BB Quiz Group discussion Quiz Quiz Brain storming

STACKS AND QUEUES Stacks: Basic Operations Linked List Implementation Applications Stack ADT Array Implementation Queues: Operations Linked List Design Implementation Case study Overflow and Underflow of Stack size

19 20 21 22 23 24 25 26 27

Stack Basic Operations Linked List Implementation Applications Stack ADT Array Implementation Queue Operations Linked List Design Implementation Overflow and Underflow of Stack Size

50 50 50 50 50 50 50 50 50

1 1 1 1 1 1 1 1 1

BB BB BB BB BB BB BB BB BB

Quiz Group discussion Quiz Group discussion Quiz, Comparative study Quiz Surprise Test Quiz Group discussion Quiz Comparative study Quiz Group discussion Quiz Quiz Brain storming

TREES AND GRAPHS TREES: Basic Tree Concept Binary Trees Tree Traversals General Trees Search Trees: Binary Search Trees AVL Trees GRAPHS: Operations - Depth First Traversal Breadth First Traversal Implementation Storage Structures Case Studies Group discussion 28 Basic Tree Concepts 50 1 BB Assignment Group discussion 29 Binary Trees 50 1 BB Quiz Group discussion 30 Tree Traversals 50 1 BB Assignment Group discussion 31 General Trees, AVL Trees 50 1 BB Assignment Objective type test 32 Search Trees Binary Search 50 1 BB Quiz Group discussion Quiz 33 Graph Operations 50 1 BB Group discussion Comparative study Objective type test 34 Depth First Traversal 50 1 BB 35 36 37 Breadth First Traversal Implementation Storage Structures 50 50 50 1 1 1 BB BB BB Objective type test Quiz Group discussion Objective type test

SORTING CONCEPTS General Sort Concepts Insertion Sort Shell Sort Heap Sort Exchange Sort Bubble Sort Quick sort Case Studies 38 General Sort Concepts 50 1 BB Group discussion Group discussion 39 Insertion Sort 50 1 BB Comparative study 40 Shell Sort 50 1 BB Objective type test

41 42 43 44 45

Selection Sort Heap Sort Exchange Sort Bubble Sort Quick Sort

50 50 50 50 50

1 1 1 1 1

BB BB BB BB BB

Comparative study Brain storming Brain storming Surprise test Comparative study Assignment Comparative study Assignment

BB Black Board PP Power Point