Answer:
It can improve the quality of education in many ways. It opens doorways to a wealth of information, knowledge and educational resources, increasing opportunities for learning in and beyond the classroom. Teachers use online materials to prepare lessons, and students to extend their range of learning
Explanation:
Answer:
It uses simple words and symbols to communicate the design of a program
Explanation:
A software can be defined as a set of executable instructions (codes) or collection of data that is used typically to instruct a computer on how to perform a specific task and solve a particular problem.
A software development life cycle (SDLC) can be defined as a strategic process or methodology that defines the key steps or stages for creating and implementing high quality software applications. There are seven (7) main stages in the creation of a software and these are;
1. Planning.
2. Analysis.
3. Design.
4. Development (coding).
5. Testing.
6. Implementation and execution.
7. Maintenance.
A pseudocode refers to the description of the steps contained in an algorithm using a plain or natural language. Also, a pseudocode gives a summary of the steps adopted during a software development process using simple (concise) words and symbols.
This ultimately implies that, a pseudocode uses simple words and symbols to communicate the design of a program.
Answer:
ALTER TABLE orders
MODIFY (amount DEFAULT 250)
Explanation:
- ALTER TABLE statement is used to modify "amount" column in the existing "orders" table
- MODIFY (amount DEFAULT 250) is used to set the default value 250 of the "amount" column.
Therefore if the supervisor wants the amount column to be configured to accept a default value of 250, then "ALTER TABLE orders MODIFY (amount DEFAULT 250) " statement should be issued.
Answer:
b. The names in the list should be in alphabetical order.
Explanation:
A binary search is an algorithm used for searching for an item in a list or array. The algorithm first sorts the data structure into order and then divides it into halves. If the searched item is less than the middle item in the list, then the algorithm searches for the target in the first half, else, in the second half. This reduces the time complexity of the search.