PART A : MULTIPLE CHOICE Circle the letter of the best answer (1 mark each)

Transcription

1 PART A : MULTIPLE CHOICE Circle the letter of the best answer (1 mark each) 1. An example of a narrowing conversion is a) double to long b) long to integer c) float to long d) integer to long 2. The key word this refers to a) The current class b) The current object instance c) The current method d) All of the above 3. Extending an object in C# is done by a) Overloading the parent s constructor in the child class b) Overriding the parent s constructor in the child class c) An assignment statement using the keyword new d) Using a colon in the class statement to reference the parent class 4. Garbage Collection a) Frees memory space for de-referenced objects b) Frees memory space for de-referenced functions c) Enforces encapsulation for object oriented programs d) Enforces encapsulation for procedural programs 5. Private attributes are a) Only accessible within the class that it belongs to b) Used to further promote encapsulation c) Accessible in other classes through accessor methods d) All the above 6. A conditional statement is one that a) Is used as a mechanism to repeat statements infinitely or a set number of times b) Restricts certain statements from being executed based on a Boolean outcome. c) Assigns a certain variable based on the value of a variable d) Implicitly casts a variable 7. A variable declared within the opening and closing parenthesis of a method is called a) An argument b) An operator c) A parameter d) An operand 8. Which loop is guaranteed to execute infinitely a) while (i > 0) b) do while(true) c) for(int i = 0; i< infinity; i++) d) while (5 < 3) 9. The keyword new is used to a) Create an is a relationship b) Create a section in memory c) Create a class d) All of the above 10. An example of a run-time exception might be a) Array index out of bounds b) Number of arguments in method call does not match method parameters c) Invalid assignment. Type mismatch. d) Expecting ; ICS3U FINAL EXAM 2010.doc 2

2 11. The state of an object is determined by a) The position of the program counter b) The values of the object s attributes c) Whether or not its constructor has been called d) None of the above 12. In visual studio a framework is a) Another name for a namespace b) A collection of classes c) A working environment for developing code d) A reusable design for a software system 13. You can modify Insertion Sort to make it faster by a) Continually dividing the list in half and searching recursively b) Sorting the list c) Reducing the list by one from the end each pass d) You cannot optimize Insertion Sort 14. You can modify Bubble Sort to make it faster by a) Continually dividing the list in half and searching recursively b) Sorting the list c) Reducing the list by one from the end each pass d) You cannot optimize a Bubble Sort 15. Aggregation is represented by a) Filled diamond b) Outlined diamond c) Arrow d) Multiplicity 16. UML stands for a) Unified Modeling Language b) United Modeling Language c) Uniform Mapping Language d) Undead Monster Lingo 17. Multiplicity refers to a) The number of allowable instances for related objects b) The number of objects in a program c) The number of attributes in an object d) The Multiplication operator in C# 18. A constructors return type is always a) Void b) Args[] c) Int d) A constructor has no return type 19. Bubble, Selection and Insertion Sort are all a) Divide and conquer algorithms b) Slow sorting algorithms c) Of O(n) d) Comparison sort 20. For a worst-case scenario the quick sort algorithm sorts at a) O(n) b) O(n 2 ) c) O(n*log(n)) d) O(log(n)) ICS3U FINAL EXAM 2010.doc 3

3 21. For an average case scenario the selection sort algorithm sorts at a) O(n) b) O(n 2 ) c) O(n*log(n)) d) O(log(n)) 22. For a best-case scenario the linear search algorithm searches at a) O(n) b) O(n(n-1)) c) O(log(n)) d) O(1) 23. If an algorithm runs at O(n*n/2) it is still considered to run at a) O(n) b) O(n 2 ) c) O(n*log(n)) d) O(log(n)) 24. Which of the following sorting algorithms is considered an online algorithm? a) Selection Sort b) Insertion Sort c) Bubble Sort d) Quick Sort 25. When comparing double values, which of the following should be used to check for equality? a) if ((avalue bvalue) < -0.1 && (avalue bvalue) > 0.1) b) if ((avalue bvalue) < -0.1 (avalue bvalue) > 0.1) c) if ((avalue bvalue) < 0.1 && (avalue bvalue) > -0.1) d) if ((avalue bvalue) < 0.1 (avalue bvalue) > -0.1) e) if (avalue == bvalue) 26. The last step of the 5-step problem solving method discussed in class is a) Testing b) Brainstorming c) Revision d) Defining the problem 27. Which of the following is an example of an implicit cast a) double d = (double) aninteger b) int i = Parse.Int32(d); c) int thenum = Int32.Parse(readNum); d) None of the above 28. Within a UML diagram a composite relationship is represented by a) A box b) A line connecting classes c) A diamond d) An arrow 29. A conditional statement to determine if an object instance is a certain type a) if ( triangle is Shape) b) if ( triangle = Shape) c) if ( triangle == Shape) d) if ( triangle.compareto(shape) > 0 ) 30. Integer variables have a data range of a) 2-64 < x < 2 64 b) 2-32 > x > 2 32 c) < x < 2 64 d) < x < 2 32 ICS3U FINAL EXAM 2010.doc 4

4 31. Arrays are restricted to a) The size of the data type range it is declared with b) Containing a single data type it is declared with c) Being indexed by a single data type d) All of the above 32. A method is used instead of a function when a) More than one argument is required b) A single, focused task needs to be completed c) A single or set of values needs to be calculated d) A return value is not necessary 33. Variables are named using a) Keywords b) Identifiers c) Assignments d) a & b 34. Which of the following properly describes the declaration of a for loop a) for ( end condition; increment; start index) b) for (initialization; end condition; increment ) c) for (increment; start index; end condition ) d) for (start index; end condition; increment ) 35. Which of the following variable names holds to naming convention a) atank b) thevar c) alist[] d) All of the above 36. A widening conversion a) Rounds the value down to a certain data range b) Rounds the value up to a certain data range c) Adds the capacity for larger values or precision d) Does not need to be cast explicitly 37. An object is very similar to a(n) a) Adjective / Property b) Verb c) Adverb d) Noun 38. An attribute is very similar to a(n) a) Adjective / Property b) Verb c) Adverb d) Noun 39. A method is very similar to a(n) a) Adjective / Property b) Verb c) Adverb d) Noun 40. The life span or limitations of the existence of a variable to which it can be assigned a value or referenced is called a variable s a) Namespace b) Scope c) Declaration d) Type ICS3U FINAL EXAM 2010.doc 5

5 PART B: SHORT ANSWER [44 Marks] 1. Using your knowledge of Object-Oriented Programming, state three differences between this style of programming and procedural programming. In other words, what does OOP allow you to do that otherwise was not previously possible or much difficult? (3 Marks) 2. a) Explain when it is necessary to use inheritance. (3 Marks) b) State three benefits to inheritance. (3 Marks) ICS3U FINAL EXAM 2010.doc 6

6 3. Describe the three different class relationships represented in a UML diagram. Give an example for each relationship and explain why they fit the description. (6 Marks) 4. Constructors a) How does the use of a constructor help in terms of object-oriented programming? (1 Mark) b) How is a constructor different from a method? Give three specific points that make constructors unique (3 Marks) 5. Write code (using a loop) that would output the following (5 Marks) ICS3U FINAL EXAM 2010.doc 7

7 6. Explain the difference between a compile-time and run-time exception and give an example for each (4 Marks) 7. Problem Solving Given a 10 x 10 grid with obstacles, a start and a finish target list two different ways a computer could find a path from the start to the finish. The computer can only move one step at a time up, down, left or right. For each algorithm list at least 4 basic steps you would take to get a solution path. YOU DO NOT NEED TO SHOW THE SOLUTION TO THE PROBLEM START FINISH Algorithm #1 (4 Marks) ICS3U FINAL EXAM 2010.doc 8

8 Algorithm #2 (4 Marks) 7. With the following array of numbers, sort the numbers showing all steps using the specified sorting algorithm. 1. Bubble Sort (4 Marks) Insertion Sort (4 Marks) ICS3U FINAL EXAM 2010.doc 9

9 PART C UML DIAGRAM [25 Marks] From frequent visits to your local corner store you have noticed the following: - The store has many employees, Cashiers and one Manager - Cashiers can make a transaction (sell a specific product) and take lunch break - The Manager can deal with customer complaints - There are two cash registers in the store - Each cash register has an amount of money - The store has many products - Products each have their own price - Products each have a category they belong to - Each customer has money - Each customer can hold up to 15 products - The store has two doors - Customers may enter or exist the store using one of the doors - Doors are either open or closed - Customers may purchase products (at their price) from a Cashier - Customers can file a complaint with the manager - A Cashier may take money out and put money into the cash register In the space below create a UML diagram for the store. Remember to choose carefully what represents an object, attribute, or method/function. [25 Marks] ICS3U FINAL EXAM 2010.doc 10

10 PART D - PROGRAMMING [25 Marks] How many distinct substrings does a given string S have? For example. if S = abc", S has 7 distinct substrings:, a, b, c, ab, bc, abc. Note that the empty string and S itself are considered substrings of s. On the other hand, if S = "aaa". S has only 4 distinct substrings:, a, aa, aaa. The first line of the input file contains N, the number of test cases. For each test case, a line follows giving S, a string of from 1 to 1000 alphanumeric characters. Your output consists of one line per case, giving the number of distinct substrings of S. Try to write an efficient program. Create an input file as follows for testing: Sample Input File 6 abc aaa abbabb aaaa abab abcd Output File for Sample Input ICS3U FINAL EXAM 2010.doc 11