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
complete unit 1 explaination || DAA subject || Design and analysis of algorithms ||
btech cse
An algorithm is step by step procedure for solving problem or to complete a task is
known as algorithm
...
pseudocode is an informal and
artificial language that helps programmers to develop an algorithm
...
Each algorithm must take 0 comma 1 or more quantities as input and
should produce at least oneoutput
...
An algorithm is said to be
efficient and fast if it takes less time to execute and consumes less memory space
...
The amount of
time that an algorithm requires for its execution is known as time complexity
...
There are two components of time complexity, capacity of system and space
complexity
...
Space complexity
space complexity is same as time complexity only difference is that in place of time
we need to write space
...
There are three components of space complexity: instruction space, environmental
stack and data space
...
By using asymptotic
notation we can calculate time complexity of an algorithm
...
Big o notation is united by capital o symbol
...
Bigo notation is mainly used to represent upper bound of an algorithm 's
runtime
...
The point
at which these two lines meet is known n naught where n is greater than naught
...
The condition is that f of n is equal to o into g of n so in
order to prove this condition we need to satisfy this condition
...
Big omega notation is mainly used to
represent lower bound of an algorithm
...
represent upper bound of algorithm but big omega notation
represents lower bound
...
by using big o
notation we can calculate best case time
...
Theta notation is mainly used to represent average bond of an algorithm and by using
theta notation we can calculate average case time complexity
...
n and point at which these two lines made is known
as n naught
...
to c 2 into g of n which is an upper
bound and where f of n is placing in between this this this graphical representation is
...
Little
omega notation definition is same as little omega notation
...
There are some rules which
we need to follow in order to calculate frequency count of an algorithm
...