From 5d5b324395f898f07e278687df59e18499dfce02 Mon Sep 17 00:00:00 2001 From: Aditi Chaurasia <103958459+aditi-chaurasia@users.noreply.github.com> Date: Tue, 18 Oct 2022 01:07:36 +0530 Subject: [PATCH 1/4] Create Matrix multiplication --- Matrix multiplication | 51 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 Matrix multiplication diff --git a/Matrix multiplication b/Matrix multiplication new file mode 100644 index 0000000..f6a4756 --- /dev/null +++ b/Matrix multiplication @@ -0,0 +1,51 @@ +#include + +int main() +{ + int m, n, p, q, c, d, k, sum = 0; + int first[10][10], second[10][10], multiply[10][10]; + + printf("Enter number of rows and columns of first matrix\n"); + scanf("%d%d", &m, &n); + printf("Enter elements of first matrix\n"); + + for (c = 0; c < m; c++) + for (d = 0; d < n; d++) + scanf("%d", &first[c][d]); + + printf("Enter number of rows and columns of second matrix\n"); + scanf("%d%d", &p, &q); + + if (n != p) + printf("The multiplication isn't possible.\n"); + else + { + printf("Enter elements of second matrix\n"); + + for (c = 0; c < p; c++) + for (d = 0; d < q; d++) + scanf("%d", &second[c][d]); + + for (c = 0; c < m; c++) { + for (d = 0; d < q; d++) { + for (k = 0; k < p; k++) { + sum = sum + first[c][k]*second[k][d]; + } + + multiply[c][d] = sum; + sum = 0; + } + } + + printf("Product of the matrices:\n"); + + for (c = 0; c < m; c++) { + for (d = 0; d < q; d++) + printf("%d\t", multiply[c][d]); + + printf("\n"); + } + } + + return 0; +} From 2e33fbebe4aecafacb6cd3c899651e729f755f22 Mon Sep 17 00:00:00 2001 From: Aditi Chaurasia <103958459+aditi-chaurasia@users.noreply.github.com> Date: Wed, 19 Oct 2022 01:56:02 +0530 Subject: [PATCH 2/4] Create Pattern.py --- python/patterns/Pattern.py | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 python/patterns/Pattern.py diff --git a/python/patterns/Pattern.py b/python/patterns/Pattern.py new file mode 100644 index 0000000..d8ef57d --- /dev/null +++ b/python/patterns/Pattern.py @@ -0,0 +1,14 @@ +# Generating Inverse Hollow Pyramid Pattern Using Stars + +row = int(input('Enter number of rows required: ')) + +for i in range(row,0,-1): + for j in range(row-i): + print(' ', end='') # printing space and staying in same line + + for j in range(2*i-1): + if i==0 or i==row or j==2*i-2 or j==0: + print('*',end='') # printing * and staying in same line + else: + print(' ', end='') # printing space and staying in same line + print() # printing new line From c895efb0f9c35475c01f85f44fd144081985b9a1 Mon Sep 17 00:00:00 2001 From: Aditi Chaurasia <103958459+aditi-chaurasia@users.noreply.github.com> Date: Wed, 19 Oct 2022 02:29:51 +0530 Subject: [PATCH 3/4] Create Tower of Hanoi in C --- c/Tower of Hanoi in C | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 c/Tower of Hanoi in C diff --git a/c/Tower of Hanoi in C b/c/Tower of Hanoi in C new file mode 100644 index 0000000..b586a33 --- /dev/null +++ b/c/Tower of Hanoi in C @@ -0,0 +1,12 @@ +#include +void TOH(int n,char x,char y,char z) { + if(n>0) { + TOH(n-1,x,z,y); + printf("\n%c to %c",x,y); + TOH(n-1,z,y,x); + } +} +int main() { + int n=3; + TOH(n,'J','K','L'); +} From f21435fd7776bb107a34775aa1671e652ec75c52 Mon Sep 17 00:00:00 2001 From: Aditi Chaurasia <103958459+aditi-chaurasia@users.noreply.github.com> Date: Wed, 19 Oct 2022 02:32:58 +0530 Subject: [PATCH 4/4] Create c:Tower of Hanoi in C --- c/c:Tower of Hanoi in C | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 c/c:Tower of Hanoi in C diff --git a/c/c:Tower of Hanoi in C b/c/c:Tower of Hanoi in C new file mode 100644 index 0000000..b586a33 --- /dev/null +++ b/c/c:Tower of Hanoi in C @@ -0,0 +1,12 @@ +#include +void TOH(int n,char x,char y,char z) { + if(n>0) { + TOH(n-1,x,z,y); + printf("\n%c to %c",x,y); + TOH(n-1,z,y,x); + } +} +int main() { + int n=3; + TOH(n,'J','K','L'); +}