6. Haskell function show (show:: (BST a)) -> String) is defined by a Haskell deriving Show clause and it operates as follows. instance Show a => Show (BST a) where show Nil = "Nil" show (Node x Nil Nil) = "Node " ++ (show x) ++" Nil Nil" show (Node x Nil right) = "Node " ++ (show x) ++" Nil (" ++ (show right) ++ ")" show (Node x left Nil) - "Node " ++ (show x) ++" (" ++ (show left) ++ ") Nil" show (Node x left right) = "Node " ++ (show x) ++ (" ++ (show left) ++ ") (" ++ (show right) ++ ")" (i) Explain the recursion of function show in general BST terms. (ii) Assume that function show is applied to a BST of height 2 containing strings consisting of single letters a, b, c, d, e, f, g inside its nodes (a BST respecting lexicographic ordering). Write down the string constituting the outcome of its operation.

6. Haskell function show (show:: (BST a)) -> String) is defined by a Haskell deriving Show clause and it operates as follows. instance Show a => Show (BST a) where show Nil = "Nil" show (Node x Nil Nil) = "Node " ++ (show x) ++" Nil Nil" show (Node x Nil right) = "Node " ++ (show x) ++" Nil (" ++ (show right) ++ ")" show (Node x left Nil) - "Node " ++ (show x) ++" (" ++ (show left) ++ ") Nil" show (Node x left right) = "Node " ++ (show x) ++ (" ++ (show left) ++ ") (" ++ (show right) ++ ")" (i) Explain the recursion of function show in general BST terms. (ii) Assume that function show is applied to a BST of height 2 containing strings consisting of single letters a, b, c, d, e, f, g inside its nodes (a BST respecting lexicographic ordering). Write down the string constituting the outcome of its operation.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

C PROGRAM Reverse + Random Formula In the code editor, there's already an initial code that contains the function declaration of the function, computeReverseNumber(int n) and an empty main() function. For this problem, you are task to implement the computeReverseNumber function. This function will take in an integer n as its parameter. This will get the reverse of the passed integer and will then compute and return the value: result = (original_number + reverse_of_the_number) / 3 In the main() function, ask the user to input the value of n, call the function computeReverseNumber and pass the inputted value of n, and print the result in the main() with two (2) decimal places. SAMPLE: Input n: 20 Output: 7.33 Input n: 123 Output: 148.00
Write the reccurence relation for the following function (in C-style code) void T(n){ if(n>1){ int j; for(j = n; j>1; j = j/2); T(n/2); T(n/2); } }
Modify the given code to accept float instead of int as a coefficient in C LANGUAGE: // Node structure containing power and coefficient of// variablestruct Node {int coeff;int pow;struct Node* next;}; // Function to create new nodevoid create_node(int x, int y, struct Node** temp){struct Node *r, *z;z = *temp;if (z == NULL) {r = (struct Node*)malloc(sizeof(struct Node));r->coeff = x;r->pow = y;*temp = r;r->next = (struct Node*)malloc(sizeof(struct Node));r = r->next;r->next = NULL;}else {r->coeff = x;r->pow = y;r->next = (struct Node*)malloc(sizeof(struct Node));r = r->next;r->next = NULL;}} // Function Adding two polynomial numbersvoid polyadd(struct Node* poly1, struct Node* poly2,struct Node* poly){while (poly1->next && poly2->next) {// If power of 1st polynomial is greater then 2nd,// then store 1st as it is and move its pointerif (poly1->pow > poly2->pow) {poly->pow = poly1->pow;poly->coeff = poly1->coeff;poly1 =…
Weighted Job Scheduling in C language only please Problem statement: You are given a list of jobs where each job has a start time, finish time, and the profit associated with that job, find the maximum profit subset of non-overlapping jobs. Problem description: The problem wants you to find the maximum profit that you can make after performing a certain number of jobs such that each job has a certain condition that you can start a job only if the start time of the current job is greater than the finish time of the previous job. You are required to develop some algorithm such that the job start time and the finish time does not coincide with other jobs. Output: (Attached photo)
PROGRAMMING LANGUAGE: C++ // vectors: overloading operators example#include <iostream>using namespace std;class counter{private:int count;public:counter():count(0){}counter(int c):count(c) {} int get_count(){return count;} counter operator++ (int){return counter(count++); } counter operator-- (int){return counter(count--);}};int main(){counter c1, c2, c3;c1++;c2--;cout<<'\n'<<c1.get_count();cout<<'\n'<<c2.get_count();cout<<endl;c3 = c1++;cout<<'\n'<<c1.get_count();cout<<'\n'<<c3.get_count();getch();return 0;} Go through the above code and write the output of the given code segment. counter c1(5), c2(10), c3;c3=c1++;c2=--c3;;cout<<”\n”<<c1.get_count();cout<<”\n”<<c2.get_count();cout<<”\n”<<c3.get_count();
Instructions: In Basic C Language In the code editor, you are provided with a main function that asks the user for an integer input and passes this value to a function called, getFactorial() The getFactorial() function has the following description: Return type - int Name - getFactorial Parameters - one integer Description - returns the factorial of the passed integer Your implementation should be RECURSIVE and you should not use any loops Input #include<stdio.h> int getFactorial(int); int main(void) { int n; printf("Enter n: "); scanf("%d", &n); printf("Factorial of %d is %d", n, getFactorial(n)); return 0;} int getFactorial(int n) { // TODO: Implement this recursive function} Output should be: Enter n: 3 Factorial of 3 is 6
Word Count Problem Consider that you have been hired to design in C++ the program that will count the number of words in a MS document. Use the pre-defined member function of the class string to design this program. For simplicity, the user should enter a sentence using the keyboard, read it using the getline function, and then respond back to the user with how many words are there in that sentence. Document Microsoft Word non-commercial use Home Insert Page Layout References Mailings Review View 出,而, E事 , Arial 11 BI U. x, x' || Quick Change Editing Styles- Styles Paste S . A. Aa A A Clipboard - Font Paragraph Styles 9. 10 !! 12 11'14.115.1 16'A Data Scientist typical Job Requirements: Find, clean, and organize data for companies. Data scientists will need to be able to analyze large amounts of complex raw and processed information lo find pattems that will benefit an organization and help drive strategic business decisions. Page: 1 of 1 Words: 43 V English (Canada) %06 O
This is C++ Virtual Functions Please use comment lines to show what each line will do and how. #include<iostream> class Base { public: virtual void show() { cout<< “In Base n”;} }; class Derived: public Base { public: void show() { cout<< “In Derived n”;} }; int main(void) { Base *bp, b; Derived d; bp = &d; bp->show(); bp = &b; bp->show(); return 0; }
C++ ProgrammingActivity: Deque Linked List Explain the flow of the main code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS int main(int argc, char** argv) { DLLDeque* deque = new DLLDeque(); int test; cin >> test; //Declarations int tempnum; int num; int sum; int count; bool addfirst = false; bool addlast = false; bool remfirst = false; bool remlast = false; switch (test) { case 0: //Implementation do{ cin >> num; if(num == 0){ break; } //Reset tempnum = num; count = 0; sum = 0; addfirst = false; addlast = false; remfirst = false; remlast =…
C++ Programming: Write a program that implements delimiter matching. Assume that the language only accepts the following delimiters: single and double quote.
Write a statement that calls the recursive function BackwardsAlphabet() with parameter startingLetter. #include <iostream>using namespace std; void BackwardsAlphabet(char currLetter){if (currLetter == 'a') {cout << currLetter << endl;}else{cout << currLetter << " ";BackwardsAlphabet(currLetter - 1);}} int main() {char startingLetter; startingLetter = 'z'; /* Your solution goes here */ return 0;} Please help me with this problem using c++.
In c++, write a function Circle::intersect(Circle c) where class is defined below, for the funtion it returns bool values, true if two circle outline intersect each other and false if not. Circle::intersect(Circle c) { // example double X = x - c.getX(); double Y = y - c.getY(); double rad = radius + c.getRadius(); } class Circle { private: double x; double y; double radius; public: bool intersect(Circle c); }