C++ Classes and Data Structures Jeffrey Childs Test Bank

Type:

Test Bank

Resource:

C++ Classes and Data Structures

Edition:

1st Edition

Author(s):

Jeffrey Childs

Chapter 1 Multiple Choice (Chapter 1) 1) In C++, a data structure is often an object that is made from a ____________.

A. function B. struct C. variable D. class 2) A(n) _________ is often defined for a record of information.

A. array B. struct C. function D. variable 3) The variables declared within a struct definition are called: A. components B. data members C. characteristics D. clients 4) When a programmer writes a definition to make a new type to be used for a declaration, the new type is called a: A. programmer-defined type B. client-defined type C. struct-defined type D. user-defined type 5) By convention, a _____________ includes public and private sections.

A. class B. class function C. struct D. data member 6) A(n) ______________ is made from a class.

A. data member B. class function C. object D. blueprint 7) hiding data from outside entities (the way the private section of a class hides data from the main program) describes ___________________.

A. encapsulation B. maintenance C. poor programming practice

D. invisibility 8) The __________ section of a well-written class does not contain data members.

A. private B. specification C. specification File D. public 9) The data member declarations of a class are found in the _________________.

A. public section B. private section C. function definitions D. function prototypes 10) The public section of a class is also referred to as the _________________.

A. class interface B. maintenance area C. data member section D. class implementation 11) ____________________ refers to how something was put into code.

A. Design B. Maintenance C. Implementation D. Specification 12) The file that contains the class definition is called the ___________________.

A. class implementation file B. main program file C. class specification file D. client file 13) The file that contains the class function definitions is called the ________________.

A. class specification file B. header file C. main program file D. class implementation file 14) A file that has a .h extension is called a _____________________.

A. main program file B. class specification file C. class implementation file D. header file 15) A _____________ is a person who makes use of a class when writing a program.

A. client

B. user C. maintainer D. class specialist 16) A ________________ is a program that uses a class.

A. function B. main function C. user program D. client program 17) A ________________ is used to test a class.

A. class tester B. testing machine C. class interface D. test driver 18) ______________ is work done on a program after it has been put into operation.

A. Class specification B. Class implementation C. Operation implementation D. Maintenance 19) When a function name, like setBalance, describes what the function does, it is an example of: A. a function prototype B. self-documenting code C. function implementation D. encapsulation 20) Suppose we have a struct called Employee, we have an object declared from the struct called emp, and we have a data member of the struct called salary. To access the salary data member of emp, we would use the code: A. emp[salary] B. Employee.emp[salary] C. emp( salary ) D. emp.salary 21) Suppose we have a class called Fish, an object of the Fish class called salmon, a class function called eat, and we would like to pass the string “worm” into the eat function. The line of code for doing this would look like this: A. Fish.eat( “worm” ); B. eat( “worm” ); C. salmon.eat( “worm” ); D. Fish.salmon( eat.worm );

22) When a main program communicates with the object of a class, the first step of the communication involves: A. a class function using its data members to prepare for the communication B. a signal sent from the main program to a class data member C. the call of a class function from the main program D. the call of a client function from the main program 23) In the past, most of the work was spent on designing, coding, and testing programs, while little work is spent on maintenance; today, most of the work on a program is spent on maintenance. The main reason for this trend is because.

A. people don’t spend as much time designing as they used to B. customers complain more often today than in the past C. programmers are intentionally making programs buggier, so they can spend more time maintaining them – it’s job security D. in the past, programs were small and could easily be rewritten; now, programs are humongous, and it is more cost-effective to maintain them 24) The main advantage to declaring a variable within a class definition is that: A. you only have to declare it once B. the object made from the class will remember the value of the variable, even when a function of the object is not executing C. it allows you to write class functions to access the value of the variable D. you might declare a variable that is not useful, and the client will never know 25) The main program is often called a client program because: A. a client (computer user) uses the main program B. a class is often a client of a main program C. a single class can be used by many different main programs, so the class can be thought of as a service, while the main programs that use the service are clients D. special programmers, called clientia, write them

Answers to Multiple Choice (Chapter 1) 1) D 2) B 3) B 4) D 5) A 6) C 7) A 8) D 9) B 10) A 11) C

12) C 13) D 14) A 15) A 16) D 17) D 18) D 19) B 20) D 21) C 22) C 23) D 24) B 25) C

Short Answer (Chapter 1) 1) Explain what happens when an object of a struct is assigned to another object of the same struct.

2) When using structs, explain the difference between a definition and a declaration.

3) Explain why we cannot use the data members of a struct definition without a declaration.

4) Explain what the difference is between a class and an object.

5) What is(are) the difference(s) between a class and a struct.

6) In an #include preprocessing directive, what is the difference between putting a header file in double quotes “ “ and putting a header file in angle brackets < >. Explain how the compiler handles each of these instances.

7) How does a function definition in a class implementation file differ from a function definition in a main program file?

8) How do structs compare to arrays? Explain similarities and differences.

9) Why is a class object thought of as being separate from the rest of the program?

10) Why don’t we place function definitions in the public section of a class specification file?

Essay (Chapter 1) 1) Explain why encapsulation is advantageous, and why it is a good idea for class functions, rather than main programs, to directly access data members of a class.

2) There are two ways of declaring a variable within class code. We may declare it in the private section, or we may declare it locally within a class function definition.

Explain when we should use each, and why it is advantageous to use each one when it should be used.

3) Explain why we should not obtain user information or provide messages to users within class functions.

4) Explain why we should test each individual class as it is made, rather than writing a program that uses many classes and testing the whole system at one time.

Chapter 2 Multiple Choice (Chapter 2) 1) A function written to handle operations involving one or more objects is a: A. overloaded operator function B. operation function C. objective function D. class function 2) An operator acts upon: A. variables, constants, and objects B. variables and numbers only C. variables, constants, and numbers only D. numbers only 3) An operator that involves only two operands is a: A. operand operator B. binary operator C. unary operator D. ternary operator 4) Operators act upon: A. operations B. overloaded operator function calls C. operands D. additions, subtractions, multiplications, and divisions, to name a few 5) One or more classes can be made from a(n) ________________________.

A. object B. blueprint C. class template D. class implementation file 6) __________ means place an element on top of a stack.

A. Push B. Pop C. Peek D. Top

7) ____________ means remove an element from the top of a stack.

A. Push B. Pop C. Peek D. Top 8) ____________ means retrieve the element at the top of a stack without removing it.

A. Peek B. Top C. Push D. Pop 9) LIFO stands for: A. Lifetime Object B. the Lipton Information Formatting Operation C. Loadable Input Float Operator D. Last-in, First-out 10) ____________ occurs when we just use something without thinking about the details of how it works.

A. Poor programming B. Abstraction C. Detail ignorance D. Encapsulation 11) A(n) __________________ is a data type that consists of data and functions that act upon the data.

A. overloaded operator type B. class template type C. LIFO D. ADT 12) The fact that a stack can consist of a stack of floats, a stack of ints, a stack of objects, a stack of strings, etc., illustrates: A. how class templates can come in handy for data structures B. that stacks need overloaded operator functions C. abstraction D. that a push or pop might not work for every situation 13) The stack and string are examples of: A. abstract data types B. overloaded operator functions C. struct objects D. Lipton Information 14) When the left operand of a binary operation is a struct object:

A. the overloaded operator function for the binary operator must be written beneath the struct definition B. the overloaded operator function for the binary operator should be written inside the struct definition C. an overloaded operator function cannot be written for the binary operator D. a compiler error occurs 15) When the left operand of a binary operation is not an object, but the right operand is a struct object: A. a compiler error occurs B. the overloaded operator function for the binary operator must be written beneath the struct definition C. the overloaded operator function for the binary operator should be written inside the struct definition D. an overloaded operator function cannot be written for the binary operator 16) To tell a compiler that a class specification file contains a class template, rather than a class: A. the phrase “CLASS TEMPLATE” must be written at the top of the file and must be in capital letters.

B. the word DataType must appear somewhere in the class C. we can use the line of code template <class DataType> directly above what would otherwise be the class definition D. we #include the class implementation file at the end of the class specification file 17) Suppose we have a class template called Stack, and we wish to make a class from the class template for a stack of strings. We also wish to declare a stack object called stk using this stack class. To do this, in the main program we would type the line of code: A. Stack stk<string>; B. Stack string<stk>; C. Stack<stk> string; D. Stack<string> stk; 18) Suppose that a client uses a struct object for the DataType of a class template, and this will require that operators (used within the class functions) are overloaded. The best way to tell a client which operators will need to have overloaded operator functions, and how the functions should be written, is to: A. send the client a detailed email about all required overloaded operator functions B. place comments above the class template that specify the details of the required overloaded operator functions C. write details about the required overloaded operator functions into the client’s main program D. You shouldn’t tell the client how to do it – you should write the overloaded operator functions yourself, and place them in another file

19) The first step involved in making a class out of a class template is: A. the compiler substitutes the type in angle brackets for DataType throughout the class.

B. the compiler encounters the line of code: template <class DataType> C. the compiler encounters the declaration of an object using a class template with a data type specified in angle brackets D. none of the above 20) Suppose you need to make two overloaded operator functions for the minus operator, placing them both in the same struct definition. You can do this as long as: A. their parameters are of different types B. one passes in one parameter, and the other passes in two parameters C. the return types are different for both D. both the return types and the parameters are of different types 21) There is only one parameter for an overloaded operator function (for a binary operator) when it is placed into a struct definition because: A. there is only one return value B. the left operand is not an object, so it must be passed into the parameter C. if there were two parameters, the compiler would not know which one to use D. the overloaded operator function is called for the operand on the left (which must be an object of a struct), so the right operand is passed in as a single parameter 22) If you write an overloaded operator function for a class (for a binary operator), where the left operand is not an object, the function heading of the overloaded operator function in the class implementation file does not include the class name followed by the double colon (::) because: A. the class name followed by the double colon tells the compiler that the function prototype that corresponds to this function definition is found within that class definition, and the function prototype would appear beneath the class definition B. it is never necessary to do this for overloaded operator functions of classes C. the overloaded operator function belongs to the class already D. the right operand cannot be an object of the class either 23) In the expression x = y * z, where y and z are objects of a struct, the function call for the overloaded operator function for * consists of: A. the expression y * z B. the expression x = y * z C. the operator * D. It is impossible to tell without more information 24) It is possible to have a void return type from an overloaded operator function because: A. it is the only return type allowed in an overloaded operator function B. the function call might consist of the entire line of code C. void is often used in operations D. there might not be any input parameter

25) A class template is used for a stack because: A. stacks need overloaded operator functions B. stacks require abstraction C. a stack is a stack of elements, where the elements can be of any type D. a stack is an abstract data type

Answers to Multiple Choice (Chapter 2) 1) A 2) A 3) B 4) C 5) D 6) A 7) B 8) A 9) D 10) B 11) D 12) A 13) A 14) B 15) B 16) C 17) D 18) B 19) C 20) A 21) D 22) A 23) A 24) B 25) C

Short Answer (Chapter 2) 1) If the left operand of a binary operator is not an object, but the right operand is an object of a struct, explain why the overloaded operator function cannot be placed within the struct definition.

2) If an operand of a binary operation is an object, why must an overloaded operator function be written?

3) Explain what happens with the value returned from an overloaded operator function.

4) Explain why it is necessary to have two parameters for an overloaded operator function when the left operand is not an object.

5) Suppose the left operand is not an object for an addition operation, but the right operand is an object of a struct. Explain why it is possible to have two different overloaded operator functions for addition, yet for each one, the right operand is an object of the same struct.

6) What is the difference between the way overloaded operator functions are written for structs and the way they are written for classes?

7) Explain what the difference is for large program development with and without abstraction.

Essay (Chapter 2) 1) Describe the advantages of using a class template over a regular class.

2) Describe how #include is used for class specification files and class implementation files for classes and class templates and why it is used differently.

3) Describe the differences in overloaded operator functions when the left operand is an object and when the left operand is not an object, and the reasons for these differences.

Chapter 3 Multiple Choice (Chapter 3) 1) When const is placed at the end of a function prototype (preceding a semicolon), it indicates: A. that the returned value must be a literal number instead of the value of a variable B. that a variable cannot be passed in as a parameter C. that the function returns the same value every time D. that the values of the data members declared within the class definition will not change during execution of the function 2) When an object is passed as a parameter into a function and the object will not change within the function, we should pass the object by: A. reference B. value C. copy D. const reference 3) A(n) ____________________ is commonly used to initialize the data members of a class when an object is first made.

A. const function B. const reference function C. initializer D. constructor

4) A(n) _________________ constructor is a constructor that has no parameters.

A. empty B. default C. poorly written D. null 5) A(n) ______________ array is an array that typically fills with elements from beginning to end, then starts filling with elements at the beginning again, overwriting the elements that are already there..

A. overwriting B. looping C. circular D. Johnson 6) Suppose that the price of an item is stored as an integer (number of cents) within a data member of a class. When the client wants to set the price, however, a setPrice function is called which passes a number in as dollars and cents (a float), then it is converted and stored as cents by the setPrice function. This is an example of: A. a const function B. a const reference function C. an accessor function D. data translation 7) When const is used at the end of a function prototype (preceding the semicolon), the following are true EXCEPT A. const must also be placed at the end of the function heading of the corresponding function in the implementation file B. when the function is called from the main program, it is called the same way as if const were not even used C. the returned value must be a literal number instead of the value of a variable D. it can aid in debugging 8) If we want to pass a DataType parameter called item by const reference into a function bar, the function prototype for bar would look like this: A. bar( DataType & item ) const; B. bar( DataType const & item ); C. bar( DataType & item const ); D. bar( const DataType & item ); 9) Suppose a constructor with no parameters needs to be written for a Foo class (not a class template). The function heading of the Foo constructor in the implementation file would look like this: A. Foo( ) B. void Foo::Foo( ) C. Foo::Foo( )

D. void Foo( ) 10) Suppose we wish to use a constructor of a Foo class (not a class template) that passes in one integer parameter. We wish to make an object called f and pass 5 into this constructor. The code for doing so would look like this: A. f.Foo( 5 ); B. Foo( 5 ) f; C. Foo f( 5 ); D. f( Foo( 5 ) ); 11) We wish to modify a class while keeping it backward compatible. Which of the following can we successfully do?

A. Remove a function.

B. Change a function’s return type from a float to a char C. Add another parameter to a function D. Add a new function to the class 12) We wish to modify a class, but we cannot do so while keeping it backward compatible. A reasonable approach is to: A. rename the class B. form a new class, like the existing class but modified the way we want, and keep the existing class C. use a Peterson Language Modifier, go to the Build menu, select Interface, then select the modifications that prevented the class from being backwards compatible, and finally, click on the modify interface button, being careful not to drag the modifications D. make a class template, using DataType for the function name 13) We wish to have a Checkbook class template where we use DataType for the type of the deposit in the deposit function (instead of the check in the writeCheck function). The client might use a Deposit struct object for DataType, containing the amount to deposit, the date of the deposit, and other information. The deposit function will only add the amount of the deposit to the balance (a data member in the private section), and then store the Deposit object in a data member of the Checkbook class called lastDeposit. The deposit function has a single parameter of DataType (for depositing), which should be passed by: A. const reference B. value C. copy D. reference 14) We wish to make a constructor for a Bar class that will only initialize two of its data members x and y to -1 and 0, respectively. The constructor we make should: A. pass in two parameters by value B. pass in, by value, one struct object with two data members C. be a default constructor D. pass in two parameters by const reference

15) Suppose we have a WashingMachine class and we have a function called raisePrice, which passes in an amount to raise the price by. After the class has been in use by a number of clients, we wish to add more to the raisePrice function, passing in two parameters, the amount to raise the price by and the date the price is being raised. We should: A. make a new function, perhaps calling it raisePriceAndDate, which passes in these two parameters, while keeping the old raisePrice function in the class.

B. change the raisePrice function to pass in the two parameters.

C. change the amount parameter from a float type to a struct object type that has data members for amount and date.

D. turn the class into a class template and use DataType for the function name 16) We wish to keep track of the last ten flights that leave a gate of an airport. We make a FlightHistory class with an array that can store ten flight numbers. Since many more than ten flights will eventually leave the gate, to keep track of the last ten flights, we should use a: A. overwriting array B. looping array C. Johnson array D. circular array 17) Suppose we have an integer data member in a class called errorCode. There is also a function of a class called getError. Since the client cannot understand what the integer value means in the errorCode, the getError function returns a string that gives the meaning of the current integer value. This is an example of: A. a const reference function B. a const function C. data translation D. poor programming practice 18) A compiler complains that there was an attempt to change the value of a data member within a function (when const is correctly used at the end of the function prototype). This is an example of: A. a picky compiler B. abstraction C. a const reference function D. how const aids in debugging 19) One reason to pass a parameter by const reference is: A. we do not want the function to change the values of any data members B. we want changes in the parameter to be reflected back to the calling function C. we want to constantly use pass by reference D. the compiler will catch an attempt to change the value of the parameter

20) Suppose we want a constructor for a class that does nothing, and we will never want to write a constructor that does something. It is good programming practice to: A. write a constructor that does nothing (has no parameters and no lines of code in its function block) B. leave the constructor out, because the same type of constructor will be supplied by the compiler automatically C. make a null constructor D. make a constructor that sets all integer data members to 0 21) Suppose a data member of a class is to be given an initial value. We have a function that clients can use for setting the initial value called setValue. For this particular data member, after the setValue function has been used once, there is no reason to use it again.

Clients have been using this class for a while, but later on we realize that we could have just made a constructor that sets the initial value, saving the client from having to use a call to the setValue function. We should: A. add the new constructor and take the setValue function out B. leave the class the way it is, to avoid client confusion C. add the new constructor and leave the setValue function in D. send an email of apology to the clients 22) We want to initialize the data members of a class to some particular values that the client selects. To do this, we should write a: A. default constructor B. constructor that has parameters C. constructor with const at the end of the function prototype D. constructor that returns true or false, depending on whether or not the initialization could be done 23) Suppose we write a function for a class which is not supposed to change any data members in the class. When we test the class, we get a runtime error. After tracking down the source of the runtime error, we realize that this function mistakenly changed the value of a data member. To make things easier, we should have: A. passed parameters into the function using const reference B. declared all the data members as constant (using const at the front of their declarations) C. used const at the end of the function prototype D. used a Peterson Language Modifier 24) Suppose we have two constructors for a class, one that passes in parameters and one that doesn’t. Which of the following is true?

A. Because we have two constructors when there should only be one, we will get a compiler error when we try to compile the program.

B. The client will be able to use the constructor that passes in parameters, but the client will not be able to use the constructor that doesn’t pass in parameters.

C. The client can use either one of these constructors, whichever one suits his/her needs.

D. It would be extremely poor programming practice for the client to use the constructor that passes in no parameters.

25) Suppose there are only two constructors for a class, one that passes in a single integer parameter called amount, for setting an amount data member, and another that passes in a single integer parameter called code, for setting a code data member. Which of the following is true?

A. An error exists in the class.

B. Everything will be fine as long as the program can tell the difference between amount and code.

C. We need to use a Peterson Language Modifier.

D. We need to use different return types for the constructors.

Answers to Multiple Choice (Chapter 3) 1) D 2) D 3) D 4) B 5) C 6) D 7) C 8) D 9) C 10) C 11) D 12) B 13) A 14) C 15) A 16) D 17) C 18) D 19) D 20) A 21) C 22) B 23) C 24) C 25) A

Short Answer (Chapter 3) 1) When modifying a class that has been in use by clients, why is it safe to change the void return type of a function to some other type?

2) When an object of a class is made, is a constructor called when the class programmer doesn’t write a constructor? Why or why not?

3) Compare a function that uses const at the end of its function prototype to a function that does not (and could). Discussing different types of errors that are possible during programming, explain why it is advantageous to use const.

4) Why should we pass a parameter by const reference (when it is appropriate) instead of by reference?

5) Is it possible to make more than one constructor for a class? If not, why not? If so, how must the constructors differ?

6) If a class has been in use by clients, explain what problem exists when we develop a new function A for a class and remove a function B from a class (which has become obsolete through the introduction of function A).

7) If a class has been in use by clients, explain what problem exists when we change the number of parameters of a certain class function from one to two.

Essay (Chapter 3) 1) If a class has been in use by clients, discuss what we can successfully change in the class interface, and why.

2) Compare the different ways of passing parameters, explain when we should use each way, and why.

3) Discuss all the different ways that a constructor differs from a regular class function.

Chapter 4 Multiple Choice (Chapter 4) 1) A pointer is: A. a variable that stores a location B. a variable that stores a variable name C. a variable that stores an address D. a variable that stores the value of another variable 2) Memory that is allocated to a program during runtime is: A. dynamically allocated memory B. statically allocated memory C. runtime memory D. runtime allocated memory 3) A binary number used by the operating system to identify a location is a(n): A. address B. binary locator C. pointer D. operating system identifier

4) The address of a variable or object can be obtained by using: A. the address-of operator & B. the dereference operator * C. its location D. the [ ] operator 5) Using the dereference operator * always gives a(n): A. address B. value C. variable name D. location 6) When a pointer points to a variable or object, it means that the pointer: A. contains the name of that variable or object B. contains the location of that variable or object C. contains the address of that variable or object D. contains the same data as that variable or object 7) A variable is a: A. location B. name C. value D. constant 8) The ______ is an area of memory reserved for program use during runtime.

A. usable area B. runtime area C. active memory area D. heap 9) The only operator that can dynamically allocate memory is: A. the new operator B. the address-of operator & C. the dereference operator * D. the delete operator 10) An array that is made using dynamically allocated memory is a: A. static array B. dynamic array C. circular array D. heap array 11) An array which has memory space set aside for it at compile time is a: A. heap array B. static array C. dynamic array

D. circular array 12) The ________ operator is used to free memory that is no longer needed, so that it is effectively made available in the heap again.

A. new B. delete C. address-of D. dereference 13) If heap memory has been dynamically allocated, but nothing contains the address of the dynamically allocated portion, then we have: A. memory leak B. a desirable situation C. a condition known as unaddressed heap memory D. never used the new operator 14) If the new operation is unsuccessful because of a lack of heap memory, what happens?

A. The new operation returns false B. An exception is thrown C. The compiler takes over and provides memory D. The program enters an infinite loop 15) The try clause is a section of code which behaves like any other section of code unless: A. a line of code in the try clause contains a syntax error B. what it tries to do could be done C. an exception is thrown D. there is a catch clause within the try clause 16) The _____________ is used to catch an exception.

A. try clause B. exception clause C. catch clause D. exception catcher 17) If an exception is thrown in C++, it may be because: A. there was not enough heap memory to satisfy a new operation B. the compiler found the code to be exceptionally confusing C. an exception catcher is ready to catch it D. the exception, being confined to an addressable location, was recently released by a faulty exception clause 18) If an exception is caught in C++, the most likely reason is because: A. a catch clause was written to catch it B. the exception was not a wild exception

C. the exception was not a random exception D. the exception was “tried” by a try clause and found to be guilty (that is, incorrectly programmed) 19) An adjustable array is: A. an array whose elements are adjustable based upon exceptions B. a static array C. an array that can be adjusted to be a static array or a dynamic array, whichever is more important at the time D. an array whose size can change depending upon the number of elements it stores 20) Suppose we want to declare a pointer called ptr which can hold the address of a float.

Its declaration would look like this: A. float ptr *; B. *float ptr; C. &float ptr; D. float *ptr; 21) Suppose that we want to get the address of a variable called item. We can obtain its address with the expression: A. item& B. &item C. address( item ) D. address-of( item ) 22) Suppose we wanted to dereference a pointer called ptr. This would be done by the expression: A. dereference( ptr ) B. ptr.dereference( ) C. ptr* D. *ptr 23) We want a pointer called ptr to hold the address of a space in the heap large enough for an integer. We would use the line of code: A. new ptr = new int; B. new ptr = int; C. ptr = int new; D. ptr = new int; 24) We would like to make a dynamic array that can store 10 Check objects, and we would declare arr to be the “name” of the array. We would use the line of code: A. Check *arr = new Check arr[ 10 ]; B. Check arr = new Check [10]; C. Check *arr = new Check [10]; D. Check new *arr[10];

25) We would like to free the dynamic array pointed to by arr. We would use the following line of code: A. arr [ ] delete; B. arr delete; C. delete [ ] arr; D. delete arr; Answers to Multiple Choice (Chapter 4) 1) C 2) A 3) A 4) A 5) D 6) C 7) A 8) D 9) A 10) B 11) B 12) B 13) A 14) B 15) C 16) C 17) A 18) A 19) D 20) D 21) B 22) D 23) D 24) C 25) C

Short Answer (Chapter 4) 1) Why would we ever want to use an array that can adjust its size?

2) Why isn’t an array name a pointer?

3) Give an advantage of a dynamic array over a static array.

4) Why is it desirable to prevent memory leak?

5) If the number of elements can change quite a bit, why is an adjustable array better than a static array?

6) What is the difference between a variable name and a variable?

7) When a location is used on the left side of an assignment, how is it different than when a location is used on the right side of an assignment?

8) Give an example of a situation where we would want to use an adjustable array and explain why.

9) Give an example of a situation where we would want to use a dynamic array (without adjusting it) and explain why.

10) Give an example where it would be sufficient to use a static array and explain why.

Essay (Chapter 4) 1) Discuss some ways that memory leak can occur.

2) Explain how the [ ] operator produces a location.

3) Explain all of the steps that take place when the new operator is used, including what happens if there is not enough heap memory to satisfy a new operation.

4) Explain all of the steps involved in changing the size of an adjustable array.

5) Explain how try and catch clauses are involved in throwing exceptions, and how they work.

Chapter 5 Multiple Choice (Chapter 5) 1) Which of the following is true, when we inline a function?

A. It tells the compiler to substitute the function body (for the inlined function) for any function calls made (using that inlined function) throughout the program code.

B. It indicates that the function should return by reference.

C. For class templates, we must write the function definition where the function prototype would normally be, in the class definition.

D. We are not indenting the body of the function, so that the body of the function is in line with the function heading.

2) Virtual memory is: A. heap memory reserved for use by an object B. an area of the hard disk which is being used for a program in execution due to a lack of RAM C. that portion of RAM used by an object D. an area of RAM used for making copies of objects when objects are assigned or passed as parameters 3) If a function returns by reference, it means that: A. a value is always returned B. an address is always returned C. a name of a variable or object is always returned

D. a location is always returned 4) The result of using a bitwise OR on the binary digits 100011 and 100100 is: A. 100000 B. 100111 C. 011111 D. 011000 5) The result of using a bitwise AND on the binary digits 100011 and 100100 is: A. 100000 B. 100111 C. 011111 D. 011000 6) Using preprocessor directives to determine whether or not code should be compiled is: A. conditional compilation B. a way to avoid getting compiler errors C. poor programming practice D. preprocessor inlining 7) The ternary operator of C++ takes: A. no operands B. one operand C. two operands D. three operands 8) A(n) ____________ is a function of a class which is often written to just return the value of a data member.

A. returner B. obtainer C. mini-function D. accessor 9) Which of the following is true about destructors?

A. They are called explicitly by the main programmer to destroy an object.

B. The class programmer can choose any function name for a destructor.

C. They are only called when the program comes to an end.

D. They are often written to prevent memory leak from occurring.

10) A copy constructor: A. is a constructor that makes a copy of another constructor B. is used to make a copy of an object (for example, when the object is passed by value) C. is another name for a default constructor D. is often used for making a shallow copy 11) An actual parameter refers to:

A. a parameter in a function call B. a parameter in a function heading C. a parameter that is an actual (literal) value, like the number 3 D. a parameter of a destructor 12) A formal parameter refers to: A. a parameter which is formally named, according to a coding style B. a parameter in a function call C. a parameter in a function heading D. a parameter of a destructor 13) If two pointers, each in its own object, point to the same location in the heap, and that location is freed by the destruction of one of the objects, the pointer in the other object becomes a: A. null pointer B. dangling pointer C. destroyed pointer D. constant pointer 14) When a copy of an object is made such that the addresses stored in the pointers of the original are the same addresses as the corresponding pointers in the copy: A. a compiler error occurs B. a shallow copy is made C. a deep copy is made D. a copy constructor must have been used 15) Which of the following is true about a deep copy?

A. The address of a pointer in the original is copied to a pointer inside the copy.

B. The address of a pointer in the original is different than the address of the corresponding pointer in the copy.

C. It is a copy made deep within the code of a long function (and therefore, not so easy to debug) D. It is never made with the aid of a copy constructor.

16) The keyword this is: A. the line of code that is executing, when this is written in that line of code B. the object that owns the function that is being executed C. a pointer to the object that owns the function that is being executed D. the address of the variable that follows it 17) The STL is: A. Special This Language B. Shallow Tool Library C. a collection of well-written, commonly-used class templates D. a collection of well-written, commonly-used specialized tools

18) If we use #include <vector> at the top of a program, it means that we are including: A. a variety of data structures specially designed for scientific programs, especially physics B. some special library functions to help us write copy constructors C. a class template similar, in many ways, to the Array class template D. the standard template library 19) If we inline a function for a class, rather than a class template: A. we won’t get any noticeable speedup from program execution B. the program size will definitely become too large C. the function will return by reference D. the function definition must be placed in the class definition, where the function prototype normally would be 20) Suppose a function foo, with no parameters, needs to return an object (or variable) of DataType by reference. The function prototype for foo would look like this: A. inline DataType foo( ); B. DataType & foo( ); C. DataType foo( ) &; D. inline DataType foo( ) &; 21) Suppose we wanted to use a bitwise AND on the variables x and y. The expression would look like this: A. x && y B. x bitwise&& y C. x (&&) y Dx&y 22) Suppose we wanted to use a bitwise OR to add 4 onto an error code (errorCode).

The expression for doing so would look like this: A. errorCode ||= 4; B. errorCode bitwise||= 4; C. errorCode (||)= 4; D errorCode |= 4; 23) We wish to write the following code segment using the ternary operator: if ( a == b ) c = 5; else c = 0; The resulting line of code would look like this: A. c = ( a == b ) : 5 ? 0; B. c = ( a == b )? 5 : 0; C. c = ( a == b )? 0 : 5;

D. ( a == b )? c = 5 : 0; 24) We wish to write a destructor for a class called Bar. The function prototype for the destructor would look like this: A. ~Bar; B. destructor( ); C. ~destructor( ); D. ~Bar( ); 25) The function prototype for a correctly-written copy constructor for a class called Bar might look like this: A. Bar( ); B. Bar( Bar ap ); C. void Bar( Bar & ap ); D. Bar( const Bar & ap ); 26) The function prototype for a correctly-written overloaded assignment operator for a class called Bar might look like this: A. void operator =( const Bar & right ); B. Bar operator =( const Bar & right ) const; C. inline Bar operator=( const Bar & right ) &; D. Bar & operator=( const Bar & right ); 27) Return by reference was used for the overloaded [ ] operator function of the Array class because: A. it is possible that an invalid index of the Array might be accessed B. the function call for this function might appear on the left of an assignment C. the function was inlined D. conditional compilation was used 28) Powers of 2 were used as error codes in the Array because: A. each bit position of the errorCode variable can represent a particular error code B. RAM memory size is measured as a power of 2 C. when errors occur, they occur in multiples of 2 D. there are only two types of errors, existent and nonexistent 29) When a shallow copy of an Array class is made, the pointers of the original and copy point to the same dynamic array because: A. the address of the pointer of one Array is copied into the pointer of the other Array B. there can only be one dynamic array at any one time C. every object made from an Array class has to point to the same place in the heap D. if they didn’t, one would be a dangling pointer 30) We cannot always return by reference because: A. we might be returning a local object, which would be destroyed at the end of function execution

B. we might not want changes in the object of the called function to be reflected back to the calling function C. the address of the returned object might not be known D. the name of the object is not always permanent

Answers to Multiple Choice (Chapter 5) 1) A 2) B 3) D 4) B 5) A 6) A 7) D 8) D 9) D 10) B 11) A 12) C 13) B 14) B 15) B 16) C 17) C 18) C 19) D 20) B 21) D 22) D 23) B 24) D 25) D 26) D 27) B 28) A 29) A 30) A

Short Answer (Chapter 5) 1) Why is it possible for the client to pass a negative size unintentionally into the Array constructor?

2) Why don’t destructors have a parameter or a return type?

3) When writing an overloaded assignment operator for a class, we should always return an object of that class by reference. Why should we return an object of that class?

4) In the Array, why isn’t the errorCode saved as a long string in the private section?

5) Suppose a client makes a function foo in the main program which declares an Array<float> object locally. The return type of foo is Array<float>, and at the end of the function, the client returns the local Array object (without using return by reference) back to the calling function in the main program. The Array object is destroyed at the end of the function (being a local object), so why is there no problem in returning it?

6) In the Array class template, why was the overloaded [ ] operator function inlined?

7) If an invalid index is accessed in the overloaded [ ] operator function, why is a dud returned?

8) Why was the deepCopy function placed into the private section of the Array class template?

9) When the client uses the assignment operator = in connection with the Array, explain how the copy constructor can be called instead of the overloaded assignment operator function.

10) Why is it sometimes necessary to write a destructor?.

Essay (Chapter 5) 1) Explain why we would not want to inline every single function.

2) Describe the difference between a shallow copy and a deep copy.

3) Explain why it is sometimes necessary to write a copy constructor.

4) Discuss everything that goes into writing an overloaded assignment operator function for a class and why.

5) Discuss what happens when passing an object by value, when a copy constructor has been written for that object. Your discussion should include how the copy constructor is called, what (if anything) is passed into it, and everything else up to the point where the called function begins to execute.

Chapter 6 Multiple Choice (Chapter 6) 1) A relationship between two classes where an object of one class is a data member of another class is called: A. inheritance B. polymorphism C. composition D. virtual 2) A list of initializations that occur between the heading of a constructor and the constructor body is called a(n):

A. initializer list B. constructor list C. assignment list D. composition list 3) A relationship between classes where one class automatically obtains the functions of another class is called: A. composition B. inheritance C. polymorphism D. virtual 4) In an inheritance relationship, the class that is inherited from is called the: A. child class B. base class C. virtual class D. derived class 5) In an inheritance relationship, the class that does the inheriting is called the: A. parent class B. base class C. virtual class D. derived class 6) The protected section: A. allows a derived class to access data members or functions of base class, yet keep those same data members or functions inaccessible to clients B. allows a parent class to access data members or functions of a child class, yet keep those same data members or functions inaccessible to clients C. protects data members and functions (contained within the protected section) from unauthorized access by hackers and viruses D. allows clients to access the data members or functions contained within the section, yet keeps inheriting classes from being able to access it 7) When we want one class to inherit from another class, yet we want a particular function to behave differently (that would otherwise be inherited), we use: A. behavior modification B. functional analysis C. virtual inheritance D. function overriding 8) Software engineers use _____________ to communicate their project design and ideas through diagrams.

A. Unified Diagram Language B. Software Communication Protocols C. IFE (Infrastructure For Engineers)

D. Unified Modeling Language 9) When a compiler binds an object name to a type at compile time, it is referred to as: A. dynamic binding B. static binding C. virtual binding D. compile binding 10) When a decision of what type to bind an object to is made at runtime, it is referred to as: A. runtime binding B. dynamic binding C. static binding D. virtual binding 11) When a function is called for an object, dynamic binding for the object name cannot be done without using ___________ functions.

A. virtual B. static C. dynamic D. protected 12) The effects of ____________________ are noticeable during function calls, since this is where behavior can be different for different class types.

A. inheritance B. polymorphism C. composition D. dynamic functions 13) A function which is not defined for a base class, yet causes no compilation problems, is a(n): A. compiler-defined function B. user-defined function C. pure virtual function D. virtual function 14) A(n) _________________ contains one or more pure virtual functions.

A. abstract base class B. pure virtual class C. protected section D. pure class 15) If two classes have an IS_A relationship, we should use: A. composition B. polymorphism C. inheritance

D. static binding 16) If two classes have a HAS_A relationship, we should use: A. composition B. polymorphism C. inheritance D. static binding 17) If an object of one class is a data member of another class, and the contained object does not have a default constructor, then to call the constructor of the contained object, we should use: A. dynamic binding B. an initializer list C. polymorphism D. inheritance 18) We are making classes for our solar system, and we have a class called Planet and a class called Jupiter. We should use ___________________ with these classes.

A. polymorphism B. inheritance C. composition D. virtual abstraction 19) We are making classes for our solar system, and we have a class called Planet and a class called Atmosphere. We should use _______________________ with these classes.

A. polymorphism B. inheritance C. composition D. virtual abstraction 20) We are making a series of derived classes from a particular base class. We need to be able to access a data member in the base class for most of these derived classes, but there is a chance that the representation of the data member will change. We should: A. use a protected section for the data member B. make an accessor function for that data member in the base class (and possibly, another function to change its value) C. forget about inheritance and use composition D. make a pure virtual data member, then use dynamic binding to ensure that the data member won’t be affected by any changes 21) Suppose we have a data member called x, which we would like to set to 0 in an initializer list. The expression to do so would look like this: A. x( 0 ) B. x = 0 C. x := 0 D. x <- 0

22) We need to specify that a LCDMonitor class inherits from a Monitor class. The notation for doing so look like this: A. class LCDMonitor inherits from Monitor B. class LCDMonitor : class Monitor C. class LCDMonitor : Monitor D. class LCDMonitor : public Monitor 23) Suppose we want to override a function called foo in a base class called Bar, and we are writing a function foo for the derived class. As part of the function definition for foo in the derived class, we wish to call the function foo in the base class, which has no parameters. The expression to call the foo function in the base class (within a line of code) would look like this: A. base::foo( ) B. Bar::foo( ) C. foo( ) D. Bar b.foo( ) 24) For a particular function somefunc of a base class called SomeBaseClass, where somefunc has one integer parameter called x and returns a float, we wish to enforce dynamic binding on the name of the object for which this function is called (for this class and all derived classes that override the function. The function prototype of somefunc in SomeBaseClass might look like this: A. dynamic float somefunc( int x ); B. dynamic_bind float somefunc( int x ); C. virtual float somefunc( int x ); D. protected float somefunc( int x ); 25) We have a function foo for a base class which needs to be made into a pure virtual function. It has no parameters and an int return type. The function prototype for foo might look like this: A. virtual int foo( ) = 0; B. pure virtual int foo( ); C. pure virtual int foo( ) = 0; D. virtual int foo( );

Answers to Multiple Choice (Chapter 6) 1) C 2) A 3) B 4) B 5) D 6) A 7) D

8) D 9) B 10) B 11) A 12) B 13) C 14) A 15) C 16) A 17) B 18) B 19) C 20) B 21) A 22) D 23) B 24) C 25) A

Short Answer (Chpater 6) 1) Describe the difference between static binding and dynamic binding.

2) What reasons do we have for using inheritance?

3) Why does it make sense for the address of a derived object to be assigned to a pointer of a base object, but not vice versa?

4) Why shouldn’t we make all data members protected instead of private?

5) Suppose we have a pointer to an object called ptr, and we want to call a function foo that belongs to the object. One way to do it is to use the expression (*ptr).foo( ). Why do we need the parentheses around *ptr?

6) Why do we sometimes need to make a pure virtual function?

7) Instead of using inheritance, why not try to figure out what data members and what functions we will need in a class for every possible situation?

Essay (Chapter 6) 1) Explain how using preprocessing directives can keep a class from being defined more than one in a program.

2) When a derived class needs to access a data member of a base class, describe a couple of ways to handle this and give an advantage for each method.

3) Compare a class that uses an Array as a data member to a class that uses a dynamic array (pointer) in the private section. Why would we need to write a destructor, overloaded assignment operator, and copy constructor for the latter, but not the former?

Chapter 7 Multiple Choice (Chapter 7) 1) A basic unit of a linked list that contains an element is called a(n): A. header B. start C. NULL unit D. node 2) The part of a data structure (abstract data type) that stores a collection of elements is usually an array, a(n) _____________, or a combination of both.

A. linked list B. Node struct C. NULL unit D. set of operations, such as insert or delete 3) A ____________ is often used to simplify code for a linked list.

A. header node B. code simplifier C. linked list code simplifier D. start pointer 4) When a small amount of memory is added to the actual memory used by a data type to “round out” the number of bytes to a convenient size, it is referred to as: A. memory rounding B. actual memory incrementation C. boundary alignment D. memory concatenation 5) Suppose we need to search for a node to remove. We need to keep a pointer one node in front of the one we find. To avoid the special case of removing the first node, we should use a: A. start pointer B. loop C. header node D. pointer called ptr 6) To declare a pointer called ptr2 that will point to a dynamic 2-dimensional array of integers, we should use the code: A. int *ptr2[10]; B. int *( int *ptr2 ); C. int **ptr2; D. int *[ int *ptr2 ];

7) Suppose that a pointer called start points to the first node in a linked list, and each node is made from a Node struct having an info data member and a next data member.

To access info in the first node, we can use the code: A. ptr->info B. ptr = ptr->info; C. info->start D. start->info 8) Assume a linked list is made of nodes from a Node struct, which has an info data member and a next data member. A start pointer points to the beginning of the linked list, which has more than one node. To access the info in the second node of the linked list, we should use the code: A. info->start->next B. start->info C. start->next->info D. start->next->next->info 9) Assume a linked list is made of nodes from a Node struct, which has an info data member and a next data member. Suppose a pointer called ptr points to a node in the middle of the linked list. To move ptr to the next node, we should use the code: A. ptr = next; B. next->ptr; C. ptr->next; D. ptr = ptr->next; 10) Suppose each node of a linked list just has an info data member and a next data member. Suppose that the element size is 4 bytes and no dynamic space in the element is used. The percentage of wasted memory in the linked list is: A. 25% B. 40% C. 50% D. It is impossible to tell without more information 11) Dynamic arrays are often better than static arrays for data structures because: A. static arrays can become filled B. very little of a static array might actually be used, wasting memory C. dynamic arrays can be adjusted in size, conserving memory D. All of the above 12) Consider the following strategy for array expansion/contraction: Whenever an element is added, increase the size of the array by one, and whenever an element is removed, decrease the size of the array by one. This strategy is not reasonable because: A. elements sometimes take up more than one slot in the array.

B. there is a lot of element-copying taking place.

C. dynamic arrays cannot be adjusted by one D. we are not working with a multi-dimensional array

13) One reason to use a two-dimensional dynamic array over a two-dimensional static array would be: A. each individual array can be adjusted in size B. a dynamic array takes far less space than a static array with the same number and types of elements C. dynamic arrays are almost 30 times as fast as a static array D. None of the above 14) For a class used in making a linked list, a pointer is maintained in the private section (usually called start) because: A. we need to move the start pointer through the list when we search B. it always points to the node we want to remove C. all nodes are made in the heap, and having this pointer into the linked list prevents memory leak and renders the linked list useful D. it always points to the place where we want to insert a new node 15) We do not use a long chain of ->next’s when working with a linked list (for example, ptr->next->next->next->next->next->info) because: A. we often do not know how long the linked list is, so we use a loop to move a pointer through the list B. we can only use one next at a time (C++ does not permit more than one in an expression) C. it can become an infinite loop D. doing so can cause memory leak 16) Overloaded operators are often used in searching a linked list because: A. they are much faster than regular operators B. struct objects are never used as elements C. struct objects are often used as elements in a linked list, and the client chooses what type of struct to use D. addition of struct objects, used as elements, is often used in the search 17) Consider the code for inserting a node at the beginning of the linked list and the code to insert a node into the middle of a linked list. One reason the code is different is because: A. the start pointer needs to be moved when inserting at the beginning of the linked list, but not when inserting into the middle B. the nodes after the middle have to be moved over, one at a time, using a loop C. although both ways of inserting require the use of loops, we don’t need to check for NULL when we insert at the beginning D. All of the above 18) In the expansion/contraction strategy we use for an adjustable array, if we are not out of heap memory and there are elements in the array, the array is never less than: A. 75% full

B. 50% full C. 25% full D. None of the above 19) In the expansion/contraction strategy we use for an adjustable array, the array can be more than 75% full because: A. a contraction will leave it at 100% full B. an expansion will leave it at 100% full C. we do not contract the array until it is 100% full D. we do not expand the array until it is 100% full 20) The pointer in the last node of a linked list is often set to NULL because: A. in a search, we need to have some way of knowing when we’ve reached the end of the list B. it doesn’t point to anything C. it prevents memory leak D. it conserves the memory used in the linked list by 25% 21) When searching for a node in a linked list to remove, we use a loop to move a pointer through the list. We want the pointer to stay one node in front of the node we wish to remove because: A. we have to link the node to remove to the node in front of it B. we have to link the node in front of the node to remove to the node after the node to remove (if there is one) C. if we did not, there would be memory leak for the node in front of the node to remove D. we cannot free the node to remove if the pointer is pointing to it 22) When searching a linked list, we do not move the start pointer through the list because: A. it would result in memory leak B. it is faster to use another pointer other than start C. pointers that move through linked lists are disruptive D. it is never necessary to move a pointer through a linked list; the linked list can be searched by simply examining each node for the needed information 23) The start pointer can be set to NULL; it would be set this way when: A. the linked list is empty B. the start pointer points to the only node in the linked list which, being the last node, is set to NULL C. the entire linked list has been set to NULL D. the linked list is extremely long, and it would be better to start at the middle in a search, working backwards and forwards 24) Suppose we have a header node in a linked list and start points to this header node.

When removing the first (nonempty) node in the linked list, we do not have to move the start pointer because:

A. we should never move the start pointer in any linked list B. header nodes have no information, so they are never removed – the start pointer continually points to the header node C. if the header node needs to be removed, start is simply set to NULL D. start always points to a node with information 25) The percentage of memory wasted in a node of a linked list is also the percentage of memory wasted in the linked list because: A. that percentage would be the same in every node of the linked list B. the linked list only has one node – if more than one node, it is no longer a linked list C. when you multiply the amount of wasted memory in one node by the number of nodes in the linked list, then divide by the size of the node, you get the same number D. None of the above 26) When we use the linked list wasted memory formula, we may have to estimate the average size of the node because: A. a pointer takes up a different amount of memory space in every node B. we can never really be sure about how many bytes are used for integers, floats, etc. – it can vary from one line of code to another C. if a node element has dynamic space, such as in a string data member, then the size of the node can vary D. depending upon the amount of memory leak within a node, it may take up a different amount of memory space than other nodes without memory leak 27) A class facilitates making an abstract data type because: A. a class never has more than one data type B. an abstract data type, such as a string, can be a data member of a class C. the data stored in an object of the class is an abstraction, and to manipulate the data we only need to use the functions (operations) of a class D. None of the above 28) The advantage of using an adjustable array in a data structure, from a client’s perspective, is: A. the client does not have to think about the size of the array, or whether or not an array is even being used for that matter B. the client can adjust the size of the array any way that he or she sees fit C. if the array becomes full, the client immediately knows about it D. the client can easily be informed of how much memory space is being wasted 29) When working with linked lists, does the client have to think about nodes?

A. Yes, because the client is the one who inserts nodes into a linked list B. No, because the client just supplies elements and the linked list data structure takes care of putting them into nodes C. Yes, because the linked list cannot put an element into a node without knowing what data type the element is D. No, because linked lists rarely have nodes in them

30) A struct is used for a Node instead of a class because: A. overloaded operators must always be used for the data members of a node B. we like to access the data members of the Node directly, and in a class, we should not do that C. a pointer cannot point to an object of a class, so there would be no way to link the nodes D. class objects cannot be created in heap memory

Answers to Multiple Choice (Chapter 7) 1) D 2) A 3) A 4) C 5) C 6) C 7) D 8) C 9) D 10) C 11) D 12) B 13) A 14) C 15) A 16) C 17) A 18) C 19) D 20) A 21) B 22) A 23) A 24) B 25) A 26) C 27) C 28) A 29) B 30) B

Short Answer (Chapter 7)

1) If ptr points to a node in a linked list, explain why ptr->next would point to the following node (if there is one).

2) If a search for information in a linked list is not successful, and a pointer called ptr is being used to move through the linked list, explain why ptr is eventually set to NULL. 3) Explain why the expression ptr->next can be NULL. 4) Would we ever want to move a start pointer for a linked list? Why or why not?

5) Explain the effects of wasted memory when large elements are used in linked lists instead of small elements and why.

6) Explain the effects of wasted memory when large elements are used in arrays instead of small elements and why.

7) Explain the effect that the use of a header node has on code and why.

8) Explain the strategy used in the textbook for adjustable array expansion/contraction.

9) How would you go about searching for a value that you know is definitely in a linked list?

10) Drawing pictures, explain the steps necessary to insert a node into the middle of a linked list. Assume that a pointer called ptr points to the node that will be in front of the node to be inserted.

Essay (Chapter 7) 1) Comparing linked lists to arrays, discuss the advantages and disadvantages of each for both speed and memory considerations.

2) Describe the process of creating and freeing a 2D dynamic array.

3) Describe the steps involved in searching for a value in a linked list, when you are not sure if the value is in the linked list, and the linked list may, in fact, be empty.

4) Describe the steps involved in finding and removing a node from a linked list, when you are not sure if such a node is in the linked list, and the linked list may, in fact, be empty.

5) Consider the following strategy for adjustable array expansion/contraction: when an element is inserted, increase the size of the array by one, and when an element is removed, decrease the size of the array by one. Discuss, in detail, why this is not a good strategy.

Chapter 8 Multiple Choice (Chapter 8) 1) A(n) ___________ is a data structure in which elements are inserted at one end and taken off of the same end.

A. queue B. stack C. array D. linked list

2) A(n) ___________________ consists of a set of data and a set of operations that act upon that data.

A. data type B. user data type C. operative data type D. abstract data type 3) _______________ means that all the elements are of the same type.

A. Homogeneous B. Heterogeneous C. Polygeneous D. None of the above.

4) ________ means place an element on top of a stack.

A. Push B. Pop C. Peek D. Poke 5) __________ means take an element off the top of the stack.

A. Poke B. Peek C. Push D. Pop 6) ____________ means copy the element at the top of the stack without removing it.

A. Peek B. Poke C. Pop D. Push 7) LIFO means: A. the last element that comes out is the first one to go in B. the last element to go in is the first element to come in C. the last element to go in is the first element to come out D. the last element that comes in is the first one to go in 8) The << shift operator means: A. divide by a power of 2 B. multiply by a power of 2 C. shift the data type following the << operator to a different data type preceding the << operator D. shift the location of the following variable from regular RAM memory to heap memory 9) The >>= operator means:

A. divide by a power of 2 and save the result B. multiply by a power of 2 and save the result C. shift the data type preceding the >>= operator to a different data type following the >>= operator, saving the current value.

D. shift the location of the preceding variable from regular RAM memory to heap memory, saving the current value 10) A ____________ is a data structure in which elements are added to the end and taken off the front.

A. queue B. stack C. array D. linked list 11) ___________ means add an element to a queue.

A. enqueue B. dequeue C. peek D. poke 12) ____________ means remove an element from a queue.

A. enqueue B. dequeue C. peek D. poke 13) A queue is a __________ data structure.

A. LIFO B. FILO C. FIFO D. LIPO 14) In the array implementation of the queue, if the number of elements used drops to 25% of the capacity, why can’t we immediately just reduce the capacity to one half?

A. There may be too many elements in the queue.

B. The queue may be wrapping around the array.

C. It would be faster to make some element adjustments first.

D. If the array is reduced to one-half its capacity, there may be memory leak for some of the elements.

15) It is important to be able to understand what a type of data structure is all about without thinking about C++ code because: A. sometimes data structures can be implemented without code.

B. data structures can be implemented with many different kinds of programming languages.

C. if you don’t think about code, you don’t have to think about debugging it

D. code is not used to make data structures 16) In array-based data structures, adjustable arrays are often used instead of fixedlength arrays because: A. fixed-length arrays can become filled B. very little of a fixed-length array might actually be used, wasting memory C. adjustable arrays conserve memory D. All of the above 17) When multiplying or dividing by a power of 2, shift operators are advantageous because: A. it is easier to write the code B. they are faster than multiplying or dividing C. they are easier to understand D. they can be overloaded 18) In the queue, the back pointer is important because: A. without it, we would have to walk a pointer through the entire queue to get to the last node, where we enqueue B. without it, we would have to walk a pointer through the entire queue to get to the last node, where we dequeue C. without it, we would have memory leak when the destructor is called D. it makes it much easier to implement the deepCopy function 19) In the linked list implementation of the queue, we had a destructor, copy constructor, and overloaded assignment operator function because: A. every well-written data structure must have these three functions B. there are pointers to dynamic memory in the private section C. queues often need to be destroyed, copied, and assigned D. the insert function frequently makes use of these 20) In the linked list implementation of the queue, we had both a destructor and a makeEmpty function because: A. the destructor needs to call the makeEmpty function B. the client may want to empty out the queue without destroying it; however, the client shouldn’t have to remember to use makeEmpty to avoid memory leak upon destruction of the queue C. the makeEmpty function needs to call the destructor; otherwise, the queue cannot be destroyed D. only one is used to free dynamic memory, the other cannot 21) Why is a stack a LIFO data structure?

A. The last element that comes out of the stack is the first one to go into the stack B. The last element to go into the stack is the first element to come into the stack C. The last element that comes into the stack is the first one to go into the stack D. The last element to go into the stack is the first element to come out of the stack

22) Why is a queue a FIFO data structure?

A. The first element that comes out of the queue is the first one to go into the queue B. The first element to go into the queue is the last element to come into the queue C. The first element to go into the queue is the first element to come out of the queue D. The first element that comes into the queue is the first one to go into the queue 23) In the constructor of the array implementation of the stack, top is not set to 0 because: A. it shouldn’t be set to anything until we start pushing elements B. that would mean there is one element already in the stack C. it makes much more sense to set it to 1 D. top is always set to the value of the top element of the stack 24) In the push function of the array implementation of the stack, recall that the element to push is passed into the function as a parameter. It is not passed by const reference because: A. arrays are typically used for small elements, and this would prevent us from passing literal values, like push( 0 ) B. the element is expected to change within the push function C. we don’t want changes in the element to be reflected back to the calling function D. there is no danger of getting a runtime error in this situation 25) The << and >> operators are called shift operators because: A. they shift the bits in a register B. they can shift around from one operand to another one C. they shift a data type to a different data type D. they shift the location from regular RAM memory to heap memory 26) In the array implementation of the stack, top is decremented in the pop function because: A. it is an index to the current top of the stack, and that index decreases by one on a pop B. it stores the value of the current top of the stack, and a value lower in the stack is always less C. top records the number of elements in the stack, and the number of elements decreases by one on a pop D. otherwise, there would be no way to access the array position that needs popped 27) When we reduce the capacity of an array to one half, it is possible to run out of heap memory because: A. This statement is false. It is not possible to run out of heap memory when reducing the size of an adjustable array.

B. a linked list has to be made to copy the array into before the size is reduced C. a smaller array is created in the heap first D. each line of code in a function uses up some heap memory

28) Queues are useful in simulations, mainly because: A. the simulation may have to wait in line before it can run B. the first person who needs a service is usually the last person that gets served C. so many models of the physical world use the first-come, first-serve principle D. when we pop an element from a queue, the action of doing so bears a striking similarity to a real-world action 29) In the linked list implementation of the queue, it was not necessary to set the pointer in the last node of the queue to NULL because: A. we never had to search for an element in the queue B. the address stored in the back pointer gives the address of the last node C. it is never necessary to set a pointer in the last node of a linked list to NULL D. the last node in the queue is not necessarily the last node in the linked list 30) We can use a shift operator when doubling the capacity of the array or cutting the capacity of an array in half because: A. shift operators always multiply or divide by a power of 2 B. the array capacity is always a power of 2 in our array expansion/contraction strategy C. doubling the array and cutting the capacity of the array in half both change the capacity of the array from one power of 2 to another D. All of the above

Answers to Multiple Choice (Chapter 8) 1) B 2) D 3) A 4) A 5) D 6) A 7) C 8) B 9) A 10) A 11) A 12) B 13) C 14) B 15) B 16) D 17) B 18) A 19) B 20) B 21) D

22) C 23) B 24) A 25) A 26) A 27) C 28) C 29) B 30) D

Short Answer (Chapter 8) 1) In the pop function of the array implementation of the stack, recall that true is returned if the pop is successful and false is returned otherwise. If the number of elements drops to 25% of the capacity of the array, yet we cannot cut the array in half because of a lack of heap memory, explain why we should not return false.

2) Give a reason why an isFull function isn’t implemented for the linked list implementation of the queue.

3) Why is passing by const reference used in the enqueue function of the linked list implementation of a queue, but not in the array implementation of a queue?

4) In the array implementation of a stack, why is there no destructor, copy constructor, or overloaded assignment operator function?

5) Recall that in the pop function of the array implementation of a stack, a try clause is used around the changeSize function, if we attempt to reduce the capacity of the array.

Explain why.

6) Why should we return an element from the dequeue function using a reference parameter, instead of returning the element in a return type?

7) What are the differences between using the linked list implementation of a stack and an array implementation of a stack?

8) What are the differences between a linked list stack and a linked list queue?

9) What are the differences between an array stack and an array queue?

10) In the push function of the array implementation of a stack, why should we check the number of elements in the array first?

Essay (Chapter 8) 1) If the number of elements falls to 25% of the capacity in the array implementation of the stack, discuss, in depth, the issues surrounding cutting the array in half (including what happens if there is not enough heap memory).

2) Discuss how a deep copy of a queue is performed for the linked list implementation of the queue.

3) Discuss the process involved in freeing the linked list queue if the makeEmpty function is called.

4) What issues do we need to consider when cutting the array in half in the dequeue function of the array implementation of the queue?

5) What issues do we need to consider when doubling the size of an array in the enqueue function of the array implementation of the queue?

Chapter 9 Multiple Choice (Chapter 9) 1) A time complexity describes: A. how the execution time of an algorithm changes as some other factor (usually the number of elements) changes B. the execution time of complex algorithms C. the complexities involved in timing a computer program D. the complexities involved in timing an algorithm 2) The cross-over point is: A. the point at which an algorithm crosses over from being fast to being slow B. the point at which n crosses over from being small to being large C. the point at which the graphs of the instruction functions of two algorithms intersect D. the point at which n intersects with time 3) Asymptotic running time refers to: A. the running time behavior of an algorithm as n approaches infinity B. how the running time of an algorithm gets closer and closer to a maximum running time, but never quite gets there C. timing an algorithm by use of the asymptotic method D. how the number of elements changes as n approaches infinity 4) The variable n is often used in time complexities to represent: A. the number of seconds B. the number of time complexities C. the number of elements D. the number of times a loop of an algorithm executes 5) Those parts of an instruction function that are added or subtracted are called its: A. coefficients B. terms C. constants D. time complexity 6) The leading numerical portion of a term of a function is called a: A. coefficient B. subterm

C. pre-term D. time complexity 7) To show that a function is a time complexity, rather than an instruction function, we use: A. n B. f(n) C. alpha notation D. theta notation 8) When an algorithm has an upper limit to the number of instructions, regardless of the size of n, it is referred to as a(n) ______________ algorithm.

A. limited B. time complex C. constant time D. instruction-truncated 9) A loop has a(n) ________________________ when, on each iteration, the remaining problem size is reduced by one half until the problem size becomes 1.

A. constant time complexity B. quadratic time complexity C. logarithmic time complexity D. linear time complexity 10) A term of less significance in an instruction function is not part of a time complexity because it is _____________ into the term of greater significance.

A. nullified B. absorbed C. osmosified D. subjugated 11) When the number of instructions of an algorithm is bounded by a constant, it means that: A. the execution time of the algorithm would be very high B. the number of instructions are bound to be constant C. every time the algorithm runs, the same number of instructions are executed D. there is an upper limit to the number of instructions executed 12) Big-oh notation of a time complexity applies when: A. an algorithm’s time complexity can vary, but it won’t be any worse than its big-oh time complexity B. an algorithm’s time complexity can vary, but it won’t be any better than its big-oh time complexity C. an algorithm’s time complexity is always the same D. an algorithm’s time complexity changes with the number of elements

13) The result of a logarithm is a(n) ____________.

A. instruction B. exponent C. base D. variable (namely, n) 14) A(n) __________________ is another way of writing a logarithmic equation.

A. exponential equation B. instruction function C. time complexity D. linear equation 15) The time complexity of the binary search algorithm, using the best possible big-oh notation that applies is: A. O( 1 ) B. O( lg n ) C. O( n ) D. O( n lg n ) 16) The time complexity of the sequential search algorithm, using the best possible bigoh notation that applies is: A. O( n lg n ) B. O( n ) C. O( lg n ) D. O( 1 ) 17) The left side of a cross-over point is often ignored because: A. the number of elements is low there, and most algorithms will be fast for that number B. there is usually nothing there C. it is too difficult to interpret D. None of the above 18) When deriving a time complexity, the terms of lesser significance are removed because: A. they just complicate things B. they are absorbed into the term of greatest significance C. they cancel each other out anyway D. they would sometimes produce a negative number of instructions if left in 19) Big-oh notation for a time complexity can be misleading when: A. it is not the best possible big-oh time complexity that applies correctly to the algorithm B. the time complexity of the algorithm does not vary, and theta notation would work C. the worst case time complexity of the algorithm is far worse than its best case and average case time complexities, and all of these are known in theta notation D. All of the above

20) Why should we describe the time complexity of the binary search algorithm as O( lg n )?

A. Its time complexity varies, but it is always worse than ( lg n ).

B. Its time complexity varies, but it is always better than ( lg n ).

C. Its time complexity varies, but it is never worse than ( lg n ).

D. Its time complexity varies, but it is never better than ( lg n ).

21) Which of the following best describes the relationship between hardware improvements and time complexity improvements in regards to program execution time?

A. An improvement in the time complexity of a program can cause the program to run many times faster than a typical hardware improvement.

B. Hardware improvements always do more to speed up a program than a better time complexity ever could.

C. Hardware improvements and time complexity improvements are currently about the same in speeding up the execution of a program.

D. Hardware improvement are often slightly better than time complexity improvements in speeding up a program; if a hardware improvement is not slightly better, then it is about the same as an improvement in time complexity (typically) 22) The instruction function f(n) = 4n + 3 lg n belongs to the ( n ) time complexity because: A. the n term is the first term in the function B. there is only an n term and a lg n term, and there can not be a ( lg n ) time complexity C. the lg n term is absorbed into the n term for the time complexity D. This statement is false. This function belongs to the ( n + lg n ) time complexity.

23) An algorithm with a constant time complexity does not always execute the same number of instructions because: A. the number of instructions in the execution of this algorithm can vary as long as there is an upper limit to the number of instructions B. it might have a loop where the number of iterations depends on the number of elements C. This statement is false. An algorithm with a constant time complexity always executes the same number of instructions.

D. a constant time complexity just means it has a constant problem size, not a constant number of instructions 24) We should pay attention to the left of a cross-over point when: A. This statement is false. We should never pay attention to the left of a cross-over point.

B. it can be easily interpreted C. the cross-over point occurs at a high number of elements, and most practical uses of the algorithms involved will be on the left of the cross-over point D. it has some interesting information

25) Suppose an instruction function is f( n ) = n2 + 5. When considering time complexities, why isn’t the graph a full parabola?

A. n can’t be negative B. There is only a finite set of integers that can be used for n.

C. All time complexities must be straight lines.

D. n can only take on values to the right of the cross-over point 26) Suppose a loop executes n times. If there are no nested loops within this one, the number of instructions inside the loop is not important when deriving the time complexity because: A. the number will be a least significant term that we throw out B. it is absorbed into the n term C. the number will become a coefficient of n that we throw out D. it will only be the exponent for n 27) Time complexities are useful because: A. they tell us exactly how long an algorithm will take to execute B. they are always the same during the use of any algorithm C. they tell us how many elements we should not exceed to avoid exceeding a certain amount of time D. they usually tell us how the execution time changes as the number of elements changes, so we can compare algorithms 28) The dequeue function in the linked list implementation of the queue does not depend on the number of elements because: A. we only work with the front of the linked list B. it has a ( n ) time complexity C. a linked list doesn’t have any elements D. we can easily use the back pointer 29) In the array implementation of the stack, the push and pop functions don’t always run in ( 1 ) time because: A. sometimes we have to search for an element to push or pop B. the number of elements may be very high C. the cross-over point may be too high D. we may have to copy elements 30) Suppose an algorithm consists of two loops, where one loop executes and finishes, and then the other loop executes and finishes. We can easily determine the time complexities of the individual loops. To determine the time complexity of the entire algorithm, we should: A. add the time complexities together B. multiply the time complexities together C. take the best (fastest) time complexity of the two D. We would not be able to determine the time complexity of the algorithm with the information given.

Answers to Multiple Choice (Chapter 9) 1) A 2) C 3) A 4) C 5) B 6) A 7) D 8) C 9) C 10) B 11) D 12) A 13) B 14) A 15) B 16) B 17) A 18) B 19) C 20) C 21) A 22) C 23) A 24) C 25) A 26) C 27) D 28) A 29) D 30) A

Short Answer (Chapter 9) 1) Suppose we have two instruction functions and we would like to solve for n at the cross-over point. Why do we set these functions equal to each other to solve for n?

2) Suppose we are solving for n in a certain problem and we come up with two answers: n = 0 and n = 10. Why is n = 0 a nonsensical answer?

3) If f( n ) and g( n ) are instruction functions that have different time complexities, and f( n ) has the best time complexity, how do they compare in execution time the larger n gets?

4) When using the sequential search algorithm on a sorted array, suppose the value we are searching for is not in the array. Why can we sometimes stop before the array is completely searched? Would this be true for an unsorted array? Why or why not?

5) Why is the average-case time complexity of the sequential search algorithm ( n )?

6) Why does the O( n ) time complexity apply correctly to the sequential search algorithm?

7) Why are approximately half of the elements in an array eliminated on the first iteration of the binary search algorithm?

8) Why is ( 1 ) the best-case time complexity for both the sequential search algorithm and the binary search algorithm?

9) Why does the makeEmpty function in the linked list implementation of the queue run in ( n ) time?

10) Why does the isEmpty function in the array implementation of the stack run in ( 1 ) time?

Essay (Chapter 9) 1) Describe how the binary search algorithm works, and explain why its time complexity is O( lg n ).

2) Discuss the difference between theta and big-oh notations, explaining when it is appropriate to use each, and how the use of big-oh notation may be inappropriate.

3) Compare the binary search algorithm and the sequential search algorithm, describing why the binary search algorithm is often faster even though there are more instructions in its loop than the loop of the sequential search algorithm.

4) Compare and discuss the different time complexities: ( 1 ), ( lg n ), ( n ), and how algorithms achieve these time complexities.

Chapter 10 Multiple Choice (Chapter 10) 1) A group of grocery items that needs to be purchased is an example of a(n): A. linked list B. queue C. list D. abstract data type 2) A(n) ___________ is used to process or retrieve the elements of a data structure, one by one.

A. key B. iterator C. linked list

D. find function 3) A(n) ___________ is a data member that is unique for each struct object (record of information).

A. key B. record locator C. name D. oddball 4) A ____________ is a linked list in which the “last” node points to the “first” node.

A. infinite linked list B. wrapper list C. fully connected linked list D. circular linked list 5) A _________________ is a linked list in which the elements are placed in order.

A. sorted linked list B. ordered linked list C. sorted list D. ordered list 6) A doubly linked list is a: A. linked list in which each node points to the node preceding it and also points to the node following it (if there are any such nodes) B. linked list in which each node has two pointers to the node that follows it, just in case one pointer goes bad C. two-dimensional matrix of linked lists, in which each node points to the node that follows it, and also has another pointer to the node below it D. linked list that has two copies of itself, for speeding up a deep copy function 7) A(n) ____________ is an empty node of a doubly linked list, used to simplify code by eliminating special cases.

A. header node B. trailer node C. Both A and B D. Neither A nor B 8) A linked list implementation of a list is more difficult to implement than the linked list implementation of a stack or queue because: A. we may need to remove any node B. we may need to retrieve any node C. we may need to replace any node D. All of the above 9) There is no current position after an insertion into a linked list because: A. when the nodes slide over for the insertion, the current position becomes ambiguous

B. the client might have a notion of where the current position is (at the beginning of the list, perhaps), which could become muddled after an insertion C. the current position pertains to a node that has not yet been inserted D. it is impossible to insert without mixing up the nodes in the linked list 10) A general linked list is an important data structure because: A. it can conserve more memory than an array for large element sizes B. it is much faster than an array in almost every possible situation C. without one, there are no data structures available for which we could search for keys D. it is the only data structure in which each element can be a record of information 11) The state of each data member should be considered when writing a class function because: A. it will prevent one from overlooking data members one should have set or changed and so it will cut down on errors B. each data member always needs to change somehow in each class function C. if you don’t change the state of the data member yourself within the class function, it may change inadvertently, especially when working with linked lists D. when const is used at the end of a function heading, you need to change at least one data member 12) There is no current position when an element is removed from a linked list because: A. when the nodes slide over due to the removal, the current position becomes ambiguous B. the current position is the removed node C. the node that is removed might be the one at the current position D. removing a node completely shuffles the other nodes around 13) Inserting a new node at the beginning of the linked list is faster than inserting a new node at the end of the list (assuming there is no pointer to the end of the list) because: A. the beginning of the linked list is less complicated than the end of the linked list B. inserting at the beginning doesn’t require a loop, and it can be done in ( 1 ) time; inserting at the end requires a loop and is done in ( n ) time C. if you insert at the end, all of the nodes must be slid one place to the left; if you insert at the beginning, you just insert D. the operating system can quickly access the address at the beginning of the linked list; the address at the end of the linked list is likely to be high, and the operating system will spend a lot of time trying to figure out what it is 14) The first and getNext functions (the iterator) cannot be used in the remove function to find the node to remove because: A. a class function cannot call any other class functions B. they aren’t called directly by the client, so they don’t know what to search for C. the first and getNext functions just return the elements within nodes, and the remove function needs to know the address of the node to remove D. it would be impossible to return the element using the reference parameter

15) The first and getNext functions (the iterator) cannot be used in the deepCopy function because: A. the first and getNext functions just return the elements within nodes, and the deepCopy function needs to know the address of the node to copy B. the deepCopy needs to know the address of each node in the original, so it can see which node the current pointer is set to; then, it can set the current pointer of the copy the same way C. a class function cannot call any other class functions D. the first and getNext functions are just used for searching 16) The getNext function was inlined because: A. it is likely to be used in a loop, so using it will be faster while not using too much memory for code B. the next element to get is in line with the previous element C. we need many copies of the getNext function, since there are many elements to retrieve D. searches are always faster when they are made in a straight line through the list 17) The do…while loop works better for using the iterator than the regular while loop because: A. studies have shown that the do…while loop is considerably faster in searching B. the first function can be easily called within the do…while loop C. although the first function is called to retrieve the first element outside of each loop, when the first element is processed, it would have to be processed outside of a regular while loop; in the do…while loop, the first element can be processed in the loop D. the getNext function can be used in the condition for a do…while loop, but not for the regular while loop 18) The retrieve function does not pass in the key value as a parameter because: A. the key is never used to retrieve an element B. the client must declare a struct object to hold the retrieved object, and it already has a key data member in it, so the client just passes the object in by reference with the key value set C. the key is already known by the retrieve function D. the elements within a linked list are usually objects, and the retrieve function has no way of comparing a key value to an object 19) When considering the abstract data type description for the linked list, we need to think of it as an abstract data type for a list (not necessarily linked) because: A. in some programming languages (existent or future), it may be possible to make a list, but not a linked list B. in some programming languages (existent or future), there may be a variety of ways of making a list, including linked lists C. we could use an array for a list D. All of the above

20) The retrieve function is generally not used for elements that are integers because: A. a key value can’t be an integer B. we would already have the value we need to retrieve C. the retrieve function must be used for objects only D. None of the above.

21) The getNext function can be used as a loop condition because: A. it will return false as long as there is another element to retrieve; if there are no more elements, it returns true B. it will return true as long as there is another element to retrieve; if there are no more elements, it returns false C. it returns true if the linked list is not empty; once the linked list becomes empty in the loop body, it returns false D. it returns true as long as the element it is searching for can be found; if it determines that the element that it is searching for in the linked list does not exist, it will then return false 22) In the remove function of the LinkedList class, when searching for the node to remove, we keep a pointer one node in front of the node we want to remove because: A. the node we are searching for might not be in the linked list B. we must be able to link the node (that the pointer points to) to the node following the one we want to remove C. if the pointer pointed to the node we wanted to remove and then we removed it, we would get a runtime error D. if the pointer pointed to the node we wanted to remove and then we removed it, we would get a dangling reference (or dangling pointer) 23) If we do not have a header node, why is removing the first node of a linked list a special case?

A. The first node is the most complicated node of the entire linked list.

B. It complicates the insertions that might take place afterwards, since insertions take place at the beginning of the linked list.

C. If we don’t do it properly, there is memory leak for the rest of the nodes in the list; if we don’t remove any other node properly, there is no danger of memory leak.

D. We need to move the start pointer when removing the first node, but not when removing any other nodes.

24) When inserting a node into a sorted linked list, it generally takes longer than inserting a node into a regular linked list because: A. we must walk through the sorted linked list to find the place where the node is to be inserted; in the regular linked list, we insert at the beginning B. the links in the sorted linked list are more complicated and take more lines of code to deal with C. the insert function for the regular linked list can be inlined, but the insert function for the sorted linked list cannot be

D. the sorted linked list has to be sorted first, before the node is inserted 25) Keys are often used in linked lists because: A. without a software key, a linked list is locked to all clients and, therefore, rendered unusable B. the values of the keys need to be duplicated in many of the nodes C. we often need to search for nodes of interest, and we find that node by looking for some particular value in the node, usually a key D. then, the client does not need to pass in a key as a parameter

Answers to Multiple Choice (Chapter 10) 1) C 2) B 3) A 4) D 5) A 6) A 7) C 8) D 9) B 10) A 11) A 12) C 13) B 14) C 15) B 16) A 17) C 18) B 19) D 20) B 21) B 22) B 23) D 24) A 25) C

Short Answer (Chapter 10) 1) Suppose we want to remove a node quickly, and the function to remove the node passes in the address of that node as a parameter. What type of linked list should be use and why?

2) Suppose we had a linked list of articles to sale, and the article includes a price data member. We would like to discount the price of each article by 5%. What would be the best way to do this?

3) Explain why a LinkedList object might make a good data member in the linked list implementation of a stack.

4) Why does a client need to declare a struct object when retrieving a struct object fomr a linked list?

5) When using NULL in the class implementation file, what must we be sure to do at the top of the file?

6) Why does the insert function place elements at the beginning of the linked list?

7) Why does the doubly-linked list waste more memory than the regular linked list?

8) What is the main advantage of a sorted linked list?

9) Why would the linked list be a more likely implementation of a list than an array?

10) Why is the average-case time complexity ( n ) for the insert function of a sorted linked list?

Essay (Chapter 10) 1) Discuss how the retrieve function works, focusing on how keys are used to retrieve information and why the information is retrieved.

2) Discuss how the iterator for LinkedList works, and how it can be used.

3) Compare a doubly linked list to a regular linked list, discussing issues of memory conservation and node removal.

4) Compare the regular linked list to the sorted linked list, discussing issues of inserting, retrieving, and checking for duplicate keys.

5) Explain why it does not benefit us to use a binary search on a linked list.

Chapter 11 Multiple Choice (Chapter 11) 1) A table of keyed elements which uses a hash function to located positions in the table is a(n): A. keyed table B. function table C. hash table D. chained table 2) A function which has a key input and a position output is known as a(n): A. key function B. position function C. hash function D. instruction function

3) When two elements hash to the same position , it is called a(n): A. double hash B. collision C. double probe D. instance of position integration 4) When an insertion is done using the probing technique: A. if the element to be inserted hashes to an occupied position, a sequential search is performed until an empty position is found B. if the element to be inserted does not hash to an occupied position, another hash function is used C. if the element to be inserted hashes to an occupied position, the element is inserted into a linked list D. a sequential search is done from the beginning of the table until an empty position is found 5) When an element is retrieved using the chaining technique: A. each linked list in the table is searched, one be one, until the element is found B. a sequential search is made from the hashed position through the array until the element is found C. when an element hashes to a position, the linked list at that position is searched for the element D. the correct array for the element is located in a chain of arrays by using a key function 6) Uniform hashing occurs when: A. the elements are stored in something called a uniform before hashing occurs B. the elements are spread evenly (more or less) throughout the table C. the function used conforms to a special set of rules called a uniform D. and only when the probing technique is used 7) A pointer to a function is: A. a variable that holds the address of a function B. a variable that holds the address of the first parameter of a function C. a variable that holds the address of the returned variable or object of a function D. a variable that holds the address of the key in the key function 8) Suppose we have a list of part numbers, numbered from 0 to 1999 and we want to use a hash table for the part numbers. There is no chance that any new part numbers will be inserted and that no part numbers will be removed. We should use: A. h( k ) = k B. chaining C. probing D. a uniform

9) Suppose we want to declare a pointer to a function which has a float return type, and two parameters: the first one an integer and the second one a string. We want to name the pointer fptr. The declaration would look like this: A. float (fptr*) (int, string); B. float * (fptr) (int, string); C. float (*fptr) (int, string); D. float ( int, string) *fptr; 10) Suppose fptr in problem 9 has been assigned a valid address. To use fptr, passing in x for int, and str for string, we would use the expression: A. *fptr( x, str ); B. fptr( *( x, str ) ); C. fptr( x, str ); D. fptr->(x, str); 11) One reason for not using a header node in the LinkedList class is because: A. it makes the code more complex B. it would significantly slow down all list operations C. the header node would interfere with the array element position in the hash table D. the header node would waste more memory for an empty linked list in a hash table 12) An advantage of the chaining technique over the probing technique is: A. An empty slot using the probing technique wastes a lot of space for large element sizes, whereas using the chaining technique, it just wastes 8 bytes for the empty LinkedList object B. the hash table cannot get full when the chaining technique is used C. Neither A nor B D. Both A and B 13) If the person who writes a class template knows what functions the client will have in the main program, the class template functions can call the functions in the main program because: A. when the compiler makes a class from the class template, it will have already seen the function prototypes that exist in the main program B. one function can always call any other function that exists in the entire software system C. This statement may sometimes be false. This statement is only true if the function in the main program is a hash function.

D. The main program is compiled before the class template is compiled.

14) In the deepCopy function of the DoublyLinkedList, the pointer that walks through the original list starts at the last nonempty node because: A. traveling backwards through the DoublyLinkedList is faster than traveling forwards through it B. there may not be any other node in the list

C. the element contained within it will be in the last nonempty node of the copy when it is the first element to be inserted into the copy D. it makes it easier to set the current pointer 15) Hash tables are fast because: A. arrays, used in hash tables, are fast B. they take less memory space and can easily fit in the cache of a typical computer C. if we have uniform hashing, then insertion, searching, and deleting are all (1) operations D. they use the binary search algorithm when searching for elements 16) The hash function h( k ) = k % 127 would not make a good hash function because: A. 127 is too close to a power of 2 B. 127 is not a prime number C. it would be awkward to make an array with only 127 elements D. All of the above.

17) No collisions are possible using the hash function h( k ) = k because: A. any hash function always prevents collisions from occurring B. This statement is false; collisions are always possible C. it would multiplex the hash table array enough so that each linked list is fluxed D. each key is unique, and therefore, each result of the hash function is unique 18) In the HashTable functions, we had to make sure the client’s hash function did not produce an index outside of the array; yet, we didn’t need a size variable as a private member of HashTable because: A. the client knows what size the hash table is B. the Array used for the hash table has a length function C. if the hash function is faulty, the index produced must be less than 0 D. we require that the client thoroughly test the hash function 19) In the private section of HashTable, we had a pointer to a function; yet, we did not need to write a destructor for HashTable because: A. the Array data member takes care of freeing the memory used by the pointer to the function B. pointers to functions free the dynamic memory that they point to automatically upon destruction of the object that contains them C. the function in dynamic memory can still be called after the HashTable object is destroyed, so there is no memory leak D. the pointer to a function does not point to dynamic memory 20) A reason that false can be returned for the retrieve and remove functions of HashTable is that: A. we may be out of heap memory B. the element we want to retrieve or remove is not in the hash table C. both A and B

D. neither A nor B 21) In the DoublyLinkedList, the retrieve and remove functions are ( 1 ) functions because: A. they always work with the first element of the list B. they always work with the last element of the list C. if the element is not found on one link, it will be found on the other D. a hash table is used to locate the element (under the assumption of uniform hashing) 22) We can keep the collision list short and, on average, bounded by a small constant because: A. we can use a hash function that produces uniform hashing reasonably well B. we can experimentally make the hash table array as large as we want until the number of collisions are minimized, on average, to the point where we would like it to be C. if the hash table is large enough, only an occasional collision will occur D. All of the above 23) The array used in a hash table should be divided up and counted as part of the housekeeping space size h of a node because: A. the elements of the array are typically within the linked list nodes anyway B. each array element contains a linked list node C. a linked list node contains a pointer to an array element D. there may be more elements in the array than there are elements in the linked list nodes 24) Header and trailer nodes are used in DoublyLinkedList because: A. they eliminate special cases that work with the front and end of the list B. without a header node, we can’t iterate forwards through the list and without a trailer node, we cannot iterate backwards through the list C. you can’t use the hash function without them D. All of the above 25) The insert function of HashTable can return false because: A. the hash table may be full B. we may be out of heap memory C. a duplicate key already exists D. the client supplied a faulty hash function

Answers to Multiple Choice (Chapter 11) 1) C 2) C 3) B 4) A 5) C

6) B 7) A 8) A 9) C 10) C 11) D 12) D 13) A 14) C 15) C 16) A 17) D 18) B 19) D 20) B 21) D 22) D 23) D 24) A 25) D Short Answer (Chapter 11) 1) Why is the insert function guaranteed to be a (1) function in HashTable?

2) Even though a pointer to a function is used in the private section of HashTable, why wasn’t a copy constructor necessary?

3) When figuring the housekeeping space for each node in the hash table, why don’t we count the Array housekeeping space, such as errorCode?

4) In the DoublyLinkedList makeEmpty function, why is it that we only need to consider freeing the nodes in the doubly linked list and not the nodes in the collision lists?

5) Considering the amount of space wasted for each list node in the DoublyLinkedList, can it still be advantageous for large element sizes? Why or why not?

6) Why would we ever want to use chaining if we are using the hash function h( k ) = k?

7) Why does each node in the DoublyLinkedList have three pointers?

8) Why do we need an initializer list in the copy constructor for the DoublyLinkedList?

9) Consider telling the client what to name a hash function, so that it can be called from HashTable without using a function pointer. What would be the advantage of using the function pointer instead?

Essay (Chapter 11) 1) How does a DoublyLinkedList object compare to a LinkedList object in terms of speed and memory conservation?

2) Describe the differences between the probing technique and the chaining technique.

3) How would a sorted DoublyLinkedList compare to a sorted LinkedList?

4) Explain how the function pointer is used for the hash function in HashTable. Include in your explanation how the hash function made by the client, how the hash function is made known to HashTable, how it is stored by HashTable, how it is used by HashTable, and why pointers to functions were used.

Chapter 12 Multiple Choice (Chapter 12)

1) A(n) _________________ is used when we wish to remove the current maximum element, on each removal, from a data structure.

A. binary tree B. minheap C. priority queue D. root 2) When we add an element to a priority queue, it is called a(n) _______________ operation.

A. enqueue B. dequeue C. insertion D. additive 3) When we remove an element from a priority queue, it is called a(n) ___________ operation.

A. removal B. enqueue C. dequeue D. subtractive 4) A(n) __________ is often used to implement a priority queue.

A. array B. heap C. linked list D. stack 5) A(n) ____________ has one, and only one path from a root node to any other node.

A. priority queue B. tree C. cyclc D. level

6) A(n) ___________ is a link between two nodes in a tree.

A. branch B. twig C. edge D. stem 7) A(n) __________ is a sequence of links that can be traveled from one node to get to another node.

A. route B. linkerway C. level D. path 8) A(n) _______________ is a link that can only be followed in one direction.

A. directed stem B. directed edge C. directed branch D. directed twig 9) The ____________ is the only node in a tree that doesn’t have a parent.

A. parent B. root C. leaf D. child 10) A structure that has a(n) ______________ is not a tree.

A. cycle B. node C. edge D. leaf 11) Which of the following is true about a parent in a tree?

A. A node can have two or more parents.

B. The root node is the only node that has a parent.

C. A parent is the node furthest from the root in a parent-child relationship.

D. A parent is the node closest to the root in a parent-child relationship.

12) Which of the following is true about children in a tree?

A. A node can have two or more children.

B. Leaf nodes are the only nodes that don’t have children.

C. Neither A nor B D. Both A and B 13) The only _________ nodes in a full binary tree are on the bottom level.

A. parent B. child

C. leaf D. root 14) A(n) _____________ is a part of a tree that is a tree itself.

A. supertree B. subtree C. heap D. trunk 15) Which of the following is true about a binary tree?

A. The root node must have two children.

B. A leaf node must have no children or one child.

C. Each node can only have 0, 1, or 2 children.

D. All of the above 16) The _____________ of a node is the number of edges in the path from the root node to that node.

A. height B. weight C. status D. level 17) A(n) ______________________ is a binary tree in which each node has two children, except for the nodes on the last level, which is completely filled.

A. complete heap B. level binary tree C. spring binary tree D. full binary tree 18) A complete binary tree is a binary tree in which: A. every single node has exactly two children B. the root node has exactly two children C. the last level is completely filled (with the maximum number of nodes any binary tree could have) or it would be full except for missing its rightmost nodes D. the last level must be completely filled with the maximum number of nodes any binary tree could have 19) A(n) ____________ is a heap in which the value of each node is greater than or equal to the values of its children (if it has any children) A. binary heap B. maxheap C. ordered heap D. complete heap 20) In a minheap: A. there are a minimum number of nodes for a complete heap

B. the nodes on the last level have the smallest values C. the value of each node is less than or equal to the values of its children (if it has any children) D. the node with the minimum value is at the end of the heap 21) ______________ is the process of turning a structure into a heap by swapping downwards.

A. Swapifying B. Heapbuilding C. Heapifying D. Heaping 22) The deepCopy function of the PriorityQueue (linked version) is an example of a(n) ______________ function A. auxiliary (or helper) B. public C. both A and B D. neither A nor B 23) A ___________ is an empty node at the top of a tree.

A. header B. root C. root header D. NULL node 24) When we want a priority queue, and the following is true: after enqueuing a group of elements, they can be sorted in ( n ) time, and after dequeuing starts, we will never enqueue again; then we should use: A. a heap for the priority queue B. a heapify function C. an array for the priority queue D. a stack for the priority queue 25) If we want a priority queue, enqueuing and dequeuing can come at arbitrary times, and the element size is 8 bytes, then to conserve memory we should use: A. an array-based heap B. a linked (embedded) heap C. a linked list D. a stack 26) If we want a priority queue, enqueuing and dequeuing can come at arbitrary times, and the element size is 100 bytes, then to conserve memory we should use: A. a linked (embedded) heap B. a linked list C. a stack D. an array-based heap

27) Suppose the node of an array-based heap has index 9. The left child has index: A. 19 B. 20 C. 4 D. 8 28) Suppose the node of an array-based heap has index 42. The right child has index: A. 43 B. 86 C. 85 D. 20 29) Suppose the node of an array-based heap has index 32. The parent has index: A. 16 B. 15 C. 65 D. 66 30) The heapify function is inlined because: A. the nodes of a heap for swapping are in a line through the heap B. it is called within the loop of the second constructor, and the client won’t use it C. it is not expected to be used inside a loop D. it is only called from the dequeue function

Answers to Multiple Choice (Chapter 12) 1) C 2) A 3) C 4) B 5) B 6) C 7) D 8) B 9) B 10) A 11) D 12) D 13) C 14) B 15) C 16) D 17) D 18) C

19) B 20) C 21) C 22) A 23) C 24) C 25) A 26) A 27) A 28) B 29) B 30) B

Short Answer (Chapter 12) 1) When heapifying and the value of a child is swapped with the value of a parent, explain why the value of the child ends up in its rightful position.

2) Why are heaps noted for their speed?

3) Why is it advantageous to provide an initial group of elements at one time to a heap, rather than enqueuing them one by one?

4) Why is an enqueue-dequeue pair of operations better for a heap than for a sorted array?

5) Why can’t a node of a tree have more than one parent?

6) Consider a binary tree in which the value of each node is greater than or equal to the values of its children (if it has any children). Yet, it is possible that this binary tree is not a heap. Explain why.

7) If an array is used for a priority queue, explain why the enqueue operation would be a (n) operation, on average.

8) Why is the greatest value of a heap in its root?

9) Why is heapifying considered to be a O( lg n ) operation (using the best possible bigoh notation that applies correctly) instead of a ( lg n ) operation?

10) Considering two full adjacent levels of a heap, why does the lower level have twice as many nodes as the upper level?

Essay (Chapter 12) 1) Discuss, in detail, how the enqueue function works for a heap-based priority queue.

2) Discuss, in detail, how the dequeue function works for a heap-based priority queue.

3) Discuss how an array of arbitrary elements are turned into a heap (using the second constructor of PriorityQueue).

4) Discuss how an array-based priority queue compares to a heap-based priority queue.

5) Discuss how an array-based heap implementation of a priority queue compares to a linked (embedded) heap implementation of a priority queue.

Chapter 13 Multiple Choice (Chapter 13) 1) A _____________ function is a function that calls itself.

A. infinite B. recursive C. self-calling D. iterating 2) If a recursive function does not have a base case, the result is usually: A. a baseless function B. an infinite function C. a compiler error D. infinite recursion 3) The _______ case is the case that stops recursion.

A. condition B. recursive C. base D. blocking 4) The _____________ case calls the function that it is in.

A. condition B. recursive C. base D. blocking 5) A(n) _______________ is used to call a recursive function, and it may check for possible errors before calling the function.

A. main program B. class function C. overloaded operator function D. driver Questions 6-15 pertain to the function given below: 1 2 3 4 5 6

float p( float x, int n ) { if ( n == 0 ) return 1; else return x * p( x, n – 1 );

7

}

6) This function is an example of a(n) _________ function: A. infinite B. iterating C. self-calling D. recursive 7) What does this function accomplish?

A. it computes the factorial of x B. it computes xn C. it multiples all integers in the range from x to n D. it adds the sum of x * n for n times 8) The base case is shown on: A. lines 3-4 B. lines 5-6 C. line 1 D. lines 3-6 9) The recursive case is shown on: A. lines 5-6 B. lines 3-4 C. line 1 D. lines 3-6 10) If n were negative the result would be: A. a negative function B. an infinite function C. a compiler error D. infinite recursion 11) A ____________ would be used to check to see if x = 0 and n = 0 at the same time, and can also check to see if n is negative, before calling the recursive function.

A. driver B. class template C. class function D. overloaded operator function 12) If we wanted to write lines 3-6 tersely using the ternary operator, they would look like this: A. return ( n != 0 )? 1 : x * p( x, n – 1 ); B. return ( n == 0 )? x * p( x, n – 1 ) : 1; C. return ( n == 0 )? 1 : x * p( x, n – 1 ); D. return ( n != 0 )? x * p( x, n – 1 );

13) If we call function p with n = 7, then the next time p is called, n would be: A. 1 B. 0 C. 8 D. 6 14) If n were negative, the driver can get the correct answer via function p by using the line of code: A. return 1 / p( x, -n ); B. return 1 / p( x, n ); C. return p( x, -n ); D. return p( x, n ); 15) The time complexity of the p function depends upon: A. the number of elements B. the magnitude of x C. the magnitude of n D. the magnitude of x * n Questions 16-25 pertain to the function given below: 1 2 3 4 5 6 7 8 9 10

bool search( Node<Bird> *ptr, Bird & bird, Bird dove ) { if ( ptr == NULL ) return false; if ( ptr->info == dove ) { bird = ptr->info; return true; } return search( ptr->next, bird, dove ); }

which is called for a linked list (where start points to the first node) using the lines of code: if ( search( start, bird, dove ) ) cout << “search successful” << endl; 16) This function returns: A. true if the linked list is empty B. false if a dove is found in the list C. true if the linked list does not contain a dove D. None of the above 17) If this function returns true, this function also returns: A. the other Bird information for the first node that does not contain dove

B. a pointer to the Bird node that contains dove C. the other Bird information for the node that contains dove D. a pointer to NULL 18) This function has: A. one base case B. the number of base cases depends on the length of the linked list C. two base cases D. three base cases 19) If there were no base case for this function, we would get: A. a compiler error B. infinite recursion C. a runtime error D. an infinite function 20) Recursion will stop if there is no dove in the linked list, due to lines: A. 3-8 B. 5-8 C. 9 D. 3-4 21) Recursion will stop if there is a dove in the list, due to lines: A. 3-8 B. 5-8 C. 9 D. 3-4 22) If the search needs to continue in the execution of the current search function, then line(s) __________ is(are) executed.

A. 1 B. 9 C. 4 D. 6-7 23) It would be safe to have a driver for this search function, in the case: A. that the linked list is empty B. that there is no dove in the linked list C. A driver would not help to safeguard against any adverse conditions.

D. that there is more than one dove in the linked list 24) The best-case time complexity for this function would be _________, where n is the number of elements.

A. ( lg n ) B. ( 1 ) C. ( n2 )

D. ( n ) 25) The worst-case time complexity for this function would be _________, where n is the number of elements.

A. ( lg n ) B. ( 1 ) C. ( n2 ) D. ( n )

Answers to Multiple Choice (Chapter 13)

1) B 2) D 3) C 4) B 5) D 6) D 7) B 8) A 9) A 10) D 11) A 12) C 13) D 14) A 15) C 16) D 17) C 18) C 19) C 20) D 21) B 22) B 23) C 24) B 25) D

Short Answer (Chapter 13) 1) Describe what a base case is.

2) Describe what a recursive case is.

3) Explain what happens when there is no base case in a recursive function.

4) What is a driver for a recursive function?

5) Describe how pointers are advanced through linked structures in a recursive function call.

6) How are time complexities of recursive functions evaluated?

7) Why is infinite recursion different than an infinite loop?

Essay (Chapter 13) 1) Compare time complexity analysis of loops and time complexity analysis of recursion.

2) Discuss the entire recursive process that would occur for the recursive function below: 1 2 3 4 5 6 7

float p( float x, int n ) { if ( n == 0 ) return 1; else return x * p( x, n – 1 ); }

if this function were called with the line of code: answer = p( 2, 3 ); 3) Discuss the guidelines for writing recursive functions.

Chapter 14 Multiple Choice (Chapter 14) 1) ________________ uses a priority queue to sort elements.

A. insertion sort B. quicksort C. counting sort D. heapsort 2) The compiler makes a function out of a(n) ______________, depending upon the type of parameter(s) passed.

A. function definition B. function prototype C. function pointer D. function template

3) The algorithm that can run in ( n ) time if the elements are nearly sorted, yet does not depend on the range of values, is: A. insertion sort B. quicksort C. counting sort D. heapsort 4) A(n) _______________ occurs when any two elements are out of order.

A. pivot B. partition C. swap D. inversion 5) _______________ is one of the most popular sorting algorithms, due to its low coefficient in the most significant term of its average-time instruction function.

A. Quicksort B. Insertion sort C. Heapsort D. Counting sort 6) A(n) _______________ is selected in the quicksort algorithm for comparision purposes.

A. comparator B. pivot C. swapper D. inversion 7) A(n) _____________ function is a part of the quicksort algorithm.

A. sorting B. partition C. comparing D. pivot 8) The sorting algorithm where the time complexity depends on both the range and the number of elements is: A. quicksort B. insertion sort C. heapsort D. counting sort 9) What sorting algorithm can be used to sort a linked list?

A. No sorting algorithm B. Almost any sorting algorithm C. Insertion sort only D. Quicksort only

10) Why is work eliminated in the heapsort algorithm if all values are the same?

A. An array that has the same values in it is already sorted, and the heapsort algorithm detects this immediately.

B. An array that has the same values in it can’t be sorted, so there is no point in trying.

C. The algorithm to build a heap out of an initial array returns immediately.

D. A swap does not need to be done in the heap if the parent’s value equals the childrens’ values.

Questions 11-14 pertain to the insertion sort algorithm, given below: 1 2 3 4 5 6 7

for each j, from 1 to the length of A – 1 temp = A[ j ] i=j–1 while i is greater than -1 and A[ i ] is greater than temp A[ i + 1 ] = A[ i ] i— A[ i + 1] = temp

11) Why is it significant that the number of times that line 5 is executed is equal to the number of inversions in the original array?

A. It tells us that the time complexity of insertion sort is always ( n ).

B. It can help us to analyze the time complexity of insertion sort, as long as this number can be put in terms of n.

C. It tells us that the time complexity of insertion sort is always ( n2 ).

D. It goes to show how much memory space is conserved with insertion sort.

12) The loop on line 1 tells us that the time complexity of insertion sort is at least: A. ( 1 ) B. ( n ) C. ( lg n ) D. ( n2 ) 13) Why is one condition on line 4 “i is greater than -1”?

A. -1 is not a valid index of an array B. if i has been set to -1, it means the array is already sorted C. if i is -1, we cannot do any more one-assignment swaps, so we must exit the loop D. if i is -1, it means the array cannot be sorted 14) Recall that the worst number of inversions occur in an array sorted in descending order, in which each of the n elements is inverted with the other n – 1 elements. Why then, is the maximum number of inversions n( n – 1 ) / 2 instead of n( n – 1 )?

A. There is only a 50% chance that each inversion will occur.

B. Since we are only sorting half the array, on average, we divide by 2 to compensate.

C. We are counting each inversion twice, so we must divide by 2.

D. Since we only need to swap the element at a front position of the array with the element in the corresponding back position of the array, one swap puts 2

elements in their proper positions, and so we divide by 2 15) If quicksort is being used to sort an array that is in descending order, why would a function call to partition make any progress?

A. It wouldn’t. Each element would be greater than the pivot, so nothing would be accomplished.

B. The pivot would be selected and ultimately placed into the middle (or close to the middle) of the array.

C. The pivot, at least, ends up in its final resting place in (what will be) the sorted array.

D. A single call to the partition function would sort the left side of the array, and then the right side of the array so, in this case, tremendous progress would be made.

16) The time complexity of counting sort is unusual because: A. it does not depend on the number of elements B. it depends only upon the range of element values C. it can be better than ( n ) D. it depends on two factors: the number of elements and the range of element values Questions 17-22 pertain to the counting sort algorithm, given below: 1 2 3 4 5 6 7 8 9 10 11

COUNTING-SORT( A ) make an Array C of length k + 1 for each i, from 0 to k C[ i ] = 0 for each j, from 0 to the length of A - 1 C[ A[ j ] ]++ j=0 for each i from 0 to k for each m from 1 to C[ i ] A[ j ] = i j++

17) In the nested for loop, lines 8-11, j will not increment to the point where any elements will be written in beyond the last element of array A, because: A. C[i] will be 0 much of the time, so lines 10-11 will be seldom executed B. k will not be that large, or we wouldn’t be using counting sort C. All the C[i], from i = 0 to i = k, when added together, will give the total number of elements in array A D. j won’t be incremented beyond m, which is much smaller than the index of the last element of A 18) Line 9 will be executed at least k times, because: A. C[ i ] is k or greater, on average B. lines 10-11 must be executed at least k times, or the algorithm would not work C. the for loop on line 8 iterates k + 1 times D. C[ i ] is never less than k

19) What does it mean if a 7 is stored at index 1 of the C array?

A. There is one element with value 7 in the A array.

B. In the final sorted array, there will be only one seven.

C. In the final sorted array, there will be from one to seven elements.

D. There are seven elements with value 1 in the A array.

20) Why can we write over the elements in array A on lines 8-11, without losing the values of the elements in array A? A. By the time line 8 is reached, all of the information in array A is contained in array C. B. They are written in array A in such a way that we don’t write into an element of array A until it already has been written in a safe place of array A. C. Both A and B D. Neither A nor B 21) Why does the loop on line 9 iterate C[ i ] times?

A. C[ i ] contains the number of times that the value i must be written into array A. B. For some value of i, C[ i ] is equal to n.

C. For some value of i, C[ i ] is equal to k.

D. i is the number of times that C[ i ] must be written into array A 22) When the nested loop of lines 8-11 is done executing, why is it that lines 10-11 will have been executed exactly n times?

A. C[i] will be 0 much of the time, but it will be equal to n one time B. Each C[ i ] will be equal to n / (k + 1) C. Array A has a blocker in it, which prevents more than n elements being written into it.

D. All the C[ i ], from i = 0 to i = k, when added together, will give the total number of elements in array A 23) If nothing is known about the elements ahead of time, then any sorting algorithm must take at least ( n ) time to sort the elements, by virtue of the fact that: A. counting sort takes at least ( n ) time B. quicksort takes at least ( n lg n ), and you can’t get any faster than that C. it takes that much of a time complexity just to look at the elements D. we must always search for an insertion point in ( n ) time 24) Quicksort is a popular sorting algorithm because: A. it is recursive B. its best-case time has the best possible time complexity of a sorting algorithm C. it has a low coefficient in the most significant term of its average-time instruction function D. its worst-case time has the best possible time complexity of a sorting algorithm 25) In the algorithm for sorting a linked list, given below: 1

i=0

2 3 4 5 6 7 8 9 10 11

ptr = start while ptr is not equal to NULL A[ i++] = ptr ptr = ptr->next // sort the array with a sorting algorithm (swap addresses instead of elements); // use A[ i ]->info to look at an element for all i from 0 to n – 2 A[ i ]->next = A[ i + 1 ] start = A[ 0 ] A[ n – 1 ]->next = NULL

consider the time complexity of the sorting algorithm used on lines 6-7. Why don’t lines 1-5 and lines 8-11 contribute any more to this time complexity?

A. The time complexity of lines 1-5 is ( 1 ) and the time complexity of lines 8-11 is ( 1 ).

B. The time complexity of lines 1-5 is ( lg n ), and the time complexity of lines 8-11 is ( lg n ); these time complexities must be less than that of the sorting algorithm.

C. Lines 1-5 and lines 8-11 are just “peripheral” lines, that have nothing to do with time complexity.

D. The time complexity of the sorting algorithm must be at least ( n ), if nothing is known about the elements ahead of time; the time complexity of lines 1-5 is ( n ), and the time complexity of lines 8-11 is ( n ).

Answers to Multiple Choice (Chapter 14) 1) D 2) D 3) A 4) D 5) A 6) B 7) B 8) D 9) B 10) D 11) B 12) B 13) C 14) C 15) C 16) D 17) C 18) C 19) D

20) A 21) A 22) D 23) C 24) C 25) D

Short Answer (Chapter 14) 1) Why is insertion sort fast when the elements in the original array are nearly sorted?

2) Recall that in the partition function of quicksort, the parameters passed in include p, the first element, and r, the last element. Why is it necessary to pass these in as parameters (that is, won’t they always be the same)?

3) Why is a function template good to use for sorting algorithms?

4) Would it be a good idea to use a sorting algorithm on the array for the sake of doing a single binary search for an element? Why or why not?

5) Would it be a good idea to use the binary search algorithm on the sorted part of an array during insertion sort, to locate the point at which the next element is to be inserted?

Why or why not?

6) Why is k < n the condition that we want to think about before using counting sort?

7) When a sorted linked list is needed, why can it be beneficial to first insert all the elements at the beginning of the list in ( n ) time and then use an algorithm for sorting the linked list (rather than inserting each element into a linked list one at a time)?

Essay (Chapter 14) 1) Compare function templates to class templates, noting similarities and differences.

2) Compare heapsort to quicksort, noting under which conditions that one algorithm might be preferred over the other.

3) Describe, using pictures, how a linked list is sorted.

Chapter 15

Multiple Choice (Chapter 15) 1) A tree that allows searching for elements, and also provides elements in order in (n) time is called a(n): A. binary order tree B. binary search tree

C. order-and-search tree D. binary tree 2) A(n) _____________ BST is a BST in which insertions, retrievals, and removals are all done in O( lg n ) time, using the best possible time complexity that applies.

A. fast B. logarithmic C. balanced D. unbalanced 3) A(n) _________________ BST is a BST is which insertions, retrievals, and removals are all done in O( n ) time, using the best possible time complexity that applies.

A. slow B. balanced C. unbalanced D. linear 4) A(n) ______________ tree is a more advanced binary search tree which guarantees balancing.

A. super binary search B. autobalance binary search C. AVL D. BRS 5) A(n) ______________ is perhaps the most general data structure, where any node can be linked to any other node.

A. binary search tree B. DoublyLinkedList (DLL) C. graph D. red-black tree 6) A(n) _____________ is a node in a graph.

A. vertical B. vertex C. graph-node D. graph-let 7) A(n) ________________ connects two nodes in a graph.

A. arc B. connector C. edge D. linkage 8) A(n) _______________________ graph is a graph in which each node has a connection to every other node.

A. directed

B. cyclic C. acyclic D. fully connected 9) A(n) __________________ is a graph in which each connection has only one direction.

A. unidirectional graph B. digraph C. TS graph D. TR graph 10) A(n) ____________________ is a graph in which each connection has two directions.

A. undirected graph B. bigraph C. bidirectional graph D. TS graph 11) A cyclic graph has: A. a shape like a unicycle B. a graph that cycles from vertices to edges C. a cycle of two or more nodes D. a cycle of three or more nodes 12) A graph without cycles is called a(n): A. acyclic graph B. cycle-less graph C. straight graph D. tree graph 13) A(n) _____________ graph is a graph where every edge has a number associated with it.

A. numbered B. numbered edge C. weighted D. association 14) A(n) _______________ graph is graph with a low number of edges.

A. dense B. TS C. cycle-less D. sparse 15) A(n) __________________ graph is a graph with a high number of edges.

A. dense B. TS

C. cyclic D. sparse 16) A breadth-first search is a search conducted on a graph such that: A. the shortest paths are found between a chosen vertex and any other vertex B. the breadth array of the graph is searched first for the desired information C. the breadth linked list of the graph is search first for the desired information D. None of the above 17) A topological sort on an event graph can: A. provide the vertices of the graph in order, according to some data member B. rearrange the events inside the graph so that they are in order, starting at the top C. do a kind of logical sorting on the vertices, where the vertices are sorted by meaning rather than by number D. provide the order in which events can be performed 18) Two vertices A and B of a graph are adjacent if: A. they are drawn next to each other B. you can follow a connection between A and B, so that you can reach B from A. C. A is next to B in the adjacency matrix D. A is next to B in the adjacency list 19) A(n) _____________________ is usually implemented as a two-dimensional array, showing connections between vertices in a graph.

A. adjacency array B. connection matrix C. connection array D. adjacency matrix 20) A(n) ______________________ is usually implemented as an array of linked lists, showing connections between vertices in a graph.

A. adjacency matrix B. connection matrix C. adjacency list D. connection array 21) A(n) ________________________ is useful for implementing a graph when the number of vertices can change.

A. dynamic adjacency list B. dynamic vertex structure C. adjacency matrix hash table D. adjacency list hash table 22) A(n) ____________________ is useful for storing vertex information when the number of vertices can change.

A. dynamic hash table

B. vertex hash table C. linked list D. priority queue 23) A(n) ______________ is a list of all vertices, for which each vertex in the list is adjacent to a given vertex.

A. fan-in list B. fan-out list C. fan linked list D. fan list 24) _________________ has to do with how the amount of memory used can change depending on some factor(s), usually the number of elements.

A. Heapiness B. Space complexity C. Dynamic memory D. RAM-inosity 25) If memory is an issue rather than speed, and we have a sparse graph with a high number of vertices, it would probably be best to implement it with a(n): A. linked list B. adjacency matrix C. adjacency list D. priority queue 26) If speed is an issue, and the graph algorithm we are using frequently needs to know if there is a direction connection between two vertices, it would be best to implement the graph with a(n): A. priority queue B. linked list C. adjacency matrix D. adjacency list 27) The main reason why AVL and red-black trees are useful is because: A. they do much to conserve memory B. they are always much faster than a binary search tree C. they are noted for being unbalanced D. their performance is consistent 28) If memory conservation is of utmost importance, one reason for using an adjacency matrix would be because: A. the graph is directed B. the graph is acyclic C. the graph is sparse with a high number of vertices D. the graph is dense

29) The reason we don’t consider nodes that have equal values in a binary search tree is because: A. the nodes often contain struct objects of information B. it would be impossible to search for two or more values that are the same C. we need to be able to search for a node, so it makes sense to use keys D. it would be impossible to provide the elements of the nodes in order 30) When deleting a node from a binary search tree that has two children, the reason we can replace its element with the greatest value in its left subtree is because: A. the value will become greater or equal to the values of its children B. the value will be greater than everything on its left, and since it was in the left subtree, it will be less than everything in the right subtree C. Both A and B D. Neither A nor B

Answers to Multiple Choice (Chapter 15) 1) B 2) C 3) C 4) C 5) C 6) B 7) C 8) D 9) B 10) A 11) D 12) A 13) C 14) D 15) A 16) A 17) D 18) B 19) D 20) C 21) D 22) B 23) A 24) B 25) C 26) C 27) D 28) D

29) C 30) B

Short Answer (Chapter 15) 1) Why do AVL and red-black trees waste more memory than a binary search tree?

2) Why is an acyclic, directed graph not always a tree, even if it is not separated into two or more parts?

3) In terms of storing information, why are graphs a unique data structure?

4) If one is considering whether or not to use a BST or a DLL, and the time for each is expected to be about the same, what would be a good reason to decide on the BST? 5) Why is the space complexity of the adjacency matrix ( n2 )?

6) In what situation would an adjacency list have a speed advantage over an adjacency matrix?

7) Why are keys used in binary search trees?

8) In terms of conserving memory, why could an adjacency matrix be better than an adjacency list for a sparse graph?

Essay (Chapter 15) 1) Explain how a node is deleted when it has two or more children; include how the node is found in your discussion.

2) Discuss how you would decide between using a binary search tree or a DoublyLinkedLiit.

3) Discuss how you would decide between using an AVL tree and a binary search tree.

4) Discuss how you would decide whether or not to use an adjacency list or an adjacency matrix to implement a graph.