Shivalik Institute of Engineering & Technology Lecture Plan

Odd Semester Teaching Schedule: D.S Marks Theory Sessionals Name of Teacher: Mr Mukesh Dawar Proposed Lectures to be delivered
100 50 46

Mix of Class Test, Quizzes, Assignments, Activities Class Attendance Sessional marks

20 20 10

Lecture Topic Number L1 Introduction to Data Structures

References Schaums series & written notes --do --do --do --do --do --do --do --do --do --do --do

Tentative dates 3-8-2011 to 10-82011

Actual dates

L2 L3 L4 L5 L6 L7 L8 L9 L10 L11 L12 L13

Definition & abstract data types Static and Dynamic implementations Examples and real life applications; built in data structures user defined data structures Ordered list and Operations Arrays: Definition & examples Implementation, lower bound, upper bound addressing an element at a particular index for one dimensional arrays Two dimensional arrays and Multi-dimensional arrays. Implementation of Data Structures Record, Union, Sparse matrices : implementation of transpose. Stacks : Sequential implementation of stacks operations, Polish-notations, Evaluation of postfix expression

11-8-11 to 18-811

19-8-2011 to 268-11

L14 L15 L16

Converting Infix expression to Prefix and Postfix expression, Applications. Converting Infix expression to Prefix and Postfix expression, Applications continue. Queues: Definition, Sequential implementation of linear queues Operations. Circular queue implementation (using arrays), Advantage over linear queue, Priority queues & Applications. Linked Lists :Need of dynamic data structures continuous & linked implementation of lists Operations on lists. Dynamic implementation of linked lists Operations. Comparison between Array and Dynamic Implementation of linked list Linked implementation of stacks and queues Circular lists, implementation of primitive operations Doubly linked lists : continuos & dynamic implementation, operations Trees : Definition, Basic terminology Binary tree, Array and Dynamic Implementation of a binary tree primitive operations on binary trees. External and internal nodes. Binary tree traversals : preorder, inorder and postorder traversals Binary tree traversals : preorder, inorder and postorder traversals Representation of infix, postifix and prefixexpressions using

--do --do Schaums series & written notes --do --do --do --do --do --do --do 29-8-2011 to 2-911

L17 L18 L19 L20 L21 L22 L23

5-9-11 to 12-9-11

L24 L25 L26 L27

--do --do --do Schaums series & written notes --do --do --do --do --do

13-9-11 to 20-911

L28 L29 L30 L31 L32

21-9-11 to 28-911

L33 L34 L35 L36 L37

trees Representation of lists as binary trees. Introduction to Binary Search Trees B trees, B+ trees , AVL Trees threaded trees, balanced multi way search trees Graphs :Definition of undirected & Directed Graphs & Networks

--do --do --do --do Schaums series & written notes --do

29-9-11 to 6-1011

L38 L39 L40 L41 L42 L43 L44 L45 L46 1. 2. 3. 4.

Basic terminology, Representation of graphs Graph traversals and spanning --do forests minimum-spanning trees, --do computer representation of graphs Tables : Definition, Hash --do Functions Implementation & --do Applications. Sorting & Searching : Basic --do Searching techniques (Linear & binary) Introduction to Sorting. --do Sorting using selection, insertion, bubble, merge quick, radix, heap sort --do ASSIGNMENTS Record, Union, Sparse matrices Implementation of transpose. Linked implementation of stacks and queues B trees, B+ trees, threaded trees, balanced multi way search trees Tables:Definition, Hash Functions

7-10-11 to 14-1011

17-10-11 to 2510-11

12-8-11 14-9-11 30-9-11 10-10-11