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.

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

Consider the following C++ code segment: int d = 20; int f(int b) { static int c = 0; c *= b; return c; } int main() { int a; cin >> a; cout << f(a) * d << endl; }For each variable a, b, c, d: identify all type bindings and storage bindings for each binding, determine when the binding occurs identify the scope and lifetime
I already have the coding in C programming. But I think, function to calculate average waiting time doesn't working. And this coding doesn't work to give the Platinum customer priority. I hope you can give me new coding or fix this coding thank you. #include <stdio.h>#include <conio.h>#include <stdlib.h>#include <string.h> struct Queue // circular queue struct{int size;int front;int rear;int *time_arr;}; int isEmpty(struct Queue *q) // function to check is queue is empty{if (q->rear == q->front){return 1;}return 0;} void enqueue(struct Queue *q, int time) // funntion to enqueue elements into the queue{ q->rear = (q->rear + 1) % q->size;q->time_arr[q->rear] = time;} int dequeue(struct Queue *q) // funciton to dequeue elements from queue{int a = -1; q->front = (q->front + 1) % q->size;a = q->time_arr[q->front];} int main(){// creating queue instances for gold and platinum customersstruct Queue gold_customer;struct Queue…
def optimize_tail_calls(original_scheme_eval): """Return a properly tail recursive version of an eval function.""" def optimized_eval(expr, env, tail=False): """Evaluate Scheme expression EXPR in Frame ENV. If TAIL, return an Unevaluated containing an expression for further evaluation. """ if tail and not scheme_symbolp(expr) and not self_evaluating(expr): return Unevaluated(expr, env) result = Unevaluated(expr, env) # fill in code code here while isinstance(result, Unevaluated): #code here return optimized_eval scheme_eval = optimize_tail_calls(scheme_eval)
Write a program to code text editor. Note: code in c++ The goal of this program is to implementing and using stacks and linked structures. You should also continue to use object-oriented design.For this program, you will implement a text editor. Your editor will display a string of characters and a cursor. Your program will allow the user to move the cursor and modify the text using the following five operations: left - move the cursor to the left one character or do nothing if at the end of the line right - move the cursor to the right one character or do nothing if at the end of the line rdelete n - delete n characters to the right of the cursor ldelete n - delete n characters to the left of the cursor insert c - insert the character c just before the cursor A sample run of your program should look as follows:^insert SS^insert ASA^insert MSAM^insert MSAMM^insert YSAMMY^leftSAMM^YleftSAM^MYrdelete 2SAM^insert ISAMI^rightSAMI^leftSAM^Ildelete 3^IYour program should implement a…
Modify the function joinLine so that it right align the line to lengthlineLen by adding the appropriate number of space at the beginning ofthe line. (in Haskell) code: joinLine :: Line -> String joinLine [] = [] joinLine (w:ws) = w ++ " " ++ (joinLine ws)
In C programming!! Function prototype and implementation for the calculateDivisors function that takes in an integer parameter, calculates the sum of its divisors, and returns that sum (as an integer value) A structure that represents what is represented on each line of output, e.g., o Linenumbero Sumofthedivisorsforthatlinenumbero Characterarraycontaining“Perfect”,“Deficient”,or“Abundant” Pointer declared within the main that will be used to point to an area of memory containing a collection of these structs Dynamically allocated memory for the number of structs necessary You will assign values to each struct via the pointer A loop that goes from X to Y, where X and Y are the numbers inputted by the user at the command line argumento Note:becausetheuserisenteringinputhere,youwillneedtocheckforreasonableness: § The value of X must be greater than or equal to 2§ The value of Y must be greater than the value of X§ If either one of the above conditions are not met, you should…
C++ Code, Function below is a member function of Sequence class: template <class T> T& Sequence <T> ::entry(int pos) { if (pos < 0 || pos >= size) { cout << "Invalid, please check!\n"; T x; return x; } NodeRecord* current = head; for (int a = 0; a < pos; a++) { current = current->next; } return current->value; }// END entry For the function above, a. Draw the code diagrams with labels for statements and branches. b. Provide test cases for statement, branch, and path coverages (properly identifying all the test cases with correct labels and the respective function).
Please answer in C++ Define a structure called Date with month, day and year as its only data members, Time with hour and minute as its only members and Event with desc (a c-string for description of maximum size 80), date (of type Date) and time (of type Time). Write a readEvents() function that will keep asking the user if he or she wants to add a new event. As long as the user answers with a 'y' or 'Y', allocate memory dynamically for an Event structure, storing the pointer returned by new in the array of Event pointers and then read the Event data from the keyboard and store them in the Event just created. Dates should be entered like 5/21/20 and times as 10:15. When finished entering the Events, the function will return the number of Events entered. Write a sort-desc() function to sort the Events by their description by rearranging the pointers (rather than the structures), by passing it the array of pointers and the number of Events created. Use a swapPtrs() function to swap…
Haskell - Using the definition for a Term as: data Term = Var String | Application Term Term | Lambda String Term Construct a Beta-Reduction Haskell function as per the definition below: betaReduce :: Term -> Term -> Term It can assume its first argument is a lambda expression. Note: If the formal parameter of that lambda expression is free in the second argument, it must alpha rename it.
This question should be answered in C++ programming language. Please answer part 2 of this question as part 1 has already been answered through chegg. if GPA in the range of 2.5(inclusive) - 3:B if GPA in the range of 2(inclusive) - 2.5:C Less than 2: D > Print_Std_Info() : This function accepts the id of one student and prints out all the information of that student (all the attributes). Purpose: The purpose of this project is to allow you practice Object Oriented Design, Pointers, File /0, Exception Handling, Functions and Arrays. > Comapre_GPA(): This function compares the GPA of two students and returns the id of the student who has the higher GPA. Problem Objective: The objective of this problem is to create a fully functioning system that handles the records of students at Concordia University. Based on the following narrative, you need to come up with an Object-Oriented design to represent the different entities in the system. Part 2: Faculty Class: Assume the faculty of…
rite a function numPairs that accepts two arguments, a target number and a list of numbers. The function then returns the count of pairs of numbers from the list that sum to the target number. In the first example the answer is 2 because the pairs (0,3) and (1,2) both sum to 3. The pair can be two of the same number, e.g. (2,2) but only if the two 2’s are separate twos in the list.In the last example below, there are three 2’s, so there are three different pairs (2,2) so there are 5 pairs total that sum to 4. Sample usage: >> numPairs( 3, [0,1,2,3] )2
Data Structure Using C++ I need a function like this ::: float postfixEval(string postfix) {int a, b;stack<float> stk;string::iterator it;for(it=postfix.begin(); it!=postfix.end(); it++) {//read elements and perform postfix evaluationif(isOperator(*it) != -1) {a = stk.top();stk.pop();b = stk.top();stk.pop();stk.push(operation(a, b, *it));}else if(isOperand(*it) > 0) {stk.push(checkNumber(*it));}}return stk.top();} to evaluate postfix with more one digit in expression (multi digits) please just this function simple like the above