Profile

Cover photo
AJIT VIJAYEE YADAV
Works at Student
Attended DAV Naraingarh, Ambala
46 followers|20,258 views
AboutPostsPhotosVideos

Stream

AJIT VIJAYEE YADAV

Shared publicly  - 
 
My Site
1
AJIT  VIJAYEE YADAV's profile photo
 
Visit for Various kind of study Materials Like Engineering book,Pdf File ,Programs Code etc.
Add a comment...
Have him in circles
46 people
Akshay Akki's profile photo
Vijayee Yadav's profile photo
Gunjan Kumar's profile photo
Akhil Sharma's profile photo
deepankar kumar's profile photo
Ajit Vijayee's profile photo
Chaitenya Varshney's profile photo
Sourabh Suman's profile photo
Lipika Juneja's profile photo

AJIT VIJAYEE YADAV

Shared publicly  - 
 
Matrix chain multiplication
Matrix chain multiplication - Matrix chain multiplication is an optimization problem which is that can be solved using dynamic programming. Given a sequence of matrices, we want to find the most efficient way to multiply these matrices together. The problem...
OASIS : Matrix chain multiplicationMatrix chain multiplication - Matrix chain multiplication is an optimization problem which is that can be solved using dynamic programming. Given a sequence of matrices, we want to find the most efficient way to multiply these matrices together. The problem is not actually to perform the multiplications, but merely to decide in which order to perform the multiplications. We have many options because matrix multiplication is associative. In other words, no matter how we parenthesize the product, the result will be the same. For example, if we had four matrices A, B, C, and D, we would have: (ABC)D = (AB)(CD) = A(BCD) = A(BC)D = .... <br> <h3>A Dynamic Programming Algorithm</h3><br> To begin, let us assume that all we really want to know is the minimum cost, or minimum number of arithmetic operations, needed to multiply out the matrices. If we are only multiplying two matrices, there is only one way to multiply them, so the minimum cost is the cost of doing this. In general, we can find the minimum cost using the following recursive algorithm: Take the sequence of matrices and separate it into two subsequences. Find the minimum cost of multiplying out each subsequence. Add these costs together, and add in the cost of multiplying the two result matrices. Do this for each possible position at which the sequence of matrices can be split, and take the minimum over all of them. <div class="separator" style="clear: both; text-align: center;">
1
Add a comment...
People
Have him in circles
46 people
Akshay Akki's profile photo
Vijayee Yadav's profile photo
Gunjan Kumar's profile photo
Akhil Sharma's profile photo
deepankar kumar's profile photo
Ajit Vijayee's profile photo
Chaitenya Varshney's profile photo
Sourabh Suman's profile photo
Lipika Juneja's profile photo
Work
Occupation
Student
Skills
Programmer, web designer, hacking
Employment
  • Student
    present
Basic Information
Gender
Male
Other names
AV (ARJUN)
Links
Other profiles
Contributor to
Story
Tagline
A Person with desire of achieving high altitude with positive attitude.
Introduction
I'm an enthusiastic Personality with passion in the things I do and I take pride in my work. I love to explore in all kinds of areas of work, as constant learning and development will broaden my experience. I believe in team spirit, thus being a team player myself, I always build a strong social relationship with my colleaugues.
Education
  • DAV Naraingarh, Ambala
Contact Information
Home
Phone
9896980301
Email
Address
India
Apps with Google+ Sign-in
  • Clash of Clans