0
Database Programming
Databases are collections of tables that maintain and display information, often collaboratively; this information can be used for interaction with an application or gaining general knowledge. Questions about database engines and modifying or using them belong in this category.
8,803 Questions
IP address
Explain non-recursive and recursive algorithm for postorder traversal on binary tree?
Step 1:- select first root node (t), start travelsing left contin
For what reasons may the results of scientific polls not be acurate?
The results of scientific polls might not be accurate if the people being polled are aware of the agenda of the poll. A poll also might not be accurate if a large enough group of diverse people are not included in the poll.
What transformation do data undergo during processing?
When data are processed, they are transformed from raw facts into meaningful information.
Difference between binary search tree and heap tree?
A binary search tree uses the definition: that for every node,the node to the left of it has a less value(key) and the node to the right of it has a greater value(key).
Where as the heap,being an implementation of a binary tree uses the following definition:
If A and B are nodes, where B is the child node of A,then the value(key) of A must be larger than or equal to the value(key) of B.That is,
key(A) ≥ key(B).
In computer science, an object file is an organized collection of separate, named sequences of machine code.
Verify command in VSAM cannot be used for what?
The VERIFY command cannot be used for an empty VSAM file where the high used RBA (Relative Byte Address) in its catalog record is 0 (zero).
How is authorization possible in electronic data processing?
Authorization is possible in EDP or computer environments via access controls. So the same concept of segregation of duties is maintained, the difference is this is achieved via assigning responsibilities attached to your userID and password. This is even more effective if the system is modular and allows for this segregation at set up.
What is the minimum number of nodes in a binary tree of depth k?
if u assign a 0th level to root of binary tree then,the minimum no. of nodes for depth K is k+1.
What is the difference between examples of information systems and types of information systems?
Types of IS include Transaction Processing Systems (TPS), Management Information Systems (MIS), Decision Support Systems (DSS), Enterprise Resource Planning (ERP) and Customer Relationship Management Systems (CRM). Examples of IS would be Air Miles making use of CRM to track customer's purchasing history and preferences. As well as a company using the Internet to keep track of transactions coming in over the years.
bscs is a great study about computer and math. this course is equal to M.A education and apply all the job related M.A posts.
An applicate is an applied material, or a line at right angles to the axis of a conic section which extends from the axis to the curve.
It can also be used as an alternative name for the Z-axis.
The student registration system with a suitable information processing methods?
student registration system and its information processing unit
What volume of data is processed by minicomputers?
Minicomputers are able to process large amounts of data.
What is difference between scalar and super scalar processor?
Differences between scalar and superscalar processors generally boil down to quantity and speed. A scalar processor, considered to be the simplest of all processors, works on one or two computer data items at a given time. The superscalar processor works on multiple instructions and several groups of multiple data items at a time. Scalar and superscalar processors both function the same way in terms of how they manipulate data, but their difference lies in how many manipulations and data items they can work on in a given time. Superscalar processors can handle multiple instructions and data items, while the scalarprocessor simply cannot, therefore making the former a more powerful processor than the latter.
Scalar and superscalar processors both have some similarities with vector processors. Like ascalar processor, a vector processor also executes a single instruction at a time, but instead of just manipulating one data item, its single instruction can access multiple data items. Similar with the superscalar processor, a vector processor has several redundant functional units that let it manipulate multiple data items, but it can only work on a single instruction at a time. In essence, a superscalar processor is a combination of a scalar processor and a vector processor.
What is shipping documentation?
shipping documentation are the documents which are prepared to export all shipment.
What are current trends in soccer?
England - long, powerful passes Spain - speed Italy - short, accurate passes
Definition of open-source content management system?
Basically a CMS (Content Management System) is a system that allows a large group of people to input, keep track, and update data for work and job goals in a collaborative environment. Depending on the language, CMS's operate using different platforms. MS SharePoint, based on ASP.NET platform, however it's a commercial product.
I'm not familiar with it, but I've heard dotnetnuke is a very decent open source CMS. I think that operates on ASP.NET platform as well.
What is the length of a sports field?
Its variable for diffrent fields like it varies 80-120m in football and different in other sports
How many bytes does long and short data type reserve?
sizeof (long) and sizeof (short)
often 4 or 8 for long, and 2 for short
Is that BS degree is equal to BE?
They are both equivalent in terms of the educational level of attainment.
What are the main differences between relational algebra and relational calculus?
language
Relational algebra, an offshoot of first-order
logic (and of algebra of sets), deals with a set of finitary
relations (see also relation (database)) which is closed under certain operators. These operators operate on one or more relations to yield a relation. Relational algebra is a part of computer science.
Relational calculus consists of two calculi, the tuple
relational calculus and the domain relational calculus, that are part of the relational model for databases and provide a declarative way to specify database queries. This in contrast to the relational algebra which is also part of the relational model but provides a more procedural way for specifying queries.
The relational algebra might suggest these steps to retrieve the phone numbers and names of book stores that supply Some Sample Book:
1. Join books and titles over the BookstoreID.
2. Restrict the result of that join to tuples
for the book Some Sample Book.
3. Project the result of that restriction over StoreName
and StorePhone.
The relational calculus would formulate a descriptive, declarative way:
Get StoreName
and StorePhone
for supplies such that there exists a title BK with the same BookstoreID
value and with a BookTitle
value of Some Sample Book.
The relational algebra and the relational calculus are essentially logically equivalent: for any algebraic expression, there is an equivalent expression in the calculus, and vice versa.
This result is known as Codd's
theorem
What is Data Consolidation and What are the different ways of consolidating data?
You can refer this paper on Data Consolidation www.carlsonwagonlit.com/.../sites/cwt/en/global/ our_insight/white_papers/white_papers/data_consolidation.pdf
What components of computer based information system do we have?
Hardware Software Data Procedures People
