Scribd
Upload
6 views2 pages

Lecture - Plan (CSE352)

The document outlines the lecture plan for the Data Structures course (CSE 352) for B.Tech Civil students at Maulana Azad National Institute of Technology, Bhopal. It details various topics to be covered, including arrays, linked lists, stacks, queues, trees, graphs, searching, and sorting algorithms, along with their respective lecture numbers. Additionally, it lists reference books for the course and the subject coordinators responsible for the course management.

Uploaded by

hohora8189
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
6 views2 pages

Lecture - Plan (CSE352)

The document outlines the lecture plan for the Data Structures course (CSE 352) for B.Tech Civil students at Maulana Azad National Institute of Technology, Bhopal. It details various topics to be covered, including arrays, linked lists, stacks, queues, trees, graphs, searching, and sorting algorithms, along with their respective lecture numbers. Additionally, it lists reference books for the course and the subject coordinators responsible for the course management.

Uploaded by

hohora8189
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/ 2

मौलाना आजाद राष्ट्रीय प्रौद्योगिकी संस्थान, भोपाल – 462003

(शिक्षा मंत्रालय, भारत सरकार के तहत राष्ट्रीय महत्व का एक संस्थान)


MAULANA AZAD NATIONAL INSTITUTE OF TECHNOLOGY,
BHOPAL – 462003
(An Institute of National importance under Ministry of Education, Govt. of India)

कंप्यटू र साइसं और इजं ीनियररंग निभाग


Department of Computer Science and Engineering
Class: B.Tech (Civil), 6th Sem
Subject: Data Structures (CSE 352)

Lecture Plan
S. No. Topic Lecture No.
Introduction to Data Structures, Abstract Data Types (ADTs), Algorithm evaluation, Time 1-2
1
and space complexity
Arrays: Introduction, Operations on arrays (i.e., Traversing, Insertion, Deletion, and 3
2
Merging operations), Ordered lists, 1-D arrays
3 Multidimensional arrays, Operations on multidimensional arrays 4
4 Array representation of sparse matrices 5
5 Applications of arrays, Polynomials in arrays, Doubly multiple list in arrays 6
Linked Lists: Introduction, Dynamic Memory Allocation (DMA), Linked lists versus 7-8
6 arrays, Operations on singly linked lists (i.e., Traversing, Insertion, Deletion, and Merging
operations)
Circular linked lists, Doubly linked lists, Circular Doubly linked lists and operations on 9
7
them
8 Linked representation of sparse matrices 10
Applications of linked list: Polynomial in linked list, Memory management in linked 11
9
list, Garbage collection
Stacks: Introduction, Array representation of stacks, Operations on an array stack (i.e., 12
10
Peak, Push, and Pop Operations), Multiple stacks
Linked representation of stacks, Operations on a linked stack (i.e., Peak, Push, and Pop 13
11
operations)
12 Applications of stacks: Parenthesis checking, Function calling 14
13 Prefix, Postfix and Infix notations: Introduction, Conversion and evaluation 15-16
14 Implementation of recursion 17
Queues: Introduction, array representation of queues, Operations on an array queue 18
15
(i.e., Enqueue and dequeue operations)
Linked representation of queues, Operations on a linked queue (i.e., Enqueue and 19
16
dequeue operations)
17 Types of queues: Circular queue, Deque, and priority queue, Applications of queues 20
Trees: Introduction: Terminologies, Types of trees, Binary trees: Representation in 21
18
memory, Conversion from general tree to binary tree
19 Traversing: Pre-order, In-order, Post-order, and Level-order traversal 22
20 Binary Search Trees (BSTs): Introduction, Operations on BSTs 23-24
21 AVL Trees: Introduction, Operations on AVL trees 25-26
मौलाना आजाद राष्ट्रीय प्रौद्योगिकी संस्थान, भोपाल – 462003
(शिक्षा मंत्रालय, भारत सरकार के तहत राष्ट्रीय महत्व का एक संस्थान)
MAULANA AZAD NATIONAL INSTITUTE OF TECHNOLOGY,
BHOPAL – 462003
(An Institute of National importance under Ministry of Education, Govt. of India)

22 Heap & Heap Sort 27


Graphs: Introduction, Terminology, Directed graphs, Representation of graphs: 28
23
Adjacency matrix representation, Adjacency list representation
Graph Traversal Algorithms: Breadth-First Search (BFS) and Depth-First Search (DFS) 29
24
algorithms
25 Searching: Introduction, Linear Search and Binary Search 30
26 Sorting: Introduction, Bubble Sort, Insertion Sort, Selection Sort 31-32
27 Radix Sort 33
28 Hashing 34-35
29 Tutorials 36

Text and Reference Books


1. Fundamentals of Data Structures in C, Ellis Horowitz, Sahni, Anderson-Freed
2. Classic Data Structures, Debasis Samanta
3. Data Structures With C, Seymour Lipschutz
4. Data Structures Using C, Tenenbaum, Aaron M

Subject Coordinators: Dr. Vijay Bhaskar Semwal


Dr. Vaibhav Soni

You might also like