Here is the list of 40 activities to make a network diagram and network table for your stats, operation research or project management assignments or final projects.
He is a head of Hill hawks adventure club. Answer: In Pakistan, All Cement Manufacturing Association Which Consist of 29 Firms set monthly meetings where they decide which price is to be set according to the economic factors. ACMA …. What Is Population The population is a summation of all the organisms of the same group or species living in a specific area. What is Economic Growth Economic growth refers to growth in all the basic variables of the economy of any country e.
In other words, it is …. How Brando Wears set up the pricing strategy? Brando wears checks on the market value of the material required to make the product. While some costs are fixed. For example, if we are manufacturing a pant. We are now looking for the new design and manufacture of engines. Presently, our range is gone for the rural, development, modern, control age, and material …. How pricing was set in your organisation?
Ans: Firstly, the taxes were finalised with the government by the legal advisers of …. The use of drugs among youngsters is very common nowadays. The young generation is the worst victim of drug addiction. The effects of drugs are extremely harmful.
They gradually fade away the sanity of a person. Curiosities, desire for pleasure, social excommunication, mental gap, lack of self-reliance are some of the reasons why youngsters became …. Price Setting Mechanism Market information is gathered by marketers on a daily basis from ongoing projects, retail shops, cement plants, and other sales representatives. After having a detailed assessment, knowing the competitors, brand position, local home market, and future prospects a proposal is made and sent to line managers.
The line managers compare it with …. However internet has been the most popular innovation in the history of mankind. In the beginning this was the most useful and revolutionary invention in the field of technology. But with the passage of time its use to …. I did O Levels from National Defense School in and recently appeared in A level from the same prestigious institute.Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4? Steps of Divide and Conquer approach Select one: a.
Divide, Conquer and Combine Correct b. Combine, Conquer and Divide c.
Combine, Divide and Conquer d. The complexity of searching an element from a set of n elements using Binary search algorithm is Select one: a. O n2 Incorrect d. In the development of dynamic programming the value of an optimal solution is computed in Select one: a. Top up fashion b. Bottom up fashion Correct c. If length of the rod is 8 and the values of different pieces are given as following, then the maximum obtainable value is 22 by cutting in two pieces of lengths 2 and 6.
O n2 Correct d. Select one: a. Case 3 b. Case 1 c. Iterative b. Recursive Correct c. Parallel d. O n2 Incorrect c. The running time of quick sort depends on the selection of. Selection of pivot elements Correct b. Number of input c. Number of passes d. Arrangements of the elements Show Answer Feedback The correct answer is: Selection of pivot elements Probability n! Probability n2 Incorrect d.
Which of the following sorting algorithms does not have a worst case running time of O n2? Quick sort b. Merge sort c. Insertion sort d. Merge Sort divides the list in Select one: a. N equal parts Incorrect b. Two equal parts c. Two parts, may not be equal d. Time complexity of matrix chain multiplication Select one: a. O nlogn Incorrect d.
DAA Interview Questions and Answers
Insertion sort Correct d. Run Time of Merge Sort is Select one: a.Which of the following sorting algorithms does not have a worst case running time of O n2?
Select one: a. Bubble sort b. Quick sort c. Merge sort — d. Insertion sort. Time Complexity of Optimal binary search tree. O logn — c. Time complexity of matrix chain multiplication Select one: a. O nlogn. Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?
Omega of N log N b. Gamma of n log N c.
Theta of N log N — d. Case 2 b. Case 3 c. Case 1 Merge Sort divides the list in Select one: a. Two equal parts — b. N equal parts c. N parts, may not be equal d. Parallel b. Recursive — c. Random d. Time complexities of three algorithms are given. Which should execute the slowest for large values of N? Probability n2 c. Probability n d. Probability n! In the development of dynamic programming the value of an optimal solution is computed in Select one: a. In any way b. Top up fashion c.
Bottom up fashion —. In dynamic programming, the output to stage n become the input to Select one: a.The assignment problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows:. If the numbers of agents and tasks are equal, then the problem is called balanced assignment.
Otherwise, it is called unbalanced assignment. Commonly, when speaking of the assignment problem without any additional qualification, then the linear balanced assignment problem is meant.
Suppose that a taxi firm has three taxis the agents available, and three customers the tasks wishing to be picked up as soon as possible. The firm prides itself on speedy pickups, so for each taxi the "cost" of picking up a particular customer will depend on the time taken for the taxi to reach the pickup point.
This is a balanced assignment problem. Its solution is whichever combination of taxis and customers results in the least total cost. Now, suppose that there are four taxis available, but still only three customers. This is an unbalanced assignment problem. One way to solve it is to invent a fourth dummy task, perhaps called "sitting still doing nothing", with a cost of 0 for the taxi assigned to it.
This reduces the problem to a balanced assignment problem, which can then be solved in the usual way and still give the best solution to the problem. Similar adjustments can be done in order to allow more tasks than agents, tasks to which multiple agents must be assigned for instance, a group of more customers than will fit in one taxior maximizing profit rather than minimizing cost. Usually the weight function is viewed as a square real-valued matrix Cso that the cost function is written down as:.
The problem is "linear" because the cost function to be optimized as well as all the constraints contain only linear terms. A naive solution for the assignment problem is to check all the assignments and calculate the cost of each one.
This may be very inefficient since, with n agents and n tasks, there are n! Fortunately, there are many algorithms for solving the problem in time polynomial in n. The assignment problem is a special case of the transportation problemwhich is a special case of the minimum cost flow problemwhich in turn is a special case of a linear program.
While it is possible to solve any of these problems using the simplex algorithmeach specialization has more efficient algorithms designed to take advantage of its special structure.
In the balanced assignment problem, both parts of the bipartite graph have the same number of vertices, denoted by n. One of the first polynomial-time algorithms for balanced assignment was the Hungarian algorithm. This is currently the fastest run-time of a strongly polynomial algorithm for this problem. In addition to the global methods, there are local methods which are based on finding local updates rather than full augmenting paths.
These methods have worse asymptotic runtime guarantees, but they often work better in practice. These algorithms are called auction algorithmspush-relabel algorithms, or preflow-push algorithms. Some of these algorithms were shown to be equivalent. Some of the local methods assume that the graph admits a perfect matching ; if this is not the case, then some of these methods might run forever. These weights should exceed the weights of all existing matchings, to prevent appearance of artificial edges in the possible solution.
As shown by Mulmuley, Vazirani and Vazirani,  the problem of minimum weight perfect matching is converted to finding minors in the adjacency matrix of a graph. There is also a constant s which is at most the maximum cardinality of a matching in the graph.
The goal is to find a minimum-cost matching of size exactly s. The most common case is the case in which the graph admits a one-sided-perfect matching i. Unbalanced assignment can be reduced to a balanced assignment.
A more efficient reduction is called the doubling technique. Here, a new graph G' is built from two copies of the original graph G : a forward copy Gf and a backward copy Gb. Between the copies, we need to add two kinds of linking edges:  : 4—6. A minimum-cost perfect matching in this graph must consist of minimum-cost maximum-cardinality matchings in Gf and Gb.Students are advised to submit assignment on submit mbchandak.
Assignment 3: For students with roll numbers 41, 46, 51, 56 : Date of presentation: Jan Java Implementation of any application based on Prims Algorithm. Points to be discussed in presentation: i Application ii Methods Descriptions iii Code execution iv Complexity v Data structures used in design.
If any one city is considered as source, implement single source shortest path algorithm. Comment on complexity and two type of paths between source and destination. Direct path and Indirect path. Date of Presentation Jan Assignment 5 : For students with roll numbers: 42, 47, 52, 57 : Implement all sorting algorithm discussed in class.
Discuss the complexity equation of each algorithm. Create a dynamic array and dynamic memory structure and demonstrate how Binary search can be used in Real Time Systems.
Date of Presentation: Jan Class Assignment Max. Assignment 7: For students with roll numbers: 43,48,53,58 :Write program for string editing and discuss method to justify the cost of editing.
Also apply the method on the matrix and justify the cost of editing. Assignment 8: For students with roll numbers: 5,10,15, Implement assignment 4 for All pair shortest path algorithm. Assignment 9: Class problem for roll numbers [Last date of submission 11th April Hard copy]. Assignment For all students: assignment2.
Note for assignments: If any of roll numbers is not in existence, student with next roll number will be part of group. Your email address will not be published. Save my name, email, and website in this browser for the next time I comment. Leave a Reply Cancel reply Your email address will not be published. Last Galeries.GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.Understanding Assignment Questions MBA - Massey University
Work fast with our official CLI. Learn more. If nothing happens, download GitHub Desktop and try again. If nothing happens, download Xcode and try again. If nothing happens, download the GitHub extension for Visual Studio and try again. We use optional third-party analytics cookies to understand how you use GitHub. You can always update your selection by clicking Cookie Preferences at the bottom of the page.
For more information, see our Privacy Statement. We use essential cookies to perform essential website functions, e. We use analytics cookies to understand how you use our websites so we can make them better, e. Skip to content. Design and Analysis of Algorithm 0 stars 0 forks. Dismiss Join GitHub today GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together. Sign up.
Go back. Launching Xcode If nothing happens, download Xcode and try again. Latest commit. Git stats 13 commits. Failed to load latest commit information.The name 'Algorithm' refers to the sequence of instruction that must be followed to clarify a problem. The logical description of the instructions which may be executed to perform an essential function. Algorithms are usually generated independent of primary languagesi. The time complexity of an algorithm denoted the total time needed by the program to run to completion.
It is generally expressed by using the big O notation. In bubble sort technique the list is split into two sub-lists sorted and unsorted. The smallest component is bubbled from unsorted sub-list. After moving the smallest component, the imaginary wall moves one element ahead. The bubble sort was initially written to bubble up the highest item in the list.
This technique is simple to understand but time-consuming. In this type, two successive components are compared, and swapping is done. Thus, step-by-step entire array items are checked, given a list of 'n' elements the bubble sort needed up to n-1 passes to sort the record. In selection sort, the list is split into two sub-lists sorted and unsorted. These two lists are split by an imaginary wall. We find the smallest item from unsorted sub-list and swap it to the starting. And the wall moves one item ahead, as the sorted file is increases and an unsorted file is decreased.
Assume that we have a file on n elements. By applying a selection sort, the first item is compared with all remaining n-1 elements. The smallest item is placed at the first location.
Again, the second item is compared with the remaining n-1 elements. At the time of the comparison, the smaller item is swapped with a bigger item. Similarly, the entire array is checked for smallest component, and then swapping is done accordingly.
Here we need n-1 passes or repetition to rearrange the data completely. Quicksort is based on division. It is also called a partition exchange sorting.
The basic concept of quick sort method is to pick one item from an array and rearranges the remaining item around it. This element split the main list into two sublists.
This chosen item is known as a pivot.
Once the pivot is selected, then it shifts all the components less than pivot to the left of value pivot, and all the items higher than the pivot are shifted to the right side. This process of choosing pivot and division the list is tested recursively until sub-lists consisting of only one element. An NP-Complete problem is a problem in NP that is as difficult as any other trouble in this class because any other dispute in NP can be decreased to it in Polynomial-time.
Time Efficiency measured by estimate the number of times the essential algorithms functions are executed. Space Efficiency is measured by calculating the number of additional memory units consumed by the algorithm.
The order of algorithm is standard documentation of an algorithm that has been developed to represent a task that bound the estimated time for algorithms. The order of an algorithm is a method of defining its efficiency.