You may do all of the given options.
Thank You!
4 Types Of Dimmers :
1. Incandescent/Halogen
2. Magnetic Low Voltage (MLV)
3. Fluorescent
4. Light Emitting Diode (LED)
These are the different types of switches :
1. A single-pole switch controls lights from a single location. ...
2. A 3-way switch provides two separate control locations and is best used with recessed lights. ...
3. A 4-way switch provides for three or more dimming locations.
4. Switches are wired to the "hot" conductor in a wall box.
<em>I hope that my answer helps!</em>
Right click the cell, click add cells & it should say the options (new row above etc.)
Answer:
Shows the programming checking if num1 is greater than num2
Explanation:
So num1 and num2 are inputs
for you to code this you would need to put
num1=int(input("What is your first number? ))
and the same for num2 except change num1 for num 2 and first for second
When the input is completed, the computer will check if num 1 is greater than num2
it will do this by using a code something like:
if num1>num2:
Print("Your first input was greater than your second")
But in this example if it greater it just ends
But if it was less than you would put
if num1>num2:
Print("Your first input was greater than your second")
elif num1<num2:
Print("Your first input is less than your second")
So basically this code shows the computer checking if one number is greater than the other or not
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";
}
