Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   Errors
 Testimonials Refer this Site

 Categories >> Software >> Artificial Intelligence AI Algorithms (14) AI Language Processing (11) AI Knowledge Representation (12) AI Robotics (96) AI Recognition (11) AI Neural Networks (22) AI Fuzzy Logic (21) AI Games (4) AI Languages (139) AI Tools (4) AI General (18) AI AllOther (6) Suggest New Category

Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.    0  246
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?    0  240
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.    0  172
Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.    0  176
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.    0  143
What is the minimum time for any program scan in pc    0  125
Define procedural knowledge and declarative knowledge.    0  262
Define shallow knowledge and deep knowledge.    0  369
Differentiate between documented and undocumented knowledge. 3. How is knowledge collected?    0  484
List the major sources of knowledge.    0  273
What is inheritable knowledge?    1  892
What is relational knowledge?    1  340
What are the techniques to represent knowledge?    1  330
What are the properties of a good knowledge representation system?    1  550
How many types of entities are there in knowledge representation?    1  443
[1]    2  ... 3   ... 5   ... 7   ... 9   ... 11   ... 13   ... 15   ... 17   ... 19   ... 21   ... 23    Next

Question Views   Select

is this artificial intelligence lives over the other software programes and their flexiblity 1064
Suggest me sites relating to the Accounting Procedures/to gain more knowledge regarding the accounts which will be in simplified model 1077
As you're starting work on your game, one of your colleagues suggests avoiding pathfinding completely, and just using potential fields for pathfinding and navigation. He suggests that you just overlay a big 2D grid over the world, with each cell indicating the distance to the nearest obstacle. Is his idea feasible? Why or why not? When would it cause problems? Regardless of the answer to that question, what are some of the other ways that such a system could be used? 301
What is the minimum time for any program scan in pc 125
I need a MATLAB source code to recognize different regular geometric shapes such as: squares,rectangles,triangles,circles and ellipses in different sizes using neural network. All of the images containing these shapes should be in binary format with the size of 300*400 pixels. would you please give me a MATLAB code to detect these geometric shapes? 2661
a) PROLOG b) Java c) LISP d) Perl e) Java script 161
How many types of random variables are available? a) 1 b) 2 c) 3 d) 4 73
You're implementing a medieval strategy game in which pikemen should always walk in front of archers, and catapults should always be behind the archers. Explain how you could implement the movement system to ensure that you keep pikemen in front and catapults in the rear as much as possible. Explain how your answer might be different depending on whether or not the units simply need to end up in that configuration when they reach that destination, or if they need to maintain that formation while moving. 290
Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit 164
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? 240
To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals 191
There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentioned 227
Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned 110
List the major sources of knowledge. 273
Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem 382