Option #1: Applications of Graph Theory Concepts: Computer Science For Option #1, you will explore applications of graph theory concepts in the context of computer science. Complete the following...

1 answer below »

Option #1: Applications of Graph Theory Concepts: Computer Science


For Option #1, you will explore applications of graph theory concepts in the context of computer science. Complete the following tasks:



  1. Research the topic of binary search trees. Write a brief summary of your understanding of this.

  2. Design a simple program, using pseudocode, that performs a binary search.

  3. In your own words, explain how a binary search tree works using graph theory terminology.

  4. Construct a binary search tree for any alphabetically ordered list of five words. Represent it visually as a graph.

  5. Discuss any characteristics you note about the graph you created in part (d). In your discussion, make sure to address the following:

    1. What are the degrees of each vertex?

    2. Is it a complete graph?

    3. Is the graph planar?


    4. 1. Paper must be written in third person.


      2. Include a title page, introduction, body, conclusion, and a reference page.


      3. The introduction should describe or summarize the topic or problem. It might discuss the importance of the topic or how it affects you or society as a whole, or it might discuss or describe the unique terminology associated with the topic.


      4. The body of your paper should answer the questions posed in the problem. Explain how you approached and answered the question or solved the problem, and, for each question, show all steps involved.Be sure this is in paragraph format, not numbered answers like a homework assignment.


      5. Theconclusion should summarize your thoughts about what you have determined from the data and your analysis, often with a broader personal or societal perspective in mind.Nothing new should be introduced in the conclusion that was not previously discussed in the body paragraphs.


      6. Include any tables of data or calculations, calculated values, and/or graphs associated with this problem in the body of your assignment.


      7. Document formatting, citations, and style should conform to the CSU-Global Library’sCSU-Global Guide to Writing & APA: Introduction(Links to an external site.). A short summary containing much that you need to know about paper formatting, citations, and references is contained in theNew Sample APA Paper(Links to an external site.). In addition, information in theCSU-Global Library(Links to an external site.)under the Writing Center/APA Resources tab has many helpful areas (Writing Center, Writing Tips, Template & Examples/Papers & Essays, and others).





Answered Same DayAug 18, 2021

Answer To: Option #1: Applications of Graph Theory Concepts: Computer Science For Option #1, you will explore...

Sonu answered on Aug 20 2021
135 Votes
1. Binary Search Tree
In computer science, BST or Binary Search tree are also known as sorted order or ordered binary tree. This binary sear
ch tree is a node based binary tree data structure. A data structure that stored data in memory in ordered. This data structure having the following properties,
1. The left sub-tree of node contains lesser key than the node key.
2. The right sub-tree of node contains greater key than the node key.
3. The left and right sub-tree each must also be a Binary search tree (BST)
Binary Search tree is a binary tree in which node having value greater than value in its left sub-tree of a tree and smaller than all value in its right sub-tree. The rank of the Binary Search tree is zero.
Let’s take an example of Binary Search tree 13, 3, 4, 12, 14, 10, 5, 1, 8, 2, 7, 9, 11, 6, 18.

2. Design Binary Search tree
3. Pseudo code
        
        function findRandomBinarySearchTree(bstTree, minimum, maximum){
            var nValue = (maximum-minimim)/4;
            
            bstTree.setRoot(new BinaryTreeNode(randomInt(Math.floor(minimum+nValue)))).Math.ceil(maximum-nValue))));
            randomBSTTreeRect(bstTree.getRoor(), 1, minimum, maximum);
        }
        
        function randomBSTTreeRect(tNode, tLevel, minimum, maximum ){
            if(minimum>= tNode.getValue()-1 || tNode.getValue()+1>=maximum){
                return;
            }
        }
        
        var nextIteration;
        if(iterationLevel<=3 && Math.random()<0.33{
            nextIteration =...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here