Explain the binary search tree search algorithm

Assignment Help Data Structure & Algorithms
Reference no: EM131044027

Directions: Complete the following exercises from your textbook.

1. What is a tree?  Is a PERT diagram always a tree?  Explain.

2. For each of the following graphs, determine if each is a tree and explain your answer.

a.

919_Graph.png

b.

2216_Graph1.png

3. What is a spanning tree?  Give an example.

4. Explain the breadth-first search spanning tree algorithm, and then apply it to the following graph:

1977_Spanning Tree.png

5. Use Prim's algorithm to find the minimal spanning tree for the graph in the previous problem.

6. How do you know if a graph is a binary tree?

7. Explain the preorder traversal algorithm.

8. Explain the binary search tree search algorithm.

9. Evaluate the following:

a. C(7, 2)

b. C(12, 7)

c. (x + y)7

d. the coefficient of x7y2 in the expansion of (2x - y)9

10. How many words must be chosen in order to assure that at least two begin with the same letter?

11. How many different 4-digit numbers can be formed using 5, 6, 7, and 8 without repetition?

12. How many distributions of 14 different books are possible if Carlos is to receive 5 books, Jamie 4 books, and Robert 2 books?

13. Define probability.

14. Determine the probability of the following:

a. If three dice are rolled, that all will be odd.

b. If two coins are flipped, that they both will land the same.

15. In a particular dormitory, there are 350 college freshmen.  Of these, 312 are taking an English course and 108 are taking a mathematics course.  If 95 of these freshman are taking courses in both English and mathematics, how many are taking neither?

16. In the following sequences, determine s5 if s0, s1, ...sn, ... is a sequence satisfying the given recurrence relation and initial condition.

a. sn= -sn-1 - n2 for n >= 1, s0 = 3

s1= -s0 - 1= -4

s2= -s1 -4 = 0

s3 = -s2 -9 = - 9

s4 = -s3- 16 = -17

s5 = -s4 -25 = - 18

b. sn = 5sn-1 - 3sn-2 for n >= 2, s0 = -1, s1 = -2

s2 = 5s1 - 3s0 = -10 +3 = -7

s3 = 5s2 - 3s1 = -29

s4= 5s3 - 3s2 = -145 + 21 = -124

s5 = 5s4 - 3s3 = -533

17. An investor begins to save in 1990 with $500.  Each year, the savings increases 10% over the year before, and then an investor contributes another $100.  Write a recurrence relation and initial conditions on the sn, the amount of savings n years after 1990.  Use this relation to determine the amount saved by 1994.

18. Explain the method of iteration.

19. Use the method of iteration to find a formula expressing sn as a function of n for the given recurrence relation:

sn= -sn-1 + 10, s0 = -4

S(0) = -4

S(1) = -S(0) + 10 = 4 + 10 = 14

S(2) = -S(1) + 10 = -14 + 10 = -4 = S(0)

S(3) = -S(2) + 10 = 4 + 10 = 14 = S(1)

S(n) = { -4 if n is even.

          { 14 if n is odd.

20. What are finite state machines?  Is a computer a finite state machine?  Explain.

21. Draw a transition diagram for the finite state machine with the given state table:

 

A

B

C

0

B

C

A

1

A

C

B

22. Draw a transition diagram for the finite state machine with the given state table below, with A being both the initial and accepting state.

 

A

B

x

B

A

y

A

A

z

B

B

23. Give the state table for the finite state machine with the given transition diagram:

1750_Transition Diagram.png

24. In what state would the machine in the previous question end if it started in the initial state and was given the input string, abaabb?

25. Draw the transition diagram for the finite state machine with output whose state and output tables is:

 

A

B

A

B

0

A

A

z

X

1

B

B

z

Y

Reference no: EM131044027

Questions Cloud

Ameru community in east africa : What was the name given to the council of elders of the Ameru Community in East Africa?
Find maxima and minima of the function : what is the graph of y=x+(1/x). i can't sketch the graph.because if i use x=0 then y=infinity. and i want to find maxima and minima of the function. here the maxima is less than in minima. but don't understand why this happens? please show me the ..
Etch-a-sketch ethics : Is it possible, as Mr. Killgallon claims, that the Ohio Art Company had no knowledge of labour problems at Kin Ki? Do you think company executives had any knowledge of the working conditions?
Analyze the types of risks that must be managed : Compare options, forwards, futures, and swaps for managing foreign exchange risk exposure. Form an argument for what you believe is the best method for a non-financial firm in managing this exchange rate risk.
Explain the binary search tree search algorithm : How do you know if a graph is a binary tree? Explain the preorder traversal algorithm. Explain the binary search tree search algorithm.
Explain the sources of organizational conflict : Identify and explain the sources of organizational conflict and show how conflict can be functional or dysfunctional when an organizational is going through a change
Does nasa have a learning organization culture : How would you have drafted the email if you were in Rodney Rocha's situation? Is email always the best way to communicate? When is it a good medium and when does it present limitations that introduce risk to the organization?
Explain the different methods of financing healthcare : Present your analysis with supporting information as a 4-page report in a Word document formatted in APA style.Name your document as: LastnameFirstInitial_W1_A3.doc.
Examine different frameworks : Examine different frameworks, models, or roadmaps used to pursue improvement projects. Generic improvement model, Lean, Six Sigma, Business Process Management (BPM), Toyota Production System (TPS), Theory of Constraints (TOC), Rummler-Brache, Proce..

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Creating a database with a table

Design a database with a table called tblStudents and use Visual Studio.NET 2005 to create an ASP.NET project with four aspx forms. Use Master Pages to show a school name.

  Creating a database design in visio

Designing Databases with Visio Professional: A Tutorial," to help you complete Section 1: Visio Database Design. (Note: This tutorial focuses on the use of Microsoft Visio.

  Write the algorithm and find out the time complexity

Write the algorithm and find out the time complexity for the algorithm (in terms of n and m). Note that given two locations (x1, y1) and (x2, y2), distance between them can be calculated by the subsequent formula: ? (x2 - x1)2 + (y2 - y1)2.

  Write a report based on a management issue or potential

write a report based on a management issue or potential issue which they identify in the nominated case study on

  Prepare a context diagram for the new system

Susan Park has completed a preliminary investigation and performed the fact-finding tasks. Now, she will use the results to develop a logical model of the proposed information system. Prepare a context diagram for the new system

  Design and implement an efficient algorithm of an intergers

Design and implement an efficient algorithm that gives a set of S of an intergers and another x, determines whether or not there exist two elements in S whose sum is exactly x

  Research on algorithms flowcharts and pseudocodes

Using the Internet, further research on the following: Algorithms, Flowcharts, Pseudocodes

  How to find local minimum of t using only o(log n) to node t

A node v of T is a local minimum if the label x_v is less than the label x_w for all nodes w that are joined to v by an edge.

  Describe an algorithm that takes as input a list

Describe an algorithm that takes as input a list of n distinct integers and finds the location of the largest even integer in the list or returns 0 if there are no even integers in the list.

  Create an algorithm to describe how to balance a checkbook

Create an algorithm to describe how to balance a checkbook for a company that has more than 100transactions.

  Design a recursive algorithm to implement

Design a recursive algorithm to implement this specification. That is, the body of FindLast should contain a recursive call FindLast(A,..,..).

  Explain binary tree by induction

Binary tree is full if all of its vertices have either zero or two children. Let Bn denote number of full binary trees with n vertices. Illustrate by induction (substitution) that Bn is 2 (n) .

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd