<< Prev Showing: 166-170 of 353 Next >>
· 141-145 · 146-150 · 151-155 · 156-160 · 161-165 · 166-170 · 171-175 · 176-180 · 181-185 · 186-190 · 191-195 ·Programming Concepts for Engineers. See attached file for full problem description.
Subject:
Computer Science
Topic:
Data Structures and Algorithms
Posting ID:
105201
OTA ID:
102804
For the Class "date," give examples of: Objects (instances), Instance Variables, Methods, Messages, Interfaces, Encapsulation, Inheritance, and Polymorphism.
Subject:
Computer Science
Topic:
Data Structures and Algorithms
Posting ID:
105760
OTA ID:
102804
Please see attachment. All log or txt files needed are attached
Subject:
Computer Science
Topic:
Data Structures and Algorithms
Posting ID:
106542
OTA ID:
105277
You will write a program to calculate the exam grades for a class of a few hundred students. Input Read the input file into your program as a comand line argument, rather than hardcoding the name as you were allowed to in project 3. Each student has a last name, first name, and five problem scores (the four problems on the exam and one extra credit problem). Your program should scan students data in from a file and store it in an array of 27 linked lists. Students will be sorted to different lists by the first letter of their last name. So "Hunter, Johnny" will be sorted to arr[7] list, as H is the 8th letter in the alphabet (remember 'H' - 'A' = 7). The 27th list should store a... click for more
Subject:
Computer Science
Topic:
Data Structures and Algorithms
Posting ID:
106917
OTA ID:
102804
Analyse combinational arithmetic circuits that compute the sum of n k-bit numbers.
The sum of n k-bit numbers can be computed by a combinational arithmetic circuit as follows. Assume that n is an exact power of 2. The circuit consists of a complete binary tree of ripple-carry adders, in which each node in the tree adds two numbers and produces a sum which is fed to its parent. The n/2 leaves of the tree input the n k-bit numbers, and the total sum is produced as output by the root. Each ripple-carry adder is as small as possible while still ensuring that the sum is correctly computed. [a] What is the maximum number of bits in the sum of the n k-bit numbers? What is the number of full adders in any ripple-carry adder at height h in the tree, where we view leaves as h... click for more
Subject:
Computer Science
Topic:
Data Structures and Algorithms
Posting ID:
107165
OTA ID:
105381
<< Prev Showing: 166-170 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.0967 seconds