consecutive Os. For example, 1011011101, 011010 etc. How many good binar strings of length k are there? [Hint: First you may try to find the highest possible number of Os in such strings terms of k. It can be done separately for odd and even k. Use the Floor function Ciuing tho final answer in summation E) form will suffice.]

consecutive Os. For example, 1011011101, 011010 etc. How many good binar strings of length k are there? [Hint: First you may try to find the highest possible number of Os in such strings terms of k. It can be done separately for odd and even k. Use the Floor function Ciuing tho final answer in summation E) form will suffice.]

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

Question 2: Encoding Cryptography is the study of trying to create secure information by obscuring the original message. One simple encryption method is to substitute letters from the original message with other letters. To make it harder to decrypt the hidden message, we may also remove clues such as the length of the words in the message and any punctuation or capitalization. Write a function encode that consumes a string message. The function produces a string which is encrypted according the following procedure: • Only the letters from the original message will be encrypted. Other characters such as spaces, punctuation, numeric digits, etc. are not included in the encrypted message at all. • The encrypted message will only contain uppercase letters. • Each letter will be replaced by the uppercase letter at the opposite end of the English alphabet. In other words, A or a will become z, B or b will become Y, C or c will become x, .., z or z will become A. • The encrypted message will…
Question 2: Encoding Cryptography is the study of trying to create secure information by obscuring the original message. One simple encryption method is to substitute letters from the original message with other letters. To make it harder to decrypt the hidden message, we may also remove clues such as the length of the words in the message and any punctuation or capitalization. Write a function encode that consumes a string message. The function produces a string which is encrypted according the following procedure: * Only the letters from the original message will be encrypted. Other characters such as spaces, punctuation, numeric digits, etc. are not included in the encrypted message at all. * The encrypted message will only contain uppercase letters. * Each letter will be replaced by the uppercase letter at the opposite end of the English alphabet. In other words, A or a will become Z, B or b will become Y, C or c will become X, ..., Z or z will become A. * The encrypted message…
Question 2: Encoding Cryptography is the study of trying to create secure information by obscuring the original message. One simple encryption method is to substitute letters from the original message with other letters. To make it harder to decrypt the hidden message, we may also remove clues such as the length of the words in the message and any punctuation or capitalization. Write a function encode that consumes a string message. The function produces a string which is encrypted according the following procedure: * Only the letters from the original message will be encrypted. Other characters such as spaces, punctuation, numeric digits, etc. are not included in the encrypted message at all. * The encrypted message will only contain uppercase letters. * Each letter will be replaced by the uppercase letter at the opposite end of the English alphabet. In other words, A or a will become Z, B or b will become Y, C or c will become X, ..., Z or z will become A. * The encrypted message…
Instrument FrequencyCounter to use Stopwatch and StdDraw to make a plot where the x-axis is the number of calls on get() or put() and the y-axis is the total running time, with a point plotted of the cumulative time after each call. Run your program for Tale of Two Cities using SequentialSearchST and again using BinarySearchST and discuss the results. Note : Sharp jumps in the curve may be explained by caching, which is beyond the scope of this question.
The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index, n, as parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use a for loop and DO NOT use recursion.
The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1 Ex: If the input is: 7 the output is: fibonacci (7) is l3 Note: Use recursion and DO NOT use any loops.
Create a function that takes a grid of # and -, where each hash (#) represents amine and each dash (-) represents a mine-free spot.Return a grid, where each dash is replaced by a digit, indicating the number ofmines immediately adjacent to the spot i.e. (horizontally, vertically, anddiagonally).Example of an input:[ ["-", "-", "-", "#", "#"],["-", "#", "-", "-", "-"],["-", "-", "#", "-", "-"],["-", "#", "#", "-", "-"],["-", "-", "-", "-", "-"] ]Example of the expected output:[ ["1", "1", "2", "#", "#"],["1", "#", "3", "3", "2"],["2", "4", "#", "2", "0"],["1", "#", "#", "2", "0"],["1", "2", "2", "1", "0"] ]Here is a tip. When checking adjacent positions to a specific position in the grid,the following table might assist you in determining adjacent indexes:NW position =current_row - 1current_col - 1N position =current_row - 1current_colNE position =current_row - 1current_col + 1W position =current_rowcurrent_col - 1Current position =current_rowcurrent_colE position…
Problem 3: We want to create a string of length n from the following blocks of letters: A, B, TK, CC, DD, EE. (a) Let P₁ denote the number of such blocks. For example, AAAB, ABEE and DDCC are blocks of length 4. Set up and justify the recurrence for Pn. (Make sure to provide the initial conditions). (b) Let T₁ denote the number of such words, in which blocks A and CC can't be next to each other (no ACC or CCA), no three A's and no two blocks of CC's in a row (no AAA or CCCC). For example, ABCCDD and CCEEEE are valid strings of length 6, while CCBAAA, BCCABB and CCCCDD are not. Set up and justify the recurrence for T How many initial conditions do you need to know in order to solve the recurrence? Give only the first two initial conditions.
Generate a PDA that accepts the following: Given an alphabet of a, b, c and null, only accept strings that consist of random characters But the number of 'a' characters exceeds the sum of the number of 'b' and 'c' characters.
Correct answer will be upvoted else downvoted. Computer science. pair of positive integers (a,b) is called uncommon if ⌊ab⌋=amodb. Here, ⌊ab⌋ is the aftereffect of the integer division among an and b, while amodb is its remaining portion. You are given two integers x and y. Track down the number of uncommon sets (a,b) to such an extent that 1≤a≤x and 1≤b≤y. Input The main line contains a solitary integer t (1≤t≤100) — the number of experiments. The main line of the depiction of each experiment contains two integers x, y (1≤x,y≤109). Output For each experiment print the appropriate response on a solitary line.
Correct answer will be upvoted else downvoted. Assume you are given two strings an and b. You can apply the accompanying activity quite a few times: pick any adjacent substring of an or b, and sort the characters in it in non-dropping request. Let f(a,b) the base number of activities you need to apply to make them equivalent (or f(a,b)=1337 in case it is difficult to make an and b equivalent utilizing these tasks). For instance: f(ab,ab)=0; f(ba,ab)=1 (in one activity, we can sort the entire first string); f(ebcda,ecdba)=1 (in one activity, we can sort the substring of the subsequent string beginning from the 2-nd character and finishing with the 4-th character); f(a,b)=1337. You are given n strings s1,s2,… ,sk having equivalent length. Compute ∑i=1n∑j=i+1nf(si,sj). Input :The principal line contains one integer n (1≤n≤2⋅105) — the number of strings. Then, at that point, n lines follow, each line contains one of the strings si, comprising of lowercase Latin…
The GMP library, using C or C++ The prefered solution is to use the Sage library. 2 Fermat test 1. Implement the Fermat test of primality with small integers. 2. Write a function to generate random k-bit prime numbers. 3 RSA 1. Write the key-generation function function of RSA. The function should generate two random primes p and q of size k/2 bits. 2. Implement the RSA encryption function 3. Implement the RSA decryption function 4. Check that decryption works