(5/5)

- What is a flowchart? (5)
- What is the guidelines of the flowchart according to your textbook? (5)

3.

1) Draw a flowchart for finding the maximum value between three variables (5)

2) Write a pseudocode that does exact same thing as the flowchart (5)

4.

1) Draw a flowchart for finding the minimum value between three variables (5)

2) Write a pseudocode that does exact same thing as the flowchart (5)

- Explain the flowchart and the pseudocode with 4 different cases (examples)

of different flows (20)

- (Livestock fence) Your farm has two types of livestock. You have X units of barbed wire to make a rectangular fence for the animal, with a straight division for separating them.

1) Draw a flowchart for finding the optimal fence size that will maximize the pasture’s area (10)

2) Write a pseudocode that does exact same thing as the flowchart (10)

3) Explain the flowchart and the pseudocode with another example (10)

- (Flying cheap) You need to fly to New York City anytime in the next n days. Air ticket prices change unpredictably according to the departure and return dates. How many pairs of days must be checked to find the cheapest tickets for flying to NYC and back within the next n days?

1) Draw a flowchart for finding the number of pairs (10)

2) Write a pseudocode that does exact same thing as the flowchart (10)

3) Explain the flowchart and the pseudocode with an example (10)

- (Playing with DNA) A biologist is studying a DNA segment related to a genetic disease. The segment is made of 23 base pairs, where 9 must be A-T, 14 must be G-C. She wants to run a simulation task on every possible DNA segment having these numbers of base pairs. How many simulation tasks is she looking at?

1) Draw a flowchart for this task (10)

2) Write a pseudocode that does exact same thing as the flowchart (10)

3) Draw a flowchart for computing factorial k, before you draw the first flowchart, and use this in

your first flowchart (10)

4) Write a pseudocode that does exact same thing as the flowchart (10)

- (Card deck) Picture a deck of 13 cards containing all spades. How many ways can you deal six cards to your opponent?

1) Draw a flowchart for this task (10)

2) Write a pseudocode that does exact same thing as the flowchart (10)

3) Draw a flowchart for computing factorial k, before you draw the first flowchart, and use this in

your first flowchart (10)

4) Write a pseudocode that does exact same thing as the flowchart (10)

- (Team building) There are 23 candidates who want to join your team. For each candidate, you toss a coin and only hire if it shows heads. What are the chances of hiring seven people or less?

1) Draw a flowchart for this task (10)

2) Write a pseudocode that does exact same thing as the flowchart (10)

3) Draw a flowchart for computing factorial k, before you draw the first flowchart, and use this in

your first flowchart (10)

4) Write a pseudocode that does exact same thing as the flowchart (10)

11.

1) Explain: Logical variable (1), Conditional operator (1), Negation operator (1), Contrapositive (1), Biconditional (1), Inverse error (1)

2) Explain: Associativity (1), Distributivity (1), De Morgan’s Law (1), Boolean Algebra (1)

3) Modeling ‘Hot Server Problem’ in logical variables and prove

○ “(A AND B) OR (A AND C) → D” is “D! → ! A OR (!B AND !C)” using

■ the notions that you explained above (5)

○ What does it mean? (5)

○ A: Server oveheats, B: Air conditioning off, C: Chassis cooler fails, D: Server crashes

○ Draw a full truth table for your model and explain all the cases (20)

4) Modeling ‘Fragile System Requirements’ in logical variables

○ If the database is locked, we can save data (5)

○ A database lock on a full write queue cannot happen (5)

○ Either the write queue is full, or the cache is loaded (5)

○ If the cache is loaded the database cannot be locked (5)

○ Is this possible? Under which conditions will it work? Use truth table (10)

(5/5)

DescriptionIn this final assignment, the students will demonstrate their ability to apply two majorconstructs of the C programming language – Fu

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of