Note - Summary
Algorithms
searching
sorting
algorithm analysis
Design methods
Dynamic programming
Recursion
Greedy
Data Structures
linear
trees
graphs
Algorithms :
finite sequece of step or instructions to solve a problem
No algorithm
Algorithm but too comlex (in network security)
Tractable algorithms(in web applications)
RAM - Random Access Machine
primitive operations
assigning the value to a vollatile
calling a method
performing an arithmatic operations
compare 2 numbers
indexing into an array
following an object refference
returning from a method
Divide and conque
divide in to subproblems
conque - solving
combine them
Searching
Linear Searching
compare the key with the elements(starting 0 to n) return true if the key is found in the array
Binary searching
compare the key with the middle element
If the middle element is the key then return
if not pick one half of the array depending on the key(array is sorted)
Analys the algorithm
basic operations
compare and swap
Sorting
bubble sort
Selection sort
Insertion sort
Quick sort
testing the code
figuring out the test cases
random array
sorted array
equal
empty
two elemented array odd or even number of array
1 element
searching
sorting
algorithm analysis
Design methods
Dynamic programming
Recursion
Greedy
Data Structures
linear
trees
graphs
Algorithms :
finite sequece of step or instructions to solve a problem
No algorithm
Algorithm but too comlex (in network security)
Tractable algorithms(in web applications)
RAM - Random Access Machine
primitive operations
assigning the value to a vollatile
calling a method
performing an arithmatic operations
compare 2 numbers
indexing into an array
following an object refference
returning from a method
Divide and conque
divide in to subproblems
conque - solving
combine them
Searching
Linear Searching
compare the key with the elements(starting 0 to n) return true if the key is found in the array
Binary searching
compare the key with the middle element
If the middle element is the key then return
if not pick one half of the array depending on the key(array is sorted)
Analys the algorithm
basic operations
compare and swap
Sorting
bubble sort
Selection sort
Insertion sort
Quick sort
testing the code
figuring out the test cases
random array
sorted array
equal
empty
two elemented array odd or even number of array
1 element
Comments
Post a Comment