Two Dimentional Array
•Download as PPTX, PDF•
2 likes•443 views
The document discusses two dimensional arrays. It defines a two dimensional array as having two subscripts/indexes, with the first referring to the row and second to the column. It provides examples of declaring, initializing, inputting, outputting, adding and subtracting two dimensional arrays. It also lists applications of two dimensional arrays such as storing tables of data, matrix processing, images composed of pixel elements, and modeling graphs.
Report
Share
Report
Share
Recommended
Multidimensional array in C
The document discusses multi-dimensional arrays, specifically two-dimensional arrays. It defines two-dimensional arrays as rows and columns that can represent tables, vectors, or matrices. It provides examples of declaring, initializing, inputting, outputting, and storing two-dimensional arrays in C code. It includes code examples for adding, transposing, and multiplying matrices using two-dimensional arrays.
Group p1
This document provides instructions for a group assignment on data structures and algorithms. It contains 4 questions:
1. Determine the output of sample C++ code that performs a binary search on an array to find a given input value.
2. Represent -8, 8, and 0.3125 in their corresponding 4-bit signed integer and 16-bit floating point binary formats or explain why it is not possible.
3. Circle properties that describe arrays as a data structure and explain the selection. The properties are basic/compound, static/dynamic, and linear/non-linear.
4. For a 3D array stored in column-wise format: a) calculate the address of a given element, and b
Multi dimensional arrays
The document discusses multidimensional arrays and provides examples of declaring and using two-dimensional arrays in Java. It describes how to represent tables of data using two-dimensional arrays, initialize arrays, access elements, and perform common operations like summing elements. The document also introduces the concept of ragged arrays and declares a three-dimensional array could be used to store student exam scores with multiple parts.
Two dimensional array
The document discusses a program that calculates weighted averages of exam scores for multiple students. It introduces two-dimensional arrays as a data structure to store the exam scores, student IDs, and weighted averages for multiple students. The program reads exam scores and weights from a file, calculates the weighted average for each student using a two-dimensional scores array, and outputs the scores and average scores for each exam. Functions are used to get the exam weights, read the scores, calculate averages, and print the results.
Introduction to Array ppt
This document discusses arrays in C++. It begins by introducing arrays and their need, then describes the different types of arrays including single, two, and multi-dimensional arrays. It explains how arrays are stored in contiguous memory locations and indexed starting from zero. The document also covers array initialization, unsized array initialization, and using strings as arrays in C++.
Introduction to data_structure
Concept and Definition of Data Structures
Introduction to Data Structures: Information and its meaning, Array in C++: The array as an ADT, Using one dimensional array, Two dimensional array, Multi dimensional array, Structure , Union, Classes in C++.
https://github.com/ashim888/dataStructureAndAlgorithm
Two dimensional arrays
This document discusses two-dimensional arrays. It begins by defining two-dimensional arrays as arrangements of elements in rows and columns with two indices - one for the row and one for the column. It then covers declaring, initializing, accessing, inputting, outputting, and performing operations on two-dimensional arrays and matrices. Specific operations discussed include traversing arrays, summing row/column elements, and performing operations on matrices like finding diagonal sums and adding matrices.
11 1. multi-dimensional array eng
The document discusses multidimensional arrays in C, including two-dimensional and three-dimensional arrays. It explains the syntax for declaring multidimensional arrays and how they are logically and physically stored in memory as one-dimensional arrays. The document also covers passing multidimensional arrays to functions, including type conversions, and initializing multidimensional arrays.
Recommended
Multidimensional array in C
The document discusses multi-dimensional arrays, specifically two-dimensional arrays. It defines two-dimensional arrays as rows and columns that can represent tables, vectors, or matrices. It provides examples of declaring, initializing, inputting, outputting, and storing two-dimensional arrays in C code. It includes code examples for adding, transposing, and multiplying matrices using two-dimensional arrays.
Group p1
This document provides instructions for a group assignment on data structures and algorithms. It contains 4 questions:
1. Determine the output of sample C++ code that performs a binary search on an array to find a given input value.
2. Represent -8, 8, and 0.3125 in their corresponding 4-bit signed integer and 16-bit floating point binary formats or explain why it is not possible.
3. Circle properties that describe arrays as a data structure and explain the selection. The properties are basic/compound, static/dynamic, and linear/non-linear.
4. For a 3D array stored in column-wise format: a) calculate the address of a given element, and b
Multi dimensional arrays
The document discusses multidimensional arrays and provides examples of declaring and using two-dimensional arrays in Java. It describes how to represent tables of data using two-dimensional arrays, initialize arrays, access elements, and perform common operations like summing elements. The document also introduces the concept of ragged arrays and declares a three-dimensional array could be used to store student exam scores with multiple parts.
Two dimensional array
The document discusses a program that calculates weighted averages of exam scores for multiple students. It introduces two-dimensional arrays as a data structure to store the exam scores, student IDs, and weighted averages for multiple students. The program reads exam scores and weights from a file, calculates the weighted average for each student using a two-dimensional scores array, and outputs the scores and average scores for each exam. Functions are used to get the exam weights, read the scores, calculate averages, and print the results.
Introduction to Array ppt
This document discusses arrays in C++. It begins by introducing arrays and their need, then describes the different types of arrays including single, two, and multi-dimensional arrays. It explains how arrays are stored in contiguous memory locations and indexed starting from zero. The document also covers array initialization, unsized array initialization, and using strings as arrays in C++.
Introduction to data_structure
Concept and Definition of Data Structures
Introduction to Data Structures: Information and its meaning, Array in C++: The array as an ADT, Using one dimensional array, Two dimensional array, Multi dimensional array, Structure , Union, Classes in C++.
https://github.com/ashim888/dataStructureAndAlgorithm
Two dimensional arrays
This document discusses two-dimensional arrays. It begins by defining two-dimensional arrays as arrangements of elements in rows and columns with two indices - one for the row and one for the column. It then covers declaring, initializing, accessing, inputting, outputting, and performing operations on two-dimensional arrays and matrices. Specific operations discussed include traversing arrays, summing row/column elements, and performing operations on matrices like finding diagonal sums and adding matrices.
11 1. multi-dimensional array eng
The document discusses multidimensional arrays in C, including two-dimensional and three-dimensional arrays. It explains the syntax for declaring multidimensional arrays and how they are logically and physically stored in memory as one-dimensional arrays. The document also covers passing multidimensional arrays to functions, including type conversions, and initializing multidimensional arrays.
Data structure using c bcse 3102 pcs 1002
This document contains a data structures exam from 2008 with 8 pages. It includes 10 multiple choice questions covering topics like data structures, binary trees, queues, stacks, graphs, and sorting algorithms. It also contains 8 additional problems requiring algorithms and programs related to linked lists, binary trees, heaps, graphs, searching, and polynomial representations. Students are instructed to answer question 1 and 5 of the additional problems.
Two dimensional array
Two dimensional arrays in C can be declared and initialized similarly to one dimensional arrays, with the first subscript specifying the row and second subscript specifying the column. Elements are stored in contiguous memory locations in row-major order. The document then presents a sample problem of reading a 2D array of integers from a file, finding the largest element, and printing it out. It also discusses using typedef to define custom data types like matrices and strings.
Structured Data Type Arrays
This document discusses arrays in C++. It defines an array as a collection of variables of the same type referenced by a common name. It describes single dimension arrays as the simplest type where indices start at 0. Two dimensional arrays are arrays where each element is itself an array. Strings can be implemented as single dimension character arrays terminated by a null character. The document discusses initializing arrays, calling functions with arrays, and how the array name acts as a pointer to the first element.
2D Array
2D array in C++ language ,define the concept of c++ Two-Dimensional array .with example .and also Accessing Array Components concept.and Processing Two-Dimensional Arrays.
Data structures using C
The document discusses various data structures and their classification. It begins by stating the objectives of understanding how data structures can be classified, basic data types and arrays, and problem-oriented data structures used to solve specific problems. It then defines key terms like data, information, and data structures. It provides examples of different data structure types like arrays, lists, stacks, queues and trees. It also discusses basic data types, array types, and various operations involved in searching, sorting and manipulating different data structures.
Data structures using c
The document discusses various data structures and their classification. It begins by stating the objectives of understanding how data structures can be classified, basic data types and arrays, and problem-oriented data structures used to solve specific problems. It then defines key terms like data, information, and data structures. It describes primitive and non-primitive, linear and non-linear data structures. It also discusses basic and problem-oriented data structures like lists, stacks, queues, and trees. It provides examples and applications of different data structures.
Bca ii dfs u-1 introduction to data structure
This document provides an introduction to data structures. It defines data structures as a way of organizing and storing data in a computer so it can be used efficiently. There are two main types: primitive data structures like integers and characters that are directly operated on by the CPU, and non-primitive structures like arrays and linked lists that are more complex. Key aspects of data structures covered include operations, properties, performance analysis using time and space complexity, and examples of linear structures like arrays and non-linear structures like trees. Common algorithms are analyzed based on their asymptotic worst-case running times.
Array,MULTI ARRAY, IN C
The document contains lecture notes on one-dimensional and two-dimensional arrays in C programming. It discusses the syntax, declaration, initialization, and accessing of array elements. Examples are provided to demonstrate reading input from users, traversing arrays using for loops, and performing operations like addition and multiplication on two-dimensional arrays. Class exercises described include programs to read and display arrays, find the highest number in an array, and perform matrix addition and multiplication using two-dimensional arrays.
Multi-Dimensional Lists
The document discusses multi-dimensional and two-dimensional lists. It explains that two-dimensional lists can represent tables of values arranged in rows and columns, with each element identified by two indices - the row and column. It provides examples of declaring and initializing two-dimensional lists, including nested list initializers. It also covers passing two-dimensional arrays as function parameters.
Unit 1 introduction to data structure
This document provides an introduction to data structures. It discusses key concepts like abstract data types, different types of data structures including primitive and non-primitive, and common operations on data structures like traversing, searching, inserting, deleting, sorting and merging. It also covers algorithm analysis including time and space complexity and asymptotic notations. Specific data structures like arrays, linked lists, stacks, queues, trees and graphs are mentioned. The document concludes with discussions on pointers and structures in C/C++.
Row major and column major in 2 d
This document discusses row-major and column-major ordering for representing 2D arrays in memory. In row-major order, elements are arranged sequentially row by row, with the first row occupying the first memory locations. Column-major order arranges elements column by column. Formulas are provided to calculate the memory location of a given element based on its indices, the array base address, element size, number of rows, and whether the array uses row-major or column-major ordering. An example calculates the location of element A[3,2] for both a row-major and column-major 3x4 integer array.
Data Structures Notes 2021
The document discusses various data structures and their operations. It begins with an introduction to linear data structures like arrays, linked lists, stacks and queues. It describes array implementation using sequential storage and linked list implementation using pointers. Common operations on these structures like traversal, insertion, deletion and searching are discussed. The document also covers non-linear data structures like trees and graphs and basic tree traversals. It provides examples of applications of different data structures and concludes with definitions of key terms.
Data structures
Data structures allow for the effective organization and processing of data as a single unit. They involve determining how to logically represent data, choosing a data structure type, and developing operations to apply to the data. Common simple data structures include arrays and structures, while more complex structures include stacks, queues, linked lists, and trees. Key operations on data structures are insertion, deletion, searching, traversal, sorting, and merging.
Pf presntation
The document discusses two-dimensional arrays in C++. It defines a two-dimensional array as an array that consists of more than one row and column. Each element is referenced by two indexes - the first for the row and second for the column. The syntax for declaring a two-dimensional array is shown as datatype arrayname[rows][columns]. Nested loops are used to enter data, with the outer loop iterating through rows and inner through columns. Examples are given to initialize two-dimensional integer and character arrays by enclosing elements in curly braces and apostrophes respectively.
Data structure ppt
The document provides an introduction to data structures. It defines data structures as representations of logical relationships between data elements that consider both the elements and their relationships. It classifies data structures as either primitive or non-primitive. Primitive structures are directly operated on by machine instructions while non-primitive structures are built from primitive ones. Common non-primitive structures include stacks, queues, linked lists, trees and graphs. The document then discusses arrays as a data structure and operations on arrays like traversal, insertion, deletion, searching and sorting.
concept of Array, 1D & 2D array
The document discusses different types of arrays, including one-dimensional and two-dimensional arrays. It defines an array as a single name for a collection of data values of the same type. One-dimensional arrays have a single size dimension, while two-dimensional arrays represent data in a matrix with row and column sizes. Examples of how to declare, initialize, and reference elements of one-dimensional and two-dimensional arrays in code are provided.
Arrays
This document discusses various linear data structures in C including arrays, records, pointers, and related operations. It describes declaring and initializing one-dimensional and two-dimensional arrays. Records are used to store related data elements using structures. Pointer arrays and dynamic arrays allocated at runtime are also covered. Searching algorithms like linear search and binary search, and sorting algorithms like bubble sort are summarized.
Data structure and algorithm All in One
The document provides information about data structures and algorithms. It defines key terms like data, information, data structure, algorithm and different types of algorithms. It discusses linear data structures like arrays, operations on arrays like traversing, searching, inserting and deleting elements. It also covers recursive functions, recursion concept, searching algorithms like sequential search and binary search along with their algorithms and examples.
ARRAY
An array is a collection of data types that holds a fixed number of values of the same type. Arrays are declared with a data type, name, and size. They store elements in consecutive memory locations that can be accessed via an index. The length of an array is calculated as the upper bound index minus the lower bound plus one. Arrays can be one-dimensional, two-dimensional in the form of a matrix, or three-dimensional with additional indices.
Lecture 3 data structures and algorithms
This document provides information about data structures and algorithms. It begins by defining data structures and storage structures, and notes that a data structure is a logical model of data organization while a storage structure represents a data structure in computer memory. It then classifies data structures as linear or non-linear, and notes that linear data structures form a sequence. The document discusses representation of data structures in memory using arrays or linked lists, and common operations on linear structures like traversal, search, insertion and deletion. It provides detailed explanations of arrays and pointers.
Arrays
An array is a collection of similar data types stored under a common name. Arrays can be one-dimensional, two-dimensional, or multi-dimensional. Elements in an array are stored in contiguous memory locations. Arrays allow multiple variables of the same type to be manipulated together using a single name. Common operations on arrays include sorting elements, performing matrix operations, and CPU scheduling.
More Related Content
What's hot
Data structure using c bcse 3102 pcs 1002
This document contains a data structures exam from 2008 with 8 pages. It includes 10 multiple choice questions covering topics like data structures, binary trees, queues, stacks, graphs, and sorting algorithms. It also contains 8 additional problems requiring algorithms and programs related to linked lists, binary trees, heaps, graphs, searching, and polynomial representations. Students are instructed to answer question 1 and 5 of the additional problems.
Two dimensional array
Two dimensional arrays in C can be declared and initialized similarly to one dimensional arrays, with the first subscript specifying the row and second subscript specifying the column. Elements are stored in contiguous memory locations in row-major order. The document then presents a sample problem of reading a 2D array of integers from a file, finding the largest element, and printing it out. It also discusses using typedef to define custom data types like matrices and strings.
Structured Data Type Arrays
This document discusses arrays in C++. It defines an array as a collection of variables of the same type referenced by a common name. It describes single dimension arrays as the simplest type where indices start at 0. Two dimensional arrays are arrays where each element is itself an array. Strings can be implemented as single dimension character arrays terminated by a null character. The document discusses initializing arrays, calling functions with arrays, and how the array name acts as a pointer to the first element.
2D Array
2D array in C++ language ,define the concept of c++ Two-Dimensional array .with example .and also Accessing Array Components concept.and Processing Two-Dimensional Arrays.
Data structures using C
The document discusses various data structures and their classification. It begins by stating the objectives of understanding how data structures can be classified, basic data types and arrays, and problem-oriented data structures used to solve specific problems. It then defines key terms like data, information, and data structures. It provides examples of different data structure types like arrays, lists, stacks, queues and trees. It also discusses basic data types, array types, and various operations involved in searching, sorting and manipulating different data structures.
Data structures using c
The document discusses various data structures and their classification. It begins by stating the objectives of understanding how data structures can be classified, basic data types and arrays, and problem-oriented data structures used to solve specific problems. It then defines key terms like data, information, and data structures. It describes primitive and non-primitive, linear and non-linear data structures. It also discusses basic and problem-oriented data structures like lists, stacks, queues, and trees. It provides examples and applications of different data structures.
Bca ii dfs u-1 introduction to data structure
This document provides an introduction to data structures. It defines data structures as a way of organizing and storing data in a computer so it can be used efficiently. There are two main types: primitive data structures like integers and characters that are directly operated on by the CPU, and non-primitive structures like arrays and linked lists that are more complex. Key aspects of data structures covered include operations, properties, performance analysis using time and space complexity, and examples of linear structures like arrays and non-linear structures like trees. Common algorithms are analyzed based on their asymptotic worst-case running times.
Array,MULTI ARRAY, IN C
The document contains lecture notes on one-dimensional and two-dimensional arrays in C programming. It discusses the syntax, declaration, initialization, and accessing of array elements. Examples are provided to demonstrate reading input from users, traversing arrays using for loops, and performing operations like addition and multiplication on two-dimensional arrays. Class exercises described include programs to read and display arrays, find the highest number in an array, and perform matrix addition and multiplication using two-dimensional arrays.
Multi-Dimensional Lists
The document discusses multi-dimensional and two-dimensional lists. It explains that two-dimensional lists can represent tables of values arranged in rows and columns, with each element identified by two indices - the row and column. It provides examples of declaring and initializing two-dimensional lists, including nested list initializers. It also covers passing two-dimensional arrays as function parameters.
Unit 1 introduction to data structure
This document provides an introduction to data structures. It discusses key concepts like abstract data types, different types of data structures including primitive and non-primitive, and common operations on data structures like traversing, searching, inserting, deleting, sorting and merging. It also covers algorithm analysis including time and space complexity and asymptotic notations. Specific data structures like arrays, linked lists, stacks, queues, trees and graphs are mentioned. The document concludes with discussions on pointers and structures in C/C++.
Row major and column major in 2 d
This document discusses row-major and column-major ordering for representing 2D arrays in memory. In row-major order, elements are arranged sequentially row by row, with the first row occupying the first memory locations. Column-major order arranges elements column by column. Formulas are provided to calculate the memory location of a given element based on its indices, the array base address, element size, number of rows, and whether the array uses row-major or column-major ordering. An example calculates the location of element A[3,2] for both a row-major and column-major 3x4 integer array.
Data Structures Notes 2021
The document discusses various data structures and their operations. It begins with an introduction to linear data structures like arrays, linked lists, stacks and queues. It describes array implementation using sequential storage and linked list implementation using pointers. Common operations on these structures like traversal, insertion, deletion and searching are discussed. The document also covers non-linear data structures like trees and graphs and basic tree traversals. It provides examples of applications of different data structures and concludes with definitions of key terms.
Data structures
Data structures allow for the effective organization and processing of data as a single unit. They involve determining how to logically represent data, choosing a data structure type, and developing operations to apply to the data. Common simple data structures include arrays and structures, while more complex structures include stacks, queues, linked lists, and trees. Key operations on data structures are insertion, deletion, searching, traversal, sorting, and merging.
Pf presntation
The document discusses two-dimensional arrays in C++. It defines a two-dimensional array as an array that consists of more than one row and column. Each element is referenced by two indexes - the first for the row and second for the column. The syntax for declaring a two-dimensional array is shown as datatype arrayname[rows][columns]. Nested loops are used to enter data, with the outer loop iterating through rows and inner through columns. Examples are given to initialize two-dimensional integer and character arrays by enclosing elements in curly braces and apostrophes respectively.
Data structure ppt
The document provides an introduction to data structures. It defines data structures as representations of logical relationships between data elements that consider both the elements and their relationships. It classifies data structures as either primitive or non-primitive. Primitive structures are directly operated on by machine instructions while non-primitive structures are built from primitive ones. Common non-primitive structures include stacks, queues, linked lists, trees and graphs. The document then discusses arrays as a data structure and operations on arrays like traversal, insertion, deletion, searching and sorting.
concept of Array, 1D & 2D array
The document discusses different types of arrays, including one-dimensional and two-dimensional arrays. It defines an array as a single name for a collection of data values of the same type. One-dimensional arrays have a single size dimension, while two-dimensional arrays represent data in a matrix with row and column sizes. Examples of how to declare, initialize, and reference elements of one-dimensional and two-dimensional arrays in code are provided.
Arrays
This document discusses various linear data structures in C including arrays, records, pointers, and related operations. It describes declaring and initializing one-dimensional and two-dimensional arrays. Records are used to store related data elements using structures. Pointer arrays and dynamic arrays allocated at runtime are also covered. Searching algorithms like linear search and binary search, and sorting algorithms like bubble sort are summarized.
Data structure and algorithm All in One
The document provides information about data structures and algorithms. It defines key terms like data, information, data structure, algorithm and different types of algorithms. It discusses linear data structures like arrays, operations on arrays like traversing, searching, inserting and deleting elements. It also covers recursive functions, recursion concept, searching algorithms like sequential search and binary search along with their algorithms and examples.
ARRAY
An array is a collection of data types that holds a fixed number of values of the same type. Arrays are declared with a data type, name, and size. They store elements in consecutive memory locations that can be accessed via an index. The length of an array is calculated as the upper bound index minus the lower bound plus one. Arrays can be one-dimensional, two-dimensional in the form of a matrix, or three-dimensional with additional indices.
Lecture 3 data structures and algorithms
This document provides information about data structures and algorithms. It begins by defining data structures and storage structures, and notes that a data structure is a logical model of data organization while a storage structure represents a data structure in computer memory. It then classifies data structures as linear or non-linear, and notes that linear data structures form a sequence. The document discusses representation of data structures in memory using arrays or linked lists, and common operations on linear structures like traversal, search, insertion and deletion. It provides detailed explanations of arrays and pointers.
What's hot (20)
Similar to Two Dimentional Array
Arrays
An array is a collection of similar data types stored under a common name. Arrays can be one-dimensional, two-dimensional, or multi-dimensional. Elements in an array are stored in contiguous memory locations. Arrays allow multiple variables of the same type to be manipulated together using a single name. Common operations on arrays include sorting elements, performing matrix operations, and CPU scheduling.
Chapter2
This document discusses arrays and structures. It begins by defining an array as a set of index-value pairs where each index maps to a value. Arrays are commonly implemented using consecutive memory locations. Structures group related data and allow accessing members via dot notation. The document provides examples of one-dimensional arrays in C and comparing integer pointers to arrays. It also covers self-referential structures, ordered lists, polynomials represented as terms, and sparse matrices stored as row-column-value triples. Functions for each abstract data type are defined, such as adding and multiplying polynomials or transposing a sparse matrix.
Data structures KTU chapter2.PPT
This document discusses arrays and structures. It begins by defining an array as a set of index and value pairs where each index has an associated value. Arrays can be implemented using consecutive memory locations. Structures allow grouping of different data types together. Self-referential structures have one or more components that point back to the structure itself. Examples of abstract data types discussed include arrays, polynomials, and sparse matrices. Common operations on these data types like addition, multiplication, and transposition are also described.
data structure and algorithm Array.pptx btech 2nd year
The document discusses arrays and algorithms. It begins by defining arrays as lists of homogeneous data elements referenced by indices. Linear arrays are one-dimensional while multi-dimensional arrays include matrices. Common array operations like traversal, insertion, deletion and searching algorithms like linear and binary search are described. For linear search, the best, average and worst case complexities are analyzed to be O(1), O(n/2) and O(n) respectively. Binary search is more efficient, having a complexity of O(log n) as it halves the search space on each comparison. Examples and pseudocode are provided to illustrate key concepts.
Array 31.8.2020 updated
The document discusses various operations that can be performed on arrays, including traversing, inserting, searching, deleting, merging, and sorting elements. It provides examples and algorithms for traversing an array, inserting and deleting elements, and merging two arrays. It also discusses two-dimensional arrays and how to store user input data in a 2D array. Limitations of arrays include their fixed size and issues with insertion/deletion due to shifting elements.
2D arrays
This document discusses 2D arrays, including their definition as a list of 1D arrays, how to declare and initialize them, and how to access elements using row and column indexes. It provides an example of a 3x4 2D array initialized and then accessed using nested for loops to output each element. Common uses of 2D arrays include representing spreadsheet data with students' test scores and mistakes to avoid like using the wrong array bounds.
Arrays 1D and 2D , and multi dimensional
The document discusses arrays in C programming language. It defines arrays as fixed-sized sequenced collections of elements of the same data type that share a common name. One-dimensional arrays represent lists, while two-dimensional arrays represent tables with rows and columns. Arrays must be declared before use with the size specified. Elements can be accessed using indices and initialized. Common operations like input, output, sorting and searching of array elements are demonstrated through examples.
arrays.pptx
The document discusses arrays in C programming. It defines arrays as a collection of similar data types stored in contiguous memory locations and accessed using indexes. It describes how to declare, initialize, access, and manipulate single and multi-dimensional arrays. It also covers passing arrays to functions, array addressing and calculations, and merging two sorted arrays.
Array.pptx
This document discusses C arrays. It defines an array as a collection of similar data items stored in contiguous memory locations. Arrays in C can store primitive data types like int, char, etc. The document lists advantages like code optimization and ease of traversal using for loops. Disadvantages include fixed size arrays that cannot dynamically grow. It demonstrates declaring and initializing single-dimensional arrays and accessing elements. Multi-dimensional or 2D arrays are explained as arrays of arrays to store data in table/matrix form using row and column subscripts. Functions to search, pass arrays to functions and built-in string functions like length, copy, concatenate, comparison are also covered.
array.pptx
Dr. Pradyumansinh Jadeja of Darshan Institute of Engineering & Technology discusses arrays and their applications. He explains one-dimensional and two-dimensional arrays, including how their elements are stored and addressed in memory. Applications of arrays include representing polynomial equations with matrices and storing sparse matrices efficiently through a linear representation that lists only non-zero elements.
Chapter2
Arrays are data structures that store a collection of data elements of the same type using a single variable name to represent the entire collection. Structures group together data of different types under one name. Sparse matrices represent matrices with many zero elements by only storing the non-zero elements, using triples of row, column, and value to represent each non-zero term. Transposing a sparse matrix involves taking each non-zero term <i,j,value> and storing it as <j,i,value> in the transpose.
ARRAY in python and c with examples .pptx
A one-dimensional array stores elements linearly such that they can be accessed using an index, the document provides an example of finding the address of an element in a 1D array and taking user input to store in an array and display all elements, and abstract data types provide only the interface of a data structure without implementation details.
13. Pointer and 2D array
A two dimensional array can be accessed using two subscripts, with the first representing the row number and the second representing the column number. Elements are stored in memory row by row. A 2D array can be viewed as a collection of 1D arrays, with each row representing an array of the second dimension size. The base address of the 2D array points to the first element at index [0][0], and any element can be accessed using the generalized form of base_pointer[i][j].
Basic of array and data structure, data structure basics, array, address calc...
The document discusses different data structures and algorithms. It defines data structures as ways to store and organize data, mentioning linear structures like arrays and linked lists, and non-linear structures like trees and graphs. It also discusses abstract data types, arrays, sorting algorithms like bubble sort, and searching algorithms like linear and binary search. Key operations and their implementations are provided for each concept through definitions, examples and pseudocode.
Arrays
The Array is the most commonly used Data Structure.
An array is a collection of data elements that are of the same type (e.g., a collection of integers, collection of characters, collection of doubles).
OR
Array is a data structure that represents a collection of the same types of data.
The values held in an array are called array elements
An array stores multiple values of the same type – the element type
The element type can be a primitive type or an object reference
Therefore, we can create an array of integers, an array of characters, an array of String objects, an array of Coin objects, etc.
2ds
The document discusses various data structures and algorithms. It describes data structures as collections of data elements organized through accessing operations. Algorithms are defined as finite sets of instructions to accomplish tasks. Common criteria for algorithms include having inputs, outputs, being definite, finite, and effective. The document recommends choosing data structures based on data size, dynamic nature, access time, and algorithms used. It provides examples of built-in data structures in C like arrays and structures. One-dimensional and multi-dimensional arrays in C are explained along with how they are implemented and accessed.
Unit 3
The document discusses arrays, strings, and functions in C programming. It begins by explaining how to initialize and access 2D arrays, including examples to take input from the user and store it in a 2D array. It then discusses initializing and accessing multidimensional arrays. Next, it covers array contiguous memory and the advantages and limitations of arrays. Finally, it discusses common programming errors related to array construction for real-time applications.
Arrays and library functions
Arrays allow storing multiple values of the same type under one common name. They come in one-dimensional and two-dimensional forms. One-dimensional arrays store elements indexed with a single subscript, while two-dimensional arrays represent matrices with rows and columns indexed by two subscripts. Arrays can be passed to functions by passing their name and size for numeric arrays, or just the name for character/string arrays since strings are null-terminated. Functions can operate on arrays to perform tasks like finding the highest/lowest element or reversing a string.
Multiplication of two 3 d sparse matrices using 1d arrays and linked lists
A basic algorithm of 3D sparse matrix multiplication (BASMM) is presented using one dimensional (1D) arrays which is used further for multiplying two 3D sparse matrices using Linked Lists. In this algorithm, a general concept is derived in which we enter non- zeros elements in 1st and 2nd sparse matrices (3D) but store that values in 1D arrays and linked lists so that zeros could be removed or ignored to store in memory. The positions of that non-zero value are also stored in memory like row and column position. In this way space complexity is decreased. There are two ways to store the sparse matrix in memory. First is row major order and another is column major order. But, in this algorithm, row major order is used. Now multiplying those two matrices with the help of BASMM algorithm, time complexity also decreased. For the implementation of this, simple c programming and concepts of data structures are used which are very easy to understand for everyone.
Similar to Two Dimentional Array (20)
data structure and algorithm Array.pptx btech 2nd year
data structure and algorithm Array.pptx btech 2nd year
Basic of array and data structure, data structure basics, array, address calc...
Basic of array and data structure, data structure basics, array, address calc...
Multiplication of two 3 d sparse matrices using 1d arrays and linked lists
Multiplication of two 3 d sparse matrices using 1d arrays and linked lists
More from Sonya Akter Rupa
Synchronous Counter in Digital Logic Device
You may benefited by this slideshow as knowing about the short overview about Synchronous Counters and it's applications. I trying to describe about the topic my simple and easy way. Feel free to ask me any question about this topic. I'll try to help you by my best.
Method Overloading in Java
From this slide you can know about
- Signature
- Polymorphism
-Method
-Types of Method
- Method Overloading
- Sample programme
- Reference Books & websites name
I hope, it is beneficial for beginner Java learner. It's just a simple overview of the topic Method Overloading in Java.
Enviremental Pollution
This document defines and discusses different types of pollution including air, water, noise, and radioactive pollution. It provides definitions and examples of causes and effects for each type. Some key points made include that air pollution is the introduction of chemicals or other materials into the atmosphere that harm living organisms or the environment. Water pollution occurs when pollutants are discharged into water bodies without treatment. Noise pollution disrupts human or animal life through unpleasant machine or human created sounds. Radioactive pollution results from nuclear reactions and radiation exposure which can lead to diseases like cancer. Prevention methods include reducing emissions, proper waste disposal, and public awareness campaigns.
Switch Case in C Programming
Amazing slide show about Switch Case in Programming Language C. It's helpfull for engineering students .
File in C Programming
This document discusses data files in C programming. It defines a data file as a computer file that stores data for use by an application or system. It describes two types of data files: stream-oriented (text files and unformatted files) and system-oriented (low-level files). It explains how to open, read from, write to, and close data files using functions like fopen(), fclose(), getc(), putc(), fprintf(), and fscanf(). It provides examples of programs to create a data file by writing user input to a file and to read from an existing data file and display the contents.
Pointer in C
Pointer variables store memory addresses and are used to indirectly access the value stored at those addresses. In C, pointers are declared with an asterisk and the variable type. The address-of operator "&" returns the memory address of a variable, which can be assigned to a pointer variable. The dereference operator "*" accesses the value stored at the memory address pointed to by the pointer. Pointer arithmetic allows pointers to be incremented or decremented to access sequential memory addresses.
One Dimentional Array
This document discusses one-dimensional arrays in three main points:
1) One-dimensional arrays are structured collections of elements that can be of any type and are accessed by index. Arrays are declared with a type and name and allocated with new.
2) Arrays are initialized by providing a list of elements, with subscripts ranging from 0 to the number of elements minus one.
3) Arrays can hold objects by declaring an array of a class type, such as an array of Student objects.
The population is resource or burden for Bangladesh
Bangladesh studies subject related slide. From this, you can find a proper presentation about the burden popolation of Bangladesh.Here are some special feature as like GDP Growth Rate of Bangladesh,RMG Industry lifeline up to 2016! Here's also an amazing Theme about the slide title. Hope it's helpfull for all.
Spherical Polar Coordinate System- physics II
- The document introduces polar coordinates as an alternative coordinate system to Cartesian coordinates.
- In polar coordinates, a point P is represented by an ordered pair (r, θ) where r is the distance from a fixed point called the pole (or origin) to P, and θ is the angle between the polar axis and the line from the pole to P.
- Formulas are provided to convert between Cartesian (x, y) coordinates and polar (r, θ) coordinates. Specifically, r2 = x2 + y2 and θ = tan-1(y/x).
- An example shows calculating the polar coordinates (5, 0.93) for the Cartesian point (3, 4).
More from Sonya Akter Rupa (9)
The population is resource or burden for Bangladesh
The population is resource or burden for Bangladesh
Recently uploaded
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
Literature Review Basics and Understanding Reference Management.pptx
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
Casting-Defect-inSlab continuous casting.pdf
Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting
学校原版美国波士顿大学毕业证学历学位证书原版一模一样
原版一模一样【微信：741003700 】【美国波士顿大学毕业证学历学位证书】【微信：741003700 】学位证，留信认证（真实可查，永久存档）offer、雅思、外壳等材料/诚信可靠,可直接看成品样本，帮您解决无法毕业带来的各种难题！外壳，原版制作，诚信可靠，可直接看成品样本。行业标杆！精益求精，诚心合作，真诚制作！多年品质 ,按需精细制作，24小时接单,全套进口原装设备。十五年致力于帮助留学生解决难题，包您满意。
本公司拥有海外各大学样板无数，能完美还原海外各大学 Bachelor Diploma degree, Master Degree Diploma
1:1完美还原海外各大学毕业材料上的工艺：水印，阴影底纹，钢印LOGO烫金烫银，LOGO烫金烫银复合重叠。文字图案浮雕、激光镭射、紫外荧光、温感、复印防伪等防伪工艺。材料咨询办理、认证咨询办理请加学历顾问Q/微741003700
留信网认证的作用:
1:该专业认证可证明留学生真实身份
2:同时对留学生所学专业登记给予评定
3:国家专业人才认证中心颁发入库证书
4:这个认证书并且可以归档倒地方
5:凡事获得留信网入网的信息将会逐步更新到个人身份内，将在公安局网内查询个人身份证信息后，同步读取人才网入库信息
6:个人职称评审加20分
7:个人信誉贷款加10分
8:在国家人才网主办的国家网络招聘大会中纳入资料，供国家高端企业选择人才
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Embedded machine learning-based road conditions and driving behavior monitoring
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
Advanced control scheme of doubly fed induction generator for wind turbine us...
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Understanding Inductive Bias in Machine Learning
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Medical image analysis has witnessed significant advancements with deep learning techniques. In the domain of brain tumor segmentation, the ability to
precisely delineate tumor boundaries from magnetic resonance imaging (MRI)
scans holds profound implications for diagnosis. This study presents an ensemble convolutional neural network (CNN) with transfer learning, integrating
the state-of-the-art Deeplabv3+ architecture with the ResNet18 backbone. The
model is rigorously trained and evaluated, exhibiting remarkable performance
metrics, including an impressive global accuracy of 99.286%, a high-class accuracy of 82.191%, a mean intersection over union (IoU) of 79.900%, a weighted
IoU of 98.620%, and a Boundary F1 (BF) score of 83.303%. Notably, a detailed comparative analysis with existing methods showcases the superiority of
our proposed model. These findings underscore the model’s competence in precise brain tumor localization, underscoring its potential to revolutionize medical
image analysis and enhance healthcare outcomes. This research paves the way
for future exploration and optimization of advanced CNN models in medical
imaging, emphasizing addressing false positives and resource efficiency.
BRAIN TUMOR DETECTION for seminar ppt.pdf
BRAIN TUMOR DETECTION
AND CLASSIFICATION USING
ARTIFICIAL INTELLIGENCE
Comparative analysis between traditional aquaponics and reconstructed aquapon...
The aquaponic system of planting is a method that does not require soil usage. It is a method that only needs water, fish, lava rocks (a substitute for soil), and plants. Aquaponic systems are sustainable and environmentally friendly. Its use not only helps to plant in small spaces but also helps reduce artificial chemical use and minimizes excess water use, as aquaponics consumes 90% less water than soil-based gardening. The study applied a descriptive and experimental design to assess and compare conventional and reconstructed aquaponic methods for reproducing tomatoes. The researchers created an observation checklist to determine the significant factors of the study. The study aims to determine the significant difference between traditional aquaponics and reconstructed aquaponics systems propagating tomatoes in terms of height, weight, girth, and number of fruits. The reconstructed aquaponics system’s higher growth yield results in a much more nourished crop than the traditional aquaponics system. It is superior in its number of fruits, height, weight, and girth measurement. Moreover, the reconstructed aquaponics system is proven to eliminate all the hindrances present in the traditional aquaponics system, which are overcrowding of fish, algae growth, pest problems, contaminated water, and dead fish.
Recently uploaded (20)
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
Literature Review Basics and Understanding Reference Management.pptx
Literature Review Basics and Understanding Reference Management.pptx
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
Embedded machine learning-based road conditions and driving behavior monitoring
Embedded machine learning-based road conditions and driving behavior monitoring
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
gray level transformation unit 3(image processing))
gray level transformation unit 3(image processing))
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Comparative analysis between traditional aquaponics and reconstructed aquapon...
Comparative analysis between traditional aquaponics and reconstructed aquapon...
Two Dimentional Array
- 1. Hamdard University Bangladesh Hamdard Nagar, Gazaria, Munshiganj Presented by : Sonya Akter Rupa ID: 315161009 8th Batch 2nd Semester Department of CSE Presented to : Md. Abdul Mukib Lecturer Department of CSE Two Dimensional Array
- 2. ¤ Array ¤ 2 Dimensional Array ¤ Storage allocation of 2D Array ¤ Declaration of 2D Array ¤ Notation of 2D Array ¤ Input of 2D Array ¤ Output of 2D Array ¤ Addition of 2D Array ¤ Subtraction of 2D Array ¤ Application of 2D Array
- 3. A single line of elements Each element must be the same type Consist of contiguous memory locations The lowest address corresponds to the first element and the highest address to the last element.
- 4. Array 1 Array 2
- 5. Array 1 Array 2
- 6. A two dimensional array has two subscripts/indexes. The first subscript refers to the row, and the second, to the column. Called as multi-dimensional array
- 7. Column 1 Column 2 Row 1 Row 2 Row 3 (0,0) (0,1) (1,0) (1,1) (2,0) (2,1) Contagious memory is allocated to all the array elements.
- 8. int hub[4][3]; the name of the array is hub the type of the array elements is integer the dimension to be 2 (two pairs of brackets [ ] ) the number of elements or size to be 4*3 = 12
- 9. hub = 31, 22, 33 54, 55, 56 Algebraic notation Col 1 Col 2 Col 3 Row 1 Row 2 int hub[2][3] = {(31, 32, 33),(54, 55, 56)}; Array type Array name Array dimension = 2 Two rows Three columns First row second row C notation
- 10. Using nested for loops interactively or with data files. By increasing the index value of the array the elements can be entered in a 2d array. int i,j,hub[3][4]; printf("Enter the elements of hub :n"); for(i=0;i<3;++i) { for(j=0;j<4;++j){ scanf("%f",&hub[i][j]); } }
- 11. The output of two-dimensional arrays should be in the form of rows and columns for readability. By increasing the index value of the array the elements stored at that index value are printed on the output screen. for(i=0 ; i<3 ; i++) { for(j=0 ; j<4 ; j++) { printf(“%d”,hub[i][j]); } printf(“n”); }
- 12. Let two 2D array A and B of size of 2 X 3 is as follow: Sum of two arrays is -
- 13. Let two 2D array A and B of size of 2 X 3 is as follow: Subtraction of two arrays is -
- 14. Storing a table of data Any kind of matrix processing Images are made up of picture elements or pixels and each pixel is one element of the 2D array Modeling relationships, networks, and maps with a graph