The complexity of Binary search algorithm is

We create a binary search tree B1 by inserting the numbers 1, 2, 3, 4, 5 into an empty binary search tree. We create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?

A

1

B

3

C

4

D

2

Match List I with List II List I List II (A) Greedy Best-First Search (I) Space complexity is O(d) where d = depth of the deepest optimal solution (B) A* (II) Incomplete even if the search space is finite. (C) Recursive Best-First Search (III) Optimal if optimal solution is reachable: otherwise, returns the best reachable optimal solution. (D) SMA* (IV) Computation and space complexity is too high. Choose the correct answer from the options given below:

A

A - II, B - IV, C - I, D - III

B

A - II, B - III, C - I, D - IV

C

A - III, B - II, C - IV, D - I

D

A - III, B - IV, C - II, D - I

Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n-1 nodes

A

Only A

B

Only B

C

A and B

D

A, B and C

Can linear search recursive algorithm and binary search recursive algorithm be performed on an unordered list?

A

Binary search can’t be used

B

Linear search can’t be used

C

Both cannot be used

D

Both can be used

The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?

A

O(nlogn)

B

O(n2)

C

O(n)

D

O(logn)

The Fourth Amendment to the Constitution protects citizens against unreasonable searches and seizures. No search of a person's home or personal effects may be conducted without a written search warrant issued on probable cause. This means that a neutral judge must approve the factual basis justifying a search before it can be conducted.
This paragraph best supports the statement that the police cannot search a person's home or private papers unless they have

A

legal authorization.

B

direct evidence of a crime.

C

read the person his or her constitutional rights.

D

a reasonable belief that a crime has occurred.

E

requested that a judge be present.

Under Section 95 of the Code of Criminal Procedure, 1973, certain publications can be forfeited and search warrant can be issued for the same. In this context, which of the following is/are the correct legal proposition?
1. A news paper cannot be forfeited and search warrant cannot be issued for the same as it would be violative of the fundamental right of speech and expression
2. A book can be forfeited and search warrant can be issued for the same
3. A document can be forfeited and search warrant can be issued for the same
Select the correct answer:

A

1 only

B

2 only

C

2 and 3 only

D

1, 2 and 3

Under section 95 of Criminal Procedure Code certain publications can be forfeited and search warrant can be issued for the same. In this context, the propositions are
1. A newspaper cannot be forfeited and search warrant cannot be issued for the same as it would be violative of the fundamental right of speech and expression and involves the fourth estate.
2. A book can be forfeited and search warrant can be issued for the same.
3. A document can be forfeited and search warrant can be issued for the same.
Which of the following is correct

A

1 and 2 are correct

B

1 and 3 are correct

C

2 and 3 are correct

D

1, 2 and 3 all are correct

The complexity of Binary search algorithm is ---

A

O(n)

B

O(log n)

C

On(n2)

D

O(n log n)

The complexity of Binary search algorithm is ___

A

O (n)

B

O (log n)

C

O (n2)

D

O ( n log n )

The complexity of Binary search algorithm is

Related Questions