 |
| Tables |
1. What is a table?
A table is a collection of homogenous data type (Numeric, Alphabetic, records) and size (length). Table holds information and the results of processing.
2. Define Function and Argument table.
Argument Table: A table that is searched.
Function table: A table that contains values that are to be retrieved for use in processing.
3. Write the drawbacks of sequence checking.
In sequence checking, the search argument is first compared with the last table argument to identify erroneous search arguments. Otherwise it would cause the search argument to extend beyond that last valid entry.
4. Express sequential and binary search.
Sequential search: Sequential Search is a method for searching an argument table that examines the entries in the order in which they appear in the table, starting with the first entry.
More Information:
The sequential search is the most commonly used algorithm for searching an argument table.
It start with the first table argument and takes each succeeding argument in turn until a match is found.
The search argument is first compared with the last table argument to identify erroneous search arguments.
If table argument <search argument, we must check the next table argument.
If table argument >=search argument, the search is over.
If table argument = search argument, the match is found.
Binary search: A technique for searching an ordered argument table that is efficient for large tables.
More Information:
The binary search is more efficient searching technique for large tables.
The argument table must be in either ascending or descending order.
Binary searches are used mostly with discrete tables.
5. How many ways are there to get table data into memory?
We can get data into memory in two ways:
i. Referencing table entries
ii. Getting the tables into memory
6. What type of tables are mostly used in business application?
Segmented table are mostly used in business application. Because segmented table are consisted of a series of ranges for each of which there is a corresponding function value.
7. How many types of search can be applied in a discrete table?
Two types of search can be applied in a discrete table:
i. Sequential search
ii. Binary search
8. What is the most efficient technique of searching a large table?
Binary search is the most efficient technique of searching a large table.
9. Write the formula to access into Two Dimensional tables in one Dimension.
j = n(i-1)+K
Where, j= Index of elements in one dimensional table
n = Number of elements in each module.
I = Index of desired subtable
K = Index of desired element in subtable.
10. What is the difference between one-dimensional and two dimensional table?
A one-dimensional table is a table that can be visualized as containing more than a single column but a two-dimensional table contains rows and columns.
11. Define the following Keywords:
• Argument table: A table that is searched.
• Array: The tables are known as an array in some language. See Table
• Binary search: A technique for searching an ordered argument table that is efficient for large tables.
• Direct table addressing: A technique for accessing a function table (without searching an argument table) by deriving the position in the function table directly from the search argument.
• Discrete table: An argument table in which each entry represents a particular value that will be compared with a search argument in an attempt to find an exact match.
• Function table: A table that contains values that are to be retrieved for use in processing.
• Index (Subscript): Used in conjunction with a table name to specify a particular element of a table; a part of an indexed file.
• Multidimensional table: A table that can be visualized as containing more than a single column. A two-dimensional table contains rows and columns. A three-dimensional table is a stack of two-dimensional table.
• One dimensional table: A table that can be visualized as containing a single column of values.
• Paired Table: When Argument and Function table are used together, they are called Paired table. When the proper entry in the argument table is found, the corresponding element of the function table is retrieved.
• Search argument: Search argument is the value that is compared with argument table entries.
• Segment table: Segment table is an Argument table in which the argument entry is the upper (for an ascending table) or lower (for a descending table) limit of a range of values.
• Sequential search: Sequential Search is a method for searching an argument table that examines the entries in the order in which they appear in the table, starting with the first entry.
• Single table: Single table is an argument table with no corresponding function table (used in editing data) or a function table with no corresponding argument table (used in discrete table addressing).
• Subscript: See Index
• Table file: A file in which the data that makes up a table is stored.
• Table lookup: Searching a table is referred to as doing a table look up.
• Table search: The examination of an argument table to find any entry that is equal to the search argument (in the case of discrete table), greater than or equal to the search argument (in the case of a segmented table in ascending order), or less than or equal to the search argument (in the case of a segmented table in descending order).
• Table: A table is a collection of homogenous data type (Numeric, Alphabetic, Records) and size (length). Table holds information and the results of processing.
12. Draw the flowchart of search a discrete.
0 Comments