Question 2:Using C++Example Input12 33 62 3Example Output37 In this problem, we are working with binary strings with length K. A binary stringcontains only characters '0' and '1'. The bitwise XOR of two such strings X and Y(denoted by X OY)is also a binary string with length K.You have a sequence A of binary strings, indexed from 1. Initially, it is empty.You should process Q queries. In each query:• You are given two integers L and R (0 < L< R< 2k ). For each i (L

In this problem, we are working with binary strings with length K. A binary string contains only characters '0' and '1'. The bitwise XOR of two such strings X and Y (denoted by X Y) is also a binary string with length K. You have a sequence A of binary strings, indexed from 1. Initially, it is empty. You should process Q queries. In each query: • You are given two integers L and R (0 < L < R < 2* ). For each i ( L

In this problem, we are working with binary strings with length K. A binary string contains only characters '0' and '1'. The bitwise XOR of two such strings X and Y (denoted by X Y) is also a binary string with length K. You have a sequence A of binary strings, indexed from 1. Initially, it is empty. You should process Q queries. In each query: • You are given two integers L and R (0 < L < R < 2* ). For each i ( L

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

You are given a string X of length n and another string Y of length m ≤n. Say,the indexes p1, p2, p3, p4 and q1, q2, q3, q4 form two sub-sequences, i.e., 0 ≤ p1 < p2 < p3 < p4 < nand 0 ≤q1 < q2 < q3 < q4 < n; then, they are non-overlapping if p4 < q1.The task is to count the maximum number of non-overlapping sub-sequences of X that are thesame as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is3 as shown by the red fonts. We cannot select the underlined GTAB as it overlaps with a red GTAB(i.e., among overlapping sub-sequences, you can select only one of them).Describe an O(m + n) time algorithm to obtain the count. Write a pseudo-code.
Develop and implement an ADT for preprocessing a string to support efficiently answering queries of the form How many times does a given k-gram appear ? Each query should take time proportional to k log N in the worst case, where N is the length of the string.
Let Σn denote the set of all binary strings with lengths less than n. For example, Σ2 = {λ, 0, 1} and Σ3 = {λ, 0, 1, 00, 01, 10, 11} where λ is the empty string, i.e. the string of length 0. For x ∈ Σ we denote the length of x by |x|. a) How many functions f : Σn → Σn are there? b) How many one-to-one functions f : Σn → Σn are there?
Consider a 64-bit hash function H(x). Describe an efficient algorithm allowing you to find a pair of messages M, M0 such that H(M) = H(M0 ). Describe what resources (i.e. time and memory complexity) it would require to find such a pair
Consider some input string s and some index i. The longestsubstring s[i], ... , s[j − 1] that is a valid expression consists of some number of termsadded together. In all of these cases, it begins with a term. By magic, assume that theGetTerm routine already works. Calling GetTerm(s, i) will return pterm and jterm, wherepterm is the parsing of this first term and jterm indexes the token immediately after thisterm. Specifically, if the expression has another term then jterm indexes the ‘+’ thatis between these terms. Hence, we can determine whether there is another term bychecking s[jterm]. If s[jterm] = ‘+,’ then GetExp will call GetTerm again to get the nextterm. If s[jterm] is not a ‘+’ but some other character, then GetExp is finished readingin all the terms. GetExp then constructs the parsing consisting of all of these termsadded together.
Given the following function, what happens if a[] contains just one element that doesn't match val? int binarySearch(int a[], int first, int last, int val){ if (first > last) return -1; int middle = (first + last) / 2; if (a[middle] == val) return middle; if (a[middle] < val) return binarySearch(a, middle+1, last, val); else return binarySearch(a, first, middle-1, val);} Group of answer choices binarySearch never calls itself again and terminates (recursion never happens) binarySearch calls itself once then terminates (recursion happens once) binarySearch calls itself twice then terminates (recursion happens twice) binarySearch calls itself 3 times then terminates (recursion happens 3 times)
Write a function that, given a list of non-overlapping intervals of items, takes an item as an input and identifies which, if any, interval that item lies in. If the items are integers and the intervals are 1643-2033, 5532-7643, 8999-10332, 5666653-5669321, then the query point 9122 is in the third interval while 8122 is not.
In Python, implement a hashing table data structure of size 20, which can cope with collisions. Thus, you must implement the closed collision system in its three modes: Linear scanQuadratic scanDouble hashing scan. For halt use halt(k)= (k mod (m - 1)) + 1, where m is the size of the table. The data to be managed are students from a certain university who have a 5-digit registration number and it is unique. In addition, the student has a name, age and address. Create a .txt file with 10 students (one for each line) and have them loaded into your program. Build a menu of options where you can: - Find a student and print his data if found and position in the table. Otherwise print a "Not Found" message.
In Python, implement a hashing table data structure of size 20, which can cope with collisions. Thus, you must implement the closed collision system in its three modes: Linear scanQuadratic scanDouble hashing scan. For halt use halt(k)= (k mod (m - 1)) + 1, where m is the size of the table. The data to be managed are students from a certain university who have a 5-digit registration number and it is unique. In addition, the student has a name, age and address. Create a .txt file with 10 students (one for each line) and have them loaded into your program. Build a menu of options where you can: - Enter a new student. For this option, that only allows entering the 5-digit license plate and that random data is automatically generated for the name, age and address. Return the position where it was entered and if it is not possible to enter it, print a message that explains why the entry was not obtained.
We are given a collection of n key-value pairs (k,m) in which k is a positive integer number in arange [0,N-1] for small enough N. Assume that we may have multiple values for the same keys.a) if m is a positive number in a range [0,M-1] for some small enough integer M, design alookup table for storing these items such that the time complexity of search, insert and deleteare constant. b) if m is an arbitrary integer number, design a lookup table for storing these itemssuch that the time complexity of search is log n.
The median m of a sequence of n elements is the element that would fall in the middle if the sequence was sorted. That is, e ≤ m for half the elements, and m ≤ e for the others. Clearly, one can obtain the median by sorting the sequence, but one can do quite a bit better with the following algorithm that finds the kth element of a sequence between a (inclusive) and b (exclusive). (For the median, use k = n/2, a = 0, and b = n.) select(k, a, b)Pick a pivot p in the subsequence between a and b.Partition the subsequence elements into three subsequences: the elements <p, =p, >p Let n1, n2, n3 be the sizes of each of these subsequences.if k < n1 return select(k, 0, n1).else if (k > n1 + n2) return select(k, n1 + n2, n).else return p. c++
Let K be the total calculated in step 4.a.i, and let LSUBS be the set of all subsets of n strings taken from L, 2 ≤ n < m. Continuing the example above for n = 2, LSUBS might be enumerated in the format { {AAAAA, AAAAC}, {AAAAA, AAAAG}, … {TTTTG, TTTTT} }. What is |LSUBS|, the cardinality of the set of subsets, as a function of K?