All categories

3 years ago

What does technological convergence mean, with examples?

Computers and Technology

1 answer:

Brrunno [24]3 years ago

7 0

Answer:

Technological convergence is a term describes the layers of abstraction that enable different technologies t inter operate efficiently as a converged system. Convergent services such as VoIP, IPTV, Smart TV and others tend to replace the older technologies.

Explanation:

As a feature of society convergence can spur economic growth and change how people communicate on a global basis. A good way t evaluate the previous generations, items such as CD player, cassette deck, console TV or corded telephone each served only one function, whereas a single modern handheld computing device can meld several of those functions with hardly any user intervention required.

You might be interested in

How can I identify what is and what isn't an IP Address?

adelina 88 [10]

Answer:

you can identify an ip address in the bar where u type links

Explanation:

7 0

3 years ago

20 POINTS!!!!!!!!!! will give brainliest

PilotLPTM [1.2K]

Answer:

Release

Explanation:

Founders Education

4 0

2 years ago

What are two reasons a network administrator would use cdp.

Ulleksa [173]

Answer:

To obtain VLAN information from directly connected switches. To determine the status of network services on a remote device. To determine the status of the routing protocols between directly connected routers .

Explanation:

6 0

2 years ago

maximum cardinality indicates whether or not an instance of one entity class must be related to at least one instance of another

vladimir1956 [14]

This is false.

What is cardinality?

Cardinality refers to the entity instances for which it is eligible to participate in a relationship instance. There are two types of cardinality, maximum and minimum.

What is maximum cardinality?

The maximum cardinality of a relationship is the maximum number of instances of entity B that may be associated with each instance of entity A.
Maximum cardinality: maximum number of entity instances that can participate in a relationship.

One-to-One [1:1]
One-to-Many [1:N]
Many-to-Many [N:M]

To know more about maximum cardinality , refer:

brainly.com/question/18090451

#SPJ4

4 0

1 year ago

Create a program which will input data into a pipe one character at a time. Count the number of characters as they are written i

LenKa [72]

Answer:

#include<stdio.h>

#include<stdlib.h>

#include<fcntl.h>

#include<unistd.h>

#define BUFSIZE 16

int main(){

//pipe descriptors

char msg[BUFSIZE];

char buf[BUFSIZE];

int pipefd[2];

if(pipe(pipefd) == -1){

//pipe creation error

perror("pipe");

exit(EXIT_FAILURE);

}

//pipe creation successfull

//write four messages

sprintf(msg , "apple");

write(pipefd[1], msg, BUFSIZE);

printf("Written %s\n", msg);

sprintf(msg , "boy");

write(pipefd[1], msg, BUFSIZE);

printf("Written %s\n", msg);

sprintf(msg , "cat");

write(pipefd[1], msg, BUFSIZE);

printf("Written %s\n", msg);

sprintf(msg , "dog");

write(pipefd[1], msg, BUFSIZE);

printf("Written %s\n", msg);

//read

read(pipefd[0], buf, BUFSIZE);

printf("Read: %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("Read: %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("Read: %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("Read: %s\n", buf);

close(pipefd[0]);

close(pipefd[1]);

return 0;

}

(b)

#include<stdio.h>

#include<stdlib.h>

#include<fcntl.h>

#include<unistd.h>

#include<wait.h>

#define BUFSIZE 16

int main(){

//pipe descriptors

char msg[BUFSIZE];

char buf[BUFSIZE];

int pipefd[2];

if(pipe(pipefd) == -1){

//pipe creation error

perror("pipe");

exit(EXIT_FAILURE);

}

//pipe creation successfull

//write four messages

if(fork() == 0){

//this is child

//close unused write end

close(pipefd[1]);

read(pipefd[0], buf, BUFSIZE);

printf("This is child process reading first message. Content is %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("This is child process reading second message. Content is %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("This is child process reading third message. Content is %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("This is child process reading fourth message. Content is %s\n", buf);

close(pipefd[0]);

//exit from child

exit(EXIT_SUCCESS);

}

//this is parent process

//close unused read end

close(pipefd[0]);

sprintf(msg , "apple");

printf("This is parent process. Writing first message into pipe\n");

write(pipefd[1], msg, BUFSIZE);

sprintf(msg , "boy");

printf("This is parent process. Writing second message into pipe\n");

write(pipefd[1], msg, BUFSIZE);

sprintf(msg , "cat");

printf("This is parent process. Writing third message into pipe\n");

write(pipefd[1], msg, BUFSIZE);

sprintf(msg , "dog");

printf("This is parent process. Writing fourth message into pipe\n");

write(pipefd[1], msg, BUFSIZE);

close(pipefd[1]);

//wait for child

wait(NULL);

return 0;

}

(c)

#include<stdio.h>

#include<stdlib.h>

#include<fcntl.h>

#include<unistd.h>

#include<sys/wait.h>

#include<sys/types.h>

#include<signal.h>

typedef struct sigaction Sigaction;

unsigned long long size = 0;

void alarmhandler(int sig){

//alarm fired writing blocked

printf("Write blocked after %llu characters\n", size);

exit(EXIT_SUCCESS);

}

int main(){

//pipe descriptors

int pipefd[2];

if(pipe(pipefd) == -1){

//pipe creation error

perror("pipe");

exit(EXIT_FAILURE);

}

//install handler

sigset_t mask , prev;

sigemptyset(&mask);

sigaddset(&mask , SIGALRM);

sigprocmask(SIG_BLOCK , &mask , &prev);

Sigaction new_action;

sigemptyset(&new_action.sa_mask);

new_action.sa_flags = SA_RESTART;

new_action.sa_handler = alarmhandler;

sigaction(SIGALRM , &new_action , NULL);

sigprocmask(SIG_SETMASK , &prev, NULL);

while(1){

//print size on multiple of 4

if(size != 0 && size % 1024 == 0){

printf("%llu characters in pipe\n", size);

}

//reset previous alarm

alarm(0);

//set new alarm for 5 seconds

alarm(5);

//write to pipe one character

write(pipefd[1], "A", sizeof(char));

size++;

}

return 0;

}

Explanation:

Output for a, b, c are pasted accordingly

4 0

3 years ago