One from Column A and one from Column B: Simultaneous vs. Sequential Menus
Figure 2.1 is an example of data organization using sequential menu representation. Each screen represents the user's new choice.
Type 1 questions did not make any difference in terms of clicking
because no backtracking was necessary for users involved in sequential menu
experiment.
How many people were employed in Kent County in service businesses during 1993?
Type 2 questions require a one-step backtracking:
During which year (1995 or 1996) did Caroline County have the largest number of people working in Manufacturing?
In this example, subjects would have to click on the Return to Years link to go back to previous menu.
Type 3 questions require a two-step backtracking:
Which business category employed the larger number of people in Howard County in 1995: manufacturing or wholesale trade?
In this case, the users would have to go back to Years then to Categories in order to choose another industry.
The sequential menus display choices on a series of three screens: county, category, and year. Each screen has a header that specifies the choices made thus far, in a colon-separated format (County:Category:Year). The industry and year menus include two types of backtracking choices: a ``Return to Counties'' or ``Return to Categories'' link that returns the user to the previous menu, and a ``reset menus'' link that returns the user to the first menu. Once choices have been made in all three categories, the user will be presented with a data screen that displays the number of employees, annual payroll, and number of establishments for the chosen county, industry, and year. This result screen also contains a link for backing-up one step (``Return to Years'') and a ``reset menus'' link.
The simultaneous menu arrangement displays county, category, and year menus in a series of three frames arranged vertically down the left-hand side of the screen. The right-hand side of the screen is completely occupied by a single frame which contains data.
When the user makes a choice in one of the three menus, that menu is updated in order to indicate the specific choice made. Specifically, the title of the frame is changed to include the name of the choice, and a red diamond is placed next to the choice.
The data window is initially blank, with the exception of a title that reads simply ``data''. As choices in the menus are made, the title is updated update these choices, and a message is displayed, asking the user to make a choice in the other menus. Once choices have been made in all three menus, the data window is updated to display the appropriate facts. At all times, a ``reset menus'' link in the data window can be used to restore all of the menus to their original, unselected state.
H0: Mean task performance times for sequential menus and simultaneous
menus are equal.
HA: Mean task performance times for sequential menus is greater than mean task performance times for simultaneous menus.
Since or alternative hypothesis indicates an ordering between the two means, a directional (one-tailed) t-Test has been chosen. The 5% level of significance (alpha = 0.05) will be used.
The pilot tests identified several issues that had to be addressed. These changes can generally be divided into three areas: clarifications of instructions, clarification of task presentation, or modifications to the layout and content of the menu screens.
The following modifications have been identified as appropriate. All of these changes were implemented before the actual user testing began.
Instructions
Task Presentation
Menu Layout
Twenty two subjects participated in the experiment. Data for two subjects was not used due to abnormally high task completion times. Of the remaining twenty subjects, 15 were male, 5 were female, and all were under 45 years of age. All subjects were graduate or undergraduate students, and all had previous web-browsing experience. Eleven subjects used simultaneous menus while the other nine used sequential menus.
The whole experiment was conducted on the Internet, thus we had to convert all
the data into HTML files. We installed an Apache server on two Windows NT
Machines. The servers ran locally, thus eliminating false results due to
network delays or unexpected interference. We used Netscape as our Web browser
with its cache cleared before running the experiment. The server was
configured to automatically log the times for each click the user did. A
parser was written to retrieve the necessary information from these logs.
The time recorded is one full question: from the first click to the last. We asked the subjects to write the answer on their answer before the last click.
We wanted to extract the number of clicks per question but the frame design in the simultaneous layout discouraged us. We could still detect higher number of clicks.
In addition, we thought it would be interesting to see the effects on speed of
performance over time. So, all of us ran the experiment on ourselves (three
times per each version). For each of the 15 questions, the best time between
all these runs was selected. Then we aggregated the questions by question
type.
The experiment session began with subjects signing the User Agreement Form.
After that, they were asked to fill in background information. Then, description of the tasks and
practice questions were
presented to them. The answers had to be recorded on a piece of paper. No help
was provided during the real experimentation. Upon subjects' completion, they had to fill out the
Subjective Satisfaction Questionnaire.
During our review of the logs, we realized that data for 2 subjects who used
sequential model had to be thrown out. Their time values were significantly
different from the rest of the participants. Unfortunately, it is not possible
to determine whether the error came from produced by server malfunction or
subject's confusion.
These results are summarized in table 2.1. The ``Items Varied'' for any given task is the total number of menu choices that changes. It should be noted that for type 3, only one item is varied, even though two backtracking steps are required in the sequential case. Examination of the type 3 questions reveals the reason for this: these questions require a different choice on the second menu, while requiring the same choice for both visits to the third menu.
For simultaneous menus, the number of items varied in the task is
clearly the most important factor. If we assume a menu structure with j
menus and ni choices at level i, then a task involving k varied items
will require
![]() |
(1) |
where E(ni) is the expected amount of time that will be spent on making a selection from a menu containing ni choices. In other words, the total time required is the time needed to make the initial j choices and then k additional choices.
For sequential menus, the number of backtracking steps is the factor
that differentiates between the tasks. Each backtracking step requires one
selection of the Back button, and one additional menu selection. So,
given the same number of menus and number of items on each menu, a task with
k backtracking steps will require
![]() |
(2) |
where r is the amount of time required to hit the Back button.
For any given combination of a set of tasks, a menu organization, and a question involving comparison among different values, the number of items varied will always be less than or equal to the number of backtracking steps. To see why this is so, consider the general case: if i menu items are varied, at least i backtracking steps will be required to see the i menus necessary to make the varied choices. Of course, the sequential menus may suffer from cases where i items are varied but the number of backtracking steps require is greater than i.
Sequential menu performance also suffers from inclusion r, the time required to hit the Back key. While this may be seen as putting sequential menus at a disadvantage, it seems to be an inherent structural property of sequential menus.
This analysis assumes that the selection times E(ni) are comparable for
the two types of menus. Past research has shown that menu selection times can
be roughly logarithmic or linear [Norman, 1991]. Although our experiment does
not attempt to build a complete performance model, it seems reasonable to
assume that the type of the selection times (linear or logarithmic) function
will be the same for both arrangements.
| Department of Computer Sciences Direct questions and comments to the student editorial team |