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 weak and strong entity type ?
Weak and Strong entity type: An entity set which does not have a primary key is referred to as a weak entity set. The existence of a weak entity set depends on the existence of a strong entity set; it must associate to the strong set via a on-to-many relationship set. A discriminator of a weak entity set is the set of attributes that distinguishes between all the entities of a weak entity set. The primary key of a weak entity set is formed by the primary key of the strong entity set on that the weak entity set is existence depends, plus the weak entity set's discriminator.
Structure Of Distributed Database: A distributed database system haves of a collection of sites, each of which keeps a local databases system. Every site is able to process local
How external/conceptual mapping and conceptual /internal mapping is performed
explain ANSI SPARC architecture
Process of Adjustment of inheritance During object design, inheritance is readjusted by rearranging classes and operations, and abstracting common behaviour.
Explain pipelining. Ans: In order to describe pipelining in simple terms, think of it as breaking down processor functions into smaller and smaller parts. For instance,
construct a b-tree for the following set of key values 2,3,5,7,11,17,19,23,29,31.assume that the tree is initial empty and the values are added in ascending order
Consider the relations given below Borrower (id_no, name) Book (accno., title, author, borrower_idno) (a) Define the above relations as tables in SQL forming real world assumptio
Consider the subsequent relations RENTER(rno, fname, lname, address, tel_no, pref_type, max_rent) VIEWING(rno, pno, date, comment) PROPERTY_FOR_RENT( pno, street, area ,city,
Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?
Question 1: (a) Explain the legal meaning of :- (i) Computer Service Person (ii) Data holding (b) Explain how the law ensures Data protection and Security. Qu
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