Answer:
if speed < 0:
reverseDrivers +=1
elif speed < 1:
parkedDrivers +=1
elif speed < 40:
slowDrivers +=1
elif speed<=65:
safeDrivers +=1
else:
speeder +=1
Explanation:
The statements are written in python programming language
See a complete code screenshot attached, where all the variables are defined
Answer:
C, Both of these.
Explanation:
You can take notes either way. It's just your preference. Hope this helps :)
Answer:
def sum_1k(M):
s = 0
for k in range(1, M+1):
s = s + 1.0/k
return s
def test_sum_1k():
expected_value = 1.0+1.0/2+1.0/3
computed_value = sum_1k(3)
if expected_value == computed_value:
print("Test is successful")
else:
print("Test is NOT successful")
test_sum_1k()
Explanation:
It seems the hidden part is a summation (sigma) notation that goes from 1 to M with 1/k.
- Inside the <em>sum_1k(M)</em>, iterate from 1 to M and calculate-return the sum of the expression.
- Inside the <em>test_sum_1k(),</em> calculate the <em>expected_value,</em> refers to the value that is calculated by hand and <em>computed_value,</em> refers to the value that is the result of the <em>sum_1k(3). </em>Then, compare the values and print the appropriate message
- Call the <em>test_sum_1k()</em> to see the result
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";
}
