Interested to Buy Any Domain ? << Click Here >> for more details...
Which algorithm in ‘unification and lifting’ takes two sentences and returns a unifier?
- 0 Answers
- 958 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is the depth-first search algorithm?
What is greedy best first search algorithm?
What is the uniform cost search algorithm?
What do you mean by overfitting and underfitting algorithms?
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 meant by a * search algorithm?
Which search algorithm will use a limited amount of memory in online search?
What is bidirectional search algorithm?
What are the disadvantages of breadth-first search algorithm?
What’s your favorite algorithm, & can you explain it into me in less than a minute?
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
Write a code/algorithm to find the frequency of each element in an array?
0 Answers ITC Indian Tobacco Company,
-
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)
