assignment work available dp

Academic Assignment Writing Jobs Let Enjoy Freedom

Monetize your time and efforts

• WritingCreek is a freelance academic writing company which can offer you a trustworthy long-term cooperation.
• A simple application process, continuous career growth, a wide range of disciplines and subjects, are among the benefits of WritingCreek

Get decent freelance job

Simple application process.

Begin earning money in 3 days!

We believe you have all it takes

• Excellent communication skills
• Proficiency in the particular area of study
• Ability to conduct a research
• Original content writing
• Advanced level of English

Continuous career growth

Earn from $ 4 - 12 per page

• 1+ completed orders
• 5+ completed orders
• 80% + Success Rate
• 30+ completed orders
• 90% + Success Rate
• 50+ completed orders
• 95% + Success Rate

Reveal your skillset in academic writing

• Humanities 0 %
• Applied sciences 0 %
• Social sciences 0 %
• Formal sciences 0 %
• Natural sciences 0 %
• Other academic fields 0 %

Share of orders in the system for this branch of science

Some of the latest orders

Find the one that fits your expertise

You must have heard plenty of times about perks of specific jobs allowing to work without leaving your house on a permanent basis. They are true. Freelance occupation lets:

Determine your workload yourself. Due to this factor, you will not face the extreme fatigue when any amount of money for one more task doesn’t represent any interest because all you want to do is to fall asleep for a couple of days. With freelance writing jobs online, you are your own boss. You know how many regular duties you need to fulfill. You know how much time you need to devote to your significant other, your family, friends, hobby, sports, sleep, healthy lifestyle, etc. You are fully aware of how much time you need to spend on anything else but work to be happy. And only you can determine the golden middle!

Set the working hours. Striving to optimization of working process, you can set the hours when you feel like working most of all to focus on your tasks easier. When you have chosen one of the freelance writing jobs online , you are free to set the working hours. It is a very useful prerogative! You don’t have to ask if you can go home earlier today because you need to take your child from school or because you have a competition. You don’t need to provide explanations for being late for 15 minutes at the beginning of the day. You are the boss. Being one of the essay writers or those who accepted an offer of grant writing jobs, you become independent.

Choose tasks yourself. Having joined the team of freelance writers, you are given an opportunity to select your assignments: take the one you like and reject the one that seems not your cup of tea. You will no longer have to deal with a bundle of tasks you’d wish to burn. Freelance writing jobs give you a chance deal only with the tasks that are of interest to you. Thus, you will easily boost your knowledge and skills in professional sphere.

Such is a kind of position we gladly offer to experts in the wide variety of spheres:

• Human and social sciences. We invite for collaboration experts in Sociology, Psychology, Arts, Political science, Economics, Law, Management, Journalism, Pedagogics, Philosophy, Aesthetics, Linguistics, Law, and many other areas belonging to this group. On our website, you will find grant writing jobs to make use of your knowledge.
• Natural sciences. We are looking for freelance writers in Biology, Physics, Chemistry, Geology, Geography, Ecology, and Astronomy. If you have in-depth knowledge in Quantum or Cell biology, Space physics, or Nuclear chemistry (just as well as the rest of domains), and are looking for a position that gives you freedom in organizing your working hours – choose freelance writing jobs at biz.
• Technical studies. We are looking for specialists in Engineering, Informatics, Transport, Telecommunication, Architecture, Technology, Avionics, Food manufacturing industry, Computer science, Electronics, etc. We assume, we need writers specialized in any area of listed studies. Taking grant writing jobs at our website, you take your chance for independence. On our list, we include both the most common and the rarest spheres: from Radio electronics, Electrical engineering, and Modern architecture to Space syntax, Biological engineering, and Sumerian architecture.
• Exact studies. The connoisseurs of this group are always in high demand: due to the difficulties with assignments related to the subjects of this kind, every second student is looking for assistance with exact studies. Choose our freelance writing jobs! Make use of favorable terms of collaboration with a trustworthy website. Freelance experts in Algebra, Mathematical analysis, Geometry, Accounting, Trigonometry, Calculus, Discrete math, and Algorithms, welcome to biz.

Are you still hesitating? It’s high time to speed up your success with freelance writing.

You need to Log in or Sign up for a new account in order to create account

Please enter your email to proceed

By clicking "Continue", you agree to our terms of service and privacy policy. We`ll occasionally send you promo and account related emails.

6 Dynamic Programming problems and solutions for your next coding interview

The Educative Team

Dev Learning Daily

This article is based on Grokking Dynamic Programming Patterns for Coding Interviews , an interactive interview preparation course for developers. If you’ve gotten some value from this article, check out the course for many more problems and solutions like these.

A lot of programmers dread dynamic programming (DP) questions in their coding interviews. It’s easy to understand why. They’re hard!

For one, dynamic programming algorithms aren’t an easy concept to wrap your head around. Any expert developer will tell you that DP mastery involves lots of practice. It also requires an ability to break a problem down into multiple components, and combine them to get the solution.

Another part of the frustration also involves deciding whether or not to use DP to solve these problems. Most problems have more than one solution. How do you figure out the right approach? Memoize or recurse? Top-down or bottom-up?

So, we’ll unwrap some of the more common DP problems you’re likely to encounter in an interview, present a basic (or brute-force) solution, then offer one DP technique (written in Java) to solve each problem. You’ll be able to compare and contrast the approaches, to get a full understanding of the problem and learn the optimal solutions.

Sound good? Let’s go.

0–1 Knapsack Problem

Given the weights and profits of ’N’ items, put these items in a knapsack which has a capacity ‘C’. Your goal: get the maximum profit from the items in the knapsack. Each item can only be selected once.

A common example of this optimization problem involves which fruits in the knapsack you’d include to get maximum profit. Here’s the weight and profit of each fruit:

Items: { Apple, Orange, Banana, Melon } Weight: { 2, 3, 1, 4 } Profit: { 4, 5, 3, 7 } Knapsack capacity: 5

Let’s try to put different combinations of fruits in the knapsack, such that their total weight is not more than 5.

Apple + Orange (total weight 5) => 9 profit Apple + Banana (total weight 3) => 7 profit Orange + Banana (total weight 4) => 8 profit Banana + Melon (total weight 5) => 10 profit

This shows that Banana + Melon is the best combination, as it gives us the maximum profit and the total weight does not exceed the capacity.

The Problem:

Given two integer arrays to represent weights and profits of ’N’ items, find a subset of these items that will give us maximum profit such that their cumulative weight is not more than a given number ‘C’. Each item can only be selected once, so either you put an item in the knapsack or not.

The Simple Solution:

A basic brute force solution could be to try all combinations of the given items (as we did above), allowing us to choose the one with maximum profit and a weight that doesn’t exceed ‘C’. Take the example with four items (A, B, C, and D). To try all the combinations, the algorithm would look like:

for each item ‘i’ create a new set which includes item ‘i’ if the total weight does not exceed the capacity, and recursively process the remaining items create a new set without item ‘i’, and recursively process the remaining items return the set from the above two sets with higher profit

Here’s the code:

The time complexity of the above algorithm is exponential O(2^n), where ‘n’ represents the total number of items. This is also shown from the above recursion tree. We have a total of ‘31’ recursive calls — calculated through (2^n) + (2^n) -1, which is asymptotically equivalent to O(2^n).

The space complexity is O(n). This space is used to store the recursion stack. Since our recursive algorithm works in a depth-first fashion, we can’t have more than ‘n’ recursive calls on the call stack at any time.

One DP approach: Top-Down with Memoization

We can use an approach called memoization to overcome the overlapping sub-problems. Memoization is when we store the results of all the previously solved sub-problems and return the results from memory if we encounter a problem that’s already been solved.

Since we have two changing values (capacity and currentIndex) in our recursive function knapsackRecursive(), we can use a two-dimensional array to store the results of all the solved sub-problems. You’ll need to store results for every sub-array (i.e. for every possible index ‘i’) and for every possible capacity ‘c’.

What is the time and space complexity of the above solution? Since our memoization array dp[profits.length][capacity+1] stores the results for all the subproblems, we can conclude that we will not have more than N*C subproblems (where ’N’ is the number of items and ‘C’ is the knapsack capacity). This means that our time complexity will be O(N*C).

The above algorithm will be using O(N*C) space for the memoization array. Other than that we will use O(N) space for the recursion call-stack. So the total space complexity will be O(N*C + N), which is asymptotically equivalent to O(N*C).

Unbounded Knapsack Problem

Given the weights and profits of ’N’ items, put these items in a knapsack with a capacity ‘C’. Your goal: get the maximum profit from the items in the knapsack. The only difference between the 0/1 Knapsack problem and this problem is that we are allowed to use an unlimited quantity of an item.

Using the example from the last problem, here are the weights and profits of the fruits:

Items: { Apple, Orange, Melon } Weight: { 1, 2, 3 } Profit: { 15, 20, 50 } Knapsack capacity: 5

Try different combinations of fruits in the knapsack, such that their total weight is not more than 5.

5 Apples (total weight 5) => 75 profit 1 Apple + 2 Oranges (total weight 5) => 55 profit 2 Apples + 1 Melon (total weight 5) => 80 profit 1 Orange + 1 Melon (total weight 5) => 70 profit

2 apples + 1 melon is the best combination, as it gives us the maximum profit and the total weight does not exceed the capacity.

Given two integer arrays representing weights and profits of ’N’ items, find a subset of these items that will give us maximum profit such that their cumulative weight is not more than a given number ‘C’. You can assume an infinite supply of item quantities, so each item can be selected multiple times.

The Brute Force Solution:

A basic brute force solution could be to try all combinations of the given items to choose the one with maximum profit and a weight that doesn’t exceed ‘C’. Here’s what our algorithm will look like:

for each item ‘i’ create a new set which includes one quantity of item ‘i’ if it does not exceed the capacity, and recursively call to process all items create a new set without item ‘i’, and recursively process the remaining items return the set from the above two sets with higher profit

The only difference between the 0/1 Knapsack optimization problem and this one is that, after including the item, we recursively call to process all the items (including the current item). In 0/1 Knapsack, we recursively call to process the remaining items.

The time and space complexity of the above algorithm is exponential O(2^n), where ‘n’ represents the total number of items.

There’s a better solution!

One DP solution: Bottom-Up Programming

Let’s populate our ‘dp[][]’ array from the above solution, working in a bottom-up fashion. We want to “find the maximum profit for every sub-array and for every possible capacity”.

For every possible capacity ‘c’ (i.e., 0 <= c <= capacity), there are two options:

• Exclude the item. We will take whatever profit we get from the sub-array excluding this item: dp[index-1][c]
• Include the item if its weight is not more than the ‘c’. We’ll include its profit plus whatever profit we get from the remaining capacity: profit[index] + dp[index][c-weight[index]]

Take the maximum of the above two values:

dp[index][c] = max (dp[index-1][c], profit[index] + dp[index][c-weight[index]])

Longest Palindromic Subsequence

Given a sequence, find the length of its Longest Palindromic Subsequence (or LPS). In a palindromic subsequence, elements read the same backward and forward.

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

Input: “abdbca” Output: 5 Explanation: LPS is “abdba”.

Input: = “cddpd” Output: 3 Explanation: LPS is “ddd”.

Input: = “pqr” Output: 1 Explanation: LPS could be “p”, “q” or “r”.

A basic brute-force solution could be to try all the subsequences of the given sequence. We can start processing from the beginning and the end of the sequence. So at any step, there are two options:

• If the element at the beginning and the end are the same, we increment our count by two and make a recursive call for the remaining sequence.
• We can skip the element either from the beginning or the end to make two recursive calls for the remaining subsequence.

If option one applies, it will give us the length of LPS. Otherwise, the length of LPS will be the maximum number returned by the two recurse calls from the second option.

One DP Approach: Top-Down with Memoization

We can use an array to store the already solved subproblems.

The two changing values to our recursive function are the two indexes, startIndex and endIndex. We can then store the results of all the subproblems in a two-dimensional array.

The Fibonacci Problem

Write a function to calculate the nth Fibonacci number.

Fibonacci numbers are a series of numbers in which each number is the sum of the two preceding numbers. The first few Fibonacci numbers are 0, 1, 2, 3, 5, 8, and so on.

We can define the Fibonacci numbers as:

Fib(n) = Fib(n-1) + Fib(n-2) for n > 1 Given that: Fib(0) = 0, and Fib(1) = 1

The Basic Solution:

A basic solution could be to have a recursive implementation of the above mathematical formula.

One DP Approach: Bottom-Up

Let’s try to populate our ‘dp[]’ array from the above solution, working in a bottom-up fashion. Since every Fibonacci number is the sum of previous two numbers, we can use this fact to populate our array.

Here is the code for our bottom-up dynamic programming approach:

We can optimize the space used in our previous solution. We don’t need to store all the Fibonacci numbers up to ‘n’, since we only need two previous numbers to calculate the next Fibonacci number. We can now further improve our solution:

The above solution has time complexity of O(n) but a constant space complexity of O(1).

Longest Common Substring

Given two strings ‘s1’ and ‘s2’, find the length of the longest substring common in both the strings.

Input: s1 = “abdca” s2 = “cbda” Output: 2 Explanation: The longest common substring is “bd”.

Input: s1 = “passport” s2 = “ppsspt” Output: 3 Explanation: The longest common substring is “ssp”.

A basic brute-force solution could be to try all substrings of ‘s1’ and ‘s2’ to find the longest common one. We can start matching both the strings one character at a time, so we have two options at any step:

• If the strings have a matching character, we can recursively match for the remaining lengths and keep track of the current matching length.
• If the strings don’t match, we can start two new recursive calls by skipping one character separately from each string.

The length of the Longest common Substring (LCS) will be the maximum number returned by the three recurse calls in the above two options.

The time complexity of the above algorithm is exponential O(2^(m+n)), where ‘m’ and ’n’ are the lengths of the two input strings. The space complexity is O(n+m), this space will be used to store the recursion stack.

The three changing values to our recursive function are the two indexes (i1 and i2) and the ‘count’. Therefore, we can store the results of all subproblems in a three-dimensional array. (Another alternative could be to use a hash-table whose key would be a string (i1 + “-” i2 + “-” + count)).

Longest Common Subsequence:

Given two strings ‘s1’ and ‘s2’, find the length of the longest subsequence which is common in both the strings.

Input: s1 = “abdca” s2 = “cbda” Output: 3 Explanation: The longest substring is “bda”.

Input: s1 = “passport” s2 = “ppsspt” Output: 5 Explanation: The longest substring is “psspt”.

A basic brute-force solution could be to try all subsequences of ‘s1’ and ‘s2’ to find the longest one. We can match both the strings one character at a time. So for every index ‘i’ in ‘s1’ and ‘j’ in ‘s2’ we must choose between:

• If the character ‘s1[i]’ matches ‘s2[j]’, we can recursively match for the remaining lengths.
• If the character ‘s1[i]’ does not match ‘s2[j]’, we will start two new recursive calls by skipping one character separately from each string.

Since we want to match all the subsequences of the given two strings, we can use a two-dimensional array to store our results. The lengths of the two strings will define the size of the array’s two dimensions. So for every index ‘i’ in string ‘s1’ and ‘j’ in string ‘s2’, we can choose one of these two options:

• If the character s1[i] matches s2[j], the length of the common subsequence would be one, plus the length of the common subsequence till the ‘i-1’ and ‘j-1’ indexes in the two respective strings.
• If the character s1[i] doesn’t match s2[j], we will take the longest subsequence by either skipping ith or jth character from the respective strings.

So our recursive formula would be:

if si[i] == s2[j] dp[i][j] = 1 + dp[i-1][j-1] else dp[i][j] = max(dp[i-1)[j], dp[i][j-1])

The time and space complexity of the above algorithm is O(m*n), where ‘m’ and ’n’ are the lengths of the two input strings.

Keep Learning!

This is just a small sample of the dynamic programming concepts and problems you may encounter in a coding interview.

For more practice, including dozens more problems and solutions for each pattern, check out Grokking Dynamic Programming Patterns for Coding Interviews on Educative.

Originally published at blog.educative.io on January 15, 2019.

Written by The Educative Team

Master in-demand coding skills with Educative’s hands-on courses & tutorials.

Text to speech

Navigation Menu

Search code, repositories, users, issues, pull requests..., provide feedback.

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly.

To see all available qualifiers, see our documentation .

assignment-problem

Here are 98 public repositories matching this topic..., halemogpa / learn-js.

Elzero Web School Js Course Assignments Solutions

• Updated May 26, 2024

root-11 / graph-theory

A simple graph library

• Updated Apr 29, 2024

aalmi / HungarianAlgorithm

A Java implementation of the Kuhn–Munkres assignment algorithm (Hungarian Algorithm)

• Updated Aug 10, 2019

HalemoGPA / Learn-CSS

Elzero Web School CSS Course Assignments Solutions

• Updated Aug 11, 2024

dutta-alankar / PH-354-2019-IISc-Assignment-Problems

Solutions to the complete set of assignment problems which I did while crediting Computational Physics course by Prof. Manish Jain at IISc, Physical Sciences department on 2019

• Updated May 30, 2021

mayorx / hungarian-algorithm

(Kuhn-Munkres) numpy implementation, rectangular matrix is supported (|X| <= |Y|). 100x100000 in 0.153 s.

• Updated Dec 8, 2022

oddg / hungarian-algorithm

A Go implementation of the Hungarian algorithm

• Updated Aug 9, 2017

Gnimuc / Hungarian.jl

The Hungarian(Kuhn-Munkres) algorithm for Julia

• Updated Jan 29, 2023

phoemur / hungarian_algorithm

An implementation of the Hungarian Algorithm in C++

• Updated Dec 11, 2018

Gluttton / munkres-cpp

Generic implementation of Kuhn-Munkres (Hungarian) Algorithm in C++

• Updated Oct 14, 2023

HalemoGPA / Learn-HTML

Elzero Web School HTML Course

• Updated Sep 24, 2023

alieldeba / Elzero-Cpp-Assignments

All C++ Solutions Of Elzero Web School Channel Assignments and elzero.org Website Assignments

• Updated Aug 10, 2024

SavvyProgrammer / Exercise-6.69

This repository contains working solutions to Exercise 6.69 (a), (c), (e), (i), (o) in Schaum's Outline of Programming with C.

• Updated Apr 20, 2019

charles-haynes / munkres

Munkres algorithm for the assignment problem.

• Updated Oct 8, 2019

jundsp / Fast-Partial-Tracking

Fast partial tracking of audio with real-time capability through linear programming. Hungarian algorithm provides optimal spectral peak-to-peak matching in polynomial time.

• Updated Mar 6, 2021

aritrasep / Modolib.jl

Multi-Objective Discrete Optimization Instance Library

• Updated Feb 1, 2018

sharathadavanne / hungarian-net

Deep-learning-based implementation of the popular Hungarian algorithm that helps solve the assignment problem.

• Updated Aug 31, 2023

aarengee / hungarianJAVA

Hunagarian method implementation using javax.swing and java.awt

• Updated Jun 24, 2017

YaleDHLab / pointgrid

Transform a 2D point distribution to a hex grid to avoid overplotting in data visualizations

• Updated Jun 30, 2021

Improve this page

Add a description, image, and links to the assignment-problem topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the assignment-problem topic, visit your repo's landing page and select "manage topics."

• Stack Overflow for Teams Where developers & technologists share private knowledge with coworkers
• Advertising & Talent Reach devs & technologists worldwide about your product, service or employer brand
• OverflowAI GenAI features for Teams
• OverflowAPI Train & fine-tune LLMs
• Labs The future of collective knowledge sharing
• About the company Visit the blog

Collectives™ on Stack Overflow

Find centralized, trusted content and collaborate around the technologies you use most.

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

Get early access and see previews of new features.

Dynamic programming algorithm for assigning tasks

I'm struggling with this problem. I tried solving it via simple recursion, but the time it takes for the large cases is huge and I'd like to improve it by writing a dynamic programming algorithm.

There are n given students and n given tasks. Each student is represented by a 1d array of length n of 0 s and 1 s. A[i] == 0 means that this student can't accomplish i 'th task, and A[i] == 1 means that this student can accomplish i 'th task. The goal is to determine how many different ways there are to assign tasks to students in a way, that all tasks can be accomplished and single student completes only 1 task.

I'll appreciate any hints on how to approach this problem in a dynamic programming way.

• dynamic-programming

• Example input output for more clearer explanation? –  nice_dev Commented Sep 20, 2019 at 13:44
• 2 and what are the bounds for input? –  v78 Commented Sep 20, 2019 at 13:53
• If you will give the recursion solution I'm sure it will be simple to transfer it to a DP solution. –  Yonlif Commented Sep 20, 2019 at 15:07
• en.wikipedia.org/wiki/Knuth%27s_Algorithm_X ? –  גלעד ברקן Commented Sep 20, 2019 at 18:51

2 Answers 2

your problem really look like a matching problem with bipartite graph (Graph Theory), where a student is a node and a task is an other one (from the other ensemble). Edges represent compatibility between them. I don't have any solution in mind but you will be able to find some good stuff about matching problem and dynamic programming.

Initialisation condition is dp[0]=1 so the state of dp is (mask), where x represents that person upto x have been assigned a task which is also equal to setbits of mask, and mask is a binary number, whose each bit represents if that task has been assigned or not.

if i'th bit is not set and x'th person can do that work

Time complexity is O(N*2^N) and Space Complexity O(2^N)

Your Answer

Reminder: Answers generated by artificial intelligence tools are not allowed on Stack Overflow. Learn more

Sign up or log in

Post as a guest.

Required, but never shown

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy .

Not the answer you're looking for? Browse other questions tagged algorithm dynamic-programming or ask your own question .

• The Overflow Blog
• Scaling systems to manage all the metadata ABOUT the data
• Navigating cities of code with Norris Numbers
• Featured on Meta
• We've made changes to our Terms of Service & Privacy Policy - July 2024
• Bringing clarity to status tag usage on meta sites
• Tag hover experiment wrap-up and next steps

Hot Network Questions

• How to Vertically Join Images?
• Counter in Loop
• Should I pay off my mortgage if the cash is available?
• Why do individuals with revoked master’s/PhD degrees due to plagiarism or misconduct not return to retake them?
• Is it normal to be able to tear off PCB components with bare hands?
• Short story about a committee planning to eliminate 1 in 10 people
• Looking for a British childrens book, I think from the 1950s, called "C-for-Charlie"
• How many advancements can a Root RPG character get before running out of options to choose from in the advancement list?
• Justification for the Moral Ought
• Writing a Puzzle Book: Enigmatic Puzzles
• As a resident of a Schengen country, do I need to list every visit to other Schengen countries in my travel history in visa applications?
• A burning devil shape rises into the sky like a sun
• how to include brackets in pointform latex
• Communicate the intention to resign
• How is it decided whether a creature can survive without a head?
• Why did evolution fail to protect humans against sun?
• How much air escapes into space every day, and how long before it makes Earth air pressure too low for humans to breathe?
• Automotive Controller LDO Failures
• Language inconsistency in The Expanse
• The minimal Anti-Sudoku
• What is Causing This Phenomenon? Is it the Geometry Package?
• How are USB-C cables so thin?
• What was Jesus's relationship with God ("the father") before Jesus became a "begotten son"?
• A study on the speed of gravity

Toddle provides an intuitive workflow for DP students to track the tasks assigned to them, submit their responses and view the assessment done by the teacher.

This article will give you a detailed walkthrough of the following:

Task submission

View the assessed task, navigating to pending tasks.

via Homepage

On the homepage, you will see a ‘Class stream to-do’ list of your assignments from all your classes. This task list is divided into three tabs - Upcoming tasks, Overdue tasks and the tasks which have no due date.

Click on ‘View all’ to get an elaborate list of your tasks.

Here, you have a full-page view of your tasks, their due date and status. You can also filter them out based on classes.

via Class stream

You can also view class-specific tasks by selecting a class on your homepage. Navigate to the ‘Class stream’ page from the collapsible menu on the left where you can view tasks of the selected class, distributed among three tabs - To-do, Scheduled and Done.

To submit your response, click on the task name either on the above screen or using the to-do list on the homepage. Once you have entered on the submission page, you can add your work in two ways:

Option 1: If the teacher has not provided a template for the task, you can click on the ‘Add work’ button and submit your response in the form of a photo, voice, video, audio, file, workbook or link. Depending on the chosen response type, you'll get options to directly capture/record content or upload from a device/one drive/Google Drive.

Option 2: If your teacher has provided a specific template for the assignment, it will show up on your submission page and you can click on the ‘Add response’ button to submit your work using the given template.

Once you have added your work, click on ‘Mark as done’ at the bottom to submit it.

If you would like to resubmit your work, click on ‘Unsubmit’. Please note that you will not be able to modify/resubmit your work once it is marked as evaluated by your teacher.

After the teacher has evaluated and shared your work, you will get a notification under the bell icon on the homepage, as shown below. You can view the teacher’s assessment by clicking on the notification or by directly going to the given assignment under the ‘Done’ tab on ‘Class Stream’, as shown below.

Please note that once the work is evaluated, you cannot make any changes to it. You will be able to download your work or post it to the class journal. You will also be able to view your teacher’s remarks, if any.

There are three kinds of assessment tools used in DP: Score-based, DP Criteria and Final Remarks/Comments. Your teacher can choose one or more of these assessment methods and you will accordingly see the evaluated assessment at your end.

The score and the remarks given by the teacher are visible directly on this page. In this case, the teacher has used DP assessment criteria so you can view the ratings given for it by clicking on the ‘View internal assessment’ option as shown below. Please note that the name of this button will change depending on the assessment criteria used by the teacher.

Clicking on the assessment criteria will show you the score given for each criteria and the total marks. You can use the arrow icons to expand an individual section and view the corresponding strands and descriptors.

Please note that once the work is evaluated, you cannot make any changes to it. You will also be able to download your work from the assessment page.

This powerful feature will help students easily submit assessments and plan learning goals based on their progress.

We hope that you found what you were looking for. Explore other articles for more!

• Branch and Bound Tutorial
• Backtracking Vs Branch-N-Bound
• 0/1 Knapsack
• 8 Puzzle Problem
• Job Assignment Problem
• N-Queen Problem
• Travelling Salesman Problem

Job Assignment Problem using Branch And Bound

Let there be N workers and N jobs. Any worker can be assigned to perform any job, incurring some cost that may vary depending on the work-job assignment. It is required to perform all jobs by assigning exactly one worker to each job and exactly one job to each agent in such a way that the total cost of the assignment is minimized.

Let us explore all approaches for this problem.

Solution 1: Brute Force  

We generate n! possible job assignments and for each such assignment, we compute its total cost and return the less expensive assignment. Since the solution is a permutation of the n jobs, its complexity is O(n!).

Solution 2: Hungarian Algorithm  

The optimal assignment can be found using the Hungarian algorithm. The Hungarian algorithm has worst case run-time complexity of O(n^3).

Solution 3: DFS/BFS on state space tree  

A state space tree is a N-ary tree with property that any path from root to leaf node holds one of many solutions to given problem. We can perform depth-first search on state space tree and but successive moves can take us away from the goal rather than bringing closer. The search of state space tree follows leftmost path from the root regardless of initial state. An answer node may never be found in this approach. We can also perform a Breadth-first search on state space tree. But no matter what the initial state is, the algorithm attempts the same sequence of moves like DFS.

Solution 4: Finding Optimal Solution using Branch and Bound  

The selection rule for the next node in BFS and DFS is “blind”. i.e. the selection rule does not give any preference to a node that has a very good chance of getting the search to an answer node quickly. The search for an optimal solution can often be speeded by using an “intelligent” ranking function, also called an approximate cost function to avoid searching in sub-trees that do not contain an optimal solution. It is similar to BFS-like search but with one major optimization. Instead of following FIFO order, we choose a live node with least cost. We may not get optimal solution by following node with least promising cost, but it will provide very good chance of getting the search to an answer node quickly.

There are two approaches to calculate the cost function:  

• For each worker, we choose job with minimum cost from list of unassigned jobs (take minimum entry from each row).
• For each job, we choose a worker with lowest cost for that job from list of unassigned workers (take minimum entry from each column).

In this article, the first approach is followed.

Let’s take below example and try to calculate promising cost when Job 2 is assigned to worker A. 

Since Job 2 is assigned to worker A (marked in green), cost becomes 2 and Job 2 and worker A becomes unavailable (marked in red). 

Now we assign job 3 to worker B as it has minimum cost from list of unassigned jobs. Cost becomes 2 + 3 = 5 and Job 3 and worker B also becomes unavailable. 

Finally, job 1 gets assigned to worker C as it has minimum cost among unassigned jobs and job 4 gets assigned to worker D as it is only Job left. Total cost becomes 2 + 3 + 5 + 4 = 14. 

Below diagram shows complete search space diagram showing optimal solution path in green. 

Complete Algorithm:  

Below is the implementation of the above approach:

Time Complexity: O(M*N). This is because the algorithm uses a double for loop to iterate through the M x N matrix.  Auxiliary Space: O(M+N). This is because it uses two arrays of size M and N to track the applicants and jobs.

Please Login to comment...

Similar reads.

• Branch and Bound

Improve your Coding Skills with Practice

What kind of Experience do you want to share?

Hire Assignment Writers Online

Browse 8,354 freelance assignment writers, hire skilled freelance assignment writers on guru and get work done on a flexible and secure platform.

$250 Million

• 100% Customer Satisfaction Rate Based on 6 reviews

Top Assignment Writers

Assignment Writer

Iloilo City, Iloilo City, Philippines

• Assignment Writing
• Creative Writing
• Erotica Writing
• Fiction Writing
• Ghostwriting
• Language Translation
• Romance Writing
• Cover Design
• Proofreading

Romantic Erotica Writing

Want erotic books that can make your readers go of with satisfying steam and overflowing wetness? I can do it for you. Romantic Erotica is my niche. I can write from the sweet and steamy to even the dark, taboo, and non-consenting erotica. I have experience and knowledge mostly in women erotica, which most readers prefer, but I have no problems creating other erotica, be it fantasy, paranormal, LGBTQ, or anything that involves hot, erotic, stories. View more

Nawan Jandanwala, Punjab, Pakistan

• Content Writing
• Cover Letter Writing
• Curriculum Vitae Writing
• Job Description Writing
• News Writing
• Resume Writing

"First-time ordering? PLEASE MESSAGE ME FIRST! Wondering why I''m the authority on these topics? Here''s my background: Licensed Real Estate Broker, California (5 years) Licensed Real Estate Agent, Texas (7 years) Real Estate Investor (15 years) I''m the ideal professional to craft: REALTOR® web copy Listing descriptions Real estate-related "how-to," listicles, and other value-giving content My investment experience includes: Buy-and-hold Fix-and-flip BRRRR Creative investing like short sales, subj... View more

Islamabad, Islamabad, Pakistan

• Assignments
• Academic Research
• Academic Writing
• Course Material
• Educational Writing
• English Tutor

ASSIGNMENT WRITING AND TYPING WORK

Hi! I'm Faral and I'm here to help you with any writing work related to English or Urdu. I have recently completed my M.Phil. in English language. So, if you need assistance in any of the writing work mentioned below, I will do my level best and provide satisfactory work.  SERVICES: 1. Typing Work 2. Assignments 3. Proofreading 4. English Tutor 5. B.Ed. Assignments 6. B.Ed. Projects  7. B.Ed. Research Projects View more

BHAKKAR, Punjab, Pakistan

• Analytical Writing
• Analytics Reports
• Behavioral Research
• Blog Writing
• Communication Skills

Hello, Welcome to my Gig! Are you looking for a competent and skilled teacher? I am there. I am currently studying. I''m an experienced hand writer who will provide quality handwriting for your desired needs. Handwritten letters and notes are far more likely to be opened by potential clients and customers than generic printed mail. If you need handwritten letters or notes, I''m the person for the job! REQUIREMENTS: Your work is to be written down YOU WILL GET: The completed work in jpeg, png, sca... View more

Sialkot, Punjab, Pakistan

• Copywriting
• Creative Copywriting
• Creative Non Fiction Writing
• Handwriting
• Microsoft PowerPoint

Handwritten assignment

Hey, I'm Nayab Malik from Pakistan. I will do handwritten assignment work and PowerPoint slides.  I am a versatile writer, copywriter, and editor, with the ability to craft and compose compelling content that fits the client's desired tone. I will make your PowerPoint slides.  I also generate aI pictures. View more

Sukkur, Sindh, Pakistan

• Academic Editing
• Academic Essays
• Curriculum Development

Academic assignment, report, and project

Welcome to my gig! Are you looking for a highly qualified expert for business and management-related assignments, coursework, quizzes, exams, projects or reports? If yes, then you are at the right place. I am a professional academic writer with 3 years of experience, I provide high-quality assignments with 0 percentage of plagiarism.  I offered services related to these subjects: Finance  Principle of Accounting  Management Accounting  Most accounting Financial Reporting Banking operation  Econo... View more

• Biography Writing
• Form Filling
• Story Writing

assignment writing and form filling

writing assignment form filling story writing writing assignment form filling story writing  writing assignment form filling story writing  writing assignment form filling story writing  writing assignment form filling story writing  writing assignment form filling story writing  writing assignment form filling story writing  writing assignment form filling story writing   View more

Delhi, Delhi, India

• Bengali Translation
• English Language
• Hindi Translation

Data entry,assignment writing

Data entry,assignment writing,good in drawing colouring Language known Hindi English Punjabi Bengali View more

Wah Cantt, Punjab, Pakistan

• Computer Engineer
• Computer Science
• Requirements Analysis

Assignment writing

I had been a very keen assignment writer and want to continue this. I can do assignments of computer science (including every subject that is related) according to customer's need and requirements. Your time, your work, your budget, MY services. I have full command o every office tool required to complete the assignments. View more

Ajman, Ajman, United Arab Emirates

• Journal Writing

assignment writing

Are you an undergraduate student looking to excel in your academic journey without the stress of assignment writing? Look no further! I specialize in providing top-notch assignment writing services tailored to your specific needs. With a proven track record of delivering high-quality, well-researched assignments, I''m here to help you achieve your academic goals. Say goodbye to late-night stress and endless research, and say hello to customized assignments that will earn you the grades you deserv... View more

Gojra, Punjab, Pakistan

• Image Design
• Thumbnail Design

hey I'm Ubaid ur Rehman  professional assignment writer I write your assignment very perfect if any problem you contact me I write your assignment in a time why you hire me? I'm experienced in making thumbnails and fiver images. I make amazing images for any platform. And I show you  some new things in my work. Thank you   View more

Sargodha, Punjab, Pakistan

• English Translation
• French Translation
• Urdu Translation

Hi, Welcome to my profile. I hope you are well and happy. My name is Rimsha and I am a assignment writer and translater .I have been 1 year of experience on assignment writing  I PROVIDE Clint satisfaction Money back guarantee Professional services  24/7 available. Feel free to order. I will be looking forward to hear from you thanks . Rimsha View more

Malabe, Western, Sri Lanka

• Evaluation Design
• Sales & Marketing Management

I'm graduate of business economics with highest class in state university. If you are looking for assignment writer please contact me. I have experience for doing assignment over 5+ years.  Main Areas: Business Economics Administration Organization behavior Procurement and material management Logistic Marketing And more management areas View more

Nairobi, Nairobi, Kenya

• Microsoft Word

Hello am Bedan. Am currently in university so i understand the hussle and bussle of doing assignments and because of this am willing to do and write up your assignments within a week. i offer to do ; Essay assignments Research assignments Case studies assignments Reports assignments Short answer assignments Documents pertaining the assignment should be provided in order to write up accurate and factual assignment. Technical illustrations is through custom order Assignments will be done in Micro... View more

Faisalabad, Punjab, Pakistan

• Data Management
• Article Writing
• Typing Work

Typing work, Assignments writing

I'm a professional typing master and data entry services available Data entry, Typing Master, Plagiarism remover, Assignments writing Available these services at reasonable prices Assignments are on a given time by the client and also some other given services like article writing and content writing and given other services which need by the client. work become professional work and client will be happy to read my work  And give me more work View more

Jaipur, Rajasthan, India

• Poster Design

Assignment Writing Services

We are looking for valuable clients who need assistance with their assignments. We are specialized in academic writing. We support numerous international students who are studying abroad in finishing their semesters with good grades. With a team of experts in various fields including management, accounting and finance, nursing, biology, technical subjects, and more, we have been providing high-quality assignment writing services for four years. Our content is guaranteed to be plagiarism and AI-f... View more

Multan, Punjab, Pakistan

• Educational Consulting
• Translation English To Urdu
• Translation Urdu To English

expert in academic & assignment writing

I m muhammad bilal shafiq. I offer myself as academic and assignment writer, I m expert in my work and love to give my best to achieve our goal View more

Lagos, Lagos, Nigeria

• Business Proposal Writing
• Business Writing
• Proposal Writing
• Writing Research & Fact Checking

I can help you in carrying out all your academic and business writing including but not limited to: - Business proposals - Statement of purpose - Research writing - Assignments and seminars, Project proposals - Project writing. Timely delivery, plagiarism fred and grammatical errors. I can write down all your assignments with my own handwriting not only typing. View more

Faridabad, Haryana, India

• Article Rewriting

Data Entry and Assignment Writing Jobs

Being a software engineer, I am capable of handling data entry jobs and Assignment Writing Jobs with high accuracy rate. View more

Bahawalpur, Punjab, Pakistan

• Scientific Research

Assignment writing servics

Professional Assignment Writing Services Are you in need of reliable and high-quality assignment writing assistance? Look no further. I offer comprehensive assignment writing services that will meet your academic needs and exceed your expectations. With a strong background in writing field, I am equipped to handle assignments across various subjects and academic levels. Whether it''s a research paper, essay, case study, or any other type of assignment, I will ensure it is meticulously researched,... View more

Want to get work done by experts?

Looking for freelancers with a specific skill.

Find Freelancers

Hire Freelance Assignment Writers for Your Projects

Writing is a form of communication which allows representing messages with clarity. It is a tool used to make languages be read. A writer is an individual who uses written words in various styles and techniques to communicate ideas. Writers create a variety of works in fictional and non fictional domains. Skilled assignment writers who are able to use language to express ideas well often pick up writing as a profession.

Writers have also found a place in the academic life of students in the form of professional assignment writers. As the academic life of a student progresses, assignment writing on different topics becomes part of the curriculum for teachers or professors to assess on. Many students take help of assignment writers to make sure they get the best grade on their subjects.  If you are a school student, graduate, master degree or doctoral candidate, who wishes to take support and guidance on assignments, you can hire assignment writer for this task. A number of freelance assignment writers are also available online through online top freelance sites.

What Do Freelance Assignment Writers Do?

They are writing experts who provide assistance on different topics as required for the assignment. Role of Assignment writer may include-

Apply the knowledge and writing skill to fulfil the assignment to high levels of standard

Conduct subject-specific research and help clients to meet the guidelines in relation to assignment writing

Write a paper on subject assigned, with an undefined number of sources

Write a specific type of paper with a predefined topic, number of sources and other mandatory requirements

Proofread writing to make sure there are no spelling or grammar mistakes

Paraphrase assignment in way that its clears plagiarism checks

If you wish to hire assignment writers for your academic needs, you can connect with best online assignment writers who provide this service as freelancers too. In order to hire good freelance assignment writers, please ensure you have considered below mentioned skills before signing a deal.

Should have researching skills to collect data from reliable sources to feed in assignment

Knowledge of academic, assignment writing and referencing styles as per guidelines

Excellent written English and professional style of writing

Should be subject specific expert

Able to comprehend guidelines given for assignment and implement the same

Qualifications of Freelance Assignment Writers

Preferably should hold Masters degree in specific subject

Adept knowledge about subject of study

Experience of writing numerous academic or non academic assignments

Benefits of Hiring Freelance Assignment Writing Services

They are subject specific experts who assist in writing impressive assignments for academic courses. There are several best online assignment writers   offering professional and exceptional writing service on some of the best websites to hire freelancers, like Guru. These knowledgeable writers have provided assignment help to a number of students and facilitated in earning good grades for them in assessments.

Manage payments easily on Guru. Pay using eCheck or wire transfer to get a 100% cashback on the handling fee.

Find and hire talented Assignment Writing Freelancers on Guru- top freelance website. Post a job for free.

Why Over 3 Million People Choose Us

Credibility.

We verify Freelancers, publish their feedback scores and All-Time Transaction Data to help you identify time-tested professionals across the globe.

Flexibility

We provide multiple Payment terms and flexible Agreements to enable you to work the way you want.

We offer SafePay payment protection and your choice of preferred payment method for financial peace of mind.

We have the lowest fees in the industry, providing you with maximum value at minimum cost.

Our dedicated support team works 24/7 to resolve all of your queries over the phone or email, no matter where you are located.

Why Choose Guru

It's Easy to Get Work Done on Guru

Create your free job posting and start receiving Quotes within hours.

Hire Freelancers

Compare the Quotes you receive and hire the best freelance professionals for the job.

Get Work Done

Decide on how and when payments will be made and use WorkRooms to collaborate, communicate and track work.

Make Secure Payments

Choose from multiple payment methods with SafePay payment protection.

See How Guru Works

People Also Search For

• Data Entry Experts
• Academic Writers
• Microsoft Word Experts
• Creative Writers
• Translators
• Microsoft Developers
• Data Managers
• Copywriters
• Academic Editing Services
• Management Experts
• Academic Researchers
• Essay Writers
• Transcriptionists
• Book Writers
• Microsoft Excel Experts
• Technical Writers

Browse Skills Related to Assignment Writers

• Report Writers
• Course Material Writers
• Scientific Researchers
• Curriculum Developers
• Articulate Storyline
• Multicultural Education Experts
• Thesis Writers
• Dental Education Experts
• Lesson Plan Writers
• Dissertation Writers
• Articulate Presenter
• Articulate Studio 360 Experts
• Curriculum Writing
• Blackboard Learning Management System Experts
• Keyword Researchers
• Newsletters

Browse Top Freelancer Locations for Assignment Writers

• Islamabad, Pakistan
• Nairobi, Kenya
• Delhi, India
• Hyderabad, India
• New Delhi, India
• Lahore, Pakistan
• Karachi, Pakistan
• Ahmedabad, India
• Kolkata, India
• Rawalpindi, Pakistan
• Mumbai, India
• Bengaluru, India
• Pune, India
• Chennai, India
• Dhaka, Bangladesh

Find Freelancers by Category

• Programming & Development
• Design & Art
• Writing & Translation
• Administrative & Secretarial
• Sales & Marketing
• Business & Finance
• Engineering & Architecture
• Education & Training

Browse More on Guru

By Location