Interested to Buy Any Domain ? << Click Here >> for more details...
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
- 0 Answers
- 1234 Views
- DELL, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is breadth-first search algorithm?
Which is the most straight forward approach for planning algorithms?
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
What is the bidirectional search algorithm?
What is meant by a * search algorithm?
what are the minimum requirements for statr testing?
Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the algorithm?
What is depth-first search algorithm?
Tell briefly about the Banker's algorithm and what is it used for?
When an algorithm is considered completed?
A* algorithm is based on which search method?
Define Routing 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)
