What is the time complexity of functions foo() and bar() respectively in below given code snippets, given that n is the total size of the input and L and R are Vectors def foo(L, R): S = Vector() for x in L: if x in R: S.add_back(x) return S def bar(L, R): R_hash = HashTable() for r in R: R_hash.insert(r, False) S = Vector() for x in L: if R_hash.contains(x): S.add_back(x) return S O(N^2), O(N) O(N), O(N) O(N^2), O(N^2) O(1), O(N)

What is the time complexity of functions foo() and bar() respectively in below given code snippets, given that n is the total size of the input and L and R are Vectors def foo(L, R): S = Vector() for x in L: if x in R: S.add_back(x) return S def bar(L, R): R_hash = HashTable() for r in R: R_hash.insert(r, False) S = Vector() for x in L: if R_hash.contains(x): S.add_back(x) return S O(N^2), O(N) O(N), O(N) O(N^2), O(N^2) O(1), O(N)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A hash table is an efficient data structure to store and access data via keys. In this problem, you need to find the longest subarray of distinct elements. For example, given an array A = <milk, water, 6724, water, soda, beer, apple, grape, wine>, the longest subarray is <milk, water, 6724, soda, beer, apple, grape, wine> Hint: you need to keep track and update the positions of the elements. a) Explain how many unique subarrays are there from a given array b) Describe your ideas on how to solve the problem, especially how hash tables can be used to keep track of the important information c) Write the most efficient algorithm (pseudo code) to solve this problem with complexity analysis. You can assume that a good hash function is given.
A hash-map has been constructed with quadratic-hashing. The hashing function is h(k;) = (3 * k; + 7) mod 17 and the table length is N = 17. How many cells will be probed by the call of insert(2) 1 4 5 6 7 8 10 11 12 13 14 15 16 26 89 11 35 70 59 Note: First row contains the indices and the second row contains the items.
L is a list of data items that is linear. Implement the list as: I an ordered list; (ii) a linear open addressed hash table using a suitable hash function of your choosing.Use binary search or hashing to find a collection of keys on representations I and ii), respectively. Compare how well the two approaches performed over list L.
Implement a commonly used hash table in a program that handles collision using linear probing. Using (K mod 13) as the hash function, store the following elements in the table: {1, 5, 21, 26, 39, 14, 15, 16, 17, 18, 19, 20, 111, 145, 146}.
Hypertune these parameters by using grid search: stack_rgs = StackingRegressor(estimators = [ ('ridge_regression', Ridge(random_state=42)), ('sgdregressor', SGDRegressor(random_state=42)), ('svr', SVR(kernel='rbf'))
write a simple hashing function that uses addition and multiplication and then find a pair of strings that will return the same hash value for different strings (i.e you will cause a Hash Collision). The algorithm uses multiplication based on the position of a letter in the hash to avoid a hash collision when two letters are transposed like in 'ABCDE' and 'ABDCE'. Your strings need to be at least three characters long and no more than 10 characters long. Here is the code that computes your hash: while True: txt = input("Enter a string: ") if len(txt) < 1 : break hv = 0 pos = 0 for let in txt: pos = ( pos % 2 ) + 1 hv = (hv + (pos * ord(let))) % 1000000 print(let, pos, ord(let), hv) print(hv, txt) For simplicity we will only use upper and lower case ASCII letters in our text strings. Enter a string: ABCDE A 1 65 65 B 2 66 197 C 1 67 264 D 2 68 400 E 1 69 469 469 ABCDE Enter a string: BACDE B 1 66 66 A 2 65 196 C 1 67 263 D 2 68 399 E 1 69 468 468 BACDE
Given the series of inputs [45, 7, 46, 90, 34, 6, 7, 71, 23, 24], insert each of these integers into the chained hash table below, with a hash function defined by H(x) = x mod tableSize. Draw in the linked lists to the right of each array index, showing a pointer to null as the end of each list. The Handout for this assignment has examples of the format we want for your answer. index list (you may need to edit this to make it longer) 0 1 2 3 4
What is the worst-case performance of a lookup operation in a hashmap and why? Group of answer choices A- O(1), hashmap always has a constant time lookup, and that is why we like using this associative data structure. B- O(lg(n)) hashmap has a log(n) lookup because we are able to perform a binary search on the keys because our hashmap always maintains a sorted order of entries added. C- O(n) because we can have a bad hash function that puts all of our items in the same bucket, thus we would have to iterate through all n items.
For the word count example, for the input of the Map function, keys are document IDs and values are document contents. For the output of the Map function, keys are words and values are counts of words (e.g., (a, 1)). After shuffling via a hashing function on keys of the output, we combine those values with the same key into a list, for example, (a, {1, 5}), which are used as the input of the Reduce function. Within the reduce function, it will count (sum up) the numbers in the value list of a key, and return the key/value pair (e.g., (a, 6)). How to Implement the WordCount example on Hadoop?
Given the following Java functions, transcribe it into a Python 3 program. /*** Removes and returns the entry associated with the specified key* in the Hash Table. Returns null if the Hash Table contains no mapping* for this key.*/Entry removeEntryForKey(Object key) {int hash = hash(key);int i = indexFor(hash, table.length);Entry prev = table[i];Entry e = prev; while (e != null) {Entry next = e.next;if (e.hash == hash && eq(k, e.key)) {size--;if (prev == e)table[i] = next;elseprev.next = next;return e;}prev = e;e = next;}return e;}
Given a hash table of size 9 with hash function x%9. Write the element order of the linear probe hash table when these keys are inserted in the given order. 1,20,11,28,25,9,18 Answer is just a sequence of elements in the same format. Use hypen - to indicate empty space. For example a table like below must be written as in the following: 11 28 9,28,-,11,1,-,- Cevap: Kalan Süre 1:37:31
A hash-map has been constructed with double-hashing by applying h;(k;) = [h(k;) + jd(k;)] mod N. The primary hashing function is given as h(k;) hashing function as d;(k;) = k;divN where div is integer division. The maximum number of cells probed is N = 13. How many cells will be probed by the call of findElement(38) = k;modN and the secondary Note: The first row contains the indices and the second row contains the elements. 1 2 4 5 6. 7 8 10 11 12 27 14 available 6. 35 25 51