Array operations
Download as PPTX, PDF5 likes6,250 views
This document discusses arrays and operations on arrays. It defines an array as a fixed collection of homogeneous data items stored in contiguous memory locations and indexed by integers. It describes the insert operation as shifting existing elements over and adding the new element at the specified index. It also describes the delete operation as shifting elements back and overwriting the element at the specified index.
1 of 11
Downloaded 112 times
![(index)
A[0] A[1] A[2] A[3] A[4] A[5] A[MAX -1]
10 5 46 2 100 97 ...
Data element value](https://image.slidesharecdn.com/array-140928101958-phpapp02/85/Array-operations-3-320.jpg)
![For example,
index for insertion is i=2 and new element is 17 with N=6. the
MAX is the size of the array A.
A[0] A[1] A[2] … A[N-1] A[MAX-1]
10 5 46 2 100 97 …
Insert index position
Move All Elements From Insert Index Position I N-1 Towards Right By One Position
A[0] 1 2 3 4 5 A[6] A[MAX-1]
10 5 46 2 100 97 …
Insert Index Position](https://image.slidesharecdn.com/array-140928101958-phpapp02/85/Array-operations-5-320.jpg)
![A[0] 1 2 3 4 5 A[6] A[MAX-1]
10 5 46 46 2 100 97 …
Insert index position
Shifted elements](https://image.slidesharecdn.com/array-140928101958-phpapp02/85/Array-operations-6-320.jpg)
![Now, insert (store) new data element 17 at given index position 2:
A[0] 1 2 3 4 5 A[6] A[MAX-1]
10 5 17 46 2 100 97 …
Inserted element
For Every New Element Inserted The Number Of Elements
I.E N Should Be Incremented By 1. If N= Max-1 Then Array
Is Full And Insertion Operation Cannot Be Performed As
There Is No Space For New Element In The Array.](https://image.slidesharecdn.com/array-140928101958-phpapp02/85/Array-operations-7-320.jpg)
![The delete operation will delete the element at
specified element index from one-dimensional array.
The deletion operation performed by shifting all the
elements one position before from index i=1 to N-1
where i is the index of element to be deleted. A[i] =
A[i+1], for all i to N-1 . This shifting causes
overwriting of the said element with element at next
index position.](https://image.slidesharecdn.com/array-140928101958-phpapp02/85/Array-operations-8-320.jpg)
![For example,
For an array N=7 and index position for deletion is
i=3 and maximum array size as MAX.
A[0] 1 2 3 4 5 A[6] A[MAX-1]
10 5 17 46 2 100 97 …
Delete Index Position
Now , Shift All Element From Index 4 To 6 One Position Before As Below:
A[0] 1 2 3 4 5 A[6] A[MAX-1]
10 5 17 46 2 100 97 …
Element At Index 3
The Array After The Shifting Backward Is:](https://image.slidesharecdn.com/array-140928101958-phpapp02/85/Array-operations-9-320.jpg)
![A[0] 1 2 3 4 A[5] A[MAX-1]
10 5 17 2 100 97 97 …
Last element of array
The element 46 is deleted from the array. After every
delete operation the number of elements N should be
decrement by 1. if array is empty , the deletion operation
cannot be performed .](https://image.slidesharecdn.com/array-140928101958-phpapp02/85/Array-operations-10-320.jpg)
Ad
Recommended
Functional groups[1]![Functional groups[1]](https://cdn.slidesharecdn.com/ss_thumbnails/functionalgroups1-170419130105-thumbnail.jpg?width=560&fit=bounds)
Functional groups[1]Usman Shah I hope You all like it. I hope It is very beneficial for you all. I really thought that you all get enough knowledge from this presentation. This presentation is about materials and their classifications. After you read this presentation you knowledge is not as before.
Quick sort-Data Structure
Quick sort-Data StructureJeanie Arnoco Quicksort is a divide and conquer sorting algorithm that works by partitioning an array around a pivot value. It then recursively sorts the sub-arrays on each side. The key steps are: 1) Choose a pivot element to split the array into left and right halves, with all elements on the left being less than the pivot and all on the right being greater; 2) Recursively quicksort the left and right halves; 3) Combine the now-sorted left and right halves into a fully sorted array. The example demonstrates quicksorting an array of 6 elements by repeatedly partitioning around a pivot until the entire array is sorted.
Signals & systems 
Signals & systems SathyaVigneshR This document contains lecture notes on signals and systems for a course at Chadalawada Ramanamma Engineering College. It includes:
1. An introduction to signals, systems, and some common elementary signals like the unit step, unit impulse, ramp, sinusoid, and exponential signals.
2. A classification of signals as continuous/discrete, deterministic/non-deterministic, even/odd, periodic/aperiodic, energy/power, and real/imaginary.
3. A discussion of basic operations on signals like amplitude scaling, addition, and subtraction.
Software Engineering MCQs
Software Engineering MCQsGurpreet singh This document contains 50 multiple choice questions related to software engineering. It covers topics like software development models, software quality assurance, software metrics, software testing techniques and more. Each question has 4 answer options with one correct answer. The questions aim to test the reader's understanding of key concepts, principles and processes in software engineering.
Signals & Systems PPT
Signals & Systems PPTJay Baria Classification of signals and systems as well as their properties are given in the PPT .Examples related to types of signals and systems are also given .
Shell sorting
Shell sortingTUC Shell sort is a generalization of insertion sort that improves efficiency by allowing exchanges of elements far apart. It works by sorting arrays with increasingly smaller increments or gaps between elements, starting with the largest possible gap and reducing it until a gap of 1 is reached, at which point the list will be fully sorted. The algorithm avoids large shifts compared to insertion sort by first sorting sublists with far-apart elements to put items in nearly sorted order before switching to adjacent elements.
Quick sort
Quick sortAfaq Mansoor Khan Quicksort is a divide and conquer algorithm that works by partitioning an array around a pivot value and recursively sorting the subarrays. It first selects a pivot element and partitions the array by moving all elements less than the pivot before it and greater elements after it. The subarrays are then recursively sorted through this process. When implemented efficiently with an in-place partition, quicksort is one of the fastest sorting algorithms in practice, with average case performance of O(n log n) time but worst case of O(n^2) time.
Domain name system (dns)
Domain name system (dns)Atikur Rahman The document discusses the Domain Name System (DNS) and how it works. DNS is an internet directory service that maps hostnames to IP addresses, allowing users to use names instead of numbers. It uses a distributed, hierarchical system of name servers to perform this name resolution in a scalable way. DNS caches mappings for performance, starting queries at the highest level domains and following delegations between servers until the answer is found. DNS has become a major attack vector, so protection of DNS infrastructure and traffic is important.
Arrays in Data Structure and Algorithm 
Arrays in Data Structure and Algorithm KristinaBorooah This is a presentation on Arrays, one of the most important topics on Data Structures and algorithms. Anyone who is new to DSA or wants to have a theoretical understanding of the same can refer to it :D
Linked List - Insertion & Deletion
Linked List - Insertion & DeletionAfaq Mansoor Khan These slides are part of a full series of slides which covers almost all the basic concepts of data structures and algorithms.
Part 6
sorting and its types
sorting and its typesSIVASHANKARIRAJAN This document discusses different types of sorting algorithms. It describes internal sorting and external sorting, with internal sorting handling all data in memory and external sorting requiring external memory. Bubble sort, selection sort, and insertion sort are briefly explained as examples of sorting methods. Bubble sort works by comparing adjacent elements and swapping if out of order, selection sort finds the minimum element and selection sort inserts elements into the sorted position. Pseudocode and examples are provided for each algorithm.
Data Types - Premetive and Non Premetive 
Data Types - Premetive and Non Premetive Raj Naik This document discusses data types in C programming. It describes primitive data types like integers, floats, characters and their syntax. It also covers non-primitive data types like arrays, structures, unions, and linked lists. Arrays store a collection of similar data types, structures group different data types, and unions store different types in the same memory location. Linked lists are dynamic data structures using pointers. The document also provides overviews of stacks and queues, describing their LIFO and FIFO properties respectively.
Linked list
Linked listKalaivaniKS1 Linked lists are linear data structures where elements are linked using pointers. The three main types are singly, doubly, and circular linked lists. Linked lists allow dynamic memory allocation and fast insertion/deletion compared to arrays but slower access. A linked list contains nodes, each with a data field and pointer to the next node. Basic operations on linked lists include insertion, deletion, traversal, and search. Doubly linked lists include pointers to both the next and previous nodes.
Stacks IN DATA STRUCTURES
Stacks IN DATA STRUCTURESSowmya Jyothi 1) Stacks are linear data structures that follow the LIFO (last-in, first-out) principle. Elements can only be inserted or removed from one end called the top of the stack.
2) The basic stack operations are push, which adds an element to the top of the stack, and pop, which removes an element from the top.
3) Stacks have many applications including evaluating arithmetic expressions by converting them to postfix notation and implementing the backtracking technique in recursive backtracking problems like tower of Hanoi.
Binary Search
Binary Searchkunj desai This document describes binary search and provides an example of how it works. It begins with an introduction to binary search, noting that it can only be used on sorted lists and involves comparing the search key to the middle element. It then provides pseudocode for the binary search algorithm. The document analyzes the time complexity of binary search as O(log n) in the average and worst cases. It notes the advantages of binary search are its efficiency, while the disadvantage is that the list must be sorted. Applications mentioned include database searching and solving equations.
Sparse matrix and its representation data structure
Sparse matrix and its representation data structureVardhil Patel The document discusses sparse matrices and their efficient representation. It defines a sparse matrix as one with very few non-zero elements, so representing it as a standard 2D array wastes space storing many zero values. More efficient representations of sparse matrices include storing only the non-zero elements and their indices in a triplet format, or using a linked list structure with one list per row containing (column, value) node pairs. Examples of each approach are provided.
Stack
StackZaid Shabbir A stack is a data structure where items can only be inserted and removed from one end. The last item inserted is the first item removed (LIFO). Common examples include stacks of books, plates, or bank transactions. Key stack operations are push to insert, pop to remove, and functions to check if the stack is empty or full. Stacks can be used to implement operations like reversing a string, converting infix to postfix notation, and evaluating arithmetic expressions.
Hashing in datastructure
Hashing in datastructurerajshreemuthiah The document discusses hash tables and hashing techniques. It describes how hash tables use a hash function to map keys to positions in a table. Collisions can occur if multiple keys map to the same position. There are two main approaches to handling collisions - open hashing which stores collided items in linked lists, and closed hashing which uses techniques like linear probing to find alternate positions in the table. The document also discusses various hash functions and their properties, like minimizing collisions.
Linked list
Linked listTrupti Agrawal This document discusses linked lists and polynomials represented as linked lists. It provides details on singly linked lists, including how to implement insertion and deletion of nodes. It also describes how to represent stacks and queues as dynamically linked lists. Finally, it discusses representing polynomials using arrays or linked lists, and how to perform addition and multiplication of polynomials in each representation.
Hashing Technique In Data Structures
Hashing Technique In Data StructuresSHAKOOR AB This document discusses different searching methods like sequential, binary, and hashing. It defines searching as finding an element within a list. Sequential search searches lists sequentially until the element is found or the end is reached, with efficiency of O(n) in worst case. Binary search works on sorted arrays by eliminating half of remaining elements at each step, with efficiency of O(log n). Hashing maps keys to table positions using a hash function, allowing searches, inserts and deletes in O(1) time on average. Good hash functions uniformly distribute keys and generate different hashes for similar keys.
Binary search
Binary searchAparnaKumari31 Binary search is an algorithm that finds the position of a target value within a sorted array. It works by recursively dividing the array range in half and searching only within the appropriate half. The time complexity is O(log n) in the average and worst cases and O(1) in the best case, making it very efficient for searching sorted data. However, it requires the list to be sorted for it to work.
Breadth First Search & Depth First Search
Breadth First Search & Depth First SearchKevin Jadiya The slides attached here describes how Breadth first search and Depth First Search technique is used in Traversing a graph/tree with Algorithm and simple code snippet.
Hash table
Hash tableRajendran This document discusses hashing techniques for implementing symbol tables. It begins by reviewing the motivation for symbol tables in compilers and describing the basic operations of search, insertion and deletion that a hash table aims to support efficiently. It then discusses direct addressing and its limitations when key ranges are large. The concept of a hash function is introduced to map keys to a smaller range to enable direct addressing. Collision resolution techniques of chaining and open addressing are covered. Analysis of expected costs for different operations on chaining hash tables is provided. Various hash functions are described including division and multiplication methods, and the importance of choosing a hash function to distribute keys uniformly is discussed. The document concludes by mentioning universal hashing as a technique to randomize the hash function
2D Array 
2D Array Ehatsham Riaz 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.
Doubly Linked List
Doubly Linked ListV.V.Vanniaperumal College for Women Doubly linked lists allow navigation in both directions by linking each node to both the next and previous nodes. Each node contains data and pointers to the next and previous nodes. Operations like insertion and deletion are more complex than with singly linked lists since both next and previous pointers must be updated. However, elements can be easily accessed from either direction. Basic operations on doubly linked lists include insertion and deletion at the beginning, end, or at a specified position in the list by adjusting the relevant next and previous pointers.
sparse matrix in data structure
sparse matrix in data structureMAHALAKSHMI P This document discusses sparse matrices. It defines a sparse matrix as a matrix with more zero values than non-zero values. Sparse matrices can save space by only storing the non-zero elements and their indices rather than allocating space for all elements. Two common representations for sparse matrices are the triplet representation, which stores the non-zero values and their row and column indices, and the linked representation, which connects the non-zero elements. Applications of sparse matrices include solving large systems of equations.
AVL Tree in Data Structure 
AVL Tree in Data Structure Vrushali Dhanokar This document discusses AVL trees, which are height-balanced binary search trees. It defines AVL trees, explains why they are useful by comparing insertion performance to regular binary search trees, and covers balance factors, rotations, and the insertion algorithm. Key points made include that AVL trees have logarithmic time complexity for operations through self-balancing, and maintain an extra balance factor field for each node. Various example questions related to building AVL trees from data are also provided.
Doubly Linked List
Doubly Linked ListNinad Mankar Each node in a doubly linked list contains two pointers - one pointing to the next node and one pointing to the previous node. This allows traversal in both directions through the list. A doubly linked list supports common operations like insertion and deletion at both ends of the list as well as anywhere in the list by updating the relevant pointer fields of the nodes. While requiring more space per node, doubly linked lists allow easy traversal backwards through the list and reversing of the list.
القوائم المترابطة Linked List باستخدام لغة جافا
القوائم المترابطة Linked List باستخدام لغة جافاMahmoud Alfarra This document discusses linked lists in Java. It defines a linked list as a collection of nodes where each node contains a data field and a reference to the next node. The document explains how to implement a linked list using a self-referential Node class with next and data fields. It also discusses common linked list operations like adding and removing nodes at different positions. Finally, it compares linked lists to array lists and outlines some variations of linked lists.
Queue Data Structure
Queue Data StructureSriram Raj queue datastructure made easy and datastructure explained in java. visit http://technoexplore.blogspot.com and http://hotjobstuff.blogspot.com for some other important presentations.
Ad
More Related Content
What's hot (20)
Arrays in Data Structure and Algorithm
Arrays in Data Structure and Algorithm KristinaBorooah This is a presentation on Arrays, one of the most important topics on Data Structures and algorithms. Anyone who is new to DSA or wants to have a theoretical understanding of the same can refer to it :D
Linked List - Insertion & Deletion
Linked List - Insertion & DeletionAfaq Mansoor Khan These slides are part of a full series of slides which covers almost all the basic concepts of data structures and algorithms.
Part 6
sorting and its types
sorting and its typesSIVASHANKARIRAJAN This document discusses different types of sorting algorithms. It describes internal sorting and external sorting, with internal sorting handling all data in memory and external sorting requiring external memory. Bubble sort, selection sort, and insertion sort are briefly explained as examples of sorting methods. Bubble sort works by comparing adjacent elements and swapping if out of order, selection sort finds the minimum element and selection sort inserts elements into the sorted position. Pseudocode and examples are provided for each algorithm.
Data Types - Premetive and Non Premetive
Data Types - Premetive and Non Premetive Raj Naik This document discusses data types in C programming. It describes primitive data types like integers, floats, characters and their syntax. It also covers non-primitive data types like arrays, structures, unions, and linked lists. Arrays store a collection of similar data types, structures group different data types, and unions store different types in the same memory location. Linked lists are dynamic data structures using pointers. The document also provides overviews of stacks and queues, describing their LIFO and FIFO properties respectively.
Linked list
Linked listKalaivaniKS1 Linked lists are linear data structures where elements are linked using pointers. The three main types are singly, doubly, and circular linked lists. Linked lists allow dynamic memory allocation and fast insertion/deletion compared to arrays but slower access. A linked list contains nodes, each with a data field and pointer to the next node. Basic operations on linked lists include insertion, deletion, traversal, and search. Doubly linked lists include pointers to both the next and previous nodes.
Stacks IN DATA STRUCTURES
Stacks IN DATA STRUCTURESSowmya Jyothi 1) Stacks are linear data structures that follow the LIFO (last-in, first-out) principle. Elements can only be inserted or removed from one end called the top of the stack.
2) The basic stack operations are push, which adds an element to the top of the stack, and pop, which removes an element from the top.
3) Stacks have many applications including evaluating arithmetic expressions by converting them to postfix notation and implementing the backtracking technique in recursive backtracking problems like tower of Hanoi.
Binary Search
Binary Searchkunj desai This document describes binary search and provides an example of how it works. It begins with an introduction to binary search, noting that it can only be used on sorted lists and involves comparing the search key to the middle element. It then provides pseudocode for the binary search algorithm. The document analyzes the time complexity of binary search as O(log n) in the average and worst cases. It notes the advantages of binary search are its efficiency, while the disadvantage is that the list must be sorted. Applications mentioned include database searching and solving equations.
Sparse matrix and its representation data structure
Sparse matrix and its representation data structureVardhil Patel The document discusses sparse matrices and their efficient representation. It defines a sparse matrix as one with very few non-zero elements, so representing it as a standard 2D array wastes space storing many zero values. More efficient representations of sparse matrices include storing only the non-zero elements and their indices in a triplet format, or using a linked list structure with one list per row containing (column, value) node pairs. Examples of each approach are provided.
Stack
StackZaid Shabbir A stack is a data structure where items can only be inserted and removed from one end. The last item inserted is the first item removed (LIFO). Common examples include stacks of books, plates, or bank transactions. Key stack operations are push to insert, pop to remove, and functions to check if the stack is empty or full. Stacks can be used to implement operations like reversing a string, converting infix to postfix notation, and evaluating arithmetic expressions.
Hashing in datastructure
Hashing in datastructurerajshreemuthiah The document discusses hash tables and hashing techniques. It describes how hash tables use a hash function to map keys to positions in a table. Collisions can occur if multiple keys map to the same position. There are two main approaches to handling collisions - open hashing which stores collided items in linked lists, and closed hashing which uses techniques like linear probing to find alternate positions in the table. The document also discusses various hash functions and their properties, like minimizing collisions.
Linked list
Linked listTrupti Agrawal This document discusses linked lists and polynomials represented as linked lists. It provides details on singly linked lists, including how to implement insertion and deletion of nodes. It also describes how to represent stacks and queues as dynamically linked lists. Finally, it discusses representing polynomials using arrays or linked lists, and how to perform addition and multiplication of polynomials in each representation.
Hashing Technique In Data Structures
Hashing Technique In Data StructuresSHAKOOR AB This document discusses different searching methods like sequential, binary, and hashing. It defines searching as finding an element within a list. Sequential search searches lists sequentially until the element is found or the end is reached, with efficiency of O(n) in worst case. Binary search works on sorted arrays by eliminating half of remaining elements at each step, with efficiency of O(log n). Hashing maps keys to table positions using a hash function, allowing searches, inserts and deletes in O(1) time on average. Good hash functions uniformly distribute keys and generate different hashes for similar keys.
Binary search
Binary searchAparnaKumari31 Binary search is an algorithm that finds the position of a target value within a sorted array. It works by recursively dividing the array range in half and searching only within the appropriate half. The time complexity is O(log n) in the average and worst cases and O(1) in the best case, making it very efficient for searching sorted data. However, it requires the list to be sorted for it to work.
Breadth First Search & Depth First Search
Breadth First Search & Depth First SearchKevin Jadiya The slides attached here describes how Breadth first search and Depth First Search technique is used in Traversing a graph/tree with Algorithm and simple code snippet.
Hash table
Hash tableRajendran This document discusses hashing techniques for implementing symbol tables. It begins by reviewing the motivation for symbol tables in compilers and describing the basic operations of search, insertion and deletion that a hash table aims to support efficiently. It then discusses direct addressing and its limitations when key ranges are large. The concept of a hash function is introduced to map keys to a smaller range to enable direct addressing. Collision resolution techniques of chaining and open addressing are covered. Analysis of expected costs for different operations on chaining hash tables is provided. Various hash functions are described including division and multiplication methods, and the importance of choosing a hash function to distribute keys uniformly is discussed. The document concludes by mentioning universal hashing as a technique to randomize the hash function
2D Array
2D Array Ehatsham Riaz 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.
Doubly Linked List
Doubly Linked ListV.V.Vanniaperumal College for Women Doubly linked lists allow navigation in both directions by linking each node to both the next and previous nodes. Each node contains data and pointers to the next and previous nodes. Operations like insertion and deletion are more complex than with singly linked lists since both next and previous pointers must be updated. However, elements can be easily accessed from either direction. Basic operations on doubly linked lists include insertion and deletion at the beginning, end, or at a specified position in the list by adjusting the relevant next and previous pointers.
sparse matrix in data structure
sparse matrix in data structureMAHALAKSHMI P This document discusses sparse matrices. It defines a sparse matrix as a matrix with more zero values than non-zero values. Sparse matrices can save space by only storing the non-zero elements and their indices rather than allocating space for all elements. Two common representations for sparse matrices are the triplet representation, which stores the non-zero values and their row and column indices, and the linked representation, which connects the non-zero elements. Applications of sparse matrices include solving large systems of equations.
AVL Tree in Data Structure
AVL Tree in Data Structure Vrushali Dhanokar This document discusses AVL trees, which are height-balanced binary search trees. It defines AVL trees, explains why they are useful by comparing insertion performance to regular binary search trees, and covers balance factors, rotations, and the insertion algorithm. Key points made include that AVL trees have logarithmic time complexity for operations through self-balancing, and maintain an extra balance factor field for each node. Various example questions related to building AVL trees from data are also provided.
Doubly Linked List
Doubly Linked ListNinad Mankar Each node in a doubly linked list contains two pointers - one pointing to the next node and one pointing to the previous node. This allows traversal in both directions through the list. A doubly linked list supports common operations like insertion and deletion at both ends of the list as well as anywhere in the list by updating the relevant pointer fields of the nodes. While requiring more space per node, doubly linked lists allow easy traversal backwards through the list and reversing of the list.
Viewers also liked (8)
القوائم المترابطة Linked List باستخدام لغة جافا
القوائم المترابطة Linked List باستخدام لغة جافاMahmoud Alfarra This document discusses linked lists in Java. It defines a linked list as a collection of nodes where each node contains a data field and a reference to the next node. The document explains how to implement a linked list using a self-referential Node class with next and data fields. It also discusses common linked list operations like adding and removing nodes at different positions. Finally, it compares linked lists to array lists and outlines some variations of linked lists.
Queue Data Structure
Queue Data StructureSriram Raj queue datastructure made easy and datastructure explained in java. visit http://technoexplore.blogspot.com and http://hotjobstuff.blogspot.com for some other important presentations.
المحاضرة الثامنة: تراكيب البيانات الطابور
المحاضرة الثامنة: تراكيب البيانات الطابورMahmoud Alfarra This document discusses data structures and queues in Java. It provides an introduction to queues, describing them as first-in, first-out data structures where elements are appended to the end and removed from the beginning. It also discusses priority queues, where elements have priorities and the highest priority element is removed first. The document then discusses implementing queues and priority queues in Java and provides code examples for queue operations like enqueue and dequeue. It concludes with briefly mentioning some queue variations like circular queues and double-ended queues.
3 Array operations
3 Array operationsMahmoud Alfarra This document discusses array operations in Java, including inserting and deleting values from arrays. It provides code examples for inserting a value at a specific index or suitable position, and for deleting a value by index or value. The time complexity of these operations is analyzed, with inserting and deleting from an array both having linear time complexity of O(n) due to potential array shifting. Examples of edge cases like all values being smaller than a new insert value are also discussed.
1 intro of data structure course
1 intro of data structure courseMahmoud Alfarra This document provides information about a data structures course taught using Java in 2015. It was prepared by Mahmoud Rafeek Al-farra and includes sections on course contents, description and guidelines, the lecturer, course outline, resources, assessment, important dates, activities, and tips for being successful. The lecturer is Mahmoud Rafeek Alfarra who has an MSc in computer science and is currently a lecturer and the head of the Admission and Registration Department at UCST.
2 introduction to data structure
2 introduction to data structureMahmoud Alfarra This document discusses data structures in Java. It begins with an introduction to data structures and their classification as linear, non-linear, static, or dynamic memory allocation. Linear structures include linked lists, stacks, and queues, while non-linear structures are trees and graphs. The document then covers generic programming in Java, collection classes like ArrayLists and LinkedLists, and applications of common data structures. Big-O notation for analyzing algorithms is also introduced. The document contains examples and source code to demonstrate working with collections in Java.
Multidimensional array in C
Multidimensional array in CSmit Parikh 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.
Data structure and algorithm with java implementation by obaid kakar
Data structure and algorithm with java implementation by obaid kakarObaid Kakar Array linked list Bubble sort insertion sort selection sort merge sort quick sort graph and tree stack and queue algorithm with java implementation
by obaid kakar University Of Balochistan
Ad
Similar to Array operations (20)
A sorted linear array 
A sorted linear array Suneel Dogra This document describes algorithms for inserting and deleting elements from a sorted or unsorted array. The insert sorted algorithm inserts an element into the correct position in a sorted array by shifting elements down. The insert unsorted algorithm inserts an element into a specified location by shifting elements downward. The delete algorithm removes an element from a specified location by shifting elements upward and decrementing the count.
AD3251-LINKED LIST,STACK ADT,QUEUE ADT.docx
AD3251-LINKED LIST,STACK ADT,QUEUE ADT.docxAmuthachenthiruK Here's a suggestion for a description to upload your document on a website:
"Unlock the power of data structures with our comprehensive guide! Dive into the world of linked lists, Stack ADT (Abstract Data Type), and Queue ADT with our expertly curated document. Whether you're a seasoned programmer or just starting out, our resource provides clear explanations, insightful examples, and practical applications to help you master these fundamental concepts. Explore the intricacies of linked lists for efficient data storage, understand the versatility of Stack ADT for managing data in a Last-In, First-Out (LIFO) fashion, and delve into the functionality of Queue ADT for orderly data processing in a First-In, First-Out (FIFO) manner. Elevate your understanding of data structures and revolutionize your programming skills with our invaluable document. With clear explanations, illustrative examples, and practical exercises, our document equips you with the knowledge and skills needed to conquer data structure challenges with confidence. Whether you're a student embarking on your journey into computer science or a seasoned developer .Seeking to expand your repertoire, our resource is your roadmap to success.
Download our document now and embark on a transformative learning experience that will elevate your programming prowess to new heights!"
Sorting techniques
Sorting techniquesSukhvinder Singh Insertion sort works by scanning an array from left to right and inserting each element into its sorted position in the previously sorted left portion. Quicksort works by partitioning the array around a pivot value, recursively sorting the left and right partitions, and combining the results. It chooses a pivot element and rearranges the array such that all elements smaller than the pivot are to its left and larger elements to its right.
Insertion and Redix Sort
Insertion and Redix SortSukhvinder Singh The document describes the insertion sort algorithm. It works by scanning an array from the first element to the last, inserting each element into the proper position in the previously sorted portion of the array. It also describes the quicksort algorithm, which works by partitioning the array around a pivot element and recursively sorting the subarrays.
![UNIT V Searching Sorting Hashing Techniques [Autosaved].pptx](https://cdn.slidesharecdn.com/ss_thumbnails/unitvsearchingsortinghashingtechniquesautosaved-241014040608-74caa0f6-thumbnail.jpg?width=560&fit=bounds)
UNIT V Searching Sorting Hashing Techniques [Autosaved].pptx![UNIT V Searching Sorting Hashing Techniques [Autosaved].pptx](https://cdn.slidesharecdn.com/ss_thumbnails/unitvsearchingsortinghashingtechniquesautosaved-241126054304-95a69c51-thumbnail.jpg?width=560&fit=bounds)
UNIT V Searching Sorting Hashing Techniques [Autosaved].pptxVISWANATHAN R V Sorting — Merge sort — Quick sort — Insertion sort — Shell sort — Radix sort; Hashing — Hash Functions — Collision resolution techniques — Linear Probing — Separate Chaining — Open Addressing — Rehashing — Extendible Hashing.
DSA Unit II array.pptx
DSA Unit II array.pptxsayalishivarkar1 The document discusses linear data structures using sequential organization. It begins by defining sequential organization as arranging data in a linear order within computer memory such that each element has a unique successor. Arrays are presented as a fundamental example of a sequentially organized data structure, where elements are stored in consecutive memory locations and can be accessed randomly in constant time. The document then covers topics like multi-dimensional arrays, ordered lists, and operations on arrays like insertion, deletion, and retrieval. It also discusses representation of arrays and calculating element addresses.
linked list (c#)
linked list (c#)swajahatr The document discusses list data structures and their implementation using arrays and linked memory. It describes common list operations like insertion, removal, searching, and provides examples of how to implement them with arrays and linked lists. Key list operations include adding and removing elements from different positions, accessing elements by index or pointer, and traversing the list forward and backward. Linked lists offer more flexibility than arrays by not requiring predefined memory allocation.
MODULE 5-Searching and-sorting
MODULE 5-Searching and-sortingnikshaikh786 This document provides information on various searching and sorting algorithms, including linear search, binary search, bubble sort, selection sort, and insertion sort. It begins with an overview of searching and describes linear and binary search algorithms. For linear search, it provides pseudocode and an example. For binary search, it also provides pseudocode and an example. The document then discusses sorting algorithms like bubble sort, selection sort, and insertion sort, providing descriptions, pseudocode, examples, and analyses of each.
Linked list
Linked listYoung Alista The document discusses lists and linked lists. It begins by describing lists and their implementations using arrays and linked lists. It then focuses on linked list implementations, describing linear linked lists and their representation, operations like traversal, search, insert, and delete. Doubly linked lists are also covered, along with their representation and similar operations. The document provides detailed code examples for many of the linked list operations.
Linked list
Linked listJames Wong The document discusses lists and linked lists. It begins by describing lists and their implementations using arrays and linked lists. It then focuses on linked list implementations, describing linear linked lists and their representation, operations like traversal, search, insert, and delete. It also covers doubly linked lists, their representation, and similar common operations. The document provides detailed code examples for many of the linked list operations.
Linked list
Linked listTony Nguyen The document discusses lists and linked lists. It begins by defining a list as a homogeneous collection of elements with a linear relationship between elements that can be ordered or unordered. Lists can be implemented using arrays or linked lists. The document then discusses implementing lists using arrays and linked lists. It covers linked list definitions, representations, and common operations like traversing, searching, inserting and deleting elements. It also discusses different types of linked lists like linear linked lists, doubly linked lists, and their implementations.
Linked list
Linked listHarry Potter The document discusses lists and linked lists. It begins by defining a list as a homogeneous collection of elements with a linear relationship between elements that can be ordered or unordered. Lists can be implemented using arrays or linked lists. The document then discusses implementing lists using arrays and linked lists. It covers linked list definitions, representations, and common operations like traversing, searching, inserting and deleting elements. It also discusses different types of linked lists like linear linked lists, doubly linked lists, and their implementations.
Linked list
Linked listHoang Nguyen The document discusses lists and linked lists. It begins by defining a list as a homogeneous collection of elements with a linear relationship between elements that can be ordered or unordered. Lists can be implemented using arrays or linked lists. The document then discusses implementing lists using arrays and linked lists. It covers linked list definitions, representations, and common operations like traversing, searching, inserting and deleting elements. It also discusses different types of linked lists like linear linked lists, doubly linked lists, and their implementations.
Linked list
Linked listFraboni Ec The document discusses linked lists and their implementation. It begins by listing the objectives, which are to describe linked lists, how they can be implemented using linked structures, and how to implement various operations on linked lists. It then defines linked lists and describes how they can be implemented using either arrays or linked structures. The rest of the document discusses implementing linked lists using linked nodes, representing them in memory, and how to perform common operations like traversing, searching, inserting and deleting elements from the linked list.
Linked list
Linked listLuis Goldster The document discusses linked lists and their implementation. It begins by listing the objectives, which are to describe linked lists, how they can be implemented using linked structures, and how to implement various operations on linked lists. It then defines linked lists and describes how they can be implemented using either arrays or linked structures. The rest of the document discusses implementing linked lists using linked nodes, representing them in memory, and how to perform common operations like traversing, searching, inserting and deleting elements from the linked list.
Array Presentation
Array PresentationDeep Prajapati Microplacer An array is a collection of data items, all of the same type, accessed using a common name. A one-dimensional array is like a list; A two dimensional array is like a table; The C language places no limits on the number of dimensions in an array, though specific implementations may.
Arrays.pptx
Arrays.pptxKoteswari Kasireddy An array is a collection of homogeneous data elements stored in contiguous memory locations. Arrays can be one-dimensional, containing elements accessed via a single index, or multi-dimensional, containing elements accessed via multiple indices. Elements in a one-dimensional array are stored sequentially in memory. Multi-dimensional arrays can be stored in row-major or column-major order, affecting how element locations are calculated. Common array operations include traversal, insertion, deletion, sorting, and searching of elements.
Arrays
ArraysSARITHA REDDY The document discusses arrays in data structures using C programming language. It defines what an array is and describes different types of arrays like one-dimensional, two-dimensional, and multi-dimensional arrays. It also explains array operations such as insertion, deletion, traversal, reversing, sorting, and searching. Additionally, it covers merging of arrays, arrays of pointers, and using arrays to represent polynomials.
Ad
Recently uploaded (20)
International Journal of Distributed and Parallel systems (IJDPS)
International Journal of Distributed and Parallel systems (IJDPS)samueljackson3773 The growth of Internet and other web technologies requires the development of new
algorithms and architectures for parallel and distributed computing. International journal of
Distributed and parallel systems is a bimonthly open access peer-reviewed journal aims to
publish high quality scientific papers arising from original research and development from
the international community in the areas of parallel and distributed systems. IJDPS serves
as a platform for engineers and researchers to present new ideas and system technology,
with an interactive and friendly, but strongly professional atmosphere.
RICS Membership-(The Royal Institution of Chartered Surveyors).pdf
RICS Membership-(The Royal Institution of Chartered Surveyors).pdfMohamedAbdelkader115 Glad to be one of only 14 members inside Kuwait to hold this credential.
Please check the members inside kuwait from this link:
https://www.rics.org/networking/find-a-member.html?firstname=&lastname=&town=&country=Kuwait&member_grade=(AssocRICS)&expert_witness=&accrediation=&page=1
"Feed Water Heaters in Thermal Power Plants: Types, Working, and Efficiency G...
"Feed Water Heaters in Thermal Power Plants: Types, Working, and Efficiency G...Infopitaara A feed water heater is a device used in power plants to preheat water before it enters the boiler. It plays a critical role in improving the overall efficiency of the power generation process, especially in thermal power plants.
🔧 Function of a Feed Water Heater:
It uses steam extracted from the turbine to preheat the feed water.
This reduces the fuel required to convert water into steam in the boiler.
It supports Regenerative Rankine Cycle, increasing plant efficiency.
🔍 Types of Feed Water Heaters:
Open Feed Water Heater (Direct Contact)
Steam and water come into direct contact.
Mixing occurs, and heat is transferred directly.
Common in low-pressure stages.
Closed Feed Water Heater (Surface Type)
Steam and water are separated by tubes.
Heat is transferred through tube walls.
Common in high-pressure systems.
⚙️ Advantages:
Improves thermal efficiency.
Reduces fuel consumption.
Lowers thermal stress on boiler components.
Minimizes corrosion by removing dissolved gases.
Introduction to FLUID MECHANICS & KINEMATICS
Introduction to FLUID MECHANICS & KINEMATICSnarayanaswamygdas Fluid mechanics is the branch of physics concerned with the mechanics of fluids (liquids, gases, and plasmas) and the forces on them. Originally applied to water (hydromechanics), it found applications in a wide range of disciplines, including mechanical, aerospace, civil, chemical, and biomedical engineering, as well as geophysics, oceanography, meteorology, astrophysics, and biology.
It can be divided into fluid statics, the study of various fluids at rest, and fluid dynamics.
Fluid statics, also known as hydrostatics, is the study of fluids at rest, specifically when there's no relative motion between fluid particles. It focuses on the conditions under which fluids are in stable equilibrium and doesn't involve fluid motion.
Fluid kinematics is the branch of fluid mechanics that focuses on describing and analyzing the motion of fluids, such as liquids and gases, without considering the forces that cause the motion. It deals with the geometrical and temporal aspects of fluid flow, including velocity and acceleration. Fluid dynamics, on the other hand, considers the forces acting on the fluid.
Fluid dynamics is the study of the effect of forces on fluid motion. It is a branch of continuum mechanics, a subject which models matter without using the information that it is made out of atoms; that is, it models matter from a macroscopic viewpoint rather than from microscopic.
Fluid mechanics, especially fluid dynamics, is an active field of research, typically mathematically complex. Many problems are partly or wholly unsolved and are best addressed by numerical methods, typically using computers. A modern discipline, called computational fluid dynamics (CFD), is devoted to this approach. Particle image velocimetry, an experimental method for visualizing and analyzing fluid flow, also takes advantage of the highly visual nature of fluid flow.
Fundamentally, every fluid mechanical system is assumed to obey the basic laws :
Conservation of mass
Conservation of energy
Conservation of momentum
The continuum assumption
For example, the assumption that mass is conserved means that for any fixed control volume (for example, a spherical volume)—enclosed by a control surface—the rate of change of the mass contained in that volume is equal to the rate at which mass is passing through the surface from outside to inside, minus the rate at which mass is passing from inside to outside. This can be expressed as an equation in integral form over the control volume.
The continuum assumption is an idealization of continuum mechanics under which fluids can be treated as continuous, even though, on a microscopic scale, they are composed of molecules. Under the continuum assumption, macroscopic (observed/measurable) properties such as density, pressure, temperature, and bulk velocity are taken to be well-defined at "infinitesimal" volume elements—small in comparison to the characteristic length scale of the system, but large in comparison to molecular length scale
Compiler Design_Lexical Analysis phase.pptx
Compiler Design_Lexical Analysis phase.pptxRushaliDeshmukh2 The role of the lexical analyzer
Specification of tokens
Finite state machines
From a regular expressions to an NFA
Convert NFA to DFA
Transforming grammars and regular expressions
Transforming automata to grammars
Language for specifying lexical analyzers
fluke dealers in bangalore..............
fluke dealers in bangalore..............Haresh Vaswani The Fluke 925 is a vane anemometer, a handheld device designed to measure wind speed, air flow (volume), and temperature. It features a separate sensor and display unit, allowing greater flexibility and ease of use in tight or hard-to-reach spaces. The Fluke 925 is particularly suitable for HVAC (heating, ventilation, and air conditioning) maintenance in both residential and commercial buildings, offering a durable and cost-effective solution for routine airflow diagnostics.
Degree_of_Automation.pdf for Instrumentation and industrial specialist
Degree_of_Automation.pdf for Instrumentation and industrial specialistshreyabhosale19 degree of Automation for industrial and Instrumentation learners.
Artificial Intelligence (AI) basics.pptx
Artificial Intelligence (AI) basics.pptxaditichinar its all about Artificial Intelligence(Ai) and Machine Learning and not on advanced level you can study before the exam or can check for some information on Ai for project
Process Parameter Optimization for Minimizing Springback in Cold Drawing Proc...
Process Parameter Optimization for Minimizing Springback in Cold Drawing Proc...Journal of Soft Computing in Civil Engineering In tube drawing process, a tube is pulled out through a die and a plug to reduce its diameter and thickness as per the requirement. Dimensional accuracy of cold drawn tubes plays a vital role in the further quality of end products and controlling rejection in manufacturing processes of these end products. Springback phenomenon is the elastic strain recovery after removal of forming loads, causes geometrical inaccuracies in drawn tubes. Further, this leads to difficulty in achieving close dimensional tolerances. In the present work springback of EN 8 D tube material is studied for various cold drawing parameters. The process parameters in this work include die semi-angle, land width and drawing speed. The experimentation is done using Taguchi’s L36 orthogonal array, and then optimization is done in data analysis software Minitab 17. The results of ANOVA shows that 15 degrees die semi-angle,5 mm land width and 6 m/min drawing speed yields least springback. Furthermore, optimization algorithms named Particle Swarm Optimization (PSO), Simulated Annealing (SA) and Genetic Algorithm (GA) are applied which shows that 15 degrees die semi-angle, 10 mm land width and 8 m/min drawing speed results in minimal springback with almost 10.5 % improvement. Finally, the results of experimentation are validated with Finite Element Analysis technique using ANSYS.
Avnet Silica's PCIM 2025 Highlights Flyer
Avnet Silica's PCIM 2025 Highlights FlyerWillDavies22 See what you can expect to find on Avnet Silica's stand at PCIM 2025.
AI-assisted Software Testing (3-hours tutorial)
AI-assisted Software Testing (3-hours tutorial)Vəhid Gəruslu Invited tutorial at the Istanbul Software Testing Conference (ISTC) 2025 https://iststc.com/
Lidar for Autonomous Driving, LiDAR Mapping for Driverless Cars.pptx
Lidar for Autonomous Driving, LiDAR Mapping for Driverless Cars.pptxRishavKumar530754 LiDAR-Based System for Autonomous Cars
Autonomous Driving with LiDAR Tech
LiDAR Integration in Self-Driving Cars
Self-Driving Vehicles Using LiDAR
LiDAR Mapping for Driverless Cars
Process Parameter Optimization for Minimizing Springback in Cold Drawing Proc...
Process Parameter Optimization for Minimizing Springback in Cold Drawing Proc...Journal of Soft Computing in Civil Engineering
Array operations
- 2. It Is An Ordered List, Which Consist Of A Fixed Number Of Homogeneous Data Items (Elements).An Array Is A Primitive Data Structure. These Elements Are Stored In Successive Memory Locations According To Size Of Data Type. Array Is Also Referred As Set Of (Index , Value).
- 3. (index) A[0] A[1] A[2] A[3] A[4] A[5] A[MAX -1] 10 5 46 2 100 97 ... Data element value
- 4. The Insert Operation Is Performed By Shifting All The Elements One Position Ahead From Index iTo N-1 Where i Is The Specified Index For New Element Is To Be Inserted. And Adding The New Element To The Array At The Specified Index Position.
- 5. For example, index for insertion is i=2 and new element is 17 with N=6. the MAX is the size of the array A. A[0] A[1] A[2] … A[N-1] A[MAX-1] 10 5 46 2 100 97 … Insert index position Move All Elements From Insert Index Position I N-1 Towards Right By One Position A[0] 1 2 3 4 5 A[6] A[MAX-1] 10 5 46 2 100 97 … Insert Index Position
- 6. A[0] 1 2 3 4 5 A[6] A[MAX-1] 10 5 46 46 2 100 97 … Insert index position Shifted elements
- 7. Now, insert (store) new data element 17 at given index position 2: A[0] 1 2 3 4 5 A[6] A[MAX-1] 10 5 17 46 2 100 97 … Inserted element For Every New Element Inserted The Number Of Elements I.E N Should Be Incremented By 1. If N= Max-1 Then Array Is Full And Insertion Operation Cannot Be Performed As There Is No Space For New Element In The Array.
- 8. The delete operation will delete the element at specified element index from one-dimensional array. The deletion operation performed by shifting all the elements one position before from index i=1 to N-1 where i is the index of element to be deleted. A[i] = A[i+1], for all i to N-1 . This shifting causes overwriting of the said element with element at next index position.
- 9. For example, For an array N=7 and index position for deletion is i=3 and maximum array size as MAX. A[0] 1 2 3 4 5 A[6] A[MAX-1] 10 5 17 46 2 100 97 … Delete Index Position Now , Shift All Element From Index 4 To 6 One Position Before As Below: A[0] 1 2 3 4 5 A[6] A[MAX-1] 10 5 17 46 2 100 97 … Element At Index 3 The Array After The Shifting Backward Is:
- 10. A[0] 1 2 3 4 A[5] A[MAX-1] 10 5 17 2 100 97 97 … Last element of array The element 46 is deleted from the array. After every delete operation the number of elements N should be decrement by 1. if array is empty , the deletion operation cannot be performed .