PLSQL_Concepts

Page 1

What is the difference between Linear Search and Binary Search?

Ans:

1.Linear Search: In this Search, sorting is not required. Here, Sequential access to the elements are done. When doing this search, there is equality comparisons are performed. Time Complexity of search is O(log n). It will be implemented on any kind of linear data structures like double / single linked lists, vector, etc. It can be considered as easier or complex option as element of a list while doing this can be arranged in any order. If its used in huge dataset then it considered as high cost option along with slower as other counterpart

2.Binary Search: In this search, Input list is required to be sorted first. Ordering comparisons are performed. While performing searching operation, random elements are accessed. Time Complexity of search is O(n). It will be implemented easily for data structures which have 2 traversals i.e. backward and forward traversal. If its used in huge dataset then it considered as low cost option along with faster as other counterpart.

What is the difference between Simple and Complex Views?

The main differences between the two views are:

Simple View

- Derives data from only one table.

- Contains no functions or group of data.

- Can perform DML operations through the view.

Complex View

- Derives data from many tables. Contain functions or groups of data.

- Derives data from many tables. Contain functions or groups of data.

- Does not always allow DML operations through the view