- Part 1 – 4 Debugging Exercises – there are things wrong – either logic or syntax errors.  Correct the pseudocode and one Java program. Add the corrected code in BOLD and change the corrected color to RED.  

Debugging 2:  Add the missing code in bold and red.

start

                  Declarations

                           num number

                  housekeeping()

                  while number >= 15

                           detailLoop()

                  endwhile

                  finish()    

stop

housekeeping()

         number = 1

return

detailLoop()

         output number

         num = number + 1

return

finishUp()

         output “End of program”

return

8.25 Lab 6b Switching Up Months

Objectives

• Use Boolean expressions involving String comparison
• Use String methods substring, toUpperCase, equals, and charAt
• Use switch program control statement
• Print out a program and turn it in for "eyes-on" grading

Introduction

In this lab you will continue using the other type of conditional statements: the switch-case.

For switch-case conditional statements, the idea is that you have a variable (the switch) that will determine the next course of action depending on its value (the case).

Example structure would be:

int someVariable = 2;
switch (someVariable){
    case 1: /*do something*/;
            break;
    case 2: /*do something else*/;
            break;

}

someVariable is your swtich and the program will decide a case according to its value.

Assignment

Write the class SwitchingUpMonths.java. This program will be completing exactly the same task as Lab3c, however you will need to use switch-case conditional statements instead of if-else.

That is, your program must:

1. Asks a user to enter the name of a month
2. Confirms the User's input.
3. Prints the abbreviation and number corresponding to that month.

The sample output for input February:

Enter the month: 
You entered February
Its abbreviation is FEB
This is month number 2

Adding code that will keep cumulative count of characters?

Hello, I am having issues in figuring out how to keep letter from a .txt file with the declaration of independence, this is my code, I can keep track of the frequency but can't figure out the way to keep adding the total characters, as the you go down the alphabet the number is supposed to be counting up

#define _CRT_SECURE_NO_WARNINGS
#include
#include
#include
#include

#define DEBUG

void main()
{
   FILE* fp;

   int numChars[26] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }; //26 characters
   unsigned char c;
   int ndx;
   if ((fp = fopen("DOI.txt", "r")) != NULL)
   {
       while (1)
       {
           c = fgetc(fp);

           if (feof(fp))
           {
               break;
           }

           if (!isalpha(c))
           {
               continue;
           }

           ndx = toupper(c) - 'A';
           numChars[ndx]++;
       }

       printf("Letter\tFrequency\tTotal Characters\n");
       printf("------\t---------\t---------------\n");
       for (int i = 0; i < 26; i++)
       {
           printf("%c\t%3d\t%d\n", i + 'A', numChars[i]); //Here is where I should add the counter but can't figure out how to make it work
       }

       fclose(fp);
   }
   else
   {
       perror("Unable to open file");
   }

   getchar();
}

Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 99. Suppose Host A then sends two segments to Host B back-to-back. The first and second segments contain 30 and 70 bytes of data, respectively. In the first segment, the sequence number is 100, the source port number is 4321, and the destination port number is 80. Host B sends an ACK whenever it receives a segment from Host A, i.e., no delayed ACK.

1. In the second segment sent from Host A to B, what is the sequence number?
2. If the first segment arrives before the second segment, in the ACKs of two arriving segments, what are the acknowledgment numbers of the first and second arriving segment, respectively? What are the source port number and the destination port number in ACK?
3. If the second segment arrives before the first segment, in the ACKs of two arriving segments, what are the acknowledgment numbers of the first and second arriving segment, respectively?
4. Suppose the two segments sent by A arrive in order at B. The first ACK is lost and the second ACK arrives before the first timeout interval. What will happen at Host A? If Host A needs to retransmit some segment, what are the sequence number and the number of bytes of the data? Now assume the first ACK is lost and the second ACK arrives after the first timeout interval. What will happen at Host A? If Host A needs to retransmit some segment, what are the sequence number and the number of bytes of the data?

CREATE TABLE Hotel

(

roomNumber     INTEGER         PRIMARY KEY,

type                  CHAR(10)         NOT NULL,

rate                   INTEGER         NOT NULL,

--

CONSTRAINT IC1 CHECK (type IN ('suite', 'king', 'queen')),

CONSTRAINT IC2 CHECK (type <> 'suite' OR rate > 200),

CONSTRAINT IC3 CHECK (NOT (type = 'king' AND (rate < 80 OR rate > 220))),

CONSTRAINT IC4 CHECK (NOT (type = 'queen' AND rate >= 100))

);

which 8 of these inserts will be rejected only 8 are rejected

Create a List

Create a class that holds an ordered list of items. This list should have a variable size, most importantly this class should implement the interface SimpleArrayList. Feel free to add as many other functions and methods as needed to your class to accomplish this task. In other words, you have to write the code for each of the functions specified in the SimpleArrayList interface.

You are not allowed to use any 3rd party data structures or libraries such as Java.Utils.ArrayList or Java.awt.ArrayList

Please use the class SimpleArrayListUnitTest.java to test your code, it is a JUnit test that contains 49 different tests that test all the functions of your class.

(using Eclipse.. I don't have any idea :()

IN JAVA PLEASE

The Palindrome class will have a single constructor that accepts a String argument and checks to see if the String is a palindrome.

If it is a palindrome it will store the palindrome and the original String as state values. If is not a palindrome it will throw a “NotPalindromeError” and not finish the creation of the new Palindrome object.

The constructor will use a single stack to evaluate if the String is a palindrome.

You must use a bounded stack to do the evaluation. You may use the ArrayBoundedStack from the book.

The bounded stack may only hold one half of the target String.

The Strings to be checked will consist of alphanumeric characters, spaces, and punctuation. The spaces and punctuation are to be ignored for the purpose of determining if the Strings are palindromes. Capitalization should not affect the identification of a palindrome.

- Part 2 – 4 Desk Checking Exercises – these are 3 programs (pseudocode) that are working and 1 program (Python). Explainthe intent of the pseudocode / program. If you use test data, note the test data.  .  You are NOT trying to find mistakes.

What does this do? Desk Checking #1:  Explain the intent of this pseudocode. List the data you use as the example data.

start

                  Declarations

         num balance

         num month

         num loanAmt

         num paymentAmt

         string PROMPT = “Enter the loan amount and payment amount >> ”

housekeeping()

detail()

finishUp()

stop

housekeeping()

         output PROMPT

         input loanAmt, paymentAmt

return

detail()

                  month = 1

                  balance = loanAmt

                  while balance > 0

                           balance = balance – paymentAmt

                           output month, balance

                           month = month + 1

                  endwhile

return

finishUp()

         output “End of program”

return

• strcpy
• strcat
• strcmp
• strstr
• strchr
• fgets

Specification

The program should repeatedly prompt the user to enter a string of no more than 20 characters. The program will end when the user types in DONE (all caps). Use fgets to get input from the user.

Because fgets leaves the newline character on the string, the program should trim off the newline by replacing it with the null character, effectively shortening the string. Use strchr to locate the newline.

The program will use the input to build up a longer string. You may assume this string will be no longer than 1000 characters. The user input is compared to the longer string and then takes action as follows:

• If the input is contained within the longer string, ignore it. Use strstr to perform the search.
• If the user input is less than the longer string (as indicated by the return value from strcmp), prepend the input onto the longer string with a space separating them.
• If the input is greater than the longer string, append it with a space separating them.

After each user input, display the longer string.

Sample Run

Here's a sample of how the program would work. I've shown user input in bold, just to help it stand out. Your program won't use any special typography.

Enter a string: hello
hello
Enter a string: world
hello world
Enter a string: bye
bye hello world
Enter a string: cat
bye hello world cat
Enter a string: worl
bye hello world cat
Enter a string: beep
beep bye hello world cat
Enter a string: bingo
beep bye hello world cat bingo
Enter a string: DONE
beep byte hello world cat bingo

Let's analyze this one input at a time.

1. User enters hello. Since this is the first sting entered, it is copied into the longer string.
2. User enters world. Because world comes after hello, it is appended onto the longer string.
3. User enters bye. This comes before hello world, so it is prepended.
4. User enters cat. This comes after bye hello world, and is appended.
5. User enters worl. This string is found within the longer one; no change to the longer string.
6. User enters beep. Since beep comes before bye hello world cat, it is prepended.
7. User enters bingo. This comes after beep bye hello world cat, and is appended.
8. User enters DONE. The longer string is displayed one last time and the program ends.

Please note that the program is not putting the words in alphabetic order. It's actually doing something simpler than sorting.

Program must be in C

Write a program that allows the user to enter the last names of five candidates in a local election and the number of votes received by each candidate in two different arrays.

The program should then output each candidate’s name, the number of votes received, and the percentage of the total votes received by the candidate.

Your program should also output the winner of the election.

Example (Letters and numbers with underscore indicate an input):

Enter candidate's name and the votes received by the candidate.
Johnson 5000
Miller 4000
Duffy 6000
Robinson 2500
Asthony 1800

 Candidate    Votes Received   % of Total Votes
 ---------    --------------   ----------------
   Johnson       5000                 25.91
    Miller       4000                 20.73
     Duffy       6000                 31.09
  Robinson       2500                 12.95
   Asthony       1800                  9.33

Total Votes: 19300
The Winner of the Election is: Duffy

Write a Python program that simulates a restaurant ordering system where it stores multiple orders of a dish and the price for each order stored into a list. The program will then print the receipt which includes list of orders and their price along with the subtotal before tax, the tax amount, and the final total. Also include tip suggestions for 10%, 15% and 20%. Use the format specifiers to make the price line up and the tip only 2 decimal points.

Example:

Welcome to No 2. Kitchen

Order

Lt. Tso Chicken                 $ 17.50

Half Century Eggs            $   2.50

Durian ice cream               $   5.00

=========================

Subtotal                             $ 25.00

Tax (7%)                           $   1.75

=========================

Total                                  $ 26.75

Tip suggestion

10% : $2.67  

15% : $4.01

20% : $5.35