All categories

3 years ago

Nina aspires to be a digital media specialist. What should Nana be familiar with in order to pursue this career?

Computers and Technology

2 answers:

liberstina [14]3 years ago

8 0

Answer:

A Digital media specialist is responsible for taking care of a company's entire presence within these new communication spaces, such as social networks and out-of-home digital media. Companies of all sizes can impact thousands of people, attracting even more consumers to know and buy their products. This function is on the rise as these communication channels become more present in people's daily lives.

New technologies are emerging, and for all of them people will find ways to adapt. Not everyone can keep up with this speed. A digital media specialist is always attuned to what is new. A great example is the new ad platforms. It is now possible to create a strategy for advertising on digital screens around the world (out-of-home digital media), with the help of fully online platforms. A big evolution that goes beyond social networks!

Conscious of what the customer wants and where he is, this professional is best able to design an accurate sales strategy report through a virtual environment, defining which products will be most accepted and influencing, in order to create ways to receive a novelty without strangeness. With all these factors, counting on a digital media professional is a huge step towards a modern future that no longer recedes.

brilliants [131]3 years ago

4 0

computer science? maybe im not sure?

You might be interested in

When entering numbers that start with a zero, apply the _____ number format.

yuradex [85]

Answer:

The Answer is gonna be D. Zero decimal

3 0

3 years ago

19) If you want to find your lowest paid, full time employee (with "FT" in column B and each employee's salary found in column C

Vadim26 [7]

Answer:

MAXIF

Explanation:

The MAXIF function is a function used in Ms Excel.

This function indicates the maximum value located on an array .

Option B

7 0

2 years ago

Read 2 more answers

To annotate a document with a remark for another reviewer to address, select the _____ feature. comments track changes annotatio

kupik [55]

Select the comments feature.

We use comments in our documents to track issues for follow up or make suggestions to other people. A comment is inserted inside a balloon or a box that appears in the document's margins. Whatever the situation you may be in, you can easily add comments in a word document.

6 0

3 years ago

Read 2 more answers

You want to create a watermark image. Which tab on the Format Picture box would you use?

Marianna [84]

You should use Picture tab

8 0

3 years ago

Let's implement a classic algorithm: binary search on an array. Implement a class named BinarySearcher that provides one static

yKpoI14uk [10]

Answer:

Hope this helped you, and if it did , do consider giving brainliest.

Explanation:

import java.util.ArrayList;

import java.util.List;

//classs named BinarySearcher

public class BinarySearcher {

// main method

public static void main(String[] args) {

// create a list of Comparable type

List<Comparable> list = new ArrayList<>();

// add elements

list.add(1);

list.add(2);

list.add(3);

list.add(4);

list.add(5);

list.add(6);

list.add(7);

// print list

System.out.println("\nList : "+list);

// test search method

Comparable a = 7;

System.out.println("\nSearch for 7 : "+search(list,a));

Comparable b = 3;

System.out.println("\nSearch for 3 : "+search(list,b));

Comparable c = 9;

System.out.println("\nSearch for 9 : "+search(list,c));

Comparable d = 1;

System.out.println("\nSearch for 1 : "+search(list,d));

Comparable e = 12;

System.out.println("\nSearch for 12 : "+search(list,e));

Comparable f = 0;

System.out.println("\nSearch for 0 : "+search(list,f));

}

// static method named search takes arguments Comparable list and Comparable parameter

public static boolean search(List<Comparable> list, Comparable par) {

// if list is empty or parameter is null the throw IllegalArgumentException

if(list.isEmpty() || par == null ) {

throw new IllegalArgumentException();

}

// binary search

// declare variables

int start=0;

int end =list.size()-1;

// using while loop

while(start<=end) {

// mid element

int mid =(start+end)/2;

// if par equal to mid element then return

if(list.get(mid).equals(par) )

{

return true ;

}

// if mid is less than parameter

else if (list.get(mid).compareTo(par) < 0 ) {

start=mid+1;

}

// if mid is greater than parameter

else {

end=mid-1;

}

// if not found then retuen false

return false;

}

}import java.util.ArrayList;

import java.util.List;

//classs named BinarySearcher

public class BinarySearcher {

// main method

public static void main(String[] args) {

// create a list of Comparable type

List<Comparable> list = new ArrayList<>();

// add elements

list.add(1);

list.add(2);

list.add(3);

list.add(4);

list.add(5);

list.add(6);

list.add(7);

// print list

System.out.println("\nList : "+list);

// test search method

Comparable a = 7;

System.out.println("\nSearch for 7 : "+search(list,a));

Comparable b = 3;

System.out.println("\nSearch for 3 : "+search(list,b));

Comparable c = 9;

System.out.println("\nSearch for 9 : "+search(list,c));

Comparable d = 1;

System.out.println("\nSearch for 1 : "+search(list,d));

Comparable e = 12;

System.out.println("\nSearch for 12 : "+search(list,e));

Comparable f = 0;

System.out.println("\nSearch for 0 : "+search(list,f));

}

// static method named search takes arguments Comparable list and Comparable parameter

public static boolean search(List<Comparable> list, Comparable par) {

// if list is empty or parameter is null the throw IllegalArgumentException

if(list.isEmpty() || par == null ) {

throw new IllegalArgumentException();

}

// binary search

// declare variables

int start=0;

int end =list.size()-1;

// using while loop

while(start<=end) {

// mid element

int mid =(start+end)/2;

// if par equal to mid element then return

if(list.get(mid).equals(par) )

{

return true ;

}

// if mid is less than parameter

else if (list.get(mid).compareTo(par) < 0 ) {

start=mid+1;

}

// if mid is greater than parameter

else {

end=mid-1;

}

// if not found then retuen false

return false;

}

7 0

3 years ago