Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
51 changes: 51 additions & 0 deletions Matrix multiplication
Original file line number Diff line number Diff line change
@@ -0,0 +1,51 @@
#include <stdio.h>

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;
}
12 changes: 12 additions & 0 deletions c/Tower of Hanoi in C
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
#include<stdio.h>
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');
}
12 changes: 12 additions & 0 deletions c/c:Tower of Hanoi in C
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
#include<stdio.h>
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');
}
14 changes: 14 additions & 0 deletions python/patterns/Pattern.py
Original file line number Diff line number Diff line change
@@ -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