Part I Explore some of the current methodologies in Software Engineering. Choose

Part I
Explore some of the current methodologies in Software Engineering. Choose one you are interested in and present it in details. When you explain it, you should explain the methodology and how it relates to the classic waterfall model, and list the advantages and disadvantages of this methodology.
Feel free to include images as well as videos in your presentation, making sure to document the source. Please note it is your responsibility to refer to reliable resources.
Part II
Consider the following problems, design the algorithms that would solve them, and then implement the algorithm in Java.
Problem 1:
Write a program that reads a set of floating-point values. Ask the user to enter the values, then print:
The average of the values
The smallest of the values
The largest of the values
The range, that is the difference between the smallest and the largest
Of course, you may only prompt for the values once.
Problem 2:
Write a program that reads a word and prints each character of the word on a separate line. For example, if the user provides the input “Harry”, the program prints:
Problem 3:
The Fibonacci numbers are defined by the sequence:
f1 = 1
f2 = 1
fn = fn-1 + fn-2.
Reformulate that as
Fold1 = 1;
After that, discard fold2, which is no longer needed, and set fold2 to fold1, and fold1 to fnew. Repeat an appropriate number of times.
Implement a program that prompts the user for an integer n and prints the nth Fibonacci number, using the above algorithm.
Problem 4:
Write a program that prints a multiplication table, like this:
1 2 3 4 5 6 7 8 9 10
2 4 6 8 10 12 14 16 18 20
3 6 9 12 15 18 21 24 27 30

10 20 30 40 50 60 70 80 90 100
Problem 5:
Imagine yourself in the middle of Manhattan, where the streets are perpendicular on avenues. You are in a grid of streets, somewhat lost, and you randomly pick one of four directions and walk to the next intersection. Not knowing where you really want to go, you again randomly pick one of the four directions, and so on. After repeating the same movement for a number of times, you may want to know how far you got from the original point.
Represent locations as integer pairs(x,y). Create an algorithm that implements your movement through New York City, over 100 intersections, starting at (0,0) and print the ending location, taking into consideration that each movement, from one intersection to another will be one mile.

Post navigation

Leave a Reply

Your email address will not be published.