Login

Create Account
Customer Service Chat
+14156709189
info@expertsmind.com
Submit Homework/Assignment
Get quote & make Payment
Get Solution
Small program on Algorithms , Data Structure & Algorithms
Objective
The goal of this project is to extend and implement an algorithm presented in the course and to apply notions introduced by the course to this program/algorithm. The assignment is relatively openended. The instructor will answer any question you may have. However, when in doubt, work toward the project goal stated above. This is an individual project. You may discuss it with other students, but the work you present must be your own only.
Deliverable
You will produce two items: (1) the code of the program specified below, and (2) a narrative of your work specified below. You will email both items to the TA (whose address will become available in the syllabus early in the course). The items will be transmitted as attachments to your email. The code will be formatted as ASCII text. The narrative will be formatted as either ASCII text or PDF. The deadline follows the rules of the homework, the beginning of the first lecture of the week following the assignment, except that you will email the material rather than bringing a hard copy to class. Late submission will be accepted up to 3 days and will be penalized at 10% a day.
Code spec
Your code will extend and implement the Knapsack Problem as presented in Section 8.2 of the textbook. The extension will become clear while describing the output. Your program is expected to read a file called "input2.txt" containing 3*k lines, li,j for i in 1,2,... k and j in 1,2,3. An example of input file is input2.txt. For any i, line li,1 contains n positive integers separated by a comma. They are the weights W1,W2,... of a Knapsack Problem instance with n items, where n is less than 100. Likewise, line li,2 contains n positive integers separated by a comma. They are the values V1,V2,... of the items whose weights are in the previous line. Finally, line li,3 contains a single integer, the knapsack capacity. No other characters beside digits and commas are in each line.
Your program is expected to write a file called "output2.txt" containing 5*k lines, mi,j for i in 1,2,... k and j in 1,2,...5. The output file corresponding to input2.txt is output2.txt. For i in 1,2,... k and j in 1,2,3, mi,j=li,j. Line mi,4 contains a single integer, the Knapsack Problem instance optimal solution. Line mi,5 contains a sequence of positive integers in increasing values. They are the indexes, starting with 1, of the items that make up an optimal solution. The general format of the output is the same as the format of the input. The extension with respect to the textbook algorithm is the generation of a set of items witnessing an optimal solution. If there is more than one set, any set is acceptable.
The weights, values, capacities and other parameters will be within reasonable ranges for a modern laptop or desktop. The programming language can be any of Java, Python, Ruby, C, and C++. Deliver all your code in a single file that can be compiled and executed on cs.pdx.edu. Your program should perform reasonably efficiently both in theory and in practice.
Narrative spec
The narrative is intended to show that you know and understand the aspects of the project related to this course, in particular, ability to: (1) extend and implement an algorithms, (2) relate theoretical complexity to practice, (3) code correct, readable and efficient programs, and (4) communicate your work clearly and concisely.
I would expect to find one or more of the following: (1) a description of the extension in the same style as the algorithm in the textbook, (2) a description of key data structures and algorithms used in the program, (3) the running time analysis of your algorithm/program, and (4) any benchmarking, profiling and/or testing employed for development.
Hints
You are encouraged to start your work early. Reading and writing the files are tasks that you already partially solved in Project 1. The Knapsack Problem is very easy to understand. Initially, you can implement a brute force program without computing the indexes. This will work for small problem instances. Then, you can replace the brute force approach with the dynamic programming approach presented in the textbook. Finally, you can introduce the extension. As the code evolves, you can use the previous version to test the current version''s correctness.
Posted Date: 10/30/2012 10:22:25 PM  Location : United States
Ask an Expert
Related Discussions:
Small program on Algorithms , Assignment Help, Ask Question on Small program on Algorithms , Get Answer, Expert's Help, Small program on Algorithms Discussions
Write discussion on Small program on Algorithms
Your posts are moderated
Write your message here..
Related Questions
What do you understand by structured programming, What do you understand by...
What do you understand by structured programming Structured Programming This term is used for programming design that emphasizes: (1) Hierarchical design of programmi
State hsv colour model, HSV Colour Model Instead of a set of colour pri...
HSV Colour Model Instead of a set of colour primaries, the HSV model uses colour descriptions that have a more intuitive appeal to a user. To give a colour specification, a use
Stack, Explain in detail the algorithmic implementation of multiple stacks....
Explain in detail the algorithmic implementation of multiple stacks.
Link list, algorithm for multiplication of two sparse matrices using link l...
algorithm for multiplication of two sparse matrices using link list
How conquer technique can be applied to binary trees, How divide and conque...
How divide and conquer technique can be applied to binary trees? As the binary tree definition itself separates a binary tree into two smaller structures of the similar type,
Complexity of a program, how to calculate complexity of a program
how to calculate complexity of a program
find shortest path from a to z using dijkstra''s algorithm., Q. In the gi...
Q. In the given figure find the shortest path from A to Z using Dijkstra's Algorithm. Ans: 1. P=φ; T={A,B,C,D,E,F,G,H,I,J,K,L,M,Z} Let L(A)
A binary tree in which levels except possibly the last, A binary tree in wh...
A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called as
What is the best case complexity of quick sort, What is the best case compl...
What is the best case complexity of quick sort In the best case complexity, the pivot is in the middle.
Numerical  algorithm, Q. What is the smallest value of n such that an algo...
Q. What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine. A n
Assignment Help
Accounting Assignment Help
Economics Assignment Help
Finance Assignment Help
Statistics Assignment Help
Physics Assignment Help
Chemistry Assignment Help
Math Assignment Help
Biology Assignment Help
English Assignment Help
Management Assignment Help
Engineering Assignment Help
Programming Assignment Help
Computer Science Assignment Help
ExpertsMind Services
Online Tutoring
Projects Assistance
Exam Preparation
Coursework Help
Programming Help
IT Services
Why Us ?
~Experienced Tutors
~24x7 hrs Support
~Plagiarism Free
~Quality of Work
~Time on Delivery
~Privacy of Work