N. C. Kelkar was born in 1872.
I. N. C. Aniebo was born in 1939.
C. N. Visvanathan was born on 1947-04-28.
#include<iostream.h> #include<conio.h> void main() { clrscr(); int i,k,a[10],c[10],n,l; cout<<"Enter the no. of elements\t"; cin>>n; cout<<"\nEnter the sorted elments for optimal merge pattern"; for(i=0;i<n;i++) { cout<<"\t"; cin>>a[i]; } i=0;k=0; c[k]=a[i]+a[i+1]; i=2; while(i<n) { k++; if((c[k-1]+a[i])<=(a[i]+a[i+1])) { c[k]=c[k-1]+a[i]; } else { c[k]=a[i]+a[i+1]; i=i+2; while(i<n) { k++; if((c[k-1]+a[i])<=(c[k-2]+a[i])) { c[k]=c[k-1]+a[i]; } else { c[k]=c[k-2]+a[i]; }i++; } }i++; } k++; c[k]=c[k-1]+c[k-2]; cout<<"\n\nThe optimal sum are as follows......\n\n"; for(k=0;k<n-1;k++) { cout<<c[k]<<"\t"; } l=0; for(k=0;k<n-1;k++) { l=l+c[k]; } cout<<"\n\n The external path length is ......"<<l; getch(); }
#include<stdio.h> main() { int a=0,b=1,n,c,i; printf("enter number"); scanf("%d",&n); printf("%d\n",a); for(i=1;i<=n;i++) { c=a+b; printf("%d\n",c); b=a; a=c; } getch(); }
N. C. Vasanthakokilam died on 1951-11-07.
N. C. Kelkar died in 1947.
Girijabai Kelkar was born in 1886.
Ratnakar Hari Kelkar was born in 1904.
Sharad Kelkar was born on 1976-10-07.
Ashok Ramchandra Kelkar was born in 1929.
Vijay Kelkar was born on 1942-05-15.
P. K. Kelkar was born on 1909-06-01.
Subhash Kelkar was born on November 3, 1946, in Ahmedabad, India.
Supriya Kelkar was born on June 30, 1980, in Royal Oak, Michigan, USA.
N. C. Vasanthakokilam was born in 1919.
C. N. Karunakaran was born in 1940.
C. N. Sharma was born in 1952.