Interested to Buy Any Domain ? << Click Here >> for more details...
Sorting algorithms and time complexity of various algorithms.
- 0 Answers
- 1018 Views
- InterGraph, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Explain the concept behind dead lock avoidance, banker's algorithm.
0 Answers HPCL, Hughes Systique Corporation,
Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.
What is the breadth-first search algorithm?
What are the disadvantages of breadth-first search algorithm?
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?
Can you pick an algorithm. Write the psuedo-code for a parallel implementation?
What is breath-first search algorithm?
What is meant by uniform cost search algorithm?
What is software cycle? Give a diagrammatic representation?
Which search algorithm will use a limited amount of memory in an online search?
A* algorithm is based on which search method?
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)
