Construct flowcharts and algorithms for the following problems: 1. Convert a decimal number into its equivalent binary, octal, or hexadecimal form according to the given option. 2. Test whether a given string is a palindrome. 3. Count the number of vowels, consonants, and special characters in a given string. 4. Unscramble a four-letter word. [Hint. Let abcd be the given four-character string. The process should find out all the words by jumbling the characters, such as acbd and adbe.] 5. Convert a given Roman numeral into its decimal equivalent. The fol- lowing table gives the Roman numerals and their decimal equivalents: Roman Decimal M 1000 D 500 C 100 50 X 10 V 5 The algorithm for converting a Roman numeral RI, R2, .Rn to a decimal is given below: 1. I+1 (I denotes the position of the symbol being scanned) 2. DECIMAL 0 DECIMAL is to hold the decimal value ofthe given Roman numeral) 3. REPEAT steps 4 through 6 WHILE I < N. 4. If the decimal value of R, is greater than or equal to the decimal value of R,., add the decimal value of R, to DECIMAL else subtract the decimal value of R, from DECIMAL. 5. COMPUTE I +I+1. 6. END-WHILE.

Construct flowcharts and algorithms for the following problems: 1. Convert a decimal number into its equivalent binary, octal, or hexadecimal form according to the given option. 2. Test whether a given string is a palindrome. 3. Count the number of vowels, consonants, and special characters in a given string. 4. Unscramble a four-letter word. [Hint. Let abcd be the given four-character string. The process should find out all the words by jumbling the characters, such as acbd and adbe.] 5. Convert a given Roman numeral into its decimal equivalent. The fol- lowing table gives the Roman numerals and their decimal equivalents: Roman Decimal M 1000 D 500 C 100 50 X 10 V 5 The algorithm for converting a Roman numeral RI, R2, .Rn to a decimal is given below: 1. I+1 (I denotes the position of the symbol being scanned) 2. DECIMAL 0 DECIMAL is to hold the decimal value ofthe given Roman numeral) 3. REPEAT steps 4 through 6 WHILE I < N. 4. If the decimal value of R, is greater than or equal to the decimal value of R,., add the decimal value of R, to DECIMAL else subtract the decimal value of R, from DECIMAL. 5. COMPUTE I +I+1. 6. END-WHILE.

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

Please assist me with these questions.(for the 1st part just complete the bolded area. All other areas have been completed. Then complete the 2nd part 1. Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have the digit 5. For example, if n is 100, the program should output 5, 53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num) and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms. Now, let's trace this algorithm for the input n = 15: For i = 2 to 14, we check if i is prime and if i contains the digit 5. The prime numbers less than 15 are 2, 3, 5, 7, 11, 13. Among these, only 5 contains the digit 5. So, the output for n = 15 is [5]. 2. I also need help with creating JavaScript code for the flowchart provided below. Note: You will have to implement several functions that…
Return the smallest number of steps it takes to convert a string entirely into uppercase or entirely into lower case, whichever takes the fewest number of steps. A step consists of changing one character from lower to upper case, or vice versa. Examples stepsToConvert("abC") → 1 // "abc" converted to "abc" in 1 step steps ToConvert("abCBA") → 2 // "abCBA" converted to "ABCBA" in 2 steps stepsToConvert("aba") → 0 steps ToConvert("abaCCC") -3
Select all alternatives that are correct related to variable names. a. It can have symbols in the middle or at the end. O b. It can not have digits at the end. C. It cannot start with a symbol, except__. O d. It can start with a digit. e. It can start with a capital letter.
Write code in python using repetition to create the following patterns 999999999888888887777777666666555554444333221Note; create means you must create with program code, not just assign it as a literal. The problemWrite a program that asks the user for an integer between 1 and 25 and then generates the pattern that many times. Advice: there are two issues to deal with for this program – getting the number and printing out the pattern that many times. A systematic approach is to 1. get your program working to print the pattern once, (a loop)2. expand your program to print it multiple times, (nested loop_)3. Expand to include the request for the number of times.
Question 1: Given the following strings: x = well, y = in and z = formed Evaluate the following string operations: (1) x y y x (x y) z x (y z) (iii) (iv)
Im stuck on this java code. The code is supposed to ask user for a string. Characters that are number, are doubled and replaced with the sum. The characters that are upper are replaced with lower and lower are replaced with upper. It should keep asking user for string until user input Q to end the program. example 1: original: 3rD converted: 6Rd ex 2: original: 6sJ converted: 3Sj (when a value is doubled and its than 9, the two digits are added. so 6 * 2 is 12. And then add the two digits. so 1 + 2 = 3.) I'm having problem with the code that its not reading where it replace the lower to upper and vice versa. this is my code so far: import java.util.Scanner;public class Convert {public static void main(String[] args) {Scanner input = new Scanner(System.in);String original, converted;while (true) {System.out.print("Original String (input):");original = input.nextLine();if (original.equals("q") || original.equals("Q")) {break;}char[] chars = original.toCharArray();for (int i = 0; i <…
Complete the following program that collects an input word from the keyboard and finds if the word is palindrome. A word is palindrome if the sequence of characters are the same from left-to-right and right-to-left, for example, "dad", "racecar" or "rotor" are all palindrome words because they can be read the same either forward or backward. word = input ("Entera word: ") 1s_palindrome = True i = -1 for if word[j] != word[1]: if not is palindrome: else: i-1 is palindrome = False print ("word is palindrome") jin range(len(word)) i+1 -1 print ("word is not palindrome") len(word) jin word
Compute for the leftmost and rightmost derivation of the following produced string. a. aaaaaaaaaa b. abababababab c. aabbaabbaa d. aaaaabaaaaa e. bbbaaaaaaaaa
Return the smallest number of steps it takes to convert a string entirely into uppercase or entirely into lower case, whichever takes the fewest number of steps. A step consists of changing one character from lower to upper case, or vice versa. Examples stepsToConvert("abC") → 1 // "abc" converted to "abc" in 1 step steps ToConvert("abCBA") → 2 // "abCBA" converted to "ABCBA" in 2 steps stepsToConvert("aba") → 0 steps ToConvert("abaCCC") -3
Answer by yourself, Code must be correct and output must be matched Please do it in the mentioned programming language only
I need the answer as soon as possible
22. Develop an algorithm that computes the frequencies of all characters in an input string. Assume the input string contains only lowercase English letters (a-z only). Example: Input: "this is a sample text" Output (format is not important): a:2, b:0, c:0, d:0, e:2, f:0,g:0, .... w:0, x:1, y:0, z:0 Describe your algorithm in pseudocode. 23. What is the space complexity of your algorithm?