Answer:
processing
Explanation:
The flow chart is a diagram that shows the activity of the program, peoples or things.
Flowchart symbol and meaning in the options:
1. Processing: it is a rectangular shape block which is used for variable declaration or assignment.
2. I/0: it is a parallelogram in shape which is used for input or output.
3. Parallelogram: it is used for input or output.
4. diamond: it is used for decisions or conditions.
Therefore, the correct option is a. Processing is the one that is used for the assignment statement.
Morning and afternoon commute times are obvious blocks of time that you can assume are used for listening to podcasts, but the answer will obviously vary widely based on individual habits and schedules.
Hope this helps
Explanation:
I thinkcreating and edditing Images matchs to adobePhotoshop
Microsoft word is for adding and Creating text document
Creating andeditingpage layout -Adobe In Design
Desktop Publication-QuarkQuark Xpress
I hope thishelp and If wrong Inform me
Good luck
Answer:
- country_pop = {
- 'China': 1365830000,
- 'India': 1247220000,
- 'United States': 318463000,
- 'Indonesia': 252164800
- }
- for key in country_pop:
- print(key + " has " + str(country_pop[key]) + " people")
Explanation:
The solution code is written in Python 3.
Given a dictionary, country_pop with data that includes four country along with their respective population (Line 1-6). We can use for in loop structure to traverse through each of the key (country) in the dictionary and print their respective population value (Line 7-8). The general loop structure through is as follow:
for key in dict:
do something
One key will be addressed for each round of loop and we can use that key to extract the corresponding value of the key (e.g. country_pop[key]) and print it out.
Answer:
Some differences between Heap and Binary search trees are as following:-
A heap is a complete binary tree.While a Binary Search Tree may be a complete,prefect binary tree.
A minheap the root should be minimum than it's children So it efficient for finding minimum and maximum.While Binary search trees have different properties the root node should be greater than the left child and should be less than the right child.
