new weeklyplan ds-jan

8/10/2019 NEW Weeklyplan Ds-JAN

1/8

DEPARTMENT OF INFORMATION TECHNOLOGY

VASAVI COLLEGE OF ENGINEERING

1. Course title : Data Structures

2.

Course code :BIT-203

3. Lecture tutorial and lab contact hours : 1 hr per week ; 4 hrs per week

4. Total Semester Marks (Internal &/or External): Internal 25 External 75

5. Prerequisites :C++(object oriented programming

concepts)

6.

Nature of Course (Core/Elective) : core

7.

Offering Department :Information Technology

8. Learning Objectives : The objective of the course is to explain efficient storage

mechanisms for an easy access and design and implement various data structures and

improve logical ability.

9.

Learning Outcomes:

UNIT-1:The student will be able to

1.Identify different Object Oriented Concepts.

2.Define Algorithm.

3. Explain the array,string as an Abstract data type.

UNIT -2:The student will be able

1. Describe Stack and Queue

2.List different operations performed on stacks and Queues.

3.Distinguish between stack and queues

4.Apply applications of stack and queues.

UNIT-3:The student will be able

1.Distinguish between arrays and Linked list.

2.Implement different operations performed on stacks and queues.

3. Compare and Contrast isfull and isfempty conditions can be implemented for Stacks using

Linked List and Queues using LinkedIist.

4. Apply different hashing techniques


2/8

UNIT-4:The student will be able to1. Explain what is a Binary Tree.

2. Demonstrate different Binary tree traversal.

3. Demonstrate different graph traversal methods.4.Implement trees and graphs.

UNIT-5:The student will be able.1. Explain different sorting techniques.

2.Apply AVL trees.

3. Describe RedBlack trees

4. Implement B-trees5.Compare and contract similarities between binary search trees and avl trees.

10. Topic Layout

11. Lesson Plan

12.Evaluation Scheme & Tools

13. Teaching methodology & Supporting Tools

14.Text Books & Reference Books :1. SartajSahani, Data Structures, Algorithms, And

Applications in C++, Second Edition, Universities Press, 2005.

v) References

1. Bruno R PResis, Data Structures and Algorithms with Object Oriented Desig n Patterns inC++, Wiley 1999.

2. Mark Allen Weiss, :Data Structures and Algorithm Analysis in C++, Pearson Education.3.

(15. Mapping of Course Objective & Program Objective

16. Matrix of Course Outcome and Demonstration of Course Outcome

Distribution of each hour of course:

Topics to be covered

Tutorials to be done

Lab exercises to be performed

Any activity related to the course (presentations/quiz/projects etc.)


3/8

8. Learning Outcomes

unit I: (3.5weeks)

1-a)Apply array as an Abstract data type (APPLY)

1-b)Give examples of polymorphism (UNDERSTAND)

1-C)Interprete to implement car as an class object (UNDERSTAND)

1-d) Analyse to implement to display information of 2 employees- (ANALYSE)

1-h) Create program to implement inheritance- (CREATE)

1-I) List different features of OOPS(RECALL)

2-C)Apply algorithm for student class (APPLY)

2-d)Design algorithm for student details project (CREATE)

2-h) Design a program to implement run time polymorphism (CREATE)

2-i)conclude oops concepts using c++ (ANALYSE)

3-e)Apply stringas an Abstract data type (APPLY)

3-h)Design a program to implement student as an Abstract data type - (CREATE)

Unit2: (3.5weeks)

1-b. Define stack and queue (RECALL)

2-b. Identify operations performed on stack (RECALL)

2-d. Apply to write program to implement stack and queue (APPLY)

2-h. Design a program to implement stacks and queues (CREATE)

3-c. Compare and contrast two methods isempty and isfull condition can be implemented for

push and pop operation(EVALUATE)

3-b. Distinguish between isempty and isfull condition (ANALYSE)

3-h. Design a program to implement stacks and queues using templates (CREATE)

4-d. Apply stack to convert infix notation to postfix notation (APPLY)


4/8

4-b. Solve a+b*c/d to convert to postfix expression (APPLY)

4-c. Evaluate 634-+/ to postfix evaluation (EVALUATE)

4-i. Develop expression trees using notation

4-h. Design a program to convert infix notation to postfix notation (CREATE)

unit 3: (3.5weeks)

1-b. Distinguish between arrays and single linked list(ANALYSE)

2-a. Apply the concept to create function using single linked list(APPLY)

2-b. Show why front is null (RECALL)

2-c. Analyse why create function is implemented in saving contacts in Mobile(ANALYSE)

2-h. Design program to implement single linked list(CREATE)

3-c,d. Compare and contrast isfull and isempty condition can be implemented for stack using

linkeg list and queue using linked list(EVALUATE)

3-h. Design a program to implement stack using single linked list(CREATE)

4-b. List different hashing techniques (RECALL)

4-c.Solve to search data from dictionary(APPLY)

unit 4: (2 weeks)

1-b) List different types of trees(RECALL)

2-b) Difference between full and complete binary tree(ANALYSE)

2-c) Demonstrate different binary tree traversal

2-d and h) Design a program to implement binary search tree(CREATE)

2-e)Compare and contrast why AVL and Splay tree are balanced tree (EVALUATE)

3-c) Demonstrate different binary tree traversal

3-d and h)Design a program to implement binary search tree(CREATE)


5/8

4-d)Apply minimum cost spanning tree for a given graph(APPLY)

unit 5: (2 weeks)

1-c) Compare and constract different sorting techniques

1-c-d) Evaluate why card game is implemented in selection sorting

1-h) Design a program to implement sorting

2-C-D-H)Compare and constract similarities between BST AND AVL

4-C-H)Design B-Trees

3-C-D)Apply Red Black Tree

5-E)Compare and constract similarities between binary search trees and avl trees.

5 tutorials

1.

Object Oriented Concepts?2. Stacks using arrays3. Time complexity and space complexity4.

Explain different operations performed on stacks5. Linear Data Structure6. Non-Linear Data Structure7. Write a program to implement Stacks using Linked List.8.

different properties of binary trees.9.

Tree Traversal.10.different operations performed on Singly Linked list11.different graph traversal with an example

Quizzes

1.objective type first 2 units

2. 3rdand 4thunit

3.5thunit

ASSIGNMENTS

5 assignments

one per unit


6/8

Classroom Activities

1.polling

2.think pair share

3.sending links for few topics and enquiring in the class

Modern tool usage

1. Using visual studio for unit V

Unit I

week lecture tutorial practical

1Object orientedconcepts.AlgorithmSpecification,PerformanceAnalyisand measurement.

I cycle

2 Applications of oops I cycle

3Arrays:Abstract Data Types and the C++ Class,

Array as an Abstract Data Type

Object

oriented

concepts

I cycle

4 Representation of Arrays,String Abstract Data Type

Abstract Data

Types andthe C++

Class

I cycle


5 Template in C++, Stackabstract data type, ,A

Programs

implementing

abstract data

type

I cycle


7/8

6Queue abstract data type ,Subtyping

and inheritance in C++

Stack abstract data

typeI cycle

7MazingProblem,Evaluation

of Expressions.queues abstract

data typeI cycle


8

Linked Lists: Singly LinkedLists andchains,Representing Chainsin C++,Template Class

Chain,CircularLists,AvailableSpace Lists,Linked StacksandQueues,Polynomials,DoublyLinked Lists.

Infix to post fixconversion

I cycle

9 Double linked list -Singly Linked Lists -

10

Internalexams

Stacks using single

linked list

Double linked list II cycle


11

queues using single

linked list&

applications

Difference between

stacks using arrays

and linked list.

II cycle

12 hashing

Difference between

queues using arrays

and linked list.

II cycle

13

Binary Trees, BinaryTreetraversal and treeiterators ,copying binarytrees,Threaded binarytrees,Heaps,BinarySearch trees.

hashing II cycle


14 Graphs: Grapgh abstractdata type,Elementarygraph operations(dfs

Binary Trees II cycle


8/8

and bfs),Minimum costspanning trees.

15 Sorting methods Graphs II cycle

16

Applications. AVL Trees,

RedBlack Trees, Splay

Trees, BTrees. -

I cycle :oops concepts,stack,queues,infix to postfix conversion,postfix evaluation.

II cycle: single linked list,double linked list,trees

new weeklyplan ds-jan

Documents