What is binary search, traversal, hashing?
Submitted by: AdministratorBinary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.
Hashing provides a fast way to search a large, unsorted data set at the cost of extra memory. It is described as "directly referencing records in a table by doing arithmetic transformations on keys into table addresses."
Submitted by: Administrator
Hashing provides a fast way to search a large, unsorted data set at the cost of extra memory. It is described as "directly referencing records in a table by doing arithmetic transformations on keys into table addresses."
Submitted by: Administrator
Read Online Hardware and Software Design Job Interview Questions And Answers
Top Hardware and Software Design Questions
☺ | Explain Difference between RISC and CISC? |
☺ | What is a Turing machine? |
☺ | What is binary search, traversal, hashing? |
☺ | Explain Memory taken for char *, int * etc.? |
☺ | How does the browser know to go to a certain IP address when you enter a domain like globalguideline.com? |
Top PC Hardware Categories
☺ | Motherboard Interview Questions. |
☺ | Basic Computer Interview Questions. |
☺ | Embedded Systems Interview Questions. |
☺ | A + (Plus) Hardware Interview Questions. |
☺ | Computer Architecture Interview Questions. |