answersLogoWhite

0


Best Answer

Employers values those employees who can come up with unique ways to solve problems. Creativity is a valued attribute in new and potential employees.

User Avatar

Bethel Pfeffer

Lvl 9
2y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Tell me about a time when you Were creative in solving problem?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

When problem solving what depends on the problem's complexity the leaders experience and the time available?

Quality of solution


When problem solving what depends on the problem's complexity the leader's experience and the time available?

Quality of solution


When problem solving what depends on the problem complexity the leaders experience and the time available?

Quality of solution


How to solve Problem solving of arc to time?

5h 10m 13m


What is the complexity of solving the 3-SAT problem in terms of time and space requirements?

The complexity of solving the 3-SAT problem is NP-complete, meaning it is difficult to solve efficiently in terms of time and space requirements.


When to use the advantages of problem solving?

When facing a problem might be a good time!When facing a problem might be a good time!When facing a problem might be a good time!When facing a problem might be a good time!


Describe a time when you have shown innovative thinking?

Employers appreciate prospective employees who are creative and can think outside of the box. You should describe an experience when you took an unusual, but successful approach to solving a problem.


What is the complexity of solving the 3sat problem in terms of time and space requirements?

The 3SAT problem is known to be NP-complete, meaning it is difficult to solve efficiently. The time and space requirements for solving 3SAT problems grow exponentially with the size of the input.


What is the time complexity of the knapsack greedy algorithm when solving a problem with a large number of items?

The time complexity of the knapsack greedy algorithm for solving a problem with a large number of items is O(n log n), where n is the number of items.


Is there a formal proof that demonstrates the complexity of solving the knapsack problem as NP-complete?

Yes, there is a formal proof that demonstrates the complexity of solving the knapsack problem as NP-complete. This proof involves reducing another known NP-complete problem, such as the subset sum problem, to the knapsack problem in polynomial time. This reduction shows that if a polynomial-time algorithm exists for solving the knapsack problem, then it can be used to solve all NP problems efficiently, implying that the knapsack problem is NP-complete.


What problem solving strategies dont guaruntee solutions but make efficient use of time?

Heuristics


When problem solving what depends on the problems complexity the leader's experience and the time available?

Quality of solution