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

---

ARRAYS
1
...
you will see what is the need of ferry what does any types of ferry how
areas can be declared how arrays can be
...
declared and how data can be stored
in memory
...
be converted into binary it 's binary number sorry that is in 32
bits
...
faerie: we have to
process large amount of return that is why the concept of array came now you will
modify this declaration such that under one variable name we can store roll
numbers of all 60 students that is what array now how you can do this
...

The data is stored in consecutive locations or continuous locations one after
another
...
The data is stored
in binary form and the address of the data is calculated in hexadecimal form
...
In next
video, I'm going to discuss it how the data is to be taken from the user how the
data is to be stored in the array
...
After that, we will discuss
what is 2d array as well as how 2d arrays are to be accessed from the air fine
...
2 Array Operations - Traversal, Insertion | Explanation with C Program |
DSA Course
Jenny's Lectures CS IT
You are also going to have to use the interposition function to insert the data at
the beginning of the area
...


1
...

Understanding how to delete data from a specific position will also make it easier
to delete data from the beginning or end of the array
...
One variable, size, 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 is to pick the last element of the array
and put it in the position to be deleted
...


1
...
If you have discussed the relationship between arrays and pointers I
mean that 1d array and pointers you can check out that video also in that I button
...
P can contain address of an integer variable only so this is invalid right so
here can we write P is equal to CP contains address of some another integer
variable address off integer readable so can I write here a the name of theory
...
you fine it
will print in unsigned integer some integer value so you can print if you print in
printf I guess you can
...
can write what a simply the
name of the area or it will give what the address of the first element first element is
what a of 0 0 is what 100 only fine you can say that base address of this is 100
...
If you write this
1s trick a plus 1 then what should be the value C this a name of the 2d array
...
If you do s trick a of 1 it
means when you act this pointer value at this address when you is this complete 1d
array value is not single integer value
...
Esther says the output of this thing
should be the output, just think about it see Esther it a here step by step here in to
solve this a a means it is going to return a snake of 2d array
...

A straight a astray K means value at this address value is what value is this
complete 1d array fine or you can say address of its first element first element in 2d
arrays this complete one dear so it is going to return pointer to this one da find
out
...
Address of a means it is going to give you the address
of the first element of the array
...
If a plus
one arithmetic plus one in the pointer then it is pointing to the CUDA obviously the
next element
...
going to point this the next

---