Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Labs ]
Course No. CAP205
DATA STRUCTURE

Course Title:

L: 3

T: 0

P: 3

Cr: 5

Course Planner :-

13648 :: Jasleen

TextBook

1. . Author: Seymour Lipschutz, Title: Schaum Outline Series, Publishers: Tata McGraw Hill, New Delhi, Year of Publication: 2006
Other Specific Books

2. 3. 4.
Other Readings

Mark Allen Weises, Data Structures & Algorithmic Analysis in C, Pearson Education Adam Drozdek, Data Structure & Algorithms in C++. Thomson Kruse, Data Structures & Program design, Prentice Hall of India, New Delhi.

Sr. No.

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

5 6

Article on An Extensive Examination of Data Structures, http://msdn.microsoft.com/enus/ library/aa289148.aspx Article on ADTTool: Learning Data Structures as Visual Abstract Data Types, http://www.actapress.com/PaperInfo.aspx?PaperID=14942&reason=500

Relevant Websites

Sr. No.

Web adress

(only if relevant to the courses)

Salient Features

7 8 9

http://www.cse.unt.edu/~rada/CSCE3110/#syllabus http://cpp.datastructures.net/ http://www.slideworld.com/slideshow.aspx/PointersinC-Pointers-and-Arrays-in-C-Function-ppt2765079andhttp://www.slideworld.com/pptslides.asp x/Pointers-in-C http://en.wikipedia.org/wiki/Far_pointer http://en.wikipedia.org/wiki/Far_pointer www.comp.nus.edu.sg/~tantc/ioi.../ApplicationofDataStructures.ppt

Presentations on various topics of Data Structures Presentations on various topics of Data Structures Slides on ponters,arrays,etc

10 11 12

introduction to far pointer introduction to far pointer Applications of data structure

Page 1 of 9

Approved for Autumn Session 2010-11

Detailed Plan For Lectures

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

Part 1
Week 1

Lecture 1 Lecture 2 Lecture 3

Basic concepts and notations: definition and brief description of various data structures brief description of various data structure operations Complexity Analysis: algorithmic complexity and time space trade off, Big O Notation, The best, average & Worst cases analysis of various algorithms Arrays: Linear arrays and their representation multi-dimensional arrays and their representation operations on arrays overview of sparse matrices Insertion Sort, Selection Sort Bubble Sort, Merge Sort

Book :1,CHAPTER1 (1.1-1.19) Book :1,CHAPTER1 (1.1-1.19)

CA\REGULAR\CAP205\L ECTURE1 CA\REGULAR\CAP205\L ECTURE2 CA\REGULAR\CAP205\L ECTURE3

Week 2

Lecture 4 Lecture 5 Lecture 6

Book :1,CHAPTER2 (2.17) Book :1,CHAPTER4 (4.2-4.4) Book :1,CHAPTER4 (4.18) Book :1,CHAPTER4 (4.6-4.18) Book :1,CHAPTER4 (4.37) Book :1,CHAPTER9 (9.6-9.8) Book :1,CHAPTER4 (4.11) chapter9
HomeWork 1 Allocation

CA\REGULAR\CAP205\L ECTURE4 CA\REGULAR\CAP205\L ECTURE5 CA\REGULAR\CAP205\L ECTURE6 CA\REGULAR\CAP205\L ECTURE7 CA\REGULAR\CAP205\L ECTURE8 CA\REGULAR\CAP205\L ECTURE9 CA\REGULAR\CAP205\L ECTURE10

Week 3

Lecture 7 Lecture 8 Lecture 9

Week 4

Lecture 10

Part 2
Week 4

Lecture 11

Linear Search and Binary Search

Book :1,CHAPTER5 (5.10) CHAPTER1 (1.11) chapter 4(4.12) Book :1,CHAPTER 5 (5.1-5.3) Book :1,CHAPTER 5 (5.8-5.24) Book :1,CHAPTER 5 (5.1-5.3)

HomeWork 1 Submission HomeWork 2 Allocation

CA\REGULAR\CAP205\L ECTURE11 CA\REGULAR\CAP205\L ECTURE12 CA\REGULAR\CAP205\L ECTURE13

Lecture 12
Week 5

Linked list: Linear linked list, Memory Representation, Operations on linked list Header Lists, Circular Lists

Lecture 13 Lecture 14

Term Paper 1 Allocation

CA\REGULAR\CAP205\L ECTURE14

Page 2 of 9

Approved for Autumn Session 2010-11

Part 2
Week 5 Week 6

Lecture 15 Lecture 16 Lecture 17 Lecture 18

Stacks: operation of Stack, Memory Representation, applications of stacks such as evaluation of postfix expressions infix to postfix conversion quick sort Queues: Operations, Representation & Types, Dequeues Recursion: Definition, Function Call & Recursion implementation Anatomy of Recursive Call, Complexity issues

Book :1,CHAPTER 6 (6.2-6.7) Book :1,CHAPTER 6 (6.14) Book :1,CHAPTER 6 (6.9) Book :1,CHAPTER 6 (6.14) Book :1,CHAPTER 6 (6.32) Book :1,CHAPTER 6 (6.18) Book :1,CHAPTER 6 (6.18)
HomeWork 2 Submission

CA\REGULAR\CAP205\L ECTURE15 CA\REGULAR\CAP205\L ECTURE16 CA\REGULAR\CAP205\L ECTURE17 CA\REGULAR\CAP205\L ECTURE18 CA\REGULAR\CAP205\L ECTURE19 CA\REGULAR\CAP205\L ECTURE20 CA\REGULAR\CAP205\L ECTURE21

Week 7

Lecture 19 Lecture 20 Lecture 21

MID-TERM
Part 3
Week 8

Lecture 22 Lecture 23 Lecture 24

Trees: Definition, Representation in memory Binary trees: Definition, Traversal, Operations on binary trees Binary Search Trees: Definition and Operations Operations on Binary Search Trees Operations on Binary Search Trees Operations on Binary Search Trees AVL Trees: Definition and Operations

Book :1,CHAPTER 7(7.1) Book :1, CHAPTER 7(7.5-7.9) Book :1, CHAPTER 7(7.24-7.30) Book :1, CHAPTER 7(7.24-7.30) Book :1, CHAPTER 7(7.24-7.30) Book :1, CHAPTER 7(7.24-7.30) Book :1, CHAPTER 7(7.24-7.30) Book :1, CHAPTER 7(7.35)
HomeWork 3 Submission HomeWork 3 Allocation

CA\REGULAR\CAP205\L ECTURE22 CA\REGULAR\CAP205\L ECTURE23 CA\REGULAR\CAP205\L ECTURE24 CA\REGULAR\CAP205\L ECTURE25 CA\REGULAR\CAP205\L ECTURE26 CA\REGULAR\CAP205\L ECTURE27 CA\REGULAR\CAP205\L ECTURE28 CA\REGULAR\CAP205\L ECTURE29

Week 9

Lecture 25 Lecture 26 Lecture 27

Week 10

Lecture 28 Lecture 29

Part 4
Week 10

Lecture 30

Insertion of node

Book :1, CHAPTER 7(7.36-7.42)

HomeWork 4 Allocation

CA\REGULAR\CAP205\L ECTURE30

Page 3 of 9

Approved for Autumn Session 2010-11

Part 4
Week 11

Lecture 31 Lecture 32 Lecture 33

Deletion of node Heaps: Intro to Heaps Operations on heaps Minheap Maxheap Heapsort Graphs: Graphs Theory Terminology Memory Representations Traversing (BFS and DFS)

Book :1, CHAPTER 7(7.36-7.42) Book :1, CHAPTER 7(7.55) Book :1, CHAPTER 7(7.55) Book :1, CHAPTER 7(7.55) Book :1, CHAPTER 7(7.55 Book :1, CHAPTER 7(7.55) Book :1, CHAPTER8(8.1) Book :1, CHAPTER8(8.5) Book :1, CHAPTER8(8.21)
Term Paper 1 Submission HomeWork 4 Submission

CA\REGULAR\CAP205\L ECTURE31 CA\REGULAR\CAP205\L ECTURE32 CA\REGULAR\CAP205\L ECTURE33 CA\REGULAR\CAP205\L ECTURE34 CA\REGULAR\CAP205\L ECTURE35 CA\REGULAR\CAP205\L ECTURE36 CA\REGULAR\CAP205\L ECTURE37 CA\REGULAR\CAP205\L ECTURE38 CA\REGULAR\CAP205\L ECTURE39

Week 12

Lecture 34 Lecture 35 Lecture 36

Week 13

Lecture 37 Lecture 38 Lecture 39

Spill Over
Week 14

Lecture 40 Lecture 41

Far pointers Applications of data structure

CA\REGULAR\CAP205\S PILLOVER1 CA\REGULAR\CAP205\S PILLOVER2

Page 4 of 9

Approved for Autumn Session 2010-11

Details of homework and case studies plan

Homework No. Topic of the Homework Nature of homework (group/individuals/field work

Homework 1 Homework 2 Homework 3 Homework 4

Includes problems related to data structure complexity, arrays Includes problems related to Records and structures, pointers , Memory management and its functions,Link List representation Includes problems related to Linked List operations, Stack operations, Queues operations,Recursion Includes problems related to Trees, Trees operations ,BST and its operations,Heap

Group Group Group Group

*Normally all the homeworks shall be submitted online but in special courses where homeworks cannot be submited online , the insructor can edit the mode of submission while entering the IP Details

Scheme for CA:out of 100*

Component Frequency Out of (If any) Marks for each Total Marks

Homework Term Paper Lab Assesment

3 1 10

15 25

45 25 30
100

12
Total :-

* 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

Page 5 of 9

Approved for Autumn Session 2010-11

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 2 3 4 5 6 7 8 9 10 11 12 13 14 15

AVL trees and its operations .Comparisons with other trees and uses Analysis of algorithms of search engines In depth comparisons of all sorting algorithms and considering the cases in which a particular sorting algorithm most suitable to use.. Role of data structure in graphics and artificial intelligence Simulation of Scheduling Algorithms Design of an Editor Implementation of Computer Dictionary Implementation of Telephone Directory Implementation of Address Book Role of Data Structures in Programming languages Role of Data Structures in Compiler Design Data Management In a Digital Computer Design of a New Data Structure Implementation of Databases with Data Structures Compare the practical performance of Fibonacci heaps and binary heaps.

*Each experiment of the lab will be evaluated using following relative scheme:

Component

% of Marks

J/E WR VIVA

50 20 30

Page 6 of 9

Approved for Autumn Session 2010-11

List of experiments :Expt. No Title Equipment Used Reference of Lab manual

Before Mid-Term

practical 1 practical 2 practical 3 practical 4 practical 5 practical 6 practical 7 practical 8 practical 9 practical 10 practical 11 practical 12 practical 13 practical 14 practical 15 practical 16

Traversal of an array Insertion of element in array Deletion of element in array Operations on 2-Dimensional arrays Pointer arrays Array of pointers Program illustrating dynamic memory allocation Linear Search Binary search Bubble Sort Insertion sort Selection Sort Linear Linked List: Traversal & Searching Linear Linked List: Insertion operations Linear Linked List: Deletion operations Linear Linked List: Deleting the entire list

Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler

N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A.

Page 7 of 9

Approved for Autumn Session 2010-11

practical 17 practical 18
After Mid-Term

Doubly Linked List: Traversal & searching Doubly Link List: Insertion, deletion operations

Turbo C/C++ Compiler Turbo C/C++ Compiler

N.A. N.A.

practical 19 practical 20 practical 21 practical 22 practical 23 practical 24 practical 25 practical 26 practical 27 practical 28 practical 29 practical 30 practical 31 practical 32 practical 33
Spill Over

Circular Linked List and operations Array implementation of Stack Linked implementation of Stack Array implementation of Linear Queue Linked implementation of Linear Queue Array implementation of Circular Queue Recursion: Fibonacci Series Recursion: Towers of Hanoi BSTs: traversal-preoorder BSTs: traversal-inorder BSTs: traversal-postorder BSTs: Searching operation BSTs: Insertion operation BSTs: Deletion operation Heap Sort

Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler Turbo C/C++ Compiler

N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A. N.A.

Page 8 of 9

Approved for Autumn Session 2010-11

practical 34

Heap Sort

Turbo C/C++ Compiler

N.A.

Page 9 of 9

Approved for Autumn Session 2010-11