5.5 Oral Final

Overview

5.5 Oral Final

The oral final will consist of a one-on-one, 25-30 minute discussion which will assess your knowledge of object-oriented programming. The exam will take place in a meeting room in the southeast area of ITEC, near room A122 on the Wausau campus (or online via Slack and Google Hangouts if you are an online/remote student). Dress professionally (business casual or better), arrive five minutes before your scheduled appointment. If you attend online, notify me via a Slack Direct Message when you are ready. Contact me with alternate arrangements if needed.

Work through the stories in order. Use the acceptance criteria to check each feature, and complete the nested tasks using the specified names, values, and scenarios.

Arrange the oral-final meeting
1.Schedule your Oral Final

Register early, as times are first-come, first-served.

A Use Starfish to schedule an appointment with your instructor.
B Submit a note to Canvas indicating the date and time you have signed up for.
Prepare and explain the required designs
Acceptance Criteria
Acceptance criteria
  • The Company/Employee sorting-strategy example is prepared as required.
  • You can compare bubble, selection, and insertion sorting, and linear versus binary search.
  • You can explain List, Stack, Queue, Dictionary, recursion, two Zoo single-responsibility examples, and a Zoo strategy example.
Instructions
2.Prepare Example Code for the Oral Final
A Prepare a .Net Framework Console Application based on the following scenario:
Class Diagram: Employee Sorting Strategies; Members and relationships are shown in the editable reference; unrelated members may be omitted.
Class Diagram: Employee Sorting Strategies
  • New
  • Changed
  • Removed

Using the above incomplete class diagram, the company you work for wants you to implement the strategy design pattern to allow the bubble, selection, and insertion sorting algorithms to be used when sorting employees by salary. In Program.cs, implement the solution with some test data. User input is allowed, but not required, as we will be focusing on the algorithms and design pattern in the limited time available.

You are allowed to base your sorting algorithms off of your Zoo application. Attempt to write clean code, but code comments and StyleCop are not required.

3.Be prepared to discuss the bubble, selection, and insertion sorting algorithms based on your example solution.
A Be prepared to discuss the bubble, selection, and insertion sorting algorithms based on your example solution.
4.Be prepared to explain the difference between linear and binary search.
A Be prepared to explain the difference between linear and binary search.
5.Be prepared to explain the similarities and differences between List, Stack and Queue. Additionally, how is a Dictionary…

Be prepared to explain the similarities and differences between List, Stack and Queue. Additionally, how is a Dictionary categorically different than all 3 of the former?

A Be prepared to explain the similarities and differences between List, Stack and Queue. Additionally, how is a Dictionary…

Be prepared to explain the similarities and differences between List, Stack and Queue. Additionally, how is a Dictionary categorically different than all 3 of the former?

6.Identify 2 instances of the single responsibility principle in the zoo application. Be prepared to explain how each of those…

Identify 2 instances of the single responsibility principle in the zoo application. Be prepared to explain how each of those examples explain the principle.

A Identify 2 instances of the single responsibility principle in the zoo application. Be prepared to explain how each of those…

Identify 2 instances of the single responsibility principle in the zoo application. Be prepared to explain how each of those examples explain the principle.

7.Identify an instance of the strategy design pattern in the zoo application. Be prepared to explain how it follows the…

Identify an instance of the strategy design pattern in the zoo application. Be prepared to explain how it follows the pattern and what advantage(s) it brought by doing so.

A Identify an instance of the strategy design pattern in the zoo application. Be prepared to explain how it follows the…

Identify an instance of the strategy design pattern in the zoo application. Be prepared to explain how it follows the pattern and what advantage(s) it brought by doing so.

8.Be prepared to explain the basic nature of how to successfully implement a recursive algorithm.

Hint: What logical components must your recursive code have in order to avoid StackOverflowExceptions (and any other errors).

A Be prepared to explain the basic nature of how to successfully implement a recursive algorithm.
Completion review
9.Review the feature acceptance criteria
A Confirm the required results

Return to each story and verify its acceptance criteria. Preserve the submission format and destination stated in the activity; a reading, setup guide, lab, video demonstration, and oral final may require different evidence.

Prepare and explain the required designs