Algorithms Questions and Answers August 09, 2021

You are looking for an item in an ordered list 450,000 items long (the length of Websters Third New International Dictionary). How many steps might it take to find the item with a sequential search A binary search

You cant remember the last number in your best friends telephone number. You need to reach himher, so you decide to keep trying different numbers until you find the right one. What is this method called a. Systematic random search. b. Meansend analysis. c. Tried and true method. d. Frame of reference approach.

You have a large basket of assorted candy, including Starbursts, Reeses Cups, and Hersheys chocolate. There are three students to whom you want to evenly distribute the candy. You have three empty bags which can be used to allot candy for each student. Write out steps for how to distribute the candy to each student, adhering to the following

Evolutionary algorithms are used a. In engineering, to arrive at solutions by going through many permutations of possible solutions and allowing them to evolve. b. A genetic feature of complex organisms. c. A process undergone by the human brain, which is similar to evolution by natural selection. d. Another term used for a computer algorithm in

Explain the key idea of branch and bound algorithms.

John, a computer hacker, set up a program to crack the fivedigit password to his computer that he algorithm to reveal the password. had somehow forgotten. John used a(n) a. meansends analysis b. analogy c. trial and error d. systematic random search

Preheat the oven to 350 F. Spray a cookie sheet with a nonstick spray. Roll the previously refrigerated cookie dough into 1inch balls. Arrange on the cookie sheet 2cm apart. When the oven is hot, bake for 12 to 15 minutes or until golden brown. Transfer to cookie rack 5 minutes before eating. Which of the following step should the baker take

Use the greedy coinchange algorithm to make change using quarters (25 cents), dimes (10 cents), nickels (5 cents), and pennies (1 cent), for 92 cents. How many coins did you use Can you make a change using fewer number of coins

While installing fiber optics, some companies will install a SONET ring a full loop of cable connecting multiple locations. This is used so that if any part of the cable is damaged, it does not interrupt service, since there is a second connection to the hub. A company has 5 buildings. Costs (in thousands) to lay cables between pairs of buildings

Broke & Down has several hundred machines in its large manufacturing facility as it uses the PWP concept (plant-within-a-plant). Ray Pear, Manager of Maintenance and Chief Mechanic for the Broke & Down Machine Shop, says that broken machines arrive at the repair facility according to a Poisson pattern at the average rate of 2 per 8-hour

Convert the decimal number 14959 into a hexadecimal number.

In computer computations it is often necessary to compare numbers. Two fourbit signed numbers, X x3x2x120 and Y 93929190, can be compared by using the subtractor circuit in Figure 5.43, which performs the operation XY. The three outputs denote the following . Z 1 if the result is 0 otherwise Z 0 N 1 if the result is negative otherwise N 0 .

Implement the function f(w, W2, W3) decoder and an OR gate. Em (0, 1, 3, 4, 6, 7) by using a 3to8 binary

Implement the function f(w, W2, W3, W4) WW2W4W5 W W2 WW3 W W W3w4w5 by using a 4to1 multiplexer and as few other gates as possible. Assume that only the uncomple mented inputs w, W2, W3, and we are available.

Design an FSM that has an input w and an output z. The machine is a sequence detector that produces z 1 when the previous two values of w were 00 or 11 otherwise z 0.

Design an FSM that has an input w and an output z. The machine is a sequence detector that produces z 1 when the previous two values of w were 00 or 11 otherwise z 0.,Problem Implement the sequence detector of Example 8.11 by using two FSMs. One FSM detects the occurrence of consecutive 1s, while the other detects consecutive Os.

Write C programs for the following. (a) Computing the value of e up to d decimal places of accuracy. where the values of a (of double type) and d (of int type) are accepted as input.

In this problem, we will explore how a firm can provide incentives for its executives using the firms stocks. Suppose WeRock is a public company in the market of online broadcasting. The CEO of WeRock has a personal cost of working C(H) 50H, where H is the number of days she works hard each quarter. Without any effort, the companys stock is

An ethanol processing facility costs 40,000 to construct and will last 6 years (it is constructed in year 0 and runs from year I through year 6). It produces 3,000 barrels of ethanol per year and can charge a price of 6 per barrel. If the interest rate is 9, what is the net present value of this facility A different ethanol processing facility

8. (10 pts) Use generalization on Age to make the following table 3anonymous and 3 diverse with respect to Disease. Meanwhile, to avoid degrading data utility too much, you must keep at least 3 equivalent classes. Age 30 29 28 27 24 Disease Cancer Viral infection Heartrelated Viral infection Heartrelated,24 23 21 19 19 17 Heartrelated Cancer

a) Moses, a Managing Director at ABC Sales Expert, does not have PGP/RSA installed on his private e- mail client, however he has a public/private key pair which he uses when communicating over his corporate mail client. He wants to send a sensitive message to Mary, his colleague, as he often does, however he currently cannot use the corporate

Shamsirs small business has been growing slowly. He has noticed that his monthly profit increases by 1 percent every two months. Suppose that the profit at the end of this month is $10 000. What is the present value of all his profit over the next two years? Annual nominal interest is 18 percent, compounded monthly.

The order statistics problem is to find the ith smallest of n elements for any i. The median finding problem is a special case of the order statistics problem when i = n/2 or (n+1)/2. Show that any fast algorithm for the median finding problem can actually lead to a fast algorithm for the order statistics problem. In particular, show that if there

Consider the following problem: You are given an undirected graph G with n vertices and m edges, along with a source vertex s. You want to find the shortest paths from s to all other vertices in G. You decide to use Dijkstra's algorithm, but with a twist: you only want to explore a subset of the vertices in G. Specifically, you only want to

Consider a data structure that represents a weighted undirected graph with n vertices and m edges. Suppose you want to implement the Kruskal's algorithm for finding the minimum spanning tree of this graph using a disjoint-set data structure. Assume that the disjoint-set data structure is implemented using path compression and union by rank

Suppose a round-robin scheduling algorithm is used to schedule a set of processes on a single processor. Which of the following statements about the algorithm is true? A. The quantum size used by the algorithm has no effect on the turnaround time of the processes. B. The algorithm is not fair because longer processes may have to wait longer than

2. Write a simple multithreaded program (3 threads) in Python. Each thread can perform the following tasks print the thread ID (provided by you), decrease its local counter by 1 until the counter reaches 0, and then exit the thread. The counters for the two threads are initialized as 6 and 7. (3 points)

Given an array of integers, find the maximum difference between any two elements such that the larger element appears after the smaller element. Example: Input: [7, 9, 5, 6, 3, 2] Output: 2 (difference between 7 and 9)

An algorithm is a procedure used for solving a problem or performing a computation. Algorithms act as an exact list of instructions that conduct specified actions step by step in either hardware- or software-based routines?

Use the Quine-McCluskey method to simplify the sum-of-products expansion zwxy + wxyz + wx zy + w xyz + w yxz + wxyz + wxyz .

An array catmarks stores n elements all of integer data type i) Write an python based algorithm that can be used to determine if an element x exists in the array using a linear search technique. ii) Convert the above algorithm into a program.

Write a C++ code snippet for a bubble sort algorithm. (5 Marks)

Given two sorted arrays nums1 and nums2 of size m and n respectively, find the median of the two sorted arrays. The overall time complexity should be O(log(m + n)). Write an pseudo code to solve this problem. Also explain how complexity of pseudo code is O(log(m+n)).

Find the number of solutions of e1+e2+e3 = 17, where e1,e2,e3 are integers such that 2 e1 5, 3 e2 6 and 4 e3 7.

Prove that there are at most mh leaves in an m-ary tree of height h.

The given recurrence relation is an = 6an-1 11an-2 + 6an-3 with initial values a0 = 2, a1 = 5, and a2 = 15.

Explain and evaluate The disaster devastated measurement, for a road network connecting all of the key locations using an algorithm.

You are given the a supply of 2bromo1methoxybiocyclo2.2.2octane. Your task is to prepare 1methoxybiocyclo2.2.2oct2ene from this starting materal. In your first attempt, you treat the bromide with sodium ethoxide in ethanol. Although a small amount of the desired alkene is formed, most of the product is 2ethoxy1 methoxybiocyclo2.2.2octane. Suggest

A calculation is a method utilized for taking care of an issue or playing out a calculation. Calculations go about as an accurate rundown of directions that lead determined activities bit by bit in one or the other equipment or programming based schedules?

Design and analyze an algorithm for the Traveling Salesman Problem (TSP) that finds the optimal tour in polynomial time. Explain the time and space complexity of your algorithm, and compare it with existing algorithms such as brute force, nearest neighbor, and Christofides algorithm. Also, discuss the limitations and challenges of implementing TSP

Consider the problem of finding the shortest path between two nodes in a graph with non-negative edge weights. Describe and analyze the time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm for solving this problem. What are the advantages and disadvantages of each algorithm? Under what conditions would you choose one algorithm

Question Description Suppose that A = 7.0, B = 4.0, C = 3.0, D = -2.0. Evaluate the following RPN Expressions (a)A B + C / D * (b) A B C + / D * (c) A B C D + / * (d) A B + C + D + (e) A B + C D + + (f) A B C + + D + (g) A B C D + + + (h) A B C D (i) A B C D (j) A B C D (k) A B C D

Explain the Bubble Sort algorithm and provide an example implementation in Python ?

Explain the goal of data warehouse and describe the architecture of the same with the Functionality of each component.

Explain the structure of an Expert System and explain the functionality of each module

Explain how binary search works?

Mention what are the types of notations used for Time Complexity?

Explain what is the time complexity of the Algorithm?

Explain what a Quick Sort algorithm is?

Explain what an algorithm is in computing?

1. What is the time complexity of inserting an element at the end of an array, assuming the array has n elements? 2. Explain the difference between a stack and a queue data structure. 3. What is the purpose of a hash table, and how does it achieve efficient key-value lookup? 4. Describe the concept of recursion and provide an example of a

Given an array of positive integers. Find the maximum length of Bitonic subsequence. A subsequence of array is called Bitonic if it is first strictly increasing, then strictly decreasing.

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order , and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order . The final sorted array should not be returned by the function, but instead be stored inside the

Given the root of the Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree

Question Solve the following equation for x ((x 2) (x))2 12

What are the steps in developing a machine learning ?

How to choose the right algorithm in Machine Learning?

How has technology changed our primary and secondary groups?. explain in 110 words without plagrism?

Advancements in quantum algorithms and software.

Write a Python function that implements the Binary Search algorithm to search for a given target value in a sorted list. The function should return the index of the target value if found, or if it is not present in the list.

Implement the Bubble Sort algorithm in Python to sort a given list of numbers in ascending order.

write a program to implements the Merge Sort algorithm?

Describe the comparison of different edge detection algorithms

Develop an algorithm that illustrate dynamic implementation of queue.

In a freesurface flow environment and trapezoidal cross section which is given in the figure the manning parameter is n0.02, the side slope is m1.5. Since the channel base slope is lo0.009, calculate the uniform flow depth for Q30 m3s flow rate 5 m m 1 Yo

What is the principle of optimality in DAA?

What is reliqbility design in DAA?

What exactly is NP-Complete?

What ia the knapsack problem in DAA?

What is a multistage graph in DAA?

What exactly is the distinction between file structure and storage structure?

How does the asymmetric encryption algorithm work?

Consider a scenario where you have to deal with a massive dataset that doesn't fit into memory, but needs to be sorted. How would you design an algorithm that efficiently sorts this data while minimizing the use of external storage and optimizing for overall performance?"

On January 1, Year 2, the Feather Company had 50,000 shares of common stock issued and outstanding. On May 1, Year 2, the company sold 12,000 additional shares for cash. On August 1, a 10% stock dividend was distributed. On November 1, 12,000 shares were reacquired as treasury stock. What is the weighted-average number of common shares outstanding

List the importance of branch and bound methodology.

Explain Rabin Karp algorithm along with suitable example.

Given an array A1..7 (17, 23, 12, 32, 24, 15, 9), run Heapsort (A, 7) to sort the array into nondecreasing order. HEAPSORT (A, n) 1 BUILDMAXHEAP(A, n) 2 for in downto 2 3 4 5 swap A1 with Ai A.heapsize A.heapsize 1 MAXHEAPIFY(A, 1, i 1) BUILDMAXHEAP(A, n) 1 for i n2 downto 1 MAXHEAPIFY(A, i, n) 2 MAXHEAPIFY (A, i, n) LEFT (i) r RIGHT (i) if 1

The worstcase time complexity of heapsort is (nlgn), whereas for quicksort, it is (n). Why, then, is quicksort preferred over heapsort in practice

42. Heapsort a. Show ALL iterations of the insert algorithm to build a heap on the list 4, 3, 8, 10, 6, 5, 9 b. Show ALL iterations of the heapify algorithm to build a heap on the list 4, 3, 8, 10, 6, 5, 9 C. Show ALL iterations of the heapsort algorithm to sort the list using the heap from b.

Question 1 Run BuildMaxHeap on the following A4, 10, 16, 14, 7, 9, 3, 1, 8, 2 Question 2 Run HeapSort on the following A 16, 14, 10, 8, 7, 9, 3, 2, 4, 1 Question 3 Run MaxHeapInsert (A, 20, 6) on the following A 15, 13, 9, 5, 12, 8 Question 4 Locate resources about Analysis of the Heapsort algorithm. Include your URLs. In your own words, briefly

Heapsort [14] Perform heapsort for input sequence which contains 4 items: input 4, 16, 5, 7. Show the complete process of sorting the input. Use array format. Must include all the steps.

compare with insertion-sort, merge-sort, quick-sort in python

Implement the heapsort algorithm Develop test cases to test your code Compare Heapsort with other sorting algorithms

Use heapsort to sort the following sequence of letters in increasing order: . Give an example that will show that heapsort is not stable.

a. Construct a heap for the list W, E, L, C, O, M, E by either the top-down or the bottom-up algorithm b. Apply heapsort to sort the above list. Show the intermediate heap of each step. c. Discuss the best case, worst case, and average case of heapsort d. Is heapsort stable? Why? If not, give a counterexample. e. Is heapsort in-place? Why? If not,

6. (50 points) HeapSort and running time analysis (1) Using the example covered in class as a model, illustrate the operation of HeapSort on the array A 12, 5, 33, 10, 25, 7, 4, 17, 9, 28. (2) Show that the worstcase running time of HeapSort is (n lgn).

a) Write the HeapSort method/function/procedure. (DO NOT WRITE THE CODE FOR HEAP METHODS!) public static void HeapSort (int] A) { } b) What is the worst case runtime for the standard HeapSort algorithm? What is the Space Complexity inthe worst case. c) What is the best case runtime for the standard HeapSort algorithm? What is the Space Complexity

2. Write the following equations using index notation and the summation convention, where standard notation is used for scalars and vectors. (a) (ab) (b. c) X (b) ab (a b)c (c) a (b c) . x y .

s.

1. Write the standard notation for this ion. 2. How is this standard notation different from the standard notation for Se 3. Explain what happens in the atom when this ion forms. Edit View Insert Format Tools Table 12pt Paragraph BIUA 2 T

Hailey Maendele Greater vs. Times Greater, Scientific Notation Sep 13, 5:14:06 PM How much greater is 8.9times 10^(8) than 1.6times 10^(6) ? Express your answer using either standard notation or scientific notation.

Heapsort Use the Heapsort algorithm to sort the following array in an ascending order. 83,59,44,32,39, 7, 12, 21,9 Use the table below to show the array after each Step. The table Provied below is for convenience not indicating How many steps the heapsort algorith Woula generute.

5. (7 points). Proof by asymptotic definition Use the definition of the asymptotic notation small o to prove the following Let p(n) an. where a 0, be a degreed polynomial in , and let k be a constant. Use the definitions of the asymptotic notations to prove the following properties. If k d, then p(n) o(nk).

Solve the following recurrence using A Iteration method, then express the result in asymptotic notation. T(n)n3 T(n3) B Recursion Tree method, then express the result in asymptotic notation . T(n) 4T(n2)

Sort the following Array using Merge Sort. Show all steps and also write the Complexity. [45, 7, 19, 2, 6, 50, 37, 69, 18, 2] 2.Discuss Asymptotic Notation (Big-Oh, Big-Omega, Big-Theta), with examples. Give Graph of each Asymptotic Notation

Problem 4. Asymptotic Notation Prove or disprove the following statements. (1) 4n25n2022 N(n). (2) n log10 n w(n) (3) 2n 4n 0(22m). (4) n log (n) O(n) e(n log10(n)). (5) n log (log3 n) N(n). (6) n2n O(22).

You have learned the algorithm of bucket sort in a lecture, where elements in a same bucket are sorted by the insertion sort. What is the worst-case time complexity of this bucket sort algorithm? Revise the algorithm to improve the worst-case time complexity. Briefly describe your design

write a code to bucket sort a n array of strings in c [lexicographic sort using bucket sort]( use only bucket sorting technique) ex: input: tea cofee zebra lion lead output: (sorted array of strings) cofee lead lion tea zebra

I need to write an easy C++ program of bucket sort program and works clearly

i. Practical Uses of Bucket Sort (Uniform Keys) Sorting Algorithm. ii. Attributes of the Bucket Sort (Uniform Keys) Sorting Algorithm and their explanation (eg. adaptability, offline/online etc.)

i want a bucket sort code in Java for random array

(a) Illustrate the operation of bucket sort on array A by showing the final array B of sorted buckets. A (0.88, 0.23, 0.25, 0.74, 0.18, 0.02, 0.69, 0.56, 0.57, 0.49) (b) Explain the worstcase running time for bucket sort. (c) What tweak to bucket sort would make its worstcase running time asymptotically better Why is bucket sort not defined that