Answer:
Customer Relationship Management (CRM).
Explanation:
CRM is an acronym for customer relationship management and it typically involves the process of combining strategies, techniques, practices and technology so as to effectively and efficiently manage their customer data in order to improve and enhance customer satisfaction.
This ultimately implies that, these employees are saddled with the responsibility of ensuring the customer are satisfied and happy with their service at all times.
Marketing can be defined as the process of developing promotional techniques and sales strategies by a firm, so as to enhance the availability of goods and services to meet the needs of the end users or consumers through advertising and market research. It comprises of all the activities such as, identifying, anticipating set of medium and processes for creating, promoting, delivering, and exchanging goods and services that has value for customers.
Basically, CRM involves understanding customer needs, building and maintaining healthy long-term relationships with them, in order to add value or scale up your business.
Hence, customer relationship management (CRM) is one of the popular marketing strategy that is mainly based on the acquisition, enhancement, and retention of long-term relationships that add value for the organization and the customer.
Answer:
Network security
Explanation:
Network security is a category of cybersecurity that is related to the protection of the infrastructure of the computer network from unauthorized access and intrusion that may be from intended attack or from an expedient program which may result in the modification, malfunctioning, misuse or unacceptable disclosure of the network and the contents of the network
The category of cybersecurity that 'prevents intruders from accessing, misusing, destroying, adapting, or improperly disclosing networks, network infrastructure, or the information contained within networks' is network security.
The programs you need for you are not even done yet
Program testing is an evaluative process which is also called Unit Testing by the programmers.
Explanation:
Software testing is an important step in the software development process. The procedure analyzes the functionality of it and if it meets the specified requirements or not. This is a four-stage procedure that involves analysis, planning, development, setting the test environment, and finally the execution of the test.
The main stages of testing that will result in an error-free and quality product are-
- Unit testing
- Integration testing
- System testing
- Acceptance testing
Answer:
See explaination
Explanation:
The reasons why indexed sequential search structure is better are:
1. In index sequential search any field of the records can be used as the key. This key field can be numerical or alphanumerical.
2. Since each record has its data block address, searching for a record in larger database is easy and quick. There is no extra effort to search records. But proper primary key has to be selected to make efficient.
3. This method gives flexibility of using any column as key field and index will be generated based on that. In addition to the primary key and its index, we can have index generated for other fields too. Hence searching becomes more efficient, if there is search based on columns other than primary key.
The reasons why 5 B-tree is better:
1.The B-tree Provides support for range of queries in an efficient manner and You can iterate over an ordered list of elements.
2. B-Tree algorithms are good for accessing pages (or blocks) of stored information which are then copied into main memory for processing. In the worst case, they are designed to do dynamic set operations in O(lg n) time because of their high "branching factor" (think hundreds or thousands of keys off of any node). It is this branching factor that makes B-Trees so efficient for block storage/retrieval, since a large branching factor greatly reduces the height of the tree and thus the number of disk accesses needed to find any key.
3. It is a generalization of a BST in that a node can have more than two children. These are self-balancing and hence the average and worst complexities is logarithmic. We opt for these when the data is too huge to fit in main memory. These structures are used in database indexing and help in faster operations on disk
the additional informations is we should first decide to choose which structure is suiatable for which algoritm in terms of space and time and then use the appropriate search algorithm.
