This assignment will give you practice in developing a class for sorting and searching,with a specific application in mind. The class methods can mostly be implemented by adapting algorithms which you have seen. This assignment is worth 10% of your final mark for this unit. A template program is provided to you, and electronic submissions are required from you, as described below. Some but not all of your work will be auto-tested. All your work will be looked over by a tutor. Your mark for the assignment will be given on the basis of both the auto-testing (done by machine)
2015-01-25 10:59:10
COM101 PROGRAMMING 2014
COM101: PROGRAMMING2014 Project (AssignmentNo.3) Due date 11:55pm 26/09/20 14(Week 12Friday) In this project, you are required to design a suitable interface and implement a program which can 1.Load two files. Each of them contains a set of numbers (in CSV format). For example: T1.txtcontains 2, 6, 4, 8, and T2.txt contains 11, 3, 1, 12. Etc. 2.Sort those numbers in each file, and show the sorted results in their corresponding listbox; 3.Merge these numbers into a final sorted list, and save them in a new file “T3.txt” You are also required to write a short report to describe the design and implementation of your project. Your submission should include a compressed file for the VB.Net project and a WORD file describing the design and implementation of your project..What to submit? You need to submit a software copy of your work via submission link in Week 9 on Student Portal. Your submission should contain: A clearly labeled VB.NET solution (Name, IdNo, etc.) holding all your VB project files. A report to demonstrate working of the program in the Lab. This is similar to a User Manual. You can put both VB.NET solution folder (including all project files) and your report into a single compressed file, e.g. JackieRong30123456.zip (.7z or .rar)
浏览:739
2015-01-25 10:49:46
Run-time Stack and Merge Sorting a Linked List
COMP 2140 Assignment 2: A Run-time Stack and Merge Sorting a Linked List
Helen Cameron and Stephane Durocher
Due: Wednesday October 22 at noon
Programming Standards
When writing code for this course, follow the programming standards, available on this course's website on
Desire2Learn. Failure to do so will result in the loss of marks.
Objective
To test, using a backtracking algorithm, if a mouse can escape from a rectangular maze.
Your Program
General Overview:
Your program must implement a backtracking algorithm that helps the mouse by
systematically trying all the routes through the maze until it either nds the exit or exhausts all possible
routes (and concludes that the mouse is trapped in the maze). If the backtracking algorithm nds a dead
end, it retraces its path until it reaches a position from which there is an untried path. The backtracking
algorithm always tries all directions (forward, backward, left, and right | no diagonal moves allowed) from
any position it reaches.
浏览:613
2015-01-19 14:10:43
C++ Program
This project is to produce a “mini” parts tracking system for each of 3 manufacturing stations so that when the wafer is cut up at the end, data can be provided to sort heads into the 4 categories. Data will also be used for reporting on manufacturing yields. You will be given a Test Case to analyze which describes the results at each of the 3 manufacturing stations.
浏览:748
2015-01-19 13:46:27
background
Computer disks (large and small) have internal drives that store data. Key components in the drives are the “heads” that actually read/write the data. Heads are manufactured in clean rooms by a series of steps that deposit layers of materials on a wafer, and pattern those layers using photolithography and etching. During the processing the wafers are inspected and, when processing is finished, the devices are tested. As a result of the manufacturing process, a head could have 2 active elements that are:
...