• How can we describe an array in the best possible way?

(a) The Array shows a hierarchical structure.
(b) Arrays are immutable.
(c) Container that stores the elements of similar types
(d) The Array is not a data structure

• The worst-case occur in linear search algorithm when ..

(a) Item is somewhere in the middle of the array
(b) Item is not in the array at all
(c) Item is the last element in the array
(d) Item is the last element in the array or item is not there

• The complexity of the sorting algorithm measures the.. as a function of the number n of items to be sorter.

(a) Average time
(b) Running time
(c) Average-case complexity
(d) Case-complexity

• The Time complexity of bubble sort algorithm is ..

(a) O(n)
(b) o(logn)
(c) O(n2)
(d) O(n logn)

• Partition and exchange sort is …

(a) Quick sort
(b) heap heap sort
(c) bubble sort
(d) None

• To represent hierarchical relationship between elements, Which data structure is suitable?

(a) Tree
(b) Graph
(c) Stack
(d) Queue

• The way in which the data item or items are logically related defines..

(a) storage structure
(b) data structure
(c) data relationship
(d) data operation

• Which of the following can be used as a criterion for classification of data structures used in language processing?

(a) nature of a data structure
(b) purpose of a data structure
(c) lifetime of a data structure
(d) All of the above

• What is the process of finding the location of a given data element in the data structure called?

(a) Deletion
(b) Insertion
(c) Traversing
(d) Searching

• What plays an important role in programming?

(a) Data
(b) Computer
(c) Frameowrk
(d) None of the Above

• Which of the following is a stable sorting algorithm?

(a) Merge Sort
(b) Quick Sort
(c) Heap Sort
(d) Selection Sort

• How do you initialize an array in C?

(a) int int arr[3] = (1,2,3);
(b) int arr(3) = {1,2,3);
(c) int arr[3] = {1,2,3};
(d) int arr(3) = (1,2,3);

• Which of the following recursive formula can be used to find the factorial of a number?

(a) fact(n) = n * fact(n)
(b) fact(n) = n * fact(n+1)
(c) fact(n) = n * fact(n-1)
(d) fact(n) = n * fact(1)

• Is following sequence is a fibonacci sequence:0, 1, 1, 2, 3, 5, 8, 13, 21,.

(a) True
(b) False

• Before sorting & After sorting location of element is same. This concept is called as

(a) Sort Stability
(b) Sort Selection
(c) Sorting
(d) None of the above

• Perform based criteria of algorithm, which has to do with computing algorithm called as _________.

(a) Space Complexity
(b) Time Complexity
(c) Notations
(d) Subtitles/closed captic

• Worst case measured by

(a) Big Oh Notation
(b) Omega Notation
(c) Theta Notation
(d) None

• Which of the following is non-liner data structure ?

(a) Trees
(b) Stack
(c) List
(d) Queue

• Which of the following is not the required condition for binary search algorithm?

(a) The list must be sorted
(b) There should be the direct access to the middle element in any sublist
(c) Divide conquare is used
(d) Search sequentially

• Binary Search can be categorized into which of the following?

(a) Brute Force technique
(b) Divide and conquer
(c) Greedy algorithm
(d) Dynamic programming

• What is the time complexity of binary search with iteration?

(a) O(nlogn)
(b) O(logn)
(c) o(n)
(d) O(n2)

• The element that is going to be searched in a list is called

(a) items
(b) key
(c) file
(d) table

• In binary search, we compare the value with the elements in the. position of the array.*

(a) Left
(b) middle
(c) Right
(d) None

• Which is the fastest searching algorithm?

(a) Linear Search
(b) Binary Search
(c) Interpolation
(d) None

• The following sequence is a fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,. Which technique can be used to get the nth fibonacci term?

(a) Switch case
(b) Recursion
(c) Functions calling
(d) Divide & Conquare

• What is an internal sorting algorithm?

(a) Algorithm that uses tape or disk during the sort
(b) Algorithm that uses main memory during the sort
(c) Algorithm that involves swapping
(d) Algorithm that are considered ‘in place’

• Which of the following real time examples is based on insertion sort?

(a) Arranging a pack of playing cards
(b) Database scenarios and distributes scenarios
(c) Arranging books on a library shelf
(d) Oreal-time systems

• How many passes does an insertion sort algorithm consist of?

(a) N
(b) N-1
(c) N+1
(d) N2

• Which of the following sorting algorithms is the fastest for sorting small arrays

(a) Quick sort
(b) Insertion sort
(c) Shell sort
(d) Heap sort

• Which of the following sorting algorith ms is the fastest?

(a) Bubble Sort
(b) Quick Sort
(c) Merge Sort
(d) Selection Sort

• Which of the following is true about merge sort?

(a) Merge Sort works better than quick sort if data is accessed from slow sequential memory.
(b) Merge Sort is stable sort by nature
(c) Merge sort outperforms heap sort in most of the practical situations.
(d) All of the ahove

• What is the average case time complexity of merge sort? *

(a) O(n log n)
(b) o(n2)
(c) o(n2 log n)
(d) O(n log n2)

• In a stack, if a user tries to remove an element from empty stack it is called

(a) Underflow
(b) Empty collection
(c) Overflow
(d) Garbage Collection

• The given array is arr = {1,2,4,3). Bubble sort is used to sort the array elements.How many iterations will be done to sort the array with improvised version?*

(a) 4
(b) 2
(c) 1
(d) 0

• In computer science, algorithm refers to a special method usable by a computer for the solution to a problem.*

(a) True
(d) False