Assignment All About Daily Life

Question:
Look around your daily life, and find out two interesting real-life NP-hard problems. Turn in
pictures of these two problems and state the two problems clearly. Also explain why they are
NP-hard. (Length of your answer: 1-2 page) 5. (20 pts.)
If a problem is a nondeterministic polynomial it is called NP. The solution of this problem can be
guessed and polynomial time can be used to solve the problem. While solving NP problems, we
don’t have to follow any rule but we just guessed about the topic. [3] Also, if the problem is NP
and the other NPs are polynomial time reducible then we refer it as NP complete. Therefore,
finding a productive calculation for any NP-complete issue suggests that a proficient calculation
can be found for every such issue, since any issue having a place with this class can be recast
into some other individual from the class. It is not known if any polynomial-time calculations
will be found for NP-complete issues, and thinking if these issues are traceable or obstinate stays
one of the most significant inquiries in hypothetical software engineering. At the point when a
NP-complete issue must be comprehended, one methodology is to utilize a polynomial
calculation to inexact the arrangement; the appropriate response in this way gotten won't really
be ideal yet will be sensibly close.
Example [3]
• We can look at the problem shown above
• The kind of questions we shall ask ourselves include the following
• What are the problems that are hardest in NP?
• That notation means that L1 is reducible in polynomial time to L2.

• < Less than symbol use describes that the time that will be taken to solve L1 is not bad
that a polynomial factor away from the time taken to solve L2.
For example, low maintenance educator in OR (Operations Research) who I worked with, had
significantly more involvement in explaining huge (I) LPs. He clarified that he comprehended
that the issues may not be unraveled following 3 hours of running the solver, and one had no clue
on the off chance that they'd need to hold up another 3 hrs. or 3 minutes. He kind of
comprehended this entire complain about NP-culmination, yet all he thought about whether his
concern was unraveled inside X hours. If not, he'd loosen up certain limitations and rerun. [2]
Question:
Give the most interesting Online-Exam question that you can think of. State this question
precisely and give a sample solution to this question. (Length of your answer: 1-2 page) 6.
(5pts)
Online has become one of the most important tools to post and answer questions. However, there
are questions that are mostly ask on online platforms which include the following stated below.
1. What is a computer program?
Answer:
A computer program is a set of instructions designed to tell the computer what to do? These
instruction are coded and organized in some particulars ways by humans. A computer works like
the way human brain works.
2. How does the computers come into being?
Answer:
Computer originates from nowhere other from the psychological concern in which a veteran
mathematician decided to come up with something which can make the mathematical calculation
so simple. [2] The guy come up with a calculator which was only performing arithmetic
calculations. From there the computer evolves until recently the engineers came up with high-
speed modern computers.
3. Give two types of computer software?