Plz help

The NFC Technology is a Wireless Technology which works in the range of 10 cm or less.
NFC stands for Near Field Communications.
The name itself indicates that it a communication mode with the near by objects.
The NFC technology is used in Access Cards, Payment Cards and Mobile Devices etc.
Option (a) IM - Instant Messaging is the instant text messaging technology sends and receives messages over the internet. It is used in Social Media where instant messaging is available. So, option (a) is not correct option.
Option (b) text messaging the technology is the technology in which the text messages are sent over the mobile networks ( in case of text messaging in mobile phones ) or over the internet ( emails, blogging etc). So, option (b) is not correct option.
Option (d) DES is not a short range wireless technology. So, option (d) is not correct.
Option (c) NFC is correct option.

3 0

3 years ago

Recursively computing the sum of the first n positive odd integers, cont. About (a) Use induction to prove that your algorithm t

julia-pushkina [17]

The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.

int recursiveOddSum(int n) {

if(2n-1==1) return 1;

return (2n-1) + recursiveOddSum(n-1);

}

To prove the correctness of this algorithm by induction, we start from the base case as usual:

$f(1)=1$

by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).

Now we can assume that $f(n-1)$ returns indeed the sum of the first n-1 odd numbers, and we have to proof that $f(n)$ returns the sum of the first n odd numbers. By the recursive logic, we have

$f(n)=f(n-1)+2n-1$

and by induction, $f(n-1)$ is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, $f(n)$ is the sum of the first n odd numbers, as required:

$f(n)=\underbrace{\underbrace{f(n-1)}_{\text{sum of the first n-1 odds}}+\underbrace{2n-1}_{\text{n-th odd}}}_{\text{sum of the first n odds.}}$

6 0

3 years ago

14. Write a program that accepts or rejects applicants for admission at Fictional University. To qualify, an applicant must be a

Gala2k [10]

The required program for applicant selection written in python 3 is :

age = int(input())

grade12_avg = int(input())

ps = int(input())

cs = int(input())

def status(age, grade12_avg, ps, cs):

msg = 'sorry you are not admitted'

if (age >=16) and (grade_avg >=60):

if (ps>=65) or (cs>=50):

message = 'congratulations'

print(message)

else :

print(message)

else:

print(message)

Run through of the codeblock :

age = int(input())

grade12_avg = int(input())

ps = int(input())

cs = int(input())

# input values provided by users

.

def status(age, grade12_avg, ps, cs):

#Define a function named status

msg = 'sorry you are not admitted'

# display message for recepients

if (age >=16) and (grade_avg >=60):

#First condition ; the and keyword means both must be True

if (ps>=65) or (cs>=50):

2nd condition, or statement means only one or both can be true

message = 'congratulations'

#content of message if both conditions are met

print(message)

#Display newly defined content of message

else :

print(message)

#Display initial content of message

else:

print(message)

#Display initial content of message.

Learn more :brainly.com/question/24672775

7 0

3 years ago