#include <iostream>
#define m 100
using namespace std;
int main()
{
int arr[m][m],r,c,i,j;
cout<<"Enter Your Number of Row and Column: ";
cin>>r>>c;
for(i=0;i<r;i++){
for(j=0;j<c;j++){
cout<<"Enter "<<i<<" Row "<<j<<" Column :";
cin>>arr[i][j];
}
}
for(i=0;i<r;i++){
for(j=0;j<c;j++){
cout<<arr[i][j]<<" ";
}
cout<<endl;
}
cout<<"Enter Your Row and Column and you want to access: ";
cin>>r>>c;
cout<<"Your Element is "<<arr[r][c];
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int n,num=0,r;
cin>>n;
int a = n;
while(n>0){
r = n%10;
num = num*10 + r;
n/=10;
}
// cout<<num;
if(num==a)
cout<<"Palindrome";
else
cout<<"Not Palindrome";
cout<<endl;
return 0;
}
#include <stdio.h>
#include <stdlib.h>
struct queue{
int front,rear;
int capacity;
int size;
int *array;
};
struct queue *create(int capacity){
struct queue *q = malloc(sizeof(struct queue));
if(!q){
printf("Not enough Space\n");
return NULL;
}
else{
q->capacity = capacity;
q->front = q->rear = -1;
q->size = 0;
q->array = malloc(sizeof(int)*q->capacity);
if(!q){
printf("Not enough Space!!\n");
return NULL;
}
return q;
}
}
int size(struct queue *q){
return q->size;
}
int frontelement(struct queue *q){
return q->array[q->front];
}
int rearelement(struct queue *q){
return q->array[q->rear];
}
int fullqueue(struct queue *q){
return q->size==q->capacity;
}
int emptyqueue(struct queue *q){
return q->size==0;
}
void enqueue(struct queue *q,int data){
if(fullqueue(q)){
printf("Queue Overflow\n");
return;
}
q->rear = (q->rear+1)%(q->capacity);
q->array[q->rear] = data;
if(q->front==-1){
q->front=q->rear;
q->size+=1;
}
}
int dequeue(struct queue *q){
if(emptyqueue(q)){
printf("Queue is empty\n");
return -1;
}
int data;
data = q->array[q->front];
if(q->front == q->rear){
q->front = q->rear = -1;
q->size = 0;
}else{
q->front = (q->front+1)%(q->capacity);
q->size-=1;
}
return data;
}
void delete(struct queue *q){
if(q){
if(q->array)
free(q->array);
free(q);
}
}
int main()
{
int capacity = 5,i;
struct queue *qu = create(capacity);
for(i=0;i<capacity;i++){
enqueue(qu,i);
}
printf("FrontElement is %d \n",frontelement(qu));
printf("rearElement is %d \n",rearelement(qu));
return 0;
}
#include <stdio.h>
#define max 100
int main() {
int arr1[max][max],arr2[max][max],arr3[max][max],arr4[max][max];
int k,i,j,n;
printf("Enter Row and Column of Matrix(both Should be equal to perform the Operation): ");
scanf("%d",&n);
printf("Enter Your Array 1 Element\n");
for(i=0;i<n;i++)
for(j=0;j<n;j++){
printf("Enter %d Row %d Column: ",i,j);
scanf("%d",&arr1[i][j]);
}
printf("Enter Your Array 2 Element\n");
for(i=0;i<n;i++)
for(j=0;j<n;j++){
printf("Enter %d Row %d Column: ",i,j);
scanf("%d",&arr2[i][j]);
}
printf("\nYour Matrix 1 is \n");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
printf("%d ",arr1[i][j]);
}
printf("\n");
}
printf("Your Matrix 2 is \n");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
printf("%d ",arr2[i][j]);
}
printf("\n");
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
arr3[i][j]+=arr1[i][j]+arr2[i][j];
}
}
printf("\nYour Addition of Matrix is \n");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
printf("%d ",arr3[i][j]);
}
printf("\n");
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
arr4[i][j]=0;
for(k=0;k<n;k++)
arr4[i][j]+=arr1[i][k]*arr2[k][j];
}
}
printf("\nYour mutiplication of Matrix is \n");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
printf("%d ",arr4[i][j]);
}
printf("\n");
}
return 0;
}
// program to implement array
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
struct stack{
int top;
int capacity;
int *array;
};
struct stack *create(int size){
struct stack *s = (struct stack *)malloc(sizeof(struct stack));
if(!s){
printf("Not enough space\n");
return NULL;
}
s->capacity = size;
s->top = -1;
s->array = malloc(s->capacity*sizeof(int));
if(!s->array){
printf("Not enough space\n");
return NULL;
}
return s;
}
int isempty(struct stack *s){
return (s->top==-1);
}
int isfull(struct stack *s){
return (s->top==s->capacity-1);
}
int size(struct stack *s){
return (s->top+1);
}
void push(struct stack *s,int data){
if(isfull(s)){
printf("stack overflow\n");
return;
}
else
s->array[++s->top]=data;
}
int pop(struct stack *s){
if(isempty(s)){
printf("Stack is underflow\n");
return -1;
}
return s->array[s->top--];
}
int peek(struct stack *s){
if(isempty(s)){
printf("stack is Empty\n");
return -1;
}
else
return (s->array[s->top]);
}
int main()
{
int capacity=15,i;
struct stack *stk = create(capacity);
for(i=0;i<capacity;i++){
push(stk,i);
}
printf("Top element in stack %d \n",peek(stk));
printf("Deleted element in stack %d \n",pop(stk));
printf("Top element in stack %d \n",peek(stk));
printf("No of Element in Stack %d \n",size(stk));
return 0;
}
.png)
