python. To run and test your program:~/cmpsc131python-userid$cd lab6~/cmpsc131python-userid/lab6$python3 -i lab6.pyExpected output:$ python3 lab6.pyEnter a string: bananaEnter a substring to count: aEntera starting index: -3a occurred in banana 2 times starting from index -3.a occurred in banana 2 times starting from index -3.Testing find_smallest:min in [5, 8, 10, 2, 7] is 2min in ['hello', 'apple', 'banana', 'world'] is appleTesting myfilter:filering ['a', 'apple', 'racecar', 'hannah', 'banana'] with is_palindrome is ['a', 'racecar', 'hannah']filtering [0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48] with is_even is [0, 6, 12, 18, 24, 30, 36, 42, 48]$python3 lab6.pyEnter a string: bananaEnter a substring to count: anaEntera starting index: 1ana occurred in banana 1 times starting from index 1.ana occurred in banana 1 times starting from index 1.[... the same in all runs for find_smallest and myfilter.] def count_non_overlapping(s, substr, start):II II ||Return the number of non-overlapping occurrences of substr in sstarting from the index start.You can not use str method s.count.return 0def count_non_overlapping_m(s, substr, start):II II ||Return the number of non-overlapping occurrences of substr in sstarting from the index start.You must use a one-liner implementation by using s.count().II II ||return 0def find_smallest(t):Return the smallest element in given list t.Return None if t is emptyreturn t[0]def myfilter(t, cond):t is a list, cond(x) is a boolean function that returns True or Falsegiven an element x in t.Return a new list that only includes element x from t such cond(x) is True.II II ||return tFor the implementation of count_non_overlapping(), you CAN NOT use any string method such as s.find(), s.count(),s.index(). Be aware of handling of start index in particular when it is negative. Be aware that you are to find non-overlapping matches.

def is_palindrome(s): return s == s[::-1] def is_even(d): return (d % 2) == 0 def…

def count_non_overlapping(s, substr, start): Return the number of non-overlapping occurrences of substr in s starting from the index start. You can not use str method s.count. return 0 def count_non_overlapping_m(s, substr, start): Return the number of non-overlapping occurrences of substr in s starting from the index start. You must use a one-liner implementation by using s.count(). return Ø def find_smallest(t): Return the smallest element in given list t. Return None if t is empty return t[0] def myfilter(t, cond): t is a list, cond(x) is a boolean function that returns True or False given an element x in t. Return a new list that only includes element x from t such cond(x) is True. return t For the implementation of count_non_overlapping(), you CAN NOT use any string method such as s.find(), s.count s.index(). Be aware of handling of start index in particular when it is negative. Be aware that you are to find non- overlapping matches.

def count_non_overlapping(s, substr, start): Return the number of non-overlapping occurrences of substr in s starting from the index start. You can not use str method s.count. return 0 def count_non_overlapping_m(s, substr, start): Return the number of non-overlapping occurrences of substr in s starting from the index start. You must use a one-liner implementation by using s.count(). return Ø def find_smallest(t): Return the smallest element in given list t. Return None if t is empty return t[0] def myfilter(t, cond): t is a list, cond(x) is a boolean function that returns True or False given an element x in t. Return a new list that only includes element x from t such cond(x) is True. return t For the implementation of count_non_overlapping(), you CAN NOT use any string method such as s.find(), s.count s.index(). Be aware of handling of start index in particular when it is negative. Be aware that you are to find non- overlapping matches.

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

The following code doesn't correctly return the index values of the minimum contiguous subsequence. Please modify it so that it does, with comments if possible. def minSumRec(a, left, right): if left == right: return [a[left], left, right] center = int((left + right) / 2) min_left_sum = minSumRec(a, left, center) min_right_sum = minSumRec(a, center + 1, right) min_left_border_sum, left_border_sum = 1e9, 0 for i in range(center, left - 1, -1): left_border_sum += a[i] if left_border_sum < min_left_border_sum: min_left_border_sum = left_border_sum min_right_border_sum, right_border_sum = 1e9, 0 for i in range(center + 1, right + 1): right_border_sum += a[i] if right_border_sum < min_right_border_sum: min_right_border_sum = right_border_sum min_border_sum = min_right_border_sum + min_left_border_sum minSum = min(min_left_sum[0], min_right_sum[0], min_border_sum) if minSum == min_left_sum: return min_left_sum if minSum == min_right_sum: return min_right_sum return…
2. Write a program by implementing your own PRNG (e.g., using a hash function). You must not use any existing random class or function but implement your own. Produce random bytes (like above). Note the purpose of this part is not to design a strong PRNG that passes randomness tests, but rather for comparison with an existing strong PRNG (above).
#include <stdio.h>#include <stdlib.h>#include <string.h>#define capacity 101 // Size of Hash Table int hash_function(char* str) { int i = 0; for (int j=0; str[j]; j++) i += str[j]; return i % capacity;} struct Ht_item { char* name; int numberCourses;}; // Hash Table Definitionstruct HashTable { struct Ht_item** items; int size; int count;}; struct Ht_item* create_item(char* key, int value) { struct Ht_item* item = (struct Ht_item*) malloc (sizeof(struct Ht_item)); item->name = (char*) malloc (strlen(key) + 1); item->numberCourses = value; strcpy(item->name, key); item->numberCourses = value; return item;} struct HashTable* create_table(int size) { // Creates a New Hash Table struct HashTable* table = (struct HashTable*) malloc (sizeof(struct HashTable)); table->size = size; table->count = 0; table->items = (struct Ht_item**) calloc (table->size, sizeof(struct Ht_item*));…
Hello The java function belw is generating a NullPointerException. How can I improve it? public int quadraticProbing(String[] hashArray, int initial_index, int collision) { int index = (initial_index + (collisions * collisions)) % maxSize; System.out.println("Index " + index); if (index == maxSize) { System.out.println("flag 04"); index = 0; // To wrap around the table } if (hashArray[index] == null) { return index; // We can insert at this location } else { // The index isn't empty so we need to insert the value // at the end of the list } collisions = ++collision; return quadraticProbing(hashArray, initial_index, collision); // Recursive call } Thanks in advance. Respectfully, Emmanuel
Retrieving a value using its associated key can be accomplished using anindexer, which works just like an indexer for an array. A key is passed in asthe index value, and the value associated with the key is returned, unless thekey doesn’t exist, in which a null is returned.Write short code segment demonstrates how this technique works:
Given the following Java functions, transcribe it into a Python 3 program. /*** Rehashes the contents of this hash table into a new array with a* larger capacity. This method is called automatically when the* number of keys in this hash table reaches its threshold.*/void resize(int newCapacity) {Entry[ ] oldTable = table;int oldCapacity = oldTable.length;if (oldCapacity == MAXIMUM_CAPACITY) {threshold = Integer.MAX_VALUE;return threshold;} Entry[ ] newTable = new Entry[newCapacity];transfer(newTable);table = newTable;threshold = (int)(newCapacity * loadFactor);}
Implement the function below void swap(int pos1, int pos2) {} For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. Inital code to be completed: class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node*) malloc(sizeof(node)); n->element = num; n->next = NULL; return n; } public: LinkedList() { index = 0; head = NULL; tail = NULL; } int add(int num) { addTail(num); return index; } int get(int pos) { node* currnode = head; int count =0; while (currnode != NULL){ count++; if (count == pos){ return currnode -> element; }else{ currnode = currnode -> next; } }…
Given the following Java functions, transcribe it into a Python 3 program. /*** Add a new entry with the specified key, value and hash code to* the specified bucket. It is the responsibility of this* method to resize the table if appropriate.*/void addEntry(int hash, Object key, Object value, int bucketIndex) {table[bucketIndex] = new Entry(hash, key, value, table[bucketIndex]);if (size++ >= threshold)resize(2 * table.length);}
6.2 Create a Product class with Product Id & Product Name. Write a program to accept information of 10 products and store that in HashSet. Do following operations, a.Search a particular product in the HashSet.b.Remove a particular product from the HashSet by using product id.(Referbelow table for the product list) Product Id Product Name P001 Maruti 800 P002 Maruti Zen P003 Maruti Dezire P004 Maruti Alto
def smallest_score(lst: list[int]) -> int:'''Valid sublists have at least 2 elements.Return the smallest score of any valid sublist of lst.lst is guaranteed to have at least 2 elements.'''in_order = lst[:]in_order.sort()res = in_order[1] - in_order[0]for i in range(len(in_order) - 1):res = min(res, in_order[i+1] - in_order[i])return res"""Unfortunately, your code is not correct.Below, write a Pytest test case that fails,but that should pass if your smallest_score function were correct.Write ONLY the Pytest test case; don't try to fix the busted smallest_score code."""# TODO Your pytest test function here
In this task, two hash tables should should be implemented. You can follow the followinginstructions:- In class HashTable implement a hash table and consider the following:(i) Keys are integers (therefore also negative!) and should be stored in the tableint[] data.(ii) As a hash function take h(x) = (x · 701) mod 2000. The size of the table istherefore 2000. Be careful when computing the index of a negative key. Forexample, the index of the key x = −10 ish(−10) = (−7010) mod 2000 = (2000(−4) + 990) mod 2000 = 990.Hence, indices should be non-negative integers between 0 and 1999!(iii) Implement insert, which takes an integer and inserts it into a table. Themethod returns true, if the insertion is successful. If an element is already inthe table, the function insert should return false.(iv) Implement search, which takes an integer and finds it in the table. The methodreturns true, if the search is successful and false otherwise.(v) Implement delete, which takes an integer and deletes it…
We may utilise two methods without implementing them: countand unambiguous The DictionaryEntry object's count is returned via the Count method. whereas Clear removes all DictionaryEntry from the inner hash tableitems from the internal hash tableWrite a program that utilizes these methods: