DR.B.R.

AMBEDKAR INSTITUTE OF TECHNOLOGY PORT BLAIR

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

LESSON PLAN

SUBJECT: DATA STRUCTURES SEMESTER:

III

FACULTY: COMPUTER SCIENCE & ENGINEERING SESSION: 2013 - 2014

PREPARED BY: Mr. AMIT ALOK HERENZ

DR.B.R.AMBEDKAR INSTITUTE OF TECHNOLOGY, Pahargaon

Department of Computer Science & Engineering

WEEKLY SCHEDULE FOR SYLLABUS COVERAGE

Faculty: SEM: III COMPUTER SUBJECT CODE: CS T35

Subject: DS

L P T(CUR) 4 37

L P T (WEEK) L P T(SEM) 4 3 7 67 54 121

Name of the Lecturer: Mr. Amit Alok Herenz

General Objectives: The primary objective of this course is to provide the student with an advanced treatment of computer programming with an emphasis on design and implementation of abstract data structures.

Specific Objectives: On completion of this subject, the students will be able to:

1. Write complex applications using structured programming methods. 2. Demonstrate understanding of the abstract properties of various data structures such as stacks, queues, lists, and trees. 3. Use various data structures effectively in application programs. 4. Implement various data structures in more than one manner. 5. Compare different implementations of data structures and to recognize the advantages and disadvantages of the different implementations. 6. Demonstrate understanding of various sorting algorithms, including bubble sort, insertion sort, selection sort, heap sort and quick-sort. 7. Compare the efficiency of various sorting algorithms in terms of both time and space. 8. Program multiple file programs in a manner that allows for reusability of code. 9. Trace and code recursive functions.

Reference books: 1. ISRD Group New Dehli, Data Structure Using C, Tata Magraw Hill Publishers 2. Tremblie and Sorrenson, Data Structures, TMH Publications. 3. Lafore, Teach Yourself data Structure and Algorithms in 24 Hrs., BPB Publication,New Dehi

WEEK MAP FOR DATA STRUCTURE

REMARKS 1st Week 17,18,19,21 2nd Week 24,25,26,28,29 Classes starting from 17th JULY onwards No. of classes Total Classes available = 09 conducted = 3rd 4TH Week 5TH Week Week 1,2,3,5,6 8,9,10,12 15,16,17,19,20 5 4 5 6TH Week 22,23,24,26 4 8TH Week 29,30,31 3

4 JUNE

JULY

No. of classes Total Classes available = 21 conducted = 8TH 9TH Week 10TH Week Week 2,3 5,6,7 12,13,14,16,17 2 3 5 11TH Week 19,20,21,23 4 12th Week 26,27,30,31 4

AUGUST

No. of classes Total Classes available = 18 conducted = 16th Week 23,24,25,27 4 17th Week 30 1

13TH 14th Week 15th Week Week 2,3,4,6,7 9,10,11,13 17,18,20,21 5 4 4 SEPTEMBER

No. of classes Total Classes available = 18 conducted =

WEEK/ DATE

WEIGHTAGE AS PER CONCERNED STAFF TOPIC TO BE COVERED

INFORMATION STATUS REGARDING LR TO REGARDING CT/ST/ & BE USED PORTION STUDENT COVERAGE SEMINAR

WEEK 1 17/06/13 18/06/13 19/06/13 21/06/13 UNIT-1 Introduction Algorithmic notation Programming Principles Creating Programs Analyzing Programs Arrays PERIOD :11 One dimensional arrays Multidimensional arrays Pointer Arrays Searching Linear Search Binary Search Fibonacci Search Assignment

WEEK 2 24/06/13 25/06/13 26/06/13 28/06/13 30/06/13

WEEK 3 01/07/13 02/07/13

WEEK 3 03/07/13 05/07/13 06/07/13

WEEK 4 08/07/13 09/07/13 10/07/13 12/07/13 WEEK 5 15/07/11 16/07/13 ,17/06/13 UNIT-2 WEEK 4 1/08/12 Stacks Primitive operations Application of Stacks

3/08/12

Queues Primitive operations Priority Queues De Queues Applications

Assignment

WEEK 5 6/08/12 7/08/12 8/08/12 10/08/12 PERIOD :15

Linked Lists Singly Linked List Doubly Linked List Circular Linked List Linked Stacks Linked Queues Application of Linked Lists Dynamic Storage Management Generalized Lists Garbage Collection Compaction

WEEK 6 13/08/12 14/08/12 17/08/12

WEEK 7 21/08/12 22/08/12 24/08/12 25/08/12

WEEK 8 27/08/12 28/08/12

WEEK 8 31/08/12

WEEK 9 3/09/12 4/09/12 5/09/12 7/09/12 UNIT-3 Trees Binary Tree Terminology Representation of Trees Traversal Types Applications Graph

WEEK 10

10/09/12 11/09/12 12/09/12 14/09/12

PERIOD :13

Terminology Representation of Graphs Traversal Types Applications Spanning Trees Shortest Paths Transitive Closure Topological Sort Sets Representation Operations on Sets Application

Assignment

WEEK 11 17/09/12 18/09/12 19/09/12 21/09/12

WEEK 12 24/09/12 25/09/12 26/09/12 28/09/12 UNIT-4 Tables Rectangular Tables Jagged Tables Inverted Tables Symbol Tables Static Tree Tables Dynamic Tree Tables Hash Table Sorting Techniques Internal Sorting Insertion Sort Selection Sort Shell Sort Bubble Sort Quick Sort Heap Sort Merge Sort Radix Sort External Sorting External Storage Devices Sorting with tapes and Disks WEEK 15 15/10/12 16/10/12 17/10/12

WEEK 13 1/10/12 3/10/12 5/10/12

WEEK 14 08/10/12 09/10/12 10/10/12 12/10/12 PERIOD :14

Assignment

WEEK 15 19/10/12

WEEK 16 22/10/12 26/10/12

WEEK 17 29/10/12 30/10/12 31/10/12 02/11/12 PERIOD :13

UNIT-5 Files Queries Sequential Organization Index Techniques B Trees B Tree Indexing Operations on a B Tree Lower and upper bounds of a B Tree B + Tree indexing Trie Tree indexing

Assignment

WEEK 18 05/11/12 06/11/12 07/11/12 09/11/12

WEEK 16 12/11/12 14/11/12

F.I (COMPUTER) SIGN OF LECTURER

BEN

DR. B. R. AMBEDKAR INSTITUTE OF TECHNOLOGY DEPARTMENT OF COMPUTER ENGINEERING PRACTICAL SCHEDULE

Faculty: Computer Semester: III Name of the Lecturer: Ms. Jayeeta Nayak

Subject: DS

MM-Internal: 50

MM-External: 50

Name of the Lab Tech:

S. No

Name of the students

Month

JULY

AUGUST

SEPTEMBER OCTOBER NOVEMBER 1 8 15

Date 12 19 26 2 9 16 23 30 6 13 20 27 04 11 18 1 1 2 2 2 3 3 4 5 6 7 8 8 9 9

10 11 12

ALL STUDENTS

Approved by F.I. :

Prepared by Lecturer: