[Problem 4] Consider a tree Y in which each node has at most 3 descendants, called A node, B node, and C node. There are n nodes in such a tree. Each node in tree X holds an integer value k≥ 1, which we can access with node.value method. Let T(n) denote the time complexity of the following algorithm, which takes tree Y as its input. H(X.root) if (X.root == NIL) then return else H(X.root.A) c = c + X.root.value // assume c is some global variable, initially set to 0. H(X.root.B) H(X.root.C) Determine the asymptotic bound of the time complexity T(n) for the algorithm H and formally prove its correctness to receive points.

[Problem 4] Consider a tree Y in which each node has at most 3 descendants, called A node, B node, and C node. There are n nodes in such a tree. Each node in tree X holds an integer value k≥ 1, which we can access with node.value method. Let T(n) denote the time complexity of the following algorithm, which takes tree Y as its input. H(X.root) if (X.root == NIL) then return else H(X.root.A) c = c + X.root.value // assume c is some global variable, initially set to 0. H(X.root.B) H(X.root.C) Determine the asymptotic bound of the time complexity T(n) for the algorithm H and formally prove its correctness to receive points.

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

A certain recursive algorithm takes an input list of n elements. Divides the list into Vn sub-lists, each with yn elements. Recursively solves each of these yn smaller sub- instances. Then spends an additional 0(n) time to combine the solutions of these sub- instances to obtain the solution of the main instance. As a base case, if the size of the input list is at most a specified positive constant, then the algorithm solves such a small instance directly in 0(1) time. a) Express the recurrence relation that governs T(n), the time complexity of this algorithm. b) Derive the solution to this recurrence relation: T(n) = 0(?). Mention which methods you used to derive your solution.
Let S = (a1a2,...an) be a sequence of integers. Design an algorithm to ﬁnd the subsequence SM = (ai,ai+1,...,aj) of S, with consecutive elements, such that the sum of the numbers in SM is maximum over all subsequences of S. Note that the sum is assumed to be 0 if the subsequence is empty. Your algorithm should run in O(n) time.
For the 8-queens problem, define a heuristic function, design a Best First Search algorithm in which the search process is guided by f(n) = g(n) + h(n), where g(n) is the depth of node n and h(n) is the heuristic function you define, and give the pseudo code description.
Lets say an algorithm has 2 base cases. PsuedoCode: if n == 1 return 0 if n == 2 return 1 return A[n..............n-1]solve the recurrence relation for the above simple recursive algorithm?
I need a code in Python for dijkstra algorithm using lists. that take as an input a directed weighted graph G(V,E) and a source node s, and the output are the shortest baths from seV to every other node. The output must be interactive drawing. like the picture: 11 14 4 10 Choose data not less than 10 thousand And no more than 500 thousand, it is read from a file. Compare results in terms of speed
The intersection of two sets contains the list of elements that are common to both, without repetition. As such, you are required to write an algorithm that finds and returns the intersection of two sets A and B. The sets A and B and the resulting intersection set are all lists. Assume the size of A is n and that of B is m. (a) Write an iterative algorithm that finds the intersection. (b) Prove the correctness of your algorithm; i.e. state its loop invariant and prove it by induc- tion. (c) Analyze the time complexity of your algorithm. (d) Think of a way to enhance the complexity of your algorithm by sorting both lists A and B before calculating their intersection. Write the enhanced version and prove that it has a better time complexity.
python The number of possible binary tree topologies (given all possible heights) with n nodes is the Catalan Number (in closed form) Cn = 1/(n+1)*(2n choose n). Recursively, this can also be written as: question ) Write a function cn_fast(n) that computes the n-th catalan number using the closed form formulation, and Conduct doubling experiments (just n = 1, 2, 4, and 8) to compute runtimes. Plot the result on a log-log plot.
Please do not give solution in image formate thanku. Write a Python code for the following scenario : 1: Use Breadth First Search and Recursive Best First Search and implement the algorithms in Python. The program should be able to dynamically take in start and goal nodes from the user at run time. Compare to interpret the results in terms of the algorithm working, performance & shortest path if obtained relevant to the given problem 2: Print the minimum connections that keep the whole network up and running. For each incremental depth limit, the corresponding node generating sequence should be legibly printed in the result Consider Heuristic Value as : The edge cost is an approximation towards the transmission cost between any pair of nodes. For heuristic design, consider all the possible paths between any arbitrary node n to the goal node. The average of the total transmission cost across all these paths is the heuristic value h(n) Consider the following undirected graph…
Write for the following problem a recursive algorithm whose worst-case timecomplexity is not worse than Θ(n ln n). Given a list of n distinct positiveintegers, partition the list into two sublists, each of size n/2, such that thedifference between the sums of the integers in the two sublists is maximized.You may assume that n is a multiple of 2.
The Longest Subsequence Problem is a well-studied problem in Computer Science, where given a sequence of distinct positive integers, the goal is to output the longest subsequence whose elements appear from smallest to largest, or from largest to smallest. For example, consider the sequence S = [9,7,4,10,6,8,2,1,3,5]. The longest increasing subsequence of S has length three ([4,6,8] or [2,3,5]), and the longest decreasing subsequence of S has length five([9,7,4,2,1] or [9,7,6,2,1]). And if we have the sequence S = [531,339,298,247,246,195,104,73,52,31], then the length of the longest increasing subsequence is 1 and the length of the longest decreasing subsequence is 10. Question: Let S be a sequence with ten distinct integers. Prove by Contradiction that there must exist an increasing subsequence of length 4 (or more) or a decreasing subsequence of length 4 (or more). Hint: for each integer k in the sequence you found in the first part, define the ordered pair (x(k), y(k)), where x(k)…
Suppose a recursive algorithm performs 2 recursive calls. Assume the first recursive call isof size at most 70% the original input size, and the second call is of size at most 25% of theoriginal input size. In addition, the algorithm performs O(n) additional work after makingthese recursive calls. What is the big-Oh run time of this algorithm?
Problem 3. Consider the following recurrence. T(n) = {(n) = 37(n T(n) = 3T(n/2) + n² if n=1 otherwise. (a) Solve this recurrence exactly by the method of substitution. You may assume n is a power of 2. (b) Solve it using the recursion tree method.