2. Consider the following 3 strings over the alphabet {a,b} : S 3 ааааа, T = abbb, R= bbbbb. Which of the following statements is TRUE? (a) There are exactly 6 distinct substrings of S. (b) Suppose t is the number of distinct prefixes of T and r is the number of distinct prefixes of R. Then t –r = 1. (c) There are exactly 11 distinct prefixes of the word ST. (d) There are exactly 5 distinct suffixes of R.

2. Consider the following 3 strings over the alphabet {a,b} : S 3 ааааа, T = abbb, R= bbbbb. Which of the following statements is TRUE? (a) There are exactly 6 distinct substrings of S. (b) Suppose t is the number of distinct prefixes of T and r is the number of distinct prefixes of R. Then t –r = 1. (c) There are exactly 11 distinct prefixes of the word ST. (d) There are exactly 5 distinct suffixes of R.

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 finite sequence of symbols from a given alphabet will be called a string over the alphabet. A string that consists of a sequence a1, a2, a3, a4, … … … … , ?? of symbols will be denoted by the juxtaposition a1 a2 a3 a4 … … … … ??. Given the strings: ? = a2bab2and v = bab2, Evaluate the following operations for strings: (i) ԑu(ii) u + v(iii) u(u| v)(iv) v | (v | u)
Question : Let s be a string of length 2 with characters from {0, 1, 2}, and define statements a, b, c, and d as follows: a = "the first character of s is 0” b = “the first character of s is 1” c = “the second character of s is 1” d = “the second character of s is 2”. Describe the set of all strings for which each of the following is true.? ----on picture
You are given a string ternary_expr which represents a random nested ternary expression, you need to evaluate this expression, and report the result. Assumption can be as follows: ● ternary_expr only contains digits, ‘?’, ‘:’, ’T’, ‘F’ where ’T’ is true and ‘F’ is false. ● ternary_expr contains only one-digit numbers (i.e. in the range [0, 9]) The ternary expressions group right-to-left, and the result of the expression will always evaluate to either a digit, 'T' or 'F'. Requirements 1. Way of modeling the problem with the cost implications without using Stacks.
In C++, an int is in the range 0 to 65535. But what if we need to add larger integers? Compute the sum 2345566777844567 + 9999988777765768009998. Write this function:string add(string a, string b) where a and b are strings expressing integers and the function add(a,b) returns a string signifying their sum. Strings a and b can have at most 100 characters. Write a main program that loops, asking the user for a and b. The program should terminate if the user enters “done” what asked for “number” a.
Read the input one line at a time and output the current line if and only if it is largerthan any other line read so far or strictly smaller than the previously outputted line. (Here,smaller is with respect to the usual order on Strings, as defined by String.compareTo()). you have to use arrylist and cant modify any code under public static void main(string[] args). example: input 138456792 output: 138492 import java.util.*; import java.io.BufferedReader; import java.io.FileReader; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.Stack; public class Part2 { /** * Your code goes here - see Part0 for an example * @param r the reader to read from * @param w the writer to write to * @throws IOException */ public static void doIt(BufferedReader r, PrintWriter w) throws IOException { /*ArrayList<String> arr = new ArrayList<>(); int count…
Given three int variables that have been given values, areaCode, exchange, and lastFour, write a string expression whose value is the string equivalent of each these variables joined by a single hyphen (-) So if areaCode, exchange, and lastFour, had the values 800, 555, and 1212, the expression's value would be "800-555-1212". Alternatively, if areaCode, exchange, and lastFour, had the values 212, 867 and 5309 the expression's value would be "212-867-5309".
Show the string that would result from each of the following string formatting operations. If the operation is not legal, explain why.171a) "Looks like {1} and {0} for breakfast " . format ("eggs" , "spam")b) "There is {0} {1} {2} {3}" . format (! , " spam" , 4, "you" )c) "Hello {0}" . format ("Susan" , "Computewell")d) " {0:0.2f} {0 :0.2f}" . format (2 . 3, 2 . 3468)e) " {7 . 5f} {7 . 5f}" . format (2 . 3, 2 . 3468)f) "Time left {0 : 02}:{1 : 05.2f}" . format ( 1 , 37 . 374)g) " {1:3}" . format("14")
Many companies use telephone numbers like 555-GET-FOOD so the number is easier for their customers to remember. On a standard telephone, the alphabetic letters are mapped to numbers in the following fashion:A, B, and C = 2D, E, and F = 3G, H, and I = 4J, K, and L = 5M, N, and O = 6P, Q, R, and S = 7T, U, and V = 8W, X, Y, and Z = 9Create an application that lets the user enter a 10-character telephone number in the format XXX-XXX-XXXX. The application should display the telephone number with any alphabetic characters that appeared in the original translated to their numeric equivalent. For example, if the user enters 555-GET-FOOD, the application should display 555-438-3663.
Solve the problem in C++ (Anagrams) Write a function that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, “silent” and “listen” are anagrams. The header of the function is as follows: bool isAnagram(const string& s1, const string& s2) Write a test program that prompts the user to enter two strings and checks whether they are anagrams. Sample Run 1 Enter a string s1: silent Enter a string s2: listen silent and listen are anagrams Sample Run 2 Enter a string s1: split Enter a string s2: lisp split and lisp are not anagrams
Write a complete C++ program that reads from a comma-separated string of name values (entered by standard input) and prints each name on its own line. (This format for data is called CSV, which stands for comma-separated values.) The end of the CSV input will be signaled by two commas in a row. For example, if the CSV-formatted input string is "Aaron Rodgers,J. J. Watt,Luke Kuechly,," then the output should be: Aaron Rodgers J. J. Watt Luke Kuechly HINT: The getline function takes an optional third parameter: a delimiting character. By default, the delimiter is the newline, but you can change this by adding another parameter.
You must answer the Problem in C++. (Anagrams) Write a function that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, “silent” and “listen” are anagrams. The header of the function is as follows: bool isAnagram(const string& s1, const string& s2) Write a test program that prompts the user to enter two strings and checks whether they are anagrams. Sample Run 1 Enter a string s1: silent Enter a string s2: listen silent and listen are anagrams Sample Run 2 Enter a string s1: split Enter a string s2: lisp split and lisp are not anagrams
Consider the following expression using Racket: (= (string-length "hello world") (/ (+ 10 10) 5) ) 1) What data type does the above expression return when evaluated? a.) Boolean, b.) string, c.) Integer, d.) Real, e.) Complex 2) What is the first operation performed in the evaluation of the expression above? a.) The equality, ‘=’, is performed first. b.) The division, ‘/’, is performed first. c.) The addition, ‘+’, is performed first. d.) The string-length operation is performed first. e.) The first operation performed depends on the operating system in use.