This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: NAME Lab Section 1 SID January 26, 2007 Assignment 1: Introduction to Matlab SOLUTIONS 75 pts for problems 25 for proper formatting (4 for proper heading, 4 for title, 4 for page numbers, 4 for problem labels and titling along with clear display of answers, take off all points for each if any part of each is incorrect,) Note: Due to a lack of clarification in the assignment, for this lab only we will accept either the assignment # or the lab section # in the top right corner of the heading For future assignments the lab section number should be in this corner. -9 if the assignment is not in pdf format with the proper file name 100 TOTAL Problem 1: Getting Started (9) 1.1 The name of the function is called the Traveling Salesman problem. +1 The Traveling Salesman problem tries to find the minimum distance required to visit n cities once and only once and return back to the starting city. +1 +1 1.2 Nvctfdv kf V77! Nv yfgv pfl cvrie drep evn kyzexj reu yrmv r wle kzdv ufzex zk. +1 Welcome to E77! We hope you learn many new things and have a fun time doing it. Welcome to E77!...
View Full Document
This note was uploaded on 02/05/2009 for the course ENGLISH 77 taught by Professor Sengupta during the Spring '07 term at University of California, Berkeley.
- Spring '07