Create custom menus and shortcut menus by using macros
you can use Access macros to create custom shortcut menus that appear when you right-click forms, reports, or individual controls. You can also create custom menus that appear on the Ribbon for specific forms or reports.
To create a menu by using macros, you perform three main steps:
1. Create a macro group that defines the menu commands.
2. Create another macro that creates the menu itself.
3. Attach the menu to a control, a form, a report, or to the database as a whole.
The following sections walk you through these steps in detail.
Step 1: Create a macro group that contains the menu commands
In this step, you create a macro group, each macro of which will be a separate command on your shortcut menu.
ShowWhat is a macro group?
A macro group is a single macro object that contain two or more independent macros. The individual macros are identified by typing a name for each macro in the Macro Names column. In the following illustration, Macro3 is a macro group. NotFoundMsg and FoundMsg are individual macros within the group, each macro consisting of two macro actions.
Macro group example
Note The Macro Name column is hidden by default. To display the Macro Name column, on the Design tab, in the Show/Hide group, click Macro Names.
1. On the Create tab, in the Other group, click Macro. If this command is unavailable, click the arrow beneath either the Module or the Class Module button, and then click Macro.
2. On the Design tab, in the Show/Hide group, click Macro Names to display the Macro Name column.
3. For each command that you want on your custom Shortcut Menu:
* In the Macro Name column, enter the text that you want to display on the shortcut menu (for example, "Print report" or "Save").
Note To create an access key so that you can use the keyboard to choose the command, type an ampersand (&) before the letter that you want to be the access key in the command name (for example, "&Save"). This letter will be underlined on the menu.
* In the Action column, select the first action you would like to take place when you click the command on the shortcut menu.
* If there are more actions that you want to take place when you select this command, add them on the subsequent lines. For each subsequent action, leave the Macro Name cell blank.
Note To create a line between two menu commands, type a hyphen (-) in the Macro Name column between the appropriate menu commands.
4. Save and name the macro, for example, mcrShortcutMenuCommands.
The following illustration shows an example macro group for a custom menu or shortcut menu.
A menu macro group in Design view
Step 2: Create a macro that creates the menu
This step might seem redundant, but to create the shortcut menu from the macro group that you created in Step 1, you must create a second macro that contains the AddMenu macro action. This macro is sometimes called the "menu macro".
1. On the Create tab, in the Other group, click Macro. If this command is unavailable, click the arrow beneath either the Module or the Class Module button, and then click Macro.
2. On the first line of the macro, select AddMenu in the Action list.
3. Under Action Arguments, in the Menu Name box, type the name of the menu (for example, "Report Commands"). This argument is not required, but is recommended if, in Step 3, you plan to add the menu to a Ribbon tab (such as the Add-Ins tab of a form or report). If the menu is added as a shortcut menu in Step 3, the Menu Name argument is ignored.
4. In the Menu Macro Name box, enter the name of the macro that you created in Step 1.
5. Save and name the macro, for example, mcrAddShortcutMenu.
The following illustration shows an example menu macro that creates the menu we designed in Step 1.
A menu macro in Design view
Step 3: Attach the menu to a control, form, report, or database
Depending on where you want the menu to appear, use one or more of the following procedures.
*
Add the menu to the Add-Ins tab of a form or report
Use this procedure if you want the menu to appear on the Add-Ins tab for a specific form or report, as shown in the following illustration:
Add-Ins tab containing a custom menu
1. In the Navigation Pane, right-click the form or report where you want the menu to appear, and then click Design View.
2. On the Design tab, in the Show/Hide group, click Property Sheet.
3. Select the entire object by selecting Form or Report from the list at the top of the Property Sheet task pane.
4. On the Other tab on the Property Sheet, in the Shortcut Menu property box, type the name of the macro that you created in Step 2 (in this example, “mcrAddShortcutMenu”).
The next time you open the form or report, the Add-Ins tab appears in the Ribbon. Click the tab to see the menu.
For more information about Ribbon customization techniques, such as adding custom tabs or hiding the default tabs, see the article Customize the Ribbon.
The Ribbon is a component of the Microsoft Office Fluent user interface.
*
Add the menu as a shortcut menu for a form, report, or control
Use this procedure if you want the menu to appear when you right-click a specific form, report, or control, as shown in the following illustration:
A simple shortcut menu
1. In the Navigation Pane, right-click the form or report where you want the shortcut menu to appear, and then click Design View.
2. On the Design tab, in the Show/Hide group, click Property Sheet.
3. Select the control or object to which you want to attach the shortcut menu.
Note To select the entire object, select Form or Report from the list at the top of the Property Sheet task pane.
4. On the Other tab on the Property Sheet, in the Shortcut Menu Bar property box, type the name of the macro that you created in Step 2 (in this example, “mcrAddShortcutMenu”).
*
Add the menu as a global shortcut menu
This procedure replaces all of the default shortcut menus in the current database. Custom shortcut menus that you have attached to specific forms, reports, or controls are not affected.
1. Click the Microsoft Office Button Button image and then click Access Options.
2. In the Access Options dialog box, click Current Database.
3. Under Ribbon and Toolbar Options, in the Shortcut Menu Bar box, type the name of the macro that you created in Step 2 (in this example, “mcrAddShortcutMenu”).
Notes
* Custom shortcut menus replace the default shortcut menus for the objects they are attached to. If you want to retain certain Access commands to use on these menus, use the RunCommand action to put the commands into the macro groups for the menus you want them in.
* A custom shortcut menu that is attached to a control supersedes any other custom shortcut menus that are defined in the database. A custom shortcut menu that is attached to a form or report supersedes a custom global shortcut menu.
* When you specify a menu macro for a form or report or for the database, Access runs this menu macro whenever the form, report, or database is opened. If you make changes to the menu macro or the macro group that defines its commands while the form, report, or database is open, you must close the form, report, or database and reopen it to see the changes.
* To create a submenu (submenu: A menu that appears when a user points to a command on a higher-level menu.), follow Step 1 to create a separate macro group that contains only the submenu commands. Then, follow Step 1 again to define the commands for the higher-level menu. Add the submenu as an item in the higher-level macro group by using the AddMenu macro action. The following illustration shows the macro group for a menu that contains a submenu, and then shows the resulting shortcut menu. The third line in the macro group creates the Export To... submenu (mcrSubMenu).
A shortcut menu that contains a submenu
You can create multiple levels of submenus by using AddMenu actions in the macro groups for each level of menu. Make sure to supply a value for the Menu Name argument for each AddMenu action, otherwise the submenu will appear as a blank line in the higher-level menu.
* Macro conditions are supported in the top-level menu macro only. In other words, you can use a condition in a menu macro to determine if a particular menu or shortcut menu will be displayed, but only for the menus on the top level. You can't use conditions to display or hide commands or submenus on the menus. You can also use a condition to hide or show a custom shortcut menu or global shortcut menu.
* Optionally, the menu macro that you create in Step 2 can be part of a macro group. For example, if you have several shortcut menus for different objects or controls, you can create a single macro object that contains all of the necessary menu macros. Make sure to display the Macro Name column and type a unique name for each macro. In Step 3, use the following notation to refer to the macro: macrogroupname.macroname. For example, mcrAddShortcutMenus.AddMenu2.
Tuesday, January 26, 2010
Thursday, December 10, 2009
assign 02. current trends
ARTICLES RE DATABASES
Depending on your job specs, you may work solely with SQL Server, or you may use SQL along with various front-end applications, written in .NET, Java, or Delphi. In such languages, you are accustomed to the concept of reusability. However, SQL developers rarely (if ever) think of re-using databases.
Consider this: You write the same thing over and over—from customers to sales orders to purchase orders and so on. That's the atomic level, but you can abstract this redundancy to even higher levels, such as the modules you typically write for an accounting system: Accounts Receivable, Accounts Payable, Inventory Management, etc. Each module requires a group of tables that don't vary much from customer to customer, or database to database. So why not design them as separate databases?
In part, the answer is deadline pressure. Developers seldom have time to abstract the common objects in our databases. This is where we could learn something from our object-oriented colleagues; they have persuaded management that reusability is both architecturally valid and economically sound. And yet, most of us in the database development and management trenches have not done the same.
It's time we begin thinking about database development in these terms. On a basic level, customers, vendors, and employees have a lot in common. One level up, the way you model addresses (cities, regions, countries) remains pretty much the same despite the particular database. One more level up, sales-order-entry is essentially the same regardless of what you sell.
We can rise above the specifics of a database design in the same way that our object-oriented colleagues have risen above the specifics of a user application. The biggest step in this process is simply deciding that we can do it. Once I realized that the same principles applied to database design and object-oriented design, it only took me about two weeks to load my existing projects into a data-modeling tool and abstract the useful portions. Using the same tool, I can now quickly import simple (i.e., customer table) and complex (i.e., Accounts Receivable) objects into any new database that I create. The gains in development time are amazing.
Two ways to go about re-using databases
There are two ways that you can approach this transition. I'll present with you the pros and cons of each method, but I'll leave it up to you to decide which approach will work best for your situation.
The first approach is to connect to numerous databases, each containing the tables of interest to the particular "object" of interest (such as Accounts Receivable). This means that your production database contains views, stored procedures, and UDFs that address the other databases so the client programs see just one database. The advantage to this approach is that, if you change an object within the Accounts Receivable "object", the virtual database will “inherit” the change. The downside to this approach is that foreign keys don't work across database boundaries; therefore, you must use triggers, which are slower.
The second approach is to import the “object” databases into your current project. The upside is that you can use foreign keys rather than triggers. The downside is that if you change one of the objects, such as the Accounts Receivable model, then you will have to propagate that change manually.
I'll reiterate that you can gain a lot by thinking about your databases as objects. You don't need an object-oriented database to make this transition—you just need a change of perspective.
Depending on your job specs, you may work solely with SQL Server, or you may use SQL along with various front-end applications, written in .NET, Java, or Delphi. In such languages, you are accustomed to the concept of reusability. However, SQL developers rarely (if ever) think of re-using databases.
Consider this: You write the same thing over and over—from customers to sales orders to purchase orders and so on. That's the atomic level, but you can abstract this redundancy to even higher levels, such as the modules you typically write for an accounting system: Accounts Receivable, Accounts Payable, Inventory Management, etc. Each module requires a group of tables that don't vary much from customer to customer, or database to database. So why not design them as separate databases?
In part, the answer is deadline pressure. Developers seldom have time to abstract the common objects in our databases. This is where we could learn something from our object-oriented colleagues; they have persuaded management that reusability is both architecturally valid and economically sound. And yet, most of us in the database development and management trenches have not done the same.
It's time we begin thinking about database development in these terms. On a basic level, customers, vendors, and employees have a lot in common. One level up, the way you model addresses (cities, regions, countries) remains pretty much the same despite the particular database. One more level up, sales-order-entry is essentially the same regardless of what you sell.
We can rise above the specifics of a database design in the same way that our object-oriented colleagues have risen above the specifics of a user application. The biggest step in this process is simply deciding that we can do it. Once I realized that the same principles applied to database design and object-oriented design, it only took me about two weeks to load my existing projects into a data-modeling tool and abstract the useful portions. Using the same tool, I can now quickly import simple (i.e., customer table) and complex (i.e., Accounts Receivable) objects into any new database that I create. The gains in development time are amazing.
Two ways to go about re-using databases
There are two ways that you can approach this transition. I'll present with you the pros and cons of each method, but I'll leave it up to you to decide which approach will work best for your situation.
The first approach is to connect to numerous databases, each containing the tables of interest to the particular "object" of interest (such as Accounts Receivable). This means that your production database contains views, stored procedures, and UDFs that address the other databases so the client programs see just one database. The advantage to this approach is that, if you change an object within the Accounts Receivable "object", the virtual database will “inherit” the change. The downside to this approach is that foreign keys don't work across database boundaries; therefore, you must use triggers, which are slower.
The second approach is to import the “object” databases into your current project. The upside is that you can use foreign keys rather than triggers. The downside is that if you change one of the objects, such as the Accounts Receivable model, then you will have to propagate that change manually.
I'll reiterate that you can gain a lot by thinking about your databases as objects. You don't need an object-oriented database to make this transition—you just need a change of perspective.
Wednesday, November 18, 2009
ASSIGN 01
hieritical vs. relation database
Hieratic is a cursive writing system used in pharaonic Egypt that developed alongside the hieroglyphic system,[1] to which it is intimately related. It was primarily written in ink with a reed brush on papyrus, allowing scribes to write quickly without resorting to the time consuming hieroglyphs. The word hieratic derives from the Greek phrase γράμματα ἱερατικά (grammata hieratika; literally "priestly writing"), which was first used by Saint Clement of Alexandria in the second century AD,[2] as at that time hieratic was used only for religious texts, as had been the case for the previous thousand years.
Relational database
A relational database matches data by using common characteristics found within the data set. The resulting groups of data are organized and are much easier for people to understand.
For example, a data set containing all the real-estate transactions in a town can be grouped by the year the transaction occurred; or it can be grouped by the sale price of the transaction; or it can be grouped by the buyer's last name; and so on.
Such a grouping uses the relational model (a technical term for this is schema). Hence, such a database is called a "relational database."
The software used to do this grouping is called a relational database management system. The term "relational database" often refers to this type of software.
Relational databases are currently the predominant choice in storing financial records, manufacturing and logistical information, personnel data and much more.
Hieratic is a cursive writing system used in pharaonic Egypt that developed alongside the hieroglyphic system,[1] to which it is intimately related. It was primarily written in ink with a reed brush on papyrus, allowing scribes to write quickly without resorting to the time consuming hieroglyphs. The word hieratic derives from the Greek phrase γράμματα ἱερατικά (grammata hieratika; literally "priestly writing"), which was first used by Saint Clement of Alexandria in the second century AD,[2] as at that time hieratic was used only for religious texts, as had been the case for the previous thousand years.
Relational database
A relational database matches data by using common characteristics found within the data set. The resulting groups of data are organized and are much easier for people to understand.
For example, a data set containing all the real-estate transactions in a town can be grouped by the year the transaction occurred; or it can be grouped by the sale price of the transaction; or it can be grouped by the buyer's last name; and so on.
Such a grouping uses the relational model (a technical term for this is schema). Hence, such a database is called a "relational database."
The software used to do this grouping is called a relational database management system. The term "relational database" often refers to this type of software.
Relational databases are currently the predominant choice in storing financial records, manufacturing and logistical information, personnel data and much more.
Thursday, November 5, 2009
Data structure
Data structure
A data structure in computer science is a way of storing data in a computer so that it can be used efficiently. It is an organization of mathematical and logical concepts of data. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented by a programming language as data types and the references and operations they provide.
List of data structures
Trees-a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes. It is an acyclic connected graph where each node has a set of zero or more children nodes, and at most one parent node.
A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent.
stacks-a stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO). Stacks are used extensively at every level of a modern computer system.
linked list- a linked list is one of the fundamental data structures, and can be used to implement other data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing to the next and/or previous nodes.
queue-is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position.
arrays-is a data structure consisting of a group of elements that are accessed by indexing. In most programming languages each element has the same data type and the array occupies a contiguous area of storage.
A data structure in computer science is a way of storing data in a computer so that it can be used efficiently. It is an organization of mathematical and logical concepts of data. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented by a programming language as data types and the references and operations they provide.
List of data structures
Trees-a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes. It is an acyclic connected graph where each node has a set of zero or more children nodes, and at most one parent node.
A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent.
stacks-a stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO). Stacks are used extensively at every level of a modern computer system.
linked list- a linked list is one of the fundamental data structures, and can be used to implement other data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing to the next and/or previous nodes.
queue-is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position.
arrays-is a data structure consisting of a group of elements that are accessed by indexing. In most programming languages each element has the same data type and the array occupies a contiguous area of storage.
SORTS
SORTS
I."Meaning of Data structures" PERSONAL
1.Data structure is a way of storing data in the computer.In using data stucture,the users could easily stores data in the computer.They can also retrieve i easily when they need i.It is a collector of the rraw data.Data stuctue is important so tha we can learn and understand and elaborate the suctue of its algorithm.It is an acual implemantaion of a particular abstract data type.
2.Data structure in computer science is a way of storing data in a computer so that it can be used efficiently. It is an organization of mathematical and logical concepts of data. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented by a programming language as data types and the references and operations they provide.
3.Data structure an organization of information, usually in memory, for better algorithm efficiency, such as queue, stack, linked list, heap, dictionary, and tree, or conceptual unity, such as the name and address of a person. It may include redundant information, such as length of the list or number of nodes in a subtree.
4.DAta structure is a collection of data components that are constructed in a regular and characteristic way.
5.Data structure means of storing a collection of data. Computer science is in part the study of methods for effectively using a computer to solve problems, or in other words, determining exactly the problem to be solved. This process entails (1) gaining an understanding of the problem; (2) translating vague descriptions, goals, and contradictory requests, and often unstated desires, into a precisely formulated conceptual solution; and (3) implementing the solution with a computer program. This solution typically consists of two parts: algorithms and data structures.
6.Data structure is a group of data elements grouped together under one name. These data elements, known as members, can have different types and different lengths. Data structures are declared in C++ using the following syntax:
7.Data structures are a feature that can be used to represent databases, especially if we consider the possibility of building arrays of them:
8.Data structures play a central role in modern computer science.Interact with data structures much more often than with algorithms. In addition, data structures are essential building blocks in obtaining efficient algorithms.
9.Data structures optimized for external memory, and cache-oblivious data structures. Any problem (e.g., sorting, priority queues) is different when you're dealing with disk instead of main memory, or you care about cache performance. Memory hierarchies have become important in practice because of the recent escalation in data size.
10.Data structure used ot maintain the sequence of characters is an important part of a text editor.
I."Meaning of Data structures" PERSONAL
1.Data structure is a way of storing data in the computer.In using data stucture,the users could easily stores data in the computer.They can also retrieve i easily when they need i.It is a collector of the rraw data.Data stuctue is important so tha we can learn and understand and elaborate the suctue of its algorithm.It is an acual implemantaion of a particular abstract data type.
2.Data structure in computer science is a way of storing data in a computer so that it can be used efficiently. It is an organization of mathematical and logical concepts of data. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented by a programming language as data types and the references and operations they provide.
3.Data structure an organization of information, usually in memory, for better algorithm efficiency, such as queue, stack, linked list, heap, dictionary, and tree, or conceptual unity, such as the name and address of a person. It may include redundant information, such as length of the list or number of nodes in a subtree.
4.DAta structure is a collection of data components that are constructed in a regular and characteristic way.
5.Data structure means of storing a collection of data. Computer science is in part the study of methods for effectively using a computer to solve problems, or in other words, determining exactly the problem to be solved. This process entails (1) gaining an understanding of the problem; (2) translating vague descriptions, goals, and contradictory requests, and often unstated desires, into a precisely formulated conceptual solution; and (3) implementing the solution with a computer program. This solution typically consists of two parts: algorithms and data structures.
6.Data structure is a group of data elements grouped together under one name. These data elements, known as members, can have different types and different lengths. Data structures are declared in C++ using the following syntax:
7.Data structures are a feature that can be used to represent databases, especially if we consider the possibility of building arrays of them:
8.Data structures play a central role in modern computer science.Interact with data structures much more often than with algorithms. In addition, data structures are essential building blocks in obtaining efficient algorithms.
9.Data structures optimized for external memory, and cache-oblivious data structures. Any problem (e.g., sorting, priority queues) is different when you're dealing with disk instead of main memory, or you care about cache performance. Memory hierarchies have become important in practice because of the recent escalation in data size.
10.Data structure used ot maintain the sequence of characters is an important part of a text editor.
II."Three more other Data stucture"
II."Three more other Data stucture"
1.
A.Deque in computer science theory, a deque (short for double-ended queue—usually pronounced deck) is an abstract list type data structure, also called a head-tail linked list, for which elements can only be added to or removed from the front (head) or back (tail).
B.Data buffer in computing, a buffer is a region of memory used to temporarily hold data while it is being moved from one place to another. Typically, the data is stored in a buffer as it is retrieved from an input device (such as a keyboard) or just before it is sent to an output device (such as a printer). However, a buffer may be used when moving data between processes within a computer. This is comparable to buffers in telecommunication. Buffers can be implemented in either hardware or software, but the vast majority of buffers are implemented in software. Buffers are typically used when there is a difference between the rate at which data is received and the rate at which it can be processed, or in the case that these rates are variable, for example in a printer spooler.
C.Cache in computer science, a cache (pronounced /kæʃ/) is a collection of data duplicating original values stored elsewhere or computed earlier, where the original data is expensive to fetch (owing to longer access time) or to compute, compared to the cost of reading the cache. In other words, a cache is a temporary storage area where frequently accessed data can be stored for rapid access. Once the data is stored in the cache, future use can be made by accessing the cached copy rather than re-fetching or recomputing the original data, so that the average access time is shorter.
2.Basic description of DAta structure.
Data structure in computer science is a way of storing data in a computer so that it can be used efficiently. It is an organization of mathematical and logical concepts of data. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented by a programming language as data types and the references and operations they provide.
3.Data accomditation in data entry
Computer data processing is any computering process that converts datas into information or knowledge.[1] The processing is usually assumed to be automated and running on a computer. Because datas are most useful when well-presented and actually informative, data-processing systems are often referred to as information systems to emphasize their practicality. Nevertheless, the terms are roughly synonymous, performing similar conversions; data-processing systems typically manipulate raw data into information, and likewise information systems typically take raw data as input to produce information as output
4.Data retrieval is possible only from the HTML-format output document. Spectra may be retrieved individually or in groups, and multiple retrieval of concatenated, high resolution spectra can be restricted to a specific wavelength interval. Spectra are delivered as FITS files, and are easily imported into standard image processing packages such as IDL, IRAF (via the external TABLES package) or MIDAS.
1.
A.Deque in computer science theory, a deque (short for double-ended queue—usually pronounced deck) is an abstract list type data structure, also called a head-tail linked list, for which elements can only be added to or removed from the front (head) or back (tail).
B.Data buffer in computing, a buffer is a region of memory used to temporarily hold data while it is being moved from one place to another. Typically, the data is stored in a buffer as it is retrieved from an input device (such as a keyboard) or just before it is sent to an output device (such as a printer). However, a buffer may be used when moving data between processes within a computer. This is comparable to buffers in telecommunication. Buffers can be implemented in either hardware or software, but the vast majority of buffers are implemented in software. Buffers are typically used when there is a difference between the rate at which data is received and the rate at which it can be processed, or in the case that these rates are variable, for example in a printer spooler.
C.Cache in computer science, a cache (pronounced /kæʃ/) is a collection of data duplicating original values stored elsewhere or computed earlier, where the original data is expensive to fetch (owing to longer access time) or to compute, compared to the cost of reading the cache. In other words, a cache is a temporary storage area where frequently accessed data can be stored for rapid access. Once the data is stored in the cache, future use can be made by accessing the cached copy rather than re-fetching or recomputing the original data, so that the average access time is shorter.
2.Basic description of DAta structure.
Data structure in computer science is a way of storing data in a computer so that it can be used efficiently. It is an organization of mathematical and logical concepts of data. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented by a programming language as data types and the references and operations they provide.
3.Data accomditation in data entry
Computer data processing is any computering process that converts datas into information or knowledge.[1] The processing is usually assumed to be automated and running on a computer. Because datas are most useful when well-presented and actually informative, data-processing systems are often referred to as information systems to emphasize their practicality. Nevertheless, the terms are roughly synonymous, performing similar conversions; data-processing systems typically manipulate raw data into information, and likewise information systems typically take raw data as input to produce information as output
4.Data retrieval is possible only from the HTML-format output document. Spectra may be retrieved individually or in groups, and multiple retrieval of concatenated, high resolution spectra can be restricted to a specific wavelength interval. Spectra are delivered as FITS files, and are easily imported into standard image processing packages such as IDL, IRAF (via the external TABLES package) or MIDAS.
MyContrast
MyContrast
1.operating system-(commonly abbreviated to either os or o/s) is an interface between hardware and user;it is responsible for the management and coordination of activities and the sharing of the resources of the computer.The operating system acts as a hosts for computing applications that are run on machine.
2.Computer system-a complete,working computer.The computer system includes not only the computer,but also any software and peripheral devices that are necessary to make the computer function.Every computer system,for example requires an operating system.
3.Data are pieces of information that represent the qualitative or quantitative attributes of a variable or set of variables. Data (plural of "datum") are typically the results of measurements and can be the basis of graphs, images, or observations of a set of variables. Data are often viewed as the lowest level of abstraction from which information and knowledge are derived.
4.Information as a concept has a diversity of meanings, from everyday usage to technical settings. Generally speaking, the concept of information is closely related to notions of constraint, communication, control, data, form, instruction, knowledge, meaning, mental stimulus, pattern, perception, and representation.
5.Computer data storage, often called storage or memory, refers to computer components, devices, and recording media that retain digital data used for computing for some interval of time. Computer data storage provides one of the core functions of the modern computer, that of information retention.
6.A data storage device is a device for recording (storing) information (data). Recording can be done using virtually any form of energy, spanning from manual muscle power in handwriting, to acoustic vibrations in phonographic recording, to electromagnetic energy modulating magnetic tape and optical discs.
1.operating system-(commonly abbreviated to either os or o/s) is an interface between hardware and user;it is responsible for the management and coordination of activities and the sharing of the resources of the computer.The operating system acts as a hosts for computing applications that are run on machine.
2.Computer system-a complete,working computer.The computer system includes not only the computer,but also any software and peripheral devices that are necessary to make the computer function.Every computer system,for example requires an operating system.
3.Data are pieces of information that represent the qualitative or quantitative attributes of a variable or set of variables. Data (plural of "datum") are typically the results of measurements and can be the basis of graphs, images, or observations of a set of variables. Data are often viewed as the lowest level of abstraction from which information and knowledge are derived.
4.Information as a concept has a diversity of meanings, from everyday usage to technical settings. Generally speaking, the concept of information is closely related to notions of constraint, communication, control, data, form, instruction, knowledge, meaning, mental stimulus, pattern, perception, and representation.
5.Computer data storage, often called storage or memory, refers to computer components, devices, and recording media that retain digital data used for computing for some interval of time. Computer data storage provides one of the core functions of the modern computer, that of information retention.
6.A data storage device is a device for recording (storing) information (data). Recording can be done using virtually any form of energy, spanning from manual muscle power in handwriting, to acoustic vibrations in phonographic recording, to electromagnetic energy modulating magnetic tape and optical discs.
Subscribe to:
Posts (Atom)
