2) N-Queens. A Queen on a chessboard can attack any piece in the same column, row or diagonal. The N-Queens problem is to place n queens on a n x n chessboard such that no two queens threaten each other. a) Implement a one-dimensional integer array of Queen positions for an 8x8 board where indices represent rows and the values represent columns. For example, this "safe" solution would be {3,6,2,7,1,4,0,5} b) Request values for the array from the console. c) Implement an output to display the board (see output example). d) Implement a queensAreSafe function that: 1) Returns false if multiple queens share a column. Note that by design they are in separate rows (make sure you understand why). 2) Returns false if multiple queens share a diagonal. 3) Returns true if all queens are safe. e) Program should display if the Queens are safe or not safe. Example output (input is bold and italicized) : Enter 8 column values: 1 4 2 3 5 7 6 O Queens are not safe!

2) N-Queens. A Queen on a chessboard can attack any piece in the same column, row or diagonal. The N-Queens problem is to place n queens on a n x n chessboard such that no two queens threaten each other. a) Implement a one-dimensional integer array of Queen positions for an 8x8 board where indices represent rows and the values represent columns. For example, this "safe" solution would be {3,6,2,7,1,4,0,5} b) Request values for the array from the console. c) Implement an output to display the board (see output example). d) Implement a queensAreSafe function that: 1) Returns false if multiple queens share a column. Note that by design they are in separate rows (make sure you understand why). 2) Returns false if multiple queens share a diagonal. 3) Returns true if all queens are safe. e) Program should display if the Queens are safe or not safe. Example output (input is bold and italicized) : Enter 8 column values: 1 4 2 3 5 7 6 O Queens are not safe!

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

6. Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).Do In c Program
- Write a program that randomly generates a 20 x 20 two-dimensional array, board, of type int. An element board[i][j] is a peak (either a maximum or a minimum) if all its neighbors (there should be either 3, 5, or 8 neighbors for any cell) are less than board[i][j], or greater than board[i][j]. The program should output all elements in board, with their indices, which are peak. It should also output if a peak is a maximum or a minimum
Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).c programm please tell all the answer
Following is the partition function for quicksort, where we have used the leftmost number as a pivot. Assume that our array, ARR = {14, 8, 7, 38, 22, 15, 9}, which is 7 in size. What will be the array ARR after we apply "partition(A, 0, 6)"* 9, 15, 22, 38, 7, 8, 14 7, 8, 9, 14, 15, 22, 38 9, 8, 14, 7, 22, 15, 38 9, 8, 7, 14, 22, 15, 38 7, 9, 15, 22, 38, 14, 6 38, 22, 15, 14, 9, 8, 7
java ARRAY[] = [50, 11, 33, 21, 40, 50, 40, 40, 21] ARRAY[] = [11, 21, 33, 40, 50] ATTN : Further, please be reminded that you cannot use library functions to either sort and or perform the de-duplication operation. solve the problem (1) Implement the function in such a way that your solution solves the problem with time complexity overall O(n) space complexity. Here, n is the length of the list of input integers (array). I believe the sorting routine that can be used here is Merge Sort. Please state as code comment which sorting routine you are using, sort the arrray with that algorithm and solve the de-duplication problem thereafter. De-duplication part of the solution in itself must adhere to O(n) time and O(1) space bounds. we will not use any memory used by recursion. Important: Take the size of the input array from the User.Prompt user to input the integers in the array.PLEASE MAKE SURE TO EXPLAIN THE SORTINGALGORITHM AND DE-DUPLICATION ALGORITHM INCOMMENTS WHILE YOU…
Question- Need solution in JavaSomething related to IPO offeringmain gist is we had shares - lets say N which we want to divide among biddersBidders are represented in 2d arrays as[bidder_id, no of shares_bid, price, timestamp]Now build a function returns the bidder_id's in sorted array that did not receive any shares. Shares are allocated following rules- if the price is highest among all the bidders. Allocate shares If the price is same among 2 bidders. Allocate share in iterative fashion, first one get share had earlier timestamp.Like 2 bidders with bidder id 1&2, have same price, timestamp 4 and 1, bids for 5 shares each and N=1.So, in this case only bidder id 1 get share, bidder id 2 will not recieve any shares
Use C++ Programming bool remove(const char* person) Improve the remove method where you return true if an entry is successfully deleted (i.e. we have found an entry that matches the person), otherwise return false. Initial code below bool remove(const char* person) { for (int i = 0; i < index; i++) { entry* existing = array + (sizeof(entry) * i); if (!strcmp(existing->name, person)) { // MOVE all entries to the left starting to the next // We are to stop before we reach index-1 so as not to reach index-1+1 where data doesn't exist for (int j = i; j < index - 1; j++) { // current entry = next entry *(array + ( sizeof(entry) * (j) ) ) = *(array + ( sizeof(entry) * (j+1) ) ); } index--; break; } } // Added temporarily. You may delete or move this.…
Problem (class MergeSalary)First, write a Java method merge that takes as parameter a non-empty double array representingemployees’ salaries. The method merges the values of every 2 adjacent elements. put themerged values at the beginning of the array, and put 0 in the remaining positions. Suppose thatthe original array will contain an even number of elements.Second, write two java methods readArray(int[]a) and printArray(int[]a) thatreads/writes the elements of an array passed in parameter from/to the standard input/output.Finally, Use the following main method to test your different methods:public class MergeSalary{ private static Scanner input = new Scanner(System.in); public static void main(String[] args) { double[] salaries = new double[10]; System.out.print("Enter 10 salaries: "); readArray(salaries); merge(salaries); System.out.print("Salaries after merge: "); printArray(salaries); }}
3. Write a program to find intersection of two sorted array.For example, if the two sorted arrays as input are {21, 34, 41, 22, 35} and {61, 34, 45, 21, 11}, it should returnan intersection array with numbers {34, 21}. For the sake of this Problem, you can assume that numbers ineach integer array are unique.
ALGO1(A)// A is an integer array, an index that starts at 11): for i=1 to n-1 do2): minIndex = findSmallest(A,i)3): exchange A[i] with A[minIndex] The sub-routine find the smallest(A, i) in Line 2, and returns the index of the smallest element in thesub-array A[i:n]Suppose the array below is provided as input to ALGO1 2 5 6 7 3 8 1 4 Fill in the Blanks At the end of the first iteration of the for loop (i.e. with i=1)1) a) the element at index 1 is : b) the element at index 4 is : c) the element at index 7 is :
Magic Index: A magic index in an array A[ 1 .•. n-1] is defined to be an index such that A[ i] i. Given a sorted array of distinct integers, write a method to find a magic index, if one exists, in array A.FOLLOW UPWhat if the values are not distinct?
2. Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number in the sequence is missing. a. Write the mathematical process to find the missing number, i.e. some equation. b. What is the time complexity of finding the missing number in the sequence?