convert in octal

01knapsack(A.V).cpp

@@ -0,0 +1,124 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int max(int a, int b) 
+{ 
+    return (a > b) ? a : b;
+}
+int knapsack(int wt[], int val[], int W, int N, int** tb)
+    {
+        if(N<=0 || W==0)
+        {
+            return 0;
+        }
+        if(tb[N][W]!=-1)
+        {   //Memoization
+            return tb[N][W];
+        }
+
+        if(wt[N-1]<=W)
+        {
+            return tb[N][W]=max(val[N-1] + knapsack(wt, val, W-wt[N-1],N-1, tb), knapsack(wt, val, W, N-1, tb));
+        }
+        else if(wt[N-1]>W)
+        {
+            return tb[N][W]=knapsack(wt, val, W, N-1, tb);
+        }
+    }
+    int knapSackR(int W, int wt[], int val[], int n) 
+     { 
+    // double pointer to declare the  
+    // table dynamically 
+    int** dp;
+    dp = new int*[n];
+
+    // loop to create the table dynamically 
+    for (int i = 0; i < n; i++)
+        dp[i] = new int[W + 1];
+
+    // loop to initially filled the  
+    // table with -1 
+    for (int i = 0; i < n; i++)
+        for (int j = 0; j < W + 1; j++)
+            dp[i][j] = -1;
+    return knapsack(wt, val, W, n, dp);
+} 
+int main(){
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int t,N,W,x;
+    cin>>t;         //t=[1,100]
+    while(t--)
+    {
+    cin>>N;         //N=[1,1000]
+    cin>>W;         //W=[1,1000]
+    int wt[W];      //wt[i]=[1,1000]
+    int val[N];     //val[i]=[1,1000]
+
+    for (int i = 0; i <N; i++)
+    {
+        /* code */
+        cin>>x;
+        val[i]=x;
+    }
+
+    for (int i = 0; i <W; i++)
+    {
+        /* code */
+        cin>>x;
+        wt[i]=x;
+    }
+    int n = sizeof(val) / sizeof(val[0]);
+    cout << knapSackR(W, wt, val, n);
+    }
+    }
+
+    //top down approach
+    #include <iostream>
+using namespace std;
+
+
+void knap(int n, int w, int val[],int weight[])
+{
+      int t[n+1][w+1];     
+
+
+   //fill  0th rows and coloumns with zero.
+   for(int i=0;i<=n;i++)      
+      t[i][0]=0;
+
+   for(int j=0;j<=w;j++)
+      t[0][j]=0;
+
+
+       for(int i=1;i<=n;i++)
+       {
+           for(int j=1;j<=w;j++)
+           {
+               if(j<weight[i])
+               t[i][j]=t[i-1][j];
+               else
+               t[i][j]=max((val[i]+t[i-1][j-weight[i]]),t[i-1][j]);
+           }
+       }
+
+      cout<<t[n][w]<<endl; //last element
+
+}
+int main() {int y; cin>>y;
+while(y--)
+{ int n; cin>>n;
+   int w; cin>>w;
+   int val[n];int weight[n];
+
+   for(int i=1;i<=n;i++)
+   cin>>val[i];
+
+   for(int i=1;i<=n;i++)
+   cin>>weight[i]; 
+
+ knap(n,w,val,weight);
+
+}
+return 0;
+}

2D Matrices using C

@@ -0,0 +1,40 @@
+#include <stdio.h>
+int main() {
+    int r, c, a[100][100], b[100][100], sum[100][100], i, j;
+    printf("Enter the number of rows (between 1 and 100): ");
+    scanf("%d", &r);
+    printf("Enter the number of columns (between 1 and 100): ");
+    scanf("%d", &c);
+
+    printf("\nEnter elements of 1st matrix:\n");
+    for (i = 0; i < r; ++i)
+        for (j = 0; j < c; ++j) {
+            printf("Enter element a%d%d: ", i + 1, j + 1);
+            scanf("%d", &a[i][j]);
+        }
+
+    printf("Enter elements of 2nd matrix:\n");
+    for (i = 0; i < r; ++i)
+        for (j = 0; j < c; ++j) {
+            printf("Enter element a%d%d: ", i + 1, j + 1);
+            scanf("%d", &b[i][j]);
+        }
+
+    // adding two matrices
+    for (i = 0; i < r; ++i)
+        for (j = 0; j < c; ++j) {
+            sum[i][j] = a[i][j] + b[i][j];
+        }
+
+    // printing the result
+    printf("\nSum of two matrices: \n");
+    for (i = 0; i < r; ++i)
+        for (j = 0; j < c; ++j) {
+            printf("%d   ", sum[i][j]);
+            if (j == c - 1) {
+                printf("\n\n");
+            }
+        }
+
+    return 0;
+}

3D.java

@@ -0,0 +1,49 @@
+public static void main(String[] args) {
+    Scanner getIt = new Scanner(System.in);
+    System.out.println("Input 1 integer n: ");
+    int n = getIt.nextInt();
+    if (n > 0){
+        final double M[][][] = new double[n][n][n];
+        for (int i = 0; i < n; i++)
+            for (int j = 0; j < n; j++)
+                for (int k = 0; k < n; k++)
+                    M[i][j][k] = 3.0;
+        System.out.println("Input 1 integer p: ");
+        int p = getIt.nextInt();
+        if(p > 0){
+          for(int q = 1; q <= p; q++){
+              for (int i = 0; i < n; i++){
+                  for (int j = 0; j < n; j++){
+                      for (int k = 0; k < n; k++){
+                          System.out.printf("%f ", Math.pow(matrixMult(M[i], M[i])[j][k], q));
+                      }
+                      System.out.println("\n");
+                  }
+
+              }
+              System.out.println("xxxxxxxxxxxxxxxxxxxxx");
+          }
+        }
+        else{
+            System.out.println("Woops, you entered a negative p.");
+        }
+    }
+    else{
+        System.out.println("Woops, you entered a negative n.");
+    }
+}
+
+public static double[][] matrixMult(double a[][], double b[][]) {   
+    int aRows = a.length; 
+    int aCols = a[0].length; 
+    int bCols = b[0].length;
+    double[][] result = new double[aRows][bCols];   
+    for(int i = 0; i < aRows; i++){ 
+        for(int j = 0; j < bCols; j++){ 
+            for(int k = 0; k < aCols; k++){ 
+                result[i][j] += a[i][k] * b[k][j];      
+                }
+            }  
+        }   
+    return result;
+}

3_matrix_multiplication_using_numpy.py

@@ -0,0 +1,23 @@
+import numpy as np
+
+np.random.seed(42)
+
+A = np.random.randint(0, 10, size=(2,2))
+
+B = np.random.randint(0, 10, size=(2,3))
+
+C = np.random.randint(0, 10, size=(3,3))
+
+print("Matrix A is:\n{}, shape={}\n".format(A, A.shape))
+
+print("Matrix B is:\n{}, shape={}\n".format(B, B.shape))
+
+print("Matrix C is:\n{}, shape={}\n".format(C, C.shape))
+
+D = np.matmul(np.matmul(A,B), C)
+
+print("Multiplication in the order (AB)C:\n\n{},shape={}\n".format(D, D.shape))
+
+D = np.matmul(A, np.matmul(B,C))
+
+print("Multiplication in the order A(BC):\n\n{},shape={}".format(D, D.shape))

A C++ Program to print ASCII value of given character

@@ -0,0 +1,8 @@
+#include <iostream> 
+using namespace std; 
+int main() 
+{ 
+    char c = 'A'; 
+    cout << "The ASCII value of " << c << " is " << int(c); 
+    return 0; 
+} 

A Program for 2D Matrices

@@ -0,0 +1,40 @@
+#include <stdio.h>
+int main() {
+    int r, c, a[100][100], b[100][100], sum[100][100], i, j;
+    printf("Enter the number of rows (between 1 and 100): ");
+    scanf("%d", &r);
+    printf("Enter the number of columns (between 1 and 100): ");
+    scanf("%d", &c);
+
+    printf("\nEnter elements of 1st matrix:\n");
+    for (i = 0; i < r; ++i)
+        for (j = 0; j < c; ++j) {
+            printf("Enter element a%d%d: ", i + 1, j + 1);
+            scanf("%d", &a[i][j]);
+        }
+
+    printf("Enter elements of 2nd matrix:\n");
+    for (i = 0; i < r; ++i)
+        for (j = 0; j < c; ++j) {
+            printf("Enter element a%d%d: ", i + 1, j + 1);
+            scanf("%d", &b[i][j]);
+        }
+
+    // adding two matrices
+    for (i = 0; i < r; ++i)
+        for (j = 0; j < c; ++j) {
+            sum[i][j] = a[i][j] + b[i][j];
+        }
+
+    // printing the result
+    printf("\nSum of two matrices: \n");
+    for (i = 0; i < r; ++i)
+        for (j = 0; j < c; ++j) {
+            printf("%d   ", sum[i][j]);
+            if (j == c - 1) {
+                printf("\n\n");
+            }
+        }
+
+    return 0;
+}