Scribd
Upload
190 views

Department of Information Science and Engineering: Lesson Plan

This lesson plan outlines a semester-long course on data structures and applications. Over 50 classes, it will cover fundamental data structures like arrays, strings, stacks, queues, linked lists, trees, graphs, sorting, searching, hashing and file organization. Specific topics include linear array representation, dynamic memory allocation, multidimensional arrays, stack applications, queue operations, linked list traversal and operations, binary tree traversal and operations, graph representations and traversal methods. The course aims to explain data structures and their applications, and make use of various data structures in problem solving while developing them in a high-level language.

Uploaded by

sumalraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
190 views

Department of Information Science and Engineering: Lesson Plan

This lesson plan outlines a semester-long course on data structures and applications. Over 50 classes, it will cover fundamental data structures like arrays, strings, stacks, queues, linked lists, trees, graphs, sorting, searching, hashing and file organization. Specific topics include linear array representation, dynamic memory allocation, multidimensional arrays, stack applications, queue operations, linked list traversal and operations, binary tree traversal and operations, graph representations and traversal methods. The course aims to explain data structures and their applications, and make use of various data structures in problem solving while developing them in a high-level language.

Uploaded by

sumalraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Geetha Shishu Shikshana Sangha (R)

GSSS INSTITUTE OF ENGINEERING AND TECHNOLOGY FOR WOMEN


(Affiliated to VTU, Belagavi, Approved by AICTE, New Delhi & Govt. of Karnataka)
KRS Road, Metagalli, Mysuru 570 016, Karnataka, India
Accredited with Grade ‘A’ by NAAC

Department of Information Science and Engineering Accredited by NBA, New Delhi


(Validity: 01.07.2017 - 30.06.2020)

LESSON PLAN

Semester & Year: III Semester 2020 Faculty Name: Sumal Raj M
Subject with Code: Data Structures And Applications [18CS32] No. Of Classes: 50

Chapter Title Sub Titles Days Course Outcomes


Data Structures, Classifications (Primitive & Non Primitive), 1
Data structure Operations, Review of Arrays, Structures, 2
Module – 1 Self-Referential Structures and Unions. 3
Introduction
Pointers and Dynamic Memory Allocation Functions. 4
Representation of Linear Arrays in Memory, Dynamically allocated CO1: Explain fundamentals of data structures and
arrays, 5
their applications essential for programming/problem
Traversing, inserting, deleting, 6 solving.

Array Operations Searching, and sorting. Multidimensional Arrays, 7


Polynomials and Sparse Matrices 8
Basic Terminology, Storing, 9
Strings
Operations and Pattern Matching algorithms. Programming Examples. 10
Definition, Stack Operations, Array Representation of Stacks, 11
Stacks using Dynamic Arrays, 12
Module – 2 Stack Applications: Polish notation, Infix to postfix conversion, 13 CO2: Make use of stack, Queue, Lists, Trees and
Stacks Evaluation of postfix expression, 14
Graphs in problem solving.

Recursion - Factorial, GCD, Fibonacci Sequence, 15


Tower of Hanoi, Ackerman's function. 16
Definition, Array Representation, Queue Operations, 17
Circular Queues, Circular queues using Dynamic arrays, 18
Queues
Dequeues, Priority Queues, A Mazing Problem. 19
Multiple Stacks and Queues. Programming Examples. 20
Definition, Representation of linked lists in Memory 21
Memory allocation; Garbage Collection. 22
Linked list operations: Traversing, Searching, 23
Insertion and Deletion. 24
CO2: Make use of stack, Queue, Lists, Trees and
Doubly Linked lists, 25
Module – 3 Graphs in problem solving.
Linked Lists Circular linked lists, and header linked lists. 26 CO3: Apply searching and sorting operations on files

Linked Stacks and Queues. 27


Applications of Linked lists – Polynomials, 28
Sparse matrix representation. 29
Programming Examples. 30
Terminology, Binary Trees, 31
Properties of Binary trees 32

Array and linked Representation of Binary Trees 33

Binary Tree Traversals - Inorder, postorder, preorder; 34

Module – 4 Additional Binary tree operations. 35 CO2: Make use of stack, Queue, Lists, Trees and
Trees Threaded binary trees, Binary Search Trees – Definition, 36 Graphs in problem solving.
CO3: Apply searching and sorting operations on files
Insertion, Deletion, 37
Traversal, Searching, 38
Application of Trees-Evaluation of Expression, 39

Programming Examples. 40
Definitions, Terminologies, 41

Module – 5 Matrix and Adjacency List Representation Of Graphs, 42


Graphs Elementary Graph operations, 43
Traversal methods: Breadth First Search and Depth First Search. 44
Insertion Sort, Radix sort, 45 CO4: Develop all data structures in a high-level
Sorting and language for problem solving.
Searching Address Calculation Sort. 46
Hash Table organizations, Hashing Functions, 47
Hashing
Static and Dynamic Hashing. 48

Files and Their Data Hierarchy, File Attributes, Text Files and Binary Files, 49
Organization Basic File Operations, File Organizations and Indexing. 50

Signature of the Faculty Course coordinator HOD

You might also like