Register

please tell me whether the Branch & Bound concept and NP Hard & NP Complete concepts are there for gate or not in algorithms?

449 views
0 0 votes
With in this less time I have to Complete many Subjects So,please tell me wether NP Hard& NP Complete concept in algorithm is there for gate or not?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · GO Classes CS Test S...Next → · BigEndian C compiler
← Previous in category · Shortest path in DAG...Next in category → · Iteration Functions ...
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.4k
1.4k views
tishhaagrawal asked Dec 4, 2023
1,385 views
MadeEasy Test Series 2024 - In this question they have asked about the number of context switches that are happening. (Excluding the first and the last context switch). I am getting the answer as 5, according to the answer key it should be 6. I am not pre-empting process P when Q arrives as P has a higher priority than Q, in the solutions they have done the exact opposite, can anyone please tell me whether my approach is correct or I am missing onto something.
Jobs $P, Q, R, S$ and $T$ with burst times equal to $13,10,5,9$ and 1 respectively arrive in $0,5,7,10,12$ seconds. Pre-emptive priority scheduling is utilized for schedu...
2 2 votes
3 answers 3 answers
3.8k
3.8k views
hem chandra joshi asked Aug 25, 2017
3,759 views
can any one tell what are the steps to find whether there is Dependency Preserving Decomposition or not?
2 2 votes
1 1 answer
621
621 views
hem chandra joshi asked Sep 4, 2017
621 views
is there any procedure to find out whether a function is functionally complete or not?