2) Binary Search Tree - Tracing The following code recurses over a Binary Search Tree (BST) and prints to standard out occasionally. Please trace through the code for the given BST and write what would be printed out after the code terminates. Do not write the return value of the method. Just write each print statement's output on a new line. Ensure that the print statements' outputs are correct and in the correct order. The method is run on the root of the BST. public class Node { public T data; public Node left; public Node right; } public int mystery Rec (Node current) { if (current == null) { return 0; } } 5 int left mystery Rec (current.left); int right = mysteryRec (current.right); int tmp = left + current.data + right; if (tmp> 15) { Input BST: System.out.println(current.data); } return tmp; 10 20 30 50 70 Output: llun

2) Binary Search Tree - Tracing The following code recurses over a Binary Search Tree (BST) and prints to standard out occasionally. Please trace through the code for the given BST and write what would be printed out after the code terminates. Do not write the return value of the method. Just write each print statement's output on a new line. Ensure that the print statements' outputs are correct and in the correct order. The method is run on the root of the BST. public class Node { public T data; public Node left; public Node right; } public int mystery Rec (Node current) { if (current == null) { return 0; } } 5 int left mystery Rec (current.left); int right = mysteryRec (current.right); int tmp = left + current.data + right; if (tmp> 15) { Input BST: System.out.println(current.data); } return tmp; 10 20 30 50 70 Output: llun

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

Allow student to insert one arbitrary string. Save the letters of the string into a list. Design and perform the following tasks and display your results: • Summarizing letters in a string. Write a function that receives a string and returns a list of tuples containing the unique letters and their frequencies in the string. Test your function and display each letter with its frequency. Your function should ignore case sensitivity (that is, 'a' and 'A' are the same) and ignore spaces and punctuation. When done, write a statement that says whether the string has all the letters of the alphabet. • Present descriptive statistics and graphs about the string data. • Sorting letters in different order and removing duplicates • Write a code that produces anagrams of a given string. An anagram of a string is another string formed by rearranging the letters in the first. program must accept inputs from a user, performs an operation using a userdefined function which will accept parameters and…
The for construction is a loops that iteratively processes a given list. Consequently, it works so long even though there are objects to process. What about this claim: true or false?
CCC '13 J1 - Next in line Canadian Computing Competition: 2013 Stage 1, Junior #1 You know a family with three children. Their ages form an arithmetic sequence: the difference in ages between the middle child and youngest child is the same as the difference in ages between the oldest child and the middle child. For example, their ages could be 5, 10 and 15, since both adjacent pairs have a difference of 5 years. Given the ages of the youngest and middle children, what is the age of the oldest child? Input Specification The input consists of two integers, each on a separate line. The first line is the age Y of the youngest child (0
def findOccurrences(s, ch): lst = [] for i in range(0, len(s)): if a==s[i]: lst.append(i) return lst Use the code above instead of enumerate in the code posted below. n=int(input("Number of rounds of Hangman to be played:")) for i in range(0,n): word = input("welcome!") guesses = '' turns = int(input("Enter the number of failed attempts allowed:")) def hangman(word): secrete_word = "-" * len(word) print(" the secrete word " + secrete_word) user_input = input("Guess a letter: ") if user_input in word: occurences = findOccurrences(word, user_input) for index in occurences: secrete_word = secrete_word[:index] + user_input + secrete_word[index + 1:] print(secrete_word) else: user_input = input("Sorry that letter was not found, please try again: ") def findOccurrences(s, ch): return [i for i, letter in enumerate(s) if letter == ch] *** enumerate not discussed in…
A spell checker in a word processing program makes suggestions when it finds a word not in the dictionary. To determine what words to suggest, it tries to find similar words. One measure of word similarity is the Levenshtein distance, which measures the number of substitutions, additions, or deletions that are required to change one word into another. For example, the words spit and spot are a distance of 1 apart; changing spit to spot requires one substitution (i for o). Likewise, spit is distance 1 from pit since the change requires one deletion (the s). The word spite is also distance 1 from spit since it requires one addition (the e). The word soot is distance 2 from spit since two substitutions would be required. a. Create a graph using words as vertices, and edges connecting words with a Levenshtein distance of 1. Use the misspelled word “moke” as the center, and try to find at least 10 connected dictionary words. How might a spell checker use this graph? b. Improve the method…
When working with enumeration types, such as the arithmetic operators and the stream operators, is it possible to rapidly access operators that are often used, such as the arithmetic operators and the stream operators? Is it conceivable, for instance, to overload these operators in order to arrive at a result that is satisfactory? What are the arguments for and against doing so?
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. anglers have recently gotten back from a fishing excursion. The I-th angler has gotten a fish of weight man-made intelligence. Anglers will flaunt the fish they got to one another. To do as such, they initially pick a request where they show their fish (every angler shows his fish precisely once, in this way, officially, the request for showing fish is a stage of integers from 1 to n). Then, at that point, they show the fish they discovered by the picked request. At the point when an angler shows his fish, he may either become glad, become dismal, or stay content. Assume an angler shows a fish of weight x, and the most extreme load of a formerly shown fish is y (y=0 if that angler is quick to show his fish). Then, at that point: in the event that x≥2y, the angler becomes cheerful; in the event that 2x≤y, the angler becomes miserable; in the event that none of these two…
Write c++ code Create a BST where each node stores the rollNumber and marks of a student. Your task is toprovide the implementation of following methods.constructorinsertRecord() functionupdateRecord() functioncountOfPassedStudents()showData() functioninside main() function, create an object of BST class.Insert the following data and create the BST according to the marks.● 19L-1941, 71 should be the root node● 19L-1942, 62● 19L-1943, 67● 19L-1944, 54● 19L-1945, 58● 19L-1946, 45● 19L-1947, 29● 19L-1948, 76● 19L-1949, 81● 19L-1950, 92Update the data of following record● Marks of 19L-1944 are 54. Update the marks to 47● Marks of 19L-1949 are 81. Update the marks to 85Call the countOfPassedStudents(). You can either display the count in the same function orreturn the value to main function.Call the showData() function to display all the records of BST in preorder traversal.Note: It is not mandatory to create a template class
Use the right loop for the right assignment, using all the follow- ing loops: for, while without hasNext(), while with hasNext() and do-while. So I cannot use array. it has to be done in java.
Artificial Intelligence- Java program Write code that accomplishes the following tasks. Consider two bags that can hold strings. One bag is named letters and contain seeral one-letter strings. The other bag is empty and is namedvowels. One at a time removed a string from letters. If the string contain a vowel place it into bag vowels, otherwise, discard the string. After you have checked all of the strings in letters, report the number of vowels and the number of times each voewl appears in the bag.
Complete the drawTriangle() function in script.js that draws a triangle with asterisks (*) based on the triangleSize parameter. Ex: drawTriangle(4) outputs to the console a triangle with triangleSize 4, so the longest side (4 asterisks) appears on the bottom line: * ** *** **** Hint: Use a loop inside a loop to complete drawTriangle(). The outer loop is responsible for outputting each asterisk line, and the inner loop is responsible for building the asterisk line with the appropriate length by concatenating asterisks to a single string. To test the JavaScript in your web browser, call drawTriangle() from the JavaScript console.
Problem Y: Implement the reader writer problem using pthreads and semaphores. You should allow multiple readers to read at the same time and only one single writer to write to the data set. You are required to use the following: 1. A semaphore rw_muter initialized to 1. 2. A semaphore muter initialized to 1. 3. An integer reader_count initialized to 0.