MANAKULA VINAYAGAR INSTITUTE OF TECHNOLOGY
KALITHEERTHALKUPPAM, PUDUCHERRY- 605 107
DEPARTMENT OF CSE (ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING )
ACADEMIC YEAR: 2023 – 2024 (ODD)
Subject : AI PC302 / DATA STRUCTURES
COURSE OBJECTIVES:
To acquaint students with data structures used when programming for the storage and manipulation of data
The concept of data abstraction and the problem of building implementations of abstract data types are emphasized
To understand the applications of graph theory in various domains
To develop skills to design and analyze simple linear and non linear data structures
To identify and apply the suitable data structure for given real world problem
TOPICS TO TEACHING PART-A TECHNICAL PROPOSED ACTUAL REFERE
S.NO SESSION OBJECTIVE
BE COVERED METHODOLOGY QUESTIONS DATE DATE NCE
BOOKS
UNIT I - INTRODUCTION
Objective: To acquaint students with data structures used when programming for the storage and manipulation of data
1.Algorithmic
notation
2.Programming
What is What is the need
principles Algorithmic notations -
1 Chalk and Talk asymptotic for analyzing
3.Creating asymptotic notations
notation? programs?
programs
4.Analyzing
programs
1.Arrays: One What is
dimensional Array Define Array.
array Understanding about arrays declaration What is the need
2 Chalk and Talk
2.Multidimensio and its types and for defining
nal array intialization? arrays?
3.Pointer arrays
3 Searching: Understanding about Chalk and Talk Which is better
1.Linear search searching and its major What is linear orbinary
2.Binary Search types searching? search?
What is the Differentiate
Understanding about advantage of Linear, Binary
4 Fibonacci search Chalk and Talk
Fibonacci Search Fibonacci and Fibonacci
Search? Search methods
What is
Sorting?
Sorting
Difference
Techniques: Understanding about Which sorting is
between
5 1.Internal Internal Sorting and Power point faster?
Internal
sorting Insertion Sorting
Sorting and
2.Insertion Sort
External
Sorting
Which sorting is
Understanding about What is the
1.Selection Sort faster? Selection
6 Selection Sorting and Power point need for
2.Shell Sort or Shell Sort
Shell Sorting sorting?
Why we use What is the
Understanding about Bubble and advantage of
7 Bubble Sort Power point
Bubble Sorting Quick Sort? Bubble Sort
over Quick sort
Why we use What is the
Understanding about
8 Quick Sort Power point Quick Sort? advantage of
Quick Sorting
Quick sort?
Narrate the
How can we
Heap Sort Understanding about Heap Real time
9 Power point implement Heap
Sorting applications
Sort?
of Heap Sort
Narrate the
Real time How can we
Understanding about
10 Merge Sort Power point applications implement
Merge Sorting
of Merge Merge Sort?
Sort?
Demonstrate
What is the
To discuss about Radix Radix Sort
11 Radix Sort Power point advantage of
Sort with an
Radix Sort?
example
UNIT -1 Revision
Outcome of Unit I: Students will gain fundamental knowledge of relevant data structures and combinations of relevant data structures for the given
problems in terms of memory and run time efficiency.
UNIT II – STACKS
Objective: Students will understand about Stack, Queues, Linked Lists and their operations.
1.Stack -
Definition Define Stack What are PUSH
2.Stack To discuss about the stack And list out and POP
12 Chalk and Talk
Operations operations the Operations?
3. Applications applications
of stack.
1.Queues:Defin What are enque
Define Queue and deque
ition To discuss about the
13 Chalk and Talk and list its operations?
2.Queue Queue Operations
applications
Operations
1.Priority Define
queues To discuss about the Priority Priority What are the
14 2.Dequeues Queue and Deque Chalk and Talk Queue and differences
3.Applications Deque between Priority
of queue. and Dequeue
Linked List: Defince Singly
To discuss about the Singly Define
15 Singly Linked Chalk and Talk linked list
Linked List Linked list
List
List advantage of
Define
Doubly Linked To discuss about the Doubly Power point Doubly linked
16 Doubly
List Linked List Chalk and Talk list over singly
Linked List linked list
17 Circular Linked To discuss about the Circular Chalk and Talk Define
List Linked List Power point Circular List the
linked list applications of
Circular Linked
List.
What is
To discuss about the Linked
Chalk and Talk meant by Narrate about
18 Linked stacks Stacks
Power point Linked Linked Stacks
Stacks?
1.Linked What are the
Define
queues To learn about Linked applications of
19 Chalk and Talk Linked
2.Applications Queues and its applications Linked queues?
Queue
of Linked List
What is the
Dynamic What is the
To learn about Dynamic need for
20 storage Chalk and Talk necessity of
Stoarge Dynamic
management Dynamic
Storage?
Storage?
What is the
Generalized To study about generalized need for Give the need of
21 Chalk and Talk
list. list generalized generanized list
list?
Applications of What is the What is the
Dynamic To learn about Memory need for necessity of
22 Chalk and Talk
Memory Management Dynamic Dynamic
MAnagement Storage? Storage?
UNIT -2 Revision
Outcome of Unit II: Students will gain fundamental knowledge about Stacks and linked lists.
UNIT III - TREES
Objective: To understand the applications of Tree in various domains
Definition, Examples, Identify Binary
Trees: Binary Define
23 Chalk and Talk Tree from list of
tree Tree Representations
Binary Tree diagrams
24 Terminology Listing, Definitions, Chalk and Talk Define Root How a Binaru
Examples node, Parent Tree can be
node and child implemented?
node
Define Tree How an element
Binary tree
25 Representation Power point in a Binary Tree
representations, Examples Representation
can be arranged?
Defining the How a tree can be
26 Tree Traversal Defining, Examples Power point traversals of a traversed while
Tree visiting nodes
Tree
Listing, Defining, Listing out of all representations
27 Traversals Types Chalk and Talk
Examples types with examples of
each type
Tree
Traversal Demonstrating with Listing out of all representations
28 Chalk and Talk
Examples pictures types with examples of
each type
Listing out of all Solving problems
29 Applications Listing out with examples Chalk and Talk applications of using tree
tree traversals traversals
Define Binary Give examples of
Binary search Binary Search tree Binary Search
30 Power point
tree representations, Examples Search Tree Tree
AVL tree representations, Define AVL
31 AVL tree Power point Give examples of
Examples Tree
AVL Tree
B Trees : B Tree B tree representations, B- Define B Tree
32 Chalk and Talk Give examples of
indexing Tree Indexing Examples
B Tree
Operations on a Define Differentiate
B Tree Pictorial representation of Operations on B Lower and Upper
33 Chalk and Talk
Lower and upper B Tree, Examples bounds of a B
bound of a BTree Tree Tree
Definition, Examples, Define
Graph:
34 Chalk and Talk Graph
Terminology Graph Representations
Define
Vertex, How a graph
Listing, Definitions, Edges,
35 Representation Chalk and Talk can be
Examples Visiting a implemented?
graph
Define Tree
Traversal, How a Tree can
36 Traversals Tree Traversals, Examples Power point
be traversed?
narrate
Various areas of How traversals
List out the
37 Applications application of Tree Power point used as problem
applications
Traversals solving
techniques?
Define
Spanning tree Tree
38 Spanning trees Defining, Examples Chalk and Talk and not a representations
with examples of
Spanning
each type
Tree
Explain Spanning tree
Defining the use of Shortest path representation for
39 Shortest path Chalk and Talk
Spanning Tree finding shortest
algorithm path
Matrix
Transitive Notation to Solving problems
40 Matrix Notations Chalk and Talk
closure represent the using transitive
graph closure matrix
Define Explain with an
Implement Topological Topological example
41 Topological sort Power point
sort using spanning tree Topological sort
Sort
Sets: How sets can
42 Define Sets, Examples Power point Give examples of
Representation be
represented Sets
List the
Operations on operations of Give examples of
43 Basic operations on sets Chalk and Talk
sets Set Operations
sets
Usages of
List the applications of Sets in Give example
44 Applications Chalk and Talk application of
Sets solving
using sets
problems
UNIT - 4 Revision
Outcome of Unit IV: To identify the appropriate data structure for given problem.
UNIT V - TABLES
Define Give example
Tables: Definition, Examples, for declaring
Rectangular
45 Rectangular Chalk and Talk Rectangular
Rectangular Tables Tables
tables table
Definition, Examples, Define Give example
46 Jagged tables Chalk and Talk JaggedTables for declaring
Jagged Tables
Jagged table
Define Give example
Inverted tables Definition, Examples, Inverted
47 Power point for declaring
- Inverted Tables
Table Inverted table
Define Give example
Definition, Examples, Symbol
48 Symbol tables Power point for declaring
Symbol Tables
Table Symbol table
Define Static Give example
Static tree Definition, Examples, Static
49 Power point for declaring
tables - Tree Tables TreeTable
Static Tree table
Define Give example
Dynamic tree Definition, Examples, Dynamic for declaring
50 Power point
tables - Dynamic Tree Tables Dynamic Tree
TreeTable Table
Define Hash Give example
Definition, Examples, Hash
51 Hash tables Power point for declaring
Tables Tables
Hash Table
Define File Explain with an
Files: queries - and list its example to
52 Sequential Define File Organization Power point create a file and
types of
organization its organization
organization
How indexing in
Index Define Indexing, Example What is table helpful in
53 Power point
techniques. for indexing techniques indexing? problem solving
techniques?
External How External
sorting: Storage Give the
Define External Sorting, devices are application of
54 External Power point
Examples External sorting
storage devices useful in
– sorting?
Explain tapes How content of
Sorting with Define sorting with tapes and disks tapes and disks
55 Chalk and Talk
tapes and disks. and disks are sorted
storage
Unit – V Revision
Outcome of Unit V: Students able to know about different types of tables and Files used as data structures.
TEXT BOOKS:
SL. NO BOOK NAME AUTHOR NAME PUBLICATIONS EDITION
Ellis Horowitz and Sartaj
1 Fundamentals of Data Structures Galgotia -
Sahni
2 Classic Data Structures D. Samanta Prentice-Hall of India 2nd Edition
REFERENCE BOOKS:
SL.
BOOK NAME AUTHOR NAME PUBLICATIONS YEAR OF PUBLISHING
NO
Data Structures and Program Robert Kruse, C.L. Tondo
1 Prentice-Hall of India 2007
Design in C and Bruce Leung
Data Structures and Algorithm Analysis Pearson
2 MarkAllenWeiss 2006
in C
FACULTY IN-CHARGE HOD PRINCIPAL
