Write a computer program that evaluates pn(x) where pn(x) is the taylor series expansion derived in problem (3) above. verify that |f(x) − pn(x)| satisfies the appropriate error bound. you must be able to convince me by plotting results and checking the error for your approximation that everything was programmed correctly. from your graphs, you will see that the error depends on x. which values of x would you predict tend to give smaller/larger errors? does your graph corroborate your intuition? a sample program for f(x) = e x is posted on blackboard course library. (in python)

Usually, when we sniff packets, we are only interested certain types of packets. we can do that by setting filters in sniffing. scapy’s filter use the bpf (berkeley packet filter) syntax; you can find the bpf manual from the internet. set the following filters and demonstrate your sniffer program again (each filter should be set separately): (a) capture only the icmp packet. (b) capture any tcp packet that comes from a particular ip and with a destination port number 23. (c) capture packets comes from or to go to a particular subnet. you can pick any subnet, such as 128.230.0.0/16; you should not pick the subnet that your vm is attached to.

Which of the following would not be considered a pc? a. mainframe b. desktop c. tablet pc d. laptop

Ineed to know the anwser to all these questions