Search Technique
Searching can be defined as an process to find out a specific information from the large volumes of data. The information in any organization is arranged in the form of record (table or a file) containing a KEY. For an array a key can be the index of the elements, while for the file it can be the serial number of file. Depending upon the type of memory used during searching, searching techniques can be internal or external.
Summary
Searching can be defined as an process to find out a specific information from the large volumes of data. The information in any organization is arranged in the form of record (table or a file) containing a KEY. For an array a key can be the index of the elements, while for the file it can be the serial number of file. Depending upon the type of memory used during searching, searching techniques can be internal or external.
Things to Remember
- Searching can be defined as an process to find out a specific information from the large volumes of data.
- The information in any organization is arranged in the form of record (table or a file) containing a KEY.
- For an array a key can be the index of the elements, while for the file it can be the serial number of file.
- Depending upon the type of memory used during searching, searching techniques can be internal or external.
MCQs
No MCQs found.
Subjective Questions
Q1:
Define control model and explain its tyoes.
Type: Long Difficulty: Easy
Q2:
Write short notes on:
- call-return model
- manager model
- broadcast model
- domain specific architecture
Type: Short Difficulty: Easy
Videos
No videos found.
Search Technique
Searching
Searching can be defined as a process to find out a specific information from the large volumes of data.Nowadays,the volume of data for even an specific small organization is large, in that case to find the information manually requires much time which leads to less efficiency. This problem is reduced by searching.
Most search algorithms used in computer science retrieve the data of an entry within a data structure (eg: an array, or a list)by finding the entry (record) associated with a given key (an identification for a record).
Search Techniques
The information in any organization is arranged in the form of record.Records can be anything ,either it can be a table with information filled in it or file containing the information.Every record has an entity called “KEY” attached to it which makes it different from the other records.For an array a key can be the index of the elements, while for the file it can be the serial number of the file.
Searching can generally be classified into two groups:
- Internal Search
- External Search
If the data to be searched are all present in the main memory, the searching becomes internal search. Internal searches are faster than external searches and hence are recommended whenever possible. They are mainly done among the data which occupy less space compared to the space of RAM.
If most of the data to be searched are in the auxiliary memory, then the search becomes an external search. If the data are very large and our main memory is not large enough to hold them all during the process, then the external search is used.
References
1.https://en.wikipedia.org/wiki/Search_algorithm
2. Y. Langsam, M. J. Augenstein and A. M Tenenbaum, “Data Structuresusing C and C++”
3. R. L. Kruse, B. P. Leung, C. L. Tondo, “Data Structure and Program designin C”
Lesson
Searching
Subject
Computer Engineering
Grade
Engineering
Recent Notes
No recent notes.
Related Notes
No related notes.