{"id":605,"date":"2015-09-23T16:08:40","date_gmt":"2015-09-23T06:08:40","guid":{"rendered":"http:\/\/casestudyhelp.com\/sample-questions\/?p=605"},"modified":"2018-01-29T17:24:40","modified_gmt":"2018-01-29T06:24:40","slug":"java-recursive-programming-assignment-help","status":"publish","type":"post","link":"https:\/\/casestudyhelp.com\/sample-questions\/java-recursive-programming-assignment-help\/","title":{"rendered":"Java Recursive Programming Assignment Help"},"content":{"rendered":"

Assignment #1 (80 Points) \u2013 COSC 2336 \u2013 Dr. Leonard Brown Due<\/strong>:\u00a0\u00a0September 24, 2015 (at 11:59pm)<\/p>\n

General Description There are two parts (I and II) to this assignment.\u00a0\u00a0Part I is not a programming assignment.\u00a0\u00a0Part II is.<\/p>\n

Part I<\/strong> (20 points) Identify the base case and the general case of recursive solutions for each of the following programs\u00a0\u00a0 \uf0b7 Given a collection of n > 0 numbers, find their sum. \uf0b7 Given a string of n > 0 characters, count the number of vowels. \uf0b7 Given a route from Point A to Point B, where the route consists of a collection of roads with a given distance along each road, compute the total distance. \uf0b7 Starting from the root directory of the C: drive, find the location of an input file. \uf0b7 Given a maze where, at each step, you may move one space forward, one space left, or one space right (if those spaces are not blocked), find the exit.<\/p>\n

Part II<\/strong> (60 points) Write a recursive program in Java that can interpret a fictional markup language.\u00a0\u00a0The input to the program will be a text file that contains text embedded with several markup tags.\u00a0\u00a0The output from the program will be a text file that contains the formatted resulting from the application of the markup tags.<\/p>\n

The syntax of the markup language is very straightforward.\u00a0\u00a0Each command starts with a single dash\u00a0\u00a0\u00a0 (\u2010) in order to differentiate it from the actual text.\u00a0\u00a0Each command specifies a format that should be applied to the actual text until the command \u2013END is encountered (preceded by a single dash).\u00a0\u00a0Note that multiple markup commands may be applied at the same time with the innermost markup applied first.\u00a0\u00a0Multiple markup commands may be terminated by a single \u2013END command.<\/p>\n

To illustrate the use of the markups, consider the following example input line.\u00a0\u00a0It contains several markup commands.<\/p>\n

This -CAPS is \u2013WHY \u2013DOUBLE an \u2013END example \u2013EXPAND sentence -END.<\/strong><\/p>\n

Markup Definition Input Text Formatted Text \u2010CAPS Capitalize text Apple APPLE \u2010DOUBLE Append a copy of the text to itself Apple Apple Apple \u2010EXPAND Put a single space between each pair of letters Apple A p p l e \u2010WHY Replace each vowel by the letter y (maintaining case) Apple Ypply \u2010END Stop applying the current format<\/p>\n

Processing the markups in the input text would cause the following output to be generated. This IS YN YN example s e n t e n c e. Your program should read a text file containing several lines similar in format to the previous example.<\/p>\n

Your program should produce a text file containing the correct output for the text.<\/strong><\/p>\n

As stated earlier, this program must use recursion.\u00a0\u00a0You should have a recursive method that accepts a string argument and returns a string argument.\u00a0\u00a0One approach to solving this problem is to tokenize the input string and print each token until one is encountered that starts with a dash.\u00a0\u00a0Process this token as a command that should be applied to the result obtained from processing all of the text until the next \u2013END command.<\/p>\n

Notes<\/strong><\/p>\n

You must provide comments describing the purpose of each logical section of your code.\u00a0\u00a0Remember that the purpose of commenting code is to improve program readability, so you should not provide a comment before each line of code that you write.\u00a0 \u00a0 When in doubt, it is usually better to \u201covercomment\u201d code than to provide too little documentation.<\/p>\n

Your recursive method must include a comment that clearly indicates the processing of the base case.\u00a0\u00a0 In addition, you must include a header to your program that contains your name, class number, section number, semester, assignment number, date, and project description.<\/p>\n

In addition, you must provide a header for each method that you write in your code.\u00a0\u00a0Each method header must describe the method\u2019s purpose, its input, and its output. In addition, the format of your code must follow good programming principles as in your textbook(s).\u00a0\u00a0 This means that you must use blank lines and indentation to arrange and\/or separate logical sections of your code.\u00a0\u00a0You must also use meaningful variable names Since you are writing an object\u2010oriented program, you will also be evaluated on your design.\u00a0\u00a0Your program must use multiple classes.\u00a0 \u00a0Within each class, the data values should be private, and the methods should be public.<\/p>\n

Since the data values are private, you will need to create public accessor (get) and mutator (set) methods for each data value.<\/p>\n

Sample Input<\/strong><\/p>\n

-WHY Recursion \u2013CAPS is an \u2013END \u2013DOUBLE extremely \u2013END powerful problem-solving \u2013WHY \u2013EXPAND technique. \u2013END Problems that at \u2013CAPS first appear \u2013WHY to be quite difficult \u2013END often have \u2013DOUBLE simple \u2013CAPS recursive \u2013END solutions.<\/p>\n

Sample Output<\/strong><\/p>\n

Rycyrsyyn YS YN extremely extremely powerful problem-solving t y c h n y q y y. Problems that at \u2013CAPS FIRST APPEAR TY BY QYYTY DYFFYCYLT often have simple RECURSIVE simple RECURSIVE solutions.<\/p>\n

Grading<\/strong><\/p>\n

Your program (Part II) will be graded based on the following criteria Implementation of Requirements\u00a0\u00a0 \u00a0 20 points Program Works Correctly\u00a0\u00a0 \u00a0 \u00a0 20 points Class Design\u00a0\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 10 points Documentation\u00a0\u00a0 \u00a0 \u00a0 \u00a0 10 points<\/p>\n

Submission<\/strong><\/p>\n

Submit your assignment through Blackboard.\u00a0\u00a0If your assignment contains multiple files, zip them into a single folder before submitting.<\/p>\n

Notes<\/strong><\/p>\n

Points can be deducted from your assignment based on the quality of its presentation.\u00a0\u00a0Handwritten assignments will not be accepted.<\/p>\n

To get assignment samples chat with our online assignment adviser (Chat with our 24 x 7 Online Agents).<\/strong><\/p>\n

\"Hire<\/a><\/p>\n

Ask Your\u00a0java Programming Assignment<\/a><\/strong>?<\/strong>
\nCheck out our\u00a0java Assignment Help Australia<\/a><\/strong>
\nFind Your\u00a0Computer Science Assignment Experts<\/a><\/strong><\/p>\n