Accounting
Anthropology
Archaeology
Art History
Banking
Biology & Life Science
Business
Business Communication
Business Development
Business Ethics
Business Law
Chemistry
Communication
Computer Science
Counseling
Criminal Law
Curriculum & Instruction
Design
Earth Science
Economic
Education
Engineering
Finance
History & Theory
Humanities
Human Resource
International Business
Investments & Securities
Journalism
Law
Management
Marketing
Medicine
Medicine & Health Science
Nursing
Philosophy
Physic
Psychology
Real Estate
Science
Social Science
Sociology
Special Education
Speech
Visual Arts
Computer Science
Q:
Which statement is false?
a) The unary * operator is called the indirection operator or the dereferencing operator.
b) The operand of the unary * operator must be a pointer.
c) The unary * operator returns the value of its operand.
d) Placing a * operator before a pointer dereferences the pointer.
Q:
Which statement is false?
a) The operand of the address operator must be a variable.
b) The address operator cannot be applied to constants or to expressions.
c) The address operator can be applied to variables defined with the storage class register.
d) The address operator can be applied to variables defined with the storage class static.
Q:
The statement
y = &yPtr;
a) assigns the address of the variable y to pointer variable yPtr.
b) assigns the address of the variable yPtr to pointer variable y.
c) is a compilation error.
d) is a logic error.
Q:
The __________, or address operator, is a unary operator that returns the address of its operand.
a) &
b) &&
c) *
d) **
Q:
Three of the following expressions have the same value. Which of the following's value is different from the others?
(a) *&Ptr
(b) &*Ptr
(c) *Ptr
(d) Ptr
Q:
The & operator can be applied to
(a) constants
(b) variables defined with the storage class register
(c) variables defined with the storage class static
(d) rvalues
Q:
Which statement about pointers is false?
a) A pointer with the value NULL points to nothing.
b) NULL is a symbolic constant defined in the <stdio.h> header file.
c) Initializing a pointer to 0 is equivalent to initializing a pointer to NULL, but NULL is preferred.
d) The values 0 and 1 are the only values that can be assigned directly to a pointer variable.
Q:
Which statement about pointers is false?
a) They can be defined to point to objects of any data type.
b) The indirection operator * distributes to all comma-separated variable names in a definition.
c) The letters Ptr in a pointer variable name are optional.
d) A pointer may be initialized to 0, NULL or an address.
Q:
Referencing a value through a pointer is called __________.
a) interdiction
b) indirection
c) intermediation
d) redirection
Q:
The definition
int *count;
a) is a syntax error because only pointers can be defined with * notation.
b) is a compile-time error.
c) is a logic error.
d) is a correct definition of integer pointer count.
Q:
A non-pointer variable name __________ references a value and a pointer variable name __________ references a value.
a) directly, directly
b) directly, indirectly
c) indirectly, directly
d) indirectly, indirectly
Q:
Pointers are variables that contain __________ as their values.
a) strings
b) flowlines
c) memory addresses
d) directions
Q:
Pointers may be assigned which of the following?
(a) all integer values
(b) an address
(c) NULL
(d) both (b) and (c)
Q:
Pointers cannot be used to
(a) find the address of a variable in memory.
(b) reference values directly.
(c) simulate call-by-reference.
(d) manipulate dynamic data structures.
Q:
Assuming myString is a 20-element char array, which of the following statements might result in buffer overflow?
(a) scanf("%19s", myString);
(b) scanf_s("%s", myString, 20);
(c) scanf_s("%19s", myString, 20);
(d)scanf("%s", myString);
Q:
Which of the following statements is false?
(a) C provides automatic bounds checking for arrays.
(b) C provides no automatic bounds checking for arrays, so you must provide your own.
(c) Allowing programs to read from or write to array elements outside the bounds of arrays are common security flaws.
(d)Writing to an out-of-bounds element (known as a buffer overflow) can corrupt a program's data in memory, crash a program and allow attackers to exploit the system and execute their own code.
Q:
Which initialization is not performed by the following definition?
int b[2][2] = {{1}, {3, 4}};
a)b[0][0] is set to 1
b) b[0][1] is set to 1
c) b[1][0] is set to 3
d) b[1][1] is set to 4
Q:
An array containing 3 columns and 4 rows is typically referred to as a __________.
a) 12-element array
b) 3-by-4 array
c) 13-element array, because of the zero element
d) 4-by-3 array
Q:
Which statement is false about multidimensional arrays?
a) C supports multidimensional arrays.
b) A common use of multidimensional arrays is to arrange data into tables consisting of rows and columns.
c) To identify a particular table element requires two indices.
d) Every ANSI C system can support arrays with as many indices as the programmer chooses.
Q:
Which of the following does not initialize all of the array elements to 0?
(a)
int b[2][2];
b[0][0] = b[0][1] = b[1][0] = b[1][1] = 0;
(b) int b[2][2] = {0};
(c)
int b[2][2];
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 2; ++j) {
b[i][j] = 0;
}
}
(d) all of the above initialize all of their elements to 0.
Q:
Given the following definitions, what is the value of b[1][0]?
int b[2][2] = {{1}, {3, 4}};
(a) 0
(b) 1
(c) 3
(d) this isn"t a valid definition
Q:
A two-dimensional array element incorrectly referenced as a[x, y] is actually evaluated as
(a) a[x][y]
(b) a[y]
(c) a[x]
(d) a[0]
Q:
A sorted array of a million elements can be searched by a binary search in __________ or fewer comparisons.
a) 10
b) 20
c) 30
d) 999,999
Q:
Which of the following statements is false?
a) The linear searching method works well for small arrays.
b) The linear searching method works well for unsorted arrays.
c) The binary search algorithm eliminates from consideration one half of the elements in a sorted array after each comparison.
d) The binary search terminates only when the search key is equal to the middle element of a subarray.
Q:
Which of these is generally thought of as a high-performance technique?
a) bubble sort
b) linear search
c) binary search
d) iteration
Q:
The maximum number of comparisons needed for the binary search of a 2000 element array is
(a) 9
(b) 15
(c) 11
(d) 14
Q:
The binary search technique
(a) is better suited to small arrays
(b) is better suited to unsorted arrays
(c) can only be used on a sorted array
(d) is slower than a linear search
Q:
The __________ is the value that occurs most frequently in the data.
a) mean
b) median
c) mode
d) master
Q:
Calculating which of the following normally requires the data to be sorted first
a) mean
b) median
c) mode
d) total
Q:
The _____ is the average value of a set of data items.
a) mean
b) median
c) mode
d) matrix
Q:
In order to calculate the __________ of an array of values, the array must be sorted.
(a) median
(b) mode
(c) mean
(d) (a), (b), and (c)
Q:
A bubble sort of 1000 elements requires a maximum of __________ passes.
a) 1001
b) 1000
c) 999
d) 998
Q:
Which statement about the bubble sort is false?
a) It is easy to program.
b) It is a high-performance sort.
c) It compares only adjacent elements with one another.
d) The bubble sort compares successive pairs of elements.
Q:
Which statement about bubble sort is true?
(a) a maximum of n passes are needed to sort the array, where n is the number of elements
(b) swapping values requires two assignments
(c) performance is maximized
(d) the algorithm is very simple compared to other sorting procedures
Q:
Which statement is true?
a) Entire arrays are passed simulated call by reference and individual array elements are normally passed simulated call by reference.
b) Entire arrays are passed simulated call by reference and individual array elements are normally passed call by value.
c) Entire arrays are passed call by value and individual array elements are normally passed simulated call by reference.
d) Entire arrays are passed call by value and individual array elements are normally passed call by value.
Q:
The special conversion specifier for printing addresses is __________.
a) %a
b) %m
c) %p
d) %loc
Q:
Which statement is false?
a) C automatically passes arrays to functions using simulated call by reference.
b) When C passes an array to a function, the called function normally can modify the element values in the caller's original array.
c) The name of an array is actually the address of the first element of the array.
d) When an array is passed in a function call, the calling function knows precisely where in the called function's memory the passed array is.
Q:
To pass an array to a function, specify
a) the name of the array without any brackets.
b) the name of the array preceded by an empty pair of brackets.
c) the name of the array followed by a pair of brackets including the size of the array.
d) the name of the array followed by a pair of brackets including a number one less than the size of the array.
Q:
To prevent modification of array values in a function,
(a) the array must be defined staticin the function.
(b) the array parameter can be preceded by the constqualifier.
(c) a copy of the array must be made inside the function.
(d) the array must be passed call-by-reference.
Q:
Which of the following is false about a function being passed an array?
(a) it knows the size of the array it was passed
(b) it is passed the address of the first element in the array
(c) it is able to modify the values stored in the array
(d) all of the above are true
Q:
Unless otherwise specified, entire arrays are passed __________ and individual array elements are passed __________.
(a) call-by-value, call-by-reference
(b) call-by-reference, call-by-value
(c) call-by-value, call-by-value
(d) call-by-reference, call-by-reference
Q:
Which statement is false?
a) A static local variable exists for the duration of the program.
b) A static local variable is visible only in the control structure in which it is defined.
c) A static local array is not created and destroyed each time the function is entered and exited, respectively.
d) Arrays that are defined static are automatically initialized once at compile time.
Q:
Which statement is false?
a) Function scanf reads characters into memory from the keyboard until the first input whitespace character is encountered.
b) Function scanf can write beyond the boundary of the array into which input is being placed.
c) Function printf does not care how large the array it is printing is.
d) When using scanf, you must always precede with the & operator the name of each variable into which inputs are being placed.
Q:
Q:
Q:
Which statement is false?
a) C has no built-in bounds checking to prevent the computer from referring to an array element that does not exist.
b) The programmer is responsible for implementing array bounds checking.
c) Referring to an element outside the array bounds is a syntax error.
d) Referring to an element outside the array bounds is a logic error.
Q:
Which statement is true regarding the statement
++frequency[responses[answer]];
a) This statement increases the appropriate frequency counter depending on the value of responses[answer].
b) This statement increases the appropriate answer counter depending on the value of frequency[responses].
c) This statement increases the appropriate responses counter depending on the value of frequency[answer].
d) This statement produces a syntax error because subscripts cannot be nested.
Q:
Which statement is true?
a) Assigning a value to a symbolic constant in an executable statement is a syntax error.
b) A symbolic constant is a variable.
c) Space is reserved for both symbolic constants and variables that hold values at execution time.
d) Only uppercase letters can be used for symbolic constant names.
Q:
Which statement is true?
a) A symbolic constant is an identifier that is replaced with replacement text by the C preprocessor after the program is compiled.
b) Using symbolic constants to specify array sizes makes programs run faster.
c) Preprocessor directives are not C statements.
d) The #define preprocessor directive must end in a semicolon.
Q:
The following array definition
int n[5] = {32, 27, 64, 18, 95, 14};
a) is correct
b) causes a syntax error because there are only five initializers and six array elements.
c) causes a logic error because there are only five elements but there are six initializers.
d) causes a syntax error because there are six initializers but only five array elements.
Q:
Which statement is true?
a) Arrays are automatically initialized to zero.
b) To initialize all array elements to zeros, the array definition must explicitly initialize each element to zero.
c) Array elements can be initialized to zero by the array definition only at compile time.
d) Definitions for automatic arrays initialize the arrays at execution time.
Q:
If there are fewer initializers than elements in the array, the remaining elements are __________.
a) deleted
b) ignored
c) initialized to empty
d) initialized to zero
Q:
What's wrong with this code?
int[] = (1, 2, 3, 4, 5);
a) The array size must be specified in the square brackets.
b) The parentheses should be square brackets.
c) The square brackets should be curly braces.
d) The parentheses should be curly braces.
Q:
Suppose a program contains the code
for (i = 1; i < = 10; i++) {
n[i] = 0;
}
Which statement about this code must be true?
a) It contains an off-by-one error.
b) It contains a syntax error.
c) It is initializing the first 10 elements of an array.
d) It is initializing successive elements of an array.
Q:
Q:
Strings can not
(a) be initialized using string literals
(b) end in a character other than the null character
(c) be initialized with initializer lists
(d) be treated as arrays of characters
Q:
Referencing elements outside the array bounds
(a) can result in changes to the value of an unrelated variable
(b) is impossible because C checks to make sure it does not happen
(c) is a syntax error
(d) enlarges the size of the array
Q:
Constant variables
(a) can be assigned values in executable statements
(b) do not have to be initialized when they are defined
(c) can be used to specify array sizes, thereby making programs more scalable
(d) can be used to specify array sizes, but this makes programs harder to understand
Q:
Which of the following is not a correct way to initialize an array?
(a) int n[5] = {0, 7, 0, 3, 8, 2};
(b) int n[] = {0, 7, 0, 3, 8, 2};
(c) int n[5] = {7};
(d) int n[5] = {6, 6, 6};
Q:
Which definition tells the computer to reserve 12 elements for integer array c?
a) c[12] int;
b) int c [11];
c) c[11] int;
d) int c[12];
Q:
Which statement would be used to define a 10 element integer array c?
(a) Array c = int[10];
(b) c = int[10];
(c) int Array c[10];
(d) int c[10];
Q:
Which statement is false?
a) The brackets used to enclose the subscript of an array are not an operator in C.
b) To refer to a particular element in an array, we specify the name of the array and the position number of the element in the array.
c) The position number within an array is more formally called a subscript.
d) "Array element seven" and the "seventh element of an array" do not mean the same thing. This is a frequent source of off-by-one errors.
Q:
The first element in every array is the __________ element.
a) null
b) 1
c) 0
d) empty
Q:
An array is a group of memory locations related by the fact that they all have __________ array name and __________ type.
a) different, different
b) same, different
c) different same
d) same, same
Q:
Which of the following is false?
(a) the first element of an array is the zeroth
(b) the last element of an array is the array size - 1
(c) the position number contained within square brackets is called a subscript
(d) a subscript cannot be an expression.
Q:
An array is not ________.
(a) a consecutive group of memory locations
(b) indexed by integers
(c) pointer-based
(d) a dynamic entity
Q:
Lists, queues, stacks and trees are __________ data structures that may grow and shrink as programs execute.
a) flexible
b) automatic
c) dynamic
d) static
Q:
Arrays and structures are __________ entities in that they remain the same size throughout program execution.
a) dynamic
b) automatic
c) register
d) static
Q:
Arrays are data structures consisting of related data items of the same __________.
a) sort order
b) subscript
c) type
d) element
Q:
All of the following are reasons to use recursion except:
(a) an iterative solution is not apparent
(b) the resulting program is easier to debug
(c) it more naturally mirrors the problem
(d) it maximizes software performance
Q:
Recursion is to the base case as iteration is to ________?
(a) the counter
(b) an iteration statement
(c) failure of the loop continuation test
(d) a selection statement
Q:
Which statement is false?
a) The ANSI C standard does not specify the order in which the operands of most operators are to be evaluated.
b) The ANSI C standard specifies the order of evaluation of operators &&, ||, comma, and ?:.
c) A program that evaluates Fibonacci numbers recursively achieves high performance because of exponential complexity.
d) Programs that depend on the order of evaluation of the operands of operators other than &&, ||, comma, and ?: can function differently on systems with different compilers.
Q:
Assuming the following pseudocode for the Fibonacci series, what is the value of fibonacci(5)?fibonacci(0) = 0fibonacci(1) = 1fibonacci(n) = fibonacci(n - 1) + fibonacci(n - 2)(a) 8(b) 1(c) 3(d) 5
Q:
Which statement is false?
a) A recursive function is a function that calls itself either directly or indirectly through another function.
b) A recursive function knows how to solve only one or more base cases.
c) The recursion step executes after the original call to the function terminates.
d) In order for the recursion to eventually terminate, each time the function calls itself with a slightly simpler version of the original problem, this sequence of smaller and smaller problems must eventually converge on a base case.
Q:
Recursion is memory-intensive because ________.
(a) it must occur numerous times before it terminates
(b) previous function calls are still open when the function calls itself and the arguments of these previous calls still occupy space on the call stack
(c) many copies of the function code are created
(d) it requires large data values
Q:
What value does function mystery return when called with a value of 4?
int mystery (int number)
{
if (number <= 1) {
return 1;
}
else {
return number * mystery(number " 1);
}
}
(a) 1
(b) 24
(c) 0
(d) 4
Q:
A recursive function is a function that ________.
(a) returns a double
(b) takes 3 arguments
(c) calls itself
(d) is inside of another function
Q:
Which is not a scope for an identifier?
a) function scope
b) record scope
c) block scope
d) function-prototype scope
Q:
Which statement is false?
a) When we define a local variable in a block it can be referenced only in that block or in blocks in which that block is nested.
b) Labels are the only identifiers with function scope.
c) Labels can be used anywhere in the function in which they appear, but can not be referenced outside the function body.
d) Labels are used in switch statements and in goto statements.
Q:
The only identifiers that can be reused elsewhere in a program without any ambiguity are
(a) global variables
(b) static local variables
(c) those in the parameter list of a function prototype
(d) those in the parameter list of a function definition