Search for notes by fellow students, in your own course and all over the country.
Browse our notes for titles which look like what you need, you can preview any of the notes via a sample of the contents. After you're happy these are the notes you're after simply pop them into your shopping cart.
Document Preview
Extracts from the notes are below, to see the PDF you'll receive please use the links above
Algorithm & Analysis of Algorithm | L 2 | Data Structure | Infinity Batch | GATE
2022 CSE
Unacademy Computer Science
Vishwadeep is a channel leader on an academy computer science channel for unlimited learning
...
Tomorrow we are going to have a few more things about operating systems in its basic so that
you can learn the small small things of operating system
...
i will be
providing you crash courses and hindi english watches rank improvement batches
...
If you do
not have the good strategy and good planning then you should go for iconic subscription
...
then this operation will be done problem will be solved that is the algorithm
...
We have basically two basis of analysis one is space another one is run time the algorithm needs
how much space to run
...
We
urge you to ask you to come again and again, and again live
...
If
you want to calculate that how much time an algorithm takes to run one option is you implement
that algorithm in some programming language after that you run it on a particular system and
then get the time so let 's suppose you have algorithm number one which is taking t1 time some
unit microsecond nanosecond something for that algorithm
...
case you ca n't control these external factor of course
you can't at some time it might possible that your
...
time your cpu is not loaded so you can not control these
...
Given you n equals to two inputs in an algorithm for algorithm right now look at this suppose
algorithm number one taken two steps and algorithm number two took two steps to perform the
operation it 's intended operation which one is better
...
Rate of growth rate of
growth is called as rate of complexity
...
Algorithm runs for
some time so we are not calculating the time in terms of wall clock second millisecond
nanosecond
...
We write a notation of having constant number of operations
always for any input size
...
The number of steps can be defined to 5 2
6 10 something but if it is constant for any n value then i am going to denote it by 1 then next
complexity you can have is logarithmic
...
Each statement runs how
much time how many times this particular statement will run n plus 1 times
...
If n value is whatever the number of the steps are in terms of linear
yes it 's a linear equation yes in that case i can say the complexity is linear and how do you
denote complexity linear
...
If you are able to
...
Only
those who are learning regularly normally not from really great resources or not putting lots of
efforts