Why can a failure in a database environment be more serious than one in a non-database environment?
Database failures for Production envionments could be downtime for the database (data cannot be retrieved or uploaded) or a data loss in which a recovery needs to be performed, which also equates to downtime until the data is recovered. Businesses equate downtime to $$$ loss. It is a database administrator's job to ensure the database is designed for minimal downtime--the recovery is measured in "MTR" (meantime to recovery). What's the fastest way the data can be restored? A full recovery? A point in time? (roll the data up right before the data loss occurred). This must be done carefully through communcation with the individuals where the data loss occurred. If the DBA is given the wrong time and the data is rolled forward beyond the corruption point, then the recovery must be started again. There is much more to this subject.......based on each company's database, design, data, etc.
What is dynamic programming language?
Dynamic programming languages are often refered to as 'weakly typed' which means that variables are not bound to a particular type until runtime. For example, C++ is a 'strongly typed language, while Perl is a 'weakly typed' or 'dynamic' language.
A strongly typed language requires that you specify a type:
int i = 0;
In that C++ snippet, an integer names i is created and assigned the value of 0. The following would not compile in C++:
int i = 0;
i = "Hello world";
This would fail because i has been declared to be an integer and can not be assigned a string value. The following code would succeed in a dynamic language like Perl:
i = 0;
i = "Hello world";
The type is not declared here at all, because it is not bound to a type until runtime. In the first statement, i is bound to an integer type but in the second statement it is bound to a string type.
While dynamic language are easier to program in, they are much slower than strongly typed languages and are generally regarded as less safe since checking is not done until run time.
Write an iterative function to search an element in a binary search tree?
_node* search (_node* head, _key key) {
_node* node;
for (node=head; node != NULL;;) {
if (key == node->key) return node;
else if (key < node.>key) node = node->left;
else node = node->right;
}
return node;
}
"If y tends to increase as x increases, then the data have a positive correlation. If y tends to decrease as x increases, then the data have a negative correlation. If the points show no correlation, then the data have approximately no correlation."
Tapioca database operates in which name?
i am surprised that you dont have this answer. i love using this website but if they dont have what i need i won't be using it!
i will give u the answer after 4 O'clock
A database contains forms and reports stored in tables
It's the process of stepping through each node of a binary tree so that you reach each one at least once.
Binary tree traversal is special in that the output of the tree is sorted.
If you're looking for how it is done, I would highly recommend reading up on binary trees. It is easy to describe in pictures or code. I recommend against trying to get a description in text, it would only be confusing.
The increase in the use of computers by managers stemmed from the availability of personal computers and the introduction of easy‑to‑use software.
What is the definition and field for a database f?
Collection of inter related data is called table.Collection of tables is called database.Field of database is its attribute.
I am confused with your question, so I will do both interpretations. The query wizards may help you but you didn't say which Access you are using so we will do it in the query builder instead.
.................
You have a table with 25 keys and a table with 10 foreign keys for this example. This could be a one-to-one relationship or a one-to-many in which the 'many' table just has records that match some of the keys in the 'one' table.
You want to see all the 25-key table and anything in the 10-key table that matches. So 15 of the keys from 25-key will not match the 10-key table but you want to see them anyway.
In the query builder, link the key fields going from the 25 table to the 10 table. Then right-click on the link and select the 2nd option "show all from 25-table and the matching records in the 10-table".
Run the query. You will see everything from the 25-table. In the fields from the 10-table there will be blanks where nothing matches.
..................
My second guess is you want to see the ones that don't have a matching key. If it matches you don't care about it, like when you are trying to find keys to fix so you can have integrity between the tables.
You have a table with 10 keys and a table with 25 foreign keys and you need to find those extra 15 foreign keys so you can fix the data integrity. (Notice that this is the opposite of the 2 tables in example 1 - the extras are in the foreign key table. You will most often have this problem when you import data, not when you are doing data entry.)
In the query builder link the tables, 25-table to 10-table. Again do the right-click on the link and select the 2nd option.
Show only the fields of the 25-table down in the bottom part. Now drag the key field from the 10-table down to the grid. Un-check the box under the field name and table name. In the criteria row type "Is Null".
Run the query. You will see the records from the 25-foriegn key table that need to have keys set up in the 10-key table.
..................
In both cases, if you want to filter the records do it in queries and then link the filter queries instead of the tables.
This is an over-simplification and I am assuming you have actual key fields set up, like an autonumber field on the 'one' side. If you have something like "blue", "red", "green" as your key field you have some real work to do.
What are the arguments for and against representing Boolean values as single bits in memory?
for: faster, better readability against: memory isn't used optimally
when people is working on different computer applications while reading, coping, or rekeying information from one application to another, for example from excel to word to power point, etc.
The jump between applications is called "application hopping".
Limitations of queue in data structure?
A queue is a particular kind of collection in which the entities in the collection are kept in order and the principal operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed.
Some Applications:
1) Serving requests of a single shared resource (printer, disk, CPU), transferring data asynchronously (data not necessarily received at same rate as sent) between two processes (IO buffers), e.g., pipes, file IO, sockets.
2) Call center phone systems will use a queue to hold people in line until a service representative is free.
3) Buffers on MP3 players and portable CD players, iPod playlist. Playlist for jukebox - add songs to the end, play from the front of the list.
4) When programming a real-time system that can be interrupted (e.g., by a mouse click or wireless connection), it is necessary to attend to the interrupts immediately, before proceeding with the current activity. If the interrupts should be handles in the same order they arrive, then a FIFO queue is the appropriate data structure.
Real time data processing and online data processing?
Real time data processing allows an organization the ability to involve instant action for those times when acting within seconds or minutes is significant.
Online data processing is the procedure of gathering up information in order to analyze and convert it into other operational information.
Click on the far left of that row to highlight it. Click on "Insert" in your upper tool bar, click on row. There it is.
Is there any other software available to create a database than Microsoft Excel?
While you can create them with it, Microsoft Excel's main use is not for creating databases, but for creating spreadsheets. Microsoft Access is the main Microsoft product for creating databases. There are also many other applications that you can create databases with too, like Oracle, Open Office, or MySQL
None
Why are flowcharts usually used to describe algorithms instead of written descriptions?
Flowcharts are sometimes the preferred tool to describe an algorithm because a flowchart can visualize a simple algorithm effectively, or can outline the major steps in a more complex algorithm. In comparison with natural language prose, flowcharts tend to be less ambiguous.
It must be noted, however, that flowcharts are not suitable to visualize many types of algorithms. While natural language prose is not always a good alternative due to the inherent ambiguity (and the requirement that all readers need to understand the specific language), other languages, such as the language of mathematical notation, are often used to describe more complex algorithms.
The claim embedded in this question that flowcharts are usually used to describe algorithms is an incorrect claim.
Is built-in data-type are abstract data-types in java?
All built-in data types are not abstract data types.
Why is a Key important in a database?
a key is important in a database because using of that key only we can identify a unique attribute.
dBm means "decibels relative to 1 mW". B is the symbol for the unit bel, and decibel is 1/10th of a bel. Bels are used to measure ratios between two measurements, not an absolute measurement by themselves. In this case you're measuring relative to 1 mW.
So, for instance, if a device is producing 100 mW, this will be 100 times your reference of 1 mW. "100 times" the power is equal to 20 decibels, so this would be 20 dBm.