online exsam

CS1150 Introduction to Computer Science Exam #2 Review

Group Activity – 3 Quizzes * 10 pts Each! (Only students present from begin to end are eligible to receive credit for this activity.)

You will have the full class period to complete the exam. You will have 50 multiple choice and true/false questions. You will be allowed to bring one 8.5” by 11” reference sheet with anything hand- written by you on the front only. These sheets will be turned in with your exam. No photocopied or printed materials are allowed. No books, Internet, notes, calculators, electronic devices, or any other materials beyond the single reference sheet are allowed. Please place all materials under your desk before beginning your exam. You may bring one additional blank sheet for scratch paper.

Group Activity A. Choose one person at your table to create a Word document called table_#_exam2_review.docx

(replacing # with the table number). Record all present members on your document at the top. B. Each table has been assigned to create problems based on the highlighted objectives for the

modules listed below. Choose who will work on each module. Students at each table are to work in groups of 2-3.

C. Create 2 problems and solutions based on the Highlighted objectives that may appear on a written exam (not multiple choice or true/false). Give them to the table representative to record on your document. The table rep should list solutions on a different page of the document than the questions.

D. Project your questions on the screen. As a table, review the questions and discuss the answers. E. Before the end of class, email a copy of your organized objectives, questions, and answers to

the instructor in one consolidated file.

Module 7 Objectives (Tables 1, 2, 4) 7-1. Students will be able to define pseudocode. 7-2. Students will be able to distinguish among using English, pseudocode, or a high level

language for solving the problem in terms of language (ambiguity in English), rules (syntax in high level language), and anything in-between (pseudocode).

7-3. Students will be able to determine the results in English of following a particular algorithm – which includes selection and loops (shown in English).

7-4. Students will be able to list the main operations that a computer can perform. 7-5. Students will be able to list and describe the phases of computer problem-solving. 7-6. Students will be able to list and describe strategies for problem-solving. 7-7. Students will be able to determine the correct flow of phase interactions for problem-

solving. 7-8. Students will be able to understand the concepts of an algorithm. 7-9. Students will be able to understand and implement the concept of a top down approach for a

particular problem. 7-10. Given an algorithm in English, students will be able to reconstruct the algorithm using

selection and/or looping statements where appropriate and vice versa. 7-11. Students will be able to distinguish between following an algorithm and developing one. 7-12. Students will be able to describe the pseudocode constructs used in expressing an algorithm. 7-13. Students will be able to construct an algorithm in English to solve a particular

problem. 7-14. Students will be able to design and implement a test plan for a small algorithm. 7-15. Students will be able to distinguish between a simple type and a composite type.

7-16. Students will be able to describe and distinguish between two composite data-structuring mechanisms.

7-17. Given a particular composite data structure, students will be able to determine if the structure is a record or an array, along with the reason.

7-18. Given an array, students will be able to determine the length of the array and the index number of any element – including an array of arbitrary length.

7-19. Students will be able to distinguish between an unsorted array and a sorted array. 7-20. Students will be able to choose and/or implement appropriate, efficient searching

techniques among sequential search or binary search for an unsorted or sorted array. 7-21. Students will be able to determine the display and/or correct result when subprograms

are used. 7-22. Students will be able to determine the number of checks needed to find a particular

item within and array of items using sequential or binary search. 7-23. Students will be able to determine the state of an array after each iteration of an

insertion sort. 7-24. Be able to apply either a sequential search or a binary search to an array of items. 7-25. Students will be able to trace through a particular algorithm and provide the results.

Module 8 Objectives (Tables 2, 4, 5) 8-1. Students will be able to determine the history and modern day uses of Javascript. 8-2. Students will be able to use Javascript constructs for input and output to perform a particular

task. 8-3. Students will be able to describe how to use comments in Javascript and why they are

needed. 8-4. Students will be able to implement Javascript while loops or for loops to solve a

particular problem. 8-5. Students will be able to use a combination of variables, when needed, Strings, numbers, and

their associated functions to perform a particular task. 8-6. Students will be able to evaluate and determine the output for statements that include

Strings, numbers, and associated functions. 8-7. Students will be able to evaluate a Javascript expression using any combination of

relational, logical, and/or arithmetic operations acted upon Strings and/or numbers. 8-8. Students will be able to determine when an expression results in NaN in Javascript. 8-9. Students will be able to construct or evaluate Javascript statements that include if-

then, if-then-else, if-then-else if, or looping statements. 8-10. Students will be able to construct output statements using either alert (and '\n') or

document.write (and <br>).

Module 9 Objectives (Tables 1, 4, 5) 9-1. Students will be able to name and describe the elements of a database management system. 9-2. Students will be able to pinpoint candidate attributes for a primary key and why. 9-3. Students will be able to describe the organization of a relational database. 9-4. Students will be able to establish relationships among elements in a database. 9-5. Students will be able to write basic SQL statements for one or more tables within a

database. 9-6. Students will be able to write or evaluate basic SQL statements that modify database

content. 9-7. Students will be able to evaluate basic SQL statements. 9-8. Students will be able to determine the resulting table from a basic SQL statement.