Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Post office protocol (POP) is a message access protocol which is used to extract message for client. In this regard, which of the following are true ? (A) POP has two modes, Delete mode and keep (B) In Delete mode, mail is deleted from mail box after each retrival (C) In Delete mode, mail is deleted from mail box before each retrieval (D) In keep mode, mail is deleted before retrival (E) In keep mode, mail remains in mail box after retrival Choose the correct answer from the options given below:
What is the code required to delete all “weight” tags? ; c) delete pt; d) delete pt..weight;
Study the information carefully and answer the questions given below: If we arrange the alphabets in the word "RATE" in the English alphabetical order, word "AERT" is formed. Then the third alphabet from the left in this word is "R". similarly, from the word "OPEN" we get - "ENOP" and the third alphabet from the left is "O". From the word "CHEF" we get - "CEFH" the third alphabet from the left "F". From the word "TOY" we get - "OTY" and the third alphabet from the left is "Y". From the word "EAT" we get - "AET" and the third alphabet from the left is "T" If we use all these letters, then a meaningful English word "FORTY" can be formed. Now find which of the following word set DOES NOT give a meaningful word in a similar way.
To delete columns or rows we can use the delete option under the ______________ in Microsoft Word.
The antonym of the word 'flexible' is_____
The antonym of the word 'Rectify' is_____
Antonym of DELETE What is antonym of it?
N items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations on the list in this order: Θ(N) delete, O(log N) insert, O(log N) find, and Θ(N) decrease-key. What is the time complexity of all these operations put together?
An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element? 
Let relation R2 has a Foreign Key that refers to Primary Key of relation R1. Which of the following operations may cause violation of referential integrity constraints? I: insert into R1 II: insert into R2 III: delete from R1 IV: delete from R2