<< Prev Showing: 156-160 of 353 Next >>
· 131-135 · 136-140 · 141-145 · 146-150 · 151-155 · 156-160 · 161-165 · 166-170 · 171-175 · 176-180 · 181-185 ·Object-oriented tasks - Driving a Car
Identify how you can encapsulate the data and processes you identified into an object-oriented design. Describe the architectural differences between the object-oriented and structured designs. Which of the designs makes more sense to you? Why? ___________________________________________________________________________ Driving a Car Objects: 1. Car has the following objects (door, ignition, seat belt, mirror, gear, and accelerator) 2. Key In the driving seat Close the Door Seat belts on Use key for ignition Check Mirror Engage Gears Press Accelerator With Car Set Door.close = true Set Seat-belt.on = true Call Ignition(Key) Call Mirror.adjust() Call Gears ... click for more
Subject:
Computer Science
Topic:
Data Structures and Algorithms
Posting ID:
99400
OTA ID:
103644
Generate an object-oriented design for a system that keeps tracks of your CD and DVD collection.
Generate an object-oriented design for a system that keeps tracks of your CD and DVD collection. Identify each of the classes, associated data, and operations for the classes. Generate the pseudo code for each of the classes of objects
Subject:
Computer Science
Topic:
Data Structures and Algorithms
Posting ID:
99889
OTA ID:
103644
Show a GUI of a CD/DVD Media Program in Visual Basic
Draw a GUI that will create the objects and provide access to each objects processing methods. Each of the classes, their associated Data and their operations are given below Classes 1. Media Data totalItems Name Serial Operations AddItem getName getSerial getTotalItems setName setSerial setTotalItems 2. CD is a Media Data Album Artist Volume Operations getAlbum getArtist getVolume setAlbum setArtist setVolume 3. DVD is a Media Data Movie Artist Volume Operations getAlbum getArtist getVolume setAlbum setArtist setVolume
Subject:
Computer Science
Topic:
Data Structures and Algorithms
Posting ID:
99914
OTA ID:
103644
In this project, you will build a program used by an admissions office to help process applicants for a graduate degree in engineering. Your program will read several database files containing applicant information and other information relevant to the applications process. Based on an admissions formula, you will compute a score for each applicant, and output a file with all the applicants and their scores. The output of your program will aid the admissions office in their admissions decision. 1 Database The database your program will process consists of 3 files: applicants.txt, ranking.txt, and journals.txt. (A sample of these files are available on the web sitehttp://www.en... click for more
Subject:
Computer Science
Topic:
Data Structures and Algorithms
Posting ID:
102241
OTA ID:
105277
Let G = (V, E) be a flow network with source s, sink t, and suppose each edge e E has capacity c(e) = 1. Assume also, for convenience, that |E| = (V). a. Suppose we implement the Ford-Fulkerson maximum-flow algorithm by using depth-first search to find augmenting paths in the residual graph. what is the worst-case running time of this algorithm on G? b. Suppose a maximum flow for G has been computed, and a new edge with unit capacity is added to E. Describe how the maximum flow can be efficiently updated. (Note: It is not the value of the flow that must be updated, but the flow itself.) Analyze your algorithm. c. Suppose a maximum flow for G has been computed,... click for more
Subject:
Computer Science
Topic:
Data Structures and Algorithms
Posting ID:
103222
OTA ID:
102804
<< Prev Showing: 156-160 of 353 Next >>
· 1-5 · 6-10 · 11-15 · 16-20 · 21-25 · 26-30 · 31-35 · 36-40 · 41-45 · 46-50 · 51-55 · 56-60 · 61-65 · 66-70 · 71-75 · 76-80 · 81-85 · 86-90 · 91-95 · 96-100 · 101-105 · 106-110 · 111-115 · 116-120 · 121-125 · 126-130 · 131-135 · 136-140 · 141-145 · 146-150 · 151-155 · 156-160 · 161-165 · 166-170 · 171-175 · 176-180 · 181-185 · 186-190 · 191-195 · 196-200 · 201-205 · 206-210 · 211-215 · 216-220 · 221-225 · 226-230 · 231-235 · 236-240 · 241-245 · 246-250 · 251-255 · 256-260 · 261-265 · 266-270 · 271-275 · 276-280 · 281-285 · 286-290 · 291-295 · 296-300 · 301-305 · 306-310 · 311-315 · 316-320 · 321-325 · 326-330 · 331-335 · 336-340 · 341-345 · 346-350 · 351-353 ·Page generated in 0.0955 seconds