vineeshvs

is there any alternative for wavread (in matlab) in c. i want to get the samples, sampling frequency and bits per sample???

1.[ICODE]#include<stdio.h> #include<math.h> #include<stdlib.h> double **memalloc(int M,int N); main() { int i,j; double **a; a=memalloc(2,2); printf("a\n"); for(i=0;i<2;i++) { printf("\n"); for(j=0;j<2;j++) { a[i][j]=i+j; printf("%f\t",a[i][j]); } } } //FUNCTION-memalloc double **memalloc(int M,int N) { int i; double **y; y = malloc(M* sizeof(double *)); if(y == NULL) { printf("out of memory\n"); return 0; } …

i want to write a function to which i need to pass two matrices and get the sum and product of them as output. but how can i return more than one matrix from a function? (i want to pass and return using pointers)

1. any problem if i dynamically allocate memory and use only a small part of it? 2. can i free the dynamic memory after each time the function is executed?

[CODE]double a,b; printf("%f",a^b);[/CODE] error occurs as shown in heading. any alternative method?

i allocate memory for b_edge in function bark_edge and give value to only b_edge[1][1] and try to return b_edge from function. segmentation fault comes? can you please check why? [CODE]//function bark_edge+main program #include<stdio.h> #include<math.h> #include<stdlib.h> double **bark_edge(); main() { double **b_edge; b_edge=bark_edge(); printf("%f",b_edge[1][1]); } //FUNCTION-bark_edge double **bark_edge() { int i=0; …

segmentation fault comes in the program? please help? is there any way i can check in which part of the program is the mistake? Thanks daniweb and members... [ICODE] //function bark_edge+main program #include<stdio.h> #include<math.h> #include<stdlib.h> double **bark_edge(int f_size,int samp_freq); double **transpose(double **x,int M,int N); main() { int f_size=1024; float samp_freq=44100,fcmax=samp_freq/2; …

[code] #include <stdio.h> #include<stdlib.h> int **matrix_mul(int **m1,int **m,int a,int b,int c,int d); main() { int i,j,r1,r2,c1,c2,**p,**q; printf("Enter the number of rows and columns of first matrix :\t"); scanf("%d%d",&r1,&c1); printf("Enter the number of rows and columns of second matrix :\t"); scanf("%d%d",&r2,&c2); //memory allocation for m1 int **m1; m1 = malloc(r1 * …

[CODE] #include<stdio.h> #include<stdlib.h> int **transpose(int **x,int m,int n); main() { int nrows=2,ncolumns=2,i,j,k=0; //memory allocation for array x int **array; array = malloc(nrows * sizeof(int *)); if(array == NULL) { printf("out of memory\n"); return 0; } for(i = 0; i < nrows; i++) { array[i] = malloc(ncolumns * sizeof(int)); if(array[i] == …

[code] #include<stdio.h> #include<stdlib.h> #include<math.h> #define pi 3.14159265 int **transpose(int **x,int m,int n); int **matrix_mul(int **m1,int **m2,int r1,int c1,int r2,int c2 ); int **dc4(int **x,int nrows,int ncolumns); main() { printf("hi"); int nrows=80000,ncolumns=1,i,j,**x,**dc4_x,**ix,M=nrows,N=ncolumns; //memory allocation for x x = malloc(nrows * sizeof(int *)); if(x == NULL) { printf("out of memory\n"); return 0; …

[CODE] #include<stdio.h> #include<stdlib.h> int **array(); main() { int **result=array(),i,j; //display result for(i=0;i<2;i++) printf("\n"); for(j=0;j<2;j++) printf("%d \t",result[i][j]); } //function int **array() { int nrows=2,ncolumns=2,i,j; // printf("hi"); //memory allocation int **array; array = malloc(nrows * sizeof(int *)); if(array == NULL) { printf("out of memory\n"); return 0; } //printf("hi"); for(i = 0; i …