Profile

Cover photo
AJIT VIJAYEE YADAV
Works at QASource Pvt. Ltd
Attends DAV School Naraingarh, Ambala
47 followers|48,567 views
AboutPostsPhotosYouTube

Stream

AJIT VIJAYEE YADAV

Shared publicly  - 
 
Once upon a time two brothers who lived on adjoining farms fell into conflict. It was the first serious rift in 40 years of farming side by side, sharing machinery, and trading labor and goods as needed without a hitch. Then the long collaboration fell apart.
1
Add a comment...

AJIT VIJAYEE YADAV

Shared publicly  - 
 
कोशिश करने वालों की (Koshish Karne Waalon Ki) - हरिवंश राय 'बच्चन' (Harivansh Rai 'Bachchan')
लहरों से डर कर नौका पार नहीं होती, कोशिश करने वालों की कभी हार नहीं होती। नन्हीं चींटी जब दाना लेकर चलती है, चढ़ती दीवारों पर, सौ बार फिसलती है। मन का विश्वास रगों में साहस भरता है, चढ़कर गिरना, गिरकर चढ़ना न अखरता है। आख़िर उसकी मेहनत बेकार नहीं होती, कोशि...
 ·  Translate
कोशिश करने वालों की कभी हार नहीं होती। नन्हीं चींटी जब दाना लेकर चलती है, चढ़ती दीवारों पर, सौ बार फिसलती है। मन का विश्वास रगों में साहस भरता है,
1
Add a comment...

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
47 people
nonu mongia's profile photo
Sourabh Suman's profile photo
Kamlesh Yadav's profile photo
Shashi Ranjan's profile photo
Gaurav Pundir's profile photo
Aryan Kohli's profile photo
ravikant dheeraj's profile photo
Sanjay kumar Yadav's profile photo
Sidharth Mehta's profile photo

AJIT VIJAYEE YADAV

Shared publicly  - 
 
BUILDING BRIDGES
Once upon a time two brothers who lived on adjoining farms fell into conflict. It was the first serious rift in 40 years of farming side by side, sharing machinery, and trading labor and goods as needed without a hitch.
Then the long collaboration fell apar...
Once upon a time two brothers who lived on adjoining farms fell into conflict. It was the first serious rift in 40 years of farming side by side, sharing machinery, and trading labor and goods as needed without a hitch. Then the long collaboration fell apart.
1
Add a comment...

AJIT VIJAYEE YADAV

Shared publicly  - 
 
**
कोशिश करने वालों की (Koshish Karne Waalon Ki) - हरिवंश राय 'बच्चन' (Harivansh Rai 'Bachchan')
लहरों से डर कर नौका पार नहीं होती,
कोशिश करने वालों की कभी हार नहीं होती।

नन्हीं चींटी जब दाना लेकर चलती है,
चढ़ती दीवारों पर, सौ बार फिसलती है।
मन का विश्वास रगो...
 ·  Translate
कोशिश करने वालों की (Koshish Karne Waalon Ki) - हरिवंश राय 'बच्चन' (Harivansh Rai 'Bachchan') लहरों से डर कर नौका पार नहीं होती, कोशिश करने वालों की कभी हार नहीं होती। नन्हीं चींटी जब दाना ...
1
Add a comment...

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
47 people
nonu mongia's profile photo
Sourabh Suman's profile photo
Kamlesh Yadav's profile photo
Shashi Ranjan's profile photo
Gaurav Pundir's profile photo
Aryan Kohli's profile photo
ravikant dheeraj's profile photo
Sanjay kumar Yadav's profile photo
Sidharth Mehta's profile photo
Work
Occupation
Student
Skills
Programmer, web designer, hacking
Employment
  • QASource Pvt. Ltd
    present
Basic Information
Gender
Male
Other names
AV (ARJUN)
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 colleagues.


Education
  • DAV School Naraingarh, Ambala
    present
Links
Other profiles
Contributor to