Jawaban:
1. N = 5 # nilai N/ banyaknya queen
Id = [0] * 30
rd = [0] * 30
cI = [0] * 30
def printsolution(board):
for I in ranger(N)
for j in ranger(N)
print(board[i][i], end = ” ”)
print()
def solveNQUtil(board, col):
if (col >= N):
return True
for i in ranger(N):
if ((Id[I – col + N – 1] != 1 and
rd[i + col] !=1) and cI[i] ! = 1):
board[i][col]=1
Id[I – col + N – 1] = rd[i+col]=Ci[i]i=1
If(solveNQUtil(board, col+1)):
Return true
Board[i][col]=0
Id[i-col+N-1]=rd[i+col]=cl[i]=0
Return false
Def solveNQ():
Board=[[0,0,0,0,0],
[0,0,0,0,0,0],
[0,0,0,0,0,0],
[0,0,0,0,0,0],
[0,0,0,0,0]]
If(solveNQUtil(board,0)==false):
Print(“solution does not exist”)
Return false
Printsolution(board)
Return true
SolveNQ()
2. Hitung jumlah Color dari Vertex dengan konsep Graph Colouring dibawah ini
7 2 3 9 4 6 8 5 1
5 4 6 2 1 8 3 7 9
9 1 8 5 3 7 4 2 6
1 6 9 4 5 2 7 3 8
2 7 5 6 8 3 1 9 4
3 8 4 1 7 9 2 6 5
4 9 7 3 6 1 5 8 2
6 3 1 8 2 5 9 4 7
8 5 2 7 9 4 6 1 3
Jawaban ujian ini dikirimkan lagi ke e-learning dengan format nama file NIM-UAS-DAA-
KLS-A-2020 berbasis file PDF, dalam waktu yang telah ditentukan.