Danielj3
On this page, you find all documents, package deals, and flashcards offered by seller danielj3.
- 12
- 0
- 0
Community
- Followers
- Following
12 items
Problems on maxima and minima
This has the problems for maxima and minima from engineering calculus.
- Class notes
- • 8 pages •
-
• MAT 1001
This has the problems for maxima and minima from engineering calculus.
Applications of mutivariable calculus
This has the notes for applications for multivariable calculus - Taylor's expansion for two variables, maxima and minima, constrained maxima and minima and Lagrange's multiplier method.
- Class notes
- • 53 pages •
-
• MAT 1001
This has the notes for applications for multivariable calculus - Taylor's expansion for two variables, maxima and minima, constrained maxima and minima and Lagrange's multiplier method.
Mutivariable calculus
This contains notes for multivariable calculus - limits and continuity, partial derivatives and Jacobian and its properties.
- Class notes
- • 29 pages •
-
• MAT 1001
This contains notes for multivariable calculus - limits and continuity, partial derivatives and Jacobian and its properties.
Laplace transform
This has the notes for Laplace transform, its properties - periodic functions, unit step functions, inverse functions and also notes for inverse Laplace transform.
- Class notes
- • 34 pages •
-
• MAT 1001
This has the notes for Laplace transform, its properties - periodic functions, unit step functions, inverse functions and also notes for inverse Laplace transform.
Application of Single Variable Calculus
It has the notes for single variable calculus (i.e), differentiation and its theorems, integration and its theorems, derivative tests, concavity and also applications of single variable calculus, namely, area and volume between curves.
- Class notes
- • 35 pages •
-
• MAT1001
It has the notes for single variable calculus (i.e), differentiation and its theorems, integration and its theorems, derivative tests, concavity and also applications of single variable calculus, namely, area and volume between curves.
DSA - Prims
This notes is for Prims algorithm used to find the minimum spanning tree in the given graph. It has the explanation, code and example for the algorithm. It also has time complexity, advantages, disadvantages and applications.
- Class notes
- • 3 pages •
-
• CSE 2011
This notes is for Prims algorithm used to find the minimum spanning tree in the given graph. It has the explanation, code and example for the algorithm. It also has time complexity, advantages, disadvantages and applications.
DSA - Prims
This notes is about the greedy method used to solve knapsack algorithm. It has the explanation along with code and example. It also has the complexity, advantages and disadvantages for the greedy method.
- Class notes
- • 3 pages •
-
• CSE 2011
This notes is about the greedy method used to solve knapsack algorithm. It has the explanation along with code and example. It also has the complexity, advantages and disadvantages for the greedy method.
DSA - Quick Sort
This notes contains the summary of quick sort technique in data structures. It has the explanation, algorithm, code, example along with time complexity, advantages and disadvantages of the algorithm.
- Class notes
- • 3 pages •
-
• CSE 2011
This notes contains the summary of quick sort technique in data structures. It has the explanation, algorithm, code, example along with time complexity, advantages and disadvantages of the algorithm.
Data Structures and Algorithms - Heap Sort
This notes contain lessons for heap sort algorithm. It has the explanation, algorithm, its time complexity along with advantages and disadvantages.
- Class notes
- • 2 pages •
-
• CSE 2011
This notes contain lessons for heap sort algorithm. It has the explanation, algorithm, its time complexity along with advantages and disadvantages.
Data Structures and Algorithm - Binary Search
This notes is for binary search algorithm technique. This includes the explanation, algorithm, time complexity of the algorithm, along with its advantages and disadvantages.
- Class notes
- • 3 pages •
This notes is for binary search algorithm technique. This includes the explanation, algorithm, time complexity of the algorithm, along with its advantages and disadvantages.