avs1
TRANSCRIPT
SRM UNIVERSITYFACULTY OF ENGINEERING AND TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERINGCOURSE PLAN
Course Code : CS0201Course Title : Data Structures using C++Semester : IIICourse Time : Jan – May 2009
DaySECTION
A B C D EHour Timing Hour Timing Hour Timing Hour Timing Hour Timing
Monday 2 9.20 – 10.10 3 10.20–
11.10 1 8.30-9.20 1 8.30 -
9.20 2 9.20 – 10.10
Tuesday - - - - 4 11.10-12.00 - - - -
Wednesday 1 8.30 – 9.20 6 2.20-
3.10 - - 2 9.20 – 10.10 1 8.30 –
9.20
Thursday 7 3.10 –4.00 3 10.20-
11.10 2 10.20-11.10 2,6
9.20 – 10.10,2.20
– 3.107 3.10 –
4.00
Friday 5 1.30 –2.20 6 2.20-
3.10 2 10.20-11.10 - - 5 1.30 –
2.20
LOCATION: S.R.M.E.C – Tech Park
FACULTY DETAILSSec. Name Office Office hour Mail id
A D.Manikandan Hi-Tech Block Monday to Friday [email protected]
B Mr.S.Ganesh kumar ITPARK Block Monday - Friday [email protected]
C Ms.G.Abirami Tech Park Monday to Friday [email protected]
D Ms. Sasi Rekha Sankar
Hi-Tech Block Monday to Friday [email protected]
E N.Snehalatha Hi-Tech Block Monday to Friday [email protected]
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 RESOURCEShttp://www.cmpe.boun.edu.tr/~akin/cmpe223/homepage.htmhttp://www.csie.ndhu.edu.tw/~rschang/dscontent.htm
PREREQUISITE: NIL OBJECTIVES1. 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 : 8 Marks
Cycle Test – II : 10 Marks
Surprise Test – II : 7 Marks
Model Exam : 15 Marks
TEST SCHEDULE
S.No. DATE TEST TOPICS DURATION1 Cycle Test - I Unit I & II 2 periods2 Cycle Test - II Unit III & IV 2 periods3 Model Exam All 5 units 3 Hrs
OUTCOMES Students who have successfully completed this course will have full understanding of the following
conceptsCourse 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
Basic ability to analyze algorithms and to determine algorithm correctness and time efficiency class
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.)
Ability to apply and implement learned algorithm design techniques and data structures to solve problems.
DETAILED SESSION PLAN
INTRODUCTIONIntroductory 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
on No.
Topics to be covered Time(min) Ref Teaching
Method Testing Method
1 Definition of Data Structure and Algorithm 50 1 BB Group discussion
Quiz
2 Pseudocode 50 1 BB Objective type testQuiz
3 Abstract Data Type 50 1 BB Quiz4 Algorithm Efficiency 50 1 BB Quiz5 Linear Search 50 1 BB Quiz
6 Binary Search 50 1 BB QuizObjective type test
7 List Structures 50 1 BB Quiz, Assignment
8 Hashed List Structures 50 1 BB Group discussionComparative study
9 Hashing Methods 50 1 BB Group discussionComparative study
LINKED LISTLinear 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 50 1 BB Quiz
11 Linked List Algorithms 50 1 BB QuizBrain storming
12 Linked List Algorithms 50 1 BB QuizSurprise Test
13 Processing Linked Lists 50 1 BB Group discussionQuiz
14 Processing Linked Lists 50 1 BB Group discussion, Quiz
15 List Applications 50 1 BB Quiz, Assignment
16 Complex Linked List 50 1 BB QuizGroup discussion
17 Complex Linked List 50 1 BB Quiz
18 Implementation 50 1 BB QuizBrain storming
STACKS AND QUEUESStacks: Basic Operations – Linked List Implementation – Applications – Stack ADT – Array ImplementationQueues: Operations – Linked List Design – Implementation – Case study – Overflow and Underflow of Stack size
19 Stack – Basic Operations 50 1 BB QuizGroup discussion
20 Linked List Implementation 50 1 BB QuizGroup discussion
21 Applications 50 1 BB Quiz, Comparative study
22 Stack ADT 50 1 BB QuizSurprise Test
23 Array Implementation 50 1 BB QuizGroup discussion
24 Queue Operations 50 1 BB QuizComparative study
25 Linked List Design 50 1 BB QuizGroup discussion
26 Implementation 50 1 BB Quiz
27 Overflow and Underflow of Stack Size 50 1 BB QuizBrain storming
TREES AND GRAPHSTREES: 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 50 1 BB Group discussionAssignment
29 Binary Trees 50 1 BB Group discussionQuiz
30 Tree Traversals 50 1 BB Group discussionAssignment
31 General Trees, AVL Trees 50 1 BB Group discussionAssignment
32 Search Trees Binary Search 50 1 BBObjective type testQuizGroup discussion
33 Graph Operations 50 1 BBQuizGroup discussionComparative study
34 Depth First Traversal 50 1 BB Objective type test
35 Breadth First Traversal 50 1 BB Objective type test
36 Implementation 50 1 BB QuizGroup discussion
37 Storage Structures 50 1 BB Objective type test
SORTING CONCEPTSGeneral Sort Concepts – Insertion Sort – Shell Sort – Heap Sort – Exchange Sort – Bubble Sort – Quick sort – Case Studies38 General Sort Concepts 50 1 BB Group discussion
39 Insertion Sort 50 1 BB Group discussionComparative study
40 Shell Sort 50 1 BB Objective type test
Comparative study41 Selection Sort 50 1 BB Brain storming42 Heap Sort 50 1 BB Brain storming43 Exchange Sort 50 1 BB Surprise test
44 Bubble Sort 50 1 BB Comparative studyAssignment
45 Quick Sort 50 1 BB Comparative studyAssignment
• BB – Black Board• PP – Power Point