DSC UNIT 7

__________ is a technique of finding an element from the given data list or set of the elements like an array, list, or trees

• Sorting

• Searching

• Linked List

• Stack

The __________ is a technique to find out an element in a sorted or unsorted list.

• Sorting

• Searching

• Linked List

• Stack

The __________ is a conventional method of searching data.

• Insertion sort

• Heap sort

• linear search

• Stack

Complexity of linear search algorithm is __________

• O(n)

• O(logn)

• O(n2)

• O(n logn)

The __________ is a method of searching a target element in a list sequence.

• Insertion sort

• Heap sort

• linear search

• Stack

Binary search algorithm cannot be applied to __________

• sorted linked list

• sorted binary trees

• sorted linear array

• pointer array

A __________ is an algorithm for searching for a given key value in an indexed array that has been ordered by the values of the key.

• Binary Search

• Linear Search

• Interpolation search

• pointer array

On average the interpolation search makes about __________ comparisons

• O(n)

• O(logn)

• O(n2)

• log(log(n))

Which indicates in-order traversal?

• Left, Parent, Right

• Right, Parent, Left

• Parent, Right, Left

• Parent, left, right