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

---

Introduction to Data Structures & Algorithms
CodeWithHarry
should be able to use it in your work or in your projects or in your courses or in your projects
that you are doing in the future or in your work that you are doing right now so if you want to
use something then you should be able to use it in your work or in your projects or in your
courses or in your future work or in your projects that you are doing right now
...
I have been in the industry for a long time now
and I have seen a lot of people learning C , C++ and when they start to learn it they get very
lost & confused & they don't know what they are doing & they don't know how to use the
language properly & eventually they stop learning it & they end up becoming a beginner
again & that is not good for the industry & it is not good for the learners either so I would say
learn C , C++ & don't get lost in the language learning process
a break for a while I understand that you are very busy for the next few days and I
understand that you are very busy for the next few weeks and I understand that you have a
lot of questions so I 'll just stop now and I 'll come back to you in a few days and we will start
the next video where we will talk about algorithms and data structures and then we will talk
about interviews and then finally we will talk about the final exam and you can ask me any
questions that you have in your mind so that 's all for now I 'll come back to you in a few
days and we will start the next videowhat is the data structure of chrome so now we see that
the data structure is called RAM so the data structure of a database is called RAM because
when the program starts it will load into RAM the data structure of the database which is
called RAM
...
I want to keep the data in a different database so what I have to do
is I have to create a new database and I have to name it `` legacyData '' I have to create a
new table in that database and I have to add the following column in the table `` Birthday `` I
have to add the following column in the table `` Year `` Now I have to run the program and I
will get the following result in the console `` Facebook 2020 `` Facebook 2021 `` Facebook
2009 `` `` Facebook 2020 `` Facebook 2021 `` Facebook 2009 `` `` Facebook 2009 `` You
retrieve and read the data from hard disk drive and update it
...
memory
location where the C program stores the data that is to be processed next and the heap is a
memory location where the C program stores the data that is to be processed next but the
data that is to be processed next is not always stored in the same location as the data that is
to be processed next because the C program can keep data in different memory locations
depending on the situation and this is why it is important for you to understand the stack and
heap because you will be able to understand the C program better and be able to ask more
questions on the C program
...
I 'm talking about C program that 's why I say that you

get a good picture of memory with the help of C programming therefore , data structures and
algorithms is best learned from C and C++ Now here I am dividing it into segments so there
is thing called code segment let 's say this is my code let 's say there is a code with the
name `` harry
...
fun2 ( ) is calling inside fun1 ( ) now the variables that I had created inside it will be
created here let 's say I have created `` k '' & `` l '' let me write here : initialize k and l and
after that I 'm calling fun2 ( ) so as soon as fun2 ( ) will be called it will say to fun1 ( ) that you
wait for a while , I call fun2 ( ) and be back by fetching the value whatever it will return fun1 (
) replied that you go and get it call fun2 ( ) and get its value
...
it will say to fun1 ( ) that you 're
coming back and now you can start your execution again
...
So that thing is done here with the
help of dynamic memory because when does the stack of a function end it ends when the
function is returned
...
You go and get it and
then what will happen, fun function will be called
...
If
you still think that you want to do all of these things with Python, then I am saying that when
you will go for an interview, the person in front of you will expect C, C++, or Java from you
...

Time Complexity and Big O Notation (with notes)
CodeWithHarry
So the input size didn't increase and the runtime of the algorithms didn't increase either
...
When we ask questions like as the input will
increase, Then the runtime will change as per what? And after that Now you will go to
aunty's house You will be treated
...

is the algorithm that runs in constant time
...
The sentence is: Run time of it, there are some things that we will recite
...
Now, come here and listen to another story
...
If the game is of N kb then how much time will you need? The sentence is: Run
time of it, there are some things that we will recite
...
There are also algorithms that are not linear in
time
...
THe author states that the complexity of an algorithm is automatically

O(n^5
...
& G ( n ) is intersecting with f ( n )
...
What we have done is WE
have taken a big function and we have made it so that it is always below the original function
and that's what [UNK] means THe definition of [UNK] for a function
...

Best Case, Worst Case and Average Case Analysis of an Algorithm (With Notes)
CodeWithHarry
K is an integer ) SO now I 'll write it like this K n ( K is an integer ) So now I 'll write it Like this
K n ( K is an integer ) So now I 'll write it like this
...
The graph of
( n^2+n ) ; graph of n ; graph of ( N^2+n ) will go below 2n
...
?" This passage discusses Algo 2, which is a cunning person who is
smart
...
Algo 2 says that he will not make useless comparisons, and provides an
example
...
Algo 2 first takes the first and last element of an
array, and then compares them
...
They match, Algo 2 is good; if they don't match
...

The stack do at a particular time point?? SO
...
SO it will go up to factorial 4 at that point in time, And then it will go
back down to factorial 3
...
algorithm will take time X on a computer with processor Y
...
SO
...

But
...
SO that is why I say the
space complexity is O ( N )
...
space complexity is O ( n )
...
IT states that the space complexity
of the algorithm is O ( N ), where n is the size of the input
...
This means that at any given
time, the algorithm will be able to fit in a maximum of three stack frames
...
The algorithm calculates in 10
seconds, and as input grows, so does the time it takes to calculate
...

To be continued…



---