All categories

1 year ago

How is ict integrated into marketing

1 answer:

5 0

Answer: The utilize of great ICT moreover moves forward client administrations and client request. From database advancement, site plan to showcase investigate, interpretation program, coordinate mail showcasing and preparing, the application of ICT is basic for a financial victory. The web is one of the ways in which media companies / businesses publicize.

Explanation:

You might be interested in

The ____ criteria filter requires the records displayed to start with the specified text string

lys-0071 [83]

The "Begins With" criteria filter is what your looking for

3 0

3 years ago

Asymmetric key encryption combined with the information provided by a. certificate authority allows unique identification of the

Nesterboy [21]

Answer:

c. both the user and the provider of encrypted data.

Explanation:

In assymetric key encryption, you will need the public key of the sender to decode the information along with your private key to decode the encrypted information. if you don't have any of the keys, you won't be able to read the information. You must have both in order to read the information sent.

5 0

2 years ago

given an array of integers a, your task is to count the number of pairs i and j (where 0 ≤ i < j < a.length), such that a[

Nimfa-mama [501]

Using the knowledge of computational language in C++ it is possible to write a code that given an array of integers a, your task is to count the number of pairs i and j.

<h3>Writting the code:</h3>

// C++ program for the above approach

#include <bits/stdc++.h>

using namespace std;

// Function to find the count required pairs

void getPairs(int arr[], int N, int K)

{

// Stores count of pairs

int count = 0;

// Traverse the array

for (int i = 0; i < N; i++) {

for (int j = i + 1; j < N; j++) {

// Check if the condition

// is satisfied or not

if (arr[i] > K * arr[j])

count++;

}

cout << count;

}

// Driver Code

int main()

{

int arr[] = { 5, 6, 2, 5 };

int N = sizeof(arr) / sizeof(arr[0]);

int K = 2;

// Function Call

getPairs(arr, N, K);

return 0;

}

See more about C++ code at brainly.com/question/17544466

#SPJ4

4 0

1 year ago

#Create a class called Name. Name should have two attributes

prisoha [69]

Answer:

//class Name

class Name {

// attributes gave you 3

String first_name;

String last_name;

int length = 0;

//constructor with 2 parameters

Name(String first_name, String last_name){

}

//methods

public String find_printed_name(){

return first_name + " " + last_name;

}

public void find_sortable_name(){

return last_name + ", " first_name.charAt(0);

}

public static void main(String[] args){

// instantiate the class

Name test_name = new Name("David", "Joyner");

System.out.println(test_name.first_name);

System.out.println(test_name.last_name);

System.out.println(test_name.find_printed_name());

System.out.println(test_name.find_sortable_name());

}

Explanation:

You didn't specify a language so I did it in Java.

You should know how to declare methods in Python.

3 0

3 years ago

You are asked to simulate a binary search algorithm on an array of random values.An array is the list of similar type of element

Alex Ar [27]

Answer:

Explanation:

Problem statement:

to simulate a binary search algorithm on an array of random values.

Binary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.

Input/output description

Input:

Size of array: 4

Enter array:10 20 30 40

Enter element to be searched:40

The Output will look like this:

Element is present at index 3

Algorithm and Flowchart:

We basically ignore half of the elements just after one comparison.

Compare x with the middle element.

If x matches with middle element, we return the mid index.

Else If x is greater than the mid element, then x can only lie in right half subarray after the mid element. So we recur for right half.

Else (x is smaller) recur for the left half.

The Flowchart can be seen in the first attached image below:

Program listing:

// C++ program to implement recursive Binary Search

#include <bits/stdc++.h>

using namespace std;

// A recursive binary search function. It returns

// location of x in given array arr[l..r] is present,

// otherwise -1

int binarySearch(int arr[], int l, int r, int x)

{

if (r >= l) {

int mid = l + (r - l) / 2;

// If the element is present at the middle

// itself

if (arr[mid] == x)

return mid;

// If element is smaller than mid, then

// it can only be present in left subarray

if (arr[mid] > x)

return binarySearch(arr, l, mid - 1, x);

// Else the element can only be present

// in right subarray

return binarySearch(arr, mid + 1, r, x);

}

// We reach here when element is not

// present in array

return -1;

}

int main(void)

{ int n,x;

cout<<"Size of array:\n";

cin >> n;

int arr[n];

cout<<"Enter array:\n";

for (int i = 0; i < n; ++i)

{ cin >> arr[i]; }

cout<<"Enter element to be searched:\n";

cin>>x;

int result = binarySearch(arr, 0, n - 1, x);

(result == -1) ? cout << "Element is not present in array"

: cout << "Element is present at index " << result;

return 0;

}

The Sample test run of the program can be seen in the second attached image below.

Time(sec) :

Memory(MB) :

3.3752604177856

The Output:

Size of array:4

Enter array:10 20 30 40

Enter element to be searched:40

Element is present at index 3

Conclusions:

Time Complexity:

The time complexity of Binary Search can be written as

T(n) = T(n/2) + c

The above recurrence can be solved either using Recurrence T ree method or Master method. It falls in case II of Master Method and solution of the recurrence is Theta(Logn).

Auxiliary Space: O(1) in case of iterative implementation. In case of recursive implementation, O(Logn) recursion call stack space.

8 0

2 years ago

How is ict integrated into marketing​

How is ict integrated into marketing