Q 3. Write a recursive function which compares two strings lexicographically, without usingany predefined string functions from header file. Lexicographical order means alphabeticalorder as present in a dictionary, where a string which is greater - appears later in the dictionary.Also write main () function.It returns -1 if string 1 is smaller than string 2 It returns 1 if string 1 is greater than string 2 Itreturns 0 if both the strings are equal.For example:Programming Language :- CIf string 1 is "madan" and string 2 is "madams" it returns 1If string 1 is "aaaaba" and string 2 is "aaaabz" it retruns -1If string 1 is "abzdefz" and string 2 is "abzca" it returns 1

Answered: Q3. Write a recursive function which…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

13. While dictionaries are designed so that we can find a value based on a key, every so often we need to perform a reverse lookup. For example, imagine a dictionary where the keys are names and the values are phone numbers. Usually we want to find the phone number based on the name, but occasionally you might need to find a name based on the phone number. Write a function called reverse_lookup(dictionary, value) that returns all the keys in the dictionary associated with the specified value. Note: In dictionaries, the keys are guaranteed to be unique, but the values are not. So your function should return a list containing all of the matching keys (if any) Example: Given this dictionary, groups = {'Apple': 'Fruit', 'Spinach': 'Vegetable', 'Banana': 'Fruit'} reverse_lookup (groups. Vegetable') ["Spinach'] reverse_lookup (groups, Fruit') ['Apple'. 'Banana'] reverse_lookup (groups. 'Meat') []
Recamán's sequence def recaman(n): Compute and return the first n terms of the Recamán's sequence, starting from the term a1 = 1.Note how the definition for the current next element depends on whether a particular number is already part of the previously generated part of the sequence. To let your function execute in a speedy fashion even when generating a sequence that contains millions of elements, you should use a set to keep track of which values are already part of the previously generated sequence. This way you can generate each element in constant time, instead of having to iterate through the entire previously generated list. The better technique that saves time by using more memory can create this list arbitrarily far in linear time, and should therefore be fast even for millions of elements, at least until it runs out of memory. n Expected result 10 [1, 3, 6, 2, 7, 13, 20, 12, 21, 11] 1000000 (a list of million elements whose last five elements are [2057162,1057165,…
18) Write a function that takes in 2 lists and checks whether they have the same elements in the same order. If the elements are all the same, the function should return the string “same”. If any of the elements are different, the function should return the string “different”. The definition of the function should be: Def equals(a, b):
6. Given the following main function: // remove the first digit of a number int main() { int n, m; cout >n; m-removeFirst(n); cout <
Data structure: Using Java,
The programming language is - Python a. Write a function called daysOver that takes three arguments: a dictionary, a location (such as ‘Sydney’, ‘Adelaide’,etc) and a temperature and returns the number of days that were over the given temperature for the given location. For example, if we call the function using the line: total = daysOver(dictionaryData, ‘Adelaide’, 40) total will hold the number of days that Adelaide had a temperature greater than 40 celsius in the data. As a test, there were 54 days over 40 celsius in the data. Check that total is 54 for the example when you run your code. b. Use the daysOver function to print the number of days over 35 celsius for each of the following cities: 'Adelaide','Perth','Melbourne','Canberra','Sydney','Brisbane','Darwin' c. Which of the Australian cities has the most number of days over 35 celsius? My spreadsheet looks like this Since I cannot attach an excel file, my excel file name is "weatherAUS.csv"
AHPA #11: Changing Grades * * Create a C function (switcher) that will receive a pointer to the finalExams array, using only pointers look for D scores and boost them to C scores. (ouput should be same as picture)
Rewrite the determineAdmission Fee function using a dictionary data structure such that it produces the same output when the program is run. #Determine an admission fee based on age group. def main(): print("Enter the person's age group ", end=""") ageGroup=input("(child, minor, adult, or senior): " print("The admission fee is", determineAdmission Fe def determineAdmission Fee(ageGroup): if ageGroup == "child": return 0 elif ageGroup == "minor": return 5 # age 6 to 17, $5 elif ageGroup == "adult": return 10 # age 18 to 64, $10 elif ageGroup == "senior": return 8 # age >= 65, $8
Part 3: Time for a Financial Checkup Complete the function financial_checkup, which takes a dictionary representing your monthly budget for certain categories of expenditures (budget), and a dictionary that represents how much you actually spent in each category (outlays). The function then creates and returns a new dictionary of those categories in which you overspent and the excess amount. Specifically, the returned dictionary maps the category name to the amount of excess spending, given as a negative number. If a category appears in outlays, but not budget, we interpret this to mean that we budgeted $0 for that category, so the entire amount in outlays is considered to be excess spending. Example #1: budget: spent returned: {'food' -95, 'travel': -100} Example #2: budget: spent {'food': 125, 'gas': 75, 'travel': 400} {'food' 220, 'gas': 10, 'travel': 500} Example #3: {'food' 100, 'gas': 30} {'food' 220, 'gas': 10, 'travel': 500} returned: {'food": -120, 'travel': -500} {'drinks'…

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS