Sparse Polynomial representation and addition
Sparse Polynomial representation and addition: Polynomial is an expression which is composed of terms, wherein terms are composed of coefficient and exponent. […]
Tag: Data Structure
Program to represent Sparse Matrix using singly linked list (One dimensional list)
Sparse Matrix representation using singly Linked List: /* Sparse Matrix representation using linked list */ #include <stdio.h> #include <stdlib.h> typedef struct list{ […]
Program to represent Sparse Matrix using arrays
Program to represent Sparse Matrix using arrays: /* Sparse Matrix representation using arrays */ #include <stdio.h> #include <stdlib.h> #define MAX 15 int […]
Sparse Matrix
Sparse Matrix: A matrix that has minimum number of non-zero elements is called a sparse matrix i.e. very few elements are sparsely […]
Array Representation – Column-major & Row-major
Array Representation: Column-major Row-major Arrays may be represented in Row-major form or Column-major form. In Row-major form, all the elements of the […]
Arrays
Linear arrays Memory representation/address calculation Operations Traversal Search Linear Binary Insertion Insertion at a position Sorted insertion Deletion Deletion from a position […]
Introduction to Algorithm Design
1. Introduction to Algorithms Input, output, definiteness, finiteness, effectiveness. Top-down & Bottom-up approaches Algorithm complexity Space complexity Time complexity Time space trade […]
Basic concepts of Data Representation
1. Abstract and System defined data types Data type Primitive data type Abstract data type Polymorphic data type 2. Representation, Primitive data […]