1 / 6

Final Exam Topics and Question Types

This guide provides information about the topics covered in the final exam, including algorithms, concepts, and lab-related questions. It also outlines various question types and the expected format for algorithm pseudo-code descriptions.

ginadraper
Download Presentation

Final Exam Topics and Question Types

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. General Comments about the Final • The final will primarily focus on the material in the last part of the course • Material from 1 through 6 that appear on the final will be listed in the following slides

  2. General Questions • Types of questions • Define the term • Whats the difference between? • What is? • When would it be used? • Give an advantage • Give a disadvantage • What is the purpose of? • Recall an important fact about a particular term

  3. Concept Questions • List advantages and disadvantages • Describe a concept in a few sentences • List operations, categories of information, conditions • List alternative approaches • List functions, policies, and mechanisms • How to questions • Give examples of

  4. Algorithm Understanding • Given a specific case, describe the results of an algorithm. These questions will be similar to examples that we went over in class • Algorithms include • Disk scheduling • Page replacement • Process scheduling • Exponential averaging

  5. Lab related questions • These questions will primarily focus on the last two labs • There could be a question related to an earlier lab about a concept that is important to the understanding of how our batch sequencing system works

  6. Algorithm Pseudo-code • Be able to describe the following algorithms in pseudo-code. • Producer consumer problem • Dining philosopher problem • Reader writer problem • Deadlock avoidance algorithm • Deadlock prevention algorithm • Disk scheduling algorithms • Note: Good pseudo code should have enough detail so a competent programmer could implement the algorithm based on the pseudo-code. It should not be so detailed that it would be easier to read the code than to read the pseudo-code

More Related