Answer:
Option E Components that interact to produce information
Explanation:
Information system is a system to collect, analyze and disseminate information. An information system consists of five components that work with each other to produce information:
- Computer hardware - physical machine that works with information
- Computer software - a set of computer instructions that tell computer hardware how to perform a task
- Telecommunications - components that connect a group of hardware as to establish a network. This usually includes WiFI technology.
- Databases and data warehouses - the place where the digital data are kept and retrieved.
- Human resources and procedures - human expertise that run the system by following some standard procedures.
The process that determines how bits are represented on the medium is called encoding. It is the process of converting a certain data into a particular format that is required for a certain processing need like program execution, data transmission or file conversion.
Answer:
JTextField
Explanation:
JTextField is a Swing control which can be used for user input or display of output. It corresponds to a textfield and can be included with other controls such as JLabel, JButton,JList etc. on a comprehensive user interface which is application dependent. JTextField supports a read-write mode where the user can enter a value and it also supports a read-only mode which can be used to display non-editable output to the user.
Answer:
1 no. ans
none of above
this ans is not 100% correct but also it help may help you
In conclusion there are many different data structures. Each data structure has strengths and weaknesses which affect performance depending on the task. Today, we explored two data structures: arrays and linked lists. Arrays allow random access and require less memory per element (do not need space for pointers) while lacking efficiency for insertion/deletion operations and memory allocation. On the contrary, linked lists are dynamic and have faster insertion/deletion time complexities. However, linked list have a slower search time and pointers require additional memory per element in the list. Figure 10 below summarizes the strength and weakness of arrays and linked lists.
