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
concepts)

:C++(object oriented programming

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

UNIT-4: The student will be able to

1. 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 Red Black trees
4. Implement B-trees
5.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 Design Patterns in
C++, 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.)

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-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)

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.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.

Object Oriented Concepts?

Stacks using arrays
Time complexity and space complexity
Explain different operations performed on stacks
Linear Data Structure
Non-Linear Data Structure
Write a program to implement Stacks using Linked List.
different properties of binary trees.
Tree Traversal.
different operations performed on Singly Linked list
different graph traversal with an example

Quizzes
1.objective type first 2 units
2. 3rd and 4th unit
3.5th unit

ASSIGNMENTS
5 assignments one per unit

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

Object oriented
concepts.AlgorithmSpecification,PerformanceAnalyis
and measurement.

practical

I cycle

Applications of oops

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

Array as an Abstract Data Type

Object
oriented
concepts

I cycle

Representation of Arrays,String Abstract Data Type

Abstract Data
Types and
the C++
Class

I cycle

week

lecture

Template in C++, Stack

abstract data type, ,A

I cycle

tutorial

practical

Programs
implementing
abstract data
type

I cycle

Queue abstract data type ,Subtyping

and inheritance in C++

MazingProblem,Evaluation
of Expressions.

week

lecture
Linked Lists: Singly Linked
Lists and
chains,Representing Chains
in C++,Template Class
Chain,CircularLists,Available
Space Lists,Linked Stacks
and
Queues,Polynomials,Doubly
Linked Lists.
Double linked list

Stack abstract data

type

I cycle

queues abstract
data type

I cycle

tutorial

practical

Infix to post fix

conversion
I cycle

- Singly Linked Lists

Internalexams
10

Stacks using single

linked list

Double linked list

II cycle

week

lecture

tutorial

practical

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, BinaryTree

traversal and tree
iterators ,copying binary
trees,Threaded binary
trees,Heaps,Binary
Search trees.

hashing

II cycle

week

lecture

tutorial

practical

Binary Trees

II cycle

14

Graphs: Grapgh abstract

data type,Elementary
graph operations(dfs

and bfs),Minimum cost

spanning trees.
15

Sorting methods

Graphs

16

Applications. AVL Trees,

Red Black Trees, Splay
Trees, B Trees.

II cycle

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

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