Algorithms Questions and Answers August 17, 2021

FOR THE BAR SHOWN, THE BAR is subjected to concentrated Loods B and C and Distributed load From C to D lok B 1628 20 5F 4 4 a) Find The Variation 2 NCK) Along The long in of the ban and graph N(x) vs. x b) Determine Displacements 2 The ban B and D c) Find mex. AXIAL STrain and latrul Strain c If D0.20 5.5 N(x) dx A(x) E() A.24 E Sooo Ksi

A common way of thinking about linked list Node objects is that each Node contains a head value and a pointer containing another list. Write a function to calculate the length of a linked list using this approach. Your method should accept a pointer to a Node object and recurse through the list until you reach the end. The function should then

Design the Ship class Include the following items: Name (string) Ship ID (string) Credit (in minutes) (integer) Ship pointer (to point to next ship in the queue) Accessors for each variable Mutators for each variable A default constructor that initializes all variables to zero or null An overloaded constructor that assigns the values passed in to

Create a class that manages a dice matching game. There are 3 dice randomly being rolled. Create a default constructor that randomly assigns values to the dice(16), and a deconstructor that prints when the object is being destroyed. Create functions that display the dice, and allows the user to reroll one of the dice. Additionally check to see how

Using the concept of pointers in Object Oriented Programming, write a C program to swap two integers values.

Study C pointers and dynamic memory. Create the Student class in C. Each student should have a level (initially is 0). Create the main method, create an object of the Student class in dynamic memory. Use cout to print your object. Create a function rankstudent that receives a pointer to a Student object and increase the rank of the Student object

Build a Java class called Activation Record. Fields within Activation Record include parameterList returnAddress prevActivation Record localVariablelist returnValue Youll need this class Variable which has three fields name, type, and value. Here are the definitions of the fields in Activation Record parameterList List of variable objects

#include using namespace std; int main() { /* Declare two integer variables Value1 and Value2 initialize Value1 to 25. Declare the variable Ptr1 to be a pointer to an object type int. Assign the address of variable Value1 to pointer variable Ptr1. Print the value of the object pointed to by Ptr1. Assign the value of the object pointed to by Ptr1

Write a function named getAvailableBooks that accepts an array of LibraryBook object pointers and its size. It will go through the array and return the vector of pointers only to the LibraryBook objects that has the Available status. Show how this function is being called and print out what is being returned.

Create a base class called Person with a virtual function called display(). Create two derived classes called Student and Teacher. Override the display() function in both derived classes to print "I am a student" and "I am a teacher", respectively. In the main() function, create a pointer of type Person and assign it to an object of Student. Call

Can you convert a base-class object into a derived-class object? A derived-class object into a base-class object? A base-class pointer into a derived-class pointer? A derived-class pointer into a base-class pointer? If so, give examples. If not, explain why not.

1. Create a function named void testStruct02C() 2. Declare a FootballTeam struct pointer 3. Using cin and getline(), initialize the FootballTeam fields using the pointer Can use a statement like Football Team fb01 Buffalo Bills, New York Jets, 33, 21) 4 Print out the Football Team struct using the pointer fb01 5 Fb01 returnStructPointer() 6 Print

(n) For each of the following, write a single C statement that performs the identified task. Assume that variables salary and increase have been defined as type double, and that salary has been initialised as 4500.00 and increase as 475.00. (i) Declare two variables fPtrl and fPtr2 to be pointers to objects of type double. (ii) Let the pointer

(5) Write statements that performs the following tasks. (20 points) (20 points) (a) Declare the variable fooPtr to be a pointer to an object of type int and initialize the pointer to nullptr. (b) Declare a variable fool of type int initialized to 8. Further, assign the address of fool to fooPtr. (c) Declare a variable foo2 of type int, initialized

Write a program that uses an int pointer called hand to manipulate 3 variables book, pencil, paper. You will use the hand pointer to change the value of book, pencil, or paper based on USER INPUT. The value stored in each variable represents a location GLOBAL VARIABLES const int FLOOR 1, CHAIR 2, DESK 3 For example, if hand is pointing to

A. B. C. D. Write a statement to declare a pointer variable of type Debit Card. Name it dollars Write a statement to dynamically instantiate the DebitCard class and assign the address of the object to pointer dollars. The Debit Card object will have an initial balance of 2,200 and card number 044567. Refer to the pointer dollars and its pointee.

1. Student ** createStudentList(char ** names, int size); - function creates an array of pointers to Student objects dynamically. It allocates Student objects and set their name as the passed in names and gpa as 0. size is the number of names available. You can allocate 2*size as many pointers to Student objects just in case you need to add more

1. Declare a pointer to an Order object namely p_order_list and properly initialize it at declaration 2. Dynamically allocate an array of 1024 Order objects and assign it to p_order_list. NOTE: this is a dynamic array of Order objects, not an array of pointers to Order objects 3. Write a loop to go thru the entire the array and count the number of

write a single statement that performs the specified task. Assume that long variables valuel and value2 have been declared and valuel has been initialized to 200000. A. Declare the variable longPtr to be a pointer to an object of type long. B. Assign the address of variable valuel to pointer variable longPtr. C. Display the value of the object

Declare a Class containing members that are structures, pointers and variables. The class contains constructor that initializes all members, destructor that frees all pointers and a copy constructor that defines how one object of the same class is copied onto another object of the same class.

An array of pointers that each point to a typedef object. Its use a double pointer to traverse the nodes that are pointed to in the array. show the correct syntax. Also the nodes have a parent object because they represent a tree, how to access the node object correctly using the double pointer??

For each of the following, write a single statement that performs the specified task. Assume that floating-point variables number1 and number2 have been declared and that number1 has been initialized to 7.3. Declare the variable fPtr to be a pointer to an object of type double and initialize the pointer to nullptr. Assign the address of variable

1.Write a program to access members of a STUDENT class using pointer to object members

What is this pointer in C++ Object Oriented programming with complete explanation. Also explain me about this pointer using Code.

Shared and weak pointers are one way to solve memory leaks. When a shared pointer points at something, it adds one to a refcount. When the pointer stops pointing at it, the refcount goes back down. When the refcount hits zero, the object gets deleted because nobody is holding on anymore. A weak pointer can also point at the same object, but it

Write a function named searchEvents that accepts a vector of Event object pointers and a search month number. It will go through the list and return the list of Event object pointers with the same search month. Please note that this function will return the list of found objects through the return value or the reference parameter (and not printing

Create the class BusStop on the route at the defined position. There is a number of passengers increasing in time awaiting for the bus at the bus stop. Create the class Bus. The bus has the capacity and number of passengers. When the bus stops at the bus stop: - random number of passengers goes out (no more than passengers in the bus) - available

Write C++ code to reverse a singly-linked list L using only a constant amount of additional storage and no recursion. Assume the list object has a head pointer _head and consists of Node objects; a Node object has a pointer Node* _next

Assume given the following class Date with the definitions of its constructors and member functions class Date ( public c. Date() Date(int mth, int dy, int yr) void Print() private int month, day, year default date is 112000 output the month, the day, and the year mmddyyyy a. Define two pointer variables ptr1 and ptr2 to hold the address of an

a) Define class Date that has the following data members, int month, day, year. b) Each vehicle is assigned a unique id. Define class Car with data member, int unique_id c) Derive NewCar class from Car class with the following additional data members, int model_year color of the car as a standard library string. int no_of_doors double price d)

write the call statement using correct syntax (2 points each). include using namespace std class S public void one () cout thats right int main() sa s b b new S s c4 function calls go here return 0 1. Call function one using object a. 2. Call function one using b. 3. Call function one using the second element of c without using the

1 static myClass X 2 int main() 3 ( 4 5 6 7 9 10 11 12 13. 14 Consider the following class instances in a C program myClass Y new myClass () foo () delete Y return 0 void foo () myClass Z X new myClass() a) (5pt) What is the storage allocation (staticstackheap) for the following objects object A the pointer X object B the pointer Y object C

In Java and C++ a reference or pointer to a child class object may be assigned to a reference variable or pointer (respectively) of the parent class type. Describe the differences in how the subclass object may be used via such references.

1) create a const DriverRental Car object with any prober values and name it drc 2) declare a pointer of type Rental Car and call it rcptr 3) create a DriverRental Car object dynamically with any prober values and make the pointer rcptr points to it. 4) call printData using rcptr, would this call the function in Rental Car class or in Driver

The idea of this C++ program is to create an array of pointers to objects of the person class. The program can sort a group of person objects based on the alphabetical order of their names. Requirements: Create class called person with the following property and methods: name salary void setPerson() //input name and salary string getName() float

struct houseinfo ( double price string houseStyle int numBathrooms 3. Write the syntax to perform the following (10 pts) a. Create two pointers to the above structure b. Create a dynamic object of the above structure using a pointer from a) c. Set the objects to values 430000.99 for price, and 6 for bathroom d. Use the second pointer in a) to

#include #include //Struct for a polynomial term (double linked list object) typedef struct Polynomial t_Polynomial; typedef struct Term { // coefficient of the polynomial term associated with the object int coef; // power of the polynomial term associated with the object int power; // pointer to the next object (to facilitate a doubly

1. Type in program 2.32, studentPtr.cpp and run the program. Identify how pointer of object is implemented in the program. Change main () program to the second example. The second main () program create object using new operator and destroy the object using delete. Identify the difference of the methods used in the first main () and the second

Review a Final Accounting Standards Update Accounting Standards Update No. 2016-13, Financial Instruments- Credit Losses, was issued in June 2016. a. Read the Summary section of this standard and describe why the standard was issued. What is the issue it is intended to resolve? b. Look for guidance on when the standard became effective. That is,

6. Consider this unrooted tree A B C D E a) (4pt) (Ignore the colored dots for this part.) How many unrooted and rooted trees are possible for this many operational taxonomic units (OTUS)

3. (a) Considering the dictionary order, draw a binary search tree from the following entries John, Leilani, Delicia, Florencio, Arthur, Jane, Johnson. (b) Draw an ordered rooted tree (T) from the following expression (((x y)2) ((x4)3))) (x 42). (c) Find the prefix expression from the tree T.

(a) (20 pt) What is the ordered rooted tree that represents the expression (ab)(cd)(e(fg)) (Built a binary tree from bottom up please.) (b) (20 pt) What is the prefix form for (ab)(cd)(e(fg))

For the following given ordered rooted tree E F G R S S T B H C A D M U V W X Y Z Please write the order or vertices visited in (1) postorder traversal (2) inorder traversal (3) preorder traversal 4 N E 23 P 4 5

Determine whether the undirected graphs shown in the following figure have an Euler circuit. If no Euler circuit exists, determine whether the undirected graphs have an Euler path. Justify. G3 G I H B T M P E R G2 BC In which order are the vertices of the T rooted tree (root P) visited using a preorder and a postorder traversal In which order are

Find the isomorphism of the following trees as free tree, rooted tree and binary tree V5 V2 v9 VI V3 V6 V11 T V7 V4 v8 V10 V12 W5 W8 W 12 W1 W2 W3 W6 W4 T2 W7 W9 W10 W11 Activate Windo Go to Settings to ac

(e) For two rooted trees to be isomorphic under a permutation, the image (r) of a root r must also be a root. Draw (clearly) a list of rooted trees on 5 vertices such that every rooted tree on 5 vertices is isomorphic to exactly one in your list. Draw the roots as solid black circles and the rest of the vertices as hollow circles. Two such trees

Draw the three different trees with five nodes, and the six different trees with six nodes. Repeat the problem for rooted trees. For this problem the order of the branches of a rooted tree is immaterial. You should find nine rooted trees with five nodes, and twenty with six nodes.

9. 10. Based on the rooted tree below, determine the following i. ii. iii. Parent of f iv. Child of c v. Siblings of j Ancestor of t Descendent of b m n (5 marks) Determine the order of preorder, inorder and postorder of the given rooted tree in Question 9. (6 marks)

For n=4, draw rooted trees with n nodes, one tree for each possible height.

3) (25 pnt.) Solve the following questions a) Draw the rooted tree which is given with prefix form of (x BDF AC). b) Draw the rooted tree which is given with postfix form of (EDA BCFX). 4) (25 pnt.) The simple graph K is given as 4 i) Find a Hamiltonian cycle on K. ii) Find the Euclidian cycle for graph K, if there exists any. Also, state the

a) Draw the tree T as a rooted tree with B as a root. b) What is the height of the resulting tree? c) Which vertices are internal? d) Which vertices are leaves? e) List the order in which the vertices of the rooted tree are processed using preorder traversal. f) Draw the subtree of the tree that is rooted at G

A F B E G D J Figure 2 H I

Create a rooted tree where each tower is a node, and the edges between them represent the network connections. The root node of the tree represents the central hub of the network. You need to design the tree such that the network connections are optimized for maximum efficiency, and each tower is connected to the root node in the most direct way

(a) Give a recursive definition of the set of Rooted Trees. (b) For a rooted tree T recursive definitions for v(T) and e(T) the number of vertices and edges of T respectively. (c) For a rooted tree T, use structural induction to prove that v(T) e(T) 1,(a) Give a recursive definition of the set of Rooted Trees. (b) For a rooted tree T recursive

Draw the rooted tree with the code 00011001000011101111.

Draw a rooted tree and give its Newick format representation.

(a) List all level3 vertices. (b) List all leaves. (c) List all children of the vertex 2. (d) List all descendants of the vertex v. (e) Find the rooted subtree T (f) Find the height of (T,vo). (g) Find the height of T,Consider the rooted tree (7,vo) shown V10 V 12 VIT VIR V19 VIS V20 V21 V22 Figure 1 A labelled rooted tree,(a) List all level3

1. Suppose that T is a tree. We can turn T into a rooted tree by designating one of the vertices to be the root. Show, that different choices of root may turn the same tree into a rooted tree of height 5 or of height 9. 2. Suppose T is a tree with the property that each vertex of T either has degree 1 or degree 5. Show that the number of vertices

Show that preorder traversals of the two ordered rooted trees displayed below produce the same list of vertices. Note that this does not contradict the statement in Ex ercise 26, because the numbers of children of Internal vertices in the two ordered rooted trees differ. be a 6.3 C b 63 g FRE

A tree is a connected, acyclic undirected graph. So, for each pair v and u of nodes in a tree, there is exactly one simple path connecting v and u (a simple path is one that does not repeat any node). The diameter of a tree t is the length of the longest simple path in t. For example, the tree shown below has diameter 12. A (nonempty) rooted tree

A full binary tree is a rooted tree where each leaf is at the same distance from the root and each internal node has exactly two children. Inductively, a full binary tree of depth 0 is the one-node tree N, and a full binary tree of depth d + 1 is a rooted tree whose two subtrees are each full binary trees of depth d. How many nodes, and how many

Find the left ordered rooted tree representing the compound proposition Then use this rooted tree to find the prefix of this expression

1. The following figure shows one possible unrooted tree with 5 taxa. ABC D E How many rooted trees can be derived from this tree Illustrate them all. 10

a) A rooted tree is a tree in which one vertex has been designated as the root and every edge is directed away from the root. State ONE application of rooted tree in real life situation. Use this terminology to relate and to explain your application. Root, Node, Parent Node, Child Node, Siblings, Leaf, Height, Depth, Descendants, and Ancestors b)

Redraw this tree as a rooted tree (a) with R as the root (b) with 7 as the root R U

(e) (2 marks) A free tree is shown below. Select the root node which would result in a rooted tree of the minimum height. If this root note is selected, how many leaves are there in the rooted tree m 2 (f) (2 marks) A binary tree is a rooted tree where every node has at most two children. What is the maximum number of nonleaf nodes in a binary

Consider the following recursive definition of a rooted tree with root r a single node r is a rooted tree with root r if ,..., are rooted trees with roots T1,...,, and r is a single node, then r connected by edges to r1, ..., Tt is a rooted tree with root r. Prove by structural induction that any root tree x, if x has m nodes, then it has m 1

4. Rooted tree basics m q h n a b d 6 C a) Which vertices are ancestors of vertex n b) Which vertices are the descendants of vertex i List the leaves in the tree. c) d) What is the level of vertex d e) What is the height of the tree f) List the level four vertices. g) Draw the subtree rooted at vertex h. h) What are the siblings of vertex i

9. (a) Determine the planar code of the unlabeled rooted tree tagged (C) in the sketch below. (b) Determine the planar code of the unlabeled rooted tree tagged (D) in the sketch below. (c) (D)

4. A binary rooted tree is a rooted tree in which every vertex has at most two children. Lets count these in a very picky way, drawing them and only calling two trees the same if the pictures are identical. For example, the two trees shown below will be counted separately, although they are isomorphic (even as rooted trees). Let B, be the number

There is a one to one correspon dence between ordered rooted trees and binary trees. If you start with an ordered rooted tree, T, you can build a binary tree B with an empty right subtree by placing the the root of T at the root of B Then for every vertex v from T that has been placed in B, place its left most child (if there is one) as vs left

A D G 1. 6 pts Consider the following tree. Sketch the rooted tree resulting from each choice of root vertex. Also determine the height of each rooted tree and if it is balanced. root C root H B H Height Balanced Height Balanced root I Height Balanced

a) Get the level for vertex in tree a, b, c, d (root), e, f, g, h, i, j, k. b) Get height of rooted tree

Find the level of each vertex in the rooted tree with root in d a. C k .b d Root f. i e g j .h

i. What is the ordered rooted tree that represents the expression ((((3 x) (y2))3) 9)(2 z) ii. Use this rooted tree to find the prefix, postfix, and infix forms of this expression.

Use the following rooted tree illustration for Question 3 and Question 4 below. b 9 m n O Question 3 (8 points) Fill the table in below by using the rooted tree illustrated above. Please provide all vertices that apply to each. (Hint vertex 1 letter sponse, vertices 1 or more letter responses) Which vertex is the Root Which vertices are leaves

Compare the running time of function put (k) in binary search tree and sorted table implementation of MAP ADT. Is the binary search tree implementation better, or is the sorted table better, or it depends Please explain why.

In which order do you have to insert the values 54, 51, 24, 37, 13, 99, 49 into an initially empty binary search tree in order to get a full binary search tree A full binary tree is a tree in which every node other than the leaves has two children. Draw the resulting tree,Consider the following Python list 80, 23, 27, 31, 25, 35, 37 Suppose the

In a binary search tree What is worst case time complexity of the binary_search function? Provide an example binary search tree that exhibits worst case running time of binary_search function Write a function that prints elements in binary search tree in order

Devise an efficient algorithm that will transform any given binary search tree into any other binary search tree (with the same keys) using only ZIG and ZAG rotations. Your algorithm should run in time O(n) or better.

1. Use the binary search tree to answer the following questions (a) What is the preorder traversal of this tree (b) What is the inorder traversal of this tree (c) What is the postorder traversal of this tree 2. What is the maximum height of a binary search tree that contains n items Why 3. What is the minimum height of a binary search tree that

a. Insert the values 29, 3, 17, 9, 48, 26, 1, 42, and 5 into an initially empty binary search tree. The elements must be inserted in the given order. b. List the nodes of the above binary search tree in the pre-order traversal. c. List the nodes of the above binary search tree in the in-order traversal. d. List the nodes of the above binary search

a) Given the binary search tree shown below, draw what the tree would look like after adding the value 26. b) Given the binary search tree shown below. Draw what the tree would look like after deleting the value 19. 5 8 6 9 19 21 23 24 35 37 Activ Go to

a) Binary search tree is considered as a better data structure for many computations if the data can be organized into a balanced binary search tree. What is the height of the balanced binary search tree. Clearly explain your answer b) Explain a situation where a binary search tree can be very unbalanced c)Build the binary search tree for the

Consider the binary search tree (BST) below (10 3 20 (30 (35) 40 (36 (60) Show the sequence of nodes visited to find the predecessor of 33.

Define a balanced binary search tree and how it is different than a non-balanced BST in terms of construction and searching complexity. Provide pseudocode to determine whether a given binary search tree is a balanced binary search tree or not

3. The sequence of keys 4, 7, 9, 11, 14, 17, 18, 19, 22 is obtained by an inorder traversal of binary search trees. (a) Please show out two different binary search trees which can produce the same sequence. (10) (b) Given a binary search tree, please give an efficient procedure to generate the other binary search tree which has the same inorder

template

You often have to work with nested data structure. For example, the dictionary on the RHS is a dictionary of list. Your task is to sum the numbers in each list. For example sumnumbers(mydict) returns another dictionary that looks like below 5 15, 2 3, 3 2, 4 0, 1 None If the list is empty, the value should be None, if the list contains

a. Using the following sequence of input, build a binary search tree. 12, 16, 25,34, 6, 10, 14, 2, 22, 8 b. For the binary search tree you just created, redraw the tree after deleting node c. Redraw the tree one more time after deleting node 16.

show the binary search tree after inserting each value: Beginning with an empty binary search tree, what binary search tree is formed when you insert the following values in the order given? namely, search the binary search tree for the new entry, and insert the new entry at the position it would have been found. A, B, W, J, N, T, E

show the binary search tree by those number: 3, 1, 4, 6, 9, 2, 5, 7 1. To show the binary search tree after delete 2. 2. To show the original binary search tree after delete 5.

Construct an optimal binary search tree for five keys A, B, C, D, E with probabilities p1 = 0.1, p2 = 0.3, p3 = 0.1, p4 = 0.4, p5 = 0.1. Show(1) the main table; (2) the root table; (3) all computations to fill in the main table and the root table; (4) the optimal binary search tree based on the root table; (5) that the average number of

1. Insert the following values into a Binary Search Tree in this respective order: 5, 9, 2, 1, 4, 8, 3, 7, 6. Please show the BST tree after each insertion. 2. Delete those keys: 2, 5,6 from the Binary Search Tree (BST) in this respective order. Please show the tree after each insertion.

Draw the binary search tree if the pre-order traversals of that binary search tree is given as below: Pre-order traversal: 7, 4, 2, 3, 6, 5, 12, 9, 8, 11, 19, 15, 20

A binary search tree is a binary tree for which the value in each node is greater than or equal to all values in its left subtree, and less than all values in its right subtree. The binary tree given as example in problem 2 also qualifies as a binary search tree. Using the same list representation, write a recursive function (insert-bst V T)

1 5. 8 9 13 22 17 25 20

Explain why there is no advantage to having a complete binary search tree rather than a balanced binary search tree in terms of operations on binary search trees such as insert, remove and search.

Write the details algorithm and convert into java code for the solution of Binary search Tree 1- Construct a binary search tree to keep the records of the students names. You can insert the name of students that should follow the rules of binary search tree until press character N. 2- Perform the search operation to find the particular student. 3-

(a) Draw the binary search tree that we get if we insert the following values in this order into an initially empty binary search tree 7,4,16,5,1,18,21,12. 8 (b) Now delete 1, how does the binary search tree look like after the deletion 4

1. What node has the largest value in this binary search tree with root 8? 2. What node has the smallest value in this binary search tree with root 8? 3. What node has the largest value in this binary search tree with root 13? 4. What node has the smallest value in this binary search tree with root 13?

2 7 5 fooood 12 14 15 13 16 17 18

Write a C function for each of the following, must be between 10 - 20 lines, include all assertions: Binary Search Tree Insert Binary Search Tree Remove Binary Search Tree Traversal (Iterative version with a given stack) Binary Heap Insert Binary Heap Remove

An inorder tree traversal of a binary search tree produces a listing of the tree nodes in alphabetical on numerical order. Construct a binary search tree for "To be or not to be, that is the question." and then do an inorder traversal

Alice built a binary search tree of height log n. Bob built a binary search tree of height log(4n). When searching from the root to a leaf on the last level, the search on Bobs tree is slower by what amount? Explain your answer