can anyone help me with some suggestions and improvemnts
for sage line 50?
No Answer is Posted For this Question
Be the First to Post Answer
What are the disadvantages of depth-first search algorithm?
What is local search algorithms?
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
What is greedy best first search algorithm?
list the types of linked list with aid of diagram?
Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
When an algorithm is considered completed?
Which is the most straight forward approach for planning algorithms?
What is bidirectional search algorithm?
1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout << i ; for ( i = n ; i >= 1 ; i - - ) cout << i ; (a) What is the output when n = 2, n = 4, and n = 6? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.
What do you mean by overfitting and underfitting algorithms?
What is the iterative deepening depth-first search algorithm?
AI Algorithms (74)
AI Natural Language Processing (96)
AI Knowledge Representation Reasoning (12)
AI Robotics (183)
AI Computer Vision (13)
AI Neural Networks (66)
AI Fuzzy Logic (31)
AI Games (8)
AI Languages (141)
AI Tools (11)
AI Machine Learning (659)
Data Science (671)
Data Mining (120)
AI Deep Learning (111)
Generative AI (153)
AI Frameworks Libraries (197)
AI Ethics Safety (100)
AI Applications (427)
AI General (197)
AI AllOther (6)