1. Advanced Data Structure using C++

More documents

Recommendations

Info

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110) JA = (1, 4, 7, 10, 12, 12, 14) 5. Storage‐by‐Rows The storage mode used for sparse matrices stored by rows has three variations, depending on whether the matrix is a general sparse matrix or a symmetric sparse matrix. This explains these variations. For a general sparse matrix A, storage‐by‐rows uses three one‐ dimensional arrays to define the sparse matrix storage, AR, IA, and JA. Given the m by n sparse matrix A having ne nonzero elements, the arrays are set up as follows: • AR of (at least) length ne contains the ne nonzero elements of the sparse matrix A, stored contiguously. The rows of matrix A are stored consecutively from 1 to m in AR. The elements in each row of A are stored in any order in AR. • IA, an integer array of (at least) length m+1 contains the relative starting position of each row of matrix A in array AR; that is, each element IA(i) of the row pointer array indicates where row i begins in array AR. If all elements in row i are zero, then IA(i) = IA(i+1). The last element, IA(m+1), indicates the position after the last element in array AR, which is ne+<strong>1.</strong> • JA, an integer array of (at least) length ne contains the corresponding column numbers of each nonzero element, aij, in matrix A. Consider the following as an example of a 6 by 6 general sparse matrix A and how it can be stored in arrays AR, IA, and JA. Given the following matrix A: Prepared By : Er. Harvinder Singh Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 132 ‐
LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110) | 11 0 13 0 0 0 | | 21 22 0 24 0 0 | | 0 32 33 0 0 0 | | 0 0 43 44 0 46| | 0 0 0 0 0 0| | 61 62 0 0 0 66 | the arrays are: AR = (11, 13, 24, 22, 21, 32, 33, 44, 43, 46, 61, 62, 66) IA = (1, 3, 6, 8, 11, 11, 14) JA = (1, 3, 4, 2, 1, 2, 3, 4, 3, 6, 1, 2, 6) PROGRAMS FOR VARIOUS OPERATIONS PERFORMED ON MATRIX • FOR ADDITION:‐ #include #include void create_m(int [10][10],int,int); void display_m(int [10][10],int,int); void add_m(int [10][10],int [10][10],int,int); int i,j,k,a[10][10],b[10][10],c[10][10]; void main () { int m,n,p,q,ch; clrscr(); while(1) { printf("\nenter the nums of row and column of matrix A\n"); scanf("%d%d",&m,&n); create_m(a,m,n); Prepared By : Er. Harvinder Singh Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 133 ‐
Page 1 and 2:
ADVANCED DATA STRUCTURE NOTES (MT
Page 3 and 4:
LECTURE NOTES OF ADVANCED DATA STRU
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
70 121 432 12 638 LECTURE NOTES OF
Page 11 and 12:
Page 13 and 14:
3 91 11 50 LECTURE NOTES OF ADVANCE
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
COLLISION LECTURE NOTES OF ADVANCED
Page 27 and 28:
4. Rehashing LECTURE NOTES OF ADVAN
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Instructions: LECTURE NOTES OF ADVA
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82: LECTURE NOTES OF ADVANCED DATA STRU
Page 99 and 100: DESTINATION DESTINATION LECTURE NOT
Page 111 and 112: Algorithm LECTURE NOTES OF ADVANCED
Page 131: LECTURE NOTES OF ADVANCED DATA STRU
Page 143 and 144: queue LECTURE NOTES OF ADVANCED DAT
Page 153 and 154: SEARCHING LECTURE NOTES OF ADVANCED
Page 167 and 168: Step 2: Step 3 LECTURE NOTES OF ADV
Page 177 and 178: a LECTURE NOTES OF ADVANCED DATA ST
Page 183 and 184:
D LECTURE NOTES OF ADVANCED DATA ST
Page 185 and 186:
Page 187 and 188:
1 3 LECTURE NOTES OF ADVANCED DATA
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Search LECTURE NOTES OF ADVANCED DA
Page 223 and 224:
show all

1. Advanced Data Structure using C++

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?