Answer:
public class Triangle
{
public static void main( String[] args )
{
show( 5 );
}
public static void show( int n )
{
int i,j,k;
for (i = 0; i < n - 1; i++ )
{
for (j = 0; j < i; j++ )
{
System.out.print( " " );
}
for (k = n - i; k > 0; k-- )
{
System.out.print( "* " );
}
System.out.println();
}
for (i = 0; i < n; i++ )
{
for (j = n - i; j > 1; j-- )
{
System.out.print( " " );
}
for (k = 0; k < i + 1; k++ )
{
System.out.print( "* " );
}
System.out.println();
}
Answer:
1. b)
2. c)
3. c)
4. a)
5. b)
Explanation:
1. and 5. Linear kind of navigation is a system with a sequential manner web pages that are perfect for some sorts of sites that are having information that has to be viewed as a book (5) and when we are talking about that view we are considering one page after another page like we are reading a book. It is also the simplest navigation. This is the explanation for question 1 and question 5.
2. The most well-designed navigation system is an intuitive one because in this design of the website we have website traffic that is easy because it flows from one web page to another web page. It is showing us where to go to find and look for something and even where to go if there is no concrete options for what are we looking for.
3. A Sitemap is referring to the organized hierarchy of links and it is the protocol that is allowing us to search through many links. A Sitemap is having a listing of the URLs for some site and that is why this is the correct answer.
4. In using liner reciprocal navigation the interface should include how frames are left and how many of them are there. The more the frames, the more times the user will spend on them and the site.
Answer:
From the given diagram, consider a MIN node whose children are terminal nodes, if MIN plays
suboptimal. MIN will never be lower than the utility obtained playing against an optimal MIN
MIN will always select a move having minimax utility greater than or equal to the move that is
predicted by the minimax that is the MIN-played optimal value.
Then the MIN node's value is increased to MAX. This is done by induction.
One can do better than the minimax strategy, if the suboptimal play is predicted by MIN.
If MIN always falls for certain for certain kind of trap and losses, then setting up a trap guarantees a win.
Explanation:
See attached picture also.
Answer:
Im not sure why but maybe you can find a way to contact the people who own it and see if they know because that hasn't happened to me. How many questions have you asked
Explanation:
