Q51. In pointers, meaning of ‘*’ is :
A. pointer variable
B. value of address
C. value at address
D. None of the above
Ans. C
Q52. Can we declare function inside structure of C ?
A. Yes
B. No
C. Warning
Ans. B
Q53. Which of the following is an ternary operator in C?
A. $$
B. &&
C. !*
D. ?:
Ans. D
Q54. Null function is also known as ______
A. Anonymous Function
B. Generic Function
C. Void Function
D. Null Operator
Ans. D
Q55. A complete binary tree has a property that the value at each
node is at least as large as the values at its children nodes. What is this
binary tree known as?
A. BST
B. AVL Tree
C. Complete Balanced Tree
D. Heap
Ans. D
Q56. Which of the following sorting algorithms yields
approximately the same worst-case and average-case running time behavior in O(n
log n)?
A. Bubble sort & Selection sort
B. Heap sort & Merge sort
C. Quick sort & Radix Sort
D. Tree Sort & Quick Sort
Ans. B
Q57. A librarian has to rearrange the library books on a shelf in
a proper order at the end of each day. Which of the following sorting
techniques should be the librarian’s ideal choice?
A. Bubble Sort
B. Insertion Sort
C. Selection Sort
D. Heap Sort
Ans. B
Q58. Which of the following concept is for stack implementation ?
A. Radix Search
B. BFS
C. Recursion
D. None of these
Ans. C
Q59. What is the average time required to perform a successful
sequential search for an element in an array A[1:n] ?
A. (n+1)/2
B. log n
C. n(n+1)/2
D. n^2
Ans. A
Q60. How are protected members of a base class accessed in the
derived class when inherited privately in C++ ?
A. Privately
B. Publicly
C. Protectedly
D. Not inherited
Ans. A
Q61. A sorting algorithm iteratively traverses through a list to
exchange the first element with any element less than it. It then repeats with
a new first element. What is this sorting algorithm called ?
A. Insertion Sort
B. Selection Sort
C. Heap Sort
D. Quick Sort
Ans. A
Q62. Recursion is executed in which order :
A. LIFO
B. FIFO
C. Random
D. All of the above
Ans. A
Q63. Which of the following ADT’s can be used to represent a
many-a-many relation ?
A. Tree
B. Stack
C. Graph
D. Queue
Ans. C
Q64. Merge Sort algorithm is based on which algorithmic technique
:
A. D&C
B. Dynamic Programming
C. Greedy
D. Brute Force
Ans. A
Q65. What will be the time complexity to add an element to the
queue?
A. O(1)
B. O(log n)
C. O(n)
D. O(nlogn)
Ans. A
Q66. A programmer tries to debug a code of 10,000 lines. It is
known that there is a logical error in the first 25 lines of the code. Which of
the following is an efficient way to debug the code ?
A. Compile and check line by line
B. Use interpreter on the first 25 lines of code
C. Compile and run the entire code
D. None of the above
Ans. B
Q67. The C Processors are specified with _______ symbol.
A. *
B. #
C. $
D. “
Ans. B
Q68. A variable declared in a function can be used in main ?
A. True
B. False
C. True if declared static
D. None of the above
Ans. B
Q69. Which is not a valid C statement :
A. int _t=0;
B. int Main=2;
C. float rate;
D. int $main;
Ans. D
Q70. What is the default return type if it is not specified in
function definition ?
A. void
B. int
C. double
D. short int
Ans. A
Q71. Control can be made out of recursion using :
A. pass
B. break
C. return
D. exit
Ans. C
Q72. In Stack, when top reaches to -1, the stack is said to be :
A. Overflow
B. Underflow
C. inflow
D. Runtime Error
Ans. B
Q73. When double is converted to float then the value is ?
A. Truncated
B. Rounded
C. Depends upon compiler
D. None of the above
Ans. C
Q74. This keyword is used for defining new data type names.
A. docstring
B. typedef
C. both
D. None of them
Ans. B
Q75. Which precision specifier the number of significant digits ?
A. %g
B. %G
C. %f
D. Both a and b
Ans. D
0 Comments