1 / 37

Interactive Exercises Set 2

Interactive Exercises Set 2. There are five exercises in this set. Each question is followed by three answers. The best answer is worth ten points; the second best answer is worth five points; the remaining answer is zero. The answers are given following each question. Keep track of your score.

cameo
Download Presentation

Interactive Exercises Set 2

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. Interactive Exercises Set 2 There are five exercises in this set. Each question is followed by three answers. The best answer is worth ten points; the second best answer is worth five points; the remaining answer is zero. The answers are given following each question. Keep track of your score. Exercise 2.1 Exercise 2.2 Exercise 2.3 Exercise 2.4 Exercise 2.5

  2. Interactive Exercise 2.1 • Exercise 2.1 • Choose the table of contents that is best suited for a binder containing the following documents for the CSCI 1302 Advanced Programming Principles course: • CAC syllabus • Student syllabus • Informational handouts • Homework/programming assignment descriptions • Sample quizzes and tests • Graded student work

  3. Interactive Exercise 2.1 (A) Table of Contents Course: CSCI 1302 Advanced Programming Principles Text: Feldman, Software Construction and Data Structures, Addison-Wesley, 1999. Syllabi: CAC Syllabus Distributed Class Syllabus Handouts: Informational Handouts Programming Assignments Quizzes Hour Exams Final Exam Graded Student Work: Programming Assignments (in separate binder) Quizzes Graded Exams: Hour Exams Final Exam

  4. Interactive Exercise 2.1 (B) Table of Contents Syllabi: CAC Syllabus Distributed ClassHandouts: Programming Assignments Quizzes (Quiz #4 not included) Hour Exms Final Exam Graded Student Work: Programming Assignments Quiz #1 Quiz #2 Quiz #5 Graded Exams

  5. Interactive Exercise 2.1 (C) Table of Contents Course: CSCI 1302 Advanced Programming Principles Text: Feldman, Software Construction and Data Structures, Addison-Wesley, 1999. Syllabi: CAC Syllabus Distributed Class Syllabus Handouts: Informational Handouts Programming Assignments 1-3 Quizzes 1-2, 4-6 ** Quiz 3 not included Hour Exams 1-3 Final Exam Graded Student Work: Programming Assignments 1-3 Quizzes 1-6 Graded Exams: Hour Exams 1-3 Final Exam

  6. Interactive Exercise 2.1 (A) = 5 points Table of Contents Course: CSCI 1302 Advanced Programming Principles Text: Feldman, Software Construction and Data Structures, Addison-Wesley, 1999. Syllabi: CAC Syllabus Distributed Class Syllabus Handouts: Informational Handouts Programming Assignments Quizzes Hour Exams Final Exam Graded Student Work: Programming Assignments (in separate binder) Quizzes Graded Exams: Hour Exams Final Exam There should be some indication as to how many programming assignments, quizzes, and hour exams are included. The graded exams should be listed under the Graded Student Work heading to be consistent with the format used for listing items under the Handouts heading.

  7. Interactive Exercise 2.1 (B) = 0 points Table of Contents Syllabi: CAC Syllabus Distributed Class SyllabusHandouts: Programming Assignments Quizzes (Quiz #4 not included) Hour Exms Final Exam Graded Student Work: Programming Assignments Quiz #1 Quiz #2 Quiz #5 Graded Exams Inconsistent spacing between section listings. There should be some indication as to how many programming assignments, quizzes, and hour exams are included. Incorrectly spelled word. Quiz #3 is not listed. Exams should be subdivided into hour exams and final exam.

  8. Interactive Exercise 2.1 (C) = 10 points Table of Contents Course: CSCI 1302 Advanced Programming Principles Text: Feldman, Software Construction and Data Structures, Addison-Wesley, 1999. Syllabi: CAC Syllabus Distributed Class Syllabus Handouts: Informational Handouts Programming Assignments 1-3 Quizzes 1-2, 4-6 ** Quiz 3 not included Hour Exams 1-3 Final Exam Graded Student Work: Programming Assignments 1-3 Quizzes 1-6 Graded Exams: Hour Exams 1-3 Final Exam This syllabus is most complete, and indicates what material is missing.

  9. Interactive Exercise 2.2 Exercise 2.2 Choose the best syllabus excerpt for the CSCI 2620 Discrete Structures course. Each excerpt features the same sections of the syllabus.

  10. Interactive Exercise 2.2 (A) Current Catalog Description Introduction to a broad range of topics in Discrete Mathematics. Textbook Rosen, K., “Discrete Mathematics and Its Applications (Third Edition)”, McGraw-Hill; 1995. References Three books on Discrete Mathematics topics are placed on reserve in the campus library.

  11. Interactive Exercise 2.2 (B) Current Catalog Description Introduction to propositional and predicate logic, naïve set theory, relations and functions, graphs, finite automata, Turing machines, and formal languages and grammars. Textbook Rosen, K., Discrete Mathematics and Its Applications (Third Edition), McGraw-Hill, 1995. References Fundamentals of the Theory of Computation: Principles and Practice, R. Greenlaw and H.J. Hoover, Morgan Kaufmann, 1998. Introduction to Discrete Mathematical Structures, S. Stanton and R.T. Stowall, Howard Printing Services, 1999. Understanding Discrete Mathematics, R. Pepperdink, McGraw-Hill, 2001.

  12. Interactive Exercise 2.2 (C) Current Catalog Description Introduction to a broad range of topics in Discrete Mathematics including predicate logic, combinatorics, set theory, probability, and grammars. Textbook Rosen, K., Discrete Mathematics and Its Applications. References Fundamentals of the Theory of Computation: Principles and Practice, R. Greenlaw and H.J. Hoover, Morgan Kaufmann, 1998 Introduction to Discrete Mathematical Structures, S. Stanton and R.T. Stowall, Howard Printing Services, 1999. Understanding Discrete Mathematics, R. Pepperdink, 2001.

  13. Interactive Exercise 2.2 (A) = 0 points Needs to be more specific; topics should be listed. Current Catalog Description Introduction to a broad range of topics in Discrete Mathematics. Textbook Rosen, K., “Discrete Mathematics and Its Applications (Third Edition)”, McGraw-Hill; 1995. References Three books on Discrete Mathematics topics are placed on reserve in the campus library. Textbook title should be italicized. Books should be listed.

  14. Interactive Exercise 2.2 (B) = 10 points Current Catalog Description Introduction to propositional and predicate logic, naïve set theory, relations and functions, graphs, finite automata, Turing machines, and formal languages and grammars. Textbook Rosen, K., Discrete Mathematics and Its Applications (Third Edition), McGraw-Hill, 1995. References Fundamentals of the Theory of Computation: Principles and Practice, R. Greenlaw and H.J. Hoover, Morgan Kaufmann, 1998. Introduction to Discrete Mathematical Structures, S. Stanton and R.T. Stowall, Howard Printing Services, 1999. Understanding Discrete Mathematics, R. Pepperdink, McGraw-Hill, 2001. This excerpt’s entries are concise and consistent.

  15. Interactive Exercise 2.2 (C) = 5 points Current Catalog Description Introduction to a broad range of topics in Discrete Mathematics including predicate logic, combinatorics, set theory, probability, and grammars. Textbook Rosen, K., Discrete Mathematics and Its Applications. References Fundamentals of the Theory of Computation: Principles and Practice, R. Greenlaw and H.J. Hoover, Morgan Kaufmann, 1998 Introduction to Discrete Mathematical Structures, S. Stanton and R.T. Stowall, Howard Printing Services, 1999. Understanding Discrete Mathematics, R. Pepperdink, 2001. Missing punctuation. Format for book entries should be consistent.

  16. Interactive Exercise 2.3 Exercise 2.3 Suppose MATH 2240 Pre-calculus is a prerequisite for CSCI 1301 Programming; CSCI 1301 Programming is a prerequisite for all CSCI courses; and CSCI 3202 Architecture is a prerequisite for both CSCI 4120 Operating Systems and CSCI 4350 Artificial Intelligence. Which page should be used as Appendix H: Prerequisite Structure for Computer Science Courses?

  17. Interactive Exercise 2.3 (A) 2240 1301 2240 2490 3202 3330 3410 4120 4350 MATH 2240 Pre-calculus CSCI 1301 Programming CSCI 2240 Discrete Math CSCI 2490 C++ CSCI 3202 Architecture CSCI 3330 Languages CSCI 3410 Algorithms CSCI 4120 Operating Systems CSCI 4350 Artificial Intelligence

  18. Interactive Exercise 2.3 (B) Appendix H: Prerequisite Structure for Computer Science Courses MATH 2240 CSCI 1301 CSCI 2240 CSCI 2490 CSCI 3202 CSCI 3330 CSCI 3410 CSCI 4120 CSCI 4350 MATH 2240 Pre-calculus CSCI 1301 Programming CSCI 2240 Discrete Math CSCI 2490 C++ CSCI 3202 Architecture CSCI 3330 Languages CSCI 3410 Algorithms CSCI 4120 Operating Systems CSCI 4350 Artificial Intelligence

  19. Interactive Exercise 2.3 (C) Appendix H: Prerequisite Structure for Computer Science Courses MATH 2240 CSCI 1301 CSCI 2240 CSCI 2490 CSCI 3202 CSCI 3330 CSCI 3410 CSCI 4120 CSCI 4350

  20. Interactive Exercise 2.3 (A) = 0 points A heading for the appendix is needed. Without the CSCI and MATH prefixes, 2240 can not be determined. 2240 1301 2240 2490 3202 3330 3410 4120 4350 Node 3202 (not 3330) is the parent of 4120 and 4350. MATH 2240 Pre-calculus CSCI 1301 Programming CSCI 2240 Discrete Math CSCI 2490 C++ CSCI 3202 Architecture CSCI 3330 Languages CSCI 3410 Algorithms CSCI 4120 Operating Systems CSCI 4350 Artificial Intelligence

  21. Interactive Exercise 2.3 (B) = 10 points Appendix H: Prerequisite Structure for Computer Science Courses MATH 2240 CSCI 1301 This is the most complete and accurate. CSCI 2240 CSCI 2490 CSCI 3202 CSCI 3330 CSCI 3410 CSCI 4120 CSCI 4350 MAT 2240 Pre-calculus CSCI 1301 Programming CSCI 2240 Discrete Math CSCI 2490 C++ CSCI 3202 Architecture CSCI 3330 Languages CSCI 3410 Algorithms CSCI 4120 Operating Systems CSCI 4350 Artificial Intelligence

  22. Interactive Exercise 2.3 (C) = 5 points Appendix H: Prerequisite Structure for Computer Science Courses MATH 2240 CSCI 1301 CSCI 2240 CSCI 2490 CSCI 3202 CSCI 3330 CSCI 3410 CSCI 4120 CSCI 4350 A table of course numbers and course titles is needed.

  23. Interactive Exercise 2.4 Exercise 2.4 Choose the best set of vitae excerpts to include as part of accreditation documentation.

  24. Interactive Exercise 2.4 (A) Work Experience - Associate Professor, Auburn University 1998-2000 - Research Assistant, Columbia State 1996-1998 • Work Experience • - Graduate Assistant 2000-2003 Computer Science Department, Ohio State • Research Assistant Columbia State 2003- 2004 Work Experience - North Carolina State Assistant Dean, College of Arts and Sciences 1991-2003 - UNLV Associate Professor 1984-1991

  25. Interactive Exercise 2.4 (B) Work Experience 1996-1998 Research Assistant, Columbia State 1998-2000 Associate Professor, Auburn University Work Experience 2000-2003 Graduate Assistant Computer Science Department Ohio State 2003-2004 Research Assistant Columbia State 2003- 2004 Work Experience 1984-1991 Associate Professor University of Nevada at Las Vegas 1991-2003 NC State Assistant Dean, College of Arts and Science

  26. Interactive Exercise 2.4 (C) • Work Experience: • Research Assistant Columbia State University 1996-1998 • Associate Professor Auburn University 1998-2000 • Work Experience: • Graduate Assistant Ohio State University 2000-2003 • Research Assistant Columbia State 2003- 2004 • Work Experience: • Associate Professor University of Nevada at Las Vegas 1984-1991 • Assistant Dean North Carolina State University 1991-2003

  27. Interactive Exercise 2.4 (A) = 0 points Work Experience - Associate Professor, Auburn University 1998-2000 - Research Assistant, Columbia State University 1996-1998 Use consistent bullets and indentions. • Work Experience • - Graduate Assistant 2000-2003 Computer Science Department, Ohio State • Research Assistant Columbia State University 2003- 2004 Experience listings need to use same chronological ordering, and sections should be formatted the same. Work Experience - North Carolina State University Assistant Dean, College of Arts and Sciences 1991-2003 - UNLV Associate Professor 1984-1991 Avoid abbreviations whenever possible.

  28. Interactive Exercise 2.4 (B) = 5 points Work Experience 1996-1998 Research Assistant, Columbia State 1998-2000 Associate Professor, Auburn University. Use consistent punctuation. Work Experience 2000-2003 Graduate Assistant Computer Science Department Ohio State 2003-2004 Research Assistant Columbia State 2003- 2004 Use complete school name and no abbreviations. Redundant Work Experience 1984-1991 Associate Professor University of Nevada at Las Vegas 1991-2003 NC State Assistant Dean, College of Arts and Science

  29. Interactive Exercise 2.4 (C) = 10 points • Work Experience: • Research Assistant Columbia State University 1996-1998 • Associate Professor Auburn University 1998-2000 These entries are consistent and properly formatted. • Work Experience: • Graduate Assistant Ohio State University 2000-2003 • Research Assistant Columbia State 2003- 2004 • Work Experience: • Associate Professor University of Nevada at Las Vegas 1984-1991 • Assistant Dean North Carolina State University 1991-2003

  30. Interactive Exercise 2.5 Exercise 2.5 Choose the best page to use when describing classroom equipment in accreditation documentation.

  31. Interactive Exercise 2.5 (A) Classroom Equipment Computing Labs LocationMachineQuantity Science Center 1503 Dell Dimension 8300 Hewlett Packard LaserJet 4100 Science Center 1950 Dell Dimension 8250 Hewlett Packard ColorJet 4550 Science Center 2016 Dell Dimension 8250 Hewlett Packard LaserJet 4100 Student Hall 1051 Visor Handspring Deluxe PDA University Hall 130 MacIntosh Power Mac G4 Hewlett Packard ColorJet 8550 Classrooms LocationMachineQuantity Science Center 1504 Dell Latitude notebook inFocus LP130 projector Science Center 2017 Dell Latitude notebook inFocus LP130 projector 951 601 601 20 411 11 11

  32. Interactive Exercise 2.5 (B) • Classroom Equipment • Computing Labs • 256 computers • 4 printers • 20 PDAs • Classrooms • 2 notebooks • 2 projectors

  33. Interactive Exercise 2.5 (C) Classroom Equipment

  34. Interactive Exercise 2.5 (A) = 10 points Classroom Equipment Computing Labs LocationMachineQuantity Science Center 1503 Dell Dimension 8300 Hewlett Packard LaserJet 4100 Science Center 1950 Dell Dimension 8250 Hewlett Packard ColorJet 4550 Science Center 2016 Dell Dimension 8250 Hewlett Packard LaserJet 4100 Student Hall 1051 Visor Handspring Deluxe PDA University Hall 130 MacIntosh Power Mac G4 Hewlett Packard ColorJet 8550 Classrooms LocationMachineQuantity Science Center 1504 Dell Latitude notebook inFocus LP130 projector Science Center 2017 Dell Latitude notebook inFocus LP130 projector This layout is good. 951 601 601 20 411 11 11

  35. Interactive Exercise 2.5 (B) = 0 points • Classroom Equipment • Computing Labs • 256 computers • 4 printers • 20 PDAs • Classrooms • 2 notebooks • 2 projectors Not enough information.

  36. Interactive Exercise 2.5 (C) = 5 points Classroom Equipment This font is not the same as the rest. All table captions should be aligned consistently.

  37. Interactive Exercises Set 2Score • A = 45 - 50 • B = 40 - 44 • C = 35 - 39 • D = 30 - 34 • F < 30

More Related