Professional Documents
Culture Documents
Format For Instruction Plan [for Courses with Lectures and Labs Course No CSE205 Course Category Cours Title DATA STRUCTURES Courses with conceptual focus / presentation component Course Planner 14594 :: Usha Mittal Lectures Tutorial Practical Credits 4 0 0 4
Text Book:
1 Schaum Outline series by: Seymour Lipschutz, Publishers: Tata McGraw Hill, New Delhi,Year of Publication:2006
2 Adam Drozdek, Data Structure & Algorithms in C++. Thomson 3 Yashwant P Kanetkar, Title: Let Us C
Other Reading Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference) 4 http://projects.csail.mit.edu/jacm/jacm80.html 5 http://bryanpendleton.blogspot.com/2010/06/distributed-data-structures.html 6 http://comjnl.oxfordjournals.org/content/28/1/44.short 7 http://onlinelibrary.wiley.com/journal/10.1002/%28ISSN%291097-0118 8 http://www1.cs.columbia.edu/~sanders/graphtheory/writings/journals.html 9 http://www.informatik.uni-trier.de/~ley/db/journals/jgt/jgt48.html Relevant Websites Sr. No. (Web adress) (only if relevant to the courses) 10 http://en.wikipedia.org/wiki/Array_data_structure 11 http://www.java2s.com/Code/Cpp/Pointer/Pointer-Array.htm 12 http://en.wikipedia.org/wiki/Linked_list 13 http://en.wikipedia.org/wiki/Stack_(data_structure) Salient Features Arrays in data structures Pointer Arrays Linked List Stacks
14 http://en.wikipedia.org/wiki/Queue_(data_structure) 15 http://www.cmpe.boun.edu.tr/~akin/cmpe223/chap2.htm
16 http://www.cs.auckland.ac.nz/~jmor159/PLDS210/recursion.ht Recursion ml 17 http://en.wikipedia.org/wiki/Binary_tree 18 http://en.wikipedia.org/wiki/Binary_search_tree 19 http://xw2k.nist.gov/dads//HTML/binarySearchTree.html 20 http://isg.cs.tcd.ie/giangt/Heaps.pdf 21 http://hamilton.bell.ac.uk/swdev2/notes/notes_18.pdf 22 http://hamilton.bell.ac.uk/swdev2/notes/notes_17.pdf 23 http://en.wikipedia.org/wiki/Hash_table Binary Tree Binary Search tree Binary search Tree Heap Graphs Hashing Hash Table
24 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 25 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 26 http://pw1.netcom.com/~tjensen/ptr/pointers.htm introduction to pointers
Part 1
Week 1 Lecture 1 Lecture 2 Basic concepts and notations, data structures and data structure operations Basic Data structures like arrays, linked list, stacks and queues etc. ->Reference :1,Ch 1 Sec 1.1 1.2 1.3 1.4 ->Reference :1,Ch 1 Sec 1.1 1.2 1.3 1.4 1.5
Week 1
Lecture 3
Complexity Analysis: Mathematical notation and functions, algorithmic complexity and time space trade off, Big O Notation The best, average & Worst cases analysis methodology Introduction to arrays, Representation of arrays in memory, traversing linear arrays. Operations on arrays: insertion and deletion Linear Search and Binary Search and analysis of their complexity Multidimensional Arrays, Pointers; Pointer Arrays Records; Records Structures, Representation of records in memory Dynamic memory management,Usage of pointers, memory management functions, debugging pointers Introduction to linked list, Representation in memory, Traversing of linked list
->Reference :1,Ch 2 sec 2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 ->Reference :1,Ch 2 sec 2.5 2.6 ->Reference :1,Ch 4 sec 4.1 4.2 4.3 4.4 ->Reference :1,Ch 4 sec 4.5 ->Reference :1,Ch 4 sec 4.7 4.8 ->Reference :1,Ch 4 sec 4.9 4.10 ->Reference :1,Ch 4 sec 4.11 4.12 ->Reference :3,Chapter 5 ->Reference :26 ->Reference :1,Ch 5 Sec 5.1 5.2 5.3 5.4 Term Paper Allotment multidimensional_array. ppt Arrays.ppt
Searching in sorted linked list and in unsorted linked ->Reference :1,Ch 5 list. Memory Allocation Sec 5.5 5.6 Insertion into linked list ->Reference :1,Ch 5 Sec 5.7
Part 2
Week 4 Lecture 14 Lecture 15 Lecture 16 Week 5 Lecture 17 Lecture 18 Lecture 19 Lecture 20 Deletion in linked list Header linked list and its operations Circular linked list and its operations ->Reference :1,Ch 5 Sec 5.8 ->Reference :1,Ch 5 Sec 5.9 ->Reference :1,Ch 5 Sec 5.9 circular_linked_list.ppt
Two way linked list, traversing and searching in two ->Reference :1,Ch 5 way linked list Sec 5.10 Insertion in two way linked list ->Reference :1,Ch 5 Sec 5.10 Allotment of mini project
Deletion in two way linked list. Applications of linked ->Reference :1,Ch 5 list. Sec 5.10 Conduct Test 1
Week 6
Introduction to stacks, sequential and linked representation of stacks. Stack Operations Applications of linked list: Arithmetic expressions; polish notation Applications of linked list: Arithmetic expressions; polish notation Definition of Recursion, Function Call & Recursion implementation & Complexity issues, Tower of hanoi
->Reference :1,Ch 6 sec 6.1 6.2 6.3 6.4 ->Reference :1,Ch 6 sec 6.5 ->Reference :1,Ch 6 sec 6.5 ->Reference :1,Ch 6 sec 6.7 6.8 ->Reference :1,Ch 6 sec 6.10 6.11 ->Reference :1,Ch 6 sec 6.12 6.13
stacks.ppt
Recursion.ppt Queues.ppt
Week 7
Introduction to Queues, Representation in memory, ->Reference :1,Ch 7 Operations on queues sec 7.1 7.2 7.3 7.4 Various types of queues and its applications ->Reference :1,Ch 7 sec 7.4
MID-TERM Part 3
Week 8 Lecture 29 Lecture 30 Lecture 31 Lecture 32 Week 9 Lecture 33 Lecture 34 Lecture 35 Lecture 36 Week 10 Lecture 37 Lecture 38 Lecture 39 Introduction of binary trees,basic terminology, representing binary trees in memory, Traversal of binary trees using stack. Introduction to BST, searching in BST Insertion & Deletion in BST AVL Search Trees, Insertion in AVL Search trees Deletion in AVL Search Trees Heaps, insertion in heap Deletion in heap, Heap sort, Heaps as priority Queues. Huffman Algorithm Introduction to graphs, basic terminology Sequential and linked representation ->Reference :1,Ch 8 sec 8.1 8.2 8.3 8.5 graphs.ppt ->Reference :1,Ch 7 sec 7.4 ->Reference :1,Ch 7 sec 7.7 7.8 ->Reference :1,Ch 7 sec 7.8 ->Reference :1,Ch 7 sec 7.9 ->Reference :1,Ch 7 sec 7.10 7.11 ->Reference :1,Ch 7 sec 7.12 ->Reference :1,Ch 7 sec 7.17 ->Reference :1,Ch 7 sec 7.17 ->Reference :1,Ch 7 sec 7.18 heap.ppt
Part 4
Week 10 Week 11 Lecture 40 Lecture 41 Lecture 42 Lecture 43 Lecture 44 Week 12 Lecture 45 Lecture 46 Lecture 47 Lecture 48 Week 13 Lecture 49 Lecture 50 Lecture 51 Lecture 52 Traversing a graph(BFS, DFS) Warshall's Algorithm, Shortest Path Topological Sorting, Applications of Graphs Hashing, hash table, hash Functions ->Reference :1,Ch 8 sec 8.7 ->Reference :1,Ch 8 sec 8.4 ->Reference :1,Ch 8 sec 8.8 ->Reference :1,Ch 9 sec 9.9 Term Paper Submission Hashing.ppt Submission of mini project
Various types of hash functions, Collision resolution ->Reference :1,Ch 9 techniques. sec 9.9 Searching and sorting use of various data structures ->Reference :1,Ch 9 for searching and sorting sec 9.1 9.2 Bubble Sort Insertion Sort Selection Sort Merge Sort Quick Sort Radix Sort Comparison of all the sorting algorithms and their complexity analysis ->Reference :1,Ch 4 sec 4.6 ->Reference :1,Ch 9 sec 9.3 ->Reference :1,Ch 9 sec 9.4 ->Reference :1,Ch 9 sec 9.6 ->Reference :1,Ch 6 sec 6.6 ->Reference :1,Ch 9 sec 9.7 ->Reference :1,ch 9
Spill Over
Week 14 Lecture 53 Lecture 54 Abstract data types Uses of queues in Operating System
Homework No.
Objective
Evaluation Mode
Test 1
Written Test
Mini project 1
To have the A mini project is allocated to a group of 3 students. Mini project be Group knowledge of like implementation of telephone directory, address book, English practical concepts dictionary etc. of data structures. To have the knowledge of basic data structure and applications of data structures. Term Paper Individual
Mini Project
5 / 10
Term Paper 1
Term paper
3 / 11
* 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 its operations .Comparisons with other trees and uses 2 In depth comparisons of all sorting algorithms and considering the cases in which a particular sorting 3 Role of Data Structures in Compiler Design 4 Compare the practical performance of Fibonacci heaps and binary heaps. 5 Complexity of Algorithms 6 Queue and its uses in Opearting System
7 Application of Linked Lists in Operating System at least 4 cases 8 Role of Data Structures in Programming languages 9 Different Balanced binary trees 10 Comparative study of BFS, DFS on trees and graphs 11 Fault tolerant data structures 12 Comparative Study of Dynamic and Static Array 13 Multi-dimension Linked Lists 14 Travelling salesman problem 15 Hashing