An application where you would prefer a parallel circuit over series would be a string of Christmas lights. If the light string is wired in parallel, when one bulb burns out, it would not effect the red of the string.
Answer:
discriminant = b * b - 4 * a * c
discriminant = b ** 2 - 4 * a * c
Explanation:
The operands are correct and in the right order (for python).
** is the operand for squaring something.
* is the operand for multiplying something.
- is the operand for subtracting something.
Answer:
true
Explanation:it is true because like that they could send that letter were it go's so like that they don't have trouble looking for the person's letter
please mark me as brainlist
Answer:
The wireless adapter to use is the Wireless USB 2.0 Extender
Explanation:
The Wireless USB 2.0 Extender is a USB component that enables a computer to connect to and communicate with other computers on a network, or even to connect to the internet.
It uses an IEEE 802.11g radio platform and communicates within a radio frequency range of 2.4GHz.
Therefore, in cases where a notebook computer does not have a built-in wireless LAN card or PC card interface, you can use the Wireless USB 2.0 Extender as the best solution to that problem.
Answer:
see explaination
Explanation:
#include <iostream>
#include <string>
using namespace std;
class LinkedList{
class Node{
public :
int data;
Node* next;
Node(int data){
this->data = data;
next = NULL;
}
};
public :
Node *head;
LinkedList(){
this->head = NULL;
}
void insert(int d){
Node* new_node = new Node(d);
new_node->next = head;
head = new_node;
}
// sort the list with selection sort algorithm.
// Pick the smallest element in the unsorted array and place in the first element in the unsorted.
void sort_list(){
if (head == NULL){
return;
}
Node* current = head;
while (current->next != NULL){
Node* min_node = current;
Node* traverse = current->next;
while(traverse != NULL){
if(traverse->data < min_node->data){
min_node = traverse;
}
traverse = traverse->next;
}
int temp = current->data;
current->data = min_node->data;
min_node->data = temp;
current = current->next;
}
}
void print_list(){
Node* current = head;
while(current !=NULL){
cout<<current->data<<" ";
current = current->next;
}
cout<<"\n";
}
};
int main(){
LinkedList ll;
for(int i=0;i<10;i++){
ll.insert(i);
}
ll.print_list();
cout<<"*******************************************\n";
ll.sort_list();
ll.print_list();
cout<<"*******************************************\n";
}
