Sign up now
to enroll in courses, follow best educators, interact with the community and track your progress.
Introduction- Hashing in Data Structure With Solutions to Previous Years Questions (in Hindi)
544 plays

Introduction to the course hashing in Data structure with solution to previous years questions based on NTA UGC NET Computer Science and GATE Computer Science.

Rashmi Vishwakarma is teaching live on Unacademy Plus

Rashmi Vishwakarma
GATE 2012, 9+ years experience, YouTuber Verified Plus Educator for NTA UGC NET JRF COMPUTER Sci. Referral code : rashmi.vishwkarma

Unacademy user
sir thank-you so much for all this ... sir it takes a lot of time to note these questions please provide us PDF if possible every help is appreciated...😊😊
ans is c for last question
ans is one and two only
c option is correct (46,34,42,23,52,33)
Rashmi Vishwakarma
10 months ago
Yes correct
  1. Hashingin Data Structure (NTAUGC NET Computer Science) Followme@ com/user/rashmi vishwkarma

  2. Rashmi Vishwakarma Mentor,ExAssistant Professor (2008-2013) GATE Qualified 2012,IBPS PO 2011 MCA with Hons from JabalpulEngineering College, Jabafpur B.Sc. (Computer Science)from RDvJabalpur Published Papers in Internartional and National Conferences and ournals uthored Technical Articles at vishwkarma

  3. HASHING can be seaclud us,ng a hash-fund.m& key elewer.rt ecun vJhy Haslin he tr rme uiAdto locat any elewal-in tae hash toble is ocu) st is conctant aud it dl epends tru Uinber datg elements stored in the hash table

  4. UGC NET July 2018 A hash function h defined h(key)-key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from o to 6. What will be the location of key 18? A 3 B. 4 C.5 D. 6

  5. UGCNET-Dec2015 The hash function used in double hashing is of the form: A. h(k,i) (hi(k) + h2(k) i) mod m B. h(k, i) = (h (k) + h2 (k)-i) mod m C. h(k, i) = (h(k) + i h2 (k)) mod m D. h(k,i) (hi(k) - i h2(k)) mod m

  6. GATE 2014 Consider a hash table with 9 slots. The hash function is h(k) k mod 9 The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15,20, 33, 12, 17,10. The maximum, minimum, and average chain lengths in the hash table, respectively, are A. 3,0, and 1 B. 3,3, and 3 C. 4,0, and 1 D. 3,0, and 2

  7. UGCNET-June2010 A chained hash table has an array size of 100. What is the maximum number of entries that can be placed in the table? A. 100 B. 200 C. 10000 D. There is no upper limit

  8. GATE 2004 Given the following input (4322, 1334, 1471,9679, 1989,6171,6173, 4199) and the hash function 10, which of the following statements are true? mod I. 9679, 1989, 4199 hash to the same value II. 1471,6171 hash to the same value III. All elements hash to the same value IV. Each element hashes to a different value A. I only B. II only C. I and II only D. III or IV

  9. GATE 2009 The keys 12, 18, 13, 2,3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with hash function h (k) = k mod 10 and linear probing. What is the resultant hash table? 0 2,12 12 13 12 13 3 23 3 3 3 13,3, 23 5 15 3 5,15 23 18 18 18 18 9 9 15

  10. + For any query, Write down into commentBox. You can alsopersonally message me. +Rate, Review, Recommend +Follow me at @fittps:// vishwkarma