Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by ryandany07
0
answers
1
Eigen Value Of A Matrix
For given Matrix: [ 1 2 3 1 5 1 3 1 1 ] Why does the sum of the eigen values of above matrix is the sum of diagonal elements of that matrix?
For given Matrix:[ 1 2 3 1 5 1 3 1 1 ]Why does the sum of the eigen values of above matrix is the sum of diagonal elements of that matrix?
348
views
asked
Sep 4, 2022
Linear Algebra
eigen-value
matrix
engineering-mathematics
+
–
0
answers
2
Linear Algebra
MX = O is a homogeneous equation and such an equation when |M| = 0 has non trivial solution. M: Square Matrix O: Null Matrix Kindly help me with the above statement.
MX = O is a homogeneous equation and such an equation when |M| = 0 has non trivial solution.M: Square MatrixO: Null MatrixKindly help me with the above statement.
276
views
asked
Aug 30, 2022
Mathematical Logic
engineering-mathematics
linear-algebra
matrix
+
–
1
answer
3
Dynamic Programming
int max(int a, int b) { return (a > b) ? a : b; } // Returns the maximum value that can be // put in a knapsack of capacity W int knapSack(int W, int wt[], int val[], int n) { // Base Case if (n == 0 || W == 0) return 0; // If ... , wt, val, n - 1), knapSack(W, wt, val, n - 1)); } This statement implies that the max value return by the two different recursive problems right?
int max(int a, int b) { return (a b) ? a : b; }// Returns the maximum value that can be// put in a knapsack of capacity Wint knapSack(int W, int wt[], int val[], int n){...
826
views
asked
Aug 18, 2022
Algorithms
algorithms
dynamic-programming
knapsack-problem
+
–
2
answers
4
Recursion
#include <stdio.h> int fun(int num) { while(num>0) { num=num*fun(num-1); } return num; } int main() { int x=fun(8); printf("%d",x); return 0; } Hello Folks, I have a doubt related to the above snippet of code. Why does the output of the above code be 0? Kindly help me with a detailed explanation.
#include <stdio.h int fun(int num) { while(num>0) { num=num*fun(num-1); } return num; } int main() { int x=fun(8); printf("%d",x); ret...
963
views
commented
Aug 15, 2022
Programming in C
programming-in-c
recursion
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register