Algorithms Questions and Answers May 25, 2018

Problem 5 Run one iteration of FloydWarshall algorithm on the graph presented in Figure. 5 8 4 5

a b (b) d (d) b d,3. (15) Apply FloydWarshall algorithm to find transitive closure of the following digraph. 1) Give its adjacency matrix 2) Show the intermediate digraph for each iteration of the algorithm (see next page). (a) d (b)

For the All paired shortest path problem assess the trade-offs/advantages of using Bellman-Ford, DAG-Shortest-Paths, Dijkstra and Floyd-Warshall algorithms (some repeatedly).

Order the following steps in problem solving A. Execute solution (B) identify the root cause (C) understand the situation (D) develop and action plan A, B, C, D B, C, D, A OC, B, D, A OD, A, B, C Question 5 (5 points) Retake question Which statement about computational thinking is TRUE It describes human use of computer hardware and software in

Give an example of how you think people in each of the following occupations think computationally: a. mathematician; b. scientist;

Exercise 4(2 Marks) Solve the following computational thinking problems using data collection. Problem Predict customer behavior Measure student performance Data

Question 1 What are the core concepts of Computational Thinking Explain each concept with example. Points 25 Question 2 Give two examples of your life activities where you can apply Computational thinking explain steps involved in detail. Points 25

A successful computer science teaching strategy must include diversity inclusion fun games computational thinking diversity inclusion computational thinking strict discipline reading writing and

1.What is computational thinking? 2. How can you show computational thinking skills outside of class (not class-related, not involving calculation)? Give an example of how you can show computational thinking skills that is not class-related, and does not involve calculation.

22. FILE Big Orange Trucking is designing an information system for use in incab communications. It must summarize data from eight sites throughout a region to describe typical conditions. Compute an appropriate measure of central location for the variables wind direction, temperature, and pavement.

Write a Java program to simulate a simple vending machine. Name the java program as VendingMachine.java.

Conduct research on and discuss new trends and research in parallel processing.

Parallel processing describes a computer operation in which Select one: a. program instructions are queued up for processing on a single core or CPU. b. a single program instruction is executed on several cores. c. program instructions are sent to multiple computers for processing. d. several program instructions are carried out simultaneously.

What are the challenges of creating Programs. panallel processing?

What is parallel processing and its advantages?

What is parallel processing?

parallel processing ________ select one: a. is used by supercomputers for applications such as weather forecasting b. divides a problem into portions c. requires special software d. all of the above

Pam takes her truck in for basic service. The service agent says a few extra repairs are also needed, so Pam adds the cost of those repairs in her head, rounding to the nearest $10. The costs are as follows: Wheel alignment: $110 Transmission fluid flush: $75 Cabin air filter: $23 What is her total estimate for the repairs?

Explain the question in detail, provide examples and draw pictures for explanation if required. What are the challenges of parallel processing?

What are some of the cost and concerns with "Parallel Processing"?

Explain how the use of parallel processing improves speed. (10 marks)

Parallel processing involves one processing core working on two subtasks of a problem at the same time two or more processor cores taking turns to complete a subtask, each working while the other rests two or more processor cores, each solving the same problem themselves in its entirety, then comparing the answers to ensure accuracy none of the

Which parallel-processing approach applies the same program to multiple data sets using multiple ALUs? A. Decode processing B. Pipelining processing C. Synchronous processing D. Tandem processing E. Transfer processing

Question 5 (5 points) What is the difference between concurrent processing and parallel processing

Qo Clock D FFO CLK Q Q MUX D FF1 CLK Q Parallel Data Input Q MUX D FF2 CLK Q Q3 MUX D FF3 CLK Serial Out

Parallel processing is one advantage of _ _ _ _ _ .

Explain the following under achieving Parallel processing: i. Multiplicity of functional units; ii. Parallelism and pipelining within the CPU; iii. Overlapped CPU and input /output operations; iv. The use of a hierarchical memory system; v. Balancing of subsystem bandwidths; and vi. Multiprogramming and time sharing.

Define Parallel Processing. Describe TWO(2) main difficulties in Parallel Processing. [4 marks]

Question 3 (a) The concept of parallel processing came about to improve the speed of CPU performance. Parallel processing implies the simultaneous processing of information. What is the purpose of further using to provide simultaneous data processing tasks 10 marks (b) Explain the following under achieving Parallel processing i. Multiplicity of

Differentiate between parallel processing, concurrent processing and distributed processing.

Parallel processing is becoming possible on a widespread basis because of the advent of multithreading programming. What are some scenarios where parallel processing will really be important? my son, who owns a Hollywood post-production company, is working on parallel processing right now.

Describe what is meant by parallel processing in the visual system?

Briefly describe why parallelizing sequential algorithms is challenging and thus why the full processing power of the fastest supercomputers is underutilized. - 6 points.

Difference between parallel processing and pipeline processing?

QUESTION 7 a) Parallel processing improves the performance of computer applications. Describe with an example how these computing criteria benefit parallel architectures and programming models. Criteria Software portability Variety of available methods of communication Immediate or realtime response Description b) Describe the different types of

_______ algorithms improve system performance and allow for multiple operations to be performed simultaneously on a single computer - parallelor- distributed

Can it be said that, for any processing tool, parallel processing can always be reduced to sequential processing, independently of any efficiency considerations?

What differentiates parallel processing from serial processing?

A collection of connected computers work together on a common task is know as a . Distributed computing b . Quantum computing c . Machine learning d . Cloud computing

We already gave some examples of distributed pervasive systems: home systems. Electronic health-care systems and sensor networks. Extend this list with more examples.

Activity 1 Distributed Computing During the week six lecture, we discussed several new terms and concepts. Based on what you have learnt, answer the following questions. 1. Briefly describe scaleout, scaleup, their differences, and their use cases. 2. Provide concrete definitions and examples of the following termsconcepts and provide an

Q.1 An organization decided to develop and use distributed computing system. Evaluate the impact in the operations if Global Clock and Shared Memory are absent in this computing system. Provide example scenarios and propose suitable solutions.

Distributed computing is for (a) Resource sharing; (b) Fault-tolerance; (c) Computing speed; (d) Green computing?

Construct a computing system that will succeed using (i) a centralized architecture (ii) a distributed architecture, use real life examples.

Do some research on distributed computing. Find an application that uses distributed computing and write a paragraph about the application.

What is distributed computing? 1) a collection of large, complex data sets, including structured and unstructured data, which cannot be analyzed using traditional database methods and tools 2) processes and manages algorithms across many machines in a computing environment 3) focuses on forecasting future trends and producing insights using

Page view AV Read aloud Add notes 1. What are the main features of distributed systems How do we benefit from distributed computing (5 points)

Analyse in what respect are distributed computing systems better than parallel processing systems?

Parallelism: Rewrite the following sentences to achieve parallel construction. EXAMPLE: XYZ Corporation Stock Increased Profits Increased Expenses Decrease Expanding Markets XYZ Corporation Stock Increased: Profits Increased Expenses Decreased Markets Expanded 1. Your goal should be to write business messages that are concise, clear, and

Parallelism is a general paradigm that is used throughout modern computer architectures. Give one example of a use of parallelism within each of the following: the IO BUS, and memory?

In the context of a CPU, what does parallelism refer to ? Group of answer choices Processing multiple instructions concurrently by having them in different stages of completion at the same time Avoiding hazards during instruction execution Using a washer - dryer combination in the laundry room Increasing the clock rate of the CPU.

Why the identified parallelism is adopted ?? I hope that I'll get a good reason , my question is in term of parallel computing?

Divide and Conquer algorithms 1. Introduction to the real-worldDivide and Conquer 2. Brief description about the algorithm(Divide and Conque) 3. Algorithm 4. Analysis of the algorithm 5. Conclusion.

Give an example that divide-and-conquer approach is not good?

Assume you are working in development company, and you are part of a new committee to achieve a complicated task. You want to convince the committee chief to use Divide and Conquer algorithm to achieve the task. Analysis divide and conquer algorithm, and provide two examples with explanation? (5Marks)

Heuristics are useful in that they allow us to: Group of answer choices make the correct judgment and decisions 100% of the time form stereotypes form decisions and judgments quickly using less mental effort think better?

If we apply the FloydWarshall algorithm for the given graph, what wwwww kind of output will we get (Only Ds will be calculated. 2

Using the Floyd-Warshall Algorithm describe how you would determine if the graph has a negative weight Cycle. Explain your answer in detail?

Under the accrual method of accounting, when should revenue be recognized by a electric supply store that sells to contractors on account. Group of answer choices when the customer has control of the goods and payment is assured when the customer is invoiced for the goods when the customer orders the goods when the customer pays for the goods

define a Python function def construct_grid(params). The input params will be a dictionary mapping strings to arrays (or array-like data structures such as lists). Consider each string a parameter name and each value in the corresponding array to be a candidate value for that parameter. The function should return a list of dictionaries which

Define a new Python function smoothing(ts, alpha) to implement simple exponential smoothing. The input ts will be a 1-D numerical array (the vector x from the formula above), and the input alpha (the scalar from the formula above) will be a floating point number between 0 and 1. n the math notation xt is ts[t], and $\hat{x_t}$ is our prediction

I'm not sure why for the second function I get this output. Why is it printing 11, 7,5,3,2 def rp2( L, i ): if i < len(L): rp2( L, i+1 ) print(L[i], end=' ') else: print() L = [ 2, 3, 5, 7, 11 ] rp2(L,0).

Build a max heap using the following data 10. 16 8 21 35 45 42 39 81 68

Given the class definitions below, complete the code for the empty, swap and push functions.( thats Heap. Binary Heap. in data structure class by using c++) #include #include using namespace std; class heapType{ public: bool empty(); void push(int num); heapType(); private: int C1I; int C2I; int CI; int done; // status flag int EOL; // end of line

package datastructures; public class MinIntHeap implements IntHeap{ private int[] data; //contains the actual data private int size; //contains the size of the heap static final int DEFAULT_CAPACITY = 10; //the default capacity of a new heap //Creates a new empty heap of capacity at default size public MinIntHeap(){ this(DEFAULT_CAPACITY); }

write the class MaxIntHeap which implements the IntHeap interface. This should be a max heap of integers. 1. Begin by writing the basic constructor and implementing the 5 necessary methods, along with any needed helper methods. Use the MinIntHeap we did in class as a model. 2. Write the method public String toString() which prints the heap

Modify your min-heap that stores arbitrary structs Using C language Create 2 files: min_heap.c and min_heap.h

To create a minheap that can sort any datatype, well utilize void and function pointers. Heap CreateHeap(void data, int numelems, int (Compare)(void, void)) returns an empty heap H that is set up to store at most n elements. This operation takes O(N) time, as it involves initializing the array that will hold the heap. void Insert(Heap heap, int

Include the Best case, Average case, and Worst case scenario of adding/removing, deleting/inserting at the beginning, middle, and end, including searching and sorting 1, Sets 2, Maps 3, Heaps thank you

Using C: Implement a binary MinHeap structure in an array with Insert and Delete operation functions. Print the elements of the heap. Only needs to handle integers.

Consider the following program and describe how the data is managed in terms of stack and heap memory:

include double multiplyByTwo (double input) double twice input 2.0 return twice int main (int argc, char argv) int age 30 double salary 12345.67 double myList3 1.2, 2.3, 3.4 printf(double your salary is .3f , multiplyByTwo (salary)) return 0

(a) List all structures that are both heaps and binary search trees. Assume that all elements of the structures have different values. (b) Use the linear-time heap creation algorithm to create a heap out of the following keys: 10 12 1 14 6 5 (c) Consider that you have a class named Heap that preserves a heap of integers using an array of int -

Using this structure as a start and following the standard procedure to add an element to a heap, insert the values 24, 91, 55, 81, and 83. Show the structure of the tree and the values in each node after each insertion.

Considering a program that uses a data structure such as a linked-list where elements are dynamically created in memory and deleted when finished to return the memory. The elements or variables are examples of ( a. Static b. Stack dynamic c. Explicit Heap Dynamic d. Implicit Heap Dynamic

4. Given the following data: 76, 50, 40, 45, 10, 30, 39, 42 a) Draw a Heap and check if this Is Max Heap or Min Heap? (5 pts) b) Now illustrate by using array notation (use the table given below) (Must use the table, and not tree) to add V = 69 into this array, and still maintain the property of the data structure. (10 pts) I Algorithm Explanation

Data structure algorithm(code by C Language) this is heap.c file please give me some example code each of function(findheap, insertheap)

Bint findDepth(HEAP h) printf(Error No heap exists. n) 0 Evoid insertNode(HEAP h, int value) printf(Error No heap exists. n)

Write a heap template using the array-based format. You can make it function either a minheap or maxheap -- your choice. If you need a quick refresher on how array-based heaps work, review Chapter 17.2 in the book, pp. 519 - 528. A template file myHeap.h is included in this module to help you get started. You are not required to use this template

Discuss with suitable illustration how heaps can be used in memory management.

(a)Consider storing a heap as a linked binary tree with pointers. Give pseudocode on how you would store a heap node (b) Now consider storing a heap as a linked list with pointers. Give pseudo-code on how you would store a heap node

Match the following: 1. instructions a. Heap section 2. Global and Static data b. Stack section 3. Function call invocations c. Data section 4. Dynamic Allocation d. Text section A. 1-d , 2-c, 3-b, 4-a B. 1-c, 2-d, 3-b, 4-a C. 1-b, 2-a, 3-c, 4-d D. 1-a, 2-b, 3-d, 4-c

how heaps can be implemented using an array. In this problem we consider using an implementation using pointers. (a) Consider storing a heap as a linked binary tree with pointers. Give pseudo code on how you would store a heap node, and which modifications you need to make to the heap routines that we discussed in class. What are the runtimes of

According to class material, what type of data should be put on the heap? (a) Data on the run-time stack (b) A large data set (c) A data set of size not known until run time (d) Data that needs to remain after the execution of the function that created it has ceased (e) Data in global variables (f) Data in local variables of functions (g) None of

Solution in C++ Write an iterative version of the heapsort. Your solution should not declare any secondary data structures.

A max-heap is a data structure wherein each nodes value is larger than both of its children. A max-heap is stored in an array and can also be logically represented by a complete binary tree. We showed two ways to build a max-heap. One is to assume the array is empty and to insert the values one by one. The other is to assume the values are already

Code this on matlab! use this skeleton given to us ! Thanks!

3 Binary Heap minHeap We will now work with another data structure, called a binary heap. Our implementation of the binary heap will be considered a min heap. A min heap uses the binary tree structure with parents having lower values than their two children. Jargon This section is a general introduction to the binary heap and the jargon that we

In operating system terminology (and not in data structure terminology) what is heap and what is stack?

In C++ Write an iterative version of the heapsort. Your solution should not declare any secondary data structures.

What does the min-heap data structure look like after the following steps (A = add, R = remove)? A(50), A(30), A(22), A(1), A(101), A(15), R, R, A(6), A(18), R, R, A(22)

Implement min-heap data structure named as MinHeap for maintaining a list of integer keys with the following methods: void insert(int val); // inserts an element into heap int getMin(); // retrieves the minimum element int removeMin(); // retrieves and removes the minimum element int getSize(); // returns the number of elements in heap

trees based data structure [85,25,32,8,97,61,77,52,14,10,69,87] create graphical & list view of min heap tree and max heap tree

What precautions and strategies should be considered to address the potential impact of synthetic media on public perception as it will become even more difficult to tell apart what is real and fake

What is a heap? What are the different types of cases to consider when deleting the node from a heap?How do you insert a new node into a heap?

Implement a novel data structure - The heap must satisfy the heap property. Every parent node in the heap must have 2^x children. The value of x must be a parameter of the heaps constructor. The heap must implement an insert method. The heap must implement a pop max method. The heap must be implemented in Java. The heap must be performant. You

What an instance of the data structure looks like(e.g. how a heap is organized) What are the rules/properties for that data structure (e.g. the properties that describe a valid heap) The main operations that are applied to that data structure, as part of the interface(e.g. "insert" and "deleteMax" are the primary operations of a priority queue) A

A min heap is a special type of binary tree with two essential properties: The values in each node are smaller than all of their children nodes, The binary tree is complete; all of the levels in the tree are full except possibly the lowest level of the tree, which is filled in from left to right. What is a heap good for? It is a very good data

12 18 5 9 8 3 59 68 20 10 12 18 9 1 2 3 4 5 6 7 8 9 10 20) 10

1. Build a binary search tree from the following data set and the perform pre-order, post-order, and in-order traversal of the tree 89, 0, 45, 89, 98, 78, 100, 56 2. [Heap] a) Build a heap from the following data set 89, 0, 45, 89, 98, 78, 100, 56 b) Suppose we need to store the heap constructed above in an arraylist of Integers. Show how data

Using the ERD you created in Task 1, develop a create.sql file that will create a database named grubhub. Using the grubhub database, include statements in your file to create all the entities, attributes and primary and foreign key constraints detailed in your ERD. O Make sure to end each statement with a semicolon () O The creation scripts we

Data Structure For the following max-heap, simulate the deformation of each operation sequence: Insert 50, Insert 82, Insert 32, Delete max, Delete max.

(27) (54) 36 72 (63) (45) (61)

20. Which data structure is used to store elements in a sorted order? a. Stack b. Queue c. Tree d. Heap

The table below contains the list of system calls you will make as well as related header files that contain the declarations. In addition, there are some notes on how the output needs to be formatted for the utility. For sample data, see the screen captures above. Information Current Date Current Time Last reboot processors configured

Find the approximate number of messages (n) that need to be tried before finding two that had the same message digest (size k) with probability 0.8. You need to find n as a function of k. What is n when k 2256

Express the following numbers to three significant digits in the eformat. Use one number to the left of the decimal and two to the right. 0.001605 0.000013987 407 33750 40