Main Menu Exercise Set 1 Exercise Set 2 Interactive Exercises Set 2 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.
37
Embed
Main MenuExercise Set 1Exercise Set 2 Interactive Exercises Set 2 Exercise 2.1 Exercise 2.2 Exercise 2.3 Exercise 2.4 Exercise 2.5 There are five exercises.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
Interactive Exercises Set 2
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.
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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
Interactive Exercise 2.1
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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
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)
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
Interactive Exercise 2.1
Table of Contents
Syllabi: CAC Syllabus Distributed Class
Handouts: Programming Assignments Quizzes (Quiz #4 not included) Hour Exms Final Exam
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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
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.
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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
This syllabus is most complete, and indicates what material is missing.
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 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.
Interactive Exercise 2.2
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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.
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)
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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.
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)
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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.
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)
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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.
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.
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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.
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.
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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.
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.
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2
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
Main MenuMain MenuExercise Set 1Exercise Set 1 Exercise Set 2Exercise Set 2