C++ code that runs properly Output SpecificationFor each test case, print one line saying To get from xx to yy takes ?? knight moves. in console.Sample OutputBelow is the correct output for the previous sample input.To get from e2 to e4 takes 2 knight moves.To get from a1 to b2 takes 4 knight moves.To get from b2 to c3 takes 2 knight moves.To get from al to h8 takes 6 knight moves.To get from al to h7 takes 5 knight moves.To get from h8 to al takes 6 knight moves.To get from b1 to c3 takes 1 knight moves.To get from f6 to f6 takes knight moves.Hint• According to the problem description, the grid is 8 by 8, therefore there are 64 squares. We can thenmodel the chessboard as a graph with 64 vertices; and an edge between two vertices exists if and onlyif we can make a knight move from one vertex to another.• When moving to the next position, a knight can have at most eight possible directions, as shown inthe above figure for the black knight, without getting out of the chess board boundary.• The problem becomes a graph traversal problem!• DFS or BFS? Which one will work? Given a chess board, your job is to write a program that takes two squares x and y as input and thendetermines the number of knight moves on a shortest route from x to y.a b c d e f g h8e2 e4al b2b2 c3al h8al h7h8 alb1 c3f6 f676543 21a b c d e f g h87654321Input SpecificationYour program should read from an input file, which will contain one or more test cases. Each test caseconsists of one line containing two squares separated by one space. A square is a string consisting of aletter (a-h) representing the column and a digit (1-8) representing the row on the chessboard.Sample Input

Code: #include <bits/stdc++.h> using namespace std; int dx[8]={-2, -2, -1, -1, 1, 1, 2,…

Given a chess board, your job is to write a program that takes two squares x and y as input and then determines the number of knight moves on a shortest route from x to y. a b c d e f g h 8 e2 e4 al b2 b2 c3 al h8 al h7 h8 al b1 c3 f6 f6 7 6 5 4 3 2 1 a b c d e f g h 8 7 6 5 4 2 3 Input Specification Your program should read from an input file, which will contain one or more test cases. Each test case consists of one line containing two squares separated by one space. A square is a string consisting of a letter (a-h) representing the column and a digit (1-8) representing the row on the chessboard. Sample Input

Given a chess board, your job is to write a program that takes two squares x and y as input and then determines the number of knight moves on a shortest route from x to y. a b c d e f g h 8 e2 e4 al b2 b2 c3 al h8 al h7 h8 al b1 c3 f6 f6 7 6 5 4 3 2 1 a b c d e f g h 8 7 6 5 4 2 3 Input Specification Your program should read from an input file, which will contain one or more test cases. Each test case consists of one line containing two squares separated by one space. A square is a string consisting of a letter (a-h) representing the column and a digit (1-8) representing the row on the chessboard. Sample Input

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Suppose a Genetic Algorithm uses chromosomes of the form x=abcdef with a fixed length of six genes.Each gene can be any digit between 0 and 9 . Let the fitness of individual x be calculated as : f(x) =(a+b)-(c+d)-(e+f) And let the initial population consist of four individuals x1, ... ,x4 with the following chromosomes : x1 = 3 5 3 2 6 5, x2 = 9 8 0 1 2 2, x3 = 1 2 2 1 2 3, x4 = 7 9 2 3 1 1 1. 1.Evaluate the fitness of each individual, showing all your workings, and arrange them in order with the fittest first and the least fit last. 2. calculate the average fitness. 3. Perform the following crossover operations:a- Cross the fittest two individuals using one point crossover at the middle point.b- Cross the second and third fittest individuals using a two point crossover (points b and e). Suppose the new population consists of the four offspring individuals received by the crossover operations in the above question. Evaluate the fitness of the new population, showing all your…
Given an n*m grid containing integers. Rows are numbered from 1 to n and columnsare numbered from 1 to m. Write a program in C++ to find the path with minimum sum from (1,1) to (n,m). You caneither move right or down at each step. 1<= (n,m) <= 1000.Your complexity should be O(n*m) . Sample Input 4 52 -3 8 8 57 -2 5 8 32 1 3 0 43 4 2 8 4 Sample Output 9 Explanation: 2 -> -3 -> -2 -> 1 -> 3 -> 0 -> 4 -> 4
Draw a graph in Python to denote the following point? Red Dots for A-D Blue Dots for E-F Black Dots for G-I Mark x- axis as f_1 and y axis as f_2 Also denote the corresponding letter near the point. $\{A=(5000,35000),B=(6000,31000), C=(10000,20000),\\ D=(25000,10000), \\ E=(5500,33000), F=(20000,15000),\\ G=(23000,31000), H=(18000,16000), I=(25000,3500\}$
There are two algorithms called alg1 and alg2 for a problem of size n. alg1 runs in n2 microseconds and alg2 runs in 100n log n microseconds. alg1 can be implemented using 4 hours of programmer time and needs 2 minutes of cpu time. on the other hand, alg2 requires 15 hours of programmer time and 6 minutes of cpu time. if programmers are paid 20 dollars per hour and cpu time costs 50 dollars per minute, how many times must a problem instance of size 500 be solved using alg2 in order to justify its development cost?
Consider the letters X and O lined up one after the other as follows. X O X O X O X O X O Develop an algorithm that sorts the X's to the left with the O's to the right (as below) X X X X X O O O O O In one step of your algorithm, it can only replace two adjacent letters. Write the program in C language?
Generate a graph of performance improvement for code below. Tip: Figure 5.17 in the textbook provides an example of a graph depicting performance improvements associated with loop unrolling. code: //normal code int main() { int n, sum=0; n=50; int a[50]; { for(int i=0; i<n; i++) { sum= sum +a[i]; } printf("sum is %d", sum); return 0; } //with unrolling int main() { int n, sum=0; n=50; int a[50] for(int i=0; i<n; i+=10) { scanf("%d", &a[i]); } sum= sum + a[0]; sum= sum + a[1]; sum= sum + a[2]; sum= sum + a[3]; sum= sum + a[4]; sum= sum + a[5]; sum= sum + a[6]; sum= sum + a[7]; sum= sum + a[8]; sum= sum + a[9]; printf("sum is %d", sum); return 0; }
Consider an undirected graph G = (V,E), in which each node u 2 V may be colored with some color between 1 and C. Your task is to write a program that determine the colors for the uncolored nodes in the graph such that • For all edges (u, v) 2 E, u and v have different colors. • The number of additional colors needed is minimum. Input (Standard input): Includes multiples lines. The first line contains two integers 1 n 1000, 1 m 100000 that correspond to the number of nodes and edges, respectively. Each of the following m lines contain two integers u and v, separated by one space, to denote an edge from u to v. Nodes are numbered from 1 to n. The last line contains n integers that are the colors of the nodes. Uncolored nodes are indicated with color 0. Output (Standard output): The first line contains an integer 0 D n that is the number of additional colors needed to color all the uncolored nodes in the graph. The next line contains n positive integers that are colors of the nodes. Your…
Given the following Python program that finds the minimum number of platforms in a train station to avoid delays in the arrival of a train, transcribe it to pseudocode. def minPlatform(arr, dep, n):arr.sort()dep.sort() platform_counter = 1result = 1i = 0j = 0 while i < n and j < n:if arr[i] < dep[j]:platform_counter += 1i += 1if platform_counter > result:result = platform_counterelse:platform_counter -= 1j += 1return result
There is a cube and an ant is performing a random walk on its vertices,every step it will start from one vertex and walk to another along the connected edge, it willrandomly select any of the 3 adjoining vertices with equal probability. If it starts at one vertex,what is the expected number of steps it needs to reach the diagonally opposite vertex? Write a c++ program for the same
The unary numeral system is a numeral system to represent natural numbers as sequences of ones, that is, to represent a number ?, a symbol representing “1” is repeated ? times. For example, the number 4 is represented by 1111. The number 0 would be represented by the empty string. Create a Turing machine which adds 3 to a natural number, that is, writes three times a 1 after the given unary number. Afterwards move the head to the left-most position of input.
Write a program that will allow two users to playtic-tac-toe. The program should ask for movesalternately from player X and player O. Theprogram displays the game positions as follows:123456789 The players enter their moves by entering theposition number (a single digit, 1-9) theywish to mark. After eachmove, the program re-displays the changed board.A sample board configuration is as follows:XXO456O89
implement a function using a loop, for finding the n'th Fibonacci number using the MIPS assembly language.Let P be the Fibonacci function:P(0) = 0P(1) = 1For n > 1 P(n) = P(n-1) + P(n-2)Example Output of Execution:Enter the sequence number: 6P(6) = 8