Notesale: Turn your study into money

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above

---

ARRAY IN DATA STRUCTURES
Understanding Memory and Arrays in Programming

In programming, memory is essentially a long tape of
bytes, with each byte containing 8 bits
...
To
understand the need for arrays, we need to examine
how areas can be declared, initialized, and
represented in memory
...
For example, the
data type int typically takes up 4 bytes to store an
integer
...
In traditional
compilers, we generally take 2 or 4 bytes to be the
data type for storing numbers
...


The memory manager would allocate some memory
for storing a variable, and the value stored in memory
would be represented in binary
...


Using Arrays

An array is a collection of more than one element of
the same datatype
...
The

ARRAY IN DATA STRUCTURES
number of elements in an array is determined by the
size of the array
...
In C language, for example, we would write:

int n;

to declare an integer variable
...


Initializing Arrays

Arrays can also be initialized with values
...
In a onedimensional array, the elements are stored in a single
row with multiple columns
...
For example, an array of
integers would take up 2-4 bytes of memory per
element
...


Arrays in Memory

In this video, we will discuss how data is stored in
arrays in memory
...
The array can be statically
initialized at compile time or dynamically initialized at
runtime
...
The elements are stored in sequential/
continuous locations with each element taking up the
same amount of memory
...
The size of the array is
the number of elements it can hold (n), with the index
ranging from 0 to n-1
...


The array follows the random access method, and
accessing an element has a time complexity of O(1)
...
We may not know how much space we

ARRAY IN DATA STRUCTURES
need until runtime
...
If we allocate
less space than needed, we will run out of memory
...
The amount of memory
allocated is not contiguous, and the location of the
data may not be known
...
I have
paraphrased and corrected the text to make it more
readable
...


Working with Arrays in Java

At runtime, loops and standard functions like Scanner
can be used to take user input and store it in arrays
...
We will also cover how to use arrays
and how to access data from them
...



ffi

In this video, we've discussed the declaration,
initialization, and accessing of 1D arrays
...
We will also

ARRAY IN DATA STRUCTURES
discuss how data items are stored in continuous
locations and how random access works
...
However, we have provided formulas and
examples to help with these issues
...
We will also provide code for array
deletion
...

Additionally, arrays do not have any bounds checking
property at runtime, so it is the programmer's
responsibility to check the boundaries of the array in
the program
...
The base address is 100, so
100 to 299 bytes should be allocated to this array
...
The scanf function is used to take input from
the user, and the printf function is used to print

ARRAY IN DATA STRUCTURES
something on the output screen
...
We use a for loop to iterate
over the array, and the value starts from 0 till the size
minus one (i++)
...
The user can insert data
into the array, and the number of data they want to
insert is the size of the array
...


Inserting Data and Indexing

The user can insert data into an array by using the
scanf function
...
The length of a single element is the
same as the number of bytes that will be inserted
...


The index for a value is a single number, and the
number is not an error
...



fi

fi

Deletion and Sorting

In addition to insertion, we will also cover array
deletion and sorting
...



ARRAY IN DATA STRUCTURES
Overall, arrays are an important data structure in
computer science, and understanding how to perform
operations on arrays is essential for any programmer
...


Inserting Data at Speci c Positions

In this tutorial, we will discuss how to insert data at
speci c positions in an array
...


First, we declare a variable 'i' and the header les
...
The code will look like this:

int i;
int a[50];
for(i=0;i<5;i++){
a[i]=i+1;
printf("Index: %d, Value:
%d\n",i,a[i]);
}


This code will create an array of size 50 and print the
values of the array
...
It is the programmer's

ARRAY IN DATA STRUCTURES
responsibility to check the upper bound limit of the
array
...

The programmer can choose to either not insert any
elements or overwrite an existing element
...
Understanding
how to delete data from a speci c position will also
make it easier to delete data from the beginning or
end of the array
...
One variable, size,

fi

fl

ARRAY IN DATA STRUCTURES
is used to determine the maximum size of the array
...
The user will then enter the elements of
the array, which will be initialized at runtime
...
For example, if
they want to delete data from position 2, I will shift
the values from position 3 to 4 and reduce the size of
the array by 1
...
To print the updated array after deletion, I
will use a for loop to print each element of the array
...
If the position is invalid, such as -1 or greater
than the size of the array, I will print "invalid position"
...
When
deleting data from the end of the array, I will simply
decrement the size of the array
...
The time complexity of the deletion operation
depends on the position from which the data is to be
deleted
...

However, if the array is unsorted, a quicker algorithm

ARRAY IN DATA STRUCTURES
is to pick the last element of the array and put it in the
position to be deleted
...




---