c++ Implement a recursive function that determines whether a string is a palindrome or not. A word is a palindrome if the word looks the same when written backwards. For example. kayak → kayak, but not ball → llob. The function only needs to handle whole words. No special characters or spaces appear in the strings. You do not have to deal with case sensitivity. You get a parameter from stdin: str the text string Input Expected output kayak 1 boll 0 naturrutan 1
Q: Write code that when executed in PowerShell, will satisfy the following requirements: You need to…
A: Answer:
Q: 9. Assume that the content of AL and CL are (15H) and (60H) respectively. What result is produced in…
A: The given question is multiple choice selected question.
Q: Which operating system is faster, interrupt-driven or not, based on specific examples
A: Answer:
Q: How to use Flowgorithm?" Use Flowgorithm programming only for the following (NOT c++, java, pyton,…
A:
Q: Architecture and computer-based organization are two quite different things when it comes to…
A: Architectural design The process of putting together a computer system is known as architectural…
Q: We'll go through the testability tip and provide an overview of the compiler in this part.
A: Software engineer: What does "resist the urge to code" mean? Before coding, a software engineer must…
Q: Explain how to make animations in 3D with Cinema 4D.
A: Introduction: This is the newest method we've incorporated into our workflow. Cinema 4D is a 3D…
Q: When it comes to software development, what are the four most critical parts, and how can you rank…
A: Given: A computer programme is accountable for a software developer's creation of software. Methods…
Q: Let's have a look at the testability recommendation and see what the compiler has to offer before…
A: Given: The capacity to conduct an experiment to test a hypothesis or theory is referred to as…
Q: Is it better to use replication or data fragmentation in distributed database systems? Do you think…
A: Data replication is the process of storing separate copies of the database at two or more sites.
Q: C Early Finish Time
A: Here we have to find the early finish time here we will get it by lowest no or addition about in…
Q: Write a program to ask the user to input an integer, and then display the according pattern.…
A: In your questions some part are not specified I have just mention the program how to enter name…
Q: We'll go over the testability tip and provide a quick tour of the compiler in this class.
A: The whole test ability guidance is as follows: Make use of jargon that isn't readily apparent.…
Q: what will be the output of the code given below:String name = " Juan Dela Cruz"; double age = 56.…
A: The program is written in Java. Please find the answer in the following steps.
Q: Structured language may be beneficial for non-systems analytical techniques.
A: Given: Structured Analysis is a technique of development that use diagrams to assist the analyst in…
Q: Matrix used to calculate highest ranked node of the network is O HighRank matrix O LowRank matrix…
A: Answer: We know that the Matrix used to calculate highest ranked node of the network is Influence…
Q: How does the process of computer programming work? Before deciding on a programming language to use,…
A: In the context of visual programming languages, a programming language is a collection of rules for…
Q: In what ways can incorporating modular design into an application benefit users?
A: A class that stands for a particular activity within an enterprise application is an application…
Q: Use CASE statement in PL SQL block, where take a character as input from the user and print…
A:
Q: Are you aware of the most recent network security measures? Give an explanation for each of the four…
A: Protection of a network: It is strongly suggested that every company build security for their local…
Q: However, there is still a problem with defining exactly what we mean when we talk about 4G or 5G…
A: Networks using either 4G or 5G: In a nutshell, the transition from the 4G network to the 5G network…
Q: Explain three ways in which Application software may be made available to the public at large.
A: 1. "Application software may be offered as a subscription service, where users pay a monthly or…
Q: A look at the Windows Service Control Manager will be covered in this post
A: Service Control Manager:- (SCM) is a unique framework process under the Windows NT group of working…
Q: Write a line by line explanation to this program. What does the program do at every routine?…
A: Answer is given below-
Q: Since the parallel process AB needs to use two shared resources S1 and 2, I want to perform…
A: There are two resources s1 and s2 and for entering the critical section the access of both the…
Q: We'll go through the testability tip and provide an overview of the compiler in this part.
A: Introduction: Foundation: The full text of the testability tip is provided below. Utilize nonverbal…
Q: Please provide an example of a user engaging with a system and describe the gap between the…
A: Given: Provide a scenario in which a user was interacting with a system, and explain the execution…
Q: IS TO 8. reduce the number of components in an amplifier. b. increase the transistor life. c.…
A: Given question are multiple choice options selected question.
Q: What makes a VPN more secure than the open internet? The VPN tunnel mode is a different story.…
A: Given: Using a VPN is safer than connecting to the public internet, and VPN tunnel mode is…
Q: USING CONSTANTS WITH ARRAYS It is a good programming practice to use a named constant to help you…
A: Please find the answer below :
Q: What about a more in-depth discussion and analysis of your wireless security experiences?
A: Given: Wi-Fi networks are included in the definition of "wireless networks," therefore wireless…
Q: What is the Ubuntu Server Operating System
A: Ubuntu server operating system is as follows.
Q: What tangible examples can you offer of the software structure review process when you describe it??
A: Review of the Software's Internal Structure: Conduct an in-depth analysis of the process of…
Q: When it comes to ICT, why is the internet seen as a positive example? Give specific examples to back…
A: ICT:-ICT represents Information and Communication Technology, which is an innovation thatpermits us…
Q: Write a pseudocode. Dissen Two students Alice and Bob came up with the idea of modifying Binary…
A: Answer:
Q: which display issues does running a screen saver help prevent
A: Answer:
Q: In the context of object-oriented programming analysis and design, is it possible to define the…
A: Given: OOAD is for Object-Oriented Analysis and Design, and it is a strategy for researching and…
Q: The object-oriented design methodologies that are used should be organized in such a manner that…
A: OOP stands for Object Oriented Programming.
Q: You are asked to design computer networks for a company with a headquarter and four branch offices…
A: The firm has a corporate headquarters and four branch offices in the same city. The firm desires a…
Q: sion layer in an OSI M
A: Introduction :The Session Layer is the fifth layer in the Open System Interconnection (OSI) model.…
Q: implement F using NOR & NOT F=CD(B+C)A(BC'+DE') please can you show all steps
A:
Q: (b) This question part is about distributed algorithms. Consider the execution of the distributed…
A: BFS algorithmWe can take the example of Rubik's Cube as an example. The Rubik's Cube seems to be…
Q: What makes utilizing a virtual private network (VPN) more secure than using the public internet…
A: A virtual private network, or VPN, is an encrypted connection over the Internet from a device to a…
Q: Count, Sum, Average, Largest and Smallest Expanding on the previous flowgorithm program write a…
A:
Q: Using examples, demonstrate that interrupt-driven operating systems outperform non-interrupt-driven…
A: According to this question, interrupt-driven operating systems' performance is superior to that of…
Q: essential functi
A: An operating system (OS) is system software that oversees PC hardware, software assets, and offers…
Q: An application program's goal is to meet a particular demand of the user.
A: An application program is a comprehensive and self-contained software designed to carry out a…
Q: What three conditions must a network meet to function efficiently? Please explain one to me.
A: Given: For a network to work well, it needs to meet three basic requirements: it needs to connect…
Q: Question 5 What is an example of an unmanaged best effort public network? Ⓒintranet Ⓒindere Select…
A: An unmanaged network is a special kind of network in which all things under the network are managed…
Q: o 14. This circuit output (1,2,4,6,7) will turn on red light, (3,5,8,11) will turn green light, no…
A: We have a circuit that counts from 1 to 14. This circuit output (1,2,4,6,7) will turn on red light,…
c++
Implement a recursive function that determines whether a string is a palindrome or not.
A word is a palindrome if the word looks the same when written backwards. For example. kayak → kayak, but not ball → llob.
The function only needs to handle whole words. No special characters or spaces appear in the strings. You do not have to deal with case sensitivity.
You get a parameter from stdin:
str the text string
Input Expected output
kayak 1
boll 0
naturrutan 1
Step by step
Solved in 2 steps with 4 images
- Implement a recursive C++ function which takes a character (ch) and a positive integer (n) and prints thecharacter ch, n times on the screen. The prototype of your function should be:void printChar (char ch, int n)For example, calling printChar('*',5) should display ***** on screen.Note: There should NOT be any loop in your function.In Kotlin A. Write a function lengthGreaterThan() with an expression body that takes a String s and an Int n and returns true if the String is at least n characters long. Then revise the function so that it can accept null values. If it receives null as the parameter, it should return false. B. Write a recursive function with an expression body that takes a list of nullable Strings and and Int an returns a list of just the Strings from the original list for which the function you wrote in the first part returns true C. Get the same result as in part B by using filter()A palindrome is a sentence that contains the same sequence of letters reading it either forwards or backwards. A classic example is '1\.ble was I, ereI saw Elba." Write a recursive function that detects whether a string is apalindrome. The basic idea is to check that the first and last letters of thestring are the same letter; if they are, then the entire string is a palindromeif everything between those letters is a palindrome.There are a couple of special cases to check for. If either the first orlast character of the string is not a letter, you can check to see if the restof the string is a palindrome with that character removed. Also, when youcompare letters, make sure that you do it in a case-insensitive way.Use your function in a program that prompts a user for a phrase andthen tells whether or not it is a palindrome. Here's another classic fortesting: '1\. man, a plan, a canal, Panama!"
- Write a recursive function, reverseDigits, that takes an integer as a parameter and returns the number with the digits reversed. Also, write a program to test your function.In C language, implement two recursive versions of the linear search that gets an array of songs and a title and searches for a song with the given title in the array. 1. In this version the function returns the first index of the array containing the number. If the number is not in the array, the function returns -1. int linear_search_rec_first(int* ar, int length, int number); 2. In this version the function returns the last index of the array containing the number. If the number is not in the array, the function returns -1. int linear_search_rec_last(int* ar, int length, int number); Example of test for case 1: void test_q3() { int ar1[]={1,2,3,4,5,4,3,2,1}; if (linear_search_rec_first(ar1,9,2)==1) printf("Q3-1 ok\n"); else printf("Q3-1 ERROR\n"); } Example of test for case 2: void test_q3() { int ar1[]={1,2,3,4,5,4,3,2,1}; if (linear_search_rec_last(ar1,9,2) == 7) printf("Q3-3 ok\n"); else printf("Q3-3 ERROR\n"); }Write a recursive function named reverseWithinBounds that has an argument that is an array of characters and two arguments that are bounds on array indices. The function should reverse the order of those entries in the array whose indices are between the two bounds (including the bounds). For example, if the array is: a[0] == 'A' a[1] == 'B' a[2] == 'C' a[3] == 'D' a[4] == 'E' and the bounds are 1 and 4, then after the function is run the array elements should be: a[0] == 'A' a[1] == 'E' a[2] == 'D' a[3] == 'C' a[4] == 'B' Embed the function in a program and test it. After you have fully debugged this function, define another function named reverseCstring that takes a single argument that is a C string and modifies the argument so that it is reversed. This function will include a call to the recursive definition you did for the first part of this project, and need not be recursive. Embed this second function in a program and test it.
- Write a recursive function named reverseWithinBounds that has an argument that is an array of characters and two arguments that are bounds on array indices. The function should reverse the order of those entries in the array whose indices are between the two bounds (including the bounds). For example, if the array is: a[0] == 'A' a[1] == 'B' a[2] == 'C' a[3] == 'D' a[4] == 'E' and the bounds are 1 and 4, then after the function is run the array elements should be: a[0] == 'A' a[1] == 'E' a[2] == 'D' a[3] == 'C' a[4] == 'B' Embed the function in a program and test it. After you have fully debugged this function, define another function named reverseCstring that takes a single argument that is a C string and modifies the argument so that it is reversed. This function will include a call to the recursive definition you did for the first part of this project, and need not be recursive. Embed this second function in a program and test it. Turn in only this final result (with output,…Write a recursive Racket function "update-if" that takes two functions, f and g, and a list xs as parameters and evaluates to a list. f will be a function that takes one parameter and evaluates true or false. g will be a function that takes one parameter and evaluates to some output. The result of update-if should be a list of items such that if x is in xs and (f x) is true, then (g x) is in the list. The output list's elements should keep the input list's items in the same relative order. For example (update-if even? add1 '(1 2 3 4)) should evaluate to '(3 5) because 2 and 4 make even? true and add1 turns 2 and 4 into 3 and 5.In C++ Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names (until -1), and use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia -1 hen the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia #include <vector>#include <string>#include <iostream> using namespace std; // TODO: Write method to create and output all permutations of the list of names.void AllPermutations(const vector<string> &permList, const vector<string> &nameList) { } int main(int argc, char* argv[]) { vector<string> nameList; vector<string> permList; string name; // TODO: Read in a list of names; stop when -1 is read. Then call recursive method. return 0;}
- In Kotlin, Write a recursive function called myZip, with an expression body. MyZip takes two Lists and returns a List of Pairs in which each value may be any type (I suggest your start by thinking out how to represent this data type). The pairs consist of corresponding elements in the two lists (the first element of the first list and the first element of the second list, etc). The base case should be that either (or both) of the original lists has length 1, so that, if the lists have different length, the zipping stops when the first list runs out of values.Define a recursive function removeAll that expects an item and a Lisp-like list as arguments. This function returns a Lisp-like list with all of the instances of the item removed. In the lisplist.py file, make sure to include the insert() and equal() methods from Programming exercise 9.7 and Programming exercise 9.8. Hint: Keep on removing the item if it equals the list’s first item. Here is an example of its use: >>> lyst = cons(2, cons(2, (cons 3, THE_EMPTY_LIST))) >>> lyst (2 2 3) >>> removeAll(2, lyst) (3) >>> removeAll(3, lyst) (2 2) File: lisplist.py Project 9.9 Adds a removeAll function for Lisp lists. Add the insert() and equal() methods from Programming Exercise 9.7 and 9.8 """ class Node(object): """Represents a singly linked node.""" def __init__(self, data, next = None): self.data = data self.next = next def __repr__(self): """Returns the string representation of a nonempty lisp list."""…Implement in C Programming 10.11.1: LAB: All permutations of names Given a main program that reads the number of one word names followed by the list of names, complete the recursive function PrintAllPermutations() to list all ways people can line up for a photo (all permutations of an array of strings). Function PrintAllPermutations() takes 4 parameters: an array of a permutation of names, the number of names in the array of the permutation of names, an array of available names, and the number of names in the array of available names. Function PrintAllPermutations() then creates and outputs all possible orderings of those names separated by a comma, one ordering per line. When the input is: 3 Julia Lucas Mia then the output is (must match the below ordering): Julia, Lucas, Mia Julia, Mia, Lucas Lucas, Julia, Mia Lucas, Mia, Julia Mia, Julia, Lucas Mia, Lucas, Julia (please add commas in code please) #include <stdlib.h>#include <stdio.h>#include <string.h> const int…