B3 trabalhos

... 2. a. Only show the visible surface of the building. 3. b. Use the z-buffer algorithm to determine the visible surface. 4. c. Shade the visible surface using the ambient light illumination model. 5. d. Use different colours for different polygons. Put your drawing code in the drawing function of B3 in the sample program (CB3::Draw(CDC *pDC)). Your result should show when B3 is pressed. 1. 2. 4. Repeat Task 2 with the following additional requirements. 1. 2. a. Only show the visible surface of the building. 3. b. Use Warnock’s algorithm to determine the visible surface. 4. c. Shade the visible surface using the Phong illumination model and the P...

...are set as "Last name, First name". The other 10% can be left alone. I want a macro/code that checks if there is a comma (,) in the cell text. If so, it changes the text from "Last_name, First_name" to "First_name Last_name" (switches order, deletes comma and adds space between 'First_name' and Last_name') ------------------------------------------ Cell b2 reads: Smith, John A Cell b3 reads: Jones, Tom cell b4 reads: Adams, John Michael These should be changed to: John A Smith Tom Jones John Michael Adams respectively. ----------------------------------------------- There is about 1,250 text entries in the column so the more automated the better. I am not opposed to exporting it to .csv, chan...

I need to make a vending machine using visual basic 6. It must have Dollar, Quarter, Nickel, and Dime buttons to accept payment. It will have one frame that includes A,B,C option buttons, and one frame that includes 1,2,3 option buttons. There will be a total of nine items to choose from. A1,A2,A3 each cost $.50. B1,B2,B3 each cost $.75. C1,C2,C3 each cost $1.25. It needs to give change, and have a dispenser for the item. This is for a intro visual basic 6 class and therefore must be made as simple as possible. Everything needs to be in one module. I've come to this as a last resort since I'm having a hard time figuring it out. I would like to be able to learn from the code that is written. If it would be easier I can send you a form I already layed out and then just have ...

(Please refer to the attached Excel spreadsheet). Looking for an Excel macro that would check to see if a sum of any combination of a specified range of cells (e.g. A2:A32) falls into a narrow range or values or is an exact match to a target cell value (B2). In this example, B3 represents the actual sum of A1, A4, A5, A8, A11, A13, A16 while B4 represents a variance in $$ and C4 in %. The macro should be optimized to run on a regular P-III PC. Fast turnaround will be appreciated. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side ...

...procedure should be designed to open a selected file, copy selected cell values and paste the values into a new spreadsheet created on execution of this sub based on an existing named template. Attached 2 templates, BLD_Template to copy from TISO_Template to copy to based BLD_Template to TISO_Template IntenetWorkSheet to InternetChecklist as follows K1 to M6 I9 to W14 I32 to V44 B3 to C4 B5 to C6 B6 to C7 B4 to C9 N1 to K10 N75 to S44 then using InternetServiceOrder on TISO L165 to AB29 L171 to AB30 L178 to AB31 ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the pl...

write a sparse matrix solver for Mx=b input files , output file : , format for file #cols, #rows M11 M12 .... M1n ...... Mn1 Mn2 .....Mnn format for file #rows b1 b2 b3 .... format for #rows x1 x2 x3 .... format for is the highest and lowest memory usage # of operations( adds / substract/ multiplication and division) # fillins **the code should use an orthogonal link list and some heuristics to control the fillins ( u can use LU decomposition and QR factorisation or Gram Schmitt approximations for solving the problem) ** a test example M = 1 1 0 3 0 1 0 2 2 2 1 10 4 0 2 14 b = 2 8 18 the code should be fully tested and must have

...into an equivalent postfix expression. The rules are as follows: Suppose **infx**represents the infx expression and **pfx**represents the postfix expression. a. Initialize **pfx**to an empty expression and also initialize the stack. b. Get the next symbol, **sym**, from **infx**. b1. If **sym**is an operand, append **sym**to **pfx**. b2. If **sym**is (, push **sym**, into the stack. b3. If **sym**is ), pop and append all the symbols from the stack until the most recent left parentheses. Pop and discard the left parentheses. b4. If sym is an operator: b4.1. Pop and append all the operators from the stack to **pfx**that are above the most recent left parenteses and have precedence greater than or equal to sym. b4.2. Push **sym**into the stack. c. After proc...

...equivalent postfix expression. The rules are as follows: Suppose **infx** represents the infx expression and **pfx** represents the postfix expression. a. Initialize **pfx** to an empty expression and also initialize the stack. b. Get the next symbol, **sym**, from **infx**. b1. If **sym** is an operand, append **sym** to **pfx**. b2. If **sym** is (, push **sym**, into the stack. b3. If **sym** is ), pop and append all the symbols from the stack until the most recent left parentheses. Pop and discard the left parentheses. b4. If sym is an operator: b4.1. Pop and append all the operators from the stack to **pfx** that are above the most recent left parenteses and have precedence greater than or equal to sym. b4.2. Push **sym** into the stack. c. After pr...

Specification: A single C++ source-file implementing the following function: float Multivariate_Regression(float x[][], float y[], int n, int x_count, float& a, float& b[], ...96 (I'm using Redhat 7.2). I.e., if you cannot test it under VC++ that is not necessary. Just to clarify the spec: The function must fill in the variables std_error, a, b[], and t_stat[] in addition to returning r-squared. Here is a test data set: y x1 x2 x3 1 2 4 1 2 2 2 3 3 2 3 1 4 1 2 4 5 1 2 5 R2 = .82 Standard Error = 1.34 a = 11.1 b1 = -2.79 b2 = -0.93 b3 = -0.43 t1 = -1.02 t2 = -0.60 t3 = -0.35 ## Deliverables 1) Source file as specified. 2) Unrestricted ownership and use rights of code. ## Platform Must compile under MS Vi...

...**I need a text file output available on the server the lists the ip and domain name as you see below as well. I need to be abel to copy and paste this file into another server.** ** ** **I need a way to montior - and test the records internally and externally from the dns server to make sure that the records and dns server are reponding properly. I want to hook this up to some monitoring system - that sends me an sms in case of trouble or things not routing properly. would liek to discuss how we could impelment

I need a way to create mass forward and Reverse DNS records. I need them to propagate and a system to check to see that the records are setup properly. ## Deliverables 1) Complete and fully-functional wor...they are all routed correctly. He is an example of what the range would look like, /20 of course is 16 class c’s ??" 255 ips in each class c. the gateway is not used of course and --- I can specify letter number format. Aa aaa ect.. ## Platform whatever language will work most effectively with this process I use Redhat 9.0 for my DNS servers

...Resources are non-preemptive. All process start out with 0 resources of A, B, and C allocated (i.e. allocated = 0,0,0). File format: A: Number of units the system owns of resource A B: Number of units the system owns of resource B C: Number of units the system owns of resource C N: Number of processes that exist P1 A1 B1 C1: The Max column for process 1 P2 A2 B2 C2: The Max column for process 2 P3 A3 B3 C3: The Max column for process 3 PN AN BN CN: The Max column for process N. X: The number of resource requests that follow. Px a b c: Process x requests “a?? units of resource A, “b?? units of resource B, and “c?? units of resource C. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all w...

...The menu shown at should be customizable. I should be able create a file containing the number of top-level and sub-level buttons and it should create a .htm file which will contain the navigation menu. I do not want to create the menu interactively, only in the batch-mode. Level Label Link button 1.0 Course Home 1.1 Syllabus 1.2 Calendar 1.3 Discussion 2.0 Unit 1 2.1 Objectives 2.2 .......................... Variable number of top-levels and sub-levels ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s)

I need a Javascript to validate a form. In attach you'll find the form, all fields that have the sign "*" are bound to be filled. If they are not filled, once clicking the continue button () a windows message should appear saying "Please fill field ....". Notice that different fields appear according to the coutry of residence (field "Residencia") and so the fields to validate depends on the country. Provider will have 2 days to complete the project. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distributio...

...Reference Excel spreadsheet (to be provided to bidders)for basic layout and formulas to use for scoring. 2) Users must be able to enter text values into cells B3 and B4. And, numerical values less than or equal to 10 in cells C3 through Q3 and C4 through Q4. Cell R3 should keep a running value of cells C3 through Q3 (sums). Cell R4 should keep a running value of cells C4 through Q4. 2a) Users should enter text values for fighter names in B3 and B4 prior to being able to score fight where they will enter numerical values into cells C3 through Q3 and C4 through Q4. Example, user should score first round of fight by entering a value for fighter from B3 into C3. And for fighter from B4 into C4. Then, the next round could be scored in D3 and D4. Code must alert user when...

...can merge two n-element sorted arrays. Let the first array be a1, a2, ..., an, and the second array be b1, b2, ..., bn. The following procedure, which is the general case of the 4?-4 and 8?-8 cases, constructs a (2n)?-(2n) merging network recursively: Take two n?-n merging networks and align them vertically. Send a1, a3, a5, ..., an-1 to the first half of the top n?-n merging network, and send b1, b3, b5, ..., bn-1 to the second half. Send a2, a4, a6, ..., an to the first half of the bottom n?-n merging network, and send b2, b4, b6, ..., bn to the second half. Let c1, c2, c3, ..., cn be the output lines of the top n?-n merging network, and let d1, d2, d3, ..., dn be the output lines of the bottom one. Let c1 and dn be the first and last output lines of the resulting (2n)?-(2n) me...

...Self assignment union A += B. Since we have + and = operators += will not be hard to implement. queue intersection C = A && B. C contains the elements that are contained in both queues. (multiple appearances of an element only if there are multiple appearances in both queues.) queue shuffle C = A * B. C contains only elements of queue A shuffled with the elements of B. ( C = { a1, b1, a2, b2, a3, b3, ...} ). If one queue has more elements than the other once all the elements from the queue with less elements have been added, all elements from the larger queue should be added. queue difference C = A / B. C contains the elements from queue A that do not appear in queue B any number of times. queue length (has to be called length) int = (); Where data is of type queue. Your ...

...Self assignment union A += B. Since we have + and = operators += will not be hard to implement. queue intersection C = A && B. C contains the elements that are contained in both queues. (multiple appearances of an element only if there are multiple appearances in both queues.) queue shuffle C = A * B. C contains only elements of queue A shuffled with the elements of B. ( C = { a1, b1, a2, b2, a3, b3, ...} ). If one queue has more elements than the other once all the elements from the queue with less elements have been added, all elements from the larger queue should be added. queue difference C = A / B. C contains the elements from queue A that do not appear in queue B any number of times. queue length (has to be called length) int = (); Where data is of type queue. Your ...