Here are a few points.Ī set implemented with open hashing is an array of N list head pointers (your teacher called this array Header), each the start of a linked list. As others have said, what can be done here to patch your knowledge is limited. Can anyone help me understand better about the problem. This is an exam we had last week and I never got the idea of the problem. I have no idea what the problem is, nor understand any about open hashing. Each student record is uniquely identified by the ID. Write the code of the function CreateDic() – the function will convert the list of BSCS and BSIT student records into a dictionary, which will be returned to the calling function. The function will accept an element as its parameter and return the appropriate hash value for each element. *Hash function exists and can be called in your function. Each group in the header table is sorted in ascending order according to ID. The dictionary is represented in memory using open-hashing (cursor-based). The list is to be converted into a dictionary, a set ADT. Int AvailPtr /*holds the index to the first available cell in the VH*/Ī list of BSCS and BSIT student records is stored in internal memory represented using cursor-based implementation. Int CourseCtr /*holds the # of elements for each course*/
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
December 2022
Categories |