Exercise 2.1 Exercise 2.2 Exercise 2.3 Exercise 2.4 Exercise 2.5 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.
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
Interactive Exercise 2.1
3.
Interactive Exercise 2.1 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 (A)
4.
Interactive Exercise 2.1 Table of Contents Syllabi: CAC Syllabus Distributed Class Handouts: Programming Assignments Quizzes (Quiz #4 not included) Hour Exms Final Exam Graded Student Work: Programming Assignments Quiz #1 Quiz #2 Quiz #5 Graded Exams (B)
5.
Interactive Exercise 2.1 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 (C)
6.
Interactive Exercise 2.1 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 (A) = 5 points 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 Table of Contents Syllabi: CAC Syllabus Distributed Class Syllabus Handouts: Programming Assignments Quizzes (Quiz #4 not included) Hour Exms Final Exam Graded Student Work: Programming Assignments Quiz #1 Quiz #2 Quiz #5 Graded Exams (B) = 0 points There should be some indication as to how many programming assignments, quizzes, and hour exams are included. Quiz #3 is not listed. Inconsistent spacing between section listings. Incorrectly spelled word. 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.
Exercise 2.2 Choose the best syllabus excerpt for the CSCI 2620 Discrete Structures course. Each excerpt features the same sections of the syllabus. Interactive Exercise 2.2
10.
Interactive Exercise 2.2 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. (A)
11.
Interactive Exercise 2.2 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. (B)
12.
Interactive Exercise 2.2 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. (C)
13.
Interactive Exercise 2.2 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. (A) = 0 points Needs to be more specific; topics should be listed. Textbook title should be italicized. Books should be listed.
14.
Interactive Exercise 2.2 (B) = 10 points This excerpt’s entries are concise and consistent. 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.
15.
Interactive Exercise 2.2 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. (C) = 5 points Format for book entries should be consistent. Missing punctuation.
16.
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? Interactive Exercise 2.3
17.
Interactive Exercise 2.3 (A) 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 2240 1301 2240 2490 3202 4350 3330 4120 3410
18.
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 MATH 2240 CSCI 1301 CSCI 2240 CSCI 2490 CSCI 3202 CSCI 4350 CSCI 3330 CSCI 4120 CSCI 3410 Appendix H: Prerequisite Structure for Computer Science Courses Interactive Exercise 2.3 (B)
20.
Interactive Exercise 2.3 (A) = 0 points 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 2240 1301 2240 2490 3202 4350 3330 4120 3410 Node 3202 (not 3330) is the parent of 4120 and 4350. Without the CSCI and MATH prefixes, 2240 can not be determined. A heading for the appendix is needed.
21.
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 MATH 2240 CSCI 1301 CSCI 2240 CSCI 2490 CSCI 3202 CSCI 4350 CSCI 3330 CSCI 4120 CSCI 3410 Appendix H: Prerequisite Structure for Computer Science Courses Interactive Exercise 2.3 (B) = 10 points This is the most complete and accurate.
22.
Interactive Exercise 2.3 (C) = 5 points MATH 2240 CSCI 1301 CSCI 2240 CSCI 2490 CSCI 3202 CSCI 4350 CSCI 3330 CSCI 4120 CSCI 3410 Appendix H: Prerequisite Structure for Computer Science Courses A table of course numbers and course titles is needed.
23.
Exercise 2.4 Choose the best set of vitae excerpts to include as part of accreditation documentation. Interactive Exercise 2.4
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
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
Work Experience
- Graduate Assistant 2000-2003 Computer Science Department, Ohio State
Research Assistant Columbia State University 2003- 2004
Work Experience - North Carolina State University Assistant Dean, College of Arts and Sciences 1991-2003 - UNLV Associate Professor 1984-1991 Experience listings need to use same chronological ordering, and sections should be formatted the same. Use consistent bullets and indentions. 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. 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 Redundant Use complete school name and no abbreviations. Use consistent punctuation.
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.
Be the first to comment