Page no:35
Semester II
IT21 - Data Structure Using C Objective : The basic algorithms related to handling data like stack, lists, queue,
trees and graphs are introduced in this subject. The implementation of these algorithms will be taught using previously learned C programming language. Sr. No
1
Chapter Details Introduction To Data Structure 1.1. Introduction 1.2. Data Definition 1.3. Data Object 1.4. Data Types 1.4.1.Built-in Data Type 1.4.2.Derived Data Type 1.5. Data Structure 1.6. Implementation of Data Structure
Nos. of Session
Reference Books
2
1,3,4
2
Array
2.1. Array as Data Structure 2.2. Storage Representation of Arrays 2.3. Applications of Arrays 2.4. Polynomial Representation Using Arrays 2.4.1.Addition of Two Polynomial 2.4.2. Multiplication of Two Polynomial 2.5. Sparse Matrices 2.5.1. Addition of Sparse Matrices 2.5.2. Transpose of a Sparse Matrix
3
1,3,4
3
Linked List 3.1.Introduction 3.2.Drawback of Sequential Storage 3.3.Concept of Linked List 3.4.Implementation of Linked List 3.5.Operation of Linked List 3.5.1.Creating a List 3.5.2.Displaying a List 3.5.3.Inserting an element in the List 3.5.4.Deleting an element 3.6.Other Operation & Applications 3.6.1.Reversing a Linked List 3.6.2.Concatenation of Two Lists 3.6.3.Representation of Polynomial
6
1,3,4,5