Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Explain Instance and schemas?
Instances and schemas: Databases changes over time as the information is deleted and inserted. The collection of information stored in database at a particular moment in time is known as Instances and the whole design of database is known as schemas.
1. Item based services will be charged fixed prices, and time-based will be charged variably depending on time. Such as per hour. Item-based: Fixed, pedicure, waxing, threading, fa
Define the basic operations of the relational algebra? Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot
What are the different kinds of database end users? Discuss the major activities of each? End-Users - End-users are the people whose jobs need access to the database for que
For each m:n relationship type R, we make a new table (say S) to represent R. We also contain the primary key attributes of both the participating entity types as a foreign key att
Describe logical data independence ? Logical Data Independence - It is the capacity to modify the conceptual schema without having to change external schemas or application p
What is DDL? Make a list of commands with short description used in DDL Ans: Data Definition Language that is abbreviated as DDL is a computer language for defining data struct
Probelm: (a) A distributed database (DDB) is a collection of multiple, logically interrelated databases which are physically distributed over a computer network" (i) Give a
What are the Objectives of Advance object design After this unit, you shall be able to: combine three OOAD models to obtain operations on the classes; develop algo
Define a relation ? Relation - A relations is a named two-dimensional table of data. Mathematically, a relation can be described as a subset of the cartesian product of a lis
In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→ P2 is equivalent to ¬P1 V P2. (The logical implication expression A B, meaning
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd