Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...



Artificial Intelligence Interview Questions
Questions Answers Views Company eMail

What are the techniques to represent knowledge?

1 3682

What is relational knowledge?

1 3007

What is inheritable knowledge?

1 12025

List the major sources of knowledge.

1621

Differentiate between documented and undocumented knowledge. 3. How is knowledge collected?

3328

Define shallow knowledge and deep knowledge.

1 3801

Define procedural knowledge and declarative knowledge.

1749

What is the minimum time for any program scan in pc

KOTC,

1468

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.

2588

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.

1 5365

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.

1724

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?

2420

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.

2701

I have two multifiles i.e. datapartition2 and datapartition3 .how i join these two?

403

how we install a artificial intelligence software to our computer ?

1456


Un-Answered Questions { Artificial Intelligence }

What is phonology nlp terminology?

840


What is the box-cox transformation used for?

84


What are some applications of AI in smart agriculture?

84


What is adaptive learning

75


How do you evaluate the performance of a chatbot or virtual assistant?

94


Among python and r, which one is generally preferred for text analytics?

354


Define a sql query? How do you use sql in sas, python, r languages?

402


Do you have research experience in machine learning?

73


What is regularization? What kind of problems does regularization solve?

76


What is Test set in machine learning?

128


What is important in machine learning based tensorflow, performance or accuracy?

5


How does learning from context enhance the performance of LLMs?

54


Explain the following variant of gradient descent: stochastic, batch, and mini-batch?

1


Define chameleon method?

29


Which gpu is best for deep learning?

1