Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Labs

Course No Cours Title Course Planner Lectures Tutorial Practical Credits

CSE205 DATA STRUCTURES 11267 :: JASPREET KAUR 4 0 0 4

Text Book: 1 Schaum Outline series by: Seymour Lipschutz, Publishers: Tata McGraw Hill, New Delhi,Year of Publication:2006

Other Specific Book:

2 Yashwant P kanetkar kanitkar,Title:Let Us C

3 Adam Drozdek, Data Structure & Algorithms in C++. Thomson

4 Kruse, Data Structures & Program design, Prentice Hall of India, New Delhi

5 Tenenbaum, Augenstein, & Langsam, Data Structures using C and C++, Prentice Hall of India, New Delhi.

Other Reading

Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference)

6 http://projects.csail.mit.edu/jacm/jacm80.html
7 http://bryanpendleton.blogspot.com/2010/06/distributed-data-structures.html
8 http://comjnl.oxfordjournals.org/content/28/1/44.short
9 http://onlinelibrary.wiley.com/journal/10.1002/%28ISSN%291097-0118
10 http://www1.cs.columbia.edu/~sanders/graphtheory/writings/journals.html
11 http://www.emba.uvm.edu/~jgt/
12 http://www.informatik.uni-trier.de/~ley/db/journals/jgt/jgt48.html

Relevant Websites

1 Approved for Spring Session 2010-11

Sr. No. (Web adress) (only if relevant to the courses) Salient Features
13 http://en.wikipedia.org/wiki/Array_data_structure Arrays in data structures
14 http://www.java2s.com/Code/Cpp/Pointer/Pointer-Array.htm Pointer Arrays
15 http://en.wikipedia.org/wiki/Linked_list Linked List
16 http://en.wikipedia.org/wiki/Stack_(data_structure) Stacks
17 http://en.wikipedia.org/wiki/Queue_(data_structure) Queues
18 http://www.cmpe.boun.edu.tr/~akin/cmpe223/chap2.htm Stacks and Queues
19 http://www.cs.auckland.ac.nz/~jmor159/PLDS210/recursion.ht Recursion
ml
20 http://en.wikipedia.org/wiki/Binary_tree Binary Tree
21 http://en.wikipedia.org/wiki/Binary_search_tree Binary Search tree
22 http://xw2k.nist.gov/dads//HTML/binarySearchTree.html Binary search Tree
23 http://isg.cs.tcd.ie/giangt/Heaps.pdf Heap
24 http://hamilton.bell.ac.uk/swdev2/notes/notes_18.pdf Graphs
25 http://hamilton.bell.ac.uk/swdev2/notes/notes_17.pdf Hashing
26 http://en.wikipedia.org/wiki/Hash_table Hash Table
27 http://www.google.co.in/url? Hashing ppt
sa=t&source=web&cd=1&ved=0CBUQFjAA&url=http%3A%2F
%2Fwww.cs.sjsu.edu%2F~lee%2Fcs157b
%2FHashing.ppt&rct=j&q=hashing%20in%20data
%20structure%20ppt&ei=jUK0TIn0F4GivQOjtoCmCg&us
28 http://www.google.co.in/url? Searching and sorting
sa=t&source=web&cd=1&ved=0CBUQFjAA&url=http%3A%2F
%2Fwww.macs.hw.ac.uk%2F~bpalmer
%2FDSA1%2FLectures%2FWeek%25204%2520Searching
%2520and%2520sorting.ppt&rct=j&q=searching%20an

Detailed Plan For Lectures

Week Number Lecture Number Lecture Topic Chapters/Sections of Homework to be Assigned Pedagogical tool
Textbook/other to students Demonstration/case
reference study/images/anmatio
n ctc. planned

2 Approved for Spring Session 2010-11

 Part 1
Week 1 Lecture 1 Basic Concepts and notations: data structures and ->Reference
data structure operations :1,Chapter1 1.1 1.2 1.4
Lecture 2 Basic data structures such as arrays, stack and ->Reference
queues and their applications, linked and sequential :1,Chapter1 1.3
representation
Lecture 3 Complexity Analysis: Mathematical notation and ->Reference
functions, algorithmic complexity and time space :1,Chapter1 1.5
tradeoff ->Reference
:1,Chapter2 2.1-2.4
Lecture 4 Big O Notation, The best, average & Worst cases ->Reference
analysis of various algorithms to be studied :1,Chapter2 2.5
throughout the course
Week 2 Lecture 5 Arrays: Linear array Representation & traversal of ->Reference Arrays.ppt
Linear array :1,Chapter4 4.1-4.3
Lecture 6 Operations on linear array: Insertion, Deletion ->Reference
:1,Chapter4 4.5
Lecture 7 Multidimensional Arrays ->Reference multidimensional_array.
:1,Chapter4 4.9 ppt
Lecture 8 Records: Records ,Record Structures ->Reference HomeWork 1 Allocation
:1,Chapter4 4.11-4.12
Week 3 Lecture 9 Pointer Arrays: Arrays of Pointers and Dynamic ->Reference
Memory Management :1,Chapter4 4.10
Lecture 10 Pointer Arrays: Arrays of Pointers and Dynamic
Memory Management
Lecture 11 usage of pointers, Memory management functions ->Reference :2, Chap- pointers.ppt
5
Lecture 12 usage of pointers, Memory management functions Term Paper 1 Allocation

Week 4 Lecture 13 debugging pointers ->Reference :2,Let us

C Chap-5

Part 2
Week 4 Lecture 14 Linked list: representation, traversal ->Reference linked_list.ppt
:1,Chapter5 5.1-5.4
Lecture 15 Searching: search in Sorted, Unsorted link list ->Reference
:1,Chapter5 5.5
Lecture 16 Searching: search in Sorted, Unsorted link list HomeWork 1 Submission

3 Approved for Spring Session 2010-11

Week 5 Lecture 17 Insertion in linked list ->Reference HomeWork 2 Allocation
:1,Chapter5 5.7
Lecture 18 deletion from a link list ->Reference
:1,Chapter5 5.8
Lecture 19 Header Link List: Operation on header link list ->Reference
:1,Chapter5 5.9
Lecture 20 Circular link list circular_linked_list.ppt

Week 6 Lecture 21 Two way /multi linked structures: Traversing, ->Reference

Searching :1,Chapter5 5.10
Lecture 22 Insertion, Deletion in Two way /multi linked
structures
Lecture 23 Stacks: : Representation in memory, traversal . ->Reference
:1,Chapter6 6.1-6.2
Lecture 24 Basic operations on stacks. ->Reference HomeWork 2 Submission stacks.ppt
:1,Chapter6 6.3-6.4
Week 7 Lecture 25 Applications of Stacks: Polish Notations ->Reference
:1,Chapter6 6.5
Lecture 26 Queue: Representation in memory ->Reference
:1,Chapter6 6.10-6.11
Lecture 27 Basic operations queues,Various types of Queues. ->Reference Queues.ppt
:1,Chapter6 6.12-6.13
Lecture 28 Recursion: Definition, Function Call & Recursion ->Reference Recursion.ppt
implementation(Only Tower of Honai), complexity :1,Chapter6 6.7-6.8
issues
MID-TERM
Part 3
Week 8 Lecture 29 Trees: Trees-definitions and basic concepts ->Reference
:1,Chapter7 7.1-7.2
Lecture 30 Representations of trees in memory ->Reference
:1,Chapter7 7.3
Lecture 31 Binary trees Binary_trees.ppt

Lecture 32 Binary tree traversal ->Reference HomeWork 3 Allocation

:1,Chapter7 7.4-7.5
Week 9 Lecture 33 Binary search tree: Search and insertion in BST ->Reference
:1,Chapter7 7.7-7.8
Lecture 34 Deletion in BST ->Reference
:1,Chapter7 7.9

4 Approved for Spring Session 2010-11

Week 9 Lecture 35 Heap and Heap Sort algorithms ->Reference heap.ppt
:1,Chapter7 7.17
Lecture 36 Heaps as priority Queues

Week 10 Lecture 37 Graph: Graphs and their applications ->Reference

:1,Chapter8 8.1-8.2
Lecture 38 Representation and terminology of graphs ->Reference graphs.ppt
:1,Chapter8 8.38.5
Lecture 39 Traversing a graph ->Reference
:1,Chapter8 8.7

Part 4
Week 10 Lecture 40 Algorithm for shortest distance; Warshall’s algorithm ->Reference HomeWork 3 Submission
:1,Chapter8 8.4
Week 11 Lecture 41 Breadth first search and Depth first search ->Reference HomeWork 4 Allocation
:1,Chapter8 8.7
Lecture 42 Hashing: Hash tables ->Reference Term Paper 1 Submission Hashing.ppt
:1,Chapter9 9.9
Lecture 43 various types of hashing functions Hashing_functions.ppt

Lecture 44 various types of hashing functions

Week 12 Lecture 45 Searching and Sorting: Use of various data ->Reference

structures for searching and sorting :1,Chapter9 9.1-9.2
Lecture 46 Linear and Binary Search Algorithm ->Reference
:1,Chapter4 4.7-4.8
Lecture 47 Insertion Sort and Selection sort ->Reference Sorting.ppt
:1,Chapter9 9.3-9.4
Lecture 48 Merge Sort, Radix Sort ->Reference HomeWork 4 Submission sorting.ppt
:1,Chapter9 9.59.7
Week 13 Lecture 49 Quick Sort ->Reference
:1,Chapter6 6.6
Lecture 50 Bubble Sort ->Reference
:1,Chapter4 4.6
Lecture 51 Heap Sort ->Reference
:1,Chapter7 7.17
Lecture 52 Complexity of various searching and sorting ->Reference
algorithms :1,Chapter9 9.1-9.7

5 Approved for Spring Session 2010-11

 Spill Over
Week 14 Lecture 53 Far pointers
Lecture 54 Abstract data Structure
Lecture 55 Use of queues in Operating system
Lecture 56 Kernel data Structure

Details of homework and case studies

Homework No. Topic of the Homework Nature of homework
(group/individuals/field work
Homework 1 Includes problems related to data structure complexity, arrays Individual
Homework 2 Includes problems related to Records and structures, pointers , Memory management and it’s functions, Individual
Link List representation
Homework 3 Includes problems related to Linked List operations, Stack operations, Queues operations, Recursion Individual
Homework 4 Includes problems related to Trees, Trees operations ,BST and it’s operations, Heap and heap sort Individual

Scheme for CA:out of 100*

Component Frequency Out Of Each Marks Total Marks
Term Paper 1 25 25
Homework 3 4 7 21
Class test based on homework 3 4 18 54

Total :- 50 100

* In ENG courses wherever the total exceeds 100, consider x best out of y components of CA, as explained in teacher's guide available on the
UMS

List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)

Sr. No. Topic

1 AVL trees and it’s operations .Comparisons with other trees and uses
2 Analysis of algorithms of search engines

6 Approved for Spring Session 2010-11

 3 In depth comparisons of all sorting algorithms and considering the cases in which a particular sorting
4 Role of data structure in graphics and artificial intelligence
5 Simulation of Scheduling Algorithms
6 Design of an Editor
7 Implementation of Computer Dictionary
8 Implementation of Telephone Directory
9 Implementation of Address Book
10 Role of Data Structures in Programming languages
11 Role of Data Structures in Compiler Design
12 Data Management In a Digital Computer
13 Design of a New Data Structure
14 Compare the practical performance of Fibonacci heaps and binary heaps.
15 Hash, use shift-folding snip

7 Approved for Spring Session 2010-11