BASICS
stepwise procedure
Define algorithm
When the list has only a few elements
When performing a single search in an unordered list?
stack
Which Data Structure is used to perform Recursion?
To Get Maximum Total Value In The Knapsack
What is the objective of the knapsack problem?
branch and bound
Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
O(N Log N)
What is the worst case time complexity of merge sort?
A function where the recursive call is the last thing executed by the function
What is tail recursion?
n^2
What is best case complexity of selection sort
stepwise solution to the problem
In computer science, algorithm refers to a special method usable by a computer for the solution to a problem.
Continuous knapsack problem
Fractional knapsack problem is also known as
code && flowchart
Algorithm can be represented as
Queue
Which data structure is used for implementing a FIFO branch and bound strategy?
Adaptive Linear Element
What is adaline in neural networks
NP complete problem
Hamiltonian path problem is
Monte Carlo Algorithm
An algorithm that always runs in polynomial time but possibly returns erroneous answers is called a