Algorithms Questions and Answers August 16, 2021

2. (40 points) Implement the bubble sort algorithm on a array which holds 100 random values between 15 and 15. The pseudocode to implement bubble sort on 10 elements is given below. Display the unsorted array and the sorted array. Algorithm 1 Bubble Sort (10 elements) for i 1 to 9 do for j0 to 8 do if Alj) Al(1) then swap(A1(j), A1(1)) end if end

1. Write a Java program to implement PREORDER traversal of a binary search tree 2. Write a Java program to implement POSTORDER traversal of a binary search tree

Write in SML Write a datatype for a binary search tree and then Write an SML function that applies the heapsort algorithm on the binary search tree

2 Delete the node with key 40 from the following binary search tree and reconstruct the tree so that it is still binary search tree 30 40 45 46 50 47 60 vin 55 48 70

Show, step by step, how counting sort works on 4,3,2,3,5,1,4,3

Use scientific notation to perform the calculation. Give the answer in scientific notation and standard notation. ((0.49)(14,400,000))/(98,000,000) scientific notation standard notation

a. Sort the following array using Selection sort 15 3 7 9 5 1 6 b. Derive the worstcase upperbound asymptotic notation of the Insertion Sort algorithm. 4

4. Let X, X, X, be a random sample from U(0,1). Let Y,,, Y, be the order statistics based on X, X, , X5. (a) Determine the distribution of the sample median X. (b) Find P(Y, 0.5). (c) Determine the distribution of RY, Y. (d) Find E(R) and Var(R).

Let X(1), X(2),..., X(8) be the order statistics from a random sample X, X2,..., X8 of size 8 from a continuous probability distribution. What is the probability that the median of the distribution under consideration lies in the interval X(2), X(7)

Considering the following spherical triangle (R 6400 km), fill out the following table if A is the North Pole, B is Calgary Airport with Lat N51 07 49 and Long W114 00 45, and Cis Toronto Airport with Lat N48 50 04 and Long W079 48 36. Double check the coordinates you see here using Google Map. Double check your answers using NRCan tools. You will

Demonstrate radix sort on the following sequence [9042, 7042, 4230, 23, 3487, 4202]

Write down the PARTITION algorithm of the naive quicksort so that you can sort the array in descending order. Explain the advantage of randomized quicksort algorithm over the naive quicksort algorithm.

10. Dava is training for a sprint triathlon consisting of a 3 mile run, followed by a 20 mile bike ride, and ending with a half mile swim. Recently, she has completed three training sessions with total times shown in the table below. 3.5 run (mi) bike (mi) swim (mi) time (min) 2 35 10 1 60 0 1 65 Coordinate Spaces 205 4 Calculate Davas expected

Linearity and Time invariancy go hand in hand, please explain how to figure out whether a signal is linear or not. Also explain how a signal is time invariant or time varying. provide examples.

Wile E. Coyote needs to know how long it will take for the dynamite to explode after lighting the fuse. He determines that fuse length and detonation time are linearly related and calculates the following Average fuse length (X) 10.1 inches Standard deviation of fuse length (s,) 2.97 inches Average time to detonate () 14.9 seconds Standard

Let z be the height of a falling object of mass m. The differential equation d 2 dz dt mg Ci Cn dt m dz dt 2 sgn dz dt describes the acceleration of the object over time if it is subject to linear and nonlinear friction. Give the units and expected sign of the coefficients g, C, and Cn if the z is taken to be positive upward.

In a linear birth and death process with birth rate death rate a 0, assume that there are only two events (an event is a death or a birth) occurred in time interval 0, 2t. One occurred at time t and the other occurred at time 2t. (a) What is the expected population size at time 2t, if the initial population size is n2 (Express your answer in terms

The same monkey business as before We have a sequence of i.i.d. random variables X with PX 1 12, PX 2 14, PX 3 14 Vi e 1, 2, 3, ... We are interested in the pattern 1232. We want to compute the expected time for the monkey to first type 1232. a) Draw a useful picture of a Markov chain.,b) Write a set of linear equations that, when solved, give

If one for loop runs with size N and the other with size M and the loops follow a linear way (one follows the other), what is the expected time complexity Clearly explain your answer.

Suppose that the elapsed time, in years, until the next car accident at Broad Avenue and Esplanade Avenue follows an exponential distribution with parameter A 3. (This means that the expected value of time until next car accident is 13 years). Use the linearity of expectation to answer the following questions, indicating how linearity of

3. Original cost of a printer is 450. After 5 years it will have to be replaced. Its value at that time is expected to be 75. Write a linear equation giving the value of the printer (variable Y) as a function of time (variable X). Sketch the graph and estimate what is the expected value of the printer after 3 years. (5 points)

A company constructs a warehouse for $1,725,000. The warehouse has an estimated useful life of 25 years, after which its value is expected to be $100,000. Write a linear equation giving the value y of the warehouse during its 25 years of useful life. (Let t represent the time in years.)

a. Calculate the correlation between Copiers and Minutes. b. Obtain the linear regression equation of fitting Minutes on Copiers. C. Interpret the slope of the linear regression equation in the context of the problem. d. Calculate the coefficient of determination, R. Interpret R in the context of the problem. e. Test the hypothesis that the slope

Alice and Bob play a game in which they flip a coin repeatedly. Each time the coin is heads, Alice wins $1 (and Bob loses $1). Each time the coin is tails, Bob wins (and Alice loses) $2. They continue playing until Alice has won three flips. Prove that the expected value of Bobs winnings is $3.

Let us imagine that we are studying a physical system that gets hotter over time. Let us also suppose that we expect a linear relationship between time and temperature. That is, we expect time and temperature to be related by a formula of the form T at b where T is temperature (in degrees Celsius), t is time (in seconds), and a and b are unknown

As part of your prelab analysis, Read the lab procedure then answer the following questions 1. Sketch (be sure to label the axes) the distance vs. time and velocity vs. time graphs you expect for motions you will be doing in the lab activity. Walking slowly away Walk quickly away pos vel time pos time vel time pos vel time Walk slowly towards time

1. A company recycles waste plastic into fleece fabric. The product quality depends on the length of time in processing, and the product value produced has been evaluated with the following data Processing time Market value of product in minutes in per pound 2.75 4.50 5.45 6.75 8.50 35 85 160 205 275 a) Assume there is a linear dependence of

A hyperplane in R is an n1 dimensional linear subspace cut out by one nontrivial linear equation. A line is a one dimensional linear subspace cut out by 1 appropriately chosen linear equations. If the line doesnt lie on the hyperplane, what do you expect the dimension of the intersection of the line and the plane to be Justify your answer with

If a simple Nspan moving average is applied to a time series that has a linear trend, say, y, Bo Bit E,1 will lag behind the observations. Assume that the observations are uncorrelated and have constant variance. Show that at time T the expected value of the moving average is N1 E(M) B BT N. 2

Make Matlab code for worker's time on duty in hours and his reaction in seconds. Do this task for 2 options: 1)if data is fitted as linear relation, 2) if the data is fitted as quadratic parabola For all cases draw the data points, and the fitted line for comparison. What is expected reaction time after 8 hours of work ?

5 Demonstrate the construction of the AVL tree that results from inserting the following numbers in the given order, Show the tree and balance factors for ALL iterations. 55, 33, 77, 22, 11, 44 2. Heapsort a. Show ALL iterations of the insert algorithm to build a heap on the list 2, 1, 6, 9, 4, 3, 8 b. Show ALL iterations of the heapify algorithm

Usin the asymptotic notation definition to prove (n+10) = O(n^4)

A 2 POINTS Iteration method, then express the result in asymptotic notation . T(n) n 4 T(n4) B 3 POINTS Consider the following recursive function then answer the questions below float foo(int n) ( if(n1) return 1 else foo(n2) for(int i 1 i

A Iteration method, then express the result in asymptotic notation . T(n) n 2T(n2) B Master method, then express the result in asymptotic notation . T(n) 8T(n2) n 10n

FInd the big O asymptotic notation nlg(n/2)+n^2lg(n)+(n^2+2)lg(n/2).

You are comparing implementation of insertion sort and merge sort on the same machine. For input size n, insertion sort runs 5n steps, while merge sort runs in 25 n lg n steps. For which values of n does insertion sort beat merge sort You are comparing implementation of insertion sort and merge sort on the same machine. For input size n, insertion

3. In the network below, use Dinics algorithm to find the max flow (show each step) (2 S 10 B D E T

4. X 4 2 1 8 The final form of a simplex tableau corresponding to a regular linear programming problem is given. Find the solution to the corresponding regular linear programming problem. Y 9952 20000 1 U MOOTO V 5225 12 W OOTO 0 1 0 0 P 2000A 1 Constant 40 20 15 700

Franklin purchases 40 percent of Johnson Company on January 1 for $621,700. Although Franklin did not use it, this acquisition gave Franklin the ability to apply significant influence to Johnsons operating and financing policies. Johnson reports assets on that date of $1,482,000 with liabilities of $511,000. One building with a seven-year

Draw an undirected graph with 8 vertices and with a minimum of 10 edges and explain in detail its breadth-first search algorithm (how it happens). Draw the breadth-first search tree.

10. Use a depthfirst and breadthfirst search to find a spanning tree for the following Graph. D B

Given the directed graph below, show the traversal order (e.g., A, B, C, D, ....) when you apply (i) breadthfirst search starting from H and (ii) breadthfirst search starting from B. H B D E G F I J K

1. Write the appropriate algorithms to perform the following: a. Find the maximum, minimum, and average values in a linked list. b. Concatenate two linked lists. c. Combine two ordered linked lists into a single linked list. d. Form a linked list containing the union of two linked lists. e. Move a node forward n positions in a linked list. (Using

7. Give the methods retrieve, replace, traverse, for simply linked lists 8. Create the recursive program for 24

Write the following functions a) merging two ordered singly linked lists of integers into one ordered list. b) concatenating two lists p1 and p2. c) checking whether two singly linked lists have the same contents. 1) Write 3 functions Number Linked List merge (Number Linked List p1, NumberLinkedList p2) Number Linked List concatenate2Lists (Number

Create two linked lists each having ten nodes

Write C++ code There are two linked lists A and B containing integers. Write a friend function of LinkedList class to create and return a new linked list that contains only those elements that are common in linked lists A and B LinkedList commonElements(LinkedList A, LinkedList B) { } Use this linked list code #include using namespace std;

solve it as a Variations of Lists Multiply Linked Lists in java

datal Smith Doe Firstl Adams Jo nextl data2 1537 1197 1932 2570 next2 First2

The RL can be implemented without dynamically managed linked lists by creating a new field, next, in each PCB, which points to the next PCB on the same list. Each entry of the RL then points to the first PCB on the list. (a) Assume that RL contains 3 processes at level 5 and 1 process at level 0. Draw a diagram showing the RL and the modified PCBs.

1) Consider the following graph a) Show how a cycle is found using DFS (int parent, int vertex). Must show linked lists and all the steps.

Write and execute JAVA program to implement a method, which can be used to find common values present in two single linked lists and the display appropriate message. The program should have appropriate methods to create and display the single linked lists by taking values from user.

Create a simple - short (beginner level) java example of Stack implementation to use LINKED LISTS instead of arrays. Also the Stack must support any kind of item, not just integers.

Write a pseudocode function that interchanges two adjacent items of (a) singly linked lists (b) doubly linked lists,Evaluate the following postfix expressions. Show the status of the stack after each step of the algorithm. Assume the following values for the identifiers a 7, b3, c 12, d 5, e 1. (a) a b c (b) abcd (c) abcde,Convert the

This program will define various functions to process a linked list. The main program will demonstrate that the functions work. Input An input file contains an unknown number of integers. Use a createlist function to create the list with the integers in the info component of each list node. Output Use a printList function to output the info

Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists begin to intersect at node c1. A B bl al b2 a2 b3 cl c2

Write a program that merges two sorted linked lists to form a single sorted linked list. To solve this problem, write a program that performs the following steps: 1.Declare an array of 20 spaces, and randomly assign 20 integers between 1 and 1000. 2. Sort this array in ascending order by selection sort. 3. Organize the contents of the sorted array

a)Write information and example programming to demonstrate implementation about Linked Lists, Type of Linked Lists b)Write a program for Linked Lists impregnation c)Write a program for Simple Linked List implementation d)Write a program for Doubly Linked List implementation e) Write a program for Circular Linked List implementation

Create a function that takes in two linked lists and create a third linked list that contains the elements Assume the linked lists are C in both linked lists. You do not need to sort or eliminate any duplicates. STL list containers.

How do I write code to combine two singly linked lists without duplication in c++? The linked lists don't need to be sorted in any order. They just need to not have duplicates. combine(const LinkedList& m1, const LinkedList& m2);

1. Write the definition of the function Equals() whose header is template bool Equals(Node ptri, Node ptr2) It returns true if the linked lists pointed to by ptrl and ptr2 are equal otherwise, it returns false. Two linked lists are equal if the data of their nodes are the same in the same order and the linked lists are the same length.

1. What is found in the class Node that makes linked lists different from array lists? How does that work? 2.Compare arrays versus linked lists as data structures to represent lists of elements and bags. Explore the advantages and disadvantages of each.

Could you explain here the differences in implementing linked lists in Java and in C++? How about the pros and cons of selecting Java or C++ when we need to implement linked lists in our programs?

Write pseudocode for : Linked lists 1. Insertion of a node in Linked List (On the basis of some constraints) 2. Delete a given node in Linked List (under given constraints) 3. Compare two strings represented as linked lists 4. Add Two Numbers Represented By Linked Lists 5. Merge A Linked List Into Another Linked List At Alternate Positions 6.

A. Using Linked Lists write a programming segment to add new nodes to the tail/end of a list. B. Using Linked Lists write a programming segment to traverse a linked list.

1. Explain the concept of Linked lists in C programming as detailed as you can. 2. What is a head pointer and what is its purpose in Linked lists in C programming? 3. For self-referential structures in linked lists, why is it important not to use type-definition declaration of a structure? 4. What instances should we use arrays and what instances

Let and be two sorted linked lists (in increasing order). 1. Write a pseudocode that merges the two linked lists into a sorted linked list (that contains the union of their elements). 2. Provide pseudocode to deal with the following situation the first element of l is not the minimal one in the list (all other elements are in increasing order).

What is the Difference between each of the following terms, Justify with drawing if possible 1) Array Based Sacks Vs Linked Lists Based Stacks 2) Pop() Method Vs Top() Method 3) Singly Linked Lists Vs Circularly Linked Lists 4) Head Node Vs Normal Node

Implement and exemplify the following algorithms in C. a) implementation of stacks using arrays b)implementation of stacks using linked lists c)queue implementation using arrays d)queue implementation using linked lists

what is the output of stack and Queue?

A program performs the following operations on a stack S and Queue Q a. S.push(52) b. S.push(52) c. S.push(S.peek()2) d. System.out.println(S.size()) System.out.println(S.pop()) e. f. S.pop() System.out.println(S.size()) g. h. Q.enqueue(36) i. Q.enqueue (28) j. Q.enqueue(Q.first()3) k. System.out.println(Q.first()) 1.

A stack and queue can be viewed as a special type of list. Using a stack the elements are accessed, inserted, and deleted only from the top of the stack. Whereas, using a queue the elements are inserted into the end (tail) of the queue, and are accessed and deleted from the beginning (head) of the queue. What is the output of the program below

List three or four primary operations for each of the following ADTS. Stack List Problem 5 (10 points) List the primary advantages and disadvantages of array and pointer implementations of the stack and queue ADTS. Advantages Disadvantages Advantages Array implementation Disadvantages Queue List the additional advantages and disadvantages of array

In this project, you will be designing and implementing a Java program that uses the Stack and Queue data structures. Your program should be able to demonstrate the functionality of both data structures and show how they can be used in real-world scenarios. Instructions: 1. Design a Java program that uses the Stack and Queue data structures. Your

First implement a Stack to insert your student ID digit by digit in order such as 213xxxxx then empty your stack and insert the output into the Queue. What will be the output if you empty the Queue Demonstrate your work by showing the steps for both Stack and Queue and screenshot of your code and output. Assuming both stack and queue are initially

3) Explain the differences between and stack and queue data structures. Give an example of when we might use each one to represent data in a program. 4) Which of our ArrayList and Linked List data structures are better at implementing stacks Explain why.

Using array implementation make a Stack and Queue program that takes user input and creates a stack list of them.

(2) (5 marks) 1) Explain the Quick Sort Algorithm with an example. Write a note on the Worst Case, Best Case and Average Case Analysis of Quick Sort Algorithm. (3) 2) Explain with example any real world application of the following Data Structures. (3 marks) a) Dictionaries b) Stacks c) Queues 3) Write a note on Linked Lists. Mention any 2

Give a complete java class referencebased implementation of a queue of integers containing the following methods dequeue, enqueue, isEmpty, and a default constructor. Include error handling mechanisms.

Write a program using Stack and Queue 1. Create a Stack S and Queue D of String. 2. Ask the user to input 10 names. 3. Add the names to the Stack 4. Search the names that start with A and S from the stack and add them to the queue 5. Remove and Display from both Stack and Queue.

implement stacks and queues using different types of data structures, such as: a. Implementing a Stack using vector. b. Implementing a Queue using vector. c. Implementing a Stack using Linked List. d. Implementing a Queue using Linked List. e. Implementing a Queue using two Stacks. (all in java ) and Simple , short codes

In this project, you will code the actual stacks and queues. You will not use the STL! You will also code the iterator needed to access a stack or queue. In this project, the stack and queue implementation will be done in a single application. You will have to justify your choice of implementation as your progress through this project. List -> 5

a) Using the Stack and the Queue structures explain the LIFO and FIFO principle in data management. b) Explain the statement "the time taken by an algorithm grows with the size of the input" c)What are the advantages of the data structure Queue? What type of data structure would you recommend for storing data?. d) Draw a complete binary tree with

. By implementing the stack concept, create a program that will implement the algorithm delimiter Matching(). Examples Input 1(2(23)4 (31)) 5 (23) (23) (2 3) (3 1) (2 Output (23) 4 (3 1)) (23) (2 3)

write a program using stack and queue that will accept only all lowercase 5 letter word, checks if the accepted word is palindrome and outputs the word in uppercase.

Write a program that reads a string of characters, pushing each character onto a stack as it is read and simultaneously adding it to a queue. When the end of the string is encountered the program should use basic stack and queue operations to determine if the string is a palindrome. Your solution must use the STL stack and queue classes..

1. implement a stack and a queue classes. Keep these classes separate. Then either via a main program or another class, implement the code that will test your classes. The stack and/or queue abstractions must be implemented using Single linked lists. 2.Write a simple application to manage an adding machine program, where the stack is sued to push

4. Assume you are given a Queue and Stack data structure as described in class that have the following methods StackQueue (default constructors), enqueuepush, . dequeuepop, peek, isEmpty. Your task is to write a method with the following signature public static void reverseStack (Stack inStack) This method, when given a stack alters its

Write a program in C++ that supports both Stack and Queue operations using a doubly linked list. The data structure should include functions: For push (to add an element to the top of the stack) Pop (to remove and return the top element from the stack) Enqueue (to add an element to the back of the queue) Dequeue (to remove and return the front

3. Write a program that implemening stack and queue Ageef Rear 45 Mohd 6 Aisyah 33 Add Muaz and Syed in the stack. .. Arisa Remove 3 elements in the stack and queue. Stack a. Add the following characters into the stack and queue. b. Display the stack and the queue C. d. Display the current value of the stack and queue. e. Print the first element

Write a set of routines for implementing several stacks and queues within a single array (Hint: hybrid implementation).

Assume the stack and queue classes (the 2 starter programs that I provided on Blackboard) are also given here on the test. This means, you are adding code to main and do not have to write push, pop..... addQueue, deleteQueue, etc... Write the Java method that takes the contents of stack and places it in queue and the contents of queue into stack.

Modify above by adding new class "Element" which has an integer variable that store the data. Make any needed changes to add, transfer and print the object from the stack or the queue.

Using Stack and Queue buildin JAVA classes to implement the following At the main create new object of the stack class and Queue class Add four elements to the stack Print all stack and queue elements Send the stack and the queue to another method transfer Create transfer method which takes two arguments (Stack, Queue) o this methods with

Assume Stack and queue are defined already and there is a push and pop method defined as well. int main() { Stack s; Queue q; s.push(1); s.push(2); s.push(3); for(int x = 0; x < 3; x++) { printf(%d, s.pop()); } What would the output be once you run the for loop. If the program above is compiled and run, what is the output?'

1. 2. 3. What is a stack data structure and what is a queue data structure Compare the similarities and differences of stack and queue data structures. What are the operations in stack and queue data structures Highlight the output at each lines of the following codes for an implementation of stack using array char arry 5 int top 0 arry.push (a)

Implement Class IntQueue, a class that contains a queue of integers using an Array. the members are as follows: Attributes 1)Data structure 2) Variable to keep where we are (the index to insert and remove the next value) Methods 1)boolean isEmpty() 2)int dequeue(); 3)void enqueue(int x); 4) bool isFull() Third, using stack and queue classes in

Implement a Car class that includes data members to represent a cars make (e.g., Honda), model (e.g., Civic), production year, and price. The class interface includes methods that provide appropriate access to the data members (e. g., a method to set the cars model or to get its price). Create a Text class that contains a string object to hold the

12 Assuming the usual Stack methods push, pop, and isEmpty, write the body of the client method below that returns a pointer to the bottom object in a generic Stack. I.e., the first item pushed. HINT Use another Stack Get the bottom object in the Stack param s the Stack return a pointer to the object on the bottom public E get Bottom (Stack s)

a. Write a statement to declare a pointer variable of type Rectangle. Name it one. b. Write a statement to instantiate the Rectangle class and assign the address of the object to pointer one. The Rectangle object is located at (2.5, 3.5) and its length and height of are 150 and 120, respectively. The color used to paint the rectangle is Blue. c.

Create a class Computer with properties: Brand Name, Speed, Memory Size. Create input and output functions. Perform the following separately, (A)Create and object and a pointer assign object address to the pointer. Call class functions using pointers. (B)Dynamically allocate memory the pointer of Computer and call its functions (C)Create an array

a. Write function that reads hight and the base and calulate volum the triangle object . Hint: volum= *hight* base. B. In main: Define object of type triangle ( triObj ). Define Pointer object of type triangle ( ptr ). Let ptr points on triObj. Call function read for object triObj . Print the infotmation of the triObj using pointer ptr .

Define the variable cgptr a pointer to an object of type floating value. Assign the address of variable total to pointer variable cgPtr.