0
Deletion is nothing but eliminating and insertion is adding.
Wiki User
∙ 11y ago
Wiki User
∙ 10y agoDelete erases something. Insert adds something.
Add your answer:
Earn +20 pts
What do you have to do in a queue?
The queue is a linear data structure where operations od insertion and deletion are performed at separate ends also known as front and rear. Queue is a FIFO structure that is first in first out. Whenever a new item is added to queue, rear pointer is used. and the front pointer is used when an item is deleted from the queue.
What are the difference between ddl and dml commands?
The basic difference between DDL and DML is the commands they provide . The dml (data manipulation language) provides statements to enter, update, delete and perform complex queries on these tables while the ddl(data description language) provides statement for the creation and deletion of tables, indexes, views etc.
Difference between ddl and dml?
DML(data manipulation language) provides statements to enter, update, delete and perform complex queries on these tables. DDL(Data definition language) provides statements for creation and deletion of tables, view, indexes etc.
What does insertion point indicate?
the location of the active cell by its collumn letter and row number.
What are the sql commands with dml and ddl?
The DDL provides statement for the creation and deletion of tables, indexes, views etc. The DML provides statements to enter, update, delete and perform complex queries on these tables.
What is the difference between nucleotide deletion and nucleotide insertion?
Here's a sample nucleotide sequence:AATUGCIf there was a nucleotide deletion (let's say the "G" gets deleted), the sequence would become:AATUCIf there was a nucleotide addition/insertion (let's say a "G" was added between "T' and "U"), the sequence would become:AATGUGCThe difference is that a deletion makes the DNA shorter and an insertion makes it longer.
Which is not a frameshift mutation substitution insertion deletion or point mutation?
frameshift- deletion and insertion point mutation- sustitution
What do you understand by deque?
A double ended queue (or deque ) is a queue where insertion and deletion can be performed at both end that is front pointer can be used for insertion (apart from its usual operation i.e. deletion) and rear pointer can be used for deletion (apart from its usual operation i.e. insertion)
What are 3 types of mutations and what do they do?
The three different types of mutation are substitution, insertion, and deletion. They differ because deletion is missing a base, insertion has a base that was added, and substitution has a base that has been replaced.
What is a double ended queue?
A double ended queue, or deque, is a queue in which you can access or modify both the head and the tail. The front pointer can be used for insertion (apart from its usual operation i.e. deletion) and rear pointer can be used for deletion (apart from its usual operation i.e. insertion)
What is the need of deque?
A double ended queue (or deque ) is a queue where insertion and deletion can be performed at both end that is front pointer can be used for insertion (apart from its usual operation i.e. deletion) and rear pointer can be used for deletion (apart from its usual operation i.e. insertion). So when we need to insert or delete at both end we need deque.
What are 3 types of mutation?
Three types of gene mutations are substitution, insertion, and deletion. Another gene mutation would be frame shift. All these mutations can cause deformities of the gene.
What are the two types of mutations in gamete cells?
Deletion or Insertion
Which types of mutation can add genes to a chromosomes?
insertion and deletion
What would produce a frameshift mutation?
An insertion/deletion event.
Which types of mutation can be add genes to a chromosome?
A deletion mutation can take genes away from a chromosome.
Difference between circular queue and De queue?
The queue is a linear data structure where operations of insertion and deletion are performed at separate ends also known as front and rear. Queue is a FIFO structure that is first in first out. A circular queue is similar to the normal queue with the difference that queue is circular queue ; that is pointer rear can point to beginning of the queue when it reaches at the end of the queue. Advantage of this type of queue is that empty location let due to deletion of elements using front pointer can again be filled using rear pointer. A double ended queue (or deque ) is a queue where insertion and deletion can be performed at both end that is front pointer can be used for insertion (apart from its usual operation i.e. deletion) and rear pointer can be used for deletion (apart from its usual operation i.e. insertion)
