Answer:
Let the function be Node* ins(Node *root,int k)
if root node is NULL then return new node with data equal to k.
If the k <root->data
root->left=ins(root->left,k);
else if k >root->data
root->right =ins(root->right,k);
At last return root.
Explanation:
Node is always inserted at the at the leaf node.We will search k in the tree if we hit a the leaf node the new node is inserted as the child of the leaf node.
Answer: True
Explanation:
Virtual memory is the secondary storage memory and this type of memory are addressed as main part of the memory.
When the virtual memory copying in the physical memory then, at that time the operating system divide the memory into the file page with the address and definite size number. Then, the each page are store in a disk.
When this page are required then, the operating system copy from disk to main memory and then, the virtual address are converted into the real address.
1) Bricklayer 2) Roofer 3) Architectural drafter 4) landscape architect
Answer:
1) Yes, Publisher relation should have a publisherID primary key.
2) NOT NULL and UNIQUE for the BookID, BranchID, CardNumber and name of the borrower in the Book, Book_Copies, Library_branch, and Borrower relations respectively. The DueDate field of the book_loan relation must be a time constraint. The BookID of the Book relation must be serial number for automatic addition and update of bookid across the database.
Explanation:
The Publisher relation should have primary key publisherID which should replace the publisherName in the Book relation to easily make a join query and attain a third-level database model.
