Department of Computer Science and Technology 2013040020102: Advance Data Structure & Analysis of Algorithms

Ms. Chetana Tailor Page 1

Unit No. ofLecture

Topic ReferenceChapter/Additional

Reading

EvaluationParameters

1 [07] Stack & Queue

1.1 1 Overview of Data Structures (DS)#1-Page No.3-6

Quiz 1

1.2 1 Stack and Queues: Definition,Representation, Operation and Examples

(DS)#1-Page No.7-13

1.3 1 Circular Queue & its operation (DS)#1-Page No.16-17

1.4 1 Priority Queue & its operation (DS)#1-Page No.19-21

1.5 1 Double Ended Queue & its operations (DS)#2-Page No.29-33

1.6 1 Linked Stack & Linked Queue (DS)#2-Page No.42-45

1.7 1 Applications of Stack and Queue (DS)#1-Page No.7-13

2 [07] Linked Lists

2.1 2 Single Linked List (DS)#7-Page No. 192-207

Unit test 1

2.2 2 Circular Linked List (DS)#7-Page No. 192-207

2.3 2 Double Linked List (DS)#10-Page No.267-272

2.4 1 Application of Linked Lists (DS)#10-Page No.273-277

3 [10] Tree

3.1 2 Binary Tree and it’s Representation (DS)#13-Page No.395-397

Quiz 2

3.2 3 Binary Tree: Insertion, Traversals (DS)#13-Page No.397-405

3.3 1 Binary Tree: Deletion and Merging (DS)#13-Page No.409-410

3.4 3 Types of Binary Trees: Expression, Heap,Threaded, Decision Tree

(DS)#13-Page No.412-416

3.5 1 Trees and Forest (DS)#12-Page No.370-378

4 [08] Sorting

4.1 1 Bubble sort (DS)#13-Page No.395-397

Unit test 2

4.2 2 Insertion sort, Selection sort (DS)#13-Page No.397-405

4.3 2 Shell sort (DS)#13-Page No.409-410

4.4 1 Heap sort (DS)#13-Page No.412-416

4.5 2 Quick sort (DS)#13-Page No.412-416

Department of Computer Science and Technology 2013040020102: Advance Data Structure & Analysis of Algorithms

Ms. Chetana Tailor Page 2

5 [06] Searching

5.1 2 Linear Search with Array and Linked List (DS)#20-Page No.579-582

Unit test 3

5.2 1 Binary Search (DS)#22-Page No.647-648

5.3 1 Binary Search Tree (DS)#22-Page No.648-655

5.4 2 B Tree and B+ Tree Indexing (DS)#22-Page No.658-674

6 [10] Algorithmic Strategies

6.1 1 Role of Algorithms in Computing (TCRC)#1-Page No. 5-12

Assignment

6.2 1 Analyzing, Designing and Complexity ofAlgorithms

(TCRC)#2-Page No.15-36

6.3 1 Growth of Functions (TCRC)#3-Page No.41-48

6.4 2 Divide and Conquer (TCRC)#2-Page No.28-36

6.5 2 Dynamic Programming (TCRC)#15-Page No.323-349

6.6 3 Greedy Algorithms, Back Tracking (TCRC)#16-Page No.370-383

Text Book:1. Debasis Samanta, Classic Data Structures, PHI – [DS].2. Thomas, Charles, Ronald and Clifford, Introduction to Algorithms, PHI – [TCRC].

Reference Books:1. Aho, Hopcroft, and Ulman, Data Structures and Algorithms, Pearson Education.2. Cormen, Introduction to Algorithm, Prentice Hall.3. Lipschutz, Vijaylaxmi, Data Structure, Tata McGraw Hill.4. Gopal, Magnifying Data Structure, Prentice Hall.5. Tremblay, and Sorenson, An Introduction to Data Structures with Applications, Tata McGraw

Hill.