Recent questions tagged searching

Which of the following is correct order of increasing time complexity of algorithmsTower of Hanoi with $n$ disk.Binary search given $n$ sorted numbers.Heap sort given $n$...

Which of the following is $\text{TRUE}?$The cost of searching an AVL tree is $\theta(\log n)$ but that of binary search is $0(n)$The cost of searching an AVL tree in $\th...

​​​​Which of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph $G$ is/are TRUE?A DFS tree of $G$ is...

​​An array $A$ of length $n$ with distinct elements is said to be bitonic if there is an index $1 \leq i \leq n$ such that $A[1 . . i]$ is sorted in the non-decreasing or...

Arun has a non-empty subset $\text{S}$ of the numbers $\{1,2,3, \ldots, 1000\}$. Bela wants to find any number $\text{x}$ in Arun's set $\text{S}$.To do this, Arun and Be...

The $\text{A}^{*}$ algorithm is optimal when,It always finds the solution with the lowest total cost if the heuristic ' $h$ ' is admissible.Always finds the solution with...

If a hash table is implemented as a search tree, the expected time required to enter $\text{n}$ names and make $\text{m}$ searches is proportional to :$\text{(n+m)} \log_...

Finding the location of the element with a given value is :TraversalSearchSortNone of the options

Let $A$ be an array of $31$ numbers consisting of a sequence of $0$’s followed by a sequence of $1$’s. The problem is to find the smallest index $i$ such that $A[i]$ is $...

Observe that the while loop of the INSERTION-SORT procedure uses a linear search to scan (backward) through the sorted subarray $A[i\dots j-1]$ Can we use a binary search...

Consider the linear search again (see Exercise 2.1-3). How many elements of the input sequence need to be checked on the average, assuming that the element being searched...

.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i.Ans should be O(log n) right by doin...

In a sorted file structure, let the cost of reading a page be $D=10$ milliseconds, the number of data pages be $B=1024$. Let the average time to process a record is $C=5$...

Match List I with List II and choose the correct answer from the code given below.List IList II(a)Greedy Best-First Search(i)Selects a node for expansion if optimal path ...

Consider the following algorithm for searching for a given number $x$ in an unsorted array $A[1 \ldots n]$ having $n$ values :1. Sequentially choose $i$ from 1 to $n$2. i...

Suppose A is a sorted array and some of the elements are duplicates. What is the best upper bound to find out the number of elements that are equal to a given key 'k'a)...