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.

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?

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.

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. 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.

can anyone help me with some suggestions and improvemnts
for sage line 50?

1072

How to use a Bot or Intelligent Agent on the Web?

1589

What is the consequence between a node and its predecessors while creating Bayesian network?
a) Conditionally dependent
b) Dependent
c) Conditionally independent
d) Both a & b

210

. What is state space?
a) The whole problem
b) Your Definition to a problem
c) Problem you design
d) Representing your problem with variable and parameter

143

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False.
a) True
b) False

225

What can operate over the joint state space?
a) Decision-making algorithm
b) Learning algorithm
c) Complex algorithm
d) Both a & b

77

Which method is used to search better by learning?
a) Best-first search
b) Depth-first search
c) Metalevel state space
d) None of the mentioned

79

Which of the following is used for probability theory sentences?
a) Conditional logic
b) Logic
c) Extension of propositional logic
d) None of the mentioned

203

Which functions are used as preferences over state history?
a) Award
b) Reward
c) Explicit
d) Implicit

105

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.

88

Satellite Image Analysis System is (Choose the one that is not applicable).
a) Episodic
b) Semi-Static
c) Single agent
d) Partially Observable

94

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

83

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False.
a) True
b) False

68

Are Bots and Intelligent Agents personal search engines?

1328

can we use dynamic send port without castration in biztalk