flâneur — a map of the web's best reading

Lab 2: Simulation 2 - CS2030S Programming Methodology II

nus-cs2030s.github.io · 1,287 words · saved by 1 readers

This is a continuation of Lab 1. Lab 2 changes some of the requirements of Lab 1 and adds some new things to the world that we are simulating. The goal is to demonstrate that, when OO-principles are applied properly, we can adapt our code to changes in the requirement with less effort. Lab 2 also nudges you towards following good coding practice by adhering to a published coding convention. Recall that, no waiting was allowed inside the bank we are simulating. The bank is losing customers as a customer departs if all the counters are busy. Lab 2 adds an entrance queue to the bank. If all counters are busy when a customer arrives, the customer will join the queue and wait. When a counter becomes available, the customer at the front of the queue will proceed to the counter for service. The entrance queue has a maximum queue length of 𝑚 . If there are already 𝑚 customers waiting in the entrance queue, any arriving customer will be turned away. You are required to build on top of your

Lab 2: Simulation 2 Deadline: 7 February 2023, Tuesday, 23:59 SST Marks: 12 Weightage: 3% Prerequisite: Completed Lab 1 Caught up to Unit 19 of Lecture Notes Familiar with CS2030S Java style guide Revised the CS2030S Lab guide Reminder: Only use the submit and get scripts. Do not use any git commands. Goal This is a continuation of Lab 1. Lab 2 changes some of the requirements of Lab 1 and adds some new things to the world that we are simulating. The goal is to demonstrate that, when OO-principles are applied properly, we can adapt our code to changes in the requirement with less effort. Lab 2

Explore this link on the map →

saved by

related reading