Microsoft Visual Studio, write a program which will simulate the behavior of the lock when five characters are entered.
Budget: $30 – $250 USD
Given a five button character combination lock; write a program which will simulate the
behavior of the lock when five characters are entered. The actions are unlock ( if correct
sequence entered ) and an alarm ( if the incorrect sequence is entered ). A table ADT must be
used to store the transition table and action table of the finite state machine (FSM) which models the
behavior of the lock. The correct combination will be given in a file.
A table is an unordered group of “records”, each of which has a designated field called the key field
Records within the table are identified by the value of the key field.
For the operations provided by the table see pair.h and table.h.. The table is an appropriate ADT for information retrieval systems in which individual records must be accessed frequently ( and quickly ) but the entire collection of records must never be processed sequentially.
-Complete the table implementation.
-use table to store the transition table.
-use table to store action table.
-the lock will always be the characters A , B , C , D , E.
-the combination will always be a four character sequence
!!***Must use accompanying files – with no additions/changes
The program must run multiple times: give the user the option to enter as key code an unlimited number
of times.
behavior of the lock when five characters are entered. The actions are unlock ( if correct
sequence entered ) and an alarm ( if the incorrect sequence is entered ). A table ADT must be
used to store the transition table and action table of the finite state machine (FSM) which models the
behavior of the lock. The correct combination will be given in a file.
A table is an unordered group of “records”, each of which has a designated field called the key field
Records within the table are identified by the value of the key field.
For the operations provided by the table see pair.h and table.h.. The table is an appropriate ADT for information retrieval systems in which individual records must be accessed frequently ( and quickly ) but the entire collection of records must never be processed sequentially.
-Complete the table implementation.
-use table to store the transition table.
-use table to store action table.
-the lock will always be the characters A , B , C , D , E.
-the combination will always be a four character sequence
!!***Must use accompanying files – with no additions/changes
The program must run multiple times: give the user the option to enter as key code an unlimited number
of times.
Related categories:
C Programming
C# Programming
Software Architecture
C++ Programming
Visual Studio