Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
What is the time complexity of search function in a hash table using a doubly linked list?
What is the time complexity of delete function in the hash table using a doubly linked list?
A doubly linked list is declared as struct Node{                 int Value;                 struct Note*fwd;                 struct Node * Bwd; } Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly liked list, if it is assumed that X points to neither the first nor the last node of the list?
N items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations on the list in this order: Θ(N) delete, O(log N) insert, O(log N) find, and Θ(N) decrease-key. What is the time complexity of all these operations put together?
Which among the following statement(s) is (are) true? (A) A hash function takes a message of arbitrary length and generates a fixed length code. (B) A hash function takes a message of fixed length and generates a code of variable length. (C) A hash function may give same hash value for distinct messages. Choose the correct answer from the options given below:
Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?
What is the time complexity of insert function in a hash table using list head?
What is the advantage of using a doubly linked list for chaining over singly linked list?
What is the advantage of using linked list over the doubly linked list for chaining?