1. Advanced Data Structure using C++

More documents

Recommendations

Info

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110) Let us make the hash table 479 elements long. A popular method for transforming keys is to use the modulus operator, taking the remainder of the division of the original key by the size of the hash table. For example, consider student number 949786: 949786 % 479 = 408 Therefore we should place this student in array element 408 in the hash table (note: the modulus operator is effective because it can only have the range 0 ‐ 478). HASHING FUNCTION A hash function is any well‐defined procedure or mathematical function which converts a large, possibly variable‐sized amount of data into a small datum, usually a single integer that may serve as an index to an array. The values returned by a hash function are called hash values, hash codes, hash sums, or simply hashes. Hash functions are mostly used to speed up table lookup or data comparison tasks — such as finding items in a database, detecting duplicated or similar records in a large file, finding similar stretches in DNA sequences, and so on. There are two basic issues when designing a hash algorithm: 1.Choosing the best hash function 2.Deciding what to do with collisions If the key is an integer and there is no reason to expect a non‐random key distribution then the modulus operator is a simple (and efficient) and effective method. However if the key is a string value (e.g. someone’s name) then it first needs to be transformed to an integer. Prepared By : Er. Harvinder Singh Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 24 ‐
COLLISION LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110) When inserting an element, if it hashes to the same value as an already inserted element, then we have a collision and need to resolve it. There are two popular methods: 1.Open Addressing 2.Chaining Open Addressing 1. Linear Probing In linear probing, when a collision occurs, the new element is put in the next available spot (by doing a sequential search). For example: Insert : 49, 18, 89, 48, Hash table size = 10, so 49 % 10 = 9, 18 % 10 = 8, 89 % 10 = 9, 48 % 10 = 8 The problem with linear probing is that records tend to get clustered around each other. i.e. once an element is placed in the hash table the chances of it’s adjacent element being filled are doubled (i.e. it can either be filled by a collision or directly). Prepared By : Er. Harvinder Singh Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 25 ‐
Page 1 and 2: ADVANCED DATA STRUCTURE NOTES (MT
Page 3 and 4: LECTURE NOTES OF ADVANCED DATA STRU
Page 9 and 10: 70 121 432 12 638 LECTURE NOTES OF
Page 13 and 14: 3 91 11 50 LECTURE NOTES OF ADVANCE
Page 23: LECTURE NOTES OF ADVANCED DATA STRU
Page 27 and 28: 4. Rehashing LECTURE NOTES OF ADVAN
Page 47 and 48: Instructions: LECTURE NOTES OF ADVA
Page 75 and 76:
LECTURE NOTES OF ADVANCED DATA STRU
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:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
DESTINATION DESTINATION LECTURE NOT
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Algorithm LECTURE NOTES OF ADVANCED
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
queue LECTURE NOTES OF ADVANCED DAT
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
SEARCHING LECTURE NOTES OF ADVANCED
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Step 2: Step 3 LECTURE NOTES OF ADV
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
a LECTURE NOTES OF ADVANCED DATA ST
Page 179 and 180:
Page 181 and 182:
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?