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

Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to get reduced to 1. You can perform any one of the following 3 steps:1.) Subtract 1 from it. (n = n - 1) ,2.) If its divisible by 2, divide by 2.( if n % 2 == 0, then n = n / 2 ) ,3.) If its divisible by 3, divide by 3. (if n % 3 == 0, then n = n / 3 ). Write brute-force recursive solution for this.Input format :The first and the only line of input contains an integer value, 'n'.Output format :Print the minimum number of steps.Constraints :1 <= n <= 200 Time Limit: 1 secSample Input 1 :4Sample Output 1 :2 Explanation of Sample Output 1 :For n = 4Step 1 : n = 4 / 2 = 2Step 2 : n = 2 / 2 = 1 Sample Input 2 :7Sample Output 2 :3Explanation of Sample Output 2 :For n = 7Step 1 : n = 7 - 1 = 6Step 2 : n = 6 / 3 = 2 Step 3 : n = 2 / 2 = 1 SolutionDp///.
I want solution with steps
A company keeps a table containing the salary and boss of each employee. Here is an example: Name Salary Boss Fred 27000 James John 36000 Cindy Mary 39000 Tom Adam 23000 Mary Write an algorithm to count the number of employees who earn more than their boss.
Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to get reduced to 1. You can perform any one of the following 3 steps:1.) Subtract 1 from it. (n = n - 1) ,2.) If its divisible by 2, divide by 2.( if n % 2 == 0, then n = n / 2 ) ,3.) If its divisible by 3, divide by 3. (if n % 3 == 0, then n = n / 3 ). Write brute-force recursive solution for this.Input format :The first and the only line of input contains an integer value, 'n'.Output format :Print the minimum number of steps.Constraints :1 <= n <= 200 Time Limit: 1 secSample Input 1 :4Sample Output 1 :2 Explanation of Sample Output 1 :For n = 4Step 1 : n = 4 / 2 = 2Step 2 : n = 2 / 2 = 1 Sample Input 2 :7Sample Output 2 :3Explanation of Sample Output 2 :For n = 7Step 1 : n = 7 - 1 = 6Step 2 : n = 6 / 3 = 2 Step 3 : n = 2 / 2 = 1 SolutionDp///.
4. A primary school is conducting a survey on the popularity of certain colours. Students are asked to vote for any of four choices: red, blue, green, none. If red, blue or green is not the favourite, students vote for 'none'. Write an algorithm to find and print the (i) number of students that voted for EACH of the colours: red, blue green (ii) TOTAL number of students that voted for red, blue or green. Assume that on the day of the survey, 150 students are present. Also assume that all votes are valid.
Design an algorithm for a problem that processes results of a swimming competition. The program will set a number of competitors, obtain their names from the user, and uses random number generator to get the results (in seconds, as real numbers with three digits after the decimal point). Then it will find and display the average timefor all competitors, andthe names and best three results (first, second, and third places). 1. Set a number of competitors as a constant TOTAL (no more than 10) 2. Declare two arrays to hold names and results (an actual array should have different name than the formal array in the function definitions) 3. Call functions to fill the arrays with names (user entries) and results (random decimal numbers) 4. Print all names and results as a table with appropriate titles 5. Display the average time (by calling function getAverage()) 6. Sort the array of results and corresponding names 7. Print names and results for the first three places (first…