ANAND INSTITUTE OF HIGHER TECHNOLOGY

KAZHIPATTUR – 603 103

Department of Computer Science and Engineering

Academic Year: 2017-18 (Odd Semester)

Lecture Plan

Course Code & Title: CS8381 Data Structures Laboratory

Semester & Branch: III Semester B.E. Computer Science and Engineering

Name of the Faculty member: D.Anand Joseph Daniel

Designation & Department: Assistant Professor- III & CSE

OBJECTIVES
The student should be made to:
 To implement linear and non-linear data structures
 To understand the different operations of search trees
 To implement graph traversal algorithms
 To get familiarized to sorting and searching algorithms

OUTCOMES:
At the end of the course, the students will be able to:

 Write functions to implement linear and non-linear data structure operations

 Suggest appropriate linear / non-linear data structure operations for solving a
given
problem
 Appropriately use the linear / non-linear data structure operations for a given
problem
 Apply appropriate hash functions that result in a collision free scenario for data
storage and
retrieval

Assessment Methods followed:

1. Internal Tests (Model Tests) are conducted to assess continuous learning.

2. Mini Projects are given to enhance the experiential learning.
3. End Semester Examination is conducted to assess overall learning by students.
Lecture Date Topic(s) to be covered Teaching Teaching
 Methodology
(Lecture
Role play
aids
Group
No. (Board /
Discussion
LCD)
Quiz
Debates
Gamefication)
Cycle -I

Array implementation of Stack ADTs

1 Board
Lecture
Array implementation of Queue ADTs LCD Lecture
2
LCD Lecture
3 Array implementation of List ADT
Board Lecture
4 Linked list implementation of List, Stack

5 Linked list implementation of Queue ADTs Board Lecture

Board Lecture
6 Applications of Stack and Queue
Board Lecture
7 Applications of List
Implementation of Binary Trees and Board Lecture
8
operations of Binary Trees
9 Model Lab -I
Cycle -II

10 Implementation of Binary Search Trees Board Lecture

Lecture
11 Implementation of AVL Trees Board

Implementation of Heaps using Priority Board Lecture

12
Queues.
Graph representation and Traversal Board Lecture
13
algorithms
14 Applications of Graphs Board Lecture

Implementation of searching and sorting LCD Lecture

15
algorithms
16 Hashing – any two collision techniques LCD Lecture

17 Model Lab - II
Experiential
18 Mini Project : Tic-Tac-Toe Game Demo
Learning
Prepared by: Approved by:

D.Anand Joseph Daniel Dr.S.Roselin Mary

(Name & Signature of Faculty member) (Name & Signature of HOD)