Artificial Intelligence Programs For Programming in Python

Traveling Salesman Problem ( TSP )] Artificial Intelligence Programs For Master Leval Programming in Python from iter tools import permutations def distance(point1, point2): >>> distance([3,4],[0,0]) 5.0 >>> distance([3,6],[10,6]) 7.0 return ((point1[0] - point2[0])**2 + (point1[1] - point2[1])**2) ** 0.5 def total_distance(points): all the points are in the given order. >>> total_distance([[1,2],[4,6]]) 5.0 >>> total_distance([[3,6],[7,6],[12,6]]) 9.0 return sum([distance(point, points[index + 1]) for index, point in enumerate(points[:-1])]) def travelling_salesman(points, start=None): Time complexity is O(N!), so never use on long lists. >>> travelling_salesman([[0,0],[10,0],[6,0]]) ([0, 0], [6, 0], [10, 0]) >>> travelling_salesman([[0,0],[6,0],[2,3],[3,7],[0.5,9],[3,5],[9,1]]) ([0, 0], [6, 0], [9, 1], [2, 3], [3, 5], [3, 7], [0.5, 9]) """ if the start is None: start = points[0] return min([perm for perm ...
Post a Comment

GPSC Reasoning SSC Reasoning Quiz

GPSC Reasoning SSC Reasoning Quiz


NO

Question

OP1

OP2

OP3

OP4

Right

1

Look at this series: 73, 10, 83, 11, 9, 12, ... What number should come next?

7

10

12

13

2

2

Look at this series: 74, 10, 8, 11, 94, 12, ... What number should come next?

8

88

888

8888

23

3

Paragraph Question

n/a

n/a

n/a

n/a

n/a

4

how ____ you?

n/a

n/a

n/a

n/a

Fine

5

Look at this series: 7, 10, 8, 11, 9, 12, ... What number should come next?

8

88

888

8888

n/a

6

Simple Question

n/a

n/a

n/a

n/a

Simple Answer

7

i___rfom mumbai

Am

am

aM

aa

1

8

Paragraph Question22

n/a

n/a

n/a

n/a

n/a

9

Look at this series: 73, 10, 83, 11, 9, 12, ... What number should come next?

7

10

12

13

2

10

Look at this series: 74, 10, 8, 11, 94, 12, ... What number should come next?

8

88

888

8888

2

11

Paragraph Question

n/a

n/a

n/a

n/a

n/a

12

how ____ you?

n/a

n/a

n/a

n/a

are

13

Look at this series: 7, 10, 8, 11, 9, 12, ... What number should come next?

8

88

888

8888

2

14

Simple Question

n/a

n/a

n/a

n/a

Simple Answer

15

i___from Rajkot

Am

am

aM

aa

am

16

Paragraph Question22

n/a

n/a

n/a

n/a

n/a

17

Draw Your Signature

n/a

n/a

n/a

n/a

n/a

Comments

Post a Comment

Popular posts from this blog

MongoDB Exercises Practice Solution Exercise First

Image
MongoDB Exercises Practice Solution Exercise  Practice This All Examples Exercise 3 => Create database EMP and Make Collection With name "EMPL" and Follow Queries  =>Created Database > use emp switched to DB emp =>Create Collection > db.createCollection("empl") =>Insert Records Into EMPL Collection > db.empl.insert([ {no:1,name:"ST",salary:2000,role:"OB"}, {no:2,name:"MSD",salary:1500,role:"WK"}, {no:3,name:"YS",salary:1000,role:"ALR"}, {no:4,name:"RD",salary:1000,role:"MOB"}, {no:5,name:"RS",salary:500,role:"OB"}, {no:6,name:"BK",salary:500,role:"MOB"}, {no:7,name:"VK",salary:300,role:"BW"}, {no:8,name:"JB",salary:400,role:"BW"}, {no:9,name:"HP",salary:400,role:"ALR"}, {no:10,name:"VS",salary:300,role:"OB"...
Read more

Simple Basic Commands For MongoDB

Image
Simple Basic Commands For MongoDB      1.    Create a database named “mydb”       >   Use mydb      2.    Show all databases       >   Show dbs           3.      Show currently selected database. >   DB      4.      Create a collection named “emp”. >   db.createCollection(“emp”)      5.      Show all collections of the selected database. >   Show collections 6.   Insert following documents in emp collection: >  db.emp.insert( [ { empno : 1,ename : "Sachin",sal : 60000,desige : "Manager",dept : "Purchase" }, { empno : 2,ename : "Kohali",sal : 50000,desige : "Manager",dept : "Sales" }]) Find() 1.      List all documents. > db.emp.find() 2.  ...
Read more

Artificial Intelligence Programs For Programming in Python

Traveling Salesman Problem ( TSP )] Artificial Intelligence Programs For Master Leval Programming in Python from iter tools import permutations def distance(point1, point2): >>> distance([3,4],[0,0]) 5.0 >>> distance([3,6],[10,6]) 7.0 return ((point1[0] - point2[0])**2 + (point1[1] - point2[1])**2) ** 0.5 def total_distance(points): all the points are in the given order. >>> total_distance([[1,2],[4,6]]) 5.0 >>> total_distance([[3,6],[7,6],[12,6]]) 9.0 return sum([distance(point, points[index + 1]) for index, point in enumerate(points[:-1])]) def travelling_salesman(points, start=None): Time complexity is O(N!), so never use on long lists. >>> travelling_salesman([[0,0],[10,0],[6,0]]) ([0, 0], [6, 0], [10, 0]) >>> travelling_salesman([[0,0],[6,0],[2,3],[3,7],[0.5,9],[3,5],[9,1]]) ([0, 0], [6, 0], [9, 1], [2, 3], [3, 5], [3, 7], [0.5, 9]) """ if the start is None: start = points[0] return min([perm for perm ...
Read more