SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN Course Code : CS0201 Course Title : Data Structures using C++ Semester : III Course Time : JUL DEC 2011 DAY SECTION A B C D E Hour Timing Hour Timing Hour Timing Hour Timing Hour Timing 1 1 8.45-9.35 5 1.30-2.20 2 2 9.35-10.25 4,6 11.25-12.15 2.20-3.10 4 11.25-12.15 2,4 9.35-10.25 11.25-12.15 8.45-9.35 10.35-11.25 3 1,3 3,7 2 9.35-10.25 10.35-11.25 3.10-4.00 4 3 10.35-11.25 6 2.20-3.10 1 8.45-9.35 5 4 11.25-12.15 2 9.35-10.25 5 1.30-2.20 3 10.35-11.25 Location : S.R.M.E.C Tech Park Faculty Details SEC NAME OFFICE OFFICE HOUR MAIL ID A Mr.M.Arul Prakash Tech Park(706A) Monday - Friday arulprakashm@ktr.srmuniv.ac.in B Mrs.R.vidhya Tech park806a Monday - Friday vidhyar@ktr.srmuniv.ac.in c Mrs. P.Girija Tech park 8 th Floor Monday - Friday girija@ktr.srmuniv.ac.in D Mr. T.Balachander Tech Park 7 th Floor Monday - Friday balachandert@ktr.srmuniv.ac.in E Ms.Sulochana Required Text Books: 1. RICHARD F.GILBERG AND BEHROUZ A.FOROUZAN DATA STRUCTURES A Pseudo code Approach with C++, THOMAS ASIA, 2005. Reference Books: 1. HERBERT SCHILDT The Complete Reference C++ Fourth Edition, TataMcGraw Hill Edition2003. 2. YEDIDYAH LANGSAN, MOSHE J. AUGENSTEIN AND AORON M. TANENBAUM DataStructures using C and C++, Prentice-Hall of India Pvt Ltd, 2004. 3. SARTAJ SAHNI Data Structures, Algorithm and Application in C++, McGraw-Hill InternationalEdition, 2000. 4. MARK ALLEN WEISS, Data Structures and Algorithm Analysis in C++, Addison-WesleyPublishing Company, 1994. 5. AHO, HOPCROFT, ULLMAN Data Structures and Algorithms Pearson
Education 1983. 6. JEAN PAUL TREMBLAY & PAUL SORENSON An Introduction to Data Structures withapllications 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. Exposure to several data structures concept like stacks, queues, linked list, trees and graph. 2. Gain better insight into linear and nonlinear data structures. 3. Exposure to various sorting and searching techniques. 4. Emphasize the applications of data structures. 5. Good understanding of problem solving using data structure tools and techniques. Assessment Details Cycle Test I : 10 Marks Surprise Test I : 5 Marks Cycle Test II : 10 Marks Model Exam : 20 Marks Attendance : 5 Marks Test Schedule S.No. DATE TEST TOPICS DURATION 1 Cycle Test - I Unit I & II 2 class Hrs 2 Cycle Test - II Unit III & IV 2 class Hrs 3 Model Exam All 5 units 3 Hrs
Outcomes Students who have successfully completed this course will have full understanding of the following concepts Course 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 Program outcome Basic ability to analyze algorithms and to deter mine algorithm correctness and time efficiency class Master a variety of advanced Abstract Data Type (ADT) and data structures and their mplementations. Master different algorithm design techniques (Brute-force, divide and conquer, greedy, etc.) Ability to apply and implement learned algorith m design techniques and data structures to solve problems Detailed Session Plan UNIT-I :- 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. Session No. 1 Topics to be covered Definition of Data Structure and Algorithm Time (min) Ref Teaching Method 2 Pseudo Code 3 Abstract Data Type 4 Algorithm Efficiency 5 Linear Search Testing Method 6 Binary Search
7 List Structures, 8 Hashed List Structures 9 Hashing Methods UNIT-II :- LINKED LIST Linear and Linked List concepts Linked List Algorithms Processing a Linked List List Application Complex Linked List Structures Implementation Case Studies. 10 Linear and Linked List - Concept 11 12 13 14 15 16 Linked List Algorithms Linked List Algorithms Processing Linked Lists Processing Linked Lists List Applications Complex Linked List 17 Complex Linked List Surprise Test,, Implementation 18 UNIT-III :- 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 Stack Basic Operations Linked List Implementation Applications Stack ADT Array Implementation Queue Operations, Comparative study Surprise Test
Linked List Design 25 26 Implementation Overflow and Underflow of Stack Size 27 UNIT-IV :- 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 28 Basic Tree Concepts 29 Binary Trees 30 Tree Traversals 31 General Trees, AVL Trees 32 Search Trees Binary Search 33 Graph Operations 34 Depth First Traversal 35 Breadth First Traversal 36 Implementation 37 Storage Structures UNIT- V :- SORTING CONCEPTS General Sort Concepts Insertion Sort Shell Sort Heap Sort Exchange Sort Bubble Sort Quick sort Case Studies 38 General Sort Concepts 39 Insertion Sort 40 Shell Sort 41 Selection Sort 42 Heap Sort 43 Exchange Sort Surprise test
44 Bubble Sort 45 Quick Sort BB Black Board PP Power Point