5) Add 2 numbers of any arbitrary base. Your addition algorithm MUST perform the addition IN THE BASE. By which I mean, process the numbers as strings, iterating through the digits of each string, add num1[i] + num2[i] + carry = sum[i), loop. Do NOT convert to an integer first. // input s1, s2, base, return sum void addInBase (char s1[], char s2[], char sum[], int base) %3D

5) Add 2 numbers of any arbitrary base. Your addition algorithm MUST perform the addition IN THE BASE. By which I mean, process the numbers as strings, iterating through the digits of each string, add num1[i] + num2[i] + carry = sum[i), loop. Do NOT convert to an integer first. // input s1, s2, base, return sum void addInBase (char s1[], char s2[], char sum[], int base) %3D

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

Make a C-Language code of the problem: Modify the code such that the program will be able to generate a list of the first N perfect square numbers and give out its sum. Perfect squares are the squares of whole numbers: 1, 4, 9, 16, 25, 36, ... etc. See the sample output in the picture #include <stdio.h> bool isPerfectSquare(int x){ //insert code for isPerfectSquare() function here } int getSum(int *arr, int size){ //insert code for getSum() function here } void printArray(int *arr, int size){ //insert code for printArray() function here } int main(){ //insert code for main() function here return 0;} Note: Do not change the initial function definitions. You are free to use more functions and variables as you see fit.
Write a function called reversit () that reverses a C-string (an array of char). Use a forloop that swaps the first and last characters, then the second and next-to-last characters, and so on. The string should be passed to reversit () as an argument. Write a program to exercise reversit (). The program should get a string from the user, call reversit (), and print out the result.using class in c++
Please explain Python Code def convertup(word):uppercaseword = ""#for c in word:for lc in range(len(word)):c = word[lc].upper() uppercaseword += creturn uppercaseworddef wconvertup(word):uppercaseword = ""lc = 0while (lc < len(word)):c = word[lc].upper() uppercaseword += clc += 1return uppercaseworddef inplaceconvertup(word):for lc in range(len(word)):# strings are immutable !!# so I can't say word[lc] = word[lc].upper()word = word[:lc] + word[lc].upper() + word[lc+1:]return word# might substitute a careful use of chr(ord("a")-32) for .upper()def recursivetoupper(word,spot):if spot < len(word): # keep goingword = word[:spot] + word[spot].upper() + word[spot+1:]return recursivetoupper(word,spot+1)return worddef rconvertup(word):return recursivetoupper(word,0)
int i cannot be changed with int pos I have to fill in the program that is missing in the middle by using what is already there in C++. Started with this but does not like it cout << "Enter passwdStr: "; getline(cin, passwdStr); while (passwdStr.find("qwerty") != string::npos) { passwdStr.replace(int i, 6, "mvhnkl"); i = passwdStr.find("qwerty"); }
Below is a recursive version of binary search:int binarySearch(int nums[], int low, int high, int target){ if (low > high) return -1; int mid = (low + high)/2; if (target == nums[mid]) return mid; else if (target < nums[mid]) return binarySearch(nums, low, mid - 1, target); else return binarySearch(nums, mid + 1, high, target);}For the 4 statements below, indicate whether you think it is True or False. If you like, you can provide a description of your answer for partial credit in case you are incorrect.1) The code “if (low > high) return -1;” is a base case for this function2) The code “int mid = (low + high)/2;” is a base case for this function3) The code “if (target == nums[mid]) return mid;” is a base case for this function4) The code “else return binarySearch(nums, mid + 1, high, target);” is a base case for this function
In Python, grades = {'Tim': [87,96,70], 'Sue': [100,87,90], 'Jack': [94,77,90], 'Kevin': [100,81,82], 'Bart': [83, 65, 85]} Ask user to enter the names of the rows, i.e., indices. You can use: len(grades) to get the number of rows of the DataFrame. In addition, using the sort_index() method, ask user whether they wish to sort by rows or by columns and whether to sort in ascending or descending order (do not use any if-else statements) '''
In python Code so far: # TODO: Declare global variables here.recursions = 0comparisons = 0 def binary_search(nums, target, lower, upper): # Type your code here. target = (lower + upper) //2 global if target == nums[index]: return index if (lower == upper): comparisons +=1 if target == nums[lower]: return lower else: return -1 if (nums[index] < target): recursions += 1 return binary_search(nums,target, index, upper) if nums[index] > target: recursions += 1 return binary_search(nums, target, 0, lower) if __name__ == '__main__': # Input a list of nums from the first line of input nums = [int(n) for n in input().split()] # Input a target value target = int(input()) # Start off with default values: full range of list indices index = binary_search(nums, target, 0, len(nums) - 1) # Output the index where target was found in nums, and the # number of…
Given a file of unsorted words with mixed case: read the entries in the file and sort those words lexicographically. The program (in c++) should then prompt the user for an index, and display the word at that index. Since you must store the entire list in an array, you will need to know the length. The "List of 1000 Mixed Case Words" contains 1000 words. You are guaranteed that the words in the array are unique, so you don't have to worry about the order of, say, "bat" and "Bat."
PLEASE DO THIS IN PYTHON Part 4 - Performance of binary_search Modify your binary_search function to count the number of comparisons (==, <, <=, >, or >=). The function will now return both the number of comparisons made and the True or False result. The code below calls your function, and creates a simple ASCII bar chart of the number of comparisons (divided by 10, to account for small differences). Test Code max_elements = 100000 for length in range(1, max_elements, 10000): values = list(range(1, (2 * length) + 1, 2)) num_comparisons, found = binary_search(values, length + 1, 0, len(values) - 1) num_comparison_string = format(num_comparisons, '03d') print(num_comparison_string, '*' * (num_comparisons // 10))
def find_root4(x, epsilon): ''' IN PYTHON Assume: x, epsilon are floating point numbers and epsilon > 0 Use bisection search to find the following root of x such that If x >=0, return y such that x - epsilon <= y ** 2 <= x + epsilon Else, return y such that x - epsilon <= y ** 7 <= x + epsilon Note: You must use bisection search to implement the function. ''' pass
I'm trying to delete a node after inputting data for 2-3 checks but the node I try to delete remains in the list. How do I fix my deleteCheck() function to run correctly with the rest of my code? Thank you. #include <stdio.h>#include <stdlib.h>// Austin Chong// The core concept of this assignment is to use a linked list in a C program.// 07 March 2020 struct checkNode{int checkNumber;char date[8];char paidTo[100];char description[100];double amount;struct checkNode *head;struct checkNode *next;}; struct checkNode *checkBook = NULL; /* Functions */ void addCheck(){int checkNumber;double amount;char temp;struct checkNode *newCheck = (struct checkNode*) malloc(sizeof(struct checkNode));printf("Please enter the check number: ");scanf("%d", &checkNumber);newCheck -> checkNumber = checkNumber;printf("Please enter the amount: ");scanf("%lf", &amount);newCheck -> amount = amount;printf("Please enter the date: ");scanf("%c", &temp);scanf("%[^\n]", newCheck ->…
Write a C++ program that searches for "anagrams'' in a dictionary. An anagram is a word obtained by scrambling the letters of some string. For example, the word "pot'' is an anagram of the string "otp." For this solution you must not use recursion. Instead, use the std::next_permutation function in the algorithm library. Here is a downloadable link to the words.txt file, but you must be logged in to a google account for it to show up: https://drive.google.com/file/d/1GSIp0R224wnJUARW1qj1AnBWKO-cZyS8/view?usp=sharingHere is a sample of how the program might work:Please enter a string for an anagram: optMatching word optMatching word potMatching word top Here is another sample of how the program might work:Please enter a string for an anagram: blahNo matches foundYou must write these two functions with the exact same function signature (include case):int loadDictionary(istream &dictfile, vector<string>& dict);Places each string in dictfile into the vector dict. Returns the…