Question Martin is a commander in the army. An undercover agent shares some secret information with him. The secret information consists of a text and the name of a terrorist. With the given information, Martin needs to find the number of terrorists who are going to attack the army base. The agent gave Martin a hint that the number of terrorists is the number of times the terrorist's name occurs in the text. Write an algorithm to help Martin find the number of terrorists who are going to attack the army base. Input 4 The first line of the input consists of a string text, representing the text portion of the secret information shared by the agent. The second line consists of a string name representing the name of the terrorist. Output 5- /* 6 7 8 9- 10 11- 12 13 77 14 15 16 17 18 19 20- 21 N222222 12 22 23 24 25 456 26 27 28 29 www.w3 30 01234 31 32 impor impor 34 */ publ { 33 }

Question Martin is a commander in the army. An undercover agent shares some secret information with him. The secret information consists of a text and the name of a terrorist. With the given information, Martin needs to find the number of terrorists who are going to attack the army base. The agent gave Martin a hint that the number of terrorists is the number of times the terrorist's name occurs in the text. Write an algorithm to help Martin find the number of terrorists who are going to attack the army base. Input 4 The first line of the input consists of a string text, representing the text portion of the secret information shared by the agent. The second line consists of a string name representing the name of the terrorist. Output 5- /* 6 7 8 9- 10 11- 12 13 77 14 15 16 17 18 19 20- 21 N222222 12 22 23 24 25 456 26 27 28 29 www.w3 30 01234 31 32 impor impor 34 */ publ { 33 }

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 the task of analyzing how joyful a person is. If you are given a list of numbers that represent the emotional value of an individual on each day, design a divide and conquer algorithm to find the most joyous interval of the person. The measure of joy is given as sum of the values in interval multiplied by the smallest integer in the interval.
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You are given a string s of even length n. String s is twofold, at the end of the day, comprises just of 0's and 1's. String s has precisely n2 zeroes and n2 ones (n is even). In one activity you can invert any substring of s. A substring of a string is an adjoining aftereffect of that string. What is the base number of tasks you really want to make string s rotating? A string is rotating if si≠si+1 for all I. There are two kinds of exchanging strings overall: 01010101... or on the other hand 10101010... Input The principal line contains a solitary integer t (1≤t≤1000) — the number of experiments. The principal line of each experiment contains a solitary integer n (2≤n≤105; n is even) — the length of string s. The second line of each experiment contains a parallel string s of length n (si∈ {0, 1}). String s has precisely n2 zeroes and n2 ones. It's surefire that…
Julius Caesar is known as the first person to document themilitary use of encryption. Caesar’s cipher was a cipher that created asecret message by shifting a little by certain number of positions. Forexample, for a shift value of 3, the letter ’A’ would be replaced by aletter ’D’. Write an algorithm that displays a secret message given amessage (assume all in caps) and a shift value
Consider the Peasants' Algorithm for multiplication of two positive integers. It works in the followingmanner:● Write the two numbers in two columns. Keep updating according to the following procedure until thenumber in the first (i.e., left) column becomes 1.● Halve the number in the first column (integer division), double the number in the second column.● In the end, sum up all the numbers in the second column, for which, the corresponding number in thefirst column is odd.Example of multiplication using Peasants’ algorithm: 13 x 8:13 8 ←6 163 32 ←1 64 ←Answer: 64 + 32 + 8 = 104Write a c++ program function to calculate multiplication using the Peasants’ algorithm. Can you try the recursivefunction for the same?
Consider the Peasants' Algorithm for multiplication of two positive integers. It works in the followingmanner:● Write the two numbers in two columns. Keep updating according to the following procedure until thenumber in the first (i.e., left) column becomes 1.● Halve the number in the first column (integer division), double the number in the second column.● In the end, sum up all the numbers in the second column, for which, the corresponding number in thefirst column is odd.Example of multiplication using Peasants’ algorithm: 13 x 8:13 8 ←6 163 32 ←1 64 ←Answer: 64 + 32 + 8 = 104Write a function to calculate multiplication using the Peasants’ algorithm. Can you try the recursivefunction for the same?
A disk drive has 256 cylinders, with the numberThe cylinder starts at 0 and ends at 255. The position of the needle on the disk drive is currently stoppedat point 128. It is also known that the needle is always "to the cylinder with more numbers"Small first." The order of the positions visited in sequence is:254, 64, 32, 100, 50, 70. From the 3 algorithm options below, which is the best algorithm? Make each onedraw it and specify seektime. i. SCANii.C-SCANiii. FIFO
The greatest common divisor of two positive integers, A and B, is the largest number that can be evenly divided into both of them. Euclid’s algorithm can be used to find the greatest common divisor (GCD) of two positive integers. You can use this algorithm in the following manner: Compute the remainder of dividing the larger number by the smaller number. Replace the larger number with the smaller number and the smaller number with the remainder. Repeat this process until the smaller number is zero. The larger number at this point is the GCD of A and B. Write a program that lets the user enter two integers and then prints each step in the process of using the Euclidean algorithm to find their GCD. An example of the program input and output is shown below: Enter the smaller number: 5 Enter the larger number: 15 The greatest common divisor is 5
Consider the following directions for shampooing hair: • Rinse hair • Put shamp0o on hair • Lather • Repeat Is this a good example of an algorithm? Do you see any problems with the algorithm. Explain.
Consider a group of balls where each ball is one of k colors. You can assume that there is an equal number of balls of each color. Each ball, aside from its color, has a written integer on it. The numbers are in no way associated with the color. a) Devise an algorithm that orders all the balls according to colors in a way that no ball comes before a ball of a lighter color. In other words, how do you order balls from lightest to darkest, however, inside one group (i. e., one color), balls can be ordered in any way with respect to the number written on the ball. Design an algorithm and analyze it. b) Now take the output from (a), and also order balls within the color. How much time is needed for this step?
Let two words be given. At least how many steps must be taken to make one of these two words like the other? Each step can be one of the following 3 steps: 1- Drop a letter 2- Changing a letter 3- Add a letter (anywhere) Solve the question using only a brute force algorithm. Explain your solution and question write program in java language and calculate time complexity?
Imagine if the survey contained two sheets in the same book. Perhaps sheet 1 isshoes and sheet 2 is dresses.The work now doubles.What about more than two sheets?You get the picture. This needs some sort of automation.Write ALGORITHM FOR MERGING SHEETS
1. A runner targets herself to improve her time on a certain course by 3 seconds a day. If onday 0 she runs the course in 3 minutes, how fast must she run it on day 14 to stay ontarget?2. A certain computer algorithm executes twice as many operations when it is run with aninput of size k as when it is run with an input of size k − 1 (where k is an integer that isgreater than 1). When the algorithm is run with an input of size 1, it executes sevenoperations. How many operations does it execute when it is run with an input of size 25?