Answer:
def remove_duplicates(lst):
no_duplicate = []
dup = []
for x in lst:
if x not in no_duplicate:
no_duplicate.append(x)
else:
dup.append(x)
for y in dup:
if y in no_duplicate:
no_duplicate.remove(y)
return no_duplicate
Explanation:
Create a function called remove_duplicates that takes one parameter, lst
Create two lists one for no duplicate elements and one for duplicate elements
Create for loop that iterates through the lst. If an element is reached for first time, put it to the no_duplicate. If it is reached more than once, put it to the dup.
When the first loop is done, create another for loop that iterates through the dup. If one element in no_duplicate is in the dup, that means it is a duplicate, remove that element from the no_duplicate.
When the second loop is done, return the no_duplicate
The correct option is B.
Movable type is a system and technology of printing which uses movable components to reproduce the elements of a document on a paper. Metal movable type printing press was created by Guternberg in Europe in 1450. He was the first one to create this and he used the alloy of lead, tin and antimony in his production.
Answer: Data model
Explanation: Data model is the arrangement of the information in the form of table structure to maintain it in the form of database.They help in the keeping the entities in the sequence and can be tracked when required.Example- vendors records,customer record etc.
Other options are incorrect because the data retrieval is the regaining of the data from database, record instance is the parts of the database records and meta data give knowledge about other data.
Answer:
See explaination
Explanation:
java code:
class DONALD
{
static class Node
{
int data;
Node next;
}
static Node head=null;
static int largestElement(Node head)
{
Int max=Integer.MIN_VALUE;
while(head!=null)
{
if(max<head.data)
max=head.data;
head=head.next;
}
return max;
}
static int smallestElement(Node head)
{
int min=Integer.MAX_VALUE;
while(head!=null)
{
if(min>head.data)
min=head.data;
head=head.next;
}
return min;
}
static void push(int data)
{
Node newNode=new Node();
newNode.data= data;
newNode.next=(head);
(head)=newNode;
}
static void printList(Node head)
{
while(head!=null)
{
System.out.println(head.data + " -> ");
head=head.next;
}
System.out.println("NULL");
}
public static void main(String[] args)
push(15);
push(14);
push(13);
push(22);
push(17);
System.out.println("Linked list is : ");
printList(head);
System.out.println("Maximum element in linked list: ");
System.out.println(largestelement(head));
System.out.print("Maximum element in Linked List: " );
System.out.print(smallestElement(head));
}
}
