Answer:
The first thing should Keisha does is determine the purpose of the presentation.
Explanation:
If we are giving any presentation then firstly we should determine the purpose of our presentation.
There are typical reasons for giving any presentation such as:
- Alerting
- Persuading
- Inspiring
- Enjoyable
By clearly defining the purpose you need to capture the attention of your audience and maintain their interest thoroughly across the oral presentation. Three key elements in any oral presentation process include:
- Planning
- Writing
- Completion
Answer:
Check the explanation
Explanation:
#define _MULTI_THREADED
#include <pthread.h>
#include <stdio.h>
#include <errno.h>
#define THREADS 2
int i=1,j,k,l;
int argcG;
char *argvG[1000];
void *threadfunc(void *parm)
{
int *num;
num=(int*)parm;
while(1)
{
if(i>=argcG)
break;
if(*num ==1)
if(argvG[i][0]=='a' ||argvG[i][0]=='2'||argvG[i][0]=='i' ||argvG[i][0]=='o' ||argvG[i][0]=='u')
{
printf("%s\n",argvG[i]);
i++;
continue;
}
if(*num ==2)
if(!(argvG[i][0]=='a' ||argvG[i][0]=='2'||argvG[i][0]=='i' ||argvG[i][0]=='o' ||argvG[i][0]=='u'))
{
printf("%s\n",argvG[i]);
i++;
continue;
}
sched_yield();
}
return NULL;
}
int main(int argc, char *argv[])
{
pthread_t threadid[THREADS];
int rc=0;
int loop=0;
int arr[2]={1,2};
argcG=argc;
for(rc=0;rc<argc;rc++)
argvG[rc]=argv[rc];
printf("Creating %d threads\n", THREADS);
for (loop=0; loop<THREADS; ++loop) {
rc =pthread_create(&threadid[loop], NULL, threadfunc,&arr[loop]);
}
for (loop=0; loop<THREADS; ++loop) {
rc = pthread_join(threadid[loop], NULL);
}
printf("Main completed\n");
return 0;
}
The below attached image is a sample output
Hi there!
GUI Means Graphical user interface
CUI means Controlled Unclassified Information
Theres the difference they are completely different from each other.
PLEASE MARK BRAINLIEST
-WeasuLL
Answer:
quicksort
Explanation:
There are many types of asymptotically efficient sorting algorithms that can be used but one of the more commonly used for large data lists would be quicksort. This is a sorting algorithm that focuses on choosing a value from the list and working around that value in order to sort the data piece by piece. For larger data sets this method is widely used due to its speed and efficiency which is exactly what Martha needs in this scenario.