Answer:
The answer to this question as follows:
1) False
2) False
3) True
Explanation:
The description of the above option as follows
- In option 1, A single character variable must be contained in one quote mark, but it is based on the alphabet, which is a specific device, and the price of a continued character varies from one device to another, that's why it is false.
- In option 2, This option is wrong because in assembly language the identifier value must not exceed the length than 247 characters.
- In option 3, It is correct because in the variable declaration the first char should be a letter, _, @ or $letter. A total of 1-247 characters. The default case is insensitive.
The central processing unit (CPU<span>) </span>works in conjunction<span> with </span><span>______ to perform processing</span>
That is false. are you doing it on a computer course. <span />
Answer:
Low Vision Aid for Computer Users
Explanation:
Visually impaired people can use the same low vision aids for viewing a computer screen as they do for regular reading activities. These include eyeglass-mounted magnifiers, handheld magnifiers and stand-alone magnifiers. But also, special software has been developed to display content on the screens of computers and other digital devices in large print. Other applications can read text and other visual content aloud with a synthetic voice. These adaptive low vision devices let partially sighted people do the same computer-related tasks as fully sighted people — such as word processing, creating and using spreadsheets and viewing web pages online.
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";
}
