1. Advanced Data Structure using C++

More documents

Recommendations

Info

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110) Suppose an array x of n element is used to implement a circular queue. If we go on adding elements to the queue we may reach x[n‐1].we cannot add any more elements to the queue since the end of the array has been reached. Instead of reporting the queue is full , if some elements in the queue have been deleted then there might be empty slots at the beginning of the queue. In such case these slots would be filled by new elements added to queue. In short, just because we have reached the end of the array , the queue would not be reported as full. The queue would be reported full only when all the slots in the array are occupied. ALGORITHM FOR INSERTION OPERATION:‐ PROCEDURE: (Circular queue)insert(Q,F,R,N,X) STEP 1: [is queue empty?] if F=1 & R+N then write overflow and return [end of if statement] STEP 2: [is queue empty?] if F=0 then F=1 [end of if statement] STEP 3: [Reset rear pointer] if R=N then R=1 else R=R+1 [end of if statement] STEP 4: [insert new element] Q[R]=X STEP 5: [finished] Prepared By : Er. Harvinder Singh Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 144 ‐
LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110) return ALGORITHM FOR DELETION OPERATION:‐ PROCEDURE: delete(Q,F,R,X) STEP 1: [is queue empty?] if F=0 then write underflow and return [end of if statement] STEP 2: [delete front element] X=Q[F] STEP 3: [is queue now empty?] if F=R then F=0,R=0 & return [end of if statement] STEP 4: [increment front pointer] if F=N then F=1 else F=F+1 [end of if statement] STEP 5: [finished] return Prepared By : Er. Harvinder Singh Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 145 ‐
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:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94: LECTURE NOTES OF ADVANCED DATA STRU
Page 99 and 100: DESTINATION DESTINATION LECTURE NOT
Page 111 and 112: Algorithm LECTURE NOTES OF ADVANCED
Page 143: 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 187 and 188: 1 3 LECTURE NOTES OF ADVANCED DATA
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++

Create successful ePaper yourself

Delete template?

Save as template?