Answer:
if ur lonely i suggest an app/website called mylol
Explanation:
fdsjafklsuhfkjfudhjkfewuhfdjk fdjs afujijf kldsaflkdjslajrfewiofjdjsahfruifhgijdsk fdsj fds
Answer:
d
Explanation:
an integrated development environment like PyCharm has all the things like debugers and editors. It makes things easy for coding
Answer:
The best structures to create the following items are
- ARRAY
- HASHMAPS
- QUEUE
- SORTED LINK LISTS
Explanation:
The best structures to create the following items are:
- Array : for the storage of cards in a card game the best data structure to be used should be the Array data structure. this is because the size of the data ( 52 cards ) is known and using Array will help with the storing of the cards values in the Game.
- Hashmaps : Hashmap data structure should be implemented in online shopping cart this IS BECAUSE items can be easily added or removed from the cart therefore there is a need to map the Items ID or name to its actual database
- online waiting list are usually organised/arranged in a first-in-first-out order and this organization is best created using the queue data structure
- Sorted link lists is the best data structure used to create, store and manage online tickets. the sorted link data structure helps to manage insertions and deletions of tickets in large numbers and it also reduces the stress involved in searching through a large number of tickets by keeping the tickets in sorted lists
You can friend me mine is- 3024-6635-0458
Answer:
I. Algorithms can be written using pseudocode.
II. Algorithms can be visualized using flowcharts.
Explanation:
An algorithm can be defined as a standard formula or procedures which comprises of set of finite steps or instructions for solving a problem on a computer. The time complexity is a measure of the amount of time required by an algorithm to run till its completion of the task with respect to the length of the input.
The two statements which are true about algorithms are;
I. Algorithms can be written using pseudocode. A pseudocode refers to the description of the steps contained in an algorithm using a plain or natural language.
II. Algorithms can be visualized using flowcharts. A flowchart can be defined as a graphical representation of an algorithm for a process or workflow.
Basically, a flowchart make use of standard symbols such as arrows, rectangle, diamond and an oval to graphically represent the steps associated with a system, process or workflow sequentially i.e from the beginning (start) to the end (finish).
