From 8b9e06810a329f5541226cf014fa6380041caac5 Mon Sep 17 00:00:00 2001 From: udita-22 <79441823+udita-22@users.noreply.github.com> Date: Fri, 29 Oct 2021 14:12:42 +0530 Subject: [PATCH 1/2] Algorithm to Insert Element in Array --- .DS_Store | Bin 8196 -> 14340 bytes C Programs/Fcfs.c | 72 +++++++----- C Programs/Hary.c | 37 ++---- C Programs/HelLoworld.c | 9 +- C Programs/InsertElement.c | 29 +++++ C Programs/MatrixTranspose.c | 65 +++++------ C Programs/Producer_Consumer.c | 117 +++++++++---------- C Programs/Sjf.c | 195 +++++++++++++------------------ C Programs/Sum.c | 14 +-- C Programs/Thread.c | 37 +++--- C++ Programs/Haaryy.cpp | 51 +++----- C++ Programs/Mergesort.cpp | 132 ++++++++++----------- Java Programs/Haaryy.java | 28 ++--- Java Programs/Queue.java | 182 ++++++++++++++++------------- Python Programs/Function.py | 14 ++- Python Programs/Sreelakshmi-M.py | 51 ++++++-- 16 files changed, 510 insertions(+), 523 deletions(-) create mode 100644 C Programs/InsertElement.c diff --git a/.DS_Store b/.DS_Store index 2aa4c3cffb10252c7bad3d37c6c2c7cc7e13e354..a327355c97da660cae1e08a794d86fdf805b4522 100644 GIT binary patch literal 14340 zcmeHNeQX?85r4Ce<30OqZyYyH(;mLm{fHX3wH@0uEo~e-A9b6=sqG|olE%G{jlIoz z*S%faanhhvs0Ab>5EM}Pr$B)}qk^a?fO+l4SERo z7;e-pA#N0z;hdLA=e%^;=<*H&T@1fU-g6>T0uO}ZS9tx(MR}pM4|mUU3ytbklp8&p|+Ryk1RK$Qc_9ANv9#LeYEp**WfX*%#=7oOj<3okF! z*=^^(WT6}=lxJ0mH@HZFqEw(%2r)>3qd!>~H&7_gs#1Xqk~0HOVP+~sC?sb`e^L$? zG@#1rv&w-g2g*6nj;>m{1I;LPX#mSLVeuxa?ABp`k-SkPFbx(o*Seb*Un2|Cu?KK(L;`#^%e)c zc{l4zJY(vGX~xXhl(qi!>As$>&g7P!zB8T4(_6XTyQTlknV8vjP4{iX_s%YzI{m0({ld8kRrQgtVs6rMY3b{4e`drp^3@E@uL$?#&gG5!fe# zA|mb8#9`md2SXCslx5BP_NWb9&Vs!I7=fyVXB(MgH2y(5@1yJ(=u$+-&Na2QU%lyu zo)3O#VCV3@(F@JinwEHLeBGf1$9K{>`@o`;4Q3`&e#UmQjyruAEO!IvxMSyIYp63e z?xtq#3oYv}-*Cm1iA3q>B9@8yv~&Nw6D(OBrm5!GnCOUEPnt)wSma(W%NVorO=4r> zI@3JD{X=;hPt_g2KG7MoQs%f11}PLb#k*sc9~(abxlo|J@qW|F#t!6CX*;L7w#IKY zt-E4}78K>Gvo*fWj7?;`*;x?dtG>a+4%7OPd5kCClk$U+IorkDOxmuEiNqxLZ_j4! zEGXEp{_>W@U5UM>^-J@xKa`q3B2W(2l%DsxC;(+0(+rU z!|WLN;v;fTItH#+d()u`AtaAut;J@cWIrY$t`#@KV;UF7q1_LPPl(6FH^tN9d*Wxv zXTBi*EdDB96aNygi~mp!#i@m^q^s!$x{11|n{J_7={CBZ?xJxzKnE#JCn!fQc@)qY z`Y@fP2kBw@Bz=lLO`oAh>C5yueU-jO=jdDX6n&e1KtG|M(zEm&y+AM1-{|l35BfK~ zP8SVfG#IVMWyU&VlhJMT7+Z{8#%^Q3F=?cYX=6rFU=$Vb9-T5{3GGWOV8QMf=b{y` zefJ&1cgFX;=N0fbO{{WjTQ6JJmb~Wrn|g1)ZTqrdDmgBSZdfIx7HGO7wLnTrsRS$C zjJF?vn%E~Rsi;-Q>TF)%(HpOdw_CMPB-On3Iy6^9iBxlQXM4M4KzCKMtGhjJ)j%_2 z61J}sO)50D-V%>ntDvLm-R%i9MWHb`1T?I1=DRKXzYx!hKZ;kxtKv0UO$}sGJ8hyH zsTZ=oi|&BD@1ebr_X#>oN9ZWoG))fO2k8%JflksAouZG>L-bMl7=0YF{|J4SK1Ywy zmmvRNfd-tTC+O?+4f+l}P2Z>U^o-Pm3-o*X6TMg>+k17{rdKa5+Y4iPH|M$27|9ya z_QvNoPIl!bv1c?Vmh|(SJs9mgkBR$n^0OC_g+~zqA$^xuL%vJBxEtPvE$<4x7yoxs z8-}qkhYg=9gViPBulabYo-F2^6E}&@(v@|yr#Gk1DtQy0wFx*pz_{Sel&q&Erar8o#LHqXtv(gvQX~GG3IM|%<}|3y zVI^FH-=)vWywV`+0Lk91gIUYwVa{ly;|1T(gT+r_KKA04BH+Lu4Q@5y7BP0Ne5?T( z(Z<$eMN1f;!T2106+GNJ5u!g{fMM@?b{Vpa9;RM{Tg4nIUlY@F}Dku%HZde zW02ekuX#N%@Qy-OF^S(FYms2Ye4|-D0cg#is;Y(dvP2s-8a7w?=6y z>)G4H77?ejZF-y7`pazq=PfjB4bampeo6TDvp5-Y(AqLPYQS!3P>q0^h0SIS=M2Gg zB^_rwDV_@1$tIk$`8Ns6dculG2tTLguYFJXv!F$A9M zm-JQ0UP!K766QUYv*_>Y?@V_0^}pksMI?iq%t9ehq8E#S(jP2K%T=sIAnV&M-_UkN zOX34l*4lI`b7DHr$rj`my!>EpJ|c+`N=vkq0F2t%V=G>l?b6B}jl6O*ZYKIKl^gG=|wtiXsn=mmi{yBrwG z3C8A98Duv)w!QS+xw8=RSjWI76u3IJ{pHxY^Qc(VvF+vW{#N$!gRhQ(Coam0Sr(m- zyPj(U&8U2jk)!8T%@muVHDlr^{L{1I^Wt&wqVNJN?ovyCHM8y16@a~$P9u{&yB$+s}{6@ccWN(F5kC^F}gSO>ei9Na9SwGygE zyR6L9FxFZ?M1J5Wc^4kpjFEg;`uM580aT)$sgDe#wRsxAV@K{AyZD@*PXaC?Of>Ec zaqK$m6w}M@JWB~b)nV_-AW;3qkwiZqiyVj+!+;F>)GCXIU-@j1Ol`In%yv>j*^){J zv$@#iam;Mv7eOb>sD`5nQl$cU<+8D)zd`t*!Nz5f%1MAQY$R_rxW>piBisr$TE@>q z{9P|0RoLf3w`}k)0L8ol)(so0=k&llo)OfujB5B+gMtih9$m7xl2hTi>z2nxgr_Wh z8fFutd5<|!5D{P-&{AzY^MnIR-a+0E6;M{-NzK6!Pk3Dw=V6Mq(JgW`OI}hQQ$x_` zVbt-58`jDRl}Ju#I2zId8~W^d`qF1Ei7A<5=|<%ay7pT@vmNDQ}#%vTA)#-mXWy_hKY+iq^#`$MT@xe zpsPZ9M}xD#YbCep55}Txc>|5p;2XuApp^IO&G1iO@d@nHIM%wiAT7}v0*zah4soXr zl(CJPhovc#43;i!^jeH$Tf}J$PRg)-V_Q_T5zJrgp1vcjX(d>~e+W-OQux$WsSy_# zqE8CQn}&t|Vqlq8c9u^9C8v?l2J}&bZmIxXK_f$-mWLd+_e-@_5!%Jy|Lv^&{r~%g z9aTE39C%-HfL84o+c5~zsRH@@tz8oLy|{VIdE9)VEfh)wYT delta 144 zcmZoEXmOBWU|?W$DortDU;r^WfEYvza8E20o2Vx_*}#NF63Ay@0b)j=I0HjILmq f(PdKsFsB^u diff --git a/C Programs/Fcfs.c b/C Programs/Fcfs.c index f777db3..86569b9 100644 --- a/C Programs/Fcfs.c +++ b/C Programs/Fcfs.c @@ -1,37 +1,45 @@ -#include -#include -#include - -void main(){ - int i=0,n,at[100],bt[100],ct[100],tat[100],wt[100]; - float totalTat =0, totalWt=0; - - printf("enter the limit of process required"); - scanf("%d",&n); - - for(i=0;i +int main() +{ + int i,n,at[20],bt[20],ct[20],tat[20],wt[20],sum=0; + float totWT=0,totTAT=0; + printf("Enter the no:of processes:"); + scanf("%d",&n); + + for(i=0;i +#include void main() -{ -char base_digits[16] = -{'0', '1', '2', '3', '4', '5', '6', '7', -'8', '9', 'A', 'B', 'C', 'D', 'E', 'F'}; -int converted_number[64]; -int number_to_convert; -int next_digit, base, index=0; -printf("Decimal to other base conversion program \n"); -printf("Enter a decimal number "); -scanf("%d",&number_to_convert); -printf("Enter desired base to convert: "); -scanf("%d",&base); -while (number_to_convert != 0) -{ -converted_number[index] = number_to_convert % base; -number_to_convert = number_to_convert / base; -++index; -} ---index; -printf("\n\nConverted Number from base 10 to base %d= ",base); -for( ; index>=0; index--) -{ -printf("%c", base_digits[converted_number[index]]); -} -printf("\n"); +{ + unsigned char xdata *ptr=0x4000; + unsigned char xdata *ptr1=0x401a; + int i; + for(i=0;i<5;i++) + { + *ptr1=*ptr; + ptr++; + ptr1++; + } } diff --git a/C Programs/HelLoworld.c b/C Programs/HelLoworld.c index b0ed29d..39c85c8 100644 --- a/C Programs/HelLoworld.c +++ b/C Programs/HelLoworld.c @@ -1,9 +1,6 @@ #include int main() { - printf("Hello, world"); - printf("https://github.com/Gowrishankarvv"); - return 0; + printf(" Hello, World!"); + } - /* HELLO WORLD PROGRAM */ - /* code by gowrishankarvv */ - + diff --git a/C Programs/InsertElement.c b/C Programs/InsertElement.c new file mode 100644 index 0000000..adaeb1e --- /dev/null +++ b/C Programs/InsertElement.c @@ -0,0 +1,29 @@ +#include + +int main() +{ + int arr[100]; + int i, x, pos, n = 7; + + for (i = 0; i < 7; i++) + arr[i] = i + 1; + + for (i = 0; i < n; i++) + printf("%d ", arr[i]); + printf("\n"); + + x = 28; + pos = 5; + n++; + + for (i = n-1; i >= pos; i--) + arr[i] = arr[i - 1]; + + arr[pos - 1] = x; + + for (i = 0; i < n; i++) + printf("%d ", arr[i]); + printf("\n"); + + return 0; +} diff --git a/C Programs/MatrixTranspose.c b/C Programs/MatrixTranspose.c index be93599..8b7be0f 100644 --- a/C Programs/MatrixTranspose.c +++ b/C Programs/MatrixTranspose.c @@ -1,34 +1,33 @@ -/*Program to print transpose of a matrix*/ #include - void main() - { - int i,j,a,b; - int n[10][10]; - int m[10][10]; - printf("Enter number of rows and columns of matrix\n"); - scanf("%d%d",&a,&b); - printf("Enter matrix\n"); - for(i=0;i #include - -int mutex=1,full=0,empty,x=0; - -int main() -{ - int n; - printf("Enter the size: "); - scanf("%d",&n); - empty=n; - void producer(); - void consumer(); - int wait(int); - int signal(int); - printf("\n1.Producer\n2.Consumer\n3.Exit"); - while(1) - { - printf("\nEnter your choice:"); - scanf("%d",&n); - switch(n) - { - case 1: if((mutex==1)&&(empty!=0)) - producer(); - else - printf("Buffer is full!!"); - break; - case 2: if((mutex==1)&&(full!=0)) - consumer(); - else - printf("Buffer is empty!!"); - break; - case 3: - exit(0); - break; - } +#include + +void producer(); +void consumer(); +int wait(int); +int signal(int); + + int mutex =1,c,produced=0,empty,item=0; +void main(){ + + printf("enter the space required"); + scanf("%d",&empty); + printf("1.produce 2.consume 3.exit"); + while(1){ + + printf("enter the choice"); + scanf("%d",&c); + + switch(c){ + case 1 :if(mutex == 1 && empty!=0) + producer(); + else{ + printf("buffer is full"); + } + break; + case 2 :if(mutex == 1 && produced!=0) + consumer(); + else{ + printf("buffer is empty"); + } + break; + case 3 :exit(0); + break; + default : printf("error"); + break; + } + } - - return 0; + } - -int wait(int s) -{ - return (--s); + +int signal(int p){ + return (++p); } - -int signal(int s) -{ - return(++s); +int wait(int p){ + return (--p); } - -void producer() -{ + +void producer(){ mutex=wait(mutex); - full=signal(full); + produced=signal(produced); empty=wait(empty); - x++; - printf("\nProducer produces the item %d",x); - mutex=signal(mutex); + item++; + printf("%d item created",item); + + mutex=signal(mutex); } - -void consumer() -{ + +void consumer(){ mutex=wait(mutex); - full=wait(full); - empty=signal(empty); - printf("\nConsumer consumes item %d",x); - x--; - mutex=signal(mutex); + produced=wait(produced); + empty=signal(empty); + printf("%d item created",item); + item--; + mutex=signal(mutex); } diff --git a/C Programs/Sjf.c b/C Programs/Sjf.c index de606e1..d0273ec 100644 --- a/C Programs/Sjf.c +++ b/C Programs/Sjf.c @@ -1,118 +1,81 @@ -//2. PROGRAM OF STF - -#include - +#include int main() - -{ - -int at [100], bt[100], proces [100], ct [100], tat [100], wt [100]; -int n, i, j, temp, current_time=0, start_time, completed=0 ,count; -float avg_tat=0.0, avg_wt=0.0; - - - -printf ("Enter the number of processes:"); - -scanf ("%d", &n); -for(i=0; i at [j]) - - { - -temp=at[i]; -at[i] = at[j]; - -at[j] = temp; -temp=bt[i]; -bt[i]=bt[j]; -bt[j]=temp; - -temp = proces [i]; -proces [i] = proces [j]; -proces[j]=temp; -} -} -} - -//Scanned with CamScanne - -printf ("\n\n Process\t Arival time\t Burst Time\t Completion time\t Turn Around time\t waiting Time\n\n"); - -while (completed 1) - -for (i=completed; i< (completed + count-1); i++) { - for(j=i+1; jbt[j]) - -{ -temp=at[i]; -at[i] = at[j]; - -at[j] = temp; -temp=bt[i]; -bt[i]=bt[j]; -bt[j]=temp; - -temp = proces [i]; -proces [i] = proces [j]; -proces[j]=temp; - -}}} - - -start_time = current_time; -ct[completed]=start_time + bt [completed]; -tat [completed]= ct [completed]-at [completed]; -wt [completed]=tat [completed]-bt[completed]; -current_time = ct [completed]; -printf ("P%d\t\t%d\t\t%d\t\t%d\t\t %d\t\t %d", proces [completed], at[completed], bt[completed],ct[completed], tat [completed], wt [completed]); -printf("\n"); - -avg_tat+=tat [completed]; -avg_wt+= wt[completed]; - -completed++; -} -avg_tat=avg_tat/n; - -avg_wt = avg_wt/n; - -printf ("Average Turn around time=%.f\n", avg_tat); -printf ("Average waiting time = %f \n", avg_wt); - -return 0; - -} + int at[10],bt[10],pr[10]; + int n,i,j,temp,time=0,count,over=0,sum_wait=0,sum_turnaround=0,start; + float avgwait,avgturn; + printf("Enter the number of processes\n"); + scanf("%d",&n); + for(i=0;iat[j]) + { + temp=at[i]; + at[i]=at[j]; + at[j]=temp; + temp=bt[i]; + bt[i]=bt[j]; + bt[j]=temp; + temp=pr[i]; + pr[i]=pr[j]; + pr[j]=temp; + } + + } + } + printf("\n\nProcess\t\tArrival time\t\tBurst time\t\tWaiting time\t\t\t\tTurnaround time\n\n"); + while(over1) + { + for(i=over;ibt[j]) + { + temp=at[i]; + at[i]=at[j]; + at[j]=temp; + temp=bt[i]; + bt[i]=bt[j]; + bt[j]=temp; + temp=pr[i]; + pr[i]=pr[j]; + pr[j]=temp; + } + } + } + } + start=time; + time+=bt[over]; + printf("p[%d]\t\t\t%d\t\t\t\t\t%d\t\t\t\t\t%d\t\t\t\t\t\t%d\n",pr[over], + at[over],bt[over],time-at[over]-bt[over],time-at[over]); + sum_wait+=time-at[over]-bt[over]; + + + sum_turnaround+=time-at[over]; + over++; + } + avgwait=(float)sum_wait/(float)n; + avgturn=(float)sum_turnaround/(float)n; + printf("Average waiting time is %f\n",avgwait); + printf("Average turnaround time is %f\n",avgturn); + return 0; +} diff --git a/C Programs/Sum.c b/C Programs/Sum.c index 0647b49..3accdd8 100644 --- a/C Programs/Sum.c +++ b/C Programs/Sum.c @@ -1,8 +1,6 @@ -#include -int main() { -int a, b, sum; -printf("\nEnter two no: "); -scanf("%d %d", &a, &b); -sum = a + b; -printf("Sum : %d", sum); -return(0); +#include +void main() +{ + int s=10; + printf("sum=%d",s); +} diff --git a/C Programs/Thread.c b/C Programs/Thread.c index 372eecb..b9de86c 100644 --- a/C Programs/Thread.c +++ b/C Programs/Thread.c @@ -1,37 +1,36 @@ -/* - program to create a thread called add, which acess two integers from the user and print the sum. - -*/ #include -#include //Include the header file " pthread.h ". #include +#include -int global[2]; //// Global variable +int global[2]; -void *sum_thread(void *arg) +void *sumOf(void *arg) { + int *arr; + arr = arg; + int n1,n2,sum; - n1 = global[0]; - n2 = global[1]; + n1=arr[0]; + n2=arr[1]; sum = n1+n2; - printf("Sum = %d\n",sum); + printf("Sum , %d + %d = %d\n",n1,n2,sum); return NULL; } -int main() + +int main() { - printf("Enter the first integer:- "); + printf("Enter First number : "); scanf("%d",&global[0]); - printf("Enter the second integer:- "); + printf("Enter Second number : "); scanf("%d",&global[1]); - pthread_t add_thread; //thread decleration.Here " pthread_t " is the datatype. - pthread_create(&add_thread, NULL, sum_thread, global); //thread is created. - pthread_join(add_thread,NULL); // // Waiting for the created thread to terminate. - + pthread_t add; //unsigned integer value that stores the thread id of the thread created. + pthread_create(&add,NULL,sumOf,global); //thread creation + pthread_join(add,NULL);//waiting for the termination of a thread. + printf("Thread ID: %lu ",add );//Printing thread ID + return 0; } -// to compile the program --->" gcc -o test prgrmName.c -pthread " -// instead of ./a.out use --> " ./test " \ No newline at end of file diff --git a/C++ Programs/Haaryy.cpp b/C++ Programs/Haaryy.cpp index 66b62f6..33c5628 100644 --- a/C++ Programs/Haaryy.cpp +++ b/C++ Programs/Haaryy.cpp @@ -1,42 +1,19 @@ -// C++ program for implementation of Bubble sort -#include -using namespace std; +#include +using namespace std; -void swap(int *xp, int *yp) -{ - int temp = *xp; - *xp = *yp; - *yp = temp; -} +int main() { + int n, reversedNumber = 0, remainder; + cout << "Enter an integer: "; + cin >> n; -void bubbleSort(int arr[], int n) -{ - int i, j; - for (i = 0; i < n-1; i++) - - // Last i elements are already in place - for (j = 0; j < n-i-1; j++) - if (arr[j] > arr[j+1]) - swap(&arr[j], &arr[j+1]); -} + while(n != 0) { + remainder = n%10; + reversedNumber = reversedNumber*10 + remainder; + n /= 10; + } + cout << "Reversed Number = " << reversedNumber; -void printArray(int arr[], int size) -{ - int i; - for (i = 0; i < size; i++) - cout << arr[i] << " "; - cout << endl; -} - - -int main() -{ - int arr[] = {64, 34, 25, 12, 22, 11, 90}; - int n = sizeof(arr)/sizeof(arr[0]); - bubbleSort(arr, n); - cout<<"Sorted array: \n"; - printArray(arr, n); - return 0; -} + return 0; +} diff --git a/C++ Programs/Mergesort.cpp b/C++ Programs/Mergesort.cpp index 0e6f39b..d5c424d 100644 --- a/C++ Programs/Mergesort.cpp +++ b/C++ Programs/Mergesort.cpp @@ -1,81 +1,67 @@ -# Merge Sort is a kind of Divide and Conquer algorithm in computer programming. It is one of the most popular sorting algorithms and a great way to develop confidence in building recursive algorithms. - #include +#include + + using namespace std; -int Merge(int A,int L,int R,) -{ - int i=0; - int j=0; - int k=0; - while(i &arr,int s,int e){ + int i=s; + int m =(s+e)/2; + int j = m+1; + vector temp; + vector res; + + + int cnt =0; + while(i <= m and j <=e){ + + if(arr[i]>n; - - int arr[n]; - for(i = 0; i < n; i++) - { - cout<<"Enter element "<>arr[i]; +int mergeSort(vector &arr,int s ,int e){ + if(s >= e){ + return 0; } - - MergeSort(arr, 0, n-1); - - // Printing the sorted data. - cout<<"\nSorted Data "; - for (i = 0; i < n; i++) - cout<<"->"< arr{3,66,5,2,78,9}; + int s = 0; + int e = arr.size()-1; + cout << mergeSort(arr,s,e) <= n - 1) + { + System.out.println("\n---Overflow!!!---\n\n"); + } + else + { + if (front == -1 && rear == -1) + { + front++; + } + System.out.println("Enter the element to be inserted:"); + item= sc.nextInt(); + rear++; + Ar[rear] = item; + } + display(rear); + } + + //Function To Delete Element In Queue + public static void dequeue () + { + if (front == -1) + { + System.out.println("\n---Error! Underflow!!!---\n\n"); + } + else + { + item = Ar[front]; + System.out.printf("The element deleted is %d\n", item); + if (front == rear) + { + front = -1; + rear = -1; + System.out.printf("\n---Error! Queue is empty---\n\n"); + } + else + { + front++; + display(rear); + } + } + } + + //Function To Display Elements In Queue + public static void display(int rear) + { + int i; + System.out.printf("\nThe current Queue is\n"); + for (i = front; i <= rear; i++) + { + System.out.printf("%d ", Ar[i]); + } + System.out.printf("\n"); + } + + +} - System.out.println("Rear element is " - + queue.rear()); - } -} diff --git a/Python Programs/Function.py b/Python Programs/Function.py index b8c083e..fc3bd16 100644 --- a/Python Programs/Function.py +++ b/Python Programs/Function.py @@ -1,4 +1,12 @@ -def Hello(): - print("Hello from a function") +def filter_even(number_list): + result_list = [] + for number in number_list: + if number % 2 == 0: + result_list.append(number) + return result_list +my_list = [1, 2, 3, 4, 5, 6, 7, 8, 9] -Hello() +even_list = filter_even(my_list) +print(even_list) + +type(even_list) diff --git a/Python Programs/Sreelakshmi-M.py b/Python Programs/Sreelakshmi-M.py index 807dada..bc816aa 100644 --- a/Python Programs/Sreelakshmi-M.py +++ b/Python Programs/Sreelakshmi-M.py @@ -1,16 +1,43 @@ -#archery board +# Program make a simple calculator that can add, subtract, multiply and divide using functions -#Run pip install opencv-python -import cv2 -import numpy as np +# This function adds two numbers +def add(x, y): + return x + y -img=np.zeros((512,512,3),np.uint8)*255 -img[:]=(0,255,255) -text="OpenCV" +# This function subtracts two numbers +def subtract(x, y): + return x - y -cv2.putText(img,text,(10,250),cv2.FONT_HERSHEY_SIMPLEX,2,(0,0,0),5) -cv2.imshow("text",img) +# This function multiplies two numbers +def multiply(x, y): + return x * y -cv2.waitkey(0) -cv2.destroyWindow("text") -cv2.imwrite("text.jpg",img) +# This function divides two numbers +def divide(x, y): + return x / y + +print("Select operation.") +print("1.Add") +print("2.Subtract") +print("3.Multiply") +print("4.Divide") + +# Take input from the user +choice = input("Enter choice(1/2/3/4):") + +num1 = int(input("Enter first number: ")) +num2 = int(input("Enter second number: ")) + +if choice == '1': + print(num1,"+",num2,"=", add(num1,num2)) + +elif choice == '2': + print(num1,"-",num2,"=", subtract(num1,num2)) + +elif choice == '3': + print(num1,"*",num2,"=", multiply(num1,num2)) + +elif choice == '4': + print(num1,"/",num2,"=", divide(num1,num2)) +else: + print("Invalid input") From d5aab6495b65ee97db3e84e10fe8df5ab1dff753 Mon Sep 17 00:00:00 2001 From: udita-22 <79441823+udita-22@users.noreply.github.com> Date: Sat, 30 Oct 2021 16:19:50 +0530 Subject: [PATCH 2/2] Added Algo to merge arrays in c --- C Programs/MergeArrays.c | 45 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 C Programs/MergeArrays.c diff --git a/C Programs/MergeArrays.c b/C Programs/MergeArrays.c new file mode 100644 index 0000000..05d05c5 --- /dev/null +++ b/C Programs/MergeArrays.c @@ -0,0 +1,45 @@ +/* C Program to Merge Two Arrays using For Loop */ +#include + +int main() +{ + int aSize, bSize, mSize, i, j; + int a[10], b[10], Merged[20]; + + printf("\n Please Enter the First Array Size : "); + scanf("%d", &aSize); + + printf("\nPlease Enter the First Array Elements : "); + for(i = 0; i < aSize; i++) + { + scanf("%d", &a[i]); + } + printf("\n Please Enter the Second Array Size : "); + scanf("%d", &bSize); + + printf("\nPlease Enter the Second Array Elements : "); + for(i = 0; i < bSize; i++) + { + scanf("%d", &b[i]); + } + + for(i = 0; i < aSize; i++) + { + Merged[i] = a[i]; + } + + mSize = aSize + bSize; + + for(i = 0, j = aSize; j < mSize && i < bSize; i++, j++) + { + Merged[j] = b[i]; + } + + printf("\n a[%d] Array Elements After Merging \n", mSize); + for(i = 0; i < mSize; i++) + { + printf(" %d \t ",Merged[i]); + } + + return 0; +} \ No newline at end of file