" (in the appropriate place) instead of copying the below code. The eggs class must contain an appropriate data member or data members. Write constructor definition(s), if necessary. Write member function definitions for display and smash. Write an overloaded operator definition for + (addition of two Eggs objects). Note: A????1 As always, for every member function and overloaded operator, use the appropriate access modifier A????1 const, static, or nothing. A????1 As always, for every parameter, declare it appropriately using pass-by-value, pass-by-reference, and/or const. A????1 As always, you must use precise syntax and proper style. Comments are not required. A????1 I recommend that you write your program on a separate sheet of paper so that you have plenty of room. int main() { Eggs eggs1, eggs2; Eggs eggs3(13), eggs4(30); eggs1 = eggs2 + eggs3 + eggs4; eggs1.smash(1).smash(2); eggs1.display(); eggs3.display(); return 0; } output 3 dozen, 4 single(s) 1 dozen, 1 single(s) 1500 Extra creadit Will be given 3523 Given the following instruction sequences of three threads, how many clock cycles will FGMT on a 4-way static superscalar datapath and SMT on a 4-way dynamic superscalar datapath use to complete execution? 3524 Images: Given the diagram for 4 cows, 5 cows, and 6 cows (attached) how many squares of fencing are required for 100 cows? Thanks for help !! Show transcribed image text Given the diagram for 4 cows, 5 cows, and 6 cows (attached) how many squares of fencing are required for 100 cows? Images: Thanks for help !! 3525 Given the declaration: char str1[ 21]; char str2[ 21]; a. Write a C++ statement that stores " Sunny Day" in str1. b. Write a C++ statement that stores the length of str1 into the int variable length. c. Write a C++ statement that copies your name into str2. d. Write C++ code that outputs str1 if str1 is less than or equal to str2, and otherwise outputs str2. Hint: You should to use the utility functions that comes in the library; unless you want to write your own C-string functions or code J include comments to clearly show which part of code is answering which part above. 3526 Given the declaration: char str1[ 21]; char str2[ 21]; a. Write a C++ statement that stores " Sunny Day" in str1. b. Write a C++ statement that stores the length of str1 into the int variable length. c. Write a C++ statement that copies your name into str2. d. Write C++ code that outputs str1 if str1 is less than or equal to str2, and otherwise outputs str2. Hint: You should to use the utility functions that comes in the library; unless you want to write your own C-string functions or code J include comments to clearly show which part of code is answering which part above. 3527 Given the declaration: char str1[ 21]; char str2[ 21]; a. Write a C++ statement that stores " Sunny Day" in str1. b. Write a C++ statement that stores the length of str1 into the int variable length. c. Write a C++ statement that copies your name into str2. d. Write C++ code that outputs str1 if str1 is less than or equal to str2, and otherwise outputs str2. Hint: You should to use the utility functions that comes in the library; unless you want to write your own C-string functions or code J include comments to clearly show which part of code is answering which part above. 3528 You are given the complete definition of a class called Person below. Write a child class calledTitledPerson that inherits from Person. The class TitledPerson has one additional String instance variable for a title (e.g., Ms, Mr, Dr, etc.). Write two constructors: a default constructor and one that sets both the name and the title based on parameters. Write a toString method that lists both the name and the title of the person. Write appropriate getters and setters. Write an equals method. Two TitledPersons are considered A????1the sameA????1 if they have the same name and title. Use good practices of object-oriented design and inheritance. public class Person { private String name; public Person() { name = "N/A"; } public Person(String initialName) { name = initialName; }public void setName(String newName) { name = newName; }public String getName() { return name; } public String toString() { return A????1Name: A????1 + name; } public boolean equals(Object obj) { if(obj instanceof Person) { Person otherPerson = (Person) obj; return name.equalsIgnoreCase(otherPerson.getName()); } else { return false; } } } 3529 You are given a circle with radius 5 centered at x = 1, y = 2. % You want to calculate the intersection of some lines with that % circle. % Write a script to find the x and y coordinates of both % points of intersection. You should test this code at least % with these lines: %y=2x-1 % y = -2 x - 10 % y = x + 5.9054 % % equations % circle : (x-xc)^2 + (y-yc)^2 = r^2 % line : y = m*x + c % % solve for x and y: % (x-xc)^2 + (m*x + c - yc)^2 - r^2 = 0 % quadratic of the form Ax^2 + Bx + C = 0 % where A = 1 + m^2 % B = -2xc + 2m(c - yc) % C = xc^2 + (c - yc)^2 - r^2 % roots are x = (-B +/- sqrt(B^2 - 4AC)) / (2A) use matlab to write the script 3530 Given an article such as this one at nytimes.com, design an algorithm to find the most frequently co-occurring word-pair in this article. Two words are said to co- occur if they appear in the same sentence. You can assume you have access to a subroutine, sentenceSplitter(article), that can accurately segment an article into separate sentences. Please describe your algorithm unambiguously using pseudo code with necessary comments in English. Given P={p_1, p_2, ..., p_m}, the set of products available at a local grocery store; D={T_1, T_2, ..., T_N}, the set of transactions that were completed at this store in the past year, where each T_i (i in [1,N]) is a subset of P; min_freq, a user-specified parameter (e.g., 5%). A product is said to be frequent if it occurs in at least min_freq of the transactions in D. By the same token, a pair of products is said to be frequent if it occurs in at least min_freq of the transactions in D. Also, it's straightforward to prove the following claim: if a product is not frequent, none of the pairs that involve this product will be frequent. Use this claim to design an algorithm to find all the frequent products and frequent product pairs in D. Represent your algorithm in pseudo code. 3531 Given an array of chars representing a string s that has already been declared , write some code that repeatedly reads a value from standard input into s until at last a "Y" or "y"or "N" or "n" has been entered. Assume the maximum length of the string is 5. Please use programming in C (not Java or C++). 3532 Give a Turing Machine that implements a binary-to-unary conversion function BtU(x) = 1^var(x). **Extra** code the Turing machine in C, C++ or Java 3533 Give a reason for each step in the following argument to prove the statement for any propositions A, B, and C: 3535 Give the language for the following regular expressions over the alphabet {a,b} (a) aUb* (b) (ab*Uc) (c) ab*Ubc* (d) a*bc*Uac 3536 Give an example to show that if R and S are both n-ary relations, Show transcribed image text Give an example to show that if R and S are both n-ary relations, then Pi1, i2,?., im(R intersection S) may be different from Pi1, i2, ?, im (R) intersection Pi1,i2,?, im (S). 3537 Give the decimal number represented by the 32-bit word 1001 0110 0101 0000 0000 0000 0000 0000 if An unsigned representation has been used A sign magnitude representation has been used A signed 2A????1s complement representation has been used A 754 IEEE representation has been used 3538 Getting a few projects started with EF, but I had some questions about join tables and keys etc. Lets say I have a table of applications and a table of permissions. Applications have many permissions and each permission can belong to many applications (many-to-many). Now, the Application and Permission tables are easy: Applications -------------PK ApplicationID Name Permissions -------------PK PermissionID Name But what's the BEST way to do the join table? I have these two options: ApplicationPermissions ----------------------PK ApplicationPermissionID CU ApplicationID CU PermissionID OR ApplicationPermissions ----------------------CPK ApplicationID CPK PermissionID PK = Primary Key CPK = Composite Primary Key CU = Composite Unique Index Have you ever been burned doing it one way over the other? is it strictly preference? It has occurred to me that a lot of the "differences" will be abstracted away by my repository pattern (for example, i would almost never create an entire permission object and add it to an application, but do it by ID or unique name or something), but I guess I'm looking for horror stories, one way or the other. 3539 I am getting an error in my Java code. Please helpA????1 In the A????1TestProgram.Java ClassA????1 I am trying to System.out.printf but it will not let me because it says A????1The method printf(String, Object[]) in the type PrintStream is not applicable for the arguments (String, double)A????1 A????1..Here is my code and the bold/italic in the TestPrrogram.Java class (near the bottom) is where I am getting my error. /***********************************Employee.java**********************************/ public class Employee { private String name; private String department; protected double payRate; // Constructor Methods public Employee(String name, String department, double payRate) { this.name = name; this.department = department; this.payRate = payRate; } // Accessor Methods public String getName() { return this.name; } public String getDepartment() { return this.department; } // Weekly pay method public double weeklyPay(double numHours) { if (numHours < 40) return numHours * payRate; return numHours * 40; } // Mutator Methods public void setDepartment(String d) { department = d; } public void setPayRate(double p) { payRate = p; } } /*********************************UnionEmployee.java**********************************/ public class UnionEmployee extends Employee { private double dues; public UnionEmployee(String name, String department, double payRate, double dues) { super(name, department, payRate); this.dues = dues; } // Mutator Methods public void setDues(double dues) { this.dues = dues; } // Overridden weekly payment method public double weeklyPay(double numHours) { if (numHours < 40) return numHours * payRate - dues; return numHours * 40 + (numHours - 40) * payRate * 1.5 - dues; } } /****************************CommissionEmployee.java**********************************/ public class CommissionEmployee extends Employee { private double commissionRate; private double saleAmount; public CommissionEmployee(String name, String department, double payRate, double commissionRate) { super(name, department, payRate); this.commissionRate=commissionRate; saleAmount=0; } // Mutator Methods public void setCommissionRate(double commissionRate) { this.commissionRate = commissionRate; } public void setSaleAmount(double saleAmount) { this.saleAmount = saleAmount; } // Overridden weekly payment method public double weeklyPay(double numHours) { return super.weeklyPay(numHours) + commissionRate * saleAmount; } } /******************************TestProgram.java******************************/ import java.util.Scanner; public class TestProgram { public static void displayEmployeeInfo(Employee employee) { Scanner input = new Scanner(System.in); double numHours; System.out.print("Please enter the number of hours: "); numHours = input.nextDouble(); System.out .println("\n------------ The Employee Information ------------"); System.out.println("Name: " + employee.getName()); System.out.println("Department: " + employee.getDepartment()); double grossPay = employee.weeklyPay(numHours); System.out.printf("The weekly pay: $%.2f\n", grossPay); } public static void main(String args[]) { String name; double payRate; String department; double commissionRate; double saleAmount; double dues; Scanner input = new Scanner(System.in); System.out .println("******* COMP 274 Week 2 - Inheritance and Polymorphism ********"); System.out.print("Please enter the union employee's name: "); name = input.nextLine(); System.out.print("Please enter the department: "); department = input.nextLine(); System.out.print("Please enter the pay hourly rate: "); payRate = input.nextDouble(); System.out.print("Please enter the dues: "); dues = input.nextDouble(); Employee unionEmployee = new UnionEmployee(name, department, payRate, dues); displayEmployeeInfo(unionEmployee); input.nextLine(); System.out.print("\nPlease enter the commission employee's name: "); name = input.nextLine(); System.out.print("Please enter the department: "); department = input.nextLine(); System.out.print("Please enter the pay hourly rate: "); payRate = input.nextDouble(); System.out.print("Please enter the commission rate(%): "); commissionRate = input.nextDouble()/100.0; System.out.print("Please enter the sale amount: "); saleAmount = input.nextDouble(); Employee commissionEmployee = new CommissionEmployee(name, department, payRate, commissionRate); ((CommissionEmployee)commissionEmployee).setSaleAmount(saleAmount); displayEmployeeInfo(commissionEmployee); } } 3540 Can I get help programming this in f#: Neutron is played on a 5x5 square board, with the following setup: 3541 Can i get he answer in C# language( visual basic) .. Not in any other language. thank you. (Exception from a Deeply Nested Method) Write a program that throws an exception from a deeply nested method. The catch block should follow the try block that encloses the call chain. The exception caught should be one you defined yourself. In catching the exception, display the exceptionA????1s message and stack trace 3542 Geometry Calculator Write a program that displays the following menu: Geometry Calculator 1. Calculate the Area of a Circle 2. Calculate the Area of a Rectangle 3. Calculate the Area of a Triangle 4. Quit Enter your choice (1-4): If the user enters 1, the program should ask for the radius of the circle and then display its area. Use the following formula: area = ? (the square of r) Use 3.14159 for ? and the radius of the circle for r. If the user enters 2, the program should ask for the length and width of the rectangle and then display the rectangleA????1s area. Use the following formula: area = length * width If the user enters 3, the program should ask for the length of the triangleA????1s base and its height, and then display its area. Use the following formula: area = base * height * .5 If the user enters 4, the program should end. Input Validation: Display an error message if the user enters a number outside the range of 1 through 4 when selecting an item from the menu. Do not accept negative values for the circleA????1s radius, the rectangleA????1s length or width, or the triangleA????1s base or height. Prompts, Output Labels, and Messages: Besides the output specified above, issue the following messages under the indicated situations: After calculating an area, the program prints "The area is " followed by the calculated area. If the user enters an improper menu choice (1-4), the program prints "The valid choices are 1 through 4. Run the program again and select one of those." If the user enters a negative radius, the program prints "The radius cannot be less than zero." If the user enters a negative value for height or base, the program prints "Only enter positive values for base and height." 3543 Genetic Algorithm The N queens problem requires you to place N queens on an N A????1 N chessboard such that no queen attacks another queen. (A queen attacks any piece in the same row,  column or diagonal.). We define the states to be any configuration where the N queens are on the board, one per column.   The move set includes all possible states generated by moving a single queen to another square in the same column. The function to obtain these states is called the successor function. The evaluation function f(state) is the number of non-attacking pairs of queens in this state. 1. How many possible states are there? 2. For each state, how many successor states are there in the move set? 3. Consider N=6. Suppose that a state is represented as a list of rows in which each queen is located from left. For instance, a state in the figure is (4, 2, 6, 3, 6, 1). What value will the evaluation function f() return for the above current state? 4. [15] Suppose that you use a Genetic Algorithm. The current generation includes four states, S1 through S4. The evaluation values for each of the four states may be computed. Calculate the probability that each of them would be chosen in the selection step. S1 = (4, 6, 2, 6, 4, 4) Pr(S1) = _____ S2 = (3, 5, 6, 5, 4, 3) Pr(S2) = _____ S3 = (4, 6, 2, 4, 6, 2) Pr(S3) = _____ S4 = (6, 5, 1, 3, 6, 6) Pr(S4) = _____ 5. From (4), continue to solve the problem by applying the operations of genetic algorithm such as selection, crossover and mutation. Show the procedure of your solution step by step. The size of population is 4. 3544 I gave up on programming a little over a year ago when I kept hitting this wall. I am revisiting the subject because I want to create basic Android application. But I feel that my limited knowledge will not suffice. Here is my problem. I have read a few books and watched video tutorials on C#/Java, followed examples, then finished the book. In the end they always seem to leave me dumbfounded as to what to do next. What a mean is they teach you from your basic "hello world" application all the way up to if's and arrays then seemingly expect you to know how to go out into the world of coding and create anything. Am I missing something here? I know these are the building blocks of all programs but books that I read never really show me what to do next. The easy answer I suppose would be to 'start coding', but where? I read "Head First Java" for example; up to the part were they tell you take everything you have learned and create a dog racing game.... "try not to cheat and look at the source code provided, you should be able to do this by now" _ that's not an exact quote but basically that's what I was told....... Half an hour ago they were just explaining how to do arrays, then without any theory I am meant to create a working game? The reason I ask this is because I fear that this is all I am supposed to know to at least start coding, yet it feels like I have been given a small toolbox and been told to build a skyscraper. Thank you for any advice 3545 Garden Glory wants to expand its database applications beyond the recording of property services. The company still wants to maintain data on owners, properties, employees, and services, but it wants to include other data as well. Specifically, Garden Glory wants to track equipment, how it is used during services, and equipment repairs. In addition, employees need to be trained before they use certain equipment, and management wants to be able to determine who has obtained training on which equipment. With regard to properties, Garden Glory has determined that most of the properties it services are too large and complex to be described in one record. The company wants the database to allow for many subproperty descriptions of a property. Thus, a particular property might have subproperty descriptions such as Front Garden, Back Garden, Second-Level Courtyard, and so on. For better accounting to the customers, services are to be related to the subproperties rather than to the overall property. A. Draw an E-R data model for the Garden Glory database schema shown below. Assume that Garden Glory designs a database with the following tables. OWNER (OwnerID, OwnerName, OwnerEmail, OwnerType) PROPERTY (PropertyID, PropertyName, Street, City, State, Zip, OwnerID) EMPLOYEE (EmployeeID, LastName, FirstName, CellPhone, ExperienceLevel) SERVICE (PropertyID, EmployeeID, ServiceDate, HoursWorked) The referential integrity constraints are: OwnerID in PROPERTY must exist in OwnerID in OWNER PropertyID in SERVICE must exist in PropertyID in PROPERTY EmployeeID in SERVICE must exist in EmployeeID in EMPLOYEE Assume that OwnerID in OWNER, PropertyID in PROPERTY, and EmployeeID in EMPLOYEE are surrogate keys with values as follows: OwnerID Start at 1 Increment by 1 PropertyID Start at 1 Increment by 1 EmployeeID Start at 1 Increment by 1 B. Use a pencil and papers and create E-R diagram for the above schema. Note that foreign keys are not shown in data models; they are added in the database design phase. Therefore, the foreign keys shown in the Garden Glory database schema are not in the E-R diagram! The only exception is where the foreign keymust be part of the identifier of an ID-dependent weak entity. It would of great help if could please draw the E-R diagram. I have been really sick and havent been able to go to classes so I am really lost. Thank you very much! 3546 Game Playing Consider the following game: When it is their turn to move, players must first choose which of two weighted coins, A and B, to flip. Coin A comes up heads 75% of the time and tails the other 25%. If heads, the player must make move AH and if tails he or she (or it) must make move AT. (To do this problem, you neednt know exactly what each move means.) Coin B comes up heads 10% of the time and tails the other 90%. If heads, players must make move BH and if tails they must make move BT. Assume it is the computers turn to play, and the game tree looks like the one below, where the values at the leaf nodes are the results of calls to the utility function, SBE (higher scores are better for the computer). (1) [10] Explain what move the computer should make. (Hint: think about expected-value calculations. Also, you might want to do parts it b and c first.) (2) [10] Now assume that there is no randomness and the players simply can choose any of the four moves (AH, AT, BH, or BT). Apply the minimax algorithm to the tree below and explain which move the computer should make. As in part (a), assume it is the computers turn to play. Show transcribed image text Game Playing Consider the following game: When it is their turn to move, players must first choose which of two weighted coins, A and B, to flip. Coin A comes up heads 75% of the time and tails the other 25%. If heads, the player must make move AH and if tails he or she (or it) must make move AT. (To do this problem, you neednt know exactly what each move means.) Coin B comes up heads 10% of the time and tails the other 90%. If heads, players must make move BH and if tails they must make move BT. Assume it is the computers turn to play, and the game tree looks like the one below, where the values at the leaf nodes are the results of calls to the utility function, SBE (higher scores are better for the computer). (1) [10] Explain what move the computer should make. (Hint: think about expected-value calculations. Also, you might want to do parts it b and c first.) (2) [10] Now assume that there is no randomness and the players simply can choose any of the four moves (AH, AT, BH, or BT). Apply the minimax algorithm to the tree below and explain which move the computer should make. As in part (a), assume it is the computers turn to play. 3547 Function to_upper has one parameter (a string). It returns the string which is a copy of the parameter, but where all of the lower case ASCII letters have been converted to upper case ASCII letters. How do I create a code for this problem without using the s.upper function in python? 3548 The function ____ returns a non-0 number if the argument is a letter or a digit; otherwise it returns a 0. Question 19 options: A) int isalnum(int) B) int isalpha(int) C) int isdigit(int) D) int isxdigit(int) 3549 The function ____ returns the natural logarithm of its argument. Question 33 options: A) double exp(double) B) double log(double) C) double log10(double) D) double fmod(double) 3550

Calculate Miles Per Gallon

Miles Driven:
Gallons of Gas Used:
Miles Per Gallon

0.0001. Make sure you print out the final result, and the number of terms used to calculate this result. 3557 Function 1 : int isNumber(char *c) Please note that you will write the function in assembly. .global _isNumber _isNumber: Function 2 : Given the following C function prototype that accepts two integer arguments. Complete the function and return 1 if a > b , return -1 if a < b and return 0 if a is equal to b. Please write the function in assembly. Note that the assembly languge skeleton code is given in the attached .s file. int compare(int a, int b) Function 3 : Given the following C function prototype which accepts an integer argument, complete the implementation of the function in Assembly language to return the number of 1A???? 1s in the binary representation of the number passed. For example if the number is (011100011 ) then the function should return 5 as the number of 1s. Please remember that an integer is 32 bits long. Note that the assembly languge skeleton code is given in the attached .s file. int countOnes(int number) Function 4: Write an assembly language function to determine the hamming distance ( the number of different bits) between two characters passed as parameter. Please note that the function prototype is given below and the function will be implemented in assembly language. Note that the assembly languge skeleton code is given in the attached .s file. int returnHammingDistance( char firstparameter, char secondparameter) */ .global _isNumber _isNumber: pushl %ebp movl %esp,%ebp subl $0x16,%esp // // YOUR CODE HERE movl %ebp,%esp popl %esp ret .global _compare _compare: pushl %ebp movl %esp,%ebp subl $0x16,%esp // // YOUR CODE HERE movl %ebp,%esp popl %esp ret .global _countOnes _countOnes: pushl %ebp movl %esp,%ebp subl $0x16,%esp // // YOUR CODE HERE movl %ebp,%esp popl %esp ret .global _returnHammingDistance _returnHammingDistance: pushl %ebp movl %esp,%ebp subl $0x16,%esp // // YOUR CODE HERE movl %ebp,%esp popl %esp ret 3558 FriendList is a new social media tool. It keeps track of all of its users and their friends. It can calculate the total users of the social medial tool, the user with the most friends, the user with the oldest friend, and can also find the common friends between two users. Users can also be added and removed from Friendlist. In order to join FriendList a user must be at least 13 years old and when a user is removed, not only is the user removed from FriendList but also from any userA????1s friend lists. Each user has a name, their current location (name of the city or town), and birth year. Users also have a list of friends (a linklist of a UserA????1s friends). You will need to implement two classes for this social media tool: FriendList, and User. The attributes and methods for each class are listed below (as well as a short explanation of some of the methods). You will implement all the lists in this program as linked lists. In addition, you will need to modify the Node and LinkedList classes so that data stored/retrieved is of User type. Make sure you do proper error testing as well, for example you should not add a user to FriendList if they already exist. And new members need to be at least 13 years old. You can add extra methods or attributes if you find it necessary. FriendList This class has one attribute A????1 allUsers (a Linkedlist of Nodes that stores Users). It also can implement the following methods: A????1 FriendList( ): //no args constructor that creates a new empty list A????1 addUser (User u) : void //adds a user after checking that they are at least 13 years old and do not already exist A????1 removeUser (User u ) : void //remove user from FriendList and remove that user as a friend of any other users A????1 totalUsers ( ) : int //returns the total number of users on FriendList A????1 getUsers () : LinkedList //returns the list of all users A????1 mostFriends ( ) : User //returns the user who has the most friends. If two or more users have the 'most friends' (i.e., a tie for most friends, return the first User with that number (similar to how ArrayLists handle this case) A????1 oldestFriend() : User //returns the user with the oldest friend. If two or more users have 'the oldest' friend (i.e., same birthday A????1 return the first User (similar to how ArrayLists handle this case) A????1 commonFriends (User, User): LinkedList //find common friends between users and returns new list User Attributes: String name String location //this is where they currently live (city or town) int birthYear LinkedList friends //this is a LinkedList that holds Nodes of Users who are their friends It implements the following methods: A????1 User (String, String, int): //set name, location and birthYear, initialize the LinkedList A????1 getName ( ) : String A????1 getLocation ( ) : String A????1 getBirthYear ( ) : int A????1 isEqual (User) : boolean A????1 getFriends ( ) : LinkedList A????1 getNumFriends ( ) : int //returns the number of friends the user has A????1 toString ( ) : String //returns the name and location of the user A????1 addFriend (User) : void //adds a friend to their list A????1 removeFriend (User) : void //removes a friend from their list A????1 oldestFriend ( ) : User //returns the friend who is the oldest (e.g., 30 years old). If there is tie (i.e., same birthday) return the first friend with that birthdate. In order to use Node class you will need to change it to hold User objects instead of just Strings. You will also need to make the necessary changes to set and get to accommodate the data stored as type User. For example, the new Node class could look like the UML diagram below: Node - user : User - next : Node + Node (User ud, Node n) + setUserData (User) : void + setNext (Node) : void + getUser ( ) : User + getNext ( ) : Node + toString ( ) : String You will also need to adapt the LinkedList class to accommodate the fact that Nodes store User data (see the UML diagram below for a list of suggested methods that you could include and you can add other methods) LinkedList - front : Node - count : int + LinkedList ( ) //set front to null and count to 0 + size ( ) : int + isEmpty ( ) : boolean + clear ( ) : void //make the list empty + addNodeToFront (User) : void + getFront ( ) : Node //get the first Node in the list + enumerate ( ) : void //scan list and print the content + removeFront ( ) : void //remove first Node in list + removeLast ( ) : void //remove last Node from list + addNodeToEnd (User) : void //add a Node with User data to end of list + contains (User) : int //check to see if the list has a User and return the index of the user or return -1 if not in list + removeNode (int) : void //remove the Node at a given index + getUserAt (int) : User //return the User of the Node at the given index from the list + toString ( ) : String You should write a demo program that implements the FriendsList. Your complete program will have the following classes: Node.java LinkedList.java User.java FriendList.java Demo.java A short example output is below. You donA????1t have to make the screen dialog exactly as shown below. Be creative. Make sure you show all cases in your testing. 3559 Four stations A,B,C and D are using a channel to send packets at 10 Mbps using an ALOHA-like random access protocol (no carrier sensing) with fixed length slots. The probabilities of transmission of the 4 stations are 0.1, 0.2, 0.3 and 0.4 respectively. Determine the effective throughput obtained by each station and the channel capacity lost due to (i) no station transmitting and (ii) collisions 3560 The foundation plans to share folders on a network along with other resources. You learn from talking with the executive director that the board currently does not plan to authorize the purchase of a server. With this information in mind, what type of network do you recommend? Discuss the advantages and disadvantages of your recommendation. 3561 Formula to parse where number ends I have fields that start with a number and then have letters after it. Can someone provide me with a formula that shows in an adjacent cell only the numbers before the letters? Secondly, could you also provide me with another formula that will only show the letters after the numbers? See below: Starting Field Result Number Result After Number 122SanFrancisco 122 SanFrancisco 3NewYork 3 New York 88Phoenix 88 Phoenix I very much appreciate your help !! 3562 Formula Help: If Sheet 1 A1 value exists in Sheet 2, find Sheet 1 C1 Thank you for looking at this. I am just not incredibly versed in some of the more complicated Excel formulas. I have played around with Vlookup and IF functions, but I think I am out of my league. I am looking at 2 sets of data (pivot tables) in the same workbook on 2 separate sheets. Sheet 1 and 2 have a common data column. I want to create a formula in sheet 1 that does the following: If value in A1 (in Sheet 2) exists anywhere in Sheet 1, then pull the value of A3 from sheet 2. I hope this makes sense. Let me know if you want more information. Thanks for help !! 3563 Formula to count items in a range if specific criteria is met Here is a snapshot of my spreadsheet 0-7 Days 8-14 Days 15-21 Days Total Date Entered Dealership Contact Days 2/23/15 Stamas Auto & Truck Center Lee Stamas 2 2/5/15 Prestige Auto Mart Michelle Arruda 14 2/7/15 Pride Hyundai of Seekonk Bill Oldmixon 12 In Cell B2 _ want to enter a formula that will look at column J4:J6 and if the value is 0-7 count those cells and return a result -- for this example 1 In Cell D2 want to enter a formula that will look at column J4:J6 and if the value is 8-14 count those cells and return a result -- for this example 2 In Cell F2 want to enter a formula that will look at column J4:J6 and if the value is 8-14 count those cells and return a result -- for this example 0 Thank for help !! 3564 Format for Saturday Just for useless fun, this is the format for Saturday morning. I just don't see a way to get rid of the decimal point using formatting only. =TEXT(PI(), "0.\/00\/00 0\:00\:00") 3./14/15 9:26:54 Help me !! 3565 formal language, Show that if L is regular, so is LR (reversed) Show transcribed image text formal language, Show that if L is regular, so is LR (reversed) Show that if L is regular, so is L^R. 3566 Formal language, For the NFA in the following figure, find... Show transcribed image text For the NFA in the following figure, find delta*(q0, 100), delta *(q1, 01), delta *(q0, 1010), and delta *(q1, 00). 3567 Formal language, dfa, regular, minimal. Please help Show transcribed image text 12. Show that if L is regular, so is L^R. 13. Find minimal DFA for the language L = {a^n : n is not equal to 2 and n is ont equal to 4}. Y?u have to prove that the result is minimal. 3568 Form the projection (Teaching assignments) [course, instructor] Teaching Assignments Course Section Semester Instructor MAT 241 1 Fall Gossett MAT 241 2 Fall Gossett MAT 222 1 Winter Kinney MAT124M 1 MAT124M 2 Fall Kinney MAT124M 3 Fall Conrath 3569 Fall Conrath Form the join for the following pair of relations Yearbook Student Task Homeroom Joe Advertisement Martha Activities Kim Teacher Photos Rosa H4 G3 H4 Student Photos D5 Newspaper Student Feature Cohort Amelia News Junior Wesley City Page Sophomore Kim Photos Senior Rosa Editorials Junior Bob Sports Sophomore 3570 I have the following Visual Studio code: public partial class MainPage : PhoneApplicationPage { Random random; int aWidth; int aHeight; int score; DispatcherTimer timer; // Constructor public MainPage() { InitializeComponent(); random = new Random(); timer = new DispatcherTimer(); timer.Start(); timer.Interval = new TimeSpan(0, 0, 0, 1, 0); timer.Tick += new EventHandler(timer_Tick); } void timer_Tick(object sender, EventArgs e) { int x = random.Next(aWidth) - (int)button1.ActualWidth; int y = random.Next(aHeight) - (int)button1.ActualHeight; if (x < 10) x = 10; if (y < 10) y = 10; } private void ContentPanel_SizeChanged(object sender, SizeChangedEventArgs e) { aWidth = (int)e.NewSize.Width; aHeight = (int)e.NewSize.Height; } private void button1_Click(object sender, RoutedEventArgs e) { score += 1; ScoreTextBlock.Text = "Score: " + score; } } } How can I make it stop after 30 seconds? 3571 The following truth table is one bit slice of a binary to two's complement converter: B Cin S Cout 0000 0111 1011 1101 (a) Draw the entity denition of this bit-slice module. (b) Draw the truth table for a four-bit binary to two's complement converter. (c) Using 4 of the bit-slice modules, create a four-bit binary to two's complement converter. 3572 The following table shows the approximate speed of sound in air, water, and steel. create a application program that displays a menu allowing the user to select air, water, or steel. After the user has made a selection, he or she should be asked to enter the number of second the sound will travel in the selected medium =. The program should then display the distance the sound will travel. Medium Speed Air 1,100 feet per second Water 4,900 feet per second Steel 16,400 feet per second I am trying to do this in microsoft visual studio Express 2013 3573 The following table provides two separate scenarios regarding disk reliability. # of Drives Hours/drive Hours/failure a. 1000 8,760 1,000,000 b. 1000 10,512 1,500,000 Question: Assume the disks with lower failure rates are more expensive. Specifically disks are available at a higher cost that will start doubling their failure rate in year 8 rather than year 5. How much more would you pay for disks if your intent is to keep them for 7 years? What about 10 years. Blow are sample and sample solution (Not my question) # of Drives Hours/Drive Hours/Failure a. 1000 10,512 1,200,00 b. 1250 8,760 1,200,000 Sample question: Assume that annual failure rate varies over the lifetime of disks in the previous table. Specifically, assume that AFR is three times as high in the 1st month of operation and doubles every year starting in the 5th year. How many disks would be replaced after 7 years of operation? What about 10 years? Sample answer: Average failure rates of the drives with longer longevity for 7 and 10 years are: 7 Years 10 Years a. 16.06 36.5 b. 12.775 38.325 It is not surprising that with failure rates starting to double 3 years later, we have to replace far fewer disks in the second situation than the fi rst. The ratio of the number of drives replaced in the fi rst scenario to the number replaced in the second should give us the multiple that we want: 7 Years 10 Years a. 1.64 5.2 b. 2.57 6.19 Although I have sample and sample solution but I don't know how to get correct answer, so I need details steps, thanks. (You only do question a. or b. it's enough) 3574 The following table provides two separate scenarios regarding disk reliability. # of Drives Hours/drive Hours/failure a. 1000 8,760 1,000,000 b. 1000 10,512 1,500,000 Question: Assume the disks with lower failure rates are more expensive. Specifically disks are available at a higher cost that will start doubling their failure rate in year 8 rather than year 5. How much more would you pay for disks if your intent is to keep them for 7 years? What about 10 years. Blow are sample and sample solution (Not my question) # of Drives Hours/Drive Hours/Failure a. 1000 10,512 1,200,00 b. 1250 8,760 1,200,000 Sample question: Assume that annual failure rate varies over the lifetime of disks in the previous table. Specifically, assume that AFR is three times as high in the 1st month of operation and doubles every year starting in the 5th year. How many disks would be replaced after 7 years of operation? What about 10 years? Sample answer: Average failure rates of the drives with longer longevity for 7 and 10 years are: 7 Years 10 Years a. 16.06 36.5 b. 12.775 38.325 It is not surprising that with failure rates starting to double 3 years later, we have to replace far fewer disks in the second situation than the fi rst. The ratio of the number of drives replaced in the fi rst scenario to the number replaced in the second should give us the multiple that we want: 7 Years 10 Years a. 1.64 5.2 b. 2.57 6.19 Although I have sample and sample solution but I don't know how to get correct answer, so I need details steps, thanks. (You only do question a. or b. it's enough) 3575 Which of the following statements are correct? (Visual Basic 2012) A) A visual Studio project is a container that holds a solution. B) A Visual Studio project may have multiple solution. C) A visual Studio Project must belong to a solution. D) Both A and B are correct. 3576 For the following reference strings (both taken from the slides for Lecture 14), show the behavior of the Second Chance and Clock page replacement algorithms. Compare the number of page faults offered by these algorithms against FIFO, OPT, and LRU. Assume that the physical memory has 3 frames. Reference string 1: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 Reference string 2: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 3577 is doing the following possible in C# (or in any other language) 1. I am fetching data from a database. At run time i can compute the no. of columns and data types of the columns fetched. 2. Next i want to "generate" a class with these data types as fields. I also want to store all the records that i fetch in a collection. The problem is that i wanna do both step **1** and **2** at runt ime is this possible ? I am using C# currently but i can shift to something else if i need to. 3578 The following loop was intended to calculate the sum of the integers from 50 down to 1. What is wrong with the loop? Rewrite the loop to execute correctly. z = 50; sum = 0; while ( z >= 0) sum += z; 3579 For each of the following lines of assembly language, determine the appropriate instruction suffix based on the operands. For example, mov can be written as movb, movw or movl. Assume that the instructions are run on a 32-bit machine. add %eax, %edx mov %ax, (%edx) mov $20,%ch sub $15,(%eax) mov %ch, %ah push $25 pop %eax dec %edx lea 2(%eax), %edx sal %cl, %eax Please explain why you apply an l vs w vs b. Thank you. 3580 The following KEIL code will add 47 and 25. How can I optimize (trim out the uneccessary lines) to have it do the same thing. MOV A, #47H MOV R3, #25H ADD A, R3 DA A MOV R2, A ANL A, #0x0F MOV R6, A MOV A, R2 ANL A, #0xF0 SWAP A DRL A, #0x30 MOV R4, A MOV A, R6 DRL A, #0x30 MOV R5, A END 3581 The following Java class Fraction needs to be modified in the following ways: First modify the constructors for you Fraction classso that if you try to create a fraction with denominator 0, it will throw an IllegalArgumentException with the message Denominator is 0. Also, to make sure that all Fractions are represented in a standard way, make sure that your constructor ensures that the denominator is never negative and that if the numerator is zero, the denominator is always 1. In other words, System.out.println(new Fraction(2, -4)) should display -1/2 and not 1/-2. Similarily, System.out.println(new Fraction(0,10)) should display 0/1 and not 0/10. Next, add methods .minus() and .dividedBy() similar to the .times() and .plus() methods you should already have. Third, add methods .toDouble() and .toInt() that convert the given Fraction into a double or int. The conversion to an integer should involve rounding down. FInally, write a tester to test our your four new methods and your modified constructors. Your tester in not allowed to crash. That means that in order to test to make sure that your constructors and your .dividedBy() method throw errors in the correct places, you'll have to use try-catch. ------------------------------------------------------------------------------- public class Fraction { private int numerator; private int denominator; Fraction(int num, int denom) { numerator = num; denominator = denom; } Fraction(int num) { numerator = num; denominator = 1; } public int getNumerator() { return numerator; } public int getDenominator() { return denominator; } public String toString() { int gcd = gcd(numerator,denominator); return String.format("%d/%d", numerator/gcd, denominator/gcd); } public Fraction times(Fraction f) { int num = numerator * f.numerator; int denom = denominator * f.denominator; return new Fraction(num, denom); } private static int gcd(int num1, int num2) { return num2 == 0 ? num1 : gcd(num2,num1%num2); } public boolean equals(Fraction otherFraction) { return numerator * otherFraction.getDenominator() == denominator * otherFraction.getNumerator(); } public boolean equals(int value) { return numerator == value && denominator == value; } public void plus(Fraction otherFraction) { numerator = (numerator * otherFraction.getDenominator() + denominator * otherFraction.getNumerator()); denominator = (denominator * otherFraction.getNumerator()); } public static Fraction valueOf(int num) { return new Fraction(num, 1); } public void times(int num) { numerator = numerator * num; denominator = num * denominator; } public void plus(int value) { numerator = (numerator + value); denominator = (denominator + value); } } 3582 Following is an example of a generic method in Java that prints a list containing any type elements. public static void print(T ... list) { for (T elem : list) System.out.print(elem); System.out.println(); } (a) Develop and test a similar generic method but a restricted (A????1upper limitA????1) parameter type that computes the numerical average of a list of elements where the elements are of any Number type (see the Number class in Java). public static double avg(T ... list) { double total = 0.0; for (T elem: list) // TO COMPLETE // need to convert each Number value to type double. This can be done by // use of method doubleValue(), e.g., elem.doubleValue() and add them up // and divide by the length of the list. } (b) Write a simple test program that calls function avg as follows: avg(num1, num2, num3, num4, num5), where num1, etc. are initialized variables of type int avg(fnum1, fnum2, fnum3), where fnum1, etc. are initialized variables of type double avg(name1, name2, name3, name4), where name1, etc. are initialized variables of type string avg(int_list); avg(double_list); Which of the above results in an error? When int_list and double_list are defined as follows (i.e., as an array of primitive types), they will NOT be accepted when passed as arguments to method avg, int[] int_list = {1,2,3,4,5} double[] double_list ={1.0, 2.5, 3.0, 4.5, 5.5} They must be passed as an array of corresponding Numeric class types (e.g., Integer, Float, Double) Integer[] int_list = {1,2,3,4,5}; Double[] double_list = {1.0, 2.5, 3.0, 4.5, 5.5}; 3583 The following diagram is the Figure 3-28 on page 176 of the textbook. (If you are using 5th edition, it's Figure 3-29 on page 166.) What is the name of the circuit component bounded by the red box? In order to write the data on I0; I1; I2 to memory word 2, what values should be on A1, A0, CS, RD and OE? Block diagram of a 4*3 memory. Each row is one of the four 3-bit words. A read or write operation always reads or writes a complete word. Show transcribed image text The following diagram is the Figure 3-28 on page 176 of the textbook. (If you are using 5th edition, it's Figure 3-29 on page 166.) What is the name of the circuit component bounded by the red box? In order to write the data on I0; I1; I2 to memory word 2, what values should be on A1, A0, CS, RD and OE? Block diagram of a 4*3 memory. Each row is one of the four 3-bit words. A read or write operation always reads or writes a complete word. 3584 Which of the following is a benefit of using generics? Show transcribed image text Select one or more: the compiler checks whether elements added to a collection are the appropriate type you do not have to use a cast when removing elements from a collection you can add different kinds of elements to a collection the compiler converts primitives to objects 3585 Are the following adresses "local"? 129.130.131.132/29 129.130.131.92/29 if not - What would you have to do to to make them "local"? 3586 The following is an access verification technique, listing several files and the access allowed for a single user. Identify the control technique used here, and for each, explain the type of access allowed. a. File_1 R-E- b. File_12 RWE- c. File_13 RW-- d. File_14 A????1E- 3587 The following is an access verification technique, listing several files and the access allowed for a single user. Identify the control technique used here, and for each, explain the type of access allowed. a. File_1 R-E- b. File_12 RWE- c. File_13 RW-- d. File_14 A????1E- 3588 This is a follow up to this question. There I was asking how to do unit testing when you have a library of scientific algorithms. I have a similar problem now but with a different project. I'm working on a 3D graphics engine framework abstraction for DirectX, OpenGl, WebGl, Silverlight, WPF, and basically whatever 3D API is out there, on C#, called Rendering .NET. The scenario is the following, the project is being developed by a small team of colleagues of mine, all working in the same office. We are all computer scientists, not much into the software engineering community and practices. I even had a hard time to convince to switch from Subversion to Git, and to publish the project on Codeplex. The project is getting big (around 80K lines of C#), and it now covers most of DirectX and OpenGl up to Shader Model 5.0, so its not a one man's project like the one described in the linked question. We also want to encourage the open source community to collaborate. So far we've been testing by writing small applications that involve initializing all devices and resources, setting up a scene, and drawing. The thing is, I don't know how to make it different, I mean, how to design small test cases that test specific features of the framework, like resource allocation, primitive tessellation, shader compilation, etc., without having to recreate the entire engine initialization. For some of these cases I can think of useful mocks, but in general, how can I test the correctness of a rendering algorithm when the output is visual (an image, or an animated scene)? Right now the most clever thing we have come up is to render the same scene to a software renderer, DirectX and OpenGl, and compare them pixel by pixel, but tiny variations of the APIs make the resulting images different enough to fail the tests without being actual bugs. So, what is the "correct" testing approach here? 3589 In a fixed-array implementation of BagInterface, numberOfEntries will always been less than the capacity (bag.length). true of false 3590 Fix this PHP code for 1,500 points My php code below is fully functional, but at the bottom of it there is a globals function Please Remove the globals function without breaking the program our teacher said we are not allowed to use the globals function for this class. < ?php $orderId = ""; $itemId = ""; $qtyOnHand = 0; $qtyRequested = 0; $qtyShipped = 0; $qtyBackOrdered = 0; $message = ""; $fship = null; /// $fbo = null; /// printf("\n Enter the order id or (0) exits program: " ); fscanf(STDIN, "%s", $orderId); while($orderId != "0") { printf("\n Enter the item id or (0) exit order: " ); fscanf(STDIN, "%s", $itemId); while($itemId != "0") { printf("\nEnter Qty On Hand: "); fscanf(STDIN, "%s", $qtyOnHand); printf("\nEnter Qty Requested: "); fscanf(STDIN, "%s", $qtyRequested); DoCalcs($qtyOnHand,$qtyRequested, $qtyShipped, $qtyBackOrdered, $message); printf($message); /// PrepFiles($fship, $fbo); /// WriteFiles($qtyOnHand, $qtyRequested, $qtyShipped, $qtyBackOrdered, $message); /// printf("\n Enter the item id or (0) exit order: " ); fscanf(STDIN, "%s", $itemId); } printf("\n Enter the order id or (0) exits program: " ); fscanf(STDIN, "%s", $orderId); } fclose($fship); fclose($fbo); //fscanf(STDIN, "%s", $buster); // end mainline function PrepFiles(&$fship, &$fbo) { printf("\n PrepFiles"); $fship = fopen("shipped.txt", "w") or die("no shipped for you"); fprintf($fship, " SHIPPED\n\n"); fprintf($fship, " Order Id Item Id Qty Shipped Message\n"); $fbo = fopen("backorder.txt", "w") or die("no shipped for you"); fprintf($fbo, " BACK ORDER\n\n"); fprintf($fbo, " Order Id Item Id Qty Back Ordered\n"); } function DoCalcs($qtyOnHand,$qtyRequested, &$qtyShipped, &$qtyBackOrdered, &$message) { printf("\n DoCalcs\n"); /// if($qtyRequested <= $qtyOnHand) { $qtyShipped = $qtyRequested; $qtyBackordered = 0; $message = "Fully Filled"; } else { if($qtyOnHand !=0) { $qtyShipped = $qtyOnHand; $qtyBackOrdered = $qtyRequested - $qtyOnHand; $message = "Partially Filled"; } else { $qtyShipped = 0; $qtyBackOrdered = $qtyRequested; $message = "Out of Stock"; } }} function WriteFiles($qtyOnHand,$qtyRequested, &$qtyShipped, &$qtyBackOrdered, &$message) { global $fship, $fbo, $orderId, $itemId; /// printf("\n WriteFiles\n"); /// } fprintf($fship, "$orderId $itemId fprintf($fbo, "$orderId $itemId $qtyShipped $message\n"); /// $qtyBackOrdered\n"); ?> 3591 Fix this PHP code for 1,500 points The code below outputs to 2 txt files. 1 file shows: SHIPPED Order Id 999999 Item Id Qty Shipped Message 99999 0 Fully Filled and the other one shows: BACK ORDER Order Id 999999 Item Id Qty Back Ordered 99999 0 But I can't seem to get it to show a number for Qty shipped or Qty Back Ordered. I also can't get the message to change from Fully Filled to partially filled in either text file. Here is the code I have so far. < ?php $orderId = ""; $itemId = ""; $qtyOnHand = 0; $qtyRequested = 0; $qtyShipped = 0; $qtyBackOrdered = 0; $message = ""; $fship = null; /// $fbo = null; /// printf("\n Enter the order id or (0) exits program: " ); fscanf(STDIN, "%s", $orderId); while($orderId != "0") { printf("\n Enter the item id or (0) exit order: " ); fscanf(STDIN, "%s", $itemId); while($itemId != "0") { printf("\nEnter Qty On Hand: "); fscanf(STDIN, "%s", $qtyOnHand); printf("\nEnter Qty Requested: "); fscanf(STDIN, "%s", $qtyRequested); DoCalcs($qtyOnHand,$qtyRequested, $qtyShipped, $qtyBackOrdered, $message); printf($message); /// PrepFiles($fship, $fbo); /// WriteFiles($qtyOnHand, $qtyRequested, $qtyShipped, $qtyBackOrdered, $message); /// printf("\n Enter the item id or (0) exit order: " ); fscanf(STDIN, "%s", $itemId); } printf("\n Enter the order id or (0) exits program: " ); fscanf(STDIN, "%s", $orderId); } fclose($fship); fclose($fbo); //fscanf(STDIN, "%s", $buster); // end mainline function PrepFiles(&$fship, &$fbo) { printf("\n PrepFiles"); $fship = fopen("shipped.txt", "w") or die("no shipped for you"); fprintf($fship, " SHIPPED\n\n"); fprintf($fship, " Order Id Item Id Qty Shipped Message\n"); $fbo = fopen("backorder.txt", "w") or die("no shipped for you"); fprintf($fbo, " BACK ORDER\n\n"); fprintf($fbo, " Order Id Item Id Qty Back Ordered\n"); } function DoCalcs($qtyOnHand,$qtyRequested, &$qtyShipped, &$qtyBackOrdered, &$message) { printf("\n DoCalcs\n"); /// if($qtyRequested <= $qtyOnHand) { $qtfyShipped = $qtyRequested; $qtyBackordered = 0; $message = "Fully Filled"; } else { if($qtyOnHand !=0) { $qtyShipped = $qtyOnHand; $qtyBackOrdered = $qtyRequested - $qtyOnHand; $message = "Partialy Filled"; } else { $qtyShipped = 0; $qtyBackOrdered = $qtyRequested; $message = "Out of Stock"; } }} function WriteFiles($qtyOnHand,$qtyRequested, &$qtyShipped, &$qtyBackOrdered, &$message) { global $fship, $fbo, $orderId, $itemId; /// printf("\n WriteFiles\n"); /// fprintf($fship, "$orderId $itemId fprintf($fbo, "$orderId $itemId $qtyShipped $message\n"); /// $qtyBackOrdered\n"); } ?> 3592 First you need string conversion, write a function that takes a const C style string (char *) as a parameter and returns a pointer to a C++ style string (string) containing the parameter.The function declaration should be std::string * stringConverter(const char * c_str); and You must use C++ new and delete for memory allocation Then, create a function (char * randomString()) that generates a random C style string of characters (uppercase A-Z) between 1 and 100 characters long. Loop 10 times, creating random strings using your randomString() function, converting them to c++ style strings, then print the c++ style string. Ensure you delete any memory allocated within the loop on each iteration so you do not have a memory leak. 3593 First, a little background. I'm a .Net developer (C#) and have over 5 years experience in both web development and desktop applications. I've been wanting to look into iPhone development for some time now, but for one reason or another always got side tracked. I finally have a potential project on the horizon, and I'm now going full steam ahead learning this stuff. My question is this: I haven't done any C/C++ programming since my schooling days, I've been living in managed land ever since. How much knowledge if any is needed to be successful as an iOS developer? Obviously memory management is something that I'll have to be conscious about (although with iOS 5 there seems to be something called ARC which should make my life easier), but what else? I'm not just talking about the C API (for example, in order to get the sin of a number, I call the sin() function), that's what Google is for. I'm talking about fundamental C/C++ idioms that the average C# developer is unaware of. 3594 From the first e-Activity, identify technology or methods that can be implemented by an organization to prevent a hacking attack. Describe the reasons why all organizations havenA????1t implemented these defensive tactics already. Speculate whether pre-attack techniques are controllable from an organizationA????1s perspective. 3595 First, describe the use case: Develop a scenario describing the utilization of cloud computing in an organization. State any assumptions you need to make. Choose the controls and clearly explain the size and industry of the organization and the business requirements for utilizing cloud computing. Once you have explained your use case, address the following: Select five controls specified in the CSA cloud security control matrix and describe in detail the policies, processes, technologies, implementation plan, and potential costs of what you would put in place to implement the selected controls 3596 I just finished reading the Ruby chapter of the book 7 Languages in 7 Weeks. Aside from some syntactic sugar here and there I can't really see anything which can't be done with C# with a similar syntax. I do understand both languages are inherently different, but my question relates to its usage rather than design. Relevant questions make me believe Ruby offers little more than C#: Why aren't c# programmers drawn to ruby as java programmers are? Is Ruby's code block same as C#'s lambda expression? I hardly worked with Ruby and my understanding of the language is still very limited, so perhaps somebody who experimented with both .NET 4.0 and Ruby can answer with concrete examples. Which tasks require significantly less work with Ruby than C# 4.0? P.s.: This question got closed on StackOverflow as too subjective and argumentative, although it did attract some attention. I was hoping it would be merged to here, but instead I'll just have to repost it. 3597 Finish ArrayList Class C++ Finish the implementation of the ArrayList class by creating the definition of the FindKth and Delete member functions. and enhance the implementation of the list by implementing the following function: int Replace( double a, double b ); The function will replace all the occurrences of a by b in the list x. It will return a count of the number of replacements. _________________________________________________________________________ Arraylist.h #pragma once class ArrayList { public: // The size we use to increment arrays. I use a small increment for testing. const static int ArrayIncrement = 2; // Constructor to initialize the list. ArrayList(); // Destructor to clean up the list. ~ArrayList(); // Empties out the array list structure. void MakeEmpty( ); // Tests to see if the array list structure is empty. bool isEmpty( ); // Returns the size of the array. int listSize() { return nelts; } // Finds a specifies element of the array list. Returns -1 if not found. int Find( double y ); // Inserts an element at a specified position in the array list. void Insert( double y, int position ); // Deletes a specified element in the array list. ASSIGNED AS LAB void Delete( double y ); // Returns the kth element in the array. Returns 0 if not found. ASSIGNED AS LAB double FindKth( int position ); // You get this one for free if you implement FindKth. double operator[] (int position ) { return FindKth( position ); } // Displays the list. This is a good debugging aid void PrintList( ); private: int ArraySize;// Size of the array. int nelts; // Number of elements in the array. double *array;// Pointer to the array. // Makes sure that there is space for a new element in the list. void MakeSpace( ); }; ________________________________________________________________ ArrayList.cpp // Functions to support list operations on an array. #include #include #include "ArrayList.h" using namespace std; // Contructor sets valriables to indicate that we have an empty list. ArrayList::ArrayList() { ArraySize = 0; nelts = 0; array = NULL; } // Destructor used to clean up allocated resources/ ArrayList::~ArrayList() { delete [] array; } // Delete all the elements from the list. void ArrayList::MakeEmpty( ) { delete [] array; nelts = 0; ArraySize = 0; array = NULL; } // Tests to see if there are no elements in the array. bool ArrayList::isEmpty( ) { return nelts == 0; } // Return the index of the first occurrance of a specified list element. Returns -1 if not found. int ArrayList::Find( double y ) { for( int i = 0; i < nelts; i++ ) { if( array[i] == y ) { // The user is considering the first element to be at position 1. return i +1; } } return -1; } // Insert the specied number in the list position. void ArrayList::Insert( double y, int position ) { // Abort the program if a bad position is specified. assert( position >= 1 && position <= nelts + 1 ); // Note the array position. Recall that lists are numbered starting with 1. int ia = position - 1; // Make sure there is space in the array for a new element. MakeSpace( ); // If we are adding a new element to the list, open up space if necessary. if( ia < nelts ) { memmove( &array[ia + 1], &array[ia], (nelts - ia) * sizeof(double ) ); } array[ia] = y; nelts++; } // Display the elements of the list. void ArrayList::PrintList( ) { // Display the list. for( int i = 0; i < nelts; i++ ) { cout << i + 1<< ". " << array[i] << endl; } } void ArrayList::MakeSpace( ) { // If there is space for another array element, return. if( nelts < ArraySize ) return; // Create storage to make a larger array. double *tmp; tmp = new double[ArraySize + ArrayIncrement]; // Note that exceptions now occur when new fails unless you tell the compiler otherwise. assert( tmp != NULL ); // If the previous array was not empty, must copy its contents. if( nelts > 0 ) { memcpy( tmp, array, nelts * sizeof(double) ); delete [] array; } ArraySize += ArrayIncrement; array = tmp; } __________________________________________________________________ testList.cpp // To test the implementation of the ADT list using arrays. #include #include "ArrayList.h" using namespace std; int main( ) { ArrayList aaa; // Initialize the list. cout << "Array size = " << aaa.listSize() << endl; // Insert a lot of stuff; aaa.Insert( 111, 1 ); aaa.Insert( 222, 1 ); aaa.PrintList( ); cout << endl; aaa.Insert( 333, 3 ); aaa.Insert( 444, 2 ); aaa.Insert( 555, 1 ); aaa.PrintList( ); } 3598 Finish ArrayList Class C++ Finish the implementation of the ArrayList class by creating the definition of the FindKth and Delete member functions. and enhance the implementation of the list by implementing the following function: int Replace( double a, double b ); The function will replace all the occurrences of a by b in the list x. It will return a count of the number of replacements. ________________________________________________________________________________ Arraylist.h #pragma once class ArrayList { public: // The size we use to increment arrays. I use a small increment for testing. const static int ArrayIncrement = 2; // Constructor to initialize the list. ArrayList(); // Destructor to clean up the list. ~ArrayList(); // Empties out the array list structure. void MakeEmpty( ); // Tests to see if the array list structure is empty. bool isEmpty( ); // Returns the size of the array. int listSize() { return nelts; } // Finds a specifies element of the array list. Returns -1 if not found. int Find( double y ); // Inserts an element at a specified position in the array list. void Insert( double y, int position ); // Deletes a specified element in the array list. ASSIGNED AS LAB void Delete( double y ); // Returns the kth element in the array. Returns 0 if not found. ASSIGNED AS LAB double FindKth( int position ); // You get this one for free if you implement FindKth. double operator[] (int position ) { return FindKth( position ); } // Displays the list. This is a good debugging aid void PrintList( ); private: int ArraySize;// Size of the array. int nelts; // Number of elements in the array. double *array;// Pointer to the array. // Makes sure that there is space for a new element in the list. void MakeSpace( ); }; 3599 Finish ArrayList Class C++ Finish the implementation of the ArrayList class by creating the definition of the FindKth and Delete member functions. and enhance the implementation of the list by implementing the following function: int Replace( double a, double b ); The function will replace all the occurrences of a by b in the list x. It will return a count of the number of replacements. _______________________________________________________________________________________________ Arraylist.h #pragma once class ArrayList { public: // The size we use to increment arrays. I use a small increment for testing. const static int ArrayIncrement = 2; // Constructor to initialize the list. ArrayList(); // Destructor to clean up the list. ~ArrayList(); // Empties out the array list structure. void MakeEmpty( ); // Tests to see if the array list structure is empty. bool isEmpty( ); // Returns the size of the array. int listSize() { return nelts; } // Finds a specifies element of the array list. Returns -1 if not found. int Find( double y ); // Inserts an element at a specified position in the array list. void Insert( double y, int position ); // Deletes a specified element in the array list. ASSIGNED AS LAB void Delete( double y ); // Returns the kth element in the array. Returns 0 if not found. ASSIGNED AS LAB double FindKth( int position ); // You get this one for free if you implement FindKth. double operator[] (int position ) { return FindKth( position ); } // Displays the list. This is a good debugging aid void PrintList( ); private: int ArraySize;// Size of the array. int nelts; // Number of elements in the array. double *array;// Pointer to the array. // Makes sure that there is space for a new element in the list. void MakeSpace( ); }; 3600 Finding the kth smallest value of an array. This question asks for a recursive solution for finding the kth smallest value in an arbitrary array (anArray). Obviously, you could solve this problem by sorting the array, then the kth smallest value would be anArray[k-1]. Although this approach is legitimate, it does more than the problem requires. A more efficient solution is possible. You are asked to implement the following recursive solution: 1) Selecting a pivot value in the array. The choice of this pivot value is arbitrary. 2) Partition the array such that smaller values go to the left half and larger values go to the right half; and 3) Recursively applying the strategy to one of the partitions by checking if the length of the left half is larger than k. The declaration of the function should look like: int kSmall(int A[], int k, int low, int high); // return the kth smallest value in array A. I am stuck and not sure what to do on this question. Here is the code I have so far but it doesn't compile and I don't know what to do, thanks for the help. #include using namespace std; int kSmall(int[], int, int, int); int partition(int[], int, int, int); int kSmall(int A[], int k, int low, int high) { int pivot; int first; low = first; first = A[first]; if (k < 0 || k >(high - low + 1)) return -1; //pick a pivot point int idx = partition(A, pivot, low, high); if ((idx - low + 1) == k) //left { return A[idx]; } else if (k < (idx - low + 1)) //right { return kSmall(A, k, low, idx - 1); } else if (k >(idx - low + 1)) return kSmall(A, k - (idx - first + 1), idx + 1, high); } //find the index of a pivot int partition(int A[], int pivot, int low, int high) { int left = low, right = high; while (left < right) { while (A[left] < pivot, left++) while (A[right] > pivot, right--) if (left < right) swap(A[left], A[right]); } return left; } void swap(int *a, int *b) { int temp = *a; *a = *b; *b = temp; } int main() { int A[6] = { 1, 5, 3, 7, 9, 4 }; for (int i = 0; i < 6; i++) cout << A[i] << " "; cout << endl; cout << "The 2nd smallest value in the array is: " << kSmall(A, 2, 0, 5) << endl; return 0; } 3601 Finding Common Elements Between k Collections IntroductionA????1A Real-World Problem: In the National Football League, when teams are seeded for the playoffs, there is always the possibility that two or more teams may have the same won-lost-tied record. There is an ordered, step-by-step, tiebreaker process by which such ties are broken. If the first step in the process fails to break the tie, the next step is applied, and so on, until the tie is broken. This assignment focuses on one particular step, which happens to be the third step in the process: the won-lost-tied percentages in common games between the two teams are compared. Two games are considered common between two teams if each of those teams faced the same opponent. This problem can be abstracted into a more general problem: Given two collections of elements, A and B, generate a third collection, C, containing only those elements common in collections A and B, with duplicates allowed. Note that any type of collection (list, array, etc.) can be used, and no guarantees are made regarding the order of the elements in either collection. If we build a collection for each team in question that contains the name or identifier of the opponent that was faced in each game the team played, we end up with two separate collections of opponents. The goal is to generate a third collection that contains only the common opponents faced by both teams. For example, consider two teams from the AFC North Division from the 2011 season, the Pittsburgh Steelers and the Baltimore Ravens. Both teams finished the regular season with won-lost-tied records of 12-4-0. As it turns out, the Ravens won the tiebreaker not on the rule weA????1re describing in this assignment, but on the rule that the Ravens won both head-to-head matchups during the season. But letA????1s assume the tiebreaker had to be resolved by the won-lost-tied percentage in common games. Table 1 shows the entire regular season schedules for both teams, and indicates common opponents in bold. Although in this example, most of the games are common;i.e., both teams faced common opponents, this is not a requisite condition for the problem. The result returned by an algorithm solving this problem should return a third collection containing only those teams which both the Steelers and the Ravens faced during the season. The order in which these common teams are present in this collection is not important, and duplicates should be included. Table 2 shows one possible correct result. Game Pittsburgh Steelers Baltimore Ravens 1 Baltimore Ravens Pittsburgh Steelers 2 Seattle Seahawks Tennessee Titans 3 Indianapolis Colts St. Louis Rams 4 Houston Texans New York Jets 5 Tennessee Titans bye week 6 Jacksonville Jaguars Houston Texans 7 Arizona Cardinals Jacksonville Jaguars 8 New England Patriots Arizona Cardinals 9 Baltimore Ravens Pittsburgh Steelers 10 Cincinnati Bengals Seattle Seahawks 11 bye week Cincinnati Bengals 12 Kansas City Chiefs San Francisco 49ers 13 Cincinnati Bengals Cleveland Browns 14 Cleveland Browns Indianapolis Colts 15 San Francisco 49ers San Diego Chargers 16 St. Louis Rams Cleveland Browns 17 Cleveland Browns Cincinnati Bengals Table 1. Regular season opponents of the Pittsburgh Steelers and Baltimore Ravens, listed in the order in which the games were played. Note that each team had a A????1byeA????1 week, during which they did not play. Common opponents are indicated in bold. Seattle Seahawks Indianapolis Colts Houston Texans Tennessee Titans Jacksonville Jaguars Arizona Cardinals Cincinnati Bengals Cincinnati Bengals Cleveland Browns San Francisco 49ers St. Louis Rams Cleveland Browns Table 2. One possible correct result showing all common elements (duplicates included) between the two collections in Table 1. A Quadratic Solution This problem can be solved in a number of ways. The most straightforward approach to this problem would be to set up a nested loop structure, where the collection #1 is traversed, and for each element in collection #1, collection #2 is traversed to see whether or not the element is present. Table 3 shows the regular season schedules for both the Steelers and the Ravens as generically labeled collections. Below is the algorithm, as pseudocode. Note that once a common element has been found and added to the collection of common elements, the inner loop is immediately terminated, to avoid adding the same element to the common collection multiple times. for each element X in C1 { for each element Y in C2 { if X.compareTo(Y) == 0 { add X to common collection Z break } } } The running time for this algorithm is quadratic. For 2 collections, both of length N, the worst case running time would be: O(N2). The running time worsens linearly with each additional collection. It should be apparent that for each additional collection, the worst case running time effectively adds 1 to the coefficient of the quadratic term in the Big-Oh formula, assuming all collections are of the same length. For example, for 3 collections, all of length N, the running time would be O(N * 2N), or O(2N2); for 4 collections, all of length N, the running time would be O(3N2); and so on. Note that the coefficient of the quadratic term is always equal to the number of collections minus 1. This is due to the fact that if any element comparisons are performed, ther must be at least 2 colelctions. If there is only a single collection, then the collection of common elements is simply the collection itself. The general formula, allowing for an arbitrary number of collections of differing lengths, is: Formula 1: For k collections C1, C2, C3, ..., Ck, of lengths N1, N2, N3, ..., Nk, respectively, where one collection of which is chosen as the query collection, Cq, of length Nq, the worst case running time for finding all elements common to all k collections is proportional to: O(Nq * (?[N1, N2, N3, ..., Nk] - Nq)). In Formula 1, the length, Nq, is the length of the collection chosen to be the A????1queryA????1 collection, which corresponds to the collection labeled C1 in the pseudocode. This designation of a query collection is essential for the algorithm to function, since any comparison requires two elements (not counting selfcomparisons). If all the collections have the same length, the general formula becomes more specific as follows: Formula 2: For k collections C1, C2, C3, ..., Ck, all of which have length = N, the worst case running time for finding all elements common to all k collections is proportional to: O(N * (kN - N)), or O((k - 1)N2). Although any one of the collections can be designated as the query collection, the running time will be minimized if the smallest collection is used as the query collection. This is stated more generally by Corollary 1: Corollary 1: For any k collections, where Nq represents the size of the smallest collection, the number of elements common to all collections will be less than or equal to Nq. C1 C2 Baltimore Ravens Pittsburgh Steelers Seattle Seahawks Tennessee Titans Indianapolis Colts St. Louis Rams Houston Texans New York Jets Tennessee Titans bye week Jacksonville Jaguars Houston Texans Arizona Cardinals Jacksonville Jaguars New England Patriots Arizona Cardinals Baltimore Ravens Pittsburgh Steelers Cincinnati Bengals Seattle Seahawks bye week Cincinnati Bengals Kansas City Chiefs San Francisco 49ers Cincinnati Bengals Cleveland Browns Cleveland Browns Indianapolis Colts San Francisco 49ers San Diego Chargers St. Louis Rams Cleveland Browns Cleveland Browns Cincinnati Bengals Table 3. Regular season opponents of the Steelers and Ravens, with the bye weeks eliminated, generically referred to as C1 and C2, respectively. What You Need to Do: If we were only interested in two relatively small collections, as shown in Table 3, the quadratic algorithm described above may be adequate. However, if N is very large, and/or there are many collections (i.e., k is very large), the quadratic algorithm may be too slow to be useful. There are a number of strategies that can be employed to reduce the running time, and at this point we have covered enough topics to design a more efficient algorithm. Based on the material covered thus far in this course, design and implement a more efficient algorithm for finding the common elements of a set of collections. Your algorithm should satisfy the following criteria: 1. It should be able to accept as input 0 to k collections, stored as simple arrays. 2. The elements of the collections should all be of type Comparable, and they should all be derived from the same base class (not counting the Object class). Implementation of the Comparable interface is necessary since the elements must be compared to each other in order to determine commonality. They must all be derived from the same base class in order for comparisons between two items to be meaningful. 3. Duplicate elements should be allowed; e.g., if there are M instances of the value, A????1XYZA????1, in all the input collections, there should be M instances of the value, A????1XYZA????1, in the collection of common elements. 4. The collections should be allowed to be of varying lengths; i.e., some collections may have more items than others. 5. One of the collections must be designated as the A????1queryA????1 collection, which is the collection containing the elements to which the elements in the other collections are compared. 6. The total number of element comparisons performed should be less than the value for the quadratic solution described above. That is, the total number of comparisons in the worst case should be less than kN2. Do not be concerned about average performance. Also, the total number of comparisons is defined, for this assignment, to be only those comparisons that are performed once the traversal of the query collection begins, and the other collections are checked for the presence of the elements in the query collection. The framework for your algorithm should satisfy the following criteria, for ease in testing: 1. Create a class called CommonElements, to contain your algorithm and associated methods and attributes. 2. In your CommonElements class, encapsulate your algorithm within a method called findCommonElements, that has the following signature: public Comparable[] findCommonElements(Object[] collections). The argument to this method, collections, will be the set of k collections discussed earlier. Each collection will be represented as an array of objects of type Comparable. 3. The value returned by your findCommonElements method should be a collection of Comparable elements that contains only the elements common to all the input collections. 4. Since you are being asked to evaluate your algorithm based on the number of comparisons performed, you will need to have your findCommonElements method maintain a running total of comparisons performed for each set of collections tested. You should create an attribute called comparisons in your CommonElements class to store the number of comparisons, and provide a getter method called getComparisons() to return this value. In order to keep a running total of comparisons, you will need to instrument your code by incrementing the comparisons attribute each time a comparison between two elements is made. Since element comparisons are typically performed in if statements, you may need to increment comparisons immediately before each comparison is actually performed. Although that may sound counter-intuitive, if you try to increment comparisons inside the if statement, after the element comparison has been made, you will miss all the comparisons that cause the condition inside the if statement to evaluate to false. It is important that you adhere to the framework specification above. To facilitate testing of your program, I will use a test harness that will do the following: 1. Creates an instance of your CommonElements class. 2. Calls your findCommonElements method with a set of test collections as input. 3. Verifies that the collection that is returned by findCommonElements correctly contains the elements common to all the input collections. 4. Retrieves the number of comparisons that were performed, via your getComparisons() method. 5. Compares the number of comparisons performed to the target value stated in criterion #5 above for the algorithm. Thus, it is essential that you name your class and methods as described above, or my test harness will not work, and it will take longer to test your program. A Note About Testing You will need to develop several sets of test collections for testing your algorithm. The grading rubric mentions covering the case where all the test collections have the same length, as well as covering the case where the test collections are of different lengths. You will also need to think about what constitutes the worst case scenario for this algorithm, since only that scenario will make your analysis of total comparisons performed a meaningful one. You can use the formulas in the grading rubric to tell you how many comparisons you should expect in the quadratic and linear cases. For example, if you have 5 total collections (1 query collection and 4 test collections), each of which contains 10 elements, the total number of comparisons performed in the worst case should be: (k - 1)N2, which for k = 5 and N = 10 is: (5 - 1)102, or 400 comparisons. For the linear algorithm, you should only have N*(k - 1), which is 10*(5 - 1), or 40 comparisons. What you need to submit: 1. Your CommonElements.java file, implemented as specified above. 2. The set of test collections you used to test your algorithm. 3602 "Find any zeroes and the minimum value of the rational function." By using MATLAB... Find the x-coordinate for where f(x)=(x+2)/x^2 achieves its minimum value. (Please include the Commands) 3603 Thanks !! Images: Find the values of the angles shown in the diagram using rules of geometry ? 3604 Find the Sum of Products and Product of Sum of these functions: 1. (AA????1 + BA????1 + DA????1) (A + BA????1 + CA????1) (AA????1 + B + DA????1) (B + CA????1 + DA????1) 2. (AA????1 + BA????1 + D) (AA????1 + DA????1) (A + B + DA????1) (A + BA????1 + C+ D) If possible, please show work! Thank you so much! 3605 Find a solution (POST CORRESPONDENCE PROBLEM) Please answer the second question correctly and do not copy from anywhere else! tell me how sure you are when you solve this (IGNORE a and b) Show transcribed image text Find a solution (POST CORRESPONDENCE PROBLEM) Please answer the second question correctly and do not copy from anywhere else! tell me how sure you are when you solve this (IGNORE a and b) a. Given a TM M, does M ever halt for any input? b. Given a TM M, does M ever halt after 10 moves? 2. ab/abab b/a, aba/b, aa/a be an instance of the Post Correspondence Problem. Find a Solution 3606 Find a regular expression for each of the following languages over the alphabet {a,b} (a) Strings with even length; (b) Strings whose length is a multiple of 3; (c) Strings containing the substring aba; and(d) Strings with an odd number of aA????1s. 3607 Find position of text based on a list of mutiple values I would like to return the position of a text string based on a list a list of vales to search for. For example, search for "3PPK", "6PPK" or "1PPK" in the text "TEST FORMULA 6PPK" and the formula would return 14. . I would like to manage the list of values to search for on a different tab so it's easy for a user to reference and update without having to update formula, but isn't necessary if not possible... Thanks!!! 3608 Find the minimized expression for following function using Espresso F(A,B,C,D,E) = ?m(0,1,3,9,11,12,14,15) Validate the result using REDUCE, EXPAND, IRREDUNDANT COVER 3609 Thanks !! iterations, showing every stage with K-map Find the images of B(1,-1) C(-1,2) D(-5,-2) under the translation EA.... E is (0,6) and A is (5,3) .?? 3610 Find the CPI for the following system: Cpu with CPI execution is 1.1 with clock rate = 2GHz (0.5ns). Each instruction requires 2 memory accesses. Hit ratio of the first cache level L1 is 99%. Hit rate of L2 is 99.5% and its access time is 8ns (16 cycles). Main memory access time = 100ns (200 cycles). a. if we have L2 only ( no miss in L2 in this case) b. if we have L2 and the memory (no miss in the memory) c. in each case, calculate the CPU time to execute an instruction. 3611 (I) Find the a. midpoint and b. distance of each line segment, AB with the given endpoint 1. A(2,-5), B(6,-7) 2. A(5,5), B(-9,3) 3. A(-2,3), B(-10,10) (II) The midpoint of line segment AB is M. The coordinates of M are (3,-2) and the coordinates of A are (-1.0). What are the coordinates of B?? Thanks !! 3612 (I) Find the a. midpoint and b. distance of each line segment, AB with the given endpoint 1. A(2,-5), B(6,-7) 2. A(5,5), B(-9,3) 3. A(-2,3), B(-10,10) (II) The midpoint of line segment AB is M. The coordinates of M are (3,-2) and the coordinates of A are (-1.0). What are the coordinates of B?? Thanks for help !! 3613 Final Project This assignment demonstrates your understanding of the concepts from the CMIS 141 class. This homework consists of 1 programming assignment worth 25 points. Before attempting this project, be sure you have completed all of the reading assignments, hands-on labs, discussions, and assignments to date. 1. (25 points) Design a Java application that will read a file containing data related to the passengers on the Titanic. The description of the file is shown below. The application should provide statistical results on the passengers including: a. Total number of passengers on the Titanic b. Total number of passengers who perished on the Titanic c. Total number of Passengers who survived the sinking of the Titanic d. Number of passengers who survived the sinking of the Titanic as a function of the passenger class (e.g. 1,2,3) e. Number of passengers who survived the sinking of the Titanic as a function of the passenger gender (e.g., male, female) f. A list of the names of passengers who paid greater than $200 for their tickets g. A list of the names of passengers who were less than 10 years old who survived the sinking of the Titanic h. A list of the names of passengers who were less than 10 years old who perished on the Titanic i. The count of the number of passengers as a function of the first letter of their last name. (e.g., A: 13, B:33 A????1) j. Additional statistical results you add to enhance the functionality The following are some design criteria and specific requirements that need to be addressed: a. Use command line arguments to send in the name of the Titanic file. b. Use a 2D array to store the Titanic data. (Hint: You will probably need to store the array as String values and then convert to other types as needed since some data is null) c. You should create at least 2 Java classes A????1 Titanic and TestTitanic. You are welcome to create additional classes if you want to further separate the functionality. d. You should create separate methods for each of the required functionality. (e.g. getTotalPassengers() will return the total number of passengers on the Titanic.) e. A user-friendly and well-organized menu should be used for users to select which data to return. A sample menu is shown in run example. You are free to enhance your design and you should add additional menu items and functionality. f. The menu system should be displayed at the command prompt, and continue to redisplay after results are returned or until Q is selected. If a user enters an invalid menu item, the system should redisplay the menu with a prompt asking them to enter a valid menu selection g. The application should keep track of the elapsed time (in seconds) between once the application starts and when the user quits the program. After the program is exited, the 2 application should provide a prompt thanking the user for trying the Titanic program and providing the total time elapsed. Here is sample run: java TestTitanic Titanic.txt ********** Welcome to the Titanic Statistical Application ************************** Enter the number of the question you want answered. Enter A????1QA???? 1 to quit the program : 1. How many passengers were on the Titanic? 2. What percentage of passengers perished on the Titanic? 3. What percentage passengers survived the sinking of the Titanic? 4. What percentage of passengers survived for each of the three classes? 5. What percentage of passengers survived as a function of gender? 6. What specific passengers paid more than $200 for their tickets? 7. What specific passengers who were less than 10 years old perished on the titanic? 8. What specific passengers who were less than 10 years old survived the sinking of the titanic? 9. For each letter in the alphabet, how many passengers last names started with that letter? Q. Quit the program Enter your selection: 1 There were 1310 Passengers on the Titanic. Enter the number of the question you want answered. Enter A????1QA????1 to quit the program : 1. How many passengers were on the Titanic? 2. What percentage of passengers perished on the Titanic? 3. What percentage passengers survived the sinking of the Titanic? 4. What percentage of passengers survived for each of the three classes? 5. What percentage of passengers survived as a function of gender? 6. What specific passengers paid more than $200 for their tickets? 7. What specific passengers who were less than 10 years old perished on the titanic? 8. What specific passengers who were less than 10 years old survived the sinking of the titanic? 9. For each letter in the alphabet, how many passengers last names started with that letter? Q. Quit the program Enter your selection: 6 The following passengers paid more than $200 for their tickets: Allen, Miss. Elisabeth Walton Astor, Col. John Jacob Astor, Mrs. John Jacob (Madeleine Talmadge Force) Baxter, Mr. Quigg Edmond Baxter, Mrs. James (Helene DeLaudeniere Chaput) Bidois, Miss. Rosalie Bird, Miss. Ellen Bowen, Miss. Grace Scott3 Cardeza, Mr. Thomas Drake Martinez Cardeza, Mrs. James Warburton Martinez (Charlotte Wardle Drake) Chaudanson, Miss. Victorine Douglas, Mrs. Frederick Charles (Mary Helene Baxter) Endres, Miss. Caroline Louise Farthing, Mr. John Fortune, Miss. Alice Elizabeth Fortune, Miss. Ethel Flora Fortune, Miss. Mabel Helen Fortune, Mr. Charles Alexander Fortune, Mr. Mark Fortune, Mrs. Mark (Mary McDougald) Geiger, Miss. Amalie Keeping, Mr. Edwin Kreuchen, Miss. Emilie Lesurer, Mr. Gustave J Madill, Miss. Georgette Alexandra Robbins, Mr. Victor Robert, Mrs. Edward Scott (Elisabeth Walton McMillan) Ryerson, Master. John Borie Ryerson, Miss. Emily Borie Ryerson, Miss. Susan Parker "Suzette" Ryerson, Mr. Arthur Larned Ryerson, Mrs. Arthur Larned (Emily Maria Borie) Straus, Mr. Isidor Straus, Mrs. Isidor (Rosalie Ida Blun) Ward, Miss. Anna Widener, Mr. George Dunton Widener, Mr. Harry Elkins Widener, Mrs. George Dunton (Eleanor Elkins) Enter the number of the question you want answered. Enter A????1QA????1 to quit the program : 1. How many passengers were on the Titanic? 2. What percentage of passengers perished on the Titanic? 3. What percentage passengers survived the sinking of the Titanic? 4. What percentage of passengers survived for each of the three classes? 5. What percentage of passengers survived as a function of gender? 6. What specific passengers paid more than $200 for their tickets? 7. What specific passengers who were less than 10 years old perished on the titanic? 8. What specific passengers who were less than 10 years old survived the sinking of the titanic? 9. For each letter in the alphabet, how many passengers last names started with that letter? Q. Quit the program Enter your selection: Q Thank you for trying the Titanic Program. Elapsed time in seconds was: 95 3614 Final Project This assignment demonstrates your understanding of the concepts from the CMIS 141 class. This homework consists of 1 programming assignment worth 25 points. Before attempting this project, be sure you have completed all of the reading assignments, hands-on labs, discussions, and assignments to date. 1. (25 points) Design a Java application that will read a file containing data related to the passengers on the Titanic. The description of the file is shown below. The application should provide statistical results on the passengers including: a. Total number of passengers on the Titanic b. Total number of passengers who perished on the Titanic c. Total number of Passengers who survived the sinking of the Titanic d. Number of passengers who survived the sinking of the Titanic as a function of the passenger class (e.g. 1,2,3) e. Number of passengers who survived the sinking of the Titanic as a function of the passenger gender (e.g., male, female) f. A list of the names of passengers who paid greater than $200 for their tickets g. A list of the names of passengers who were less than 10 years old who survived the sinking of the Titanic h. A list of the names of passengers who were less than 10 years old who perished on the Titanic i. The count of the number of passengers as a function of the first letter of their last name. (e.g., A: 13, B:33 A????1) j. Additional statistical results you add to enhance the functionality The following are some design criteria and specific requirements that need to be addressed: a. Use command line arguments to send in the name of the Titanic file. b. Use a 2D array to store the Titanic data. (Hint: You will probably need to store the array as String values and then convert to other types as needed since some data is null) c. You should create at least 2 Java classes A????1 Titanic and TestTitanic. You are welcome to create additional classes if you want to further separate the functionality. d. You should create separate methods for each of the required functionality. (e.g. getTotalPassengers() will return the total number of passengers on the Titanic.) e. A user-friendly and well-organized menu should be used for users to select which data to return. A sample menu is shown in run example. You are free to enhance your design and you should add additional menu items and functionality. f. The menu system should be displayed at the command prompt, and continue to redisplay after results are returned or until Q is selected. If a user enters an invalid menu item, the system should redisplay the menu with a prompt asking them to enter a valid menu selection g. The application should keep track of the elapsed time (in seconds) between once the application starts and when the user quits the program. After the program is exited, the 2 application should provide a prompt thanking the user for trying the Titanic program and providing the total time elapsed. Here is sample run: java TestTitanic Titanic.txt ********** Welcome to the Titanic Statistical Application ************************** Enter the number of the question you want answered. Enter A????1QA???? 1 to quit the program : 1. How many passengers were on the Titanic? 2. What percentage of passengers perished on the Titanic? 3. What percentage passengers survived the sinking of the Titanic? 4. What percentage of passengers survived for each of the three classes? 5. What percentage of passengers survived as a function of gender? 6. What specific passengers paid more than $200 for their tickets? 7. What specific passengers who were less than 10 years old perished on the titanic? 8. What specific passengers who were less than 10 years old survived the sinking of the titanic? 9. For each letter in the alphabet, how many passengers last names started with that letter? Q. Quit the program Enter your selection: 1 There were 1310 Passengers on the Titanic. Enter the number of the question you want answered. Enter A????1QA????1 to quit the program : 1. How many passengers were on the Titanic? 2. What percentage of passengers perished on the Titanic? 3. What percentage passengers survived the sinking of the Titanic? 4. What percentage of passengers survived for each of the three classes? 5. What percentage of passengers survived as a function of gender? 6. What specific passengers paid more than $200 for their tickets? 7. What specific passengers who were less than 10 years old perished on the titanic? 8. What specific passengers who were less than 10 years old survived the sinking of the titanic? 9. For each letter in the alphabet, how many passengers last names started with that letter? Q. Quit the program Enter your selection: 6 The following passengers paid more than $200 for their tickets: Allen, Miss. Elisabeth Walton Astor, Col. John Jacob Astor, Mrs. John Jacob (Madeleine Talmadge Force) Baxter, Mr. Quigg Edmond Baxter, Mrs. James (Helene DeLaudeniere Chaput) Bidois, Miss. Rosalie Bird, Miss. Ellen Bowen, Miss. Grace Scott3 Cardeza, Mr. Thomas Drake Martinez Cardeza, Mrs. James Warburton Martinez (Charlotte Wardle Drake) Chaudanson, Miss. Victorine Douglas, Mrs. Frederick Charles (Mary Helene Baxter) Endres, Miss. Caroline Louise Farthing, Mr. John Fortune, Miss. Alice Elizabeth Fortune, Miss. Ethel Flora Fortune, Miss. Mabel Helen Fortune, Mr. Charles Alexander Fortune, Mr. Mark Fortune, Mrs. Mark (Mary McDougald) Geiger, Miss. Amalie Keeping, Mr. Edwin Kreuchen, Miss. Emilie Lesurer, Mr. Gustave J Madill, Miss. Georgette Alexandra Robbins, Mr. Victor Robert, Mrs. Edward Scott (Elisabeth Walton McMillan) Ryerson, Master. John Borie Ryerson, Miss. Emily Borie Ryerson, Miss. Susan Parker "Suzette" Ryerson, Mr. Arthur Larned Ryerson, Mrs. Arthur Larned (Emily Maria Borie) Straus, Mr. Isidor Straus, Mrs. Isidor (Rosalie Ida Blun) Ward, Miss. Anna Widener, Mr. George Dunton Widener, Mr. Harry Elkins Widener, Mrs. George Dunton (Eleanor Elkins) Enter the number of the question you want answered. Enter A????1QA????1 to quit the program : 1. How many passengers were on the Titanic? 2. What percentage of passengers perished on the Titanic? 3. What percentage passengers survived the sinking of the Titanic? 4. What percentage of passengers survived for each of the three classes? 5. What percentage of passengers survived as a function of gender? 6. What specific passengers paid more than $200 for their tickets? 7. What specific passengers who were less than 10 years old perished on the titanic? 8. What specific passengers who were less than 10 years old survived the sinking of the titanic? 9. For each letter in the alphabet, how many passengers last names started with that letter? Q. Quit the program Enter your selection: Q Thank you for trying the Titanic Program. Elapsed time in seconds was: 95 3615 For your final discussion topic, repond to at least one of the following topics. 1) In reviewing current help wanted advertising in the papers, online, word of mouth, and other sources, what do you feel are the most desirable RDBMSs to have experience with for a career as a DBA or database developer and what skill sets are required? Why? 2) What is PL/SQL and how can that be used in DBA and database development work? 3) What are stored procedures and triggers and how are they used in database applications? 4) What trends in Database technology seem to be most prominent? Be sure to explain the trend and reference your sources. 3616 FILL IN THE QUESTION MARKS #include using namespace std; // be sure to add any #include directives that yuo may need ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int GetRangeMaximum() // // Promts the user to enter an integer value between 10 and 1000 (inclusive). // // if the user enters a number that is not valid, // then display an error message and ask again. // // if the user enters a valid choice, // then return that value. // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int GetSecretNumber(int min, int max) // // Generates and returns a "random" number between min value and max value (inclusive). // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int GetNumberOfAttemptsAllowed() // // Prompts the user to enter the number of attemts that they will have to guess the secret number. // This value must be in the range of 10 to 100 (inclusive) // // if the user enters a number that is not a valid, // then display an error message and ask again. // // if the user enters a valid number, then return that value. // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int GetUsersGuess() // // Prompts the user to enter their guess. // Then return that value. // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int GiveFeedback(int usersGuess, int secretNumber) // // Gives user feedback based on thier guess. // // if the user's guess is the same as the secret number then diplay "CORRECT!". // if the user's guess is less than the secret number then diplay "TOO LOW!". // if the user's guess is greater than the secret number then diplay "TOO HIGH!". // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: bool AskUserIfTheyWillPalyAgain() // // Asks the user if they would like to play again. // // if they answer "yes" then return true; // if they answer "no" then return false; // if they give an aswer other than "yes" or "no" then ask again. // //-------------------------------------------------------------------------------------------------- ??? // this main function is complete and should not require any modifications int main() { int secretNumber = 0, usersGuess = 0; int numberOfAttemptsAllowed = 0, numberOfGuessesUsed = 0; int max = 0; bool playAgain = true; do { max = GetRangeMaximum(); secretNumber = GetSecretNumber(1, max); numberOfAttemptsAllowed = GetNumberOfAttemptsAllowed(); do { usersGuess = GetUsersGuess(); numberOfGuessesUsed++; GiveFeedback(usersGuess, secretNumber); } while (usersGuess != secretNumber && numberOfGuessesUsed < numberOfAttemptsAllowed); playAgain = AskUserIfTheyWillPalyAgain(); } while (playAgain); return 0; } 3617 FIll in the blanks: sleet% cat e6.f90 ! The following program generates a table of ! values for points (x,y) on a line through (x1,y1) and ! (x2,y2). ! The function interp returns the interpolated value y ! for the input value of x and the given points on the line PROGRAM P6 IMPLICIT NONE INTEGER :: i=0 REAL :: x1=1.0,y1=1.0,x2=4.0,y2=9.0 REAL :: del=.5, x0=1.0,x,y x=x0 print "(1X,_____1_____)","x","y" do i=1,10 y=_____2_____ print "(1X,2f10.2)", x,y _____3_____ end do _____4_____ _____5_____ function interp(x,x1,y1,x2,y2) real, _____6_____:: x, x1,y1,x2,y2 real m m=(y2-y1)/(x2-x1) interp=m*_____7_____ +y1 _____8_____ function interp END PROGRAM P6 sleet% f90 e6.f90 sleet% a.out xy 1.00 1.00 1.50 2.33 2.00 3.67 2.50 5.00 3.00 6.33 3.50 7.67 4.00 9.00 4.50 10.33 5.00 11.67 5.50 13.00 sleet% ANSWER SECTION: SELECTIONS FOR BLANK NUMBER 1 (a) 10A,10A (b) A10 (c) 2A11 (d) 2A10 (e) 2I10 SELECTIONS FOR BLANK NUMBER 2 (a) y(x,x1,y1,x2,y2) (b) function(x,x1,y1,x2,y2) (c) interp(x) (d) interp(x,y,x1,y1,x2,y2) (e) interp(x,x1,y1,x2,y2) SELECTIONS FOR BLANK NUMBER 3 (a) y=y+del (b) x+=del (c) i=i+1 (d) x=x+1.0 (e) x=x+del SELECTIONS FOR BLANK NUMBER 4 (a) SUBPROGRAMS (b) FUNCTIONS (c) USES (d) HOLDS (e) CONTAINS SELECTIONS FOR BLANK NUMBER 5 (a) real (b) return real (c) real y (d) real returns y (e) INTENT(real) SELECTIONS FOR BLANK NUMBER 6 (a) intent:IN (b) IN (c) intent(IN) (d) PARAMETER (e) int(IN) SELECTIONS FOR BLANK NUMBER 7 (a) x (b) x1 (c) (x-y1) (d) (y-x1) (e) (x-x1) SELECTIONS FOR BLANK NUMBER 8 (a) stop (b) end do (c) return (d) contains (e) end 3618 Fill in the blanks sleet% cat e5.f90 PROGRAM P5 IMPLICIT NONE INTEGER :: i real :: val=100.00, val03, val05, val07 print "(1X,_____1_____,'Value of 100 compounded annually')" print "(1X,_____2_____',5X,'At 3%',5X,'At 5%',5X,'At 7%')" do i=1,10 val03=val*(1.03)**i val05=val*(1.05)**i val07=val*(1.07)**i print "(1X, _____3_____, _____4_____F_____5_____)",i, val03, val05, val07 end do END PROGRAM P5 sleet% f90 e5.f90 sleet% a.out Value of 100 compounded annually Year At 3% At 5% At 7% 1 103.00 105.00 107.00 2 106.09 110.25 114.49 3 109.27 115.76 122.50 4 112.55 121.55 131.08 5 115.93 127.63 140.26 6 119.41 134.01 150.07 7 122.99 140.71 160.58 8 126.68 147.75 171.82 9 130.48 155.13 183.85 10 134.39 162.89 196.72 sleet% ANSWER SECTION: SELECTIONS FOR BLANK NUMBER 1 (a) 5X (b) T4 (c) T5 (d) 5 (e) " " SELECTIONS FOR BLANK NUMBER 2 (a) 'Year (b) " Year" (c) ' Year' (d) ' Year (e) Year SELECTIONS FOR BLANK NUMBER 3 (a) I6 (b) F5 (c) I5.0 (d) I5 (e) I4 SELECTIONS FOR BLANK NUMBER 4 (a) " (b) 4 (c) 3" (d) 3( (e) ( SELECTIONS FOR BLANK NUMBER 5 (a) 9.2) (b) 11.2) (c) 10.2' (d) 10.2) (e) 10.2" 3619 Fill in the blanks: sleet% cat e5.f90 PROGRAM P5 IMPLICIT NONE INTEGER :: i real :: val=100.00, val03, val05, val07 print "(1X,_____1_____,'Value of 100 compounded annually')" print "(1X,_____2_____',5X,'At 3%',5X,'At 5%',5X,'At 7%')" do i=1,10 val03=val*(1.03)**i val05=val*(1.05)**i val07=val*(1.07)**i print "(1X, _____3_____, _____4_____F_____5_____)",i, val03, val05, val07 end do END PROGRAM P5 sleet% f90 e5.f90 sleet% a.out Value of 100 compounded annually Year At 3% At 5% At 7% 1 103.00 105.00 107.00 2 106.09 110.25 114.49 3 109.27 115.76 122.50 4 112.55 121.55 131.08 5 115.93 127.63 140.26 6 119.41 134.01 150.07 7 122.99 140.71 160.58 8 126.68 147.75 171.82 9 130.48 155.13 183.85 10 134.39 162.89 196.72 sleet% ANSWER SECTION: SELECTIONS FOR BLANK NUMBER 1 (a) 5X (b) T4 (c) T5 (d) 5 (e) " " SELECTIONS FOR BLANK NUMBER 2 (a) 'Year (b) " Year" (c) ' Year' (d) ' Year (e) Year SELECTIONS FOR BLANK NUMBER 3 (a) I6 (b) F5 (c) I5.0 (d) I5 (e) I4 SELECTIONS FOR BLANK NUMBER 4 (a) " (b) 4 (c) 3" (d) 3( (e) ( SELECTIONS FOR BLANK NUMBER 5 (a) 9.2) (b) 11.2) (c) 10.2' (d) 10.2) (e) 10.2" 3620 The files List.h, List.cpp, and lab07.cpp have been provided with this assignment. You will only modify one file, List.cpp. Look for the comments marking where you'll be adding your code. Please look at the methods declared in List.h. Do not add any other methods to this file. Modify the method insert( ) in the file List.cpp to create a new node with the incoming string s and then insert that node in the list object. The list should be maintained in ascending alphabetical order at all times. List.cpp is the only file that you should change. Use lab07.cpp, List.cpp, and List.h to test your solution. The main program in lab07.cpp reads a series of strings until it encounters the string "xxx" (without quotes). The string "xxx" is not added to the list, but it is a sentinel value that indicates that the user does not wish to add more strings to the list. The strings need to be added to the linked list in alphabetical order. The main program displays the list after the method insert( ) adds a new node to the list. For example, the input could be: bbb ccc aaa xxx <-- this indicates that no more strings are to be added At this point the program stops adding nodes to the list, and displays the full list: aaa bbb ccc The main program has a second loop that reads strings that the user wishes to remove from the list. The program displays the list after the method remove( ) removes first the node matching the incoming string. Once again, the string "xxx" (without quotes) terminates the loop. For example, the input could be: yyy aab bbb ccc aaa xxx <-- this indicates that no more strings are to be removed If the string does not appear in the list, as in the case of the string "yyy" in the above example, nothing should happen. That is, the list should not change and the program should not crash. When the program reads string "bbb", the node containing "bbb" should be removed from the list and the node should be deleted. Again, "xxx" indicates the end of the input. Important: make sure you deallocate any node you remove from the list. Otherwise you have a memory leak! Please - use braces around any block - use blocks as we did in our class examples - indent your code as we have used indentations in our examples - comment your code; do not over comment HERE List CPP FILE TO MODIFY #include "List.h" // methods for Node // constructor: init. a Node Node::Node( const string &s, Node * const n, Node * const p ) { word = s; // init. word with a copy of s next = n; // next points to next node n prev = p; // prev points to previous node p if( n ) // is there a next node? { n->prev = this; } if( p ) // is there a previous node? { p->next = this; } } // return a const ref to word const string &Node::get_word( ) const { return word; } // return a pointer to next node Node *Node::get_next( ) const { return next; } // return a pointer to previous node Node *Node::get_prev( ) const { return prev; } // set and return a pointer to next node Node *Node::set_next( Node *n ) { next = n; return next; } // set and return a pointer to previous node Node *Node::set_prev( Node *p ) { prev = p; return prev; } // methods for List List::List( ) // constructor: init. head and tail { cout << "List::List( )\n"; head = tail = 0; } List::~List( ) // destructor: deallocate the list { cout << "List::~List( )\n"; for( Node *p = head; p; ) { Node *tmp = p; // remember current pointer p = p->get_next( ); // advance p to the next Node delete tmp; // deallocate tmp cout << "deallocated\t" << tmp << "\tnext is\t" << p << '\n'; } } void List::insert( const string &s ) { // replace the call to push_back( s ) with your code to insert // s in the doubly-linked list in alphabetical order push_back( s ); } void List::push_back( const string &s ) { // n points to a new node Node *n = new Node( s, 0, tail ); if( tail == 0 ) // tail not pointing to a node yet? { head = tail = n; // head and tail point to new node in the list } else { // tail->next points to new node tail->set_next( n ); tail = n; // tail points to last node in the list } } void List::push_front( const string &s ) { // n points to a new node Node *n = new Node( s, head, 0); if( head == 0 ) // head not pointing to a node yet? { head = tail = n; // head and tail point to new node in the list } else { // head->prev points to new node head->set_prev( n ); head = n; // head points to first node in the list } } void List::remove( const string &s ) { for( Node *p = head; p; p = p->get_next( ) ) { if( p->get_word( ) == s ) { Node *tmp; tmp = p->get_prev( ); if( tmp ) // is there a prev node? { tmp->set_next( p->get_next( ) ); } else // at the beginning of the list { head = p->get_next( ); } tmp = p->get_next( ); if( tmp ) // is there a next node? { tmp->set_prev( p->get_prev( ) ); } else // at the end of the list { tail = p->get_prev( ); } delete p; // deallocate the node containing s break; // terminate loop after finding first occurrence of s } } } ostream &operator <<( ostream &out, const List &list ) { for( Node *p = list.head; p; p = p->get_next( ) ) { cout << p << '\t' << setw( 8 ) << p->get_word( ) << '\t' << "next:" << '\t' << p->get_next( ) << '\n'; } return out; } Here LAB07 CPP FILE #include "List.h" int main( ) { List list; // create an object list of type List cout << "please enter a few words (xxx to terminate list):\n"; string s; // s is a string object while( cin >> s ) // read a string into s { if( s == "xxx" ) { break; // terminate loop when string is equal to "xxx" } list.insert( s ); // add s to list in alphabetical order cout << "\nlist:\n" << list << '\n'; } cout << "\nhere is the list:\n" << list << '\n'; cout << "please enter word words to delete from the list (xxx to terminate):\n"; while( cin >> s ) { if( s == "xxx" ) { break; // terminate loop when string is equal to "xxx" } list.remove( s ); // remove first node containing string s, if any cout << "\nlist:\n" << list << '\n'; } cout << "\nthe final list:\n" << list << '\n'; return 0; } HERE LIST H FILE #include #include #include using namespace std; class Node { public: // constructor Node( const string &, Node * const, Node * const ); const string &get_word( ) const;// get a const reference to word Node *get_next( ) const; // get a pointer to next node Node *get_prev( ) const; // get a pointer to previous node Node *set_next( Node * ); // set next pointer Node *set_prev( Node * ); // set prev pointer private: string word; Node *next; // pointer to the next node Node *prev; // pointer to the previous node // do not generate defautl copy ctor Node( const Node & ); // do not generate default copy assign. oper. const Node &operator =( const Node & ); }; class List { public: List( ); // constructor ~List( ); // destructor // push a node to the back of list void push_back( const string & ); // push a node to the front of list void push_front( const string & ); void insert( const string & ); // insert a node in alphabetical order void remove( const string & ); // remove a node containing string // output a list object friend ostream &operator <<( ostream &, const List & ); private: Node *head; Node *tail; // do not generate a default copy ctor List( const Node & ); // do not generate default copy assign. oper. const List &operator =( const List & ); }; 3621 files: https://www.dropbox.com/sh/q197chkff06mhl2/AABCPoHyCJ8sHje65m2MWFaHa?dl=0 this is what I've done so far. from Tkinter import * root = Tk() root.configure(background='powder blue') root.geometry("600x680") root.wm_title("Circle Color Test") file= Label (text="Virtual Advisor v1.0",font="Times 25 bold",bg="powder blue") file.pack() title=root.title("Virtual Advisor") button1 = Button(text="Load Past Student Grades",bg="blue" ) #command = file.quit) button1.place(relx=0.1, rely=0.2) button2= Button(text="Load Your Current Transcript") button2.place(relx=0.6, rely=0.2) button4=Button(text="See the Recommended Courses") button4.place(relx=0.1, rely=0.45) frame = Frame(width=500, height=80, bg="tomato", colormap="new") frame.pack() frame.place(relx=0.1,rely=0.28) t1=Label(text="Similarity\n Measure:",font="Times 15",bg="tomato") t1.pack() t1.place(relx=0.54, rely=0.3) t2=Label(text="Collaborative\n Filtering Type:", font= "Times 15",bg="tomato") t2.pack() t2.place(relx=0.1, rely=0.3) #def sel(): # selection = "You selected the option " + str(var.get()) #label.config(text = selection) var = IntVar() R1 = Radiobutton(root, text="User-based", variable=var, value=1,bg="tomato")#command=sel) R1.pack( anchor = W ) R1.place(relx=0.3, rely=0.3) R2 = Radiobutton(root, text="Item-based", variable=var, value=2, bg="tomato") #command=sel) R2.pack( anchor = W ) R2.place(relx=0.3, rely=0.34) OPTIONS = ["Pearson","Euclidean","Jaccard"] variable = StringVar(root) variable.set(OPTIONS[0]) # default value w = apply(OptionMenu, (root, variable) + tuple(OPTIONS)) w.pack() w.place(relx=0.7, rely=0.3) mainloop() 3622 //************************************************************************************************** // FILE: lab07.cpp // // DESCRIPTION: A simple number guessing game. The compter selects a // secret number within a user specified range. The user // then has a specified number of attempts in which to // correctly guess the secret number. the program provides // helpful feedback after each guess. // // This lab project illustrates the following C++ concepts: // 1. Writing functions. Function calls. Pass parameters byvalue. Return values. // 2. Writing loops. // 3. Writing if statements, if-else statements, and if-elseif-elseif... statements. // // AUTHORS: ( () // // COURSE: CSE100 Principles of Programming with C++, Spring 2015 // // LAB INFO: Lab Number 7; Date/Time: ; TA: // // ------------------------------------------------------------------------------------------------- #include using namespace std; // be sure to add any #include directives that yuo may need ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int getRangeMaximum() // // Promts the user to enter an integer value between 10 and 1000 (inclusive). // // if the user enters a number that is not valid, // then display an error message and ask again. // // if the user enters a valid choice, // then return that value. // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int getSecretNumber(int min, int max) // // Generates and returns a "random" number between min value and max value (inclusive). // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int getNumberOfAttemptsAllowed() // // Prompts the user to enter the number of attemts that they will have to guess the secret number. // This value must be in the range of 10 to 100 (inclusive) // // if the user enters a number that is not a valid, // then display an error message and ask again. // // if the user enters a valid number, then return that value. // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int getUsersGuess() // // Prompts the user to enter their guess. // Then return that value. // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int giveFeedback(int usersGuess, int secretNumber) // // Gives user feedback based on thier guess. // // if the user's guess is the same as the secret number then diplay "CORRECT!". // if the user's guess is less than the secret number then diplay "TOO LOW!". // if the user's guess is greater than the secret number then diplay "TOO HIGH!". // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: bool askUserIfTheyWillPlayAgain() // // Asks the user if they would like to play again. // // if they answer "yes" then return true; // if they answer "no" then return false; // if they give an aswer other than "yes" or "no" then ask again. // //-------------------------------------------------------------------------------------------------- ??? // this main function is complete and should not require any modifications int main() { int secretNumber = 0, usersGuess = 0; int numberOfAttemptsAllowed = 0, numberOfGuessesUsed = 0; int max = 0; bool playAgain = true; do { max = getRangeMaximum(); secretNumber = getSecretNumber(1, max); numberOfAttemptsAllowed = getNumberOfAttemptsAllowed(); numberOfGuessesUsed = 0; do { usersGuess = getUsersGuess(); numberOfGuessesUsed++; giveFeedback(usersGuess, secretNumber); } while (usersGuess != secretNumber && numberOfGuessesUsed < numberOfAttemptsAllowed); playAgain = askUserIfTheyWillPlayAgain(); } while (playAgain); return 0; } 3623 //************************************************************************************************** // FILE: lab07.cpp // // DESCRIPTION: A simple number guessing game. The compter selects a // secret number within a user specified range. The user // then has a specified number of attempts in which to // correctly guess the secret number. the program provides // helpful feedback after each guess. // // This lab project illustrates the following C++ concepts: // 1. Writing functions. Function calls. Pass parameters by-value. Return values. // 2. Writing loops. // 3. Writing if statements, if-else statements, and if-elseif-elseif... statements. // // AUTHORS: ( () // // COURSE: CSE100 Principles of Programming with C++, Spring 2015 // // LAB INFO: Lab Number 7; Date/Time: ; TA: // // ------------------------------------------------------------------------------------------------- #include using namespace std; // be sure to add any #include directives that yuo may need ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int getRangeMaximum() // // Promts the user to enter an integer value between 10 and 1000 (inclusive). // // if the user enters a number that is not valid, // then display an error message and ask again. // // if the user enters a valid choice, // then return that value. // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int getSecretNumber(int min, int max) // // Generates and returns a "random" number between min value and max value (inclusive). // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int getNumberOfAttemptsAllowed() // // Prompts the user to enter the number of attemts that they will have to guess the secret number. // This value must be in the range of 10 to 100 (inclusive) // // if the user enters a number that is not a valid, // then display an error message and ask again. // // if the user enters a valid number, then return that value. // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int getUsersGuess() // // Prompts the user to enter their guess. // Then return that value. // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: int giveFeedback(int usersGuess, int secretNumber) // // Gives user feedback based on thier guess. // // if the user's guess is the same as the secret number then diplay "CORRECT!". // if the user's guess is less than the secret number then diplay "TOO LOW!". // if the user's guess is greater than the secret number then diplay "TOO HIGH!". // //-------------------------------------------------------------------------------------------------- ??? //-------------------------------------------------------------------------------------------------- // FUNCTION: bool askUserIfTheyWillPlayAgain() // // Asks the user if they would like to play again. // // if they answer "yes" then return true; // if they answer "no" then return false; // if they give an aswer other than "yes" or "no" then ask again. // //-------------------------------------------------------------------------------------------------- ??? // this main function is complete and should not require any modifications int main() { int secretNumber = 0, usersGuess = 0; int numberOfAttemptsAllowed = 0, numberOfGuessesUsed = 0; int max = 0; bool playAgain = true; do { max = getRangeMaximum(); secretNumber = getSecretNumber(1, max); numberOfAttemptsAllowed = getNumberOfAttemptsAllowed(); numberOfGuessesUsed = 0; do { usersGuess = getUsersGuess(); numberOfGuessesUsed++; giveFeedback(usersGuess, secretNumber); } while (usersGuess != secretNumber && numberOfGuessesUsed < numberOfAttemptsAllowed); playAgain = askUserIfTheyWillPlayAgain(); } while (playAgain); return 0; } 3624 //************************************************************************************************** // FILE: lab06.cpp // // DESCRIPTION: A menu driven program that dipsplays various shapes // like squares, and rectangles of a user spesified size. // // This lab project illustrates the following C++ concepts: // 1. Functions. Function calls. Pass parameters by-value. Return values. // 2. Writing loops. // 3. Writing if statements, if-else statements, and if-elseif-elseif... statements. // // AUTHORS: ( () // // COURSE: CSE100 Principles of Programming with C++, Spring 2015 // // LAB INFO: Lab Number 6; Date/Time: ; TA: // // ------------------------------------------------------------------------------------------------- #include using namespace std; //-------------------------------------------------------------------------------------------------- // FUNCTION: DisplayMenu() // // Displays a menu of choices for the user. // // The choices are: // 1) Draw a square // 2) Draw a rectangle // 3) Quit the program // //-------------------------------------------------------------------------------------------------- void DisplayMenu() { // write the code to display the menu } //-------------------------------------------------------------------------------------------------- // FUNCTION: int GetUserMenuChoice() // // Displays the menu of choices for the user; // by calling the DisplayMenu funciton // Then prompts the user to enter their choice (1-3). // // if the user enters a number that is not a valid menu choice, // then display an error message and ask again for the user's choice. // // if the user enters a valid menu choice, // then return that value. // //-------------------------------------------------------------------------------------------------- int GetUserMenuChoice() { int menuChoice = 0; // write the code to complete this function return menuChoice; } //-------------------------------------------------------------------------------------------------- // FUNCTION: int GetSize() // // Prompts the user to enter a valid size value (110); // // if the user enters a number that is not a valid size value, // then display an error message and ask again for the size. // // if the user enters a valid size, // then return that value. // //-------------------------------------------------------------------------------------------------- int GetSize() { int size = 0; // write the code to complete this function return size; } //-------------------------------------------------------------------------------------------------- // FUNCTION: int GetHeight() // // Prompts the user to enter a valid height value (1-10); // // if the user enters a number that is not a valid height value, // then display an error message and ask again for the height. // // if the user enters a valid height, // then return that value. // //-------------------------------------------------------------------------------------------------- int GetHeight() { int height = 0; // write the code to complete this function return height; } //-------------------------------------------------------------------------------------------------- // FUNCTION: int GetWidth() // // Prompts the user to enter a valid width value (1-10); // // if the user enters a number that is not a valid width value, // then display an error message and ask again for the width. // // if the user enters a valid width, // then return that value. // //-------------------------------------------------------------------------------------------------- int GetWidth() { int width = 0; // write the code to complete this function return width; } //-------------------------------------------------------------------------------------------------- // FUNCTION: DisplaySquare(int size) // // Displays a square of asterisks of the specified size. // //-------------------------------------------------------------------------------------------------- void DisplaySquare(int size) { // write the code to display a solid square made of asterisks (*) // that is as tall and as wide as the size parameter value specifies. } //-------------------------------------------------------------------------------------------------- // FUNCTION: DisplayRectangle(int height, int width) // // Displays a rectangle of asterisks of the specified height and width. // //-------------------------------------------------------------------------------------------------- void DisplayRectangle(int height, int width) { // write the code to display a solid rectangle made of asterisks (*) // that is as tall and as wide as the hight and width parameter values specify. } // this main function is complete and should not require any modifications int main() { int menuChoice = 0, size = 0, height = 0, width = 0; while (menuChoice != 3) { menuChoice = GetUserMenuChoice(); switch (menuChoice) { case 1: // Draw a square size = GetSize(); DisplaySquare(size); break; case 2: // Draw a rectangle height = GetHeight(); width = GetWidth(); DisplayRectangle(height, width); break; case 3: // Quit the program cout << "Quitting program!" << endl; break; } } return 0; } 3625 "The file is corrupt and cannot be opened" error on office 2010 Excel while opening .xls files I recently upgraded my office to 2010 from 2007 after that i am unable to open any .xls files created by previous version no issue with the files because i can open it in 2003 sp3 and 2007 sp2 versions Thank your for help !! 3626 Figure F is a regular hexagon with an equilateral triangle inside it. The vertices are labelled 1 to 6. Write down in two-line form the elements of the symmetry group S(F). Describe each symmetry geometrically. Identify each of these symmetries by a single letter, and use these letters to construct a group table for S(F). The group S(F) is isomorphic to one of the following groups: (Z6, +6), S(triangle), S(Hexagon). Determine to which of these groups S(F) is isomorphic, justifying your answer, please. Write down one subgroup of S(F) of order 2, and one of order 3, please. Thanks for help !! 3627 Figure F is a regular hexagon with an equilateral triangle inside it. The vertices are labelled 1 to 6. Write down in two-line form the elements of the symmetry group S(F). Describe each symmetry geometrically. Identify each of these symmetries by a single letter, and use these letters to construct a group table for S(F). The group S(F) is isomorphic to one of the following groups: (Z6, +6), S(triangle), S(Hexagon). Determine to which of these groups S(F) is isomorphic, justifying your answer, please. Write down one subgroup of S(F) of order 2, and one of order 3, please. Thanks for help !! 3628 In the figure, , the B bus register is encoded in a 4-bit field, but the C bus is represented as a bit map. Why? Show transcribed image text In the figure, , the B bus register is encoded in a 4-bit field, but the C bus is represented as a bit map. Why? 3629 / Factory method that throws NegativeArraySizeException // if "size" is negative. public static NewList newInstance(int size) throws NegativeArraySizeException // Returns a NewList object subset from this NewList, // limited by the specified lowerBound and upperBound. // It throws ArrayIndexOutOfBoundsException and // NegativeArraySizeException. public NewList getSubArray(int lowerBound, int upperBound) throws ArrayIndexOutOfBoundsException, NegativeArraySizeException 3630 / Factory method that throws NegativeArraySizeException // if "size" is negative. public static NewList newInstance(int size) throws NegativeArraySizeException // Returns a NewList object subset from this NewList, // limited by the specified lowerBound and upperBound. // It throws ArrayIndexOutOfBoundsException and // NegativeArraySizeException. public NewList getSubArray(int lowerBound, int upperBound) throws ArrayIndexOutOfBoundsException, NegativeArraySizeException Show transcribed image text / Factory method that throws NegativeArraySizeException // if size is negative. public static NewList newInstance(int size) throws NegativeArraySizeException // Returns a NewList object subset from this NewList, // limited by the specified lowerBound and upperBound. // It throws ArrayIndexOutOfBoundsException and // NegativeArraySizeException. public NewList getSubArray(int lowerBound, int upperBound) throws ArrayIndexOutOfBoundsException, NegativeArraySizeException 3631 The factorial of a nonnegative integer N is defined to be the product of the integers 1 through N. We use the symbol N! to represent the factorial of N. Here are some examples: 3! = 3*2*1 = 6 5! = 5*4*3*2*1 = 120 0! Is defined to be 1 The factorial is not defined for negative numbers or for non-integers. Write a program that will prompt the user to enter an integer and then compute and display the factorial. This should be repeated until the user enters a value of A????11. Sample output: Welcome to the factorial factory! Please enter an integer or A????11 to quit: 6 6! = 720 Please enter an integer or A????11 to quit: A????13 Sorry, A????13! is not defined. Please enter an integer or A????11 to quit: 4 4! = 24 Please enter an integer or A????11 to quit: 0 0! = 1 Please enter an integer or A????11 to quit: A????11 Thanks for visiting! Goodbye! 3632 Factor wx'y + w'x' + w'y' to obtain a product of sums. Let F(W,X,Y,Z) = X + YZ(W +X' ). Find a sum-to-products expression for F' 3633 How to extract the text from a cell with formulas in it? Hello, I am running into a problem that I need a little help with. I have a cell (A2) that includes text that has been generated using formulas. I want to automatically have the text only in a different cell (D2) so the user can simply copy and paste the text into a different program (See example). Is there a way to do this? EG: (A2) =CONCATENATE("Tier 1 - ", " ",$C$3,", ",$F$3,". ",$C$9," customer called to discuss ",$C$21, ". ") After the reference cells are filled in the text reads: Tier 1 - John Doe, 12345. Ohio customer called to discuss tires. I want the above text in D2 so the user can just copy and paste into a different program (so they can't just paste values) Thank you for your help !! 3634 How to extract the text from a cell with formulas in it? Hello, I am running into a problem that I need a little help with. I have a cell (A2) that includes text that has been generated using formulas. I want to automatically have the text only in a different cell (D2) so the user can simply copy and paste the text into a different program (See example). Is there a way to do this? EG: (A2) =CONCATENATE("Tier 1 - ", " ",$C$3,", ",$F$3,". ",$C$9," customer called to discuss ",$C$21, ". ") After the reference cells are filled in the text reads: Tier 1 - John Doe, 12345. Ohio customer called to discuss tires. I want the above text in D2 so the user can just copy and paste into a different program (so they can't just paste values). Thank you for your help !!! 3635 Extend the multi-cycle datapath to add the instruction: swa $t0, 8($t1)++ 1. Using a figure of the multi-cycle datapath draw the modifications necessary for the datapath to correctly implement the two extensions. 2. From the preceding determine the values of all (and any new) control signals required to realize the desired functionality. Show transcribed image text Extend the multi-cycle datapath to add the instruction: swa $t0, 8($t1)++ 1. Using a figure of the multi-cycle datapath draw the modifications necessary for the datapath to correctly implement the two extensions. 2. From the preceding determine the values of all (and any new) control signals required to realize the desired functionality. 3636 After exposing to Windows App Store development for a month, I begin to feel that async / await programming model does more harm than good. It makes simple thing complicated. Take an example, folder creation. In Java or Desktop .NET, I can simply do Java public Constructor() { new File("c:\\folder").mkdirs(); System.out.println("I am pretty sure c:\\folder is ready now"); } Desktop .NET Constructor() { System.IO.Directory.CreateDirectory("c:\\folder"); Console.WriteLine("I am pretty sure c:\\folder is ready now"); } But when comes to Windows App Store .NET Constructor() { // Damm it! Another async function? I don't need aysnc! Windows.Storage.ApplicationData.Current.LocalFolder.CreateFolderAsync("c:\\folder", CreationCollisionOption.OpenIfExists); // I am not sure c:\\folder is ready right now! // OK. I know I can use ContinueWith. No no no. I don't want. // Why I have to use ContinueWith with such a simple operation? } So, my question is, do you find the newly introduced async / await programming model in Windows App Store, Improve your productivity? Make programming life easier? For me, I don't! Perhaps I have been missing out certain useful techniques. I know, Microsoft says, it helps us to write responsive UI code. But I would say, No thanks! Hey look, my code is already in non-UI code! Most of my current operation code is fast enough and doesn't block UI. When my operation code is not fast enough, I am pretty comfortable in making those slow operation code run in separate Thread/ Task. Forcing me to use async / await which I do not need, only makes my code more complicated. Message to Microsoft : May I beg to you, besides async functions, can you provide a same set of non-async functions, please? I already build up my habit of running code in non-UI thread. I promise I will continue make your Windows App perform as smooth as iOS :) 3637 Explain the steps/Sequence of events (in detail) that would occur if a host has packets destined for: a) A local address included in the A????1hostA????1 ARP table b) A local address not included in the A????1hostA????1 ARP table c) A address not on the A????1hostA????1 network 3638 Explain the steps/Sequence of events (in detail) that would occur if a host has packets destined for: a) A local address included in the A????1hostA????1 ARP table b) A local address not included in the A????1hostA????1 ARP table c) A address not on the A????1hostA????1 network 3639 Explain why the following function is tail recursive and then give an equivalent iterative function. A????1EquivalentA????1 means the two functions will return the same value when both m and n are positive numbers. int f(int m, int n) { if (m == n) return m; if (m > n) return f(m-n,n); return f(m,n-m); } 3640 Explain why the following function is not tail recursive and then define an A????1equivalentA????1 function that is tail recursive. Your new function may take an additional parameter. Explain the notion of equivalence used. int g(int m, int n) { if (n == 0) return 1; return m * g(m, n-1); } 3641 Can you explain how to convert the number 9 and 5/32 to IEEE single-precision format. give results as eight hexadecimal digits. step by step? 3642 Explain how Ben & JerryA????1s is using business intelligence tools to remain successful and competitive in a saturated market 3643 : In this experiment you will investigate performance of the subscript and the relational operators on strings. Enter, save, compile and execute the following program in MSVS. Call the new directory A????1cPlusPlusStringsExp2A????1 and the program A????1cPlusPlusStrings2.cppA????1. questions below: #include Answer the #include using namespace std; int main() { string my_name = "Thomas Jefferson"; string her_name("Michelle Obama"); string his_name = "Joe Biden"; for (int i=0; i < her_name.length(); i++) { cout< her_name) { cout << my_name <<" is lexicographically greater than " << her_name << endl << endl; } if (my_name < his_name) { cout << my_name <<" is lexicographically less than " << his_name <= her_name) { cout << my_name <<" is lexicographically greater than or equal to " << her_name << endl << endl; } if (my_name <= his_name) { cout << my_name <<" is lexicographically less than or equal to " << his_name < #include using namespace std; int main() { string s1 = "123abc456de111ef789eehij111ee"; string s2; int loc = 0; for (int i =0; i> skips over whitespace too, so this helps by ignore spaces, newlines, tabs, etc, as well. - You may assume the user will enter at least one valid lowercase letter before entering a ? to quit. 3651 Do Exercise 9.6 on page 428 of the text, the Rational Class, whose objects represent rational numbers. You must use member function calls for this program. (Do not use operator overloading from Chapter 10 in this program) Some changes to the text's specification: A????1 Use normal arithmetic semantics where arithmetic functions return a A????1thirdA????1 object that do not modify the original operands. A????1 Include the six comparison operators: less than, less than or equal to, greater than, greater than or equal to, equivalence (equals), and not equivalent (not equal). A????1 Reduce all fractions by using the greatest common divisor, see the gcd() function given below. A????1 Be sure to correctly handle negative numerators and/or denominators, see the Standardize() function given below. A????1 Do appropriate error checking Sample Output from your main() program: Declare at least three Rational objects, then interact with the user as shown below. 1. Enter a rational number: 8/-18 You entered the rational number: -8/18 which has now been put into standard form. 2. Your fraction in reduce form is: -4/9 and the floating point equivalent of your number is: -0.444444 3. Enter two rational numbers: 3/4 7/10 Results for add, subtract, multiply, and divide: Add: 29/20 Subtract: 1/20 Multiply: 21/40 Divide: 15/14 4. Comparison of 3/4 with 7/10 Greater than: 3/4 > 7/10 5. Solving Simple Linear Equations Enter the coefficients for: a/b X + c/d = e/f 2/1 -5/3 7/9 Your equation is: 2/1 X + -5/3 = 7/9 The simplified equation is: 2/1 X = 22/9 The solution is X = 11/9 6. To be filled in by the programmer: Demonstrate at least one other feature that you would like to show, i.e. solve more equations, perform more comparison operations, compute (ax + b)^2, multiply two linear factors (aX +b)(cX + d), computing the derivative of a polynomial with rational coefficients, computing the determinate of a two by two matrix, solving two equations with two unknowns using CrammerA????1s Rule, etc. Create a function that does most of the work for the operation you have selected. Your rational class will perform the appropriate arithmetic and your function does the rest of the work. 7. To be filled in by the programmer: Demonstrate the error checking that your program can handle. 3652 Exercise 5A: Write a short Python program that asks the user to input two numbers, and then divides the first number by the second. The program must use an exception handling structure to process the situation when the denominator is zero. Run your program with 0 as the input for the denominator. Exercise 5B: Write another short program that asks the user to input a file name that will be read and printed out. Use exception handling to process the situation when the file with given file name does not exist or cannot be found. Run the program with a file name that will cause the exception to occur 3653 1. *Exercise 5: Given the specification of the data types Date, Event, and Newspaper: View complete question » Data types Spesification day : unsigned int month: unsigned int year: unsigned int Date constructor: with no arguments get functions for each data member set functions for each data member EventDate: date desription: string Event constructor: with no arguments get functions for each data member set functions for each data member Events[100]: Event Newspaper Title: const string 3654 *Exercise 2: Create two classes : Degrees class , and Radians class . Degrees class , includes one data member : float degree . And Radians class includes one data member : float radian . In the main call functionconvertwhich takes two objects as parameters, one from Degrees class & the second from Radians class. Convert function make choice to the user: 1. Change the angle from degree to radian. 2. Change the angle from radian to degree. This will be changing either angle data member from Radians class, or angle data member from Degrees, depending on the choice of the user. (hint : use friend function). 3655 Exercise 1: You will notice that the function has to be completed. This function will take cents and convert it to dollars. It also keeps a running total of all the money it has processed. Assuming that the function is complete, write out what you expect the program will print. Exercise 2: Complete the function. Fill in the blank space to define sum and then write the code to convert cents to dollars. Example: 789 cents would convert to 7.89. Compile and run the program to get the expected results. Think about how sum should be defined. #include #include using namespace std; //PLACE YOUR NAME HERE void normalizeMoney(float& dollars, int cents = 150); // This function takes cents as an integer and converts it to dollars // and cents. The default value for cents is 150 which is converted // to 1.50 and stored in dollars int main() { int cents; float dollars; cout << setprecision(2) << fixed << showpoint; cents = 95; cout << "\n We will now add 95 cents to our dollar total\n"; // Fill in the code to call normalizeMoney to add 95 cents cout << "Converting cents to dollars resulted in " << dollars << " dollars\n"; cout << "\n We will now add 193 cents to our dollar total\n"; // Fill in the code to call normalizeMoney to add 193 cents cout << "Converting cents to dollars resulted in " << dollars << " dollars\n"; cout << "\n We will now add the default value to our dollar total\n"; // Fill in the code to call normalizeMoney to add the default value of cents cout << "Converting cents to dollars resulted in " << dollars << " dollars\n"; return 0; } // ******************************************************************************* // normalizeMoney // // task: This function is given a value in cents. It will convert cents // to dollars and cents which is stored in a local variable called // total which is sent back to the calling function through the // parameter dollars. It will keep a running total of all the money // processed in a local static variable called sum. // // data in: cents which is an integer // data out: dollars (which alters the corresponding actual parameter) // // ********************************************************************************* void normalizeMoney(float& dollars, int cents) { float total=0; // Fill in the definition of sum as a static local variable _________________ sum = 0.0; // Fill in the code to convert cents to dollars total = total + dollars; sum = sum + dollars; cout << "We have added another $" << dollars <<" to our total" << endl; cout << "Our total so far is $" << sum << endl; cout << "The value of our local variable total is $" << total << endl; } 3656 Exception Project (Written in Java using netbeans) - Chapter 11 This assignment assumes you have completed Programming Challenge 1 of Chapter 10 (Employee and ProductionWorker Classes). Modify the Employee and ProductionWorker clases so they throw exceptions when the following errors occur: *The Employee class should throw and exception named InvalidEmployeeNumber when it receives and invalid employee number. *The ProductionWorker class should throw an exception named InvalidShift when it receives an invalid shift. *The ProductionWorker class should throw an exception named InvalidPayRate when it receives a negative number for the hourly pay rate. This is what I have for Programming Challenge 1 of Chapter 10: package employeedemo; /** * * @author Michael */ class Employee { //fields private String Empname; private String Empnumber; private String Hiredate; //constructor (default) public Employee() { Empname = " "; Empnumber = " "; Hiredate = " "; } //constructor (parameterized) public Employee(String Empname, String Empnumber, String Hiredate) { setName(Empname); setNumber(Empnumber); setHireDate(Hiredate); } //Mutator (employee name) public void setName(String n) { Empname = n; } //Mutator (employee number) public void setNumber(String num) { Empnumber = num; } //Mutator (hire date) public void setHireDate(String h) { Hiredate = h; } //Accessor (employee name) public String getName() { return Empname; } //Accessor (employee number) public String getNumber() { return Empnumber; } //Accessor(hire date) public String getHireDate() { return Hiredate; } } package employeedemo; /** * * @author Michael */ class ProductionWorker extends Employee { //fields private int shift; private double hourpayrate; //constructor public ProductionWorker(String Empname, String Empnumber, String Hiredate, int shift, double hourpayrate) { super(Empname,Empnumber,Hiredate); setShift(shift); setHourlyPayRate(hourpayrate); } //accessor public int getShift() { return shift; } public double getHourlyPayRate() { return hourpayrate; } //mutator public void setShift(int s) { shift = s; } public void setHourlyPayRate(double r) { hourpayrate = r; } } package employeedemo; import java.util.Scanner; /** * * @author Michael */ public class EmployeeDemo { /** * @param args the command line arguments */ public static void main(String[] args) { String name, id, date; double pay; int shift; //Scanner Scanner keyboard = new Scanner(System.in); //User Input System.out.println("Please enter employee's name: "); name = keyboard.nextLine(); //input ID System.out.println("Please enter employee's ID: "); id = keyboard.nextLine(); //input date System.out.println("Please enter employee's hire date: "); date = keyboard.nextLine(); //input shift System.out.println("1-Day shift\n2-Night shift"); System.out.println("Please enter employee's shift: "); shift = keyboard.nextInt(); //input pay System.out.println("Please enter employee's hourly pay: "); pay = keyboard.nextDouble(); //Call ProductionWorker class ProductionWorker pw = new ProductionWorker(name,id,date,shift,pay); //Output System.out.println("Employee Name: " + pw.getName()); System.out.println("Employee ID: " + pw.getNumber()); System.out.println("Hire Date: " + pw.getHireDate()); System.out.println("Shift: " + pw.getShift()); System.out.println("Hourly Rate: " + pw.getHourlyPayRate()); } } 3657 Except for a blog post here and there, describing the custom attributes someone created, but that do not seem to get any traction - like one describing how to enforce immutability, another one on Documenting Thread Safety, modeling the attributes after JCIP annotations - is there any standard emerging? Anything MS might be planning for the future? This is something that should be standard, if there's to be any chance of interoperability between libraries concurrency-wise. Both for documentation purposes, and also to feed static / dynamic test tools. If MS isn't doing anything in that direction, it could be done on CodePlex - but I couldn't find anything there, either. Concurrency and thread safety are really hard in imperative and object-languages like C# and Java, we should try to tame it, until we hopefully switch to more appropriate languages. 3658 excel vba paste values only Option Explicit Sub Copy2ndRow() Dim ws As Worksheet, nr As Long For Each ws In ThisWorkbook.Worksheets If ws.Name <> "MTD" Then nr = Sheets("MTD").Range("A" & Rows.Count).End(xlUp).Offset(1).Row ws.Rows(2).Copy Sheets("MTD").Rows(nr) End If Next ws End Sub Hello My goal is to copy A2:P2 from 31 daily sheets to MTD sheet and sum all columns.... the code above does everything I need except formatting - I would like to paste values only but keep getting an error when I try to add the code below .PasteSpecial Paste:=xlPasteValues, Operation:=xlNone, _ SkipBlanks:=False, Transpose:=False also would like to have this run whenever the workbook is closed Thank you in advance !! 3659 excel vba paste values only Option Explicit Sub Copy2ndRow() Dim ws As Worksheet, nr As Long For Each ws In ThisWorkbook.Worksheets If ws.Name <> "MTD" Then nr = Sheets("MTD").Range("A" & Rows.Count).End(xlUp).Offset(1).Row ws.Rows(2).Copy Sheets("MTD").Rows(nr) End If Next ws End Sub Hello My goal is to copy A2:P2 from 31 daily sheets to MTD sheet and sum all columns.... the code above does everything I need except formatting - I would like to paste values only but keep getting an error when I try to add the code below .PasteSpecial Paste:=xlPasteValues, Operation:=xlNone, _ SkipBlanks:=False, Transpose:=False also would like to have this run whenever the workbook is closed Thank you in advance!! 3660 Hi Excel glitch - does not open file On Excel 2013 I have noticed that when double clicking on a file, either as an attachment in an email or on the network, if the file is from a previous version Excel does not open the file. Excel will launch, but then sits there with a blank screen. Have you come across this, and do you know what is going on?? thanks !! 3661 Excel - Conditional Formatting I want to add up a value in the next column if the column equals the formatting rule I have a spreadsheet that contains columns of headings and values. If one cell is equal to the formatting rule I want to add up the value: For example Column C Column D Race 1 A????1250 Race 2 A????1200 Race 3 A????1250 Race 1 A????1200 Race 1 A????1250 Race 2 A????1250 Totals for race 1 ?? . Totals for race 2 ??. Totals for race A????1 ?? . So, I want to highlight each race in a colour (which I can do) but I also want to add up the values for race 1,2 and 3. Is this is a rolling document I dont want to use filter or sort. If anyone can hep me that would be really greatly appreciateds Thanks for help !! 3662 Excel 2010 - Conditional Formatting Hello, How can I identify cells in a column where the character length of the value stored in the cell is greater than X. i.e. if the cell has more than 30 characters, shade it in red. IA????1ve tried conditional formatting based on a formula, but I cannot get my formulas to work. Thank you !! 3663 Few examples of CAPTCHA would be Gimpy and Bongo. Please explain how both work in details. Also, do describe the pros and cons of using both of them in details. From there, conclude each of them work best under what circumstances. P.S. Please don't copy and paste directly from online sources. 3664 Examine this pattern of asterisks and blanks, and write a C++ recursive function that can generate exactly this pattern: 3665 EX COMMENT ~ Name: Lab: Date Submitted: ~ ; 32-bit assembly language template .386 .model flat,stdcall .stack 4096 ExitProcess proto,dwExitCode:dword ; If your code calls any of Irvine's library modules then decomment the following line ; INCLUDE Irvine32.inc .data .code main proc invoke ExitProcess,0 main endp end main Define four symbolic constants that represent integer 25 in decimal, binary, octal, and hexadecimal formats. Find out, by trial and error, if a program can have multiple code and data segments. Create a data definition for a doubleword that stored it in memory in big endian format. Find out if you can declare a variable of type DWORD and assign it a negative value. What does this tell you about the assemblerA????1s type checking? Write a program that contains two instructions: (1) add the number 5 to the EAX register, and (2) add 5 to the EDX register. Generate a listing file and examine the machine code generated by the assembler. What differences, if any, did you find between the two instructions? Given the number 456789ABh, list out its byte values in little-endian order. Submit one listing file. 3666 Everything must be programmed in R: Use the SVM classification tool provided in R package e1071 to analyze the breast cancer data set, which can be found at : https://archive.ics.uci.edu/ml/datasets/Breast+Cancer+Wisconsin+%28Diagnostic%29. The data set contains 10 features and asks for a classicationof breast tumors into benign and malignant. Use 5-fold cross-validation to validate your results, i.e., calculate confusion matrix. 3667 Everything must be programmed in R: Implement a Bagging with bagging stumps and apply the algorithm to the breast cancer data set http://archive.ics.uci.edu/ml/machine-learning-databases/breast-cancerwisconsin/wdbc.data. Plot the average bootstrap errors plus or minus one standard deviation and compared with those in Adaboost procedure 3668 Everything must be programmed in R: Implement an AdaBoost with boosting stumps and apply the algorithm to the breast cancer data set http://archive.ics.uci.edu/ml/machine-learning-databases/breast-cancerwisconsin/wdbc.data. The data set contains 30 features and asks for a classification of breast tumors into benign and malignant. Plot the classification errors over the iterations and use 5-fold cross-validation to validate your results. Hint: you need to calculate the average cross-validation errors minus and plus one standard deviation. Decision stumps are often used as components (called A????1weak learnersA????1 or A????1base learnersA????1) in machine learning ensemble techniques such as bagging and boosting. A boosting stump is a machine learning model consisting of a one-level decision tree. That is, it is a decision tree with one internal node (the root) which is immediately connected to the terminal nodes (its leaves). A decision stump makes a prediction based on the value of just a single input feature. 3669 Evaluate the RPN expression : 4 5 6 ++ 1 2 + / dup * Python 3670 I have to evaluate the improper integral 1/sqrt(x)*e^(-sqrt(x)) from 0 to pi and I don't know how to find my answer... Any help will be greatly appreciated!!! 3671 The equation x3 - 1.2x2 - 8.19x + 13.23 = 0 has a double root close to x = 2. Determine this root with the NewtonA????1Raphsonmethodwithin four decimal places. 3672 When Enum is used as below, say if we have enum Designation { Manager = 0, TeamLead = 1, Associate = 2 } then write the below code if (designation == Designation.TeamLead) //somecode Now if we decide to change the enum element from "TeamLead" to "Lead" then we have to modify the above line of code as well i.e. designation == Designation.TeamLead to designation == Designation.Lead. So what is the best practice. 3673 The encoding of a MIPS j instruction being executed (which is at address PC = 0x302040BC) is 0x0B100013. Decode this instruction to determine what the jump target address is (write your answer as an 8-hexdigit number). For full credit, explain your answer. 3674 The encoding of a MIPS branch instruction (which is at PC = 0x3020FC04) is 0x1100FFFB. Decode this instruction and specify: (1) what is the instruction mnemonic; (2) what is register rs; (3) what is register rt; and (4) what is the branch target address. 3675 EMPLOYEE(NAME, SSN, BDATE, ADDRESS, SALARY) DEPARTMENT(DNAME, DNUMBER, MGRSSN) (MGRSSN references SSN in EMPLOYEE table) WORKSIN(ESSN, DNUMBER, HOURS) (DNUMBER references DNUMBER in DEPARTMENT table) (ESSN reference SSN in EMPLOYEE table) Write the relational algebra expressions for the following queries: 1) List the names of employees whose salary is greater than 30000 2) List the names of employees who work in A????1shoesA????1 department 3) List the names of employees who work in all departments 3676 emily has a road trip map with a key that shows an inch on the map equals 5 miles of actual distance of a distance measured on the map is 12 inches what is the actual distance write the rule you used to find the actual distance Thanks for help !! 3677 An embedded system is used to control the access to a room. Users have to swipe their ID cards in order to unlock the door. The ID number is read through one of the PIC18 ports. The magnetic system that is used to lock or unlock the door is connected to one of PIC18F pins through a relay. If the voltage of this pin is 5 V (high) then the door opens for 20sec. Only 5 People have can access this room (5 passwords). a) Write an algorithm for the program b) Translate the algorithm to a C program 3678 An embedded system is used to control the access to a room. Users have to swipe their ID cards in order to unlock the door. The ID number is read through one of the PIC18 ports. The magnetic system that is used to lock or unlock the door is connected to one of PIC18F pins through a relay. If the voltage of this pin is 5 V (high) then the door opens for 20sec. Only 5 People have can access this room (5 passwords). a.) Write an algorithm for the program b.) Translate the algorithm to a C program PLEASE answer ALL parts and show ALL work including C programming :) 3679 An embedded system is used to control the access to a room. Users have to swipe their ID cards in order to unlock the door. The ID number is read through one of the PIC18 ports. The magnetic system that is used to lock or unlock the door is connected to one of PIC18F pins though a relay. If the voltage of this pin is 5 V (high) then the door opens for 20 sec. Only 5 people can access this room (5 passwords). 1) Write an algorithm for the program. 2) Translate the algorithm to a C program. Show all work. 3780 Doubly linked list - C++ How can I write a class that adds nodes after the header and another class that adds nodes before a trailer? 3681 A double ended Queue is a list where items may be inserted or deleted from either end. In a way analogous to what was presented for queues, define key variables (front, rear, etc) and write Psuedo code for the following operations. Give the worst case running time for all Psuedo-codes. FrontInsert(i): Inserts i at the front (or does nothing and detects an error if the array is full. FrontDelete: Deletes and returns the front element (or does nothing and detects an error if no elements are currently stored in the array. RearInsert(i): Inserts i at the rear ( or does nothing and detects an error if the array is full). RearInsert(i): Deletes and returns the rear element (or does nothing and detects an error if no elements are currently stored in the array). 3682 I dont know how to write the following two instructions in MIPS assembly language to Java. The commands are read in from a file. If anyone could help me with this. .align 2 la $28, lbtest - I know I have to split in two instructions one R-Type and a I-Type. Show transcribed image text I dont know how to write the following two instructions in MIPS assembly language to Java. The commands are read in from a file. If anyone could help me with this. .align 2 la $28, lbtest - I know I have to split in two instructions one R-Type and a I-Type. 3683 Here I have done Lab 3 and need to do Lab 3+. What I need to do is from the stock class, single link list create a portfolio class, double link list, be able to store, insert, delete a print reverse of the portfolio on a file preferable, if not screen it is fine. #ifndef StockHeader #define StockHeader #include #include #include using namespace std; //typedef string ElementType; class Stock { private: class Node { public: string data; double cost; int num_stocks; Node * next; Node( ): data( ), next( NULL ) {} Node(string initData, double costStock, int number ) { data = initData ; cost = costStock; num_stocks = number; next = NULL ; } }; // end of Node class typedef Node * NodePointer; public: Stock( ); /* Construct a List object Precondition: none. Postcondition: An empty List object has been constructed. */ Stock( const Stock &source ); /* Construct a copy of a List object. Precondition: None. Postcondition: A copy of source has been constructed. */ ~Stock( ); /* Destroys a List object. Precondition: None. Postcondition: Any memory allocated to the List object has been freed. */ const Stock & operator=( const Stock &rightSide ); /* Assign a copy of a List object to the current object. Precondition: none Postcondition: A copy of rightside has been assigned to this object. A constant reference to this list is returned. */ int getSize( ) const; /* Returns the size of the list (number of items in the list) Precondition: none Postcondition: The return value is the number of items in the list. */ bool empty( ) const; /* Check if this List is empty Precondition: none Postcondition: The return value is true if this List object is empty; otherwise the return value is false. */ void insert(string initData, double costStock, int number, int index ); /* Insert a value into this List at a given index Precondition: The index is valid (0 <= index <= the list size). The first position is index 0, the second position is index 1, etc. Postcondition: dataval has been inserted into the list at the position determined by index (provided there is room and index is a legal position). */ void erase( int index ); /* Remove the value from this List at a given index. Precondition: The list is not empty and index is valid (0 <= index < the list size). Postcondition: the element at position index has been removed (provided index is a legal position). */ void display( ostream &out ) const; /* Display the contents of this List Precondition: ostream out is open Postcondition: the items in this List have been output to stream out */ void returnMiddleList(); /*Displays the Middle element data in the List Precondition: Use getSize() method to get the size divide it into half and set as mid Postcondition: use iterator to go the mid-1 position so that it prints the exact mid element */ void splitInHalf(); /* Displays the splitted lists Precondition: Create two Stock objects into which the two list elements are stored Postcondition: Use an iterator and store the first half elements of the list into List1 by checking the condition whether the i < mid If i>mid then store the other half into the second list List2. Display the elements of the List1 Display the elements of the List2 */ private: NodePointer has_a; int mySize; }; // end of List class #endif //List.cpp #include "stdafx.h" #include "StockHeader.h" //Construct empty List Stock::Stock() { has_a = NULL; mySize = 0; } //Construct copy of source List Stock::Stock( const Stock &source ) { has_a = NULL; mySize = 0; //check the code, the value of mySize is //changed int index = 0; NodePointer current = source.has_a; while(current != NULL) { insert(current->data,current->cost, current->num_stocks, index++); current = current->next; } } Stock::~Stock( ) { for(int i = 0; i <= mySize; i++) erase(i); } const Stock & Stock::operator=( const Stock &rightSide ) { int index = 0; NodePointer current = rightSide.has_a; while(current != NULL) { insert(current->data,current->cost, current->num_stocks, index++); current = current->next; } return *this; } int Stock::getSize( ) const { return mySize; } bool Stock::empty( ) const { if(mySize == -1) return true; return false; } void Stock::insert( string initData, double costStock, int number, int index ) { if(index == 0) { NodePointer NewNode = new Node; NewNode->data = initData; NewNode->cost = costStock; NewNode->num_stocks = number; NewNode->next = has_a; has_a = NewNode; mySize++; } else if(index > 0 && index <= (mySize + 1)) { NodePointer current = has_a; for(int i = 0; i < index - 1; i++) current = current->next; NodePointer NewNode = new Node; NewNode->data = initData; NewNode->cost = costStock; NewNode->num_stocks = number; NewNode->next = current->next; current->next = NewNode; mySize++; } } void Stock::erase( int index ) { if(has_a != NULL) { if(index == 0) { NodePointer temp = has_a; has_a = temp->next; delete temp; mySize--; } else if(index > 0 && index <= (mySize + 1)) { NodePointer current = has_a; for(int i = 0; i < index -1; i++) current = current->next; NodePointer temp = current->next; if(temp!=NULL) //check the condition that has //been modified current->next = temp->next; delete temp; mySize--; } } } void Stock::display( ostream &out ) const { NodePointer current = has_a; cout<<"Stock Symbol \t Cost \t Number of Shares"< cout<<"---------------------------------------------"< while(current != NULL) { out << current->data << "\t\t " << current->cost <<" \t\t " next; } } void Stock::returnMiddleList() { int mid=getSize()/2; NodePointer current = has_a; if(mid == 0) { cout 0 && mid <= (mySize + 1)) { for(int i = 0; i current = current->next; coutdata, current->cost, current-> num_stocks, i); current=current->next; } else { List2.insert(current->data, current->cost, current-> num_stocks, k); current=current->next; k++; } } //display the first half elements in the list cout<<"The first half: "< List1.display(cout); //display the second half elements in the the list cout<<"The second half: "< List2.display(cout); } // StockLinkedList.cpp : Defines the entry point for the console application. #include #include #include #include #include "StockHeader.h" using namespace std; int main(int argc, char const *argv[]) { srand(time(NULL)); string s; Stock Test; double cost; int num_shares; int i; //generating random numbers and stock symbols for(i=0;i<20; i++) { stringstream ss; ss << "A" < s=ss.str(); cost=rand()%99; num_shares=rand()%99; //insert the elements into the list using the insert method Test.insert(s, cost, num_shares, i); } cout< //display the list elements cout<<"The Main list is: "< Test.display(cout); cout< //print the middle element data of the list by calling the //returnMiddleList method cout<<"The middle element of the list is: "< Test.returnMiddleList(); cout< //split the list into two halves and display the contents of the two list //by calling the splitInHalf method cout<<"Splitting the List into two halves: "< Test.splitInHalf(); system ("pause"); return 0; } Show transcribed image text Objectives: 1. Exercise doubly-linked List 2. insertion, deletion, and reverse Overview 1. Continue with the stock exercise in Lab 3. 2. Create a portfolio class which stores stocks in doubly-linked list. 3. Portfolio class has load and store functions to keep all its stocks on files. 4. How do you prove that the portfolio is indeed linked correctly in both directions? (Want one answer? highlight next line) 5. Create your own test data such that you can demonstrate stock insertion and deletion at the beginning/ middle/ end of the portfolio. Discussions 1. How would you support ''copying a portfolio''? 2. How about merging two portfolios into one? Such as port3 = port1 + port2; 3. If you are further ahead, try two implementations: one with only head / tail, and another with head / tail/ size. 4. If you are even more further ahead, try have the list as an ordered list. Note that you do not really need a sorting algorithm to do so. Instead, while you're loading from the file, insert each stock in order will do the trick. If you're up to this stage. let me know who you are. so I can keep you challenged. Lab 3 Linked List Objectives: 1. Get yourself familiar with the forward Linked List creation and operations. 2. Manipulate pointers 3. Create Linked node by is-a or has-a Overview 1. A stock in a portfolio contains a stock symbol (e.g. AAPL), a cost (i.e. purchase price), and the number of shares. 2. Write the stock class. 3. Write a program that creates a forward linked list of at least 20 elements, where each element holds a stock. The stock symbol is a string which you can generate randomly or just do A1, A2, etc. The cost and number of shares are randomly generated between 0 and 99. Print the list. 4. Write the function ''returnMiddleList'' to find the middle element of the linked list in one pass. Print the this element and the position of this element (starting at zero) in relation to the head (where the head = 0, the element pointed to by the head = 1, the element pointed to by the previous one = 2, etc). 5. Split the list in half at the middle element to create two entirely separate* linked lists of near equal size (+/- 1) and print the two lists. In other words, write the ''split in half'' function. Discussions 1. Can you try both is-a arid has-a implementation for node? What do you like or don't like? 2. If you add a length field, finding middle is fairly easy to do. What if you do not have length? 3. Do you do ''add'' to list when you create a new stock? 4. What if the stock portfolio is on a disk file? 3684 Here I have done Lab 3 and need to do Lab 3+. What I need to do is from the stock class, single link list create a portfolio class, double link list, be able to store, insert, delete a print reverse of the portfolio on a file preferable, if not screen it is fine. ==============Lab 3 Implementation========================= #ifndef StockHeader #define StockHeader #include #include #include using namespace std; //typedef string ElementType; class Stock { private: class Node { public: string data; double cost; int num_stocks; Node * next; Node( ): data( ), next( NULL ) {} Node(string initData, double costStock, int number ) { data = initData ; cost = costStock; num_stocks = number; next = NULL ; } }; // end of Node class typedef Node * NodePointer; public: Stock( ); /* Construct a List object Precondition: none. Postcondition: An empty List object has been constructed. */ Stock( const Stock &source ); /* Construct a copy of a List object. Precondition: None. Postcondition: A copy of source has been constructed. */ ~Stock( ); /* Destroys a List object. Precondition: None. Postcondition: Any memory allocated to the List object has been freed. */ const Stock & operator=( const Stock &rightSide ); /* Assign a copy of a List object to the current object. Precondition: none Postcondition: A copy of rightside has been assigned to this object. A constant reference to this list is returned. */ int getSize( ) const; /* Returns the size of the list (number of items in the list) Precondition: none Postcondition: The return value is the number of items in the list. */ bool empty( ) const; /* Check if this List is empty Precondition: none Postcondition: The return value is true if this List object is empty; otherwise the return value is false. */ void insert(string initData, double costStock, int number, int index ); /* Insert a value into this List at a given index Precondition: The index is valid (0 <= index <= the list size). The first position is index 0, the second position is index 1, etc. Postcondition: dataval has been inserted into the list at the position determined by index (provided there is room and index is a legal position). */ void erase( int index ); /* Remove the value from this List at a given index. Precondition: The list is not empty and index is valid (0 <= index < the list size). Postcondition: the element at position index has been removed (provided index is a legal position). */ void display( ostream &out ) const; /* Display the contents of this List Precondition: ostream out is open Postcondition: the items in this List have been output to stream out */ void returnMiddleList(); /*Displays the Middle element data in the List Precondition: Use getSize() method to get the size divide it into half and set as mid Postcondition: use iterator to go the mid-1 position so that it prints the exact mid element */ void splitInHalf(); /* Displays the splitted lists Precondition: Create two Stock objects into which the two list elements are stored Postcondition: Use an iterator and store the first half elements of the list into List1 by checking the condition whether the i < mid If i>mid then store the other half into the second list List2. Display the elements of the List1 Display the elements of the List2 */ private: NodePointer has_a; int mySize; }; // end of List class #endif //List.cpp #include "stdafx.h" #include "StockHeader.h" //Construct empty List Stock::Stock() { has_a = NULL; mySize = 0; } //Construct copy of source List Stock::Stock( const Stock &source ) { has_a = NULL; mySize = 0; //check the code, the value of mySize is //changed int index = 0; NodePointer current = source.has_a; while(current != NULL) { insert(current->data,current->cost, current->num_stocks, index++); current = current->next; } } Stock::~Stock( ) { for(int i = 0; i <= mySize; i++) erase(i); } const Stock & Stock::operator=( const Stock &rightSide ) { int index = 0; NodePointer current = rightSide.has_a; while(current != NULL) { insert(current->data,current->cost, current->num_stocks, index++); current = current->next; } return *this; } int Stock::getSize( ) const { return mySize; } bool Stock::empty( ) const { if(mySize == -1) return true; return false; } void Stock::insert( string initData, double costStock, int number, int index ) { if(index == 0) { NodePointer NewNode = new Node; NewNode->data = initData; NewNode->cost = costStock; NewNode->num_stocks = number; NewNode->next = has_a; has_a = NewNode; mySize++; } else if(index > 0 && index <= (mySize + 1)) { NodePointer current = has_a; for(int i = 0; i < index - 1; i++) current = current->next; NodePointer NewNode = new Node; NewNode->data = initData; NewNode->cost = costStock; NewNode->num_stocks = number; NewNode->next = current->next; current->next = NewNode; mySize++; } } void Stock::erase( int index ) { if(has_a != NULL) { if(index == 0) { NodePointer temp = has_a; has_a = temp->next; delete temp; mySize--; } else if(index > 0 && index <= (mySize + 1)) { NodePointer current = has_a; for(int i = 0; i < index -1; i++) current = current->next; NodePointer temp = current->next; if(temp!=NULL) //check the condition that has //been modified current->next = temp->next; delete temp; mySize--; } } } void Stock::display( ostream &out ) const { NodePointer current = has_a; cout<<"Stock Symbol Cost Number of Shares"< cout<<"---------------------------------------------"< while(current != NULL) { out << current->data << " " << current->cost <<" " next; } } void Stock::returnMiddleList() { int mid=getSize()/2; NodePointer current = has_a; if(mid == 0) { cout 0 && mid <= (mySize + 1)) { for(int i = 0; i current = current->next; coutdata, current->cost, current-> num_stocks, i); current=current->next; } else { List2.insert(current->data, current->cost, current-> num_stocks, k); current=current->next; k++; } } //display the first half elements in the list cout<<"The first half: "< List1.display(cout); //display the second half elements in the the list cout<<"The second half: "< List2.display(cout); } // StockLinkedList.cpp : Defines the entry point for the console application. #include #include #include #include #include "StockHeader.h" using namespace std; int main(int argc, char const *argv[]) { srand(time(NULL)); string s; Stock Test; double cost; int num_shares; int i; //generating random numbers and stock symbols for(i=0;i<20; i++) { stringstream ss; ss << "A" < s=ss.str(); cost=rand()%99; num_shares=rand()%99; //insert the elements into the list using the insert method Test.insert(s, cost, num_shares, i); } cout< //display the list elements cout<<"The Main list is: "< Test.display(cout); cout< //print the middle element data of the list by calling the //returnMiddleList method cout<<"The middle element of the list is: "< Test.returnMiddleList(); cout< //split the list into two halves and display the contents of the two list //by calling the splitInHalf method cout<<"Splitting the List into two halves: "< Test.splitInHalf(); system ("pause"); return 0; } Show transcribed image text Lab 3+ Doubly Linked List Objectives: 1. Exercise doubly-linked List 2. insertion, deletion, and reverse Overview 1. Continue with the stock exercise in Lab 3. 2. Create a portfolio class which stores stocks in doubly-linked list. 3. Portfolio class has load and store functions to keep all its stocks on files. 4. How do you prove that the portfolio is indeed linked correctly in both directions? (Want one answer? highlight next line) S. Create your own test data such that you can demonstrate stock insertion and deletion at the beginning! middle! end of the portfolio. 3685 Here I have done Lab 3 already, see bottom. I need help on how to do Lab 3+ ======================Lab 3 Implementation================= #ifndef StockHeader #define StockHeader #include #include #include using namespace std; //typedef string ElementType; class Stock { private: class Node { public: string data; double cost; int num_stocks; Node * next; Node( ): data( ), next( NULL ) {} Node(string initData, double costStock, int number ) { data = initData ; cost = costStock; num_stocks = number; next = NULL ; } }; // end of Node class typedef Node * NodePointer; public: Stock( ); /* Construct a List object Precondition: none. Postcondition: An empty List object has been constructed. */ Stock( const Stock &source ); /* Construct a copy of a List object. Precondition: None. Postcondition: A copy of source has been constructed. */ ~Stock( ); /* Destroys a List object. Precondition: None. Postcondition: Any memory allocated to the List object has been freed. */ const Stock & operator=( const Stock &rightSide ); /* Assign a copy of a List object to the current object. Precondition: none Postcondition: A copy of rightside has been assigned to this object. A constant reference to this list is returned. */ int getSize( ) const; /* Returns the size of the list (number of items in the list) Precondition: none Postcondition: The return value is the number of items in the list. */ bool empty( ) const; /* Check if this List is empty Precondition: none Postcondition: The return value is true if this List object is empty; otherwise the return value is false. */ void insert(string initData, double costStock, int number, int index ); /* Insert a value into this List at a given index Precondition: The index is valid (0 <= index <= the list size). The first position is index 0, the second position is index 1, etc. Postcondition: dataval has been inserted into the list at the position determined by index (provided there is room and index is a legal position). */ void erase( int index ); /* Remove the value from this List at a given index. Precondition: The list is not empty and index is valid (0 <= index < the list size). Postcondition: the element at position index has been removed (provided index is a legal position). */ void display( ostream &out ) const; /* Display the contents of this List Precondition: ostream out is open Postcondition: the items in this List have been output to stream out */ void returnMiddleList(); /*Displays the Middle element data in the List Precondition: Use getSize() method to get the size divide it into half and set as mid Postcondition: use iterator to go the mid-1 position so that it prints the exact mid element */ void splitInHalf(); /* Displays the splitted lists Precondition: Create two Stock objects into which the two list elements are stored Postcondition: Use an iterator and store the first half elements of the list into List1 by checking the condition whether the i < mid If i>mid then store the other half into the second list List2. Display the elements of the List1 Display the elements of the List2 */ private: NodePointer has_a; int mySize; }; // end of List class #endif //List.cpp #include "stdafx.h" #include "StockHeader.h" //Construct empty List Stock::Stock() { has_a = NULL; mySize = 0; } //Construct copy of source List Stock::Stock( const Stock &source ) { has_a = NULL; mySize = 0; //check the code, the value of mySize is //changed int index = 0; NodePointer current = source.has_a; while(current != NULL) { insert(current->data,current->cost, current->num_stocks, index++); current = current->next; } } Stock::~Stock( ) { for(int i = 0; i <= mySize; i++) erase(i); } const Stock & Stock::operator=( const Stock &rightSide ) { int index = 0; NodePointer current = rightSide.has_a; while(current != NULL) { insert(current->data,current->cost, current->num_stocks, index++); current = current->next; } return *this; } int Stock::getSize( ) const { return mySize; } bool Stock::empty( ) const { if(mySize == -1) return true; return false; } void Stock::insert( string initData, double costStock, int number, int index ) { if(index == 0) { NodePointer NewNode = new Node; NewNode->data = initData; NewNode->cost = costStock; NewNode->num_stocks = number; NewNode->next = has_a; has_a = NewNode; mySize++; } else if(index > 0 && index <= (mySize + 1)) { NodePointer current = has_a; for(int i = 0; i < index - 1; i++) current = current->next; NodePointer NewNode = new Node; NewNode->data = initData; NewNode->cost = costStock; NewNode->num_stocks = number; NewNode->next = current->next; current->next = NewNode; mySize++; } } void Stock::erase( int index ) { if(has_a != NULL) { if(index == 0) { NodePointer temp = has_a; has_a = temp->next; delete temp; mySize--; } else if(index > 0 && index <= (mySize + 1)) { NodePointer current = has_a; for(int i = 0; i < index -1; i++) current = current->next; NodePointer temp = current->next; if(temp!=NULL) //check the condition that has //been modified current->next = temp->next; delete temp; mySize--; } } } void Stock::display( ostream &out ) const { NodePointer current = has_a; cout<<"Stock Symbol \t Cost \t Number of Shares"< cout<<"---------------------------------------------"< while(current != NULL) { out << current->data << "\t\t " << current->cost <<" \t\t " current = current->next; } } void Stock::returnMiddleList() { int mid=getSize()/2; NodePointer current = has_a; if(mid == 0) { cout } else if(mid > 0 && mid <= (mySize + 1)) { for(int i = 0; i current = current->next; cout } } void Stock::splitInHalf() { int mid=getSize()/2; NodePointer current = has_a; Stock List1; Stock List2; int k=0; //logic to split the the list into two halves for(int i = 0; i { if(i { List1.insert(current->data, current->cost, current-> num_stocks, i); current=current->next; } else { List2.insert(current->data, current->cost, current-> num_stocks, k); current=current->next; k++; } } //display the first half elements in the list cout<<"The first half: "< List1.display(cout); //display the second half elements in the the list cout<<"The second half: "< List2.display(cout); } // StockLinkedList.cpp : Defines the entry point for the console application. #include #include #include #include #include "StockHeader.h" using namespace std; int main(int argc, char const *argv[]) { srand(time(NULL)); string s; Stock Test; double cost; int num_shares; int i; //generating random numbers and stock symbols for(i=0;i<20; i++) { stringstream ss; ss << "A" < s=ss.str(); cost=rand()%99; num_shares=rand()%99; //insert the elements into the list using the insert method Test.insert(s, cost, num_shares, i); } cout< //display the list elements cout<<"The Main list is: "< Test.display(cout); cout< //print the middle element data of the list by calling the //returnMiddleList method cout<<"The middle element of the list is: "< Test.returnMiddleList(); cout< //split the list into two halves and display the contents of the two list //by calling the splitInHalf method cout<<"Splitting the List into two halves: "< Test.splitInHalf(); system ("pause"); return 0; } 3686 Electronic submission: You must submit a single .zip archive file of your project folder. Use a utility that produces .zip files (Windows or Mac compression utility). Objectives: * To read/write from/to a text file * To use methods Project setup: Use your Netbeans IDE to create the project hw06. This project should have a single class file, Main.java Language features used: - Scanner, File, PrintWriter Problem Description: In this homework you going to use files for reading/writing and random number generation. You are basically creating product codes, each code consisting of two letters (A-K), four digits (0-9) and two letters (L-Z). Each part is randomly generated and saved in its own file. You will thus have three files, a prefix.txt, code.txt and suffix.txt. Your last task is to merge each code part to produce a final product code that is saved to the productCode.txt file. You will generate/merge 50 such codes. ______________________________________ RUN 1 prefix.txt was successfully created. suffix.txt was successfully created. code.txt was successfully created. productCode.txt was successfully created. ___________________________________________ HF 3806 RO HF3806RO JF 0396 QL JF0396QL HC 7792 ST HC7792ST HE 9363 ST HE9363ST HA 9559 VV HA9559VV HD 7759 PN HD7759PN DF 6309 OM DF6309OM IF 9592 ZT IF9592ZT AB 5192 NN AB5192NN HK 2580 LM HK2580LM HF 8288 QM HF8288QM AK 3794 ZO AK3794ZO FC 4990 PX FC4990PX JF 1018 XU JF1018XU FE 9988 ML FE9988ML HH 4356 QV HH4356QV II 8557 UU II8557UU AJ 3022 YM BH 2672 NP CB 1903 SN prefix.txt code.txt suffix.txt productCode.txt ________________________________________ Program requirements: (1) Use the Main.java file provided as the starting point. This file contains the four methods you are to implement. Each is commented with what it does, so refer to these comments for details. (2) This time you will use a few new features. (a) Random class: To generate random numbers this time you will use the Random class and the .nextInt(int value) method. This method returns an integer value in the range 0 <= r < value. To create an object of this class use: Random rnd = new Random(); Use rnd.nextInt() to generate the numbers. Use similar techniques used in class to generate the corresponding characters. (b) try with resources: Recall how when using file IO a FileNotFoundException is thrown when the file is not found. To handle this issue use the following: try ( PrintWriter pw = new PrintWriter("someFile.txt"); Scanner s = new Scanner(new File("otherFile.txt"); ) {? // Put file processing code here } catch (FileNotFoundException e) { System.err.println(e.getMessage()); This form of the try/catch is called try with resources, and it will close all the files it opened for you. Notice the absence of the .close() methods. Note: Use this Main.java as starting point. /* * To change this license header, choose License Headers in Project Properties. * To change this template file, choose Tools | Templates * and open the template in the editor. */ package hw06; import java.io.File; import java.io.FileNotFoundException; import java.io.PrintWriter; import java.util.Random; import java.util.Scanner; public class Main { private static final int PRODUCT_COUNT = 50; public static void main(String[] args) { /* (1) Generate the prefix labels. */ /* (2) Generate the suffix labels. */ /* (3) Generate the codes. */ /* (4) Merge the two labels and code to produce the final product code. */ }// end main() /* (1) Generate the prefix labels. These are two letter combinations * generated randomly with each letter in the range A-K. Thus you * will have labels from AA-KK. * * Write 50 labels to the file prefix.txt. */ public static void writePrefixLabelsToFile(String prefixFile) { }// end writePrefixLabelsToFile() /* (2) Generate the suffix labels. These are two letter combinations * generated randomly with each letter in the range L-Z. Thus you * will have labels from LL-ZZ. * * Write 50 labels to the file suffix.txt */ public static void writeSuffixLabelsToFile(String suffixFile) { }// end writeSuffixLabelsToFile() /* (3) Generate the codes. These are 4 letter combinations * generated randomly with each letter in the range 0-9. Thus you * will have codes from 0000-9999. * * Write 50 codes to the file code.txt */ public static void writeCodesToFile(String codeFile) { }// end writeCodesToFile() /* (4) Merge the two labels and code to produce the final product code. The * final product code will consist of . Each code * then will be in the range AA000LL-KK9999ZZ. * * Merge by using a prefix, a code and a suffix from their corresponding * files. You are creating 50 such product codes, so for each product * use the respective value from each file. Each value is used exactly * once, and all values are used. * * Write these final 50 product codes to the file productCode.txt */ public static void mergeProductCodesToFile(String prefixFile, String codeFile, String suffixFile, String productFile) { }// end mergeProductCodesToFile() }// end Main 3687 In a EF 4.1 Code First tutorial the following code is given: public class Department { public int DepartmentId { get; set; } [Required] public string Name { get; set; } public virtual ICollection Collaborators { get; set; } } Then it is explained that the fluent interface is more flexible: Data Annotations are definitely easy to use but it is preferable to use a programmatic approach that provides much more flexibility. The example of using the fluent interface is then given: protected override void OnModelCreating(ModelBuilder modelBuilder) { modelBuilder.Entity().Property(dp => dp.Name).IsRequired(); modelBuilder.Entity().HasKey(ma => ma.ManagerCode); modelBuilder.Entity().Property(ma => ma.Name) .IsConcurrencyToken(true) .IsVariableLength() .HasMaxLength(20); } I can't understand why the fluent interface is supposedly better. Is it really? From my perspective it looks like the data annotations are more clear, and have more of a clean semantic feel to it. My question is why would a fluent interface be a better option than using attributes, especially in this case? (Note: I'm quite new to the whole concept of fluent interfaces, so please expect no prior knowledge on this.) 3688 Dynamic Programming. Need help with this. Thank you Show transcribed image text The table given below shows the dimensions of 5 matrices: This problem is about finding the most expensive way of multiplying the matrices A1 to A5. a) Parenthesize the product A15 such that the total number of scalar multiplications is maximized. 3689 Due Dates: ? Hierarchy chart, pseudocode for main, module specs for EACH function ? Source program (.cpp file) with screeen output: Problem: You are to write a program in C++ to play a guessing game. In this program, you'll need 2 arrays (one array of ints of size 50 in main, one array of ints of size 20 in the game function) and you'll write to a text file (declare the file variable in main). In main, initialize the current index to 0, initialize the random seed, then in a loop, do the following: ? **calculate a random number between 1 and 100 (inclusive) and assign to the element in the main array at the current index. (see How to Use the Random Functions below on page 3) ? call a function (that you write) to play the guessing game (one game) that returns how many guesses the user made-- assign to a main variable (see details in A. below) ? increment the current index ? repeat to ** if the current index < 50 AND the function that asks if the user wants to continue returns true (see details in C. below) After the main loop, call the selectionSort function EXACTLY AS IT'S WRITTEN IN THE TEXTBOOK (you're NOT allowed to change it) so it sorts the main array. Then call another function to write the array to a text file, and you MUST pass the current index (indicating how many elements were assigned) as well as the main array (see details in D. below). You MUST declare as external consts 100 and 50 and 20, and use them in the program (NEVER USE ANY LITERAL IN YOUR PROGRAM OTHER THAN 0 OR 1, other than in the const declarations! Function details: A. In the function to play one guessing game, you MUST have an int "value" parameter for the answer number (will be the current random number from main, but this function doesn't need to "know" that). Inside the function declare an array of ints. You'll be counting how many in-range and non-duplicate guesses the user made, so you'll need to declare a local counter and initialize it to 0. Be sure to do the following: ? ***call a function to have the user guess a number (must not be guessed already) (see B. below) The guess will be in the guessArray, but you are to also assign it to a local int. ? check if the guess equals the game number (int parameter), is higher than the game number, or lower than the game number (display a message to the screen indicating the results of the comparison) ? repeat to *** if the user didn't guess the game number and the counter (of how many guesses) < 20 (remember to use the const!) CIS 22A Prog. HW# 6 A????1 page 2 of 3 ? After the game loop, if the user guessed the correct answer (parameter), display a message like "You guessed it in " then how many guesses the user made by displaying the local counter, and also display the answer. If the user didn't guess the correct answer , display a message like "Sorry, you ran out of guesses" and display the correct answer. B. This function is to get the user's guess, you'll be updating the guessArray and the counter (so it MUST be a "reference parameter"), but you must do the following: ? Prompt the user and read the user's guess. ? If the guess < 1 or > 100 (YOU MUST USE THE CONST HERE), display an error message. ? If the guess is 1-100 and if the user already guessed that number (CALLING THE SEQUENTIAL SEARCH EXACTLY AS WRITTEN IN THE TEXTBOOK), display a message that it was already guessed. ? Loop back to the prompt and read if there was an input error (out of range or already guessed) ? Set the guessArray element at the index of the counter to the user's guess ? Increment the counter ? Return the user's guess in a return statement C. This function is to prompt the user if he/she wants to play again. Read the answer into a char. You need to do: cin.ignore() here, too. If the tolower(answer) is 'y' (MUST use tolower here), return true. Otherwise, return false. D. In the function to write to an output file, the main randomArray which MUST be a parameter ALONG WITH how many elements were assigned (current index). Call the openOutputFile function (given in class). If it opens, write the array, then close the file. See the test runs for how to display it (labels and format). You MUST use a for loop which iterates ONLY for how many elements were assigned to the array. DO NOT USE ANY EXTERNAL (global) VARIABLES! (External const is OK, they're not variables) Include in your programs: (ID FUNCTION IS OPTIONAL THIS TIME!) ? functions (one per "paragraph" described above AND THE LINEAR SEARCH + SELECTION SORT FUNCTION EXACTLY AS SHOWN IN THE TEXTBOOK called searchList , same as A. & B. ON PAGE 3)! (DON'T CHANGE, KEEP THE SAME NAME OF THE FUNCTIONs, ITS PARAMETERS AND LOCAL VARIABLES!) ? output file and function for opening an output file (see below) ? arrays of ints (NEVER ALLOW THE PROGRAM TO GO OUTSIDE THE ARRAY) ? NO LITERALS in the executable code (except 0 or 1) ? Comments (program header & variable) and indentation as usual ? Comment each function in the source file as shown in Chapter 6 of the textbook (or points will be deducted!) In the openOutputFile function, use the function as given in class (see Class Notes for Chapter 7 or 8). Also see the Class Notes for how to call this function. Turn in so main loops at least 3 times, the user guesses it, enters invalid input several times, and runs out of guessess. ALSO, TEST the program by changing the const for 50 to 5 and the const for 20 to 4. (Test runs are on Catalyst) (continued ==>) CIS 22A Prog. HW# 6 A????1 page 3 of 3 HOW TO USE THE RANDOM FUNCTIONS IN C++: ? rand() returns an int between 0 and RAND_MAX (inclusive), where RAND_MAX is #define'd in or ) ? #include and also ? srand(...) is function for initializing the random function: o Call ONLY ONCE at the beginning of a run (NOT every time you call rand(), nor inside a loop) o srand(time(0));// this is how you call srand (time(...) is in ) ? To get a number between MIN and MAX (inclusive): ((rand() % (MAX?MIN+1)) + MIN A. USE THIS LINEAR SEARCH FUNCTION (from Chapter 8, program 8-1) int searchList(const int list[], int numElems, int value) { int index = 0; // Used as a subscript to search array int position = ?1; // To record position of search value bool found = false; // Flag to indicate if the value was found while (index < numElems && !found) { if (list[index] == value) // If the value is found { found = true; // Set the flag position = index; // Record the value's subscript } index++; // Go to the next element } return position; // Return the position, or ?1 } B. USE THIS SELECTION SORT FUNCTION (from Chapter 8, program 8-5) void selectionSort(int array[], int size) { int startScan, minIndex, minValue; for (startScan = 0; startScan < (size ? 1); startScan++) { minIndex = startScan; minValue = array[startScan]; for(int index = startScan + 1; index < size; index++) { if (array[index] < minValue) { minValue = array[index]; minIndex = index; } } array[minIndex] = array[startScan]; array[startScan] = minValue; } } Extra Credit Problems (not due until the last lecture day of the quarter!): "Starting Out with C++" (textbook): 7th ed. pp. 444-446 #2, #4, #8, #9, 8th ed. pp. 448-451 #2, #5, #9, #10 3690 Dropdown Menu of Value Measures in a Pivot Chart I am not sure if this is posiible, but I thought that I'd ask anway. I have a pivot table that has several value measures. See below: My goal is to have a dropdown below the pivot that allows a selection of a measure. (Allowed, Allowed, % of Eligible, Days, or Allowed Per Day) I then would like a bar graph created based on the dropdown selection. In other words, if someone selected 'Allowed per day', a graph would be created with the States as the X axis and Allowed per day as the Y axis. I don't want the pivot to be filtered based on the dropdown selection, only the graph.. Is this even possible?? States Eligible Allowed Allowed % of Eligible Days Allowed Per Day California $6,845,454 $6,565,656 95.91 % 5,678 $1,156 New York $5,742,619 $1,934,022 33.68 % 2,468 $784 Nevada $228,471,997 $90,735,724 39.71 % 1,574 $57,647 Iowa $62,634,454 $1,956,474 3.12 % 845 $2,315 Florida $250,000,000 $175,000,000 70.00 % 4,545 $38,504 Thanks !! 3691 Drawing a random sample of k elements from a set of n elements. Our professor hasn't offered much help and I'm super confused on how to even start. Can anyone help me get on the right path please? Thank you!! 3692 (a)Draw a table showing the intermediate distance values of all the nodes at each iteration of the algorithm. (b)Show the final shortest-path tree. 3693 Draw the SNMP message sequence diagram using GetResponse-PDUs for the following system: Title: System Information: 172.16.42.1 IP Address: 172.16.42.1 System Name: System Description: "SunOS noc1" System Contact: System Location: "NM Lab" System Object ID: .iso.org.dod.internet.private.enterprises.43.1.8.5 System Up Time: 1000000 3694 Draw a schematic for a 6k x 8bit memory array using a minimum number of 2732s. What are the highest and the lowest memory addresses (in hex) in the array? 3695 Draw a conceptual model (also called Entity/Association model) to represent these data. Draw the relational schema associated with your conceptual model (data mapping). Show transcribed image text We want to design a database to model data from a site on TV series. The data are as follows. A series is described by a title, a type. and a broadcast network. A network airs several series, and a series is only aired on one network. A series can belong to several types. A series is composed of a set of episodes, which are classified by season. Each episode is thus described by a title, a date of first presentation, a number of seasons and the episode number in that season. An actor is simply described by his last and first names. An actor can play in several episodes; we will clarify its role in the episode by giving the last name and first name of the character he played. 3696 Draw a conceptual model (also called Entity/Association model) to represent these data. Don't forget cardinality. Show transcribed image text We want to design a database to model data from a site on TV series. The data are as follows. A series is described by a title, a type. and a broadcast network. A network airs several series, and a series is only aired on one network. A series can belong to several types. A series is composed of a set of episodes, which are classified by season. Each episode is thus described by a title, a date of first presentation, a number of seasons and the episode number in that season. An actor is simply described by his last and first names. An actor can play in several episodes; we will clarify its role in the episode by giving the last name and first name of the character he played. 3697 Draw the comparison tree to show the comparison steps to sort following array of IP addresses: [192.168. 23 .5, 192 .168.1 .1, 192 .168 .121 .12]. Also, highlight the path from the root node to the node in the tree that shows the list in IP address numerical order 3698 Draw the comparison tree to show the comparison steps to sort following array of IP addresses: [192.168. 23 .5, 192 .168.1 .1, 192 .168 .121 .12]. Also, highlight the path from the root node to the node in the tree that shows the list in IP address numerical order 3699 Draw a class diagram for the following situation: Whenever new patients are seen for the first time, they complete a patient information form that asks their name, address, phone number, and insurance carrier, which are stored in patient information file. Patients can sign up with only one carrier, but they must be signed up to be seen by the doctor. Each time a patient visits the doctor, an insurance claim is sent to the carrier for payment. The claim must contain information about the visit such as the date, purpose, and cost. It would be possible for a patient to submit two claims on the same day. Create a sequence diagram and a communication diagram for the following scenario: Every time a member of a health club enters the club, an attendant takes his or her card and scans it to make sure the person is an active member. If the member is not active, the system presents the amount of money it costs to renew the membership. The customer is given the chance to pay the fee and use the club, and the system makes note of the reactivation of the account so that special attention can be given to this customer when the next round of renewal notices are dispensed. 3700 I have done Lab#3 already but neet help on Lab 3+, This is based on C++ Data Structure Double Linked List ===========================Lab 3 Implementation================= #ifndef StockHeader #define StockHeader #include #include #include using namespace std; //typedef string ElementType; class Stock { private: class Node { public: string data; double cost; int num_stocks; Node * next; Node( ): data( ), next( NULL ) {} Node(string initData, double costStock, int number ) { data = initData ; cost = costStock; num_stocks = number; next = NULL ; } }; // end of Node class typedef Node * NodePointer; public: Stock( ); /* Construct a List object Precondition: none. Postcondition: An empty List object has been constructed. */ Stock( const Stock &source ); /* Construct a copy of a List object. Precondition: None. Postcondition: A copy of source has been constructed. */ ~Stock( ); /* Destroys a List object. Precondition: None. Postcondition: Any memory allocated to the List object has been freed. */ const Stock & operator=( const Stock &rightSide ); /* Assign a copy of a List object to the current object. Precondition: none Postcondition: A copy of rightside has been assigned to this object. A constant reference to this list is returned. */ int getSize( ) const; /* Returns the size of the list (number of items in the list) Precondition: none Postcondition: The return value is the number of items in the list. */ bool empty( ) const; /* Check if this List is empty Precondition: none Postcondition: The return value is true if this List object is empty; otherwise the return value is false. */ void insert(string initData, double costStock, int number, int index ); /* Insert a value into this List at a given index Precondition: The index is valid (0 <= index <= the list size). The first position is index 0, the second position is index 1, etc. Postcondition: dataval has been inserted into the list at the position determined by index (provided there is room and index is a legal position). */ void erase( int index ); /* Remove the value from this List at a given index. Precondition: The list is not empty and index is valid (0 <= index < the list size). Postcondition: the element at position index has been removed (provided index is a legal position). */ void display( ostream &out ) const; /* Display the contents of this List Precondition: ostream out is open Postcondition: the items in this List have been output to stream out */ void returnMiddleList(); /*Displays the Middle element data in the List Precondition: Use getSize() method to get the size divide it into half and set as mid Postcondition: use iterator to go the mid-1 position so that it prints the exact mid element */ void splitInHalf(); /* Displays the splitted lists Precondition: Create two Stock objects into which the two list elements are stored Postcondition: Use an iterator and store the first half elements of the list into List1 by checking the condition whether the i < mid If i>mid then store the other half into the second list List2. Display the elements of the List1 Display the elements of the List2 */ private: NodePointer has_a; int mySize; }; // end of List class #endif //List.cpp #include "stdafx.h" #include "StockHeader.h" //Construct empty List Stock::Stock() { has_a = NULL; mySize = 0; } //Construct copy of source List Stock::Stock( const Stock &source ) { has_a = NULL; mySize = 0; //check the code, the value of mySize is //changed int index = 0; NodePointer current = source.has_a; while(current != NULL) { insert(current->data,current->cost, current->num_stocks, index++); current = current->next; } } Stock::~Stock( ) { for(int i = 0; i <= mySize; i++) erase(i); } const Stock & Stock::operator=( const Stock &rightSide ) { int index = 0; NodePointer current = rightSide.has_a; while(current != NULL) { insert(current->data,current->cost, current->num_stocks, index++); current = current->next; } return *this; } int Stock::getSize( ) const { return mySize; } bool Stock::empty( ) const { if(mySize == -1) return true; return false; } void Stock::insert( string initData, double costStock, int number, int index ) { if(index == 0) { NodePointer NewNode = new Node; NewNode->data = initData; NewNode->cost = costStock; NewNode->num_stocks = number; NewNode->next = has_a; has_a = NewNode; mySize++; } else if(index > 0 && index <= (mySize + 1)) { NodePointer current = has_a; for(int i = 0; i < index - 1; i++) current = current->next; NodePointer NewNode = new Node; NewNode->data = initData; NewNode->cost = costStock; NewNode->num_stocks = number; NewNode->next = current->next; current->next = NewNode; mySize++; } } void Stock::erase( int index ) { if(has_a != NULL) { if(index == 0) { NodePointer temp = has_a; has_a = temp->next; delete temp; mySize--; } else if(index > 0 && index <= (mySize + 1)) { NodePointer current = has_a; for(int i = 0; i < index -1; i++) current = current->next; NodePointer temp = current->next; if(temp!=NULL) //check the condition that has //been modified current->next = temp->next; delete temp; mySize--; } } } void Stock::display( ostream &out ) const { NodePointer current = has_a; cout<<"Stock Symbol \t Cost \t Number of Shares"< cout<<"---------------------------------------------"< while(current != NULL) { out << current->data << "\t\t " << current->cost <<" \t\t " next; } } void Stock::returnMiddleList() { int mid=getSize()/2; NodePointer current = has_a; if(mid == 0) { cout 0 && mid <= (mySize + 1)) { for(int i = 0; i current = current->next; coutdata, current->cost, current-> num_stocks, i); current=current->next; } else { List2.insert(current->data, current->cost, current-> num_stocks, k); current=current->next; k++; } } //display the first half elements in the list cout<<"The first half: "< List1.display(cout); //display the second half elements in the the list cout<<"The second half: "< List2.display(cout); } // StockLinkedList.cpp : Defines the entry point for the console application. #include #include #include #include #include "StockHeader.h" using namespace std; int main(int argc, char const *argv[]) { srand(time(NULL)); string s; Stock Test; double cost; int num_shares; int i; //generating random numbers and stock symbols for(i=0;i<20; i++) { stringstream ss; ss << "A" < s=ss.str(); cost=rand()%99; num_shares=rand()%99; //insert the elements into the list using the insert method Test.insert(s, cost, num_shares, i); } cout< //display the list elements cout<<"The Main list is: "< Test.display(cout); cout< //print the middle element data of the list by calling the //returnMiddleList method cout<<"The middle element of the list is: "< Test.returnMiddleList(); cout< //split the list into two halves and display the contents of the two list //by calling the splitInHalf method cout<<"Splitting the List into two halves: "< Test.splitInHalf(); system ("pause"); return 0; } Show transcribed image text Lab 3+ Doubly Linked List Objectives: 1. Exercise doubly-Linked List 2. insertion, deletion, and reverse Overview 1. Continue with the stock exercise in Lab 3. 2. Create a portfolio class which stores stocks in doubly-linked list. 3. Portfolio class has load and store functions to keep all its stocks on files. 4. How do you prove that the portfolio is indeed linked correctly in both directions? (Want one answer? highlight next line) 5. Create your own test data such that you can demonstrate stock insertion and deletion at the beginning! middle! end of the portfolio. Discussions 1. How would you support ''copying a portfolio''? 2. How about merging two portfolios into one? Such as port3 = port1 + port2; 3. If you are further ahead, try two implementations: one with only head / tail, and another with head / tail/ size. 4. If you are even more further ahead, try have the list as an ordered list. Note that you do not really need a sorting algorithm to do so. Instead, while you're loading from the file, insert each stock in order will do the trick. If you're up to this stage, let me know who you are, so I can keep you challenged. Lab 3 Linked List Objectives: 1. Get yourself familiar with the forward Linked List creation and operations. 2. Manipulate pointers 3. Create Linked node by is-a or has-a Overview 1. A stock in a portfolio contains a stock symbol (e.g. AAPL), a cost (i.e. purchase price), and the number of shares. 2. Write the stock class. 3. Write a program that creates a forward linked list of at least 20 elements, where each element holds a stock. The stock symbol is a string which you can generate randomly or just do A1, A2, etc. The cost and number of shares are randomly generated between 0 and 99. Print the list. 4. Write the function ''returnMiddleList'' to find the middle element of the linked list in one pass. Print the this element and the position of this element (starting at zero) in relation to the head (where the head = 0, the element pointed to by the head = 1, the element pointed to by the previous one = 2, etc). 5. Split the list in half at the middle element to create two entirely separate* linked lists of near equal size (+1- 1) and print the two lists. In other words, write the ''split in half'' function. Discussions 1. Can you try both is-a arid has-a implementation for node? What do you like or don't like? 2. If you add a length field, finding middle is fairly easy to do. What if you do not have length? 3. Do you do ''add'' to list when you create a new stock? 4. What if the stock portfolio is on a disk file? 3701 This has to be done in C++ language //************************************************************************************************** // FILE: lab07.cpp // // DESCRIPTION: A simple number guessing game. The compter selects a // secret number within a user specified range. The user // then has a specified number of attempts in which to // correctly guess the secret number. the program provides // helpful feedback after each guess. // // This lab project illustrates the following C++ concepts: // 1. Writing functions. Function calls. Pass parameters by-value. Return values. // 2. Writing loops. // 3. Writing if statements, if-else statements, and if-elseif-elseif... statements. // // AUTHORS: ( 3702 Don't know how to put it, But I'll try to be as clear as possible I have a project in which I am creating lots of classes and those classes have some common properties and methods but those methods could have different code in them, So I decided to make an interface so that I could inherit that in all classes and all classes would have same methods in them like insert, update, delete with different code inside those those methods but this trick flopped when I discovered that not all classes have same structure like some have insert method but not update and if I inherit interface I have to provide a public declaration for all members of that interface which I don't want. Trick two I thought about abstract classes created one too but same problem all the abstract members has to be implemented with public. So long story short I want to create a common inheritable structure which would work as a non instance-able blue print for classes and could be inherited into lots of classes but in many classes I don't want to implement all of the members of that structure NOTE : I can do no-op(empty methods that do nothing, or return a null, for example) as some guys suggested me but that ain't the solution I am looking for because those unnecessary members will be visible during intellisence and that's what i want to avoid. How can I do that ? 3703 In my Domain I have an entity Activity which has a list of ITasks. Each implementation of this task has it's own properties beside the implementation of ITask itself. Now each operation of the Activity entity (e.g. Execute()) only needs to loop over this list and call an ITask method (e.g. ExecuteTask()). Where I'm having trouble is when a specific tasks' properties needs to be updated, as in configuring the task (not as part of the execute method). How do I get an instance of that task? The options I see are: Get the Activity by Id and cast the task I need. This'll either sprinkle my code with: Tasks.OfType().Single(t => t.Id == taskId) or Tasks.Single(t => t.Id == taskId) as SpecificTask Make each task unique in the whole system (make each task an entity), and create a new repository for each ITask implementation I don't like either option, the first because I don't like casting: I'm using NHibernate and I'm sure this'll come back and bite me when I start using Lazy Loading (NHibernate currently uses proxies to implement this). I don't like the second option because there are/will be dozens of different kind of tasks. Which would mean I'd have to create as many repositories. Am I missing a third option here? Or are any of my objections to the two options not justified? How have you solved this problem in the past? 3704 The distance from my house to my office is 1.5 miles. Every % morning, I have to decide whether to take the bus that % (once it arrives) 25 mph, or to walk. I can walk at 4 mph. % Write a script to determine how frequently the buses should % run to give them a 50% chance of getting me to the office % faster than walking. % % analysis: % 1. compute the time it takes to walk to work % 2. compute the time it takes on the bus % 3. difference is the tolerable wait time (twt) % 4. frequency is 1 / 2*twt % Use Matlab to write the script 3705 At a distance of 1300km from a ridge, rocks are determined to 45 million years old. What is the spreading rate of the ridge in cm/yr? Rate = distance/time. I must show all my work. I worked on this problem but I'm not sure is my answer is correct. Thanks !!! 3706 Displaying duplicate values in Pivot table I am trying to sort over 5000 records of sales data, with hundreds of SKU's looking to get LARGE Sales amount for particular SKU's, So I don't want to filter on SKU's as then I would have to select every SKU manually and copy sales amounts to different sheet. Want to determine SKU with most sales (not volumn, but actual # of sales). I can do this with count. Then I want actual sales amounts (with duplications to copy to new sheet so I can run calculations on these numbers). When I pivot on sales amounts it hides all duplicates. Simplified data: Part A Part B 750 Pivot (count) Part A = 8 sales 250 Pivot Part A sales 750 12000 Part A 12000 1500 Part A 750 1500000 Part A 1500 450 Part A 450 Part A 1500000 Part A 750 Part A 450 I am trying to get it to Pivot to show all 8 sales amounts : 750 12000 750 1500 450 1500000 750 450 So I can then determine what is the Largest number that is 60% of total all numbers: =8 sales*.6 60% = 4.8 or 5 =Large(A1:A8,5) which shoud come back 750 but formula is working on Pivot Part A sales from above showing only five numbers (60% = 3) which is giving me 1500 Can I get a pivot table to display all sales amounts for a certain SKU even when amounts are repeated??? Thanks !! 3707 (Display three cards) Write a program(JavaFX application) that displays three cards randomly selected from a deck of 52. Suppose card image files are named 1.png, 2.png, ..., 52.png and stored in the image/card directory in the package. All three cards are distinct and selected randomly. This application file should be placed in a package: javafxpkg.3randomcards. Hint: You can select random cards by storing the nubmers 1-52 to an array list, perform a random shuffle and use the first three numbers in the array list as the file names for the image. Use this: java.util.Collections.shuffle(alist). 3708 How to display a series with multiply data points at the same x values with error bars I have a data set the resembles this: 1 2 3 4 .9 .9 .9 .9 1 1 1 1 1.1 1.1 1.1 1.1 the first row are the x-values an the following three rows are the y-values, measured three times to increase the accuracy of the data. How do I graph this with a single error bar for each x-value. I tried repeating the x-value three times and that achieves the right kind of graph but the error bars are then for each individual point and they are far too large. If i just select all the cells for the y-values its says the data set is too large. Thanks !! 3709 Discuss the performance benefits of a larger page size in terms of (or via) its effect on the following: (i) the virtual address space range a single TLB entry can capture (called the A????1TLB reachA????1), (ii) the size of a page table, (iii) exploiting spatial locality in processes. What downsides of a large page size can you think of. Given these trade-offs, how might an OS go about choosing the page size? 3710 hat is the difference between a switched network and a non-switched network Are most modern networks configured to be switched? How would you intercept traffic on a switched network? 3711 a) What is the difference between circuit- (virtual circuit-) switched networks and packet switched networks? (2p) b) What is the difference between routing and routed protocols (2p) c) We say that IP layer is connection-less. Explain the meaning and consequences? (1p) d) We say that IP is best-effort delivery mechanism. Explain the reasons behind this statement? (1p) g) Name TCP/IPA????1s major success factors? (1p) h) When encapsulating the IP packet in the Ethernet frame, why do we need separate MAC address rather than using the same IP address at the MAC layer? (1p) a) Explain how the netmask is used when doing forwarding? (2p) c) What basic facilities and guarantees does the IP protocol provide to the transport layer? (1p) d) Discuss how TCP and UDP build on these basic facilities and what extra services TCP and UDP provide to applications in comparison to IP? (2p) g) How CRC checks the integrity of data (describe main concept only)? (1p) 3712 What is the difference beween cyberterrorists & cyber-hacktivists. (Please do not copy & paste) 3713 rom the diagram, prove that the two equations m1 = 3x + 4 and m3 = x + 10 imply together that x = 3 ?? Images: Thanks for help !! Show transcribed image text 2. Complete the two column proof. The diagram is given. Given m angle 1=3x+4 and m angle 3=x+10 prove x=3 3714 Devise a way to compress the following list of last names using a lossless technique similar to that shown in Table 8.6 for repeated terms. Describe your method and show the compressed list. Explain the characteristics that make your technique lossless (and not lossy). McConnor, Nelson McDavid, Nelson McDavid, Patricia McDonald, Mary McDonald, Marie McDonnell, Mike 3715 Devise a way to compress the following list of last names using a lossless technique similar to that shown in Table 8.6 for repeated terms. Describe your method and show the compressed list. Explain the characteristics that make your technique lossless (and not lossy). McConnor, Nelson McDavid, Nelson McDavid, Patricia McDonald, Mary McDonald, Marie McDonnell, Mike Show transcribed image text A capability list shows files for each user and requires less storage space than an access control matrix. Devise a way to compress the following list of last names using a lossless technique similar to that shown in Table 8.6 for repeated terms. Describe your method and show the compressed list. Explain the characteristics that make your technique lossless (and not lossy). McConnor, Nelson McDavid, Nelson McDavid, Patricia McDonald, Mary McDonald, Marie McDonnell, Mike 3716 I was developing a WindowsForm application in C#, with 2 forms. Regardless of what they both did specifically I needed to access values in form2 and send them to form1 and vice versa. For this to happen I found someone talking about constructor overload and it worked for me as I explain in the code. Form1: namespace miniDldMngr { public partial class Main : Form { miniDldMngr.SettingsForm settingsForm; //Instantiate settingsForm private void settingsToolStripButton_Click(object sender, EventArgs e) { settingsForm = new miniDldMngr.SettingsForm(this); //Create handle for Form1 settingsForm.ShowDialog(); //Form properties were changed to act like a dialog } Form2: namespace miniDldMngr { public partial class SettingsForm : Form { private Main HandleToForm1; //local variable to store handle to Form1 public SettingsForm() { InitializeComponent(); } public SettingsForm(Main frm1Handle) //overloaded constructor with handle to Form1 { InitializeComponent(); HandleToForm1 = frm1Handle; txtIni.Text = HandleToForm1.comboLoad.Text; //here's how i access controls on form1 for example, as long as modifiers are public } I came across this answer on Stack Overflow and user codesparkle commented: It's neither scalable nor OOP-like. Which lead me to believe that it might not have been the best choice to solve my initial issue. (S)He further added: One approach is to create an event in the class that knows the information which needs to be shown. The form can then register one of its methods as an event handler. Once the information becomes available, the class notifies the Form by calling that handler with an argument containing the displayable information. The beauty of this approach is that the class is decoupled (not dependent on) the implementation of Form. The MVC and MVVM design patterns are other robust ways of doing it. Now I'm left with some questions: What are the implications of the procedure I used? Why isn't it an object-oriented approach? What would be the best practice to send information back and forth between classes/forms? How would you go about creating the event mentioned by codesparkle? I don't know anything about MVC or MVVM design patterns, so some links to a structured explanation would be appreciated. Please consider that I'm very new to programming and I won't understand you if you talk like I know what I am doing. Code examples work wonders with me, since I can test them. 3717 I am developing a project where I have to load very large files (upto 50 MB). Currently I am loading these files completely into (consecutive) memory. This has the advantage that I can very easily change bytes at certain locations, because I do not know the structure of all bytes. However, my intention is to also change the structure, e.g. removing/adding 'chunks'. Now I have the idea to remove the 'known' parts out of it, store them in classes with a data chunk only containing those parts and make a sort of reference list to those chunks. E.g.: Original file: Header ChunkA 1 ChunkA 2 Intermediate ChunkB 1 Footer The result will be: ChunkA 1 and ChunkA 2 instance. ChunkB 1 instance 'File' instance and a reference with base offsets + reference to all chunks. At the end I have to 'recreate' or write the original file (with changes) back. Is this in general a good idea or is there some design pattern helping me in this? 3718 Developer FAQs Chapter 2 1. How many drawable folders are available in the res folder? 2. If you were creating an app in many different languages, would you have to write the entire program from scratch for each language? What part of the program would stay the same? What part of the program would be different? 3. In which subfolder in the Package Explorer are the XML files stored? 4. Which three controls were used in the chapter project? 5. What is the difference between a Linear layout and a Relative layout? 6. Is the default layout for an Android screen Linear or Relative? 7. Which measurement is most preferred for text size? Why? 8. What does px stand for? 9. What does sp stand for? 10. What does dpi stand for? 11. Which picture file types are accepted for an ImageView control? 12. Which picture file type is preferred? 13. In the Palette in the layout folder, in which category is the ImageView control found? 14. Which three properties were changed in the chapter project for the Button control? 15. What is the property that defines the name of a Button control? 16. Write one line of code that would launch a second class named Garden from the present MainActivity class. 17. Write one line of code that declares a Button control with the variable bt that references a button in the XML layout with the Id property of btnOpinion. 18. Write one line of code that opens the XML layout named lemon. 19. Which two keys are pressed to auto-complete a line of Java code? 20. What character is placed at the end of most lines of Java code? 3719 Developer FAQs 1. How many drawable folders are available in the res folder? 2. If you were creating an app in many different languages, would you have to write the entire program from scratch for each language? What part of the program would stay the same? What part of the program would be different? 3. In which subfolder in the Package Explorer are the XML files stored? 4. Which three controls were used in the chapter project? 5. What is the difference between a Linear layout and a Relative layout? 6. Is the default layout for an Android screen Linear or Relative? 7. Which measurement is most preferred for text size? Why? 8. What does px stand for? 9. What does sp stand for? 10. What does dpi stand for? 11. Which picture file types are accepted for an ImageView control? 12. Which picture file type is preferred? 13. In the Palette in the layout folder, in which category is the ImageView control found? 14. Which three properties were changed in the chapter project for the Button control? 15. What is the property that defines the name of a Button control? 16. Write one line of code that would launch a second class named Garden from the present MainActivity class. 17. Write one line of code that declares a Button control with the variable bt that references a button in the XML layout with the Id property of btnOpinion. 18. Write one line of code that opens the XML layout named lemon. 19. Which two keys are pressed to auto-complete a line of Java code? 20. What character is placed at the end of most lines of Java code? 3720 I have developed a system with one company profile. The system is built using WCF services, asp.net. Now another company wants to use our system as well. And they might need some customization and some of their data elements are different. So I am planning to create a separate database for the new company and branch the business logic layer. I thought of different options to architect this and ended up with the following. So what is the best way to design a system of this sort. Approach A: Expose the methods as two different WCF services one for each company. So there will be one WCF client interface (IClient) but two different Service classes for each company implenting them. ClientAService : IClient, ClientBService : IClient. Problem: The problem with this is all my datacontracts and datamembers are exposed to the client in 2 different namespaces. (ClientAService.ObjectABC and ClientBService.ObjectABC). So all the objects that I use in the website are conflicted. ie(when I have a list of ObjectABC in a datasource in the webpages, the website don't understand whether its from ClientAService or ClientBService. Approach B: Expose the methods as a single WCF Client, but 2 different business logic layer. But they will use the same datacontracts. So the methods will return the same datatype. so I will have one service class ClientService : IClient { public Method1(String Companycode) { if(CompanyCode == "A") return new AbusinessLogic().Method1(); else if(CompanyCode == "B") return new BbusinessLogic().Method1(); } } Problem: The only problem I can think of right now for every new company, I have add the above else if part for all my methods. I am also open to know if this can done in any other better way than the stated options. note: I was told that there might be more companies to be added in future. 3721 Develop a MATLAB script which asks the user to enter the initial values of x and y, the initial velocity, the cannon angle, and the final value of time. Depending on the calculated position of the cannonball, your script displays one of the following two statements: A????1The cannon ball is still in the airA????1 or A????1The cannon ball has hit the ground.A????1 Use if/else structure and the fprintf command to achieve these goals. Run two cases for the following two values. The initial x value 0 The initial y value 0 The initial velocity 50 m/s The initial angle 45 deg The final time 6 and 13 seconds Note that all values are identical between the two cases except for the final time. 3722 Develop a Java application that will reverse the elements of a singly linked list using a single stack of type LinkedStack. Consider the following: 1.Create one class, i.e. the test driver. In the main method, declare and populate a linked list with 10 GameEntry objects. Go ahead and add the objects in ascending order. Just place the objects in the list using addFirst. No need to create and/or call an A????1addA????1 method. 2.Declare a LinkedStack of generic type GameEntry. 3.Develop an algorithm to move list elements to the stack and back to the list again, reversing their order. 4.In the test driver (main method): a.Populate the list. b.Print the GameEntry objects in the list c.Move elements to the stack d.Print the GameEntry objects in the stack e.Move elements back to the list f.Print the GameEntry objects in the list. 3723 Develop a flowchart and then write a menu-driven C++ program that uses several user-defined functions, overloaded functions, and references. Upon program execution, the screen will be cleared and the menu shown below will appear at the top of the screen and centered. The menu items are explained below. Help Smallest Largest Quit H or h ( for Help ) option will invoke a function named help() which will display a help screen. The help screen(s) should guide the user how to interact with the program, type of data to be entered, and what results would the program produce. Each help screen should remain on the monitor until the user strikes any key. Once the user's input is processed, the screen will be cleared and the menu is displayed again. S or s ( for Smallest ) option will invoke the function named smallest( ) which will prompt the user for the two floats and calls the function findSmallest() which will compute and return the smallest number in the set. Once the smallest number is found, the function display() will be called (from the smallest() function) and displays the inputted numbers and the smallest using the format shown below. n1 = xxx.xx, n2 = yy.yy and smallest is zzz.zz where n1 is the first number and n2 is the second number. x, y, and z are place holders for the actual numbers. Note that two significant digits are required after the decimal point. The function prototypes to be used are: void smallest(void); float findSmallest(float f, float s); void display(float& f, float& s, float& small); where f refers to the first number and s refers to the second number. The results should stay on the screen with the following prompt, which will appear in the lower right hand corner of the screen: Strike any key to continue... Once the user has entered a key, the screen will be cleared and the menu is displayed again. Note: display() is an overloaded function. L or l ( for Largest ) option will invoke the function named largest( ) which will prompt the user for the two doubles and calls the function findLargestt() which will compute and return the largest number in the set. Once the largest number is found, the function display() will be called (from the largest() function) and displays the inputted numbers and the smallest using the format shown below. n1 = xxx.xxxx, n2 = yy.yyyy and largest is zzz.zzzz where n1 is the first number and n2 is the second number. x, y, and z are place holders for the actual numbers. Note that four significant digits are required after the decimal point. The function prototypes to be used are: void largest(void); double findLargest(double f, double s); void display(double& f, double& s, double& large); where f refers to the first number and s refers to the second number. The results should stay on the screen with the following prompt, which will appear in the lower right hand corner of the screen: Strike any key to continue... Once the user has entered a key, the screen will be cleared and the menu is displayed again. Note: display() is an overloaded function. Q or q (for Quit) option will clear the screen and returns the control to the Visual Studio IDE. Try your program with the following data sets and make sure the sample runs include them for the smallest and the largest. set 1 : 30.0, 60.0 set 2 : 30.5, -120.0 set 3 : 0.0, 0.0 set 4 : -60.8, -32.6 set 5 : -10.0, -10.0 set 6 : 150.0, 150.0 3724 Develop a class Polynomial. The internal representation of a Polynomial is an array of terms. Each term contains a coefficient and an exponent, e.g., the term 2x^4 has the coefficient 2 and the exponent 4. Develop a complete class containing the proper constructor and destructor functions as well as set and get functions. The class should also provide the following overloaded operator capabilities: a) Overload the addition operator (+) to add two Polynomials b)Overload the subtraction operator (-) to subtract two Polynomials c)Overload the assignment operator (=) to assign one Polynomial to another. d)Overload the multiplication operator (*) to multiply two Polynomials e)Overload the addition assignment operator (+=), subtraction assignment operator (-=), and multiplication assignment operator (*=). 3725 Develop class Polynomial. The internal representation of a polynomial is an array: one which stores the coefficients and the index of the array determines the exponents. For example, the polynomial (^ refers to the power of) -4x^0 + x^1 + 4x^3 - 3x^4 has the second element (exponent 1) of coefficient array store 1. Similarly the third term is stored as coefficient 4 in the 4 th element (index and exponent 3). Two ways to go about using an array: Assume the maximum size of the array as 50 i.e. the maximum exponent can be 49 and the coefficients and exponents are integers only. Using this method allows for less flexibility and used up more memory. Use a pointer and dynamic memory allocation for the array of each polynomial. This will require for the user to first enter the number of terms (or the highest exponent in the polynomial) and then the polynomial itself. Do remember to create a copy constructor as well if you use pointer for an array. Develop a full class with proper constructor and destructor functions as well as set and get functions for the inputting and printing the polynomial (the polynomial should be printed as shown above in the example). The class should also provide the following overloaded operator capabilities: Overload the addition (+) operator to add two polynomials Overload the subtraction (-) operator to subtract two polynomials Overload the assignment (=) operator to assign one polynomial to another Overload the multiplication operator (*) to multiply two polynomials The driver program (main part of the program) should ask the user to enter two Polynomials (specify to the user how the polynomial should be entered) and then give a choice to do the following: (1) Addition (2) Subtraction (3) Multiplication (4) Assignment (5) Exit Print the polynomials and the resulting polynomial of the operation after each operation is performed. The polynomial should be printed using the format above. The program should continue until the user wants to exit. 3726 Through most of my dev experience, I've never had to deal with much variety of access control architectures. They've all been pretty straight forward: Group [Create, Update, Delete] - User 1 - User 2 Group [Update, Delete] - User 2 Which, for all intents and purposes, works well. The problem I have is the actual implementation of it. All the solutions I've worked on either grant/deny the visibility of a menu link, or disable a button etc. This is all controlled via the top-most layer of the app, whether it be a WebApp or WinForms UI. I'm in the early stages of designing a rather large WinForms system so I'd like to get the security architecture right from the beginning. Although I don't see myself getting away from visually limiting the user from performing certain actions (by disabling restricted controls etc), I'm sure there are better solutions available then doing most of the work in the UI. As I understand it (and these might be limited by my ignorance), these are my options: Put the logic to return and verify user rights in the business layer On the form_load event, get these rules and enable/disabled UI elements Leave the UI elements in tact and halt the operation from within the business layer if the user doesn't have permission for the action (dirty!) Surely there must be more elegant solutions than this. Could someone please provide me with alternatives or improvements to the aforementioned ideas? Am I thinking about it incorrectly? Should I re-evaluate my database design while I'm at it? 3727 Determining placings based on total scores (1st, 2nd...10th) (determined by the tally at the end of event) and listing them and their corresponding points from highest to lowest! In F4:X4 are the following text cells DGC FATIMA GLENWOOD HCA M / STELLA ST MARY'S UMHLALI VIRGINIA WESTVILLE W /PARK In F31:X31 will be a total for each of the above, which is undetermined until the end of the event. The highest total will be 1st place, second highest will be 2nd place....10th place with the lowest total. In A33:C43 is a table as follows: POSITION TITLE POINTS 1 2 3 4 5 6 7 8 9 10 I want first place (the one with the highest score at the end of the event) to appear in B34 and their respective points to appear in C34; 2nd place to appear in B35 and the corresponding points to appear in C35... I've had IF, LOOKUP, INDEX and MATCH formula's going through my head, but I really don't know how to go about the solution of this! Help!!! 3728 Determine whether the relation with the directed graphs shown below is an equivalence relation. If not, why not? Can you add some edges to make each of them as an equivalence relation? Show transcribed image text Determine whether the relation with the directed graphs shown below is an equivalence relation. If not, why not? Can you add some edges to make each of them as an equivalence relation? 3729 Determine whether or not you believe certifications in systems forensics are necessary and explain why you believe this to be the case. Compare and contrast certifications and on-the-job training and identify which you believe is more useful for a system forensics professional. Provide a rationale with your response. Suppose you are the hiring manager looking to hire a new system forensics specialist. Specify at least five credentials you would expect an ample candidate to possess. Determine which of these credentials you believe to be the most important and provide a reason for your decision. 3730 Determine a way that schools could use RFID tags without violating privacy rights 3731 determine the transfer offset adress, based on the following object code for the JMP operand: i am not sure why i got them wrong Show transcribed image text determine the transfer offset adress, based on the following object code for the JMP operand: i am not sure why i got them wrong II. A JMP instruction begins at offset location 05C8H (next location will be 05CAH). Determine the transfer offset address, based on the following object code for the JMP operand: 3732 Determine if the series is convergent or not, and state please which rules you used. Above sigma sign is infinity sign, under sigma sign is n=1 then {(-1)^n+1 }* n / (2n^2)-2 Thanks for help !! 3733 Determine if the sequence is converges. You may use the basic null sequences. State clearly which results or rules you used and find the limit of the sequence, please. { 2(n^2 + 1)(n^2 -3) } / (2n +1)^3 (n + 2 ) n=1,2,..... Thanks !! 3734 Determine the propagation delay of the circuit given below indevidual gate delays Show transcribed image text Determine the propagation delay of the circuit given below indevidual gate delays 3735 Determine the propagation delay of the circuit given below. You are also given the table of individual gate delays. Show transcribed image text Determine the propagation delay of the circuit given below. You are also given the table of individual gate delays. 3736 Determine the output of the adder-subtractor circuit Show transcribed image text The adder-subtractor circuit has the following values for input select S and data inputs A and B: Determine, in each case, the values of the outputs S3, S2, S1, S, C4, C3, C2, and C1. 3737 Determine k largest elements in from a set of n elements. Our professor hasn't offered much help and I'm super confused on how to even start. Can anyone help me get on the right path please? Thank you!! 3738 I have been designing a database where it is very important to provide users with a good search mechanism. So I was wondering what some of the best practices are for using keywords to search over multiple database tables and return the relevent records? Some other things I am curious about: The users location, if they provide an address The speed of the algorithm Additional Information: I am using C# and LINQ-To-SQL. 3739 Design a synchronous counter to produce the following binary sequence. Use J-K flip-flops and other gates necessary: 1 A????1 4 A????1 3 A????1 5 A????1 7 A????1 6 A????1 2 A????1 1 A????1 4 A????1 A????1A????1. Design: draft the specification for the counter including the inputs and outputs. Construct state tables based on your specification, and use the K-map if necessary to optimize your functions for the outputs. Include the specification, input/output definitions, state tables, and the K-maps in your lab report. Create a new design file In this design file, draw the circuit you have designed from step 1. You may use SPDT switches to provide control inputs. You may use LED arrays to show your binary sequence or use a 7-segment display to display the binary sequence in a human readable manner. 3740 Design a push-down automaton for each of the following languages: a) L1 = {ai bj | i =< j =< 2i , i > 0} b) L2 = The complement of language {an bn | n >= 0 } PLEASE INDICATE YOUR SOLUTION STEP BY STEP FOR FULL POINTS 3741 Design a program using JAVA Language with a loop that asks the user to enter a SERIES of positive numbers. The user should enter a negative number to signal the end of the series. After all the positive numbers have been entered, the program should display their sum. Has to compile and work using JAVA language please. A sample output the teacher asked for is OUTPUT: Enter number 5 Enter number 10 Enter number 15 Enter number -5 Sum is 30 3742 Design a program using JAVA Language with a loop that asks the user to enter a SERIES of positive numbers. The user should enter a negative number to signal the end of the series. After all the positive numbers have been entered, the program should display their sum. Has to compile and work using JAVA language please. A sample output the teacher asked for is OUTPUT: Enter number 5 Enter number 10 Enter number 15 Enter number -5 Sum is 30 3743 Design a program using JAVA Language with a loop that asks the user to enter a series of positive numbers. The user should enter a negative number to signal the end of the series. After all the positive numbers have been entered, the program should display their sum. Has to compile and work using JAVA language please 3744 Design a program using java language that gives simple math quizzes. The program should display two random numbers that are to be added, such as 247 + 129 The program should allow the student to enter the answer. If the answer is correct, a message of congratulations should be displayed. If the answer is incorrect, a message showing the correct answer should be displayed 3745 Design a program that gives simple math quizzes. The program should display two random numbers that are to be added, such as 247 + 129 The program (Java language) should allow the student to enter the answer. If the answer is correct, a message of congratulations should be displayed. If the answer is incorrect, a message showing the correct answer should be displayed Here is the pseudo-code to follow //Declare the variables to hold intermediate and final values Declare Integer rand1, rand2, sum ans //Get the random numbers generated by the function //random and assign those values in rand1 and rand2 respectively Set rand1 = random(1, 999) Set rand2 = random(1, 999) //Dsiplay rand1 and rand2 in a formatted way treated for addition Display A????1 A????1, rand1 Display A????1+ A????1,rand2 //Read the result of addition inputted by the student and put it in ans Display A????1Please enter your answer.A????1 Input ans //Calculate the sum of random numbers and put it to sum Set sum = rand1 + rand2 //Determine whether ans and sum are same. If same display a congratulation message, or else display a failure message and show the correct If ans == sum Then Display A????1Congratulations!!! Your answer is correct.A????1 Else Display A????1Sorry!!! Your answer is wrong.A????1 Dis play A????1Correct answer is A????1, sum, A????1.A????1 End if 3746 Design a multiplier, which does the multiplication of a 3-bit number B(2:0) by a 4-bit number A(3:0). The multiplication process can be illustrated as follows: draw out the logic diagram of the multiplier (use the logic diagram of a 2-bit and 2-bit multiplier). Remember, you may only use half adders, full adders and AND gates. draw the circuit you have designed from step 1. You may use SPDT switches to provide the multiplicand and multiplier inputs. You may also use LED arrays to demonstrate your resulting binary number of the multiplier (each LED can be used for a single bit in the multiplier result). Run simulations to test your design. You should test a few possible pairs of the numbers A and B, e.g. multiply the decimal equivalents: 8x2, 11x3, etc. You should verify that the results generated (as indicated in the LED lights if you choose to use the LED lights to demonstrate your multiplication results) are correct for each of the number pairs. Capture a screenshot for each of the A & B number pairs you tested and include an explanation on how you can conclude that your circuit is functioning correctly. Once you have verified your design logically in step 3, use your multiplier to conduct the following multiplications, use a table to list your inputs and expected outputs. Capture a screen shot for each of the following multiplications and include an explanation on how you verify that your circuit does the multiplications correctly for the following cases. 5x3 15x5 9x7 15x7 3747 Design the logic for a pseudocode that allows a user to enter up to 100 numbers. (The program will stop accepting numbers either when 100 numbers have been entered or when a sentinel value is entered.) Once the program has finished gathering numbers, it should display the average of the entered numbers and the difference of each number from that average.Using arrays.Thanks! 3748 Design the interpreter grammar for calculator language in ANTLR including the following functions: Trignometric function: accepting angle of radian (parameter) Arithmetic function: +: one or more parameters accepted -: one or more parameters accepted *: Eg. /: Eg. (*x y z) = [x] * [y] * [z] (/ x y z) evaluated to [x] / [y] / [z] Other math functions: sqrt: only one parameter accepted All function should be in the form of (f e1 e2 A????1en) F=function and ei = expression. Eg. (+ 1 2 3 4) should be evaluated as [1]+[2]+[3]+[4] 3749 Design and implement you own linked list class of strings (this should not be a class template). The class should have the following methods: append : adds a new element to the end of the list insert: adds a new element at a position in the list. The position is an integer value (not an iterator). delete: deletes a node at a given position. The position is an integer value. constructor & copy constructor destructor: must delete all of the nodes Your linked list can be either a singly-linked list or doubly-linked list. There is a singly-linked list shown in your book and we discussed a doubly-linked list in class. Here is the source code that will be used to create the linked list class. slist.h // // // simplified list class // // Described in Chapter 9 of // Data Structures in C++ using the STL // Published by Addison-Wesley, 1997 // Written by Tim Budd, [email protected] // Oregon State University // // namespace cist2362 { template class list; template struct link; template class listIterator { typedef listIterator iterator; public: // constructor listIterator (list * tl, link * cl) : theList(tl), currentLink(cl) { } // iterator protocol T & operator * () { return currentLink->value; } void operator = (iterator & rhs) { theList = rhs.theList; currentLink = rhs.currentLink; } bool operator == (const iterator rhs) const { return currentLink == rhs.currentLink; } iterator & operator ++ (int) { currentLink = currentLink->nextLink; return * this; } iterator operator ++ (); iterator & operator -- (int) { currentLink = currentLink->prevLink; return * this; } iterator operator -- (); protected: list * theList; link * currentLink; friend class list; }; template class list { public: // type definitions typedef T value_type; typedef listIterator iterator; // constructor and destructor list () : firstLink(0), lastLink(0) { } list (list & x) : firstLink(0), lastLink(0) { } ~ list (); // operations bool empty () { return firstLink == 0; } int size(); T & back () { return lastLink->value; } T & front () { return firstLink->value; } void push_front(T &); void push_back(T &); void pop_front (); void pop_back (); iterator begin () { return iterator (this, firstLink); } iterator end () { return iterator (this, 0); } void sort (); void insert (iterator &, T &); void erase (iterator & itr) { erase (itr, itr); } void erase (iterator &, iterator &); protected: link * firstLink; link * lastLink; }; template class link { private: link (T & v) : value(v), nextLink(0), prevLink(0) { } T value; link * nextLink; link * prevLink; // allow lists to see element values friend class list; friend class listIterator; }; template int list::size () // count number of elements in collection { int counter = 0; for (link * ptr = firstLink; ptr != 0; ptr = ptr->nextLink) counter++; return counter; } template void list::push_front (T & newValue) // add a new value to the front of a list { link * newLink = new link (newValue); if (empty()) firstLink = lastLink = newLink; else { firstLink->prevLink = newLink; newLink->nextLink = firstLink; firstLink = newLink; } } template void list::pop_front() // remove first element from linked list { link * save = firstLink; firstLink = firstLink->nextLink; if (firstLink != 0) firstLink->prevLink = 0; else lastLink = 0; delete save; } template list::~list () // remove each element from the list { link * first = firstLink; while (first != 0) { link * next = first->nextLink; delete first; first = next; } } template listIterator listIterator::operator ++ () // postfix form of increment { // clone, then increment, return clone listIterator clone (theList, currentLink); currentLink = currentLink->nextLink; return clone; } template void list::insert (listIterator & itr, T & value) // insert a new element into the middle of a linked list { link * newLink = new link(value); link * current = itr->currentLink; newLink->nextLink = current; newLink->prevLink = current->prevLink; current->prevLink = newLink; current = newLink->prevLink; if (current != 0) current->nextLink = newLink; } template void list::erase (listIterator & start, listIterator & stop) // remove values from the range of elements { link * first = start.currentLink; link * prev = first->prevLink; link * last = stop.currentLink; if (prev == 0) { // removing initial portion of list firstLink = last; if (last == 0) lastLink = 0; else last->prevLink = 0; } else { prev->nextLink = last; if (last == 0) lastLink = prev; else last->prevLink = prev; } // now delete the values while (start != stop) { listIterator next = start; ++next; delete start.currentLink; start = next; } } } sListDriver.cpp #include #include using namespace std; class Widget { }; int main() { list list_one; list mylist; return 0; } 3750 Design and implement you own linked list class of strings (this should not be a class template). The class should have the following methods: append : adds a new element to the end of the list insert: adds a new element at a position in the list. The position is an integer value (not an iterator). delete: deletes a node at a given position. The position is an integer value. constructor & copy constructor destructor: must delete all of the nodes Your linked list can be either a singly-linked list or doubly-linked list. There is a singly-linked list shown in your book and we discussed a doubly-linked list in class. Here is the source code that will be used to create the linked list class. slist.h // // // simplified list class // // Described in Chapter 9 of // Data Structures in C++ using the STL // Published by Addison-Wesley, 1997 // Written by Tim Budd, [email protected] // Oregon State University // // namespace cist2362 { template class list; template struct link; template class listIterator { typedef listIterator iterator; public: // constructor listIterator (list * tl, link * cl) : theList(tl), currentLink(cl) { } // iterator protocol T & operator * () { return currentLink->value; } void operator = (iterator & rhs) { theList = rhs.theList; currentLink = rhs.currentLink; } bool operator == (const iterator rhs) const { return currentLink == rhs.currentLink; } iterator & operator ++ (int) { currentLink = currentLink->nextLink; return * this; } iterator operator ++ (); iterator & operator -- (int) { currentLink = currentLink->prevLink; return * this; } iterator operator -- (); protected: list * theList; link * currentLink; friend class list; }; template class list { public: // type definitions typedef T value_type; typedef listIterator iterator; // constructor and destructor list () : firstLink(0), lastLink(0) { } list (list & x) : firstLink(0), lastLink(0) { } ~ list (); // operations bool empty () { return firstLink == 0; } int size(); T & back () { return lastLink->value; } T & front () { return firstLink->value; } void push_front(T &); void push_back(T &); void pop_front (); void pop_back (); iterator begin () { return iterator (this, firstLink); } iterator end () { return iterator (this, 0); } void sort (); void insert (iterator &, T &); void erase (iterator & itr) { erase (itr, itr); } void erase (iterator &, iterator &); protected: link * firstLink; link * lastLink; }; template class link { private: link (T & v) : value(v), nextLink(0), prevLink(0) { } T value; link * nextLink; link * prevLink; // allow lists to see element values friend class list; friend class listIterator; }; template int list::size () // count number of elements in collection { int counter = 0; for (link * ptr = firstLink; ptr != 0; ptr = ptr->nextLink) counter++; return counter; } template void list::push_front (T & newValue) // add a new value to the front of a list { link * newLink = new link (newValue); if (empty()) firstLink = lastLink = newLink; else { firstLink->prevLink = newLink; newLink->nextLink = firstLink; firstLink = newLink; } } template void list::pop_front() // remove first element from linked list { link * save = firstLink; firstLink = firstLink->nextLink; if (firstLink != 0) firstLink->prevLink = 0; else lastLink = 0; delete save; } template list::~list () // remove each element from the list { link * first = firstLink; while (first != 0) { link * next = first->nextLink; delete first; first = next; } } template listIterator listIterator::operator ++ () // postfix form of increment { // clone, then increment, return clone listIterator clone (theList, currentLink); currentLink = currentLink->nextLink; return clone; } template void list::insert (listIterator & itr, T & value) // insert a new element into the middle of a linked list { link * newLink = new link(value); link * current = itr->currentLink; newLink->nextLink = current; newLink->prevLink = current->prevLink; current->prevLink = newLink; current = newLink->prevLink; if (current != 0) current->nextLink = newLink; } template void list::erase (listIterator & start, listIterator & stop) // remove values from the range of elements { link * first = start.currentLink; link * prev = first->prevLink; link * last = stop.currentLink; if (prev == 0) { // removing initial portion of list firstLink = last; if (last == 0) lastLink = 0; else last->prevLink = 0; } else { prev->nextLink = last; if (last == 0) lastLink = prev; else last->prevLink = prev; } // now delete the values while (start != stop) { listIterator next = start; ++next; delete start.currentLink; start = next; } } } sListDriver.cpp #include #include using namespace std; class Widget { }; int main() { list list_one; list mylist; return 0; } 3751 Design an FSM with one input, A, and two outputs, X and Y. X should be 1 if A has been 1 for at least three cycles altogether (not necessarily consecutively). Y should be 1 if A has been 1 for at least two consecutive cycles. Show the state transition diagram, encoded states and outputs, encoded state transition table, next state and output equations. 3752 Design an efficient (polynomial running time) algorithm to find a Longest Common Subsequence (LCS) of three sequences X [1::l], Y[1::m], and Z[1::n]. Justify why your algorithm has a polynomial time complexity 3753 Design a "Dog" Abstract Data Type with at least 4 behaviors and as many attributes as needed. Implement the Dog ADT in C++. You have to use Modularity, and Object-Oriented paradigm when implementing the ADT. Make sure the code is properly: indented, commented with the names of the identifiers (variables, objects, etc. used in the project) descriptive (relevant and meaningful) 3754 Design a combinational circuit which compares two 4-bit unsigned numbers A and B. The circuit should have one output X such that X = 1 whenever A>B and X = 0 whenever A?B. You may use any MSI modules as well as any other gates. 3755 Design a class named Clock. The class contains private data fields for startTime and stopTime, a no argument constructor that initializes the startTime to the current time, a method named start() that resets the startTime to the given time, a stop() method that sets the endTime to the given time and a getElapsedTime() method that returns the elapsed time in seconds. Create a TestClock class to construct a Clock instance and return the elapsed time. Command line arguments should be used to send the start and end times. You should use the java.time classes. Here is sample run: java TestClock 11:45:12 11:48:13 Elapsed time in seconds is: 181 3756 Design a class named Clock. The class contains private data fields for startTime and stopTime, a no argument constructor that initializes the startTime to the current time, a method named start() that resets the startTime to the given time, a stop() method that sets the endTime to the given time and a getElapsedTime() method that returns the elapsed time in seconds. Create a TestClock class to construct a Clock instance and return the elapsed time. Command line arguments should be used to send the start and end times. You should use the java.time classes. Here is sample run: java TestClock 11:45:12 11:48:13 Elapsed time in seconds is: 181 PLEASE HELP ME MAKE SURE THIS USES COMMAND LINE ARGUMENTS TO GET THE TEST DATA 3757 Design a class Bank that contains a number of bank accounts. Each account has an account number and a current balance. Add an accountNumber field to the BankAccount class. Store the bank accounts in an array list. Write a readFile method of the Bank class for reading the file with the format: accountNumber1 balance1 accountNumber2 balance2 Implement read methods for the Bank and BankAccount classes. Write a sample program to read in a file with bank accounts, then prints the account with the highest balance. If the file is not properly formatted, give the user a chance to selecct another file. Partial design of classes BankAcount, Bank, and BankReader. import java.util.Scanner; import java.io.IOException; import java.util.NoSuchElementException; /** A bank account has a balance that can be changed by deposits and withdrawals. */ public class BankAccount { private double balance; private int accountNumber; /** Constructs a bank account with a zero balance. */ /** Constructs a bank account with a given account number and a initial balance. */ /** Reads an account number and balance. @param in the scanner @return true if the data was read false if the end of the stream was reached */ public void read(Scanner in) ___________________________ { try { } catch { throw new _____________________________ } } Note: You need to check for incompatible input. /** Deposits money into the bank account. @param amount the amount to deposit */ /** Withdraws money from the bank account. @param amount the amount to withdraw */ /** Gets the current balance of the bank account. @return the current balance */ /** Gets the account number of the bank account. @return the account number */ } ___________________________________________________ import java.util.ArrayList; import java.io.IOException; import java.io.File; import java.util.Scanner; import java.util.NoSuchElementException; /** A bank contains account numbers and balances of each customer. */ public class Bank { private ArrayList accountList; /** Construct a Bank object. */ /** Reads a file with account numbers and balances and adds the accounts to the bank. @param filename the name of the file */ public void readFile(String filename) ________________________ { //Create File object, a scanner object to read data from the file. //call the method read File reader = new File(filename); Scanner in = new Scanner(reader); try { } finally { } } Note: call the method read /** Read a file with account numbers and balances and adds the accounts to the bank. @param in the scanner for reading the input */ private void read(Scanner in)___________________________ { while (in.hasNext()) {//Create a BankAccount object //input data for the BankAccount object //Add the BankAccount object to the accountlist } } /** Add an account to the bank. @param b the BankAccount reference */ /** Gets the account with the highest balance. @return the account with the highest balance */ public BankAccount getHighestBalance() { } } ________________________________________________ import java.util.Scanner; import java.io.IOException; import java.io.FileNotFoundException; /** Reads bank accounts from a file and prints highest balance. */ public class BankReader { /** Prompts for and reads name of file to process. @param in Scanner from which to read @return file name */ private static String getFileName(Scanner in) { String filename = null; System.out.println("Enter file to process: "); if (in.hasNext()) { filename = in.next(); } return filename; } public static void main(String[] args) { Bank bank = new Bank(); Scanner in = new Scanner(System.in); String filename = getFileName(in); boolean done = false; while (____________________________________) { try {//read the file //display the highest balance } //catch file not found exception andget the file name again catch { System.err.println(filename + " not found"); __________________________________ } //catch for improperly formatted line and get the file name again catch (IOException e) { System.err .println(filename + " contains improperly formatted line"); _______________________________________ } } } } 3758 Design a 4-bit synchronous left-shift register using either D flip-flops or JK flip-flops. Your shift register should have an asynchronous parallel load, serial in, serial out, and parallel out bus. Answer the following questions: 1. How would you modify this design to provide synchronous parallel load instead of asynchronous parallel load? 2. How would you modify this design to allow a synchronous right-shift along with synchronous parallel load? 3759 Description of Part A You are required to write a C program that accepts two decimal integers, say d and r. You may assume that the first decimal integer d is nonnegative and that the second decimal integer rwhich represents the radix, will be one of 2, 3, 4, : : :, 15, 16. The program should convert the first decimal integer d into its representation in radix r and print the result. Examples: (i) Suppose the first decimal integer is 138 and the second decimal integer is 16. In this case, the output produced by your program should be 8A, which is the hexadecimal (radix 16) representation of the decimal integer 138. (ii) Suppose the first decimal integer is 284 and the second decimal integer is 13. In this case, the output produced by your program should be 18B, which is the radix 13 representation of the decimal integer 284. (In base 13, the digits used are 0, 1, 2, : : :, 9, A, B and C, where A, B and C represent 10, 11 and 12 respectively.) Your program should be written so that it handles just one pair of integers. Thus, the outline for your program is as follows. (Note that no error checks are needed.) 1. Prompt the user to type two decimal integers. 2. Read the two integers. 3. Convert the first integer into its representation in the radix specified by the second integer. 4. Print the representation and stop. Description of Part B You are required to write a C program to carry out a strict-left-to-right evaluation of an arithmetic expression consisting of integer constants and the operators +, -, * and /. Here, the operator / denotes integer division; that is, the remainder is discarded. In a strict-left-to-right evaluation, there is no notion of precedence. For example, the value of the expression 6+4*3 when evaluated in a strict-left-to-right fashion is 30. (Under usual precedence rules, where multiplication has higher precedence than addition, the value of the above expression would be 18.) Similarly, the value of the expression 6+4*3/7-9 when evaluated in a strict-left-to-right fashion is =5. Here is some additional information about the input. 1. Each input expression is terminated by the newline ('\n') character. 2. There may be zero or more spaces between successive non-blank characters of an expression. 3. You may assume that the given expression is valid; that is, it satisfies all of the following conditions. a. The expression consists only of integer constants, the operators +, -, * and / and spaces. In particular, the expression won't contain parentheses. b. Each integer constant in the expression consists of only one decimal digit. c. The expression begins with an integer constant, without any preceding sign. d. In the expression, integer constants and operators alternate. Note that an expression consisting of a single digit integer constant, without any operators, is a valid expression. The outline of your C program is as follows. 1) Prompt the user for an expression. 2) Read the expression character by character and carry out a strict-left-to-right evaluation of the expression. 3) Print the value of the result obtained in Step 2 and stop. Thus, each time your program for Part (b) is executed, it should handle just one expression. As in part (a), bear in mind that your program reads its input from stdin and writes its output to stdout. As in Part (a), no error checks are needed. 3760 Describe some of the software maintenance frameworks/methodologies. How do they help foster solid maintenance? What is the problem with most of them? (100-200 words) 3761 Describe in English or pseudo-code an algorithm that takes as input an array A of positive integers and determines the maximum value of A[i] - A[j] with i?j. What is the worstcase running time of your algorithm? 3762 Describe an algorithm to insert and delete edges in the adjacency list representation for an undirected graph. Remember that an edge (i, j) appears on the adjacency list for both vertex i and vertex j. 3763 Derive input space partitioning tests for the GenericStack class with the following method signatures: public GenericStack (); public void Push (Object X); public Object Pop (); public boolean IsEmt (); Assume the usual semantics for the stack. Try to keep your partitioning simple, choose a small number of partitions and blocks. a) Define characteristics of inputs b) Partition the characteristics into blocks c) Define values for the blocks 3764 Delete rows if contain specific value in column with vba I have a column L with different dates I need delete row that contain dates greater and equals than today with vba. I have the below code but not work correctly. Help with this code Sub DeleteDates() Dim r As Long Dim m As Long Set ws = Worksheets("Sheet1") m = ws.Range("L" & ws.Rows.Count).End(xlUp).Row For r = m To 2 Step -1 If ws.Range("L" & r).Value >= Date - 1 Then ws.Rows(r).delete End If Next r End Sub Thanks for help !! 3765 1. Define orthogonality in the context of programming language design. 2. What is the difference between a compiled and an interpreted language? Which one is Java? 3. What languages over the alphabet {a, b, c, d} do the following regular expression represent? Describe in words and give examples. a. (a+b)* b. (((a b)|(cd))*c) c. ?* 4. What is an ambiguous grammar? 5. What is denotational semantics? What are its strengths and weaknesses as compared to other approaches to semantics. 6. What is axiomatic semantics? What are its strengths and weaknesses as compared to other approaches to semantics. 7. Compute the weakest precondition for each of the following assignments and post-conditions a. a = 2*(b-1)-1{a > 0} b. a=a-1{a>0} 8. Consider the following Language asgn ? id = expr expr ? term + term | term term ?id|id+id id ?a|b|c 1. State terminals and non-terminals. 2. Is the language below ambiguous or not. Justify. Note: To be ambiguous, a grammar must allow two different parse trees, and hence two different left-most derivations, for the same input string. Therefore, at some point in a left-most derivation, there must be choice of which rule to use to expand the left-most non-terminal. If all the rules match a different initial symbol then at most one rule can ever be successfully applied at any given point in the input string. Hence, the grammar must not be ambiguous. Note: In general, it is quite hard to prove non-ambiguity except for very simple grammars like this one; proving ambiguity (by exhibiting two different parse trees for a single input) is much easier. 1. Consider a grammar with alphabet a, b and c. 1. Give a regular expression to generate all strings with only one a. 2. Give a regular expression to generate all strings with exactly two as. 2. Check the validity for the following code: {a < 5} b = a A????1 10 c = 20 A????1 5* b {c > 5} 3. Know how to perform Pairwise Disjointness test. For example, problem 1 from Chapter 4: (a) FIRST(aB) = {a}, FIRST(b) = {b}, FIRST(cBB) = {c}, Passes the test (b) FIRST(aB) = {a}, FIRST(bA) = {b}, FIRST(aBb) = {a}, Fails the test (c) FIRST(aaA) = {a}, FIRST(b) = {b}, FIRST(caB) = {c}, Passes the test 3766 Define an IsOddStrategy class which extends CheckIntStrategy. Add a txt file numb.txt that have numbers and the main driver that output odd number inside the file. //interface public interface CheckIntStrategy { public boolean check(int s ); } //extends public class IsOddStrategy extends CheckIntStrategy { // extend or implement im not sure // constructor IsOddStrategy } // main program import java.io.*; import java.util.StringTokenizer; public class IntDriver { public static void main(String[] args) { try { printWhen("number.txt",new StartWithT()); } catch (IOException e) { System.err.println("OOPSie: problems reading the file."); } } public static void printWhen(String filename, CheckStrategy which) throws IOException { BufferedReader infile = new BufferedReader(new FileReader(filename)); // a decorated FileReader! String buffer = null; while((buffer = infile.readLine()) != null) { // read in a line of text StringTokenizer numb = new StringTokenizer(buffer); // chop it up into words while( numbers.hasMoreTokens() ) { // test each word String num = numb.nextToken(); if (which.check(num)) { System.out.println(num); } } } infile.close(); } } //oldSchoolIsOddStrategy () write an OldSchoolIsOddStrategy class which extends CheckStrategy. give out the same result as oddstrategy. public class OlSchoolIsOddStrategy extends CheckStrategy { } 3767 Define Di to be a dock i and Bj to be boat j where ; 1<= i<=4, and Bj: 1<=j<=7. Assume that all docks are of the same length, and all boats are also of the same length, hence, the same number of boats could be docked in each dock. Only 5 boats can be docked in each dock. However, different docks have different docking rules according to their data structures, as are listed in the table below: Dock Structure D1 Array D2 Single Linked List D3 Stack D4 Queue When a boat arrives to the marina, the marina's docking staff docks the boat in one of docks. However, customers may also ask the staff to undock their boats before they leave a trip. Keep in mind that any (docking/undocking) operation (corresponding to moving any boat into or out of any docks) cost 1 USD. Test the program on each data structure using the following dock operations Dock operation Boat Number Dock B1 Dock B4 Undock B1 Dock B5 Dock B7 Dock B3 Dock B2 Undock B2 Dock B1 Undock B7 Dock B6 Undock B1 Assume that the boats have priority based on their index numbering. i.e. B1 has highest and B7 has the lowest. Indicate the expected time and space complexity of your program 3768 Define a class Book. The class should contain a private data member for an array of std::strings, to represent the content on each page, where one array cell refers to one page. The class should also contain private data members for the number of pages in the book and the current page number (both integers). You need to declare a constructor, setters and getters, and a turnPage () method. 3769 To defeat code injection attacks, in addition to DEP, Alice proposed an approach called instruction set randomization (ISR). The basic idea of ISR is to randomize the instruction set (e.g., a MOV instruction at attackerA????1s machine maybe different compared to the victimA????1s machine). To deploy her ISR, she used a virtual machine monitor that translates each instruction to appropriate form under her control (e.g., think about an XOR operation), thereby the injected shell code will be translated incorrectly if attacker doesnA????1t know how the translation is performed. Please justify the defense of this approach, e.g., the pros and cons of this approach. 3770 If deck is an ArrayList of objects of type Card, and the Card class supports a method named setSuit that accepts one String argument, which statement correctly calls the setSuit method for the third card in the deck? A) deck.Cards.get(2).setSuit("Hearts"); B) deck.Cards.get(3).setSuit("Hearts"); C) deck.get(2).setSuit("Hearts"); D) deck.set(2, "Hearts"); 3771 I have a decision to make and I am wondering what would be the better solution. I am refactoring an older application and intend to really get into the nuts and bolts of it. There are 8 report types currently and one of the modifications are to allow different reports to be "saved" in different ways. My two thoughts on it were Have an Abstract Class with an abstract save method, then each report type can define its own way of doing things. Possibly have other abstract classes inheriting from that one, each implementing a virtual Save() method. Then the report classes can inherit from the one with the relevant save mechanism. Have a report interface, which has a method signature like void Save(ISaveMechanism saveMechanism); Then have an interface with a Save() method, then each report type can use saveMechanism.Save(); and just use the concrete implementation required. Would either solution cause more issues/drawbacks than the other? This project doesn't currently have any associated unit tests but if given time, it would be good to add some later. 3772 I decided to ask this question here instead of on stack overflow because it is rather subjective. In C#, typically I see generic types with very poor names. Specifically, "T" is commonly used but is not a meaningful name by itself. For example: class Fruit { T fruit; } While this is the typical approach, would anyone recommend against this? And if so, what would a reasonable naming convention be for generic types in the context of C# for generic functions and classes? In my previous example, let's assume that generic type T must always be a type of fruit, such as Apple or Orange. The type T needs to make it obvious that it's a type of fruit, so maybe a better name would be FruitType, so we end up with: class Fruit { FruitType fruit; } This is just to give you guys an idea of what I'm looking for. What's an acceptable "rule of thumb" for this issue? 3773 You have to decide how much static bandwidth (z) to purchase for your company, meaning that you cannot purchase dynamic bandwidth that grows based on need. You notice that over the last two years, you have had a single day each year that required 6 times (6x) the normal daily average (x). Whatever data you have to send, you have to have the bandwidth available to send that data on that day before business the next day starts at 8a.m. while sending only after your business day closes at midnight. How much bandwidth do you purchase? Why? 3774 you will decide what you will do. The idea is to make you think about what all can you do with the programming you have learned so far and to play around with it. The program, however, must have: An extra function besides "main" (or whatever you call it) At least one decision structure (if or if-else or if-elif-else) At least one for loop It must access at least one file for reading and/or writing Your program must serve some purpose, i.e. it should not merely be a bunch of statements. The purpose need not be something complex. Anything at the level of the programming exercises at the end of chapters should be good, you may also do one of those or their variations but it must satisfy the above conditions. 3775 dealing with streams and input parsing 1) Write a single statement that reads an entire line from stdin. Assign streetAddress with the user input. Ex: If a user enters "1313 Mockingbird Lane", program outputs: You entered: 1313 Mockingbird Lane #include int main(void) { const int ADDRESS_SIZE_LIMIT = 50; char streetAddress[ADDRESS_SIZE_LIMIT]; printf("Enter street address: "); /* Your solution goes here */ printf("You entered: %s", streetAddress); return 0; } 3776 Dates Calculating in Excel Hello all, I would like to have date automatically fill in on a spreadsheet. For example, I have a drop down menu for all the months. I would like that when you select the month your going to use, that the cells below automatically fill in specific days. Drop down menu of Months (January selected) Tuesday January 6th 2015 Tuesday January 13th 2015 Tuesday January 20th 2015 Tuesday January 27th 2015 Is this possible? Any help is always appreciated. Thank you !! 3777 My datasource sends information in 100 batches of 100 records with a delay of 1 to 3 seconds between batches. I would like to start processing data as soon as it's received, but I'm not sure how to best approach this. Some ideas I've been playing with include: yield Concurrent Dictionary ConcurrentDictionary with INotifyProperyChanged Events etc. As you can see I'm all over the place, and would appreciate some tested guidance on how to approach this 3778 Database Design: SQL Question 1 A highly organized collection of data is a database management system. True False Question 2 Financial data residing in a database is not a corporate resource. True False Question 3 Modality is the maximum number of entity occurrences involved in a relationship. True False Question 4 Unary relationships contain one entity type. True False Question 5 In a database, if there is more than one candidate key one MUST be identified as a primary key. True False Question 6 A concurrency problem is defined as multiple data sets stored in the database. True False Question 7 The most significant problem with data redundancy in a database is data integrity. True False Question 8 Data redundancy can result in requiring unnecessary storage space for the database. True False Question 9 Many-many relationships should be converted to associative entities on an Entity-Relationship diagram. True False Question 10 There are two modes of data access known as sequential and direct access. True False Question 11 Data within a database is typically controlled and manipulated by: A. MY SQL Workbench B. Database Management Software C. MS Word D. MS Excel Question 12 A unique identifier of an entity is ____ A. Relationship B. Cardinality C. Attribute D. Binary Question 13 In an M-M relationship, the combination of or the association between two entities is known as ____ A. Cardinality B. Modality C. Associative entity D. Intersection data Question 14 A ________ relationship associates occurrences of an entity type with other occurrences of the same entity type. A. Binary B. Tertiary C. Unary D. Secondary Question 15 How many entity types are involved in a tertiary relationship? A. 1 B. 2 C. 3 D. 4 Question 16 The means by which an analyst records, documents, and diagrams the business environment is known as ________. A. Relationship Identification B. Data Association C. Data Analysis D. Data modeling Question 17 In a DBMS, Referential Integrity contains three rules which are: A. Restrict B. Cascade C. Set-to-null D. Read E. All of the above F. A, B, and C Question 18 The process of arranging attributes of entities in a given business environment into database structures is known as: A. Physical Database design B. Database structuring C. Logical Database design D. Relationship mapping Question 19 Each row of a database is known as a ______ A. File B. Field C. Entity D. Record Question 20 An entityA????1s attribute in a database management system is referred to as a ________. A. Record B. Relationship C. Field D. Row Question 21 A foreign key is defined as _________. A. The key attribute of an entity B. An identifier of the relationship C. Primary key of an entity D. Primary key of a relation that appears in another relation Question 22 An attribute or field that uniquely appears in every row of the relation is known as ____. A. Key field B. Primary Key C. Foreign Key D. Intersection ID Question 23 Each table column in a database entity is commonly known as a ____________. A. Record B. Relationship C. Field D. Primary Key Question 24 The purpose of a database is to _____________. A. Eliminate redundancy B. Centralize data C. Integrate data logically D. All of the above E. None of the above Question 25 In your own words write the definition of referential integrity. 3779 Data on plasma etching etching.txt in semiconductor manufacturing relates chlorine flow x (measured in cubic centimeters per minute through a nozzle) to etch rate y (units of 100 Angstroms per minute). etching.txt: 1.5,23 1.5,24.5 2,25 2.5,30 2.5,33.5 3,40 3.5,40.5 3.5,47 4,49 Fit a regression line and give confidence intervals and point estimates for the slope and intercept (?1 and ?0 in our book). Include a plot of the data with the line. Note: This assigment have to be done in matlab 3780 magic spell owl destine fatal pure dragon phoenix special school uncle friendship teacher master question eagle guess human develope clue blog difficult simulate tiger ratio performance width care game dictionary picture choose look soft assumption this the Data File: eat apple problem shaby spider map english romantic music moon watermelon definition remote freedom similar writer search inside poodle constraint state quality slave action condition google description cooking handbook research cousin sister example block blossom cheer dog cat friend candy church perfect genre movie surf club golf swim country book best student teacher computer calculate algorithm photo facebook foundation money building stone story store support grief captain After your program reads in the list of words, it randomly picks one word to play the game. This word is referred to as the A????1gameWordA????1. In the game of hangman, as a user, you are first presented with a list of blanks representing unknown letters of the hidden word. You must then guess a letter to see if that letter exists in the word. If it does, the blank that corresponds to the guessed letter is then displayed along with blanks for the letters that have not been guessed yet. If you guess a previously guessed letter, you get to try again. If you guess wrong, you incrementally move toward being hung. You have 8 bad guesses until you lose the game. To represent the different states of A????1being hungA????1, we will use the values PLATFORM, HEAD, BODY, LEFT_ARM, RIGHT_ARM, LEFT_LEG, RIGHT_LEG, and HUNG. To implement the game you should use the unsorted List ADT to represent the word (gameWord) being guessed. Each element in the list should be a struct that stores the letter of the word and a Boolean that indicates if the letter is to be displayed or if a blank should be displayed. You should use a second list (guesses) to represent the letters that have already been guessed and an enumeration to represent the states of the game. Your program should keep asking the user for another guess until either the entire word has been guessed or the state of the game is HUNG. After each guess the program should display the current state of the word to be guessed, the list of characters already guessed, and the state of the game. At the end of each game, ask the user if they would like to try another word. Randomly select another word from the word bank to play the next game. Top down design of the client program in Pseudo code: 0. Main function Open data file Read in the list of words in the data file Close data file For as long as the player wants to play the game Randomly select a word from the list of words Call PlayGame to play hangman with the selected word Function PlayGame Input: A????1gameWordA????1 Output: none While (the player has not lost or win), do the following: 1. Call GetGuess to get the playerA????1s guess 2. Check if the player has entered a duplicate guess, i.e., whether the user guess is in the list A????1guessesA????1 2 3. Call CorrectGuess to check if the player has made a correct guess, i.e., the letter guessed is in the word. 4. Call DisplayBoard to display the game board. 5. Check to see if the player has won the game. If so, game over, return. 6. If the player has not won, keep track of the number of bad guesses the player has made. If it exceeds 8, game is over, Call DisplayWord to print the A????1gameWordA????1, then return. PlayGame, GetGuess, CorrectGuess, DisplayBoard, and DisplayWord are required user defined functions in the client program. You are encouraged to add additional user defined functions to further decompose the program. 3781 (d) Write a program that reads the three given novels and produces as output the 20 words most frequently used by Tolstoy and the 20 words most frequently used by R. L. Stevenson, based on the sample of their writings that we have analyzed. Note that since two of the novels are by R. L. Stevenson, your output for R. L. Stevenson should combine the analysis of the two novels. It should be clear to you that you will be solving this problem by combining the functions you have crated for the earlier problems and doing some extra work beyond that. 3782 I'd like to note your experience of full scale IDEs on Linux. I personally work mostly with vim, however other programmers would like to see a real IDE. So I'd like to hear your personal opinion about different IDEs and comparison between them, in following context: C++ and maybe some C development (not Java, Python and other stuff) Server side programming (no need for GUI development) Working on Linux not "cross-platform" development. Opinion needed regard: How stable is it? If IDE crashes I don't need it. Comfortable to use. Powerful for debugging. Integration with various build systems Scalability over huge projects (projects of hundreds thousands of lines of code) I used to work with KDevelop and it was very nice IDE and seems that KDevelop 4 is a huge progress. It seems also that many rather use Netbeans and Eclipse. 3783 d. For every type of the gas, prepare an individual function (e.g. h_N2(T) ) that calculates the enthalpy of the gas at given temperature. e. For N2, solve this problem with the Bisection method and NewtonA????1s method with tolerance 10^-8. Find the number of iteration required for getting the solutions with this tolerance. Use the codes prepared in the class, but modify and use them in the form of function functions, which accept h_N2 as an input parameter. Bisection Method: function [ x N ] = Bisection ( a, b, Tol ) N = 0 ; % This is the number of iterations fa = Equation ( a ) ; fb = Equation ( b ) ; while b - a > Tol c = 0.5 * ( a + b ) ; fc = Equation ( c ) ; if fa * fc > 0 a = c; else b = c ; end N = N + 1 ; end x = c ; end function [ f ] = Equation ( x ) f = sin ( x ) - 0.5; end Newton Method: function [ x, N ] = NewtonMethod ( a, Tol ) N=0; x=a; while 1 [ f, dfdx ] = Equation ( x ) ; if abs ( f ) < Tol return ; end x = x - f / dfdx ; N=N+1; end end function [ f, dfdx ] = Equation ( x ) f = sin ( x ) - 0.5 ; dfdx = cos ( x ) ; end 3784 I am currently trying to improve my use of exceptions, and found the important distinction between exceptions that signify programming errors (e.g. someone passed null as argument, or called a method on an object after it was disposed) and those that signify a failure in the operation that is not the caller's fault (e.g. an I/O exception). How should these two kinds of exceptions be treated differently? Do you think that error exceptions need to be explicitly documented, or is it enough to document the relevant preconditions? And can you leave out the documentation of a precondition or error exception if it should be obvious (for example, ObjectDisposedException when calling a method on a disposed object) 3785 Currently I'm working on a vector class in C# and now I'm coming to the point, where I've to figure out, how i want to implement the functions for interpolation between two vectors. At first I came up with implementing the functions directly into the vector class... public class Vector3D { public static Vector3D LinearInterpolate(Vector3D vector1, Vector3D vector2, double factor) { ... } public Vector3D LinearInterpolate(Vector3D other, double factor { ... } } (I always offer both: a static method with two vectors as parameters and one non-static, with only one vector as parameter) ...but then I got the idea to use extension methods (defined in a seperate class called "Interpolation" for example), since interpolation isn't really a thing only available for vectors. So this could be another solution: public class Vector3D { ... } public static class Interpolation { public static Vector3D LinearInterpolate(this Vector3D vector, Vector3D other, double factor) { ... } } So here an example how you'd use the different possibilities: { var vec1 = new Vector3D(5, 3, 1); var vec2 = new Vector3D(4, 2, 0); Vector3D vec3; vec3 = vec1.LinearInterpolate(vec2, 0.5); //1 vec3 = Vector3D.LinearInterpolate(vec1, vec2, 0.5); //2 //or with extension-methods vec3 = vec1.LinearInterpolate(vec2, 0.5); //3 (same as 1) vec3 = Interpolation.LinearInterpolation(vec1, vec2, 0.5); //4 } So I really don't know which design is better. Also I don't know if there's an ultimate rule for things like this or if it's just about what someone personally prefers. But I really would like to hear your opinions, what's better (and if possible why ). 3786 I currently have created an excel file containing about 3000 GRE vocabularies. All of which are input in column A. I am intending to put definitions in column B. Rather than trying to put the defintion of each word individually, instead, is there a function in excel which automatically finds the definition of each of word in column A and put it in corresponding box in colmun B? Thank you 3787 We currently have 1 giant EDMX for our corporate database. It, along with all of the generated POCOs, are in a separate project (we'll call it the EDMX project) which we pull in to any solution that uses the main database. In other words, any new application we develop uses this same EDMX project. Naturally, the EDMX project requires a reference to Entity Framework. But so do the main projects for each application. Thus, a given solution has 2 separate Entity Framework references - which could end up being completely different versions. I inherited this setup and now have the opportunity to make some big changes. I have a suspicion we shouldn't be using this one EDMX for multiple solutions, but am not 100% sure. Questions Could having 2 different versions of Entity Framework in a given solution cause issues? It seems like it would, and we certainly do not want to constrain our newer applications to an old version of EF to work with the EDMX project which in turn works with older solutions. Are there any other reasons this would be bad? Note: I have read similar questions about using 1 EDMX within the same solution (vs. splitting it up by schema, etc.), but my question is different because I am talking about using 1 EDMX for all solutions. EDIT : So I pretty much have my first question answered. At least between Entity Framework 5 and Entity Framework 6, it does indeed cause issues. When my EDMX project has EF5 installed, and I upgrade my main project to EF6, many of my LINQ queries (inside the main project, referencing the generated-POCO classes inside the EDMX project) break. As I understand it, this has something to do with namespace changes. If there is a workaround to make the two versions work together, I haven't found it. My 2nd question still needs answered, however. Are there any other reasons it'd be bad to do, besides conflicting versions of Entity Framework? From a design perspective, does having 1 EDMX make sense? Pros could be ease of updating (if a database table used by multiple projects changes, there is 1 place to update it). The obvious con is new projects being constrained to an old EF version until all other projects got updated. Any other issues that would crop up? Really just looking for some direction. 3788 CSCI 300 1500 point reward please give code in java and make sure it works in eclipse the question and helpful files i'm referring to are on dropbox through these links https://www.dropbox.com/s/oog925gi79wv6es/CSCI%20300%20Assign02_FileProcessing.docx?dl=0 https://www.dropbox.com/s/ft4nbydsvil6vph/productList.dat?dl=0 https://www.dropbox.com/s/38c913dprjg2sue/transactions.txt?dl=0 3789 CS 2275 Homework (Interpreted vs. Compiled) Name: ____________________________ For each language below, research online and find out if it is considered an interpreted or compiled language. Then circle the correct answer on the respective line. Language Circle the correct answer BASH is Interpreted or Compiled BASIC is Interpreted or Compiled C is Interpreted or Compiled C++ is Interpreted or Compiled C# is Interpreted or Compiled COBOL is Interpreted or Compiled FORTRAN is Interpreted or Compiled Java is Interpreted or Compiled JavaScript is Interpreted or Compiled LISP is Interpreted or Compiled Objective-C is Interpreted or Compiled Perl is Interpreted or Compiled PHP is Interpreted or Compiled Python is Interpreted or Compiled Ruby is Interpreted or Compiled SQL is Interpreted or Compiled Visual Basic is Interpreted or Compiled 3790 Cryptography number 5 http://imgur.com/wsOmmGR Affin Cipher y = (ux + w) mod 26 can provide any detailed work plese 3791 ?CRUISE TABLE CRUISENUM DIRECTOR VOYAGE TABLE PASSENGERNUM CRUISENUM PASSENGER TABLE PASSENGERNUM PASSENGER NAME List the names of passengers who have been on a cruise directed by Adams use subquery 3792 When creating / writing a file in Xcode. I am writing numbers to it. After execution. Where does the file goto? I can not find it in my finder. I would like the file to be placed on my desktop. I looked in my preferences but can not find a simple solution. I tried changing the path on Derived Data but it sends a bunch of files to my desp top I do not understand. Please help! 3793 I am creating a stored procedure that is logging some data. The data ultimately needs to end up in 2 tables. The incoming data is coming from a JSON string containing 15 parameters, and the data is then logged to the database using the stored procedure I'm writing. I would like to send the data into 1 stored procedure and INSERT it into both tables. The first table is a raw data logging table. It will be used for debug and troubleshooting. The second table will be used for report generation. This table requires some simple mathematical calculations to be done on incoming data. For example: DECLARE @Table2Fld3 DECIMAL = @IncomingFld9 - @IncomingFld4; I'll have about 8 of these calculations to do to compute the values for table 2, then I'll do an INSERT to save the data. So my question is, is it a good practice to do these calculations in the T-SQL? Or would it be better for me to create 2 separate stored procedures and do the calculations in my code? One trade-off I see is that if I do it all in the code then I have to create 2 database connections. EDIT I should elaborate on the "2 database connections" comment. The application in question is a windows service that establishes multi-threaded server/client communication. The logging system is asynchronous to the server/client communication. Using that existing system, in order for me to target multiple stored procedures, it would require 2 calls to the logger which would spin up 2 connections to the database. 3794 I am creating an application which will be testable(unit + integration). In this application I have a FileHelper static class, public static class FileHelper { public static void ExtractZipFile(Stream zipStream, string location) { .................................. } public static void CreatePageFolderIfNotExist(string directory) { ................................................. } ....................................................... ....................................................... } But due to static I think it is not testable. How to make this class testable? 3795 Creating applet Duplicate the applet below. You may change the colors around but two different colors in your applet. If you your eye red, make sure the text says A????1red eyesA????1. The pupil of your eye should be a circle. For the font , use A????1SanserifA????1, italic + bold, 16 pt. DonA????1t forget to create the HTML file. My applet is 300 by 200 Pixels. Feel free to use a different size HTML file. please help me 3796 Create a Web page to make the airplane flying at the half height of window. The airplane should be flying up and down smoothly across the width of window. When the airplane reaches one side, the image should be flipped so its head points to the opposite side. So, the airplane flies back and forth from one side to the other. 3798 To create a web application using Servlet technology. The application consists of a single web page that is a list of tasks along with their due dates. Users can customize a task by associating a color with the task. Users can search for tasks and can also add and delete tasks; your web page will respond by showing the updated and/or filtered information. The application is named A????1taskerA????1. DETAILS TASK In this project, a task is an object that has the properties listed below . Description: text that describes the task . Due. A date . Color : a color . Completed : a boolean flag that indicates whether or not the task has been tagged as completed by the user . Id : a unique id USERS For this application, we will use a very poor user management system. The application will have exactly 4 users whose names and passwords are shown below. Nothing about this list can be changed; the usernames and passwords are fixed. Username Password Bilbo Baggins Frodo Hobbit Gandalf Wizard Sauron Evil PAGES The application will have only two HTML documents: a login page and a task-list page. These two pages are described below LOGIN PAGE The page will have a single form containing two fields; one for a username and one for a password. It must look similar to the screenshot below. If the user submits using an invalid username/password combination, then the page must look as shown below. TASK LIST PAGE The task list page is a listing of the authenticated users tasks. The page should look similar to the screenshot below. The ordering of the tasks is not defined for this assignment. The behavior of the various buttons shown on the page is describe below. . The A???? 1addA????1 button. This button creates a new Task using the description, color, and due-date entered by the user (all are required). This information is sent via an HTTP POST to the appropriate web-api and the result is returned. . The A????1Show only incompleteA????1 button. This button will be rendered as either A????1Show only incompleteA????1 (if all tasks are shown) or A????1Show allA????1 (if only the incomplete tasks are shown). When pressed, either button will make an HTTP GET request to the A????1/tasksA????1 endpoint using a filter value of either A????1incompleteA????1 or A????1allA????1 depending on the button. . The A????1xA????1 button. This is a link that when clicked will make an HTTP GET request to A????1/tasks?delete=A????1. The task with the specified ID is deleted and the results are returned. FUNCTIONALITY You must write a web-application that uses servlets to respond to requests. The application must support the web API as described in the table below. Resource Method Params Description tasker/tasks POST description, due, color (contained in the body and all required) Creates a new task. The new task is assigned a unique ID. The new task is not completed. Returns the task-list page in the same filter state as when the task was created. tasker/tasks GET delete (having a value of a task ID. This query parameter is optional) filter (having a value of either A????1incompleteA????1 or A????1allA????1. This query parameter is optional. If not provided, the filter- state is unchanged.) If the delete parameter is present, the task having the specified id is deleted. If the filter parameter is present, the filter-state is changed to the specified value. If the filter parameter is not present and this page has not yet been visited in this session, the filter-state is set to A????1allA????1. Returns the task-list page as it is rendered in the filter-state. DELIVERABLES This project requires you to write two Servlets. One to handle the login page and one to handle the A????1tasker/tasksA????1 page. You must also write supporting classes that model the data and perform reasonable processing in the data. TESTING You should carefully consider how to test your web app. Consider the following, for example: . If a user types in the URL A????1tasker/tasksA????1 and is not authenticated, they should not be able to access the page. You should probably redirect to the login page. . A user should never be allowed to view another userA????1s data. . All four users may be using the system at the same time. Test your code by opening two different browsers (Chrome, Safari, Opera, Firefox, EtcA????1) and use the system under two different accounts. Make sure that each account works correctly. 3799 Create a variable length 2d array. Fill the 2d array with random numbers. Display the array values. (20 points) a. You will prompt the user to enter the number of rows and columns. Your program must use two separate function calls to scanf. One call reads the number of rows. The other call reads the number of columns. You cannot read them both at the same time with one scanf . b. When scanf fails, prompt the user to enter a number again. Remove any bad characters from the input stream. c. Ensure your user enters positive values for rows and columns. 3800 have to create an undo and redo function in a connect four game utilizing doubly linked lists. Right now I'm working on storing the board into my struct and doing a previous function. This is what I have but keep getting the error (Array type 'char **[6][7]' is not assignable) at tail->move=board; This is my code: typedef struct cell *LIST; struct cell { char **move[6][7]; LIST prev; LIST next; }; bool NewMove (char board) { LIST tail; tail->move=board; LIST temp=new cell; tail->next=temp; temp->prev=tail; tail=tail->next; temp->next=NULL; return true; } 3801 Create two linked lists each having ten nodesA????1..the first list has a pointer called UNO to the first node and the second list has a pointer called DUO to the first node. The lists are to be sorted BY GPA as you create them. The data in the lists will consist of a last name and GPA (e.g. Smith 3.99).. Print out each sorted list after you create themA????1..then delete all nodes from the FIRST list whose GPA is BELOW 3.0A????1and delete all nodes from the second list whose GPA is ABOVE 2.5. Print out both of these modified lists Finally..merge the REMAINING nodes from both lists into one list..headed by first. Print out the final list. THIS LIST should be created sorted by NAME not by GPA.CAN KNOW SOLUTION IN C++...?? 3802 Create tables for the following relation schemas. STUDENT(Name, studentNo, major) GRADEREPORT(StudentNo, sectionID, Grade) The required data type of each attribute is described as below: STUDENT.name is a variable length character string with no more than 40 characters (varchar2(40)). STUDENT.studentNo is a10-digitnumber, so is GRADEREPORT.StudentNo. (number(10)) STUDENT.major is a fixed-length string of 4 characters (char(4)). GRADEREPORT.sectionID isa6-digitnumber(number(6)). GRADEREPORT.Grade is a single letter (char(1)). Your SQL program should specify each attribute type accordingly and appropriate constraints including primary keys and foreign keys, if any. Tip: Run the drop table command first before the create table command. Here is an example: drop table GradeReport cascade constraints; create table GradeReport ( ... ); Insert 3 rows to each table. (a) Run the following codes to create EMPLOYEE and DEPARTMENT tables: drop table DEPT cascade constraints; create table DEPT ( DNUMBER number(2), Dname varchar2(30), primary key (DNUMBER)); drop table EMP cascade constraints; create table EMP ( EID number(4) primary key, DNO number(2), AGE integer check(age>=18), foreignkey(DNO) references DEPT ); 2. 3. Insert into DEPT values (1, A????1SALESA????1); Insert into DEPT values (2, A????1MARKETINGA????1); Insert into EMP values (1111, 1, 27); Insert into EMP values (2222, 1, 54); Insert into EMP values (3333, 2, 30); (b) List EMP table SELECT * FROM EMP; (c) Run the following code and see what you get and explain why? (Tip: list the table EMP after executing the code). Insert into EMP values (2222, 1, 54); Insert into EMP values (4444, 4, 54); Insert into EMP values (5555, 1, 0); 4. (a) Re-create DETP and EMP tables using the following code: drop table DEPT cascade constraints; create table DEPT ( DNUMBER number(2), Dname varchar2(30)); drop table EMP cascade constraints; create table EMP ( EID number(4), DNO number(2), AGE integer); Insert into DEPT values (1, A????1SALESA????1); Insert into DEPT values (2, A????1MARKETINGA????1); Insert into EMP values (1111, 1, 27); Insert into EMP values (2222, 1, 54); Insert into EMP values (3333, 2, 30); (b) Run the following code that is the same as 3c) and see what you get and explain why? list the table EMP both before and after executing the code). Insert into EMP values (2222, 1, 54); Insert into EMP values (4444, 4, 54); Insert into EMP values (5555, 1, 0); 3803 Create tables for the following relation schemas. STUDENT(Name, studentNo, major) GRADEREPORT(StudentNo, sectionID, Grade) The required data type of each attribute is described as below: STUDENT.name is a variable length character string with no more than 40 characters (varchar2(40)). STUDENT.studentNo is a10-digitnumber, so is GRADEREPORT.StudentNo. (number(10)) STUDENT.major is a fixed-length string of 4 characters (char(4)). GRADEREPORT.sectionID isa6-digitnumber(number(6)). GRADEREPORT.Grade is a single letter (char(1)). Your SQL program should specify each attribute type accordingly and appropriate constraints including primary keys and foreign keys, if any. Tip: Run the drop table command first before the create table command. Here is an example: drop table GradeReport cascade constraints; create table GradeReport ( ... ); Insert 3 rows to each table. (a) Run the following codes to create EMPLOYEE and DEPARTMENT tables: drop table DEPT cascade constraints; create table DEPT ( DNUMBER number(2), Dname varchar2(30), primary key (DNUMBER)); drop table EMP cascade constraints; create table EMP ( EID number(4) primary key, DNO number(2), AGE integer check(age>=18), foreignkey(DNO) references DEPT ); 2. 3. Insert into DEPT values (1, A????1SALESA????1); Insert into DEPT values (2, A????1MARKETINGA????1); Insert into EMP values (1111, 1, 27); Insert into EMP values (2222, 1, 54); Insert into EMP values (3333, 2, 30); (b) List EMP table SELECT * FROM EMP; (c) Run the following code and see what you get and explain why? (Tip: list the table EMP after executing the code). Insert into EMP values (2222, 1, 54); Insert into EMP values (4444, 4, 54); Insert into EMP values (5555, 1, 0); 4. (a) Re-create DETP and EMP tables using the following code: drop table DEPT cascade constraints; create table DEPT ( DNUMBER number(2), Dname varchar2(30)); drop table EMP cascade constraints; create table EMP ( EID number(4), DNO number(2), AGE integer); Insert into DEPT values (1, A????1SALESA????1); Insert into DEPT values (2, A????1MARKETINGA????1); Insert into EMP values (1111, 1, 27); Insert into EMP values (2222, 1, 54); Insert into EMP values (3333, 2, 30); (b) Run the following code that is the same as 3c) and see what you get and explain why? list the table EMP both before and after executing the code). Insert into EMP values (2222, 1, 54); Insert into EMP values (4444, 4, 54); Insert into EMP values (5555, 1, 0); 3804 Create a table with the width of 60%, border of 1 pixel, which is centered on the page. The cell contents and the borders should have 10 pixels in between them. The borders themselves should have 5 pixels of space between them. You don't have to add any rows, cells or contents to the table. 3805 Create a state diagram for the language of this turing machine {ww| w ? ?*} (? = {a,b}) (ww could be a typo from the professor, it might just be w) Show transcribed image text (ww | w belongs to sigma*} (sigma = {a,b}) Create a state diagram for the language of this turing machine {ww| w ? ?*} (? = {a,b}) (ww could be a typo from the professor, it might just be w) 3806 Create a simple guessing game, similar to Hangman, in which the user guesses letters and then attempts to guess a partially hidden phrase. Display a phrase randomly from a list of 10 non displayed phrases in which some of the letters are replaced by asterisks; for example, "G* T***" (for "Go Team"). Each time the user guesses a letter, either place the letter in the correct spot (or spots) in the phrase and display it again, or tell the user the guessed letter is not in the phrase, letter should be replaced regardless of letter case. Display a congratulagory message when the entire correct phrase has been deduced. Class should be SecretPhrase and program should be in java. If someone could help me that would be great! The 10 phrases should be: Java is fun, Life is good, S 3807 Create a simple guessing game, similar to Hangman, in which the user guesses letters and then attempts to guess a partially hidden phrase. Display a phrase randomly from a list of 10 non displayed phrases in which some of the letters are replaced by asterisks; for example, "G* T***" (for "Go Team"). Each time the user guesses a letter, either place the letter in the correct spot (or spots) in the phrase and display it again, or tell the user the guessed letter is not in the phrase, letter should be replaced regardless of letter case. Display a congratulagory message when the entire correct phrase has been deduced. Class should be SecretPhrase and program should be in java. If someone could help me that would be great! The 10 phrases should be: Java is fun, Life is good, Summer Break, Fast Car, Dangerous, Peace on Earth, Monster, Everyones favorite movie, Love, Twice the fun. 3808 Create a simple guessing game, similar to Hangman, in which the user guesses letters and then attempts to guess a partially hidden phrase. Display a phrase randomly from a list of 10 non displayed phrases in which some of the letters are replaced by asterisks; for example, "G* T***" (for "Go Team"). Each time the user guesses a letter, either place the letter in the correct spot (or spots) in the phrase and display it again, or tell the user the guessed letter is not in the phrase, letter should be replaced regardless of letter case. Display a congratulagory message when the entire correct phrase has been deduced. Class should be SecretPhrase and program should be in java. If someone could help me that would be great! The 10 phrases should be: Java is fun, Life is good, Summer Break, Fast Car, Dangerous, Peace on Earth, Monster, Everyones favorite movie, Love, Twice the fun. 3809 Create a simple guessing game, similar to Hangman, in which the user guesses letters and then attempts to guess a partially hidden phrase. Display a phrase randomly from a list of 10 non displayed phrases in which some of the letters are replaced by asterisks; for example, "G* T***" (for "Go Team"). Each time the user guesses a letter, either place the letter in the correct spot (or spots) in the phrase and display it again, or tell the user the guessed letter is not in the phrase, letter should be replaced regardless of letter case. Display a congratulagory message when the entire correct phrase has been deduced. Class should be SecretPhrase and program should be in java. If someone could help me that would be great! The 10 phrases should be: Java is fun, Life is good, Summer Break, Fast Car, Dangerous, Peace on Earth, Monster, Everyones favorite movie, Love, Twice the fun. 3810 Create a simple guessing game, similar to Hangman, in which the user guesses letters and then attempts to guess a partially hidden phrase. Display a phrase in which some of the letters are replaced by asterisks; for example, "G* T***" (for "Go Team". Each time the user guesses a letter, either place the letter in the correct spot (or spots) in the phrase and display it again, or tell the user the guessed letter is not in the phrase. Display a congratulagory message when the entire correct phrase has been deduced. Class should be SecretPhrase and program should be in java. If someone could help me that would be great! 3811 Create a simple guessing game, similar to Hangman, in which the user guesses letters and then attempts to guess a partially hidden phrase. Display a phrase in which some of the letters are replaced by asterisks; for example,A????1G* T***A????1(forA????1Go TeamA????1). Each time the user guesses a letter, either place the letter in the correct spot (or spots) in the phrase and display it again, or tell the user the guessed letter is not in the phrase. Display a congratulatory message when the entire correct phrase has been deduced. Save the game asSecretPhrase.java. In the next chapter, you will modify this program so that instead of presenting the user with the same phrase every time the game is played, the program randomly selects the phrase from a list of phrases. (Should only use language covered through chapter 7 in Java Programming 7th Edition by Joyce Farrell) 3812 Create a simple guessing game, similar to Hangman, in which the user guesses letters and then attempts to guess a partially hidden phrase. Display a phrase in which some of the letters are replaced by asterisks; for example, "G* T***" (for "Go Team". Each time the user guesses a letter, either place the letter in the correct spot (or spots) in the phrase and display it again, or tell the user the guessed letter is not in the phrase. Display a congratulagory message when the entire correct phrase has been deduced. Class should be SecretPhrase and program should be in java. 3813 Create a simple guessing game, similar to Hangman, in which the user guesses letters and then attempts to guess a partially hidden phrase. Display a phrase in which some of the letters are replaced by asterisks; for example, "G* T***" (for "Go Team". Each time the user guesses a letter, either place the letter in the correct spot (or spots) in the phrase and display it again, or tell the user the guessed letter is not in the phrase. Display a congratulagory message when the entire correct phrase has been deduced. Class should be SecretPhrase and program should be in java. 3814 Create a program using c++ to get one non-zero positive integer as an input value, "n", and caluclate the sequence 1/n + 2/n-1 + 3/n-2 + .... + n/1 output must include the sequence and the total use for-loop statements 3815 Create a program in Java (GUI) to keep track of vehicle tire purchases. The program will store data about the vehicle, the tire manufacturer and size, quantity purchased, the date of sale, and the mileage warranty, etc. It should have following: 1. Create a Vehicle class that includes make, model, and year 2. Create a Tire class that includes tire manufacturer, tire model, tire size, warranty mileage, and price 3. Create a Date class that includes the month, day, and year 4. Create a Tire Purchase class that includes the amount of labor (in hours) for balancing and mounting a. This class should also include static data members for labor cost ($15.00/hour) and sales tax (9%) Your program should ask the user to input the vehicle data, tire data, and date data. It should then calculate the cost of a tire purchase based on the tire price, qty of tires, labor costs, and tax. Labor can be assumed to be A????1 hour per tire for balancing and mounting. The vehicle data, tire data, date data and total cost should be written to a file. A user should be able to generate/display a list of all vehicles that have had new tires installed during a particular month. 3816 Create a program in java that displays all of the cards in a deck in a grid. Use a 9 X 6 grid to display all 54 cards. No card should be displayed more than once and they should be displayed randomly. The class name should be Cards. 3817 Create a program to determine the Loan Interest Rate based on credit scores. Use if..else statements to find the interest rate. Write a program that will give the interest rate for a new loan based on a given credit score. Use exception handling to capture incorrect data input and provide an error message to the user. Credit score Interest Rate 850-720 5.56% 719-690 6.38% 60 689 7.12% 625-659 9.34% 590-624 12.45% Below 590 no credit issued. Prompt the user for the credit score. Determine and display the user input credit score and the interest rate associated with the credit score. 3818 Create a PHP document with a A????1nagA????1 counter that reminds users to register. Save the counter in a cookie and display a message reminding users to register every ?fth time they visit your site. Create a form in the body of the document that includes text boxes for a userA????1s name and e-mail address along with a Registration button. Normally, registration information would be stored in a database. For simplicity, this step will be omitted from this exercise. After a user ?lls in the text boxes and clicks the Registration button, delete the nag counter cookie and replace it with cookies containing the userA????1s name and e-mail address. After registering, display the name and e-mail address cookies whenever the user revisits the site. 3819 When the Create Page Command Button is clicked the procedure should do the following: i.Create a new slide after the last slide in the presentation. (Use the ppLayoutText layout.) ii.Add a Title to the new slide as typed into the Text Box on the Form. (This is on Shapes(1) on the new slide.) iii.If the A????1Add List of Slide TitlesA????1 Checkbox is checked, a list of all of the slides Titles should be added to the new slide. (This is on Shapes(2) on the new slide.) iv.Add an image to the slide as selected by the user. (Have the Image 1 Option Button as the default.) When adding the image to the slide, you will have to use the AddPicture method of the Shapes collection. You will have to specify the file path depending on where you put the three image files. v.Ensure to unload your form at the end of the procedure. 3820 Create a one dimensional integer array large enough to store 10,000 numbers. Fill the array with random numbers in the range of -100 to +100, inclusive. (25 points) a. Calculate the sum of all the numbers stored in the array and print it. b. Calculate the average of the numbers stored in the array and print it. c. Find the number that occurs most frequently in the array, print the number and how many times it occurs in the array. d. Find the smallest number stored in the array and print it. Matrix math operations (25 points) a. Write a C program that creates two square matrices, 5 rows by 5 columns. Fill them with random numbers in the range -9 to +12 (inclusive). b. Add the two matrices and store the result in a third matrix. Display the resulting matrix. c. Subtract one matrix from the other and display the results. d. Multiply two matrices and display the resulting matrix. 3821 Create a one dimensional integer array large enough to store 10,000 numbers. Fill the array with random numbers in the range of -100 to +100, inclusive. (25 points) a. Calculate the sum of all the numbers stored in the array and print it. b. Calculate the average of the numbers stored in the array and print it. c. Find the number that occurs most frequently in the array, print the number and how many times it occurs in the array. d. Find the smallest number stored in the array and print it. Matrix math operations (25 points) a. Write a C program that creates two square matrices, 5 rows by 5 columns. Fill them with random numbers in the range -9 to +12 (inclusive). b. Add the two matrices and store the result in a third matrix. Display the resulting matrix. c. Subtract one matrix from the other and display the results. d. Multiply two matrices and display the resulting matrix. 3822 Create a new project and create a class called Account to provide services of a bank. When you define the class, you have to provide data members to store the account holderA????1s name, account number, and account type (i.e., checking (=1) or saving (=2)), and current balance. In the implementation, you should use two integer variables to hold the dollar part and cent part of the current balance. (1) Define a constructor to setup a new account with all information as arguments. When you set the member data, you have to check the correctness of the given information. In other words, an account number should be a 4 digits number between 1000 and 9999. The account type should be either 1 or 2, and the initial balance should be zero or more. (2) Define a function member called deposit (int dollar, int cent) to deposit some fund to the account. If the deposit succeeded, this function should return true. However, if the deposit failed by any reason (For example, a negative amount to deposit), it should return false. (3) Define a function member called withdrawal (int dollar, int cent) to withdraw some fund from the account. If the account doesnA????1t have enough money for the withdrawal, this function should return false. Otherwise, it should return true. (4) Define an operator == to compare two accounts. This operator should return true if the balances of two accounts are the same. (5) Define an operator > to compare two accounts. This operator should return true if the first balance has more fund than the second one. (6) Define an operator << to display the account holderA????1s name, account number, and current balance on the screen. Here is the driver file //--- Test driver for class Account #include using namespace std; #include "Account.h" int main() { bool flag; Account chase (A????1JohnA????1, 1000, 1, 10, 50); Account citi (A????1TomA????1, 2000, 2, 10, 50); flag = (chase == citi); cout << A????1Chase account: A????1 << chase << endl; cout << A????1Citi account: A????1 << citi << endl; cout << A????1Chase == Citi: A????1 << flag << endl; chase.deposit (4, 75); citi. deposit (5, 10); flag = (chase > citi); cout << A????1Chase account: A????1 << chase << endl; cout << A????1Citi account: A????1 << citi << endl; cout << A????1Chase > Citi: A????1 << flag << endl; chase.withdrawal (4, 75); citi. withdrawal (5, 15); flag = (chase == citi); cout << A????1Chase account: A????1 << chase << endl; cout << A????1Citi account: A????1 << citi << endl; cout << A????1Chase == Citi: A????1 << flag << endl; return 0; } 3823 Create Javadoc for an ArrayIntStack Submit just the Javadoc html as a single file that looks good by itself (see below, do not submit index.htm). A. Create your own Stack Class, call it ArrayIntStack.java and write four public stack methods (this is the easy part of the assignment). Use at least one private helper method. All methods in your ArrayIntStack must have O(constant) run-time. Your ArrayIntStack extends no other Classes from the Java API. Build your own data structure here!!! 1. boolean empty(); Tests if this stack is empty. 2. int peek(); Looks at the object at the top of this stack without removing it from the stack. 3. int pop(); Removes the object at the top of this stack and returns that object as the value of this function. 4. int push(int item); Pushes an item onto the top of this stack. Since we're using int for return, you must throw an appropriate "empty" Exception for illegal peek and pop operations. B. Generate the standard Javadoc for your class (has author, date, and all methods, each with return types plus brief descriptions) and submit just one html file : See Appendix B (Javadoc comments). Just one html file becomes the tough part of this assignment. Read on...... I require your Javadoc to have method summaries with information as listed (four methods) above, plus the header comments with author and date as shown by example below for the Iterator interface. CAUTION: Be certain your file submitted works by itself!!! I know it looks fine on your computer, but what will it look like when I get just that one file? Attached is a sample of the Iterator class Iterator.java documentation looks like: Iterator.html handled really nice. from Oracle, which shows how comments are changed to produce the nice html formatted documentation in Java6 the similar to what we've been using all along. This way, the source code itself is used to generate documentation, and version control is You will probably need to configure your IDE to use the javadoc standard that comes with the Oracle JDK download. On my computer, the configuration path was (yours' will be slightly different): C:/Program Files (x86)/Java/jdk1.6.0_21/bin/javadoc.exe But then I upgraded to Java7 on a 64-bit PC, and the path to javadoc changed to C:/Program Files/Java/jdk1.7.0_25/bin/javadoc.exe And maybe you've gone as far as Java8 now? In the Iterator example above I used Java6. If you never upgraded to Java7, you're lucky, and probably done. The rest of us have now "updated" to Java7 or Java8 and it gets ugly if you're not careful, see this (BAD->): IteratorJ7.html We have some more work to do: You must fix this ugly problem (or suffer loss of points) by either a) providing a ref to a live css page (maybe the oracle.com API pages), and then it gets back to pretty like this (GOOD->): IteratorJ7css.html or b) putting your stylesheet inside the html, Option a) Find the stylesheet reference, and change it to something like: rel="stylesheet" type="text/css" href="http://docs.oracle.com/javase/7/docs/api/stylesheet.css" Option b) Find the stylesheet reference in you html document, rel="stylesheet" type="text/css" href="stylesheet.css" title="Style" Comment out or delete that line, and go find the css file in the text/css folder. Copy that code so you have the following: 3824 Create a java program that displays the factorials of (0 to 10) as a list. You MUST use a Recursive method to achieve your task 3825 Create a Java Class Library project named project Create a Java Class named SomeArray that encapsulates an array of integers. There is no default constructor. The overload constructor should Have an integer parameter that provides the size/length of the array. Create an array of integers of the specified length. Fill the array with random integers in the range 0 to 100 inclusive Create a method getValue that will return the ith value from the array. Create a method setValue that will allow you to update the ith value in the array. Create a method sumArray that will return the sum of the values in the array. Create a method maxValue that will return the max value in the array. Create a method minValue that will return the minimum value in the array. Create a method avgValue that will return the average of all the values in the array. Create a method frequency that will return the number of times its parameter value occurs in the array. Create a method doubleArray that will update each value in the array to twice its initial value. Create the toString and equals methods. Create a Java Main Class named Array05Client that will be used to test your Array05 class. Create an array of 25 integers Print out the values in the array Print out the 20th value in the array Update the 10th value to 15 Double the values in the array Print out the values in the array Print the sum of the values in the array Print out the average of the values in the array Print out the max value in the array Print out the min value in the array Print out the average of the values in the array Print out the how many times the value 30 occurs in the array Test to see if the array is equal to itself Create a second array of 25 integers Test to see if the first array is equal to the second array. In the above tests make sure that your output is readable. Label each of your tests e.g. for the max value donA????1t just print out an integer value, donA????1t just print instead print 3826 42 The average value is 42 Create an IP address scheme that will accommodate 400 devices divided into 5 segments. You should have 5 IP ranges for five different segments The first 10 IP addresses must be reserved for each segment Show your subnet mask for each range Convert all octets of one IP address for each range in binary form What are the advantages of segmenting the network? Briefly describe the main purpose of reserving IP addresses. How will these IP addresses be distributed to the client workstations? 3827 Create a hierarchy of C++ classes representing various shapes (eg. circle, rectangle, square). Each class will have its own .cpp source file and .h header file.. For the Shape class hierarchy, create an abstract Shape class that will be the base class of all the other shapes. It should have one private std::string instance variable representing the shape's color, and should have the following public member functions: Shape(const string& color) - a constructor that sets the color instance value. string getColor() - a const member function returning the object's color value. double area() - a const pure virtual member function that computes and returns the object's area. It must be overridden in each derived class. string toString() - a const pure virtual member function that returns the shape's description (color, type, measurements, and area) as a std::string. It must be overridden in each derived class. See the example output below for the format. Create a Circle class that is derived from Shape. It should have one private double instance variable representing the radius, and should have the following public member functions: Circle(const string& color, double radius) - a constructor that invokes the base Shape constructor (passing the color), then sets it's own radius instance value. double area() - this overriding member function computes and returns the Circle object's area value. string toString() - this overriding member function returns the Circle object's description (color, type, measurements, and area). Create a Square class with one private double instance variable representing the side length, with a constructor and overriding member functions for area() and toString(). Create a Rectangle class with double instance variables representing the width and length, with a constructor and overriding member functions for area() and toString(). Each derived class .h header file should #include the base Shape.h header. Each derived class .cpp source file should #include its header (e.g. Circle.cpp has a #include Circle.h), plus the other header files needed (eg. iomanip, strstream) Each derived class constructor must use the constructor initializer syntax to call the base Shape constructor with the color parameter. Derived classes do not provide a member function override for getColor(). The base Shape class implementation is inherited. All character data is held using std::string from the C++ Standard Library (no char* or char arrays). All toString() methods use a local std::ostringstream object to format the output (using manipulators) using output stream syntax (<< insertion operators), and return the string contents of the ostringstream. These methods do not write any output, just return the formatted string (as shown below in the example) - the main program does the actual output of the string. The toString() methods will call their area() methods to obtain the area value to be formatted. getShape.cpp For reading shape data, create a getShape.cpp file containing a getShape() function that returns a base Shape * pointer. It should read a shape description from an input stream, create the correct type of derived shape with the new operator and parameters to the constructor, and return a base Shape * pointer to the new object. After reading a shape color and type (e.g. blue circle), it reads the additional information specific to that type of shape (e.g. for a circle, it reads the radius), and then uses the new operator to create the specific derived type of shape (e.g. new Circle(color, radius) ) Input can be from cin, or from a stream input file (use iostreams). When there is no more input data (or when 'done' is entered), return a NULL Shape pointer. All character data is kept in C++ strings (no char[] arrays). This is the only file that #includes the Circle.h, Square.h, and Rectangle.h header files (since it needs them to create the various types of shapes with the new operator). main.cpp The main.cpp file contains the main() function. It defines an array of base Shape pointers, and loops calling getShape() and storing the returned Shape pointer into the next available element of the array. The loop completes when a NULL Shape pointer is returned from getShape. Note that the array contains pointers that point to a variety of derived shape objects (circles, squares, rectangles). This is possible because of the IS-A public inheritance relationship (e.g. a Circle IS-A Shape, and thus has all the properties and behaviors of a Shape). Once all the shapes have been read, main() then loops, printing the list of shapes by calling the toString() member function on each Shape* pointer in the array. main() next sorts the array of Shape pointers into ascending order by area. Note that the areas of the shapes need to be compared, but the array to be sorted contains Shape pointers. When the sort is complete, main then loops and prints the sorted list of shapes. Finally, main loops and calls delete on the Shape pointers to delete the shape objects. main.cpp() #includes only the base Shape.h header file (and the string, iostream, etc., headers needed for stream output). It does not (directly or indirectly) include Circle.h, Square.h, or Rectangle.h. It only needs the base Shape.h header to use the member functions defined in class Shape, but implemented (differently) in all classes derived from Shape. Note that the main() method is an example of generic object oriented programming. It fills an array of pointers to various types of shapes, prints them, sorts them, and prints them again, without knowing the exact types of the Shape objects it is working with (and doesn't need to)! This is a very common and powerful OOP technique. All objects derived from Shape implement the same set of inherited member functions, and thus code using them can be written to generically work with Shape objects. Sample output (using interactive input) Enter a list of shapes - 'done' to end Enter the shape's color (or 'done')... red Enter shape type... circle Enter the radius... 5.0 Enter the shape's color (or 'done')... green Enter shape type... rectangle Enter the length and width... 2.0 4.0 Enter the shape's color (or 'done')... blue Enter shape type... square Enter the length of a side... 3.0 Enter the shape's color (or 'done')... done The list of shapes entered... red circle with radius of 5.00 and area of 78.54 green Rectangle with length of 2.00 and width of 4.00 and area of 8.00 blue Square with side length of 3.00 and area of 9.00 Sorting shapes into order by area... Sorting completed - 2 sort passes required The sorted list of shapes... green Rectangle with length of 2.00 and width of 4.00 and area of 8.00 blue Square with side length of 3.00 and area of 9.00 red circle with radius of 5.00 and area of 78.54 3828 Create a hash table in C++ for names (first name and last name only, no telephone numbers), and use the following to generate the keys: unsigned char key = 0; for (int i = 0; i < fullName.length(); i++) key ^= fullName[i]; Your instructor will be using the following list of names to test your program: Uzoma Acholonu Giuliana Asmad Michael Atkins-Combs Vishnu Bakthisaran Christopher Blowars William Bronson Trevor Butcher Tiffany Caceres-Bonilla Dulce Castro David Cifuentes Daniel Coursen Alexandra Davilla Amanda Dewitt Alfredo Diaz Jan Espinosa Anthony Farrisi Seth Fenstermaker Daniella Gabout Regina Green Kelly Gregory Bryan Houser Michael Jackamorris Kevin Kim Benjamin Lee Kyle Lighting Perlamassiel Lopez Omran Losinno Lisa Maine Derrike Mason Andrew McCalla Alexander McConnell Niral Modi Aida Montanez Christopher Price Daniyal Raza Morgan Rex Andres Rivero Thomas Rudnicki Kyle Russell Samantha Rutkowski Jaskamal Saini Kyle Schmidt Taylor Schnappauf Ryan Snyder Heazel Souid Jason Spiegel Minh Tang Tehillah Trauger Alexis Tocci Luis Virola Dale Wenger Malik White Jaimie Williams When done loading the hash table print out the contents of each occupied entry, and any other entries pointed to by an occupied entry in the following format (use tabs, the columns do not have to line up): Slot 51 is occupied with Alexandra Davilla Ryan Snyder Slot 56 is occupied with William Bronson Derrike Mason Taylor Schnappauf Jason Spiegel You do NOT have to print out the statistics 3829 Create a full program that will have a user enter in a person's age and if age is negative it will catch the exception and display an error message Sorry age must be positive. It will test the age and if age is under 5 or greater than 55 it will display you pay 5.50 and if any other positive age it will say you pay 11.00. All interaction can be done on the console. create a method in the exception that will be giveSecondChance() that will allow user to re-enter a positive age if a negative one is entered.{HINT MODEL THE DIVIDE BY 0 EXAMPLE FROM CLASS TO DO THIS PROGRAM)Post online Create a stack for 25 Strings of first names. You will add each element from the stack by taking the name from a separate file called Names.txt. You will display each name to the console. For extra credit sort the names in alphabetical order and display that as well. Post online 3830 Create the following classes: 1. class Student that includes the following instance variables: private int ID; private double GPA; Student left; Student right; Your class should have the following: ? A constructor that initializes the instance variables. ? set and get methods for the instance variables ID , GPA,left and right . ? setGPA() will produce an error message if GPA is not betwee and 4. 2. class StudentTree that represents a binary tree includes the following instance variable: Student root; Where root is the root of the binary tree containing students. The nodes are of type Student. The key for ordering the tree is the StudentA????1s ID. Your class should have the following: ??boolean insert(int ID, double GPA) Insert a new Student node into the binary tree. If the student already exists, NO insert is done and the method will return false, otherwise it will return true after inserting. ??Student find(int ID) Find and return the student with the given student ID. If the student does not exist in the tree, null should be returned ??boolean remove(int ID) Remove the student with the specified ID. If the student doesnA????1t exist the method will return false, otherwise it will return true. ??void printTree() Traverses and prints the contents of the tree in-order according to the ID. (From least to highest ID). 3.Write a test application named TreeTest. In the main method, do the following: a. Insert 6 students with their GPAs. b. Print the tree contents. c. Find three students. d. Remove 4 students, an error message should be shown if the students does not exist. Print the tree contents. e. Insert 3 more students. f. Remove all students from tree. An error message should be displayed when removing from an empty tree. Sample Output Choose from the menu: 1. Insert new student 2. Find a student 3. Remove a student 4. Print Tree inorder 5. Quit Enter your choice: 1 Enter Students IDs and GPAs (-1 to stop): 1234 3.1 1111 1.2 2222 3 4444 4.0 1300 2.33 1022 2.7 -1 CpE207 Laboratory # 1 Choose from the menu: 1. Insert new student 2. Find a student 3. Remove a student 4. Print Tree inorder 5. Quit Enter your choice: 4 (1022,2.7) (1111,1.2) root(1234,3.1) (1300,2.33) (2222,3.0) (4444,4.0) Choose from the menu: 1. Insert new student 2. Find a student 3. Remove a student 4. Print Tree inorder 5. Quit Enter your choice: 2 Enter Students IDs to be found (-1 to stop) ID: 1111 GPA = 1.2 ID: 1022 GPA = 2.7 ID: 5500 Student not found!! ID: -1 Choose from the menu: 1. Insert new student 2. Find a student 3. Remove a student 4. Print Tree inorder 5. Quit Enter your choice: 3 Enter Student IDs to be removed (-1 to stop): ID: 1111 1111 is removed ID: 4444 4444 is removed ID: 4444 ERROR: The ID does not exist!! ID: 1300 1300 is removed ID: 1234 1234 is removed ID: -1 Choose from the menu: 1. Insert new student 2. Find a student 3. Remove a student 4. Print Tree inorder 5. Quit Enter your choice: 4 (1022,2.7) root(2222,3.0) Choose from the menu: 1. Insert new student 2. Find a student 3. Remove a student 4. Print Tree inorder 5. Quit Enter your choice: 1 Enter Students IDs and GPAs (-1 to stop): 2000 3.3 3000 4 4000 3.6 -1 Choose from the menu: 1. Insert new student 2. Find a student 3. Remove a student 4. Print Tree inorder 5. Quit Enter your choice: 3 Enter Student IDs to be removed (-1 to stop): ID: 3000 3000 is removed ID: 2222 2222 is removed ID: 2000 2000 is removed ID: 1022 1022 is removed ID: 9988 ERROR: The ID does not exist ID: -1 Choose from the menu: 1. Insert new student 2. Find a student 3. Remove a student 4. Print Tree inorder 5. Quit Enter your choice: 5 I did the Student class public class Student { private int ID; private double GPA; Student left; Student right; public Student(int iD, double gPA) { ID = iD; GPA = gPA; left=null; right=null; } public int getID() { return ID; } public void setID(int iD) { ID = iD; } public double getGPA() { return GPA; } public void setGPA(double gPA) { if(gPA>=0 && gPA<=4) GPA = gPA; else {System.out.print("error"); GPA=0; } } public Student getLeft() { return left; } public void setLeft(Student left) { this.left = left; } public Student getRight() { return right; } public void setRight(Student right) { this.right = right; } } 3831 Create an Eclipse project named A????1Java1_Lab_LastNameA????1. Code formatting should match the book and my examples. Create a class named Contact with fields for name, phone and email. Create a constructor that takes 3 arguments to initialize the name, phone and email. Create getMethods for all the fields. Create a TestContact class with a main method. Use a while loop to ask for last name, phone and email separated by spaces using a single JOptionPane. In the loop check if the user selects Ok or Cancel without entering data, if so prompt the user until valid data is entered. Separate the name, phone and email into separate String variables. Do NOT use the split method or arrays. In the loop check if the name is 10 characters or less, if not, prompt the user until valid data is entered. If valid data is entered, create the Contact object using the constructor and name, phone and email supplied by the user. Display its contents in a JOptionPane using the get methods. Use JOptionPane for all input and output and comment your code. 3832 Create a constructor for the Student class you created. The constructor should initialize each Student's ID number to 9999, his or her points earned to 12, and credit hours to 3 (resulting in a grade point average of 4.0). Write a program that demonstrates that the constructor works by instantiating an object and displaying the initial values. Save the application as ShowStudent2.java Here's the Student class: public class Student { private int ID; private int creditHours; private int pointsEarned; double GPA; public Student() { } public Student(int id,int hrs, int pts) { ID=id; creditHours=hrs; pointsEarned=pts; } public double getGPA() { return GPA; } public void setGPA() { GPA = (double) pointsEarned / creditHours; } public void setID(int number) { ID = number; } public int getID() { return ID; } public void setCreditHours(int hours) { creditHours = hours; } public int getCreditHours() { return creditHours; } public void setPointsEarned(int points) { pointsEarned = points; } public int getPointsEarned() { return pointsEarned; } } Thank you! 3833 Create a class named State that holds the following fields: a String for the name of the state, an integer for the population, and two City objects that hold data about the capital city and the most populous city. The State constructor requires six parameters that represent the names and populations of the state, its capital, and its most populous city. Provide get methods for each field. Create the City class to be a nonstatic, private inner class within the State class; the City class contains a cityA????1s name and population. Create a class to assign values to and display values from two State objects. Save the files as State.java and TestState.java. 3834 Create a class named Sandwich. Include a Bread field and a SandwichFilling field. Include a constructor that takes parameters for each field needed in the two objects and assigns them to each objectA????1s constructor. Write an application named TestSandwich to instantiate three Sandwich objects with different values, and then display all the data for each object, including the total calories in a Sandwich, assuming that each Sandwich is made using two slices of Bread. Save both the Sandwich.java and TestSandwich.java files. Please help! 3835 Create a class named Patient that includes an ID number, age, and BloodData. Provide a default constructor that sets the ID number to "0", the age to 0, and the BloodData to "O" and "+". Create an overloaded constructor that provides values for each field. Also provide get methods for each field. Save the file as Patient.java. Create an application named TestPatient that demonstrates that each method works correctly, and save it as TestPatient.java. **Note: Please make sure the directions are followed carefully. Both a default constructor and an overloaded constructor are needed. The output cannot look like it does below, thank you!** 3836 Create a class named Patient that includes an ID number, age, and BloodData. Provide a default constructor that sets the ID number to "0", the age to 0, and the BloodData to "O" and "+". Create an overloaded constructor that provides values for each field. Also provide get methods for each field. Save the file as Patient.java. Create an application named TestPatient that demonstrates that each method works correctly, and save it as TestPatient.java. **Note: This question has been answred before, but upon testing it I got about 10 errors. **********DO NOT PROMPT THE USER!!!!!***** 3837 a) Create a class named BankAccount with fields that hold an account number, the owner's name, and the account balance. Include a constructor that initializes each field to appropriate default values. Also include methods to get and set each of the fields. Include a method named deductMonthlyFee() that reduces the balance by $4.00. Include a static method named explainAccountPolicy() that explains that the $4 service fee will be deducted each month. **Note--(provide your best shot in explaining why you would be taking away the money from themA????1.you have to come up with some good explanation, since it is probably unfair and unjustified ?).** b) Create a class named TestBankAccount whose main() method declares four BankAccount objects. Call a getData() method three times. Within the method, prompt the user for values for each field for a BankAccount, and return a BankAccount object to the main() method where it is assigned to one of main()'s BankAccount objects. Do not prompt for values for the fourth BankAccount object, but let it continue to hold the default values. Then, in main(), pass each BankAccount object in turn to show a showValues() method that displays the data, calls the method that deducts the monthly fee, and displays the balance again. The showValues() method also calls the method that explains the deduction policy. **Quick Note: This project is taken from chapter 4 of the 7th edition of Java Programming (Joyce Farrell). Please try to refrain from using any advanced techniques beyond the 4th chapter. Thank you!** *Note: This question has been asnwered before, but the method was never called a second time to display the balance after the deduction. Here's the code so far... public class BankAccount { int accountNumber; String ownerName; int accountBalance; public BankAccount(int accountNumber, String ownerName, int accountBalance) { super(); this.accountNumber = accountNumber; this.ownerName = ownerName; this.accountBalance = accountBalance; } public int getAccountNumber() { return accountNumber; } public void setAccountNumber(int accountNumber) { this.accountNumber = accountNumber; } public String getOwnerName() { return ownerName; } public void setOwnerName(String ownerName) { this.ownerName = ownerName; } public int getAccountBalance() { return accountBalance; } public void setAccountBalance(int accountBalance) { this.accountBalance = accountBalance; } public void deductMonthlyFee() { this.setAccountBalance(this.getAccountBalance()-4); } public static void explainAccountPolicy() { System.out.println("According to polocy the service fee of $4 will be deducted each month"); } @Override public String toString() { return "BankAccount [accountNumber=" + accountNumber + ", ownerName=" + ownerName + ", accountBalance=" + accountBalance + "]"; } public BankAccount() { super(); } } import java.io.ObjectInputStream.GetField; import java.util.Scanner; public class TestBankAccount { Scanner sc=new Scanner(System.in); public static void main(String[] args) { TestBankAccount testBankAccount=new TestBankAccount(); BankAccount bankAccount1=testBankAccount.getData(); BankAccount bankAccount2=testBankAccount.getData(); BankAccount bankAccount3=testBankAccount.getData(); BankAccount bankAccount4=new BankAccount(); BankAccount.explainAccountPolicy(); testBankAccount.showValues(bankAccount1); testBankAccount.showValues(bankAccount2); testBankAccount.showValues(bankAccount3); testBankAccount.showValues(bankAccount4); } public BankAccount getData() { System.out.println("enter Account number\tOwner's Name\tAccount Balance"); int accountNumber=sc.nextInt(); String ownerName=sc.next(); int accountBalance=sc.nextInt(); return new BankAccount(accountNumber, ownerName, accountBalance); } public void showValues(BankAccount bankAccount) { System.out.println("Account Number "+bankAccount.getAccountNumber()+"'s owner is "+bankAccount.getOwnerName()+" having balance "+bankAccount.getAccountBalance()); } } Thank you in advance!! 3838 Create a class with the same functionality as the BirdSghting class, but create the default constructor to call the three-parameterconstructor. Save the class as BirdSighting2.java. Create an application to test the new version of the class and name it TestBirdSighting2.java. Here is my BirdSighting class: class BirdSighting { private String species; private int noseen; private int dayofyear; public BirdSighting() { species="robin"; noseen=1; dayofyear=1; } public BirdSighting(String a, int b,int c) { species=a; noseen=b; dayofyear=c; } public String getSpecies() { return this.species; } public int getNoSeen() { return this.noseen; } public int getDayofyear() { return this.dayofyear; } public void setSpecies(String a) { species=a; } public void setNoSeen(int a) { noseen=a; } public void setDayofyear(int a) { dayofyear=a; } } Thank You! 3839 Create a class called Month (java file called Month.java) with the (exact) following fields and methods (these names and caps exactly): Filed/Method Description An int field that holds the number of the month MonthNumber Month Month Month GetMonthNumber SetMonthNumber GetMonthName Number Name 1 January 2 February 3 March 4 April 5 May 6 June 7 July 8 August 9 September 10 October 11 November 12 December A no-argument constructor that sets the monthNumber field to 1 A contructor that accept the number of the month as an argument (1, 2, etc) and sets the monthNumber field to that value. If a value less than 1 or larger that 12 is passed , the constructor should set monthNumber to 1 A contructor that accept the name of the month as an argument (A????1JanuaryA????1,FebruaryA????1, etc) and sets the monthNumber field to the corresponding number. A method that returns the monthNumber field value A method that accept an int number as an argument and sets the monthNumber field to that number A method that returns the name of the month corresponding to the monthNumber field value A method that accept a string value as an argument (representing the name of the month: A????1JanuaryA????1, FebruaryA????1, etc.) and sets the SetMonthName monthNumber field to the corresponding number (1, 2, etc) - Extra Credit Equals GreaterThan A method that accepts a Month object as an argument and returns true if the data from that object (its MonthNumber) is the same as the MonthNumber field or false otherwise A method that accepts a Month object as an argument and returns true if the data from that object (its MonthNumber) is greater than the MonthNumber field or false otherwise A method that accepts a Month object as an argument and returns true if the data from that object (its MonthNumber) is less than the MonthNumber field LessThan or false otherwise You are going to lose points if you do not name the class, the fields, or methods as requested. You should not have a field for the month name: your code should compute the name of the month from the number when needed. Create a program/project called [YourName]-Assignment6 (replace [YourName] with your actual name) in the same project as the Month.java. You will need to add the class Month to the project and add your code to the project class main method. The program (code) should: Create three objects: Month1 one using the first constructor (with no arguments) and Month2 using the second constructor with 2 as an argument, and Month3 using the third constructor with A????1OctoberA????1 as an argument. Use the GetMonthNumber to get the month number from objects Month1, Month2, and Month3 and output the values to the console. Use the GetMonthName to get the month name from objects Month1, Month2, and Month3 and output the values to the console. Use the SetMonthNumber to set the Month1 object value to 9. Use the SetMonthName with argument A????1SeptemberA????1 to set the Month2 object value to 9. - Extra Credit Use the GetMonthName to get the month name from objects Month1, Month2, and Month3 and output the values to the console. Use the Equals method of Month1 to compare its value with Month2 value and output the result to the console. Use the GreaterThan method of Month2 to compare its value with Month3 value and output the result to the console. Use the LessThan method of Month3 to compare its value with Month1 value and output the result to the console. 3840 a) Create a CertificateOfDeposit class. The class contains data fields that hold a certificate number, account holderA????1s last name, balance, issue date, and maturity date, using GregorianCalendar objects for each date. Provide get and set methods for each field. Also provide a constructor that requires parameters used to set the first four fields, and sets the maturity date to exactly one year after the issue date. Save the class as CertificateOfDeposit.java. b) Create an interactive application that prompts the user for data for two CertificateOfDeposit objects. Prompt the user for certificate number, name, balance, and issue date for each CertificateOfDeposit, and then instantiate the objects. Display all the values, including the maturity dates. Save the application as TestCertificateOfDeposit.java. 3841 Create a C++ Program that Can determine the net Profit for a Fisherman by ahow many hours per week he worked, how many fish sold during week, the boat price and boat insurance. Please allow the user to input what ever number using cin 3842 Create a C++ file called ArrayList.cpp(which is the last program shown below and what i have so far). Name your class ArrayList. Start with this code: ArrayList.h(which is the second program below these instructions)contains the public interface specification; ArrayList.cpp contains(most of) the implementation details. You will need to implement the following functions: ArrayList(const ArrayList& other)-the copy constructor. void add(int index, int item) A????1 see ArrayList.h for specifications. Use the following program: testArrayList.cpp to test your code(which is the third program below these instructions. The output (which is the first program)should match whats shown next (except that the addresses and the undefined value at index zero will probably be different). Program 1 - OUTPUT: 0:6165408 1:2 2:4 3:6 4:8 5:10 6:12 7:14 8:16 9:18 10:20 11:22 12:24 13:26 14:28 15:30 16:32 17:34 18:36 19:38 20:40 21:42 22:44 23:46 24:48 25:50 26:52 27:54 28:56 29:58 30:60 31:62 32:64 33:66 34:68 35:70 36:99 Destructing ArrayList at 0x5e1078 #items = 37 capacity = 64 #items = 2001 capacity = 2048 Destructing ArrayList at 0x5e3728 PROGRAMS TO WORK WITH: Program 2 - ArrayList.h : /* * Source File: ArrayList.h */ #ifndef ARRAYLIST_H_ #define ARRAYLIST_H_ #include // Normally wouldn't do this, but needed to support output in destructor class ArrayList { public: /* * Initialize list with a capacity of 8 */ ArrayList(); /* * Copy constructor */ ArrayList(const ArrayList& other); virtual ~ArrayList() { std::cout << "Destructing ArrayList at " << array << std::endl; delete [] array; array = NULL; } /* * Add item to end of list * @param item item to add to list */ void add(int item); /* * Adds item to list, at index, shifting items as necessary and increasing * capacity of list as necessary. If capacity must increase, it must always * be a power of 2. Note that if index is beyond capacity, capacity must be * increased to allow adding the item at that index. Also, length should * reflect the HIGHEST index (plus one, naturally) at which an item is * stored, even if lower-indexed slots contain undefined values. * * @param item item to add to list */ void add(int index, int item); /* * Return item at index. For now, we assume index is legal. * Later we will throw an exception when index is illegal. * @param index index of item to return * @return item at index */ int get(int index) const; /* * Return capacity * @return capacity */ int getCapacity() const { return capacity; } /* * Return current length * @return current length */ int getLength() const { return length; } private: int *array; int length; int capacity; /* * Change capacity to that specified by newCapacity. * @param newCapacity the new capacity */ void changeCapacityTo(int newCapacity); }; #endif /* ARRAYLIST_H_ */ Program 3 -The following is the test program testArrayList.cpp /* * Source File: testArrayList.cpp */ #include #include "ArrayList.h" using namespace std; void verifyArrayList(ArrayList arrayList) { for(int i = 0; i < 1000; ++i) { int item; int itemToAdd = 2 * i; if((item = arrayList.get(i)) != itemToAdd) cout << "OOPS - Error at index " << i << ": " << item << " should be " << itemToAdd << endl; } } void printArrayList(ArrayList arrayList) { for(int i = 0; i < arrayList.getLength(); ++i) { int item = arrayList.get(i); cout << i << ":" << item << endl; } } int main(int argc, char *argv[]) { ArrayList arrayList; const int highIndex = 35; for(int i = highIndex; i > 0; --i) { int itemToAdd = 2 * i; arrayList.add(1, itemToAdd); } arrayList.add(99); printArrayList(arrayList); cout << "#items = " << arrayList.getLength() << endl; cout << "capacity = " << arrayList.getCapacity() << endl; arrayList.add(2000, 9999); cout << "#items = " << arrayList.getLength() << endl; cout << "capacity = " << arrayList.getCapacity() << endl; } Last program that I am working on: /* * * ArrayList.cpp * * This is the implementation file for the ArrayList class. */ #include "ArrayList.h" ArrayList::ArrayList() { capacity = 8; length = 0; array = new int[capacity]; } ArrayList::ArrayList(const ArrayList& other){ capacity = 8; length= 0 ; array = new int[capacity]; } void ArrayList::add(int item){ if (length >= capacity) changeCapacityTo(2 * capacity); array[length++] = item; } void ArrayList::changeCapacityTo(int newCapacity){ int *newArray = new int[newCapacity]; this->capacity = newCapacity; if(newCapacity < this->length) length = newCapacity; for(int i = 0; i < length; ++i) newArray[i] = array[i]; delete[] array; array = newArray; } int ArrayList::get(int index) const { return array[index]; } End of program. Few changes still need to be made which I still don't know what they are in the ArrayList.cpp and I am getting a couple errors in the testArrayList.cpp file which shouldn't be a problem because this program cannot be modify. 3843 Create a bash script that has a local variable called My-acct which is set to your username. This script should use grep and the My-acct term to find lines in any file on or under your home directory that contain your username (grep) should use My-acct as a regular expression 3844 Create an application named Percentages whose main() method holds two double variables. Assign values to the variables. Pass both variales to a method named computePercent() that displays the two values and the value of the first number as a percentage of the second one. Then call the method a second time, passing the values inreverse order. Save as Percentages.java I'm prety much done, I just need this modified to NOT prompt the user for any information. Thank you public class Percentages { public static void main(String[] args) { String inputNumber; double number1; double number2; inputNumber = JOptionPane.showInputDialog(null,"Plese enter the first number"); number1 = Double.parseDouble(inputNumber); inputNumber = JOptionPane.showInputDialog(null,"Plese enter the second number"); number2 = Double.parseDouble(inputNumber); computePercent(number1,number2); computePercent(number2,number1); } public static void computePercent(double num1, double num2) { JOptionPane.showMessageDialog(null,num1 + " is " + num1/num2*100 + "% of " + num2); } } Thank you 3845 create an application that displays a form similar to the one shown in figure 5-42 when the enter numbers button is clicked, the application should display the input box shown in figure 5-43. the input box asks the user to enter a positive integer value. notice that the default input value is 10. when the ok button is clicked, the application should display a message box with the sum of all the integers from 1 through the value entered by the user, as shown in figure 5-44. if the user enters a negative value, the application should display an error messageuse the following data to determine if the application is calculating properly. Value Sum 5 15 10 55 20 210 100 5050 3846 Create an application in C# with a method that accepts a string as an argument and returns the number of words it contains. For instance, if the argument is "Four score and seven years ago," the method should return the number 6. The application should let the user enter a string, and then it should pass the string to the method. The number of words in the string should be displayed. 3847 CPU has 64KB cache and 128MB of RAM. There are 4,096 cache blocks in the cache memory and and the main memory (RAM) has 8,388,608 memory blocks. A) If the cache mem uses 16 way set associateve design, what is the number of bits in the bytem index (in the memory address) needed for identifyin gbytes in a particula chache block? Waht is the number of index bits (in the memory address) needed for indentifying cache sets? What is the number of tag bits (in the memory address) needed for identifying a memory block. Show the memory address format. B) If the cache memeory uses fully associtave design, what is the number of tag bits(in the memory address) needed for identifying a memeory block in a particular casche block? Show memeory address format. C) If the cache memeory uses direct mapped desing, wht is the number of tag bits (in the memory address) needed for identifying a memory block in a particular cache block? Show the memeoy address format. D) What is the tag-bit overhead under each cache design in problems a, b, c. E) If the cache memeory usues an 8-way set associtive design, what are the possible destionation cache blocks for memory block B777777? For A I got that the total lenght of the address is 23, the tag bits are 15, byte index is 16, and 8 bits are needed to identify a cache set. But this is more than 23 so I don't think that they can over lap in the address. And I have tried to find the forumla online everywhere without the off set since we were not taught anything about calculating this with an offset. 3848 A couple of question about intro level CS: I'm more interested with the how than the actual answer. hypothetical ISA supports 6 different operations. How many bits of the instruction must be allocated for the opcode field? 1. The operands must also be encoded into the instruction. The most common type of operand is a value contained in a register in the processor's register file. Since the value is in a register, we just need to encode enough information to identify which register. The hypothetical ISA from the previous question states that the register file contains 32 registers. How many bits must be allocated to identify each register operand? 2.The hypothetical ISA from the previous questions on this page includes an ADD instruction that performs the operation Rd . Note that the arrow () used in the above notation points to where the result of the operation will be stored. When the processor executes this instruction, it will read the values from the source registers symbolized by Ra and Rb) and stores their sum in the destination register (symbolized by Rd). How many bits do we need to encode the ADD instruction? 3.Some instructions have different numbers of operands. The hypothetical ISA from the previous questions on this page also has a bitwise NOT instruction that performs the operationRd , and which only requires one source register. Remember we will always assume that all instructions in a given ISA are encoded with the same number of bits. If all instructions in this ISA are as long as the ADD instruction, how many bits would be unusedwhen encoding the NOT instruction? Answers: 3, 5, 18, 5, 3849 At Countrywide Construction, you are trying to convince your boss that he should consider modern project management techniques to manage a complex project. Your boss says that he does'nt need anything fancy and that he can guess the total time by the seat of his pants. To prove your point, you decide to use a very simple example of a commercial construction project with 8 tasks. You create a hypothetical work breakdown structure as follows: Prepare the foundation (10 days). Then assemble the building (4 days) When building is assembled start 2 tasks at once: Finish the interior work (4 days) and set up appointment for the final building inspection (30 days). When the interior work is done, start 2 more tasks at once: Landscaping (5 days) and driveway paving(2days) When the landscaping and driveway are done do the painting (5 days) Finally when the painting is done and the final inspection has occurred, arrange the sale (3 days) Now you ask your boss to estimate the total time and write his answer on a piece of paper. You look at the paper and aee that his guess was wrong. 1. What is the correct answer? 2. What is the critical path? 3. Create a Grantt chart that shows the WBS. 4. Create a PERT?CPM chart. 3850 Could someone please help me out with this JAVA CODE. thank you so much. Show transcribed image text Question 1: Comparing two String (20 points) In the file Sorting.java, write a method called compare? that takes String s1 and String s2 as arguments and returns an integer. It should compare s1 and s2 alphabetically such as follows: For example, compare(apple, king) would produce -1. Note that apple < king="" ,="" corresponding="" to="" apple="" being="" closer="" to="" the="" beginning="" of="" a="" dictionary="" than="" king.="" you="" cannot="" use="" any="" built-in="" java="" functions2="" for="" comparing="" strings="" for="" this="" question.="" you="" should="" use="" a="" for="" loop="" that="" compares="" each="" character="" one="" by="" one,="" extracting="" the="" characters="" using="" the="" chart="" method.="" note="" that="" you="" must="" handle="" the="" case="" where="" the="" strings="" will="" have="" different="" lengths.="" you="" are="" to="" treat="" upper-="" and="" lower-case="" letters="" as="" if="" they="" were="" identical="" (hint:="" use="" the="" string="" methods="" to="" upper="" case="" or="" to="" lower="" case).="" note="" that="" you="" should="" handle="" spaces="" as="" being="" less="" than="" all="" other="" characters.="" assume="" that="" there="" are="" only="" letters="" and="" spaces="" in="" the="" strings.="" examples:=""> 3851 could someone please complete the insert_after_current portion of this c++ code so that it will correctly make a linked list? #include #include using namespace std; struct Range_error : out_of_range { // enhanced vector range error reporting int index; Range_error(int i) :out_of_range("Range error: "+to_string(i)), index(i) { } }; inline void error(const string& s) { throw runtime_error(s); } inline void error(const string& s, const string& s2) { error(s+s2); } struct Node { int data; Node* next; Node(int d=0, Node* n=0) : data(d), next(n) {} }; class LinkedList { private: Node* head; Node* curr; public: LinkedList() : head(0), curr(0) {} LinkedList(LinkedList& ll); LinkedList& operator=(const LinkedList& ll); ~LinkedList(); Node* insert_after_current(int value); void delete_after_current(); void display_list(); void operator++() { curr = curr->next; } void front() { curr = head; } bool is_curr_nonnull() const { return curr != 0; } }; LinkedList::LinkedList(LinkedList& ll) { // copy constructor code } LinkedList& LinkedList::operator=(const LinkedList& ll) { if (this == &ll) return *this; // remove old list Node *p, *node = head; while (node != 0) { p = node; node = node->next; delete p; } // create a new list node = ll.head; Node *tail = 0; head = 0; while (node != 0) { Node *newnode = new Node(node->data); if (tail == 0) tail = head = newnode; else { tail->next = newnode; tail = newnode; } node = node->next; } return *this; } LinkedList::~LinkedList() { // remove the whole list Node *p, *node = head; while (node != 0) { p = node; node = node->next; delete p; } } Node* LinkedList::insert_after_current(int value) { Node *newnode = new Node(value); if (curr == 0) { if (head != 0){error("Invalid current pointer");} else { } //code for insertion of first node } else { } return curr; } void LinkedList::delete_after_current() { if (curr == 0) { if (head != 0){error("Invalid current pointer");} } else { Node *oldnode = curr->next; if (curr->next != 0) { } // code for deletion a node other than the first one } } void LinkedList::display_list() { Node *node = head; while(node != 0) { cout << node->data << " "; node = node->next; } cout << '\n'; } int main(){ LinkedList L1; L1.insert_after_current(10); L1.insert_after_current(20); L1.insert_after_current(30); L1.insert_after_current(40); L1.display_list(); L1.front(); L1.delete_after_current(); cout << "list L1:\n"; L1.display_list(); LinkedList L2(L1); cout << "list L2:\n"; L2.display_list(); LinkedList L3; cout << "list L3:\n"; L3.insert_after_current(40); L3.display_list(); L3 = L2; L3.display_list(); return 0; } 3852 could someone please complete the insert_after_current ,delete_after_current, and the copy constructor in the following c++ code so that it correctly produces a linked list? thanks #include #include using namespace std; struct Range_error : out_of_range { // enhanced vector range error reporting int index; Range_error(int i) :out_of_range("Range error: "+to_string(i)), index(i) { } }; inline void error(const string& s) { throw runtime_error(s); } inline void error(const string& s, const string& s2) { error(s+s2); } struct Node { int data; Node* next; Node(int d=0, Node* n=0) : data(d), next(n) {} }; class LinkedList { private: Node* head; Node* curr; public: LinkedList() : head(0), curr(0) {} LinkedList(LinkedList& ll); LinkedList& operator=(const LinkedList& ll); ~LinkedList(); Node* insert_after_current(int value); void delete_after_current(); void display_list(); void operator++() { curr = curr->next; } void front() { curr = head; } bool is_curr_nonnull() const { return curr != 0; } }; LinkedList::LinkedList(LinkedList& ll) { // copy constructor code } LinkedList& LinkedList::operator=(const LinkedList& ll) { if (this == &ll) return *this; // remove old list Node *p, *node = head; while (node != 0) { p = node; node = node->next; delete p; } // create a new list node = ll.head; Node *tail = 0; head = 0; while (node != 0) { Node *newnode = new Node(node->data); if (tail == 0) tail = head = newnode; else { tail->next = newnode; tail = newnode; } node = node->next; } return *this; } LinkedList::~LinkedList() { // remove the whole list Node *p, *node = head; while (node != 0) { p = node; node = node->next; delete p; } } Node* LinkedList::insert_after_current(int value) { Node *newnode = new Node(value); if (curr == 0) { if (head != 0){error("Invalid current pointer");} else { } //code for insertion of first node } else { } return curr; } void LinkedList::delete_after_current() { if (curr == 0) { if (head != 0){error("Invalid current pointer");} } else { Node *oldnode = curr->next; if (curr->next != 0) { } // code for deletion a node other than the first one } } void LinkedList::display_list() { Node *node = head; while(node != 0) { cout << node->data << " "; node = node->next; } cout << '\n'; } int main(){ LinkedList L1; L1.insert_after_current(10); L1.insert_after_current(20); L1.insert_after_current(30); L1.insert_after_current(40); L1.display_list(); L1.front(); L1.delete_after_current(); cout << "list L1:\n"; L1.display_list(); LinkedList L2(L1); cout << "list L2:\n"; L2.display_list(); LinkedList L3; cout << "list L3:\n"; L3.insert_after_current(40); L3.display_list(); L3 = L2; L3.display_list(); return 0; } 3853 Could someone kindly explain how the stack data structure works for use in C++? And could you give a demo of an implementation of it, mainly for the purpose of parsing input strings? 3854 Could someone help me with this C programming exercise: Show transcribed image text 1) Write a program that calculates how many digits a number contains. For example Enter a number: 374 The number 374 has 3 digits Assume the number has no more than four digits. 2) In one state, single residents are subject to the following income tax: Income Not over $750 $750-$2250 $2250-$3750 $3750-$5250 $5250-$7000 Over $7000 Amount of Tax 1% of income $7.50 + 2% of amount over $750 $37.50 + 3% of amount over $2250 $82.50 + 4% of amount over $3750 $142.50 + 5% of amount over $5250 $230.00 + 6% of amount over $7000 Write a program that asks the user to enter the amount of taxable income, then displays the tax due. 3855 Could someone complete the missing functins in c++? #include #include using namespace std; struct Range_error : out_of_range { // enhanced vector range error reporting int index; Range_error(int i) :out_of_range("Range error: "+to_string(i)), index(i) { } }; inline void error(const string& s) { throw runtime_error(s); } inline void error(const string& s, const string& s2) { error(s+s2); } struct Node { int data; Node* next; Node(int d=0, Node* n=0) : data(d), next(n) {} }; class LinkedList { private: Node* head; Node* curr; public: LinkedList() : head(0), curr(0) {} LinkedList(LinkedList& ll); LinkedList& operator=(const LinkedList& ll); ~LinkedList(); Node* insert_after_current(int value); void delete_after_current(); void display_list(); void operator++() { curr = curr->next; } void front() { curr = head; } bool is_curr_nonnull() const { return curr != 0; } }; LinkedList::LinkedList(LinkedList& ll) { // copy constructor code } LinkedList& LinkedList::operator=(const LinkedList& ll) { if (this == &ll) return *this; // remove old list Node *p, *node = head; while (node != 0) { p = node; node = node->next; delete p; } // create a new list node = ll.head; Node *tail = 0; head = 0; while (node != 0) { Node *newnode = new Node(node->data); if (tail == 0) tail = head = newnode; else { tail->next = newnode; tail = newnode; } node = node->next; } return *this; } LinkedList::~LinkedList() { // remove the whole list Node *p, *node = head; while (node != 0) { p = node; node = node->next; delete p; } } Node* LinkedList::insert_after_current(int value) { Node *newnode = new Node(value); if (curr == 0) { if (head != 0) error("Invalid current pointer"); else //code for insertion of first node } else { //code for insertion a node other than the first one } return curr; } void LinkedList::delete_after_current(){ if (curr == 0) { if (head != 0) error("Invalid current pointer"); } else { Node *oldnode = curr->next; if (curr->next != 0) // code for deletion a node other than the first one } } void LinkedList::display_list() { Node *node = head; while(node != 0) { cout << node->data << " "; node = node->next; } cout << '\n'; } int main() { LinkedList L1; L1.insert_after_current(10); L1.insert_after_current(20); L1.insert_after_current(30); L1.insert_after_current(40); L1.display_list(); L1.front(); L1.delete_after_current(); cout << "list L1:\n"; L1.display_list(); LinkedList L2(L1); cout << "list L2:\n"; L2.display_list(); LinkedList L3; cout << "list L3:\n"; L3.insert_after_current(40); L3.display_list(); L3 = L2; L3.display_list(); return 0; } 3856 And could you please give me the equation that will used to calculate the efficiency of Pure Aloha and get the graph value ?? Show transcribed image text Graph the efficiency of slotted ALOHA and pure ALOHA as a function of p for the following values of N: N =10. N =25. N =50. And could you please give me the equation that will used to calculate the efficiency of Pure Aloha and get the graph value ?? 3857 Thanks !! Images: If you could help me with these two questions I would really appreciate it, The questions are in the attached file? Show transcribed image text 8. The amount remaining from a 100-milligram sample of radioactive substance after t years is given by A = 100 e^-.05t where A = amount after t years. Find the substances half-life to the Nearest year. 9. A certain community consists of 1000 people. The total number of people infected by a Virus is given by y = . Substitute y= 100 into the model and solve for x to find the number of days before 100 people have the desire to do math. Round your answer to the neatest tenth. 3858 Could the following table represent relations in a relational database? If not justify your answer. If yes, list the attribute set.. Cast list 3859 Character Actor Understudy Hamlet Helmut Weiner Claudius Richard Gunther Bob Searle Ophelia Suzanne Bonner Sally Richards Gertrude Virginia Smith John Garner, Sam Ranier No understudy DO NOT COPY AND PASTE FROM A WEBSITE IT HAS TO BE IN YOUR OWN WORDS. THANKS! 1- As a corporate network administrator the industry standard suggests your job is to maintain the confidentiality, availability, and integrity of all network resources. Choose an attack that affects one (1) of the three (3) areas in question. Describe the attack, and provide one (1) example that illustrates the primary manner in which such an attack could damage a company. Suggest at least one (1) strategy that a company can use in order to protect itself against the identified attack. 2- Explain three (3) approaches to protecting an enterprise network against malware or viruses. Suggest two (2) security products that one may use in conjunction with one another to help protect network resources. Of the two (2) suggested products, give your opinion of the one (1) that provides the greatest degree of protection for the enterprise. Provide a rationale for your response. 3860 Can I copy/paste a sheet from book B into a Book A where the imported Sheets from book B now refer to the other sheets/cells from Book A? I have some comprehensive company workbook templates i have to fill out for all clients Some sheets are quite repetitive I am wondering whether i can copy/paste sheets from existing books into my new client book The problem being these sheets make reference to other sheets (client data) in the book Can I copy/paste a sheet from book B into a Book A where the imported Sheets from book B now refer to the other sheets/cells from Book A?? Thanks !! 3861 I need ppt done. speaker note is must. Attach 3861 3862 Copy the following data and paste them in a file named Payroll.txt (code#salary). 1#23400 4#17000 5#21000 6#12600 9#26700 10#18900 11#18500 13#12000 15#49000 16#56500 20#65000 21#65500 22#78200 23#71000 24#71100 25#72000 30#83000 31#84000 32#90000 Write a program that allows the user to enter a payroll code. The program should search for the payroll code in the file and then display the appropriate salary. If the payroll code is not in the file, the program should display an appropriate message. Use a sentinel value to end the program. 3863 Copy the following data and paste them in a file named Payroll.txt (code#salary). 1#23400 4#17000 5#21000 6#12600 9#26700 10#18900 11#18500 13#12000 15#49000 16#56500 20#65000 21#65500 22#78200 23#71000 24#71100 25#72000 30#83000 31#84000 32#90000 Write a program that allows the user to enter a payroll code. The program should search for the payroll code in the file and then display the appropriate salary. If the payroll code is not in the file, the program should display an appropriate message. Use a sentinel value to end the program. 3864 /* COP3014L -- Debugging Exercise, based on AT&T Network Bug */ /* See handout associated with this program for more information */ /* Note: this is not intended to be a good example of coding style. */ /* Last edited: 31/8/2011. */ #include using namespace std; void make_unitialized(void); int phone_network(int i, int x, int y); void init_values_x1(void); void init_values_part1A(void); void init_values_part1B(void); void init_values_part2(void); void init_default(void); /* global variables that control phone network */ int val1, val2; /*--------------------------------------------------------- main */ /* main -- a simple driver function that reads three values, which are passed to the function phone_network, which succeeds of fails. Certain combinations of values will call phone_network to fail. */ int main (void) { int i, x, y; cout << "Enter 3 integers: i, x and y: "; while ( cin >> i >> x >> y ) { /* call this to fake that variables are unitialized */ make_unitialized(); if ( phone_network(i, x, y) == 1 ) cout << "Phone network OK!\n" << endl; else cout << "Phone network crashes!\n" << endl; cout << "Enter 3 integers: i, x and y: "; } cout << "You didn't enter 3 valid integers -- program exiting." << endl; return 0; } /*------------------------------------------------------route_that_call */ /* returns 1 if system intialized OK, 0 if not */ int route_that_call(void) { if ( val1 >= 0 && val2 >= 0 ) return 1; else return 0; /* Note: you should never write the above logic as an if statement; instead write: return ( val1 >= 0 && val2 >= 0 ); This does the same thing in one line. See why? */ } /*-------------------------------------------------------phone_network */ /* phone_network -- initialize global control values, then route call. * This function takes 3 values: the first, i, is used to select * which initialization function is called. The 2nd and 3rd * values, x and y, are used to calculate values for the global * control values. (They're also used in calculating initial values * for the control values. * After doing the initialization, function route_that_call is * called to do the "real" work of the phone network system. */ int phone_network(int i, int x, int y) { const int i1=1, i2=2, val1=3, val2=5; switch (i) { case i1: init_values_x1(); break; case i2: /* for this case, intialization split between several functions */ if (x == val1) { init_values_part1A(); if (y == val2) break; /* drop out of the if and do init_values_part2() */ init_values_part1B(); } init_values_part2(); break; default: init_default(); } /* call function to make the phone call -- it returns 1 for success */ return route_that_call(); } /*-------------------------------------------------------make_unitialized */ /* For this exercise, we'll pretend negative values mean the system is not initialized properly. */ void make_unitialized(void) { val1 = val2 = -999999; } /*---------------------------------------------------------init_values_x1 */ void init_values_x1(void) { val1 = 3; val2 = 5; } /*-----------------------------------------------------init_values_part1A */ void init_values_part1A(void) { val1 = 1; } /*-------------------------------------------------------init_values_part1B */ void init_values_part1B(void) { ++val1; } /*-------------------------------------------------------init_values_part2 */ void init_values_part2(void) { val1 = 6; val2 = 7; } /*-------------------------------------------------------init_default */ void init_default(void) { val1 = 1; val2 = 1; } 2: Study the logic of the code. Answer the following questions: Question 1: For what values does the function init_values_x1() get invoked? Question 2: For what values does init_values_part1A() get called? Question 3: For what values does init_values_part1B() get called? Question 4: For what values does init_values_part2() get called? Question 5: For what values does init_default()get called? Step 3: Find values for i, x and y that make the phone network crash? Hint: Try each set of data values you identified in Step 2 to make the program perform each of the possible initializations. Together these sets of values are good test data, since each one causes the program to behavior differently. They cover all the behavior caused by the different initialization values. Question 6: What set of 3 values (i,x,y) caused the phone network to crash? Debugger Section: Now that you know what data is causing the crash, you may still not know why those data values cause the problem. In the steps that follow you will use the MSVS 2010 debugger and answer the following questions. Buildthe program with the Build Solution option and then carry out the following steps. Step 4: Put a breakpoint at the start of the function, phone_network(). Execute the program, by choosing "Debug" and then "Start Debugging". Question 7: After entering the 3 values, what is displayed when the execution of the program stops at the breakpoint you set at the line that contain the name of the function? Step 5: Type "Ctrl-F10" to resume execution. Question 8: Does the program stop at the breakpoint again? Question 9: How do you remove the breakpoint you set? Step 6: If you removed the breakpoint, put it back. Execute the program again. When you reach the breakpoint, choose "F11". This executes the program one line at a time. Execute "F11" a few times to see how "F11" works. Type "Ctrl-F10" to continue on until the breakpoint is reached again. Now that you are back at the initial breakpoint again, do the same thing but this time choose "F10" instead of "F11" to go to the next line. Do this a few times to observe what happens. Question 10: What differences in the execution of the MSVS commands, "F11" and "F10", did you observe? Step 7: Using the same breakpoint from Step 6, run the "F11" command to step "into" a function. Now enter "Shift-F11". The "Shift-F11" command terminates the execution of the function and pauses. Question 11: Where does execution stop when you enter "Shift-F11"? Step 8: Using the same breakpoint, stop the execution process by choosing "Stop Debugging" and then restart the execution process by choosing "Start Debugging". Now, in the "Watch" window underneath the code window, enter the variables "val1" and "val2" per each row under Name. Once you've done this, run the "F10"command a few times by typing "F10" repeatedly. Then type "Ctrl-F10" to run the "continue" command. Question 12: What does MSVS do with "Watch" variables? Step 9: OK, about that bug.... Set a breakpoint at the line that contains phone_network() or at the switchstatement. Enter the 3 data values for i, x, and ythat caused the phone network to crash. From the breakpoint, use the "F10" command to step through the program. Question 13: Did you observe anything that surprises you about the behavior of the program? Was the execution of any lines skipped that you thought should have been executed? Question 14: Can you explain the behavior you observed? 3865 Conway's problem Write a program in C--, "conway.cm", to read a stream of characters, package the stream into 10-character blocks, and write them as 24-character lines with the following changes: After every block an extra blank is inserted. Every adjacent pair of asterisks is replaced by an exclamation point. Asterisks are considered adjacent only if they are in the same block. Be sure to take care of all special cases, such as pairs of asterisks at the end of the block and so on. The pound sign ('#') character will be used as an end-of-data (EOD) sentinel value. Of course Conway's problem can be solved with a single sequential program. However it is difficult to be sure that you have taken care of all the special cases such as pairs of asterisks at the end of the block and so on. The problem has an elegant solution as three concurrent processes; this is the solution you will use in this assignment. One process, "ReadInput", reads the input stream and creates the blocks and passes characters through a 4 character buffer to a process "Squash". The "ReadInput" process also tacks on the extra blank at the end of every block. The process "Squash", which knows nothing about blocks, simply looks for double asterisks and passes a stream of modified characters to a process "PrintOutput" via a 7 character buffer. The "PrintOutput" process takes the characters and prints them as 24 character lines. Implement the character buffers as circular arrays of exactly the correct extent, that is, arrays that are 4 and 7 characters large respectively. (Do not make the arrays larger than the buffer size.) Use the named symbolic constants instead of numeric literals in your code. Take care that theonlyglobal variables used in your program are the semaphores you use and the two buffer arrays. Be sure your solution provides the maximum degree of concurrency possible. stub code // Define constants const int false = 0; const int true = 1; const char EOD = '#'; const int BLOCKMAX = 10; const int LINEMAX = 24; const int RDBUFSIZE = 4; const int PRBUFSIZE = 7; // Global variables char rdbuf[RDBUFSIZE]; char prbuf[PRBUFSIZE]; semaphore eRD, nRD, ePR, nPR; // ReadInput process void ReadInput() { char input; // stub code . . . cin >> input; while (input != EOD) { cin >> input; } } // end ReadInput // Squash process void Squash() { // . . . } void PrintOutput() { // . . . } // end PrintOutput int main() { // . . . cobegin { ReadInput(); Squash(); PrintOutput(); } 3866 Converting a Number to a month Name I am trying to convert numbers such as 01,02,03 to month names like Jan, Feb, Mar. I am using the formula =text(a1,"mmm") but everything returns Jan. What am I doing wrong?? Thanks for help !! 3867 Convert the MIPS assembly instruction lw $t1, -5( $t7 )into machine language. Write it in hexadecimal form. 3868 Convert the following regular expression into a FA accepting the corresponding language (AbUb)(bUaaa)b*b((a*b)*Ub)* 3869 Convert the following regular expression into a FA accepting the corresponding language (abUb)(bUaaa)b*b((a*b)*Ub)* 3870 a) Convert the following expression from infix to postfix (Reverse Polish Notation): X = (A / B) * (C + D ) A????1 ( E + F) b) Write the stack instructions to perform the computation in part a: It is important to remember that operational hierarchy dictates that: we first perform all arithmetic inside inner parentheses (if there are any), then inside outer parentheses (if there are any), then do multiplication and division operations before addition and subtraction operations. For stack operations, items are placed on the stack in the order that they appear in the expression. 3871 Convert the following decimal number to the binary equivalent. Calculate the answer to five binary places and round the result up or down as necessary. 1024.0625 Convert the following binary number to the decimal equivalent. 11011.111010 Perform the following binary addition: 11011011 10111011 00101011 +01111111 Using 8-bit arithmetic throughout, express the following decimal number in two's complement binary form: -128 3872 Convert the following c++ code into MIPS Assembly code. 1. The user is allowed to type in 10 positive integers plus an occurrence value (meaning 11 inputs). a. The 10 integers should be handled in a loop where each value input by the user is stored into memory in an array like structure. b. The input occurrence is also an integer which represents a value present (or not) in the input array. 2. Then, the program will loop through the array and find any matching with the input occurrence value. 3. When finding a matching, its index inside the array will be output and the number of occurrences found will be incremented by 1. 4. At the end of the loop, the program will print out the number of occurrences found. The C++ code for this program is as such: main() { int x[10], occur, count = 0; Cout << "Type in array numbers:" << endl; for (int i=0; i<10; i++) // reading in integers { Cin >> X[i]; } Cout << "Type in occurrence value:" << endl; Cin >> occur; // Finding and printing out occurrence indexes in the array Cout << "Occurrences indexes are:" << endl; for (int i=0; i<10; i++) { If (x[i] == occur) { Cout << i; count ++; } } Cout << "Number of occurrences found:" << endl; Cout << count; exit(0); } 3873 Convert the decimal numbers -49 and +29 to binary, using the signed 2's complement representation and enough digits to accommodate them. Then, perform the binary addition equivalent of ( +29) + ( -49), ( -29) + ( +49), and ( -29) + ( -49). Finally, convert the answers back to decimal and verify that they are correct. 3874 S->C S C | A A->xBy | yCx convert cfg to pda B->C B C | C | lambda C->x | y pda state input stack moves q0 show trace for input xyxyxyxx 3875 Convert +13.125 in a IEEE 754 single precision format. Convert -36.250 in a IEEE 754 double precision format. 3876 Context Web application based on the .NET Framework written in C# and following the MVC design pattern. Question What is the most efficient way to structure an entity layer consisting on various data inputs? Background I am developing an application for a client that requires my reading and writing data from various sources and I would like to build a single entity layer/model to abstract the various data sources so that I only need to query the unified model from code. Here is an example of the disparate sources: MS SQL Data Warehouse (about 200 tables of enterprise-wide data MS Dynamics AX web services A new MS SQL database that is specific to the application being developed MS Active Directory for authenticating users and for getting user profile and group information. In some cases, SharePoint web services. I have used ADO.NET a good bit (.edmx files and so forth) and fundamentally, I know how to do this but I am struggling a bit with a solid, clean approach. Do I create two separate .edmx files for the two SQL DBs and then write object classes for the Active Directory, SharePoint and AX stuff? Do I simply write one big model file? A whole separarate project just to make the abstraction? Many thanks! 3877 Context I've been using with a hierarchy of objects (an expression tree) a "pseudo" visitor pattern (pseudo, as in it does not use double dispatch) : public interface MyInterface { void Accept(SomeClass operationClass); } public class MyImpl : MyInterface { public void Accept(SomeClass operationClass) { operationClass.DoSomething(); operationClass.DoSomethingElse(); // ... and so on ... } } This design was, however questionnable, pretty comfortable since the number of implementations of MyInterface is significant (~50 or more) and I didn't need to add extra operations. Each implementation is unique (it's a different expression or operator), and some are composites (ie, operator nodes that will contain other operator/leaf nodes). Traversal is currently performed by calling the Accept operation on the root node of the tree, which in turns calls Accept on each of its child nodes, which in turn... and so on... But the time has come where I need to add a new operation, such as pretty printing : public class MyImpl : MyInterface { // Property does not come from MyInterface public string SomeProperty { get; set; } public void Accept(SomeClass operationClass) { operationClass.DoSomething(); operationClass.DoSomethingElse(); // ... and so on ... } public void Accept(SomePrettyPrinter printer) { printer.PrettyPrint(this.SomeProperty); } } I basically see two options : Keep the same design, adding a new method for my operation to each derived class, at the expense of maintainibility (not an option, IMHO) Use the "true" Visitor pattern, at the expense of extensibility (not an option, as I expect to have more implementations coming along the way...), with about 50+ overloads of the Visit method, each one matching a specific implementation ? Question Would you recommand using the Visitor pattern ? Is there any other pattern that could help solve this issue ? 3878 Context: I'm an enterprise developer in an all-MS shop. Can anyone recommend a good way of objectively measuring maintainability of a piece of code or an application? Why maintainability: I'm tired of "quality" metrics in my group revolving only around number of bugs and code coverage. Both metrics are easy to game, especially when you're not measuring maintainability. Shortsightedness and deadlines result in huge amounts of technical debt that never really get addressed. Why the ability to measure objectively: I work in a big enterprise group. If you can't objectively measure it, you can't hold people accountable for it or make them get better at it. Subjective measurements either don't happen or don't happen consistently. I'm looking at VS2010 code metrics, but I'm wondering if anyone has any other recommendations. 3879 In a container of candies there are 5 colors randomly placed: red, yellow, green blue and white. Assume that the container holds a maximum of 15 candies. Use a stack program to simulate randomly placing some (between 5 and 12 candies) initially into the container (stack). Now once that is done have the "user" choose a color and using ONLY stack functions remove all candies of that color. All candies in the container (stack) that are NOT of that color are returned to the candy in the same order they were in prior to the color removal. Actually loop the program twice to simulate "filling" and "removing" two sets of candies. Don't assume that there are necessarily all colors of candy all the time...so for example someone might want all red candies but there might not be any red candies at that time. Fill the container (or partially fill) only ONCE for each run. Here is an example: Suppose you place candies in this order: R R Y B G R B Y B G Y R B W B G Then the stack would look like this: R R Y B G R B Y B G Y R B W B G (top of stack) If you asked to remove all green the resulting stack would be: R R Y B R B Y B Y R B W B(top of stack), CAN I EXPECT PROGRAM IN C++?? 3880 construct a truth table foe the following: yz + z(xy)A????1 x(yA????1 + z) + xyz (x + y) (xA????1 +y) xyz + x(yz)A????1 + xA????1 (y+z) + (xyz)A????1 (x + yA????1)(xA????1+zA????1)(yA????1+zA????1) using DeMorganA????1s law, write an expression for the complement of F if F(x,y,z) =xyA????1(x+z) using DeMorganA????1s law, write an expression for the complement of F if F(x,y,z) = (xA????1 + y) (x + z )( yA????1+z)A????1 using DeMorganA????1s law, write an expression for the complement of F if F(x,y,z) = xzA????1(xy + xz) + xyA????1 (wz + y) 3881 Construct a refernce string for which LRU is a really poor page replacement algorithm and its exact opposite - Most Recently Used (MRU) - would be the desirable page replacement policy. Convince yourself that the OPT we presented (which always picks as its victim the page to be referenced furthest into the future) continues to do well even for this reference string 3882 Construct a refernce string for which LRU is a really poor page replacement algorithm and its exact opposite - Most Recently Used (MRU) - would be the desirable page replacement policy. Convince yourself that the OPT we presented (which always picks as its victim the page to be referenced furthest into the future) continues to do well even for this reference string 3883 Construct a refernce string for which LRU is a really poor page replacement algorithm and its exact opposite - Most Recently Used (MRU) - would be the desirable page replacement policy. Convince yourself that the OPT we presented (which always picks as its victim the page to be referenced furthest into the future) continues to do well even for this reference string. 3884 Construct a query that lists book titles and quantity sold for the ten books who have the most total_sales. Database Below: CREATE TABLE Authors (au_id VARCHAR(11) not null, au_lname VARCHAR(40) not null, au_fname VARCHAR(20) not null, phone char(12) not null, address VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, country VARCHAR(12) null, postalcode char(10) null, primary key (au_id)) GO CREATE TABLE Publishers (pub_id char(4) not null, pub_name VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, primary key (pub_id) ) GO CREATE TABLE Stores (stor_id char(4) not null, stor_name VARCHAR(40) not null, stor_address VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, country VARCHAR(12) null, postalcode char(10) null, payterms VARCHAR(12) null, primary key (stor_id)) GO CREATE TABLE Titles (title_id VARCHAR(6) not null, title VARCHAR(80) not null, type VARCHAR(12) not null, pub_id char(4) null, price DECIMAL(12,2) null, advance DECIMAL(12,2) null, total_sales DECIMAL(38) null, notes VARCHAR(200) null, pubdate date not null, contract DECIMAL(1) not null, primary key (title_id), foreign key (pub_id) references publishers ) GO CREATE TABLE Sales (stor_id char(4) not null, ord_num VARCHAR(20) not null, sdate date not null, primary key (stor_id, ord_num), foreign key (stor_id) references stores) GO CREATE TABLE SalesDetail (stor_id char(4) not null, ord_num VARCHAR(20), title_id VARCHAR(6) not null, qty DECIMAL(20) not null, discount DECIMAL not null, primary key (stor_id, ord_num, title_id), foreign key (stor_id, ord_num) references sales, foreign key (title_id) references titles) GO CREATE TABLE TitleAuthor (au_id VARCHAR(11) not null, title_id VARCHAR(6) not null, au_ord DECIMAL(2) null, royaltyper DECIMAL(38) null, primary key (au_id, title_id), foreign key (au_id) references authors, foreign key (title_id) references titles) GO INSERT INTO Authors select * from [$DM_Publisher].dbo.authors GO INSERT INTO Publishers select * from [$DM_Publisher].dbo.publishers GO INSERT INTO Stores select * from [$DM_Publisher].dbo.stores GO INSERT INTO Titles select * from [$DM_Publisher].dbo.titles GO INSERT INTO Sales select * from [$DM_Publisher].dbo.sales GO INSERT INTO SalesDetail select * from [$DM_Publisher].dbo.salesdetail GO INSERT INTO TitleAuthor select * from [$DM_Publisher].dbo.titleauthor GO 3885 Construct a query that lists authorsA????1 last names, the number of books they have authored (name the field TitleCount), and the average book price (name the field AvgPrice) for the books priced between $10 and $20 inclusive. Will rate asap! 3886 Construct a query that inserts a new book into the Titles table: Title_ID = A????1PC1205A????1, Title = A????1Adding Records to a Database TableA????1, Type = A????1popular_compA????1, Pub_ID = 1389, Price = 13.99, Advance = 7500, Total_sales = 0, Notes = A????1Detailed instructions for adding records to a database table, particularly useful for an exam.A????1, Pubdate = 10/15/2014, Contract = 1 Database below: CREATE TABLE Authors (au_id VARCHAR(11) not null, au_lname VARCHAR(40) not null, au_fname VARCHAR(20) not null, phone char(12) not null, address VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, country VARCHAR(12) null, postalcode char(10) null, primary key (au_id)) GO CREATE TABLE Publishers (pub_id char(4) not null, pub_name VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, primary key (pub_id) ) GO CREATE TABLE Stores (stor_id char(4) not null, stor_name VARCHAR(40) not null, stor_address VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, country VARCHAR(12) null, postalcode char(10) null, payterms VARCHAR(12) null, primary key (stor_id)) GO CREATE TABLE Titles (title_id VARCHAR(6) not null, title VARCHAR(80) not null, type VARCHAR(12) not null, pub_id char(4) null, price DECIMAL(12,2) null, advance DECIMAL(12,2) null, total_sales DECIMAL(38) null, notes VARCHAR(200) null, pubdate date not null, contract DECIMAL(1) not null, primary key (title_id), foreign key (pub_id) references publishers ) GO CREATE TABLE Sales (stor_id char(4) not null, ord_num VARCHAR(20) not null, sdate date not null, primary key (stor_id, ord_num), foreign key (stor_id) references stores) GO CREATE TABLE SalesDetail (stor_id char(4) not null, ord_num VARCHAR(20), title_id VARCHAR(6) not null, qty DECIMAL(20) not null, discount DECIMAL not null, primary key (stor_id, ord_num, title_id), foreign key (stor_id, ord_num) references sales, foreign key (title_id) references titles) GO CREATE TABLE TitleAuthor (au_id VARCHAR(11) not null, title_id VARCHAR(6) not null, au_ord DECIMAL(2) null, royaltyper DECIMAL(38) null, primary key (au_id, title_id), foreign key (au_id) references authors, foreign key (title_id) references titles) GO INSERT INTO Authors select * from [$DM_Publisher].dbo.authors GO INSERT INTO Publishers select * from [$DM_Publisher].dbo.publishers GO INSERT INTO Stores select * from [$DM_Publisher].dbo.stores GO INSERT INTO Titles select * from [$DM_Publisher].dbo.titles GO INSERT INTO Sales select * from [$DM_Publisher].dbo.sales GO INSERT INTO SalesDetail select * from [$DM_Publisher].dbo.salesdetail GO INSERT INTO TitleAuthor select * from [$DM_Publisher].dbo.titleauthor GO 3887 Construct a grammar and a push down automaton for: 1.) {a^m b^n : m<=n<=2m} 2.) {w (is a string of) {a,b}* : w = w^R} (i.e. (ab)^R = ba) 3.) {w (is a string of) {a,b}* : w has twice as many b's as a's} 3888 Construct a dpda and npda pushdown automata to accept L={ w <-{x,y}* | same number of x and y } using the format state input stack moves input stack moves q0 state q0 and then trace dpda (q0, xyxyyx, z0) (q0, xxyx, z0) 3889 Construct a context free grammar (CFG) for the following language. The alphabet of the language is {a, b, c}. {w | w does not contain the substring "ab", and w does not contain the substring "bc"} A detailed explanation as to how you got the solution would be greatly helpful. Thanks. 3890 Constraint Satisfaction Problem We plan to plant the flowers on April in the given land in the figure. The bulbs of the following flowers are ready to plant: daffodil, lily, tulip. Since each sub-land belongs to a different owner, any adjacent sub-land should be distinguished by planting a different bulb. [10] Formulate the given problem. [5] Draw its constraint graph. [15] Starting from the current partial assignment {A=daffodil, C = lily}, decide a bulb for each sub-land by HAND using the following strategy: backtracking search with MRV heuristic, the degree heuristic, least-constraining value heuristic, forward checking, constraint propagation (AC-3). At each step, you have to clearly specify and explain what strategy is applied to improve the efficiency. 3891 const int ROWS = 4; const int COLS = 3; double findMax(double a[ROWS][COLS]); Implement a function called findMax that determines the maximum value in a 2-dimensional array. The declaration of the function is given above as well as the variables ROWS and COLS. Provide test code that defines an array of size ROWS by COLS and that uses an assert statement to check that the function returns the correct value. Include test code with assertions. 3892 A consignment shop accepts a product for sale and sets an initial price. each month that the item doesnt sell, the price is reduced by 20 percent. When the item sells, the item's owner receives 60 percent of the sale price, and the shop gets 40 percent. Draw a flow chart or write pseudocode to represent the logic of a program that aloows the user to enter an original product price. The output is the sale price, the owner's cut, and the shop's cut each month for the first three months the item is on sale. This is a programming logic and design question. your help is greatly appreciated. 3893 Consider train timetable data, where each service (or "run") has a data structure as such: public class TimeTable { public int Id {get;set;} public List Runs {get;set;} } public class Run { public List Stops {get;set;} public int RunId {get;set;} } public class Stop { public int StationId {get;set;} public TimeSpan? StopTime {get;set;} public bool IsStop {get;set;} } We have a list of runs that operate against a particular line (the TimeTable class). Further, whilst we have a set collection of stations that are on a line, not all runs stop at all stations (that is, IsStop would be false, and StopTime would be null). Now, imagine that we have received the initial timetable, processed it, and loaded it into the above data structure. Once the initial load is complete, it is persisted into a database - the data structure is used only to load the timetable from its source and to persist it to the database. We are now receiving an updated timetable. The updated timetable may or may not have any changes to it - we don't know and are not told whether any changes are present. What I would like to do is perform a compare for each run in an efficient manner. I don't want to simply replace each run. Instead, I want to have a background task that runs periodically that downloads the updated timetable dataset, and then compares it to the current timetable. If differences are found, some action (not relevant to the question) will take place. I was initially thinking of some sort of checksum process, where I could, for example, load both runs (that is, the one from the new timetable received and the one that has been persisted to the database) into the data structure and then add up all the hour components of the StopTime, and all the minute components of the StopTime and compare the results (i.e. both the sum of Hours and sum of Minutes would be the same, and differences introduced if a stop time is changed, a stop deleted or a new stop added). Would that be a valid way to check for differences, or is there a better way to approach this problem? I can see a problem that, for example, one stop is changed to be 2 minutes earlier, and another changed to be 2 minutes later would have a net zero change. Or am I over thinking this, and would it just be simpler to brute check all stops to ensure that The updated run stops at the same stations; and Each stop is at the same time 3894 Consider three different processors P1, P2, and P3, executing the same instruction set. P1 has a 2 GHz clock rate and a CPI of 1.5. P2 has 2.0 GHz clock rate and a CPI of 1.0. P3 has a 4 GHz clock rate and a CPI of 2.5. Which processor has the highest performance? Please be sure to show and explain the detailed steps of how you arrived at your answer in your submission. I still don't have my text book from the mail yet some Im stuck 3895 Consider the system x + 2y + 5z = 5 .5x + y ? .25z = 8 4x + y + z = 16 The Jacobi and Gauss Seidel methods wonA????1t work. Do 5 iterates of each, and calculate the distances between the corresponding outputs. USE MATLAB SCRIPT 3896 Consider a swapping system in which memory consists of the holes as shown in Fig. 1. Note that A to I represent processes in memory, and H1 to H8 are eight holes. Process P1, P2, and P3 are generated sequentially. Which hole is taken for the process P1, P2, and P3, respectively, when the first fit algorithm is used? Put your answer in Table 2. (i) P1 requests 8 KB. (ii) P2 requests 10KB. (iii) P3 requests 9KB. (iv) P4 requests 5KB. Now repeat the question for best fit, worst fit, and next fit algorithm. 3897 Consider the space-time data cube w(x, y, t) given in file datacube.mat, which loosely represents the displacement time history of a vibrating two-dimensional solid containing some localized spikes in the response. Visualize the data cube by performing an animation of the time frames. For each time frame, use cubic splines to interpolate the data and obtain a higher resolution rendering of the response at the selected time instant. You can use the Matlab built-in interpolation functions to spline the data. Try to conduct the most complete and detailed analysis you can. I have no idea how to tackle this problem. Any tips how to solve the problem? 3898 Consider a segmented paging system with the segment table and the page table within a segment stored in memory. First part of the address is segment number, second part is the page number within a segment and the third part is the offset within a page. a) If a memory reference takes 200 nano seconds, how long does a segmented page memory reference take? b) If we add Translation Lookaside Buffer (TLB), and 80% of all memory references are found in the TLB, what is the effective memory reference time in each case? (Assume that finding a segmented page-table entry in the TLBs takes zero time, if the entry is there. Otherwise memory tables must be searched to determine the physical address. ) 3899 Consider a segmented paging system with the segment table and the page table within a segment stored in memory. First part of the address is segment number, second part is the page number within a segment and the third part is the offset within a page. a) If a memory reference takes 200 nano seconds, how long does a segmented page memory reference take? b) If we add Translation Lookaside Buffer (TLB), and 80% of all memory references are found in the TLB, what is the effective memory reference time in each case? (Assume that finding a segmented page-table entry in the TLBs takes zero time, if the entry is there. Otherwise memory tables must be searched to determine the physical address. ) 3900 Consider the robot example that was discussed in the class. Simulate a fuzzy controller for the robot using the proposed linguistic variables and values. You should submit a report that includes your design, comments about your simulation, source program, and output of simulation. Your output should include a graph (which represents movement of the robot) for each of the following set of inputs: X= -10 and a = 81 X=9 and a = 0 X = -8 and a =220 a = alpha Thanks 3901 Consider the robot example that was discussed in the class. Simulate a fuzzy controller for the robot using the proposed linguistic variables and values. You should submit a report that includes your design, comments about your simulation, source program, and output of simulation. Your output should include a graph (which represents movement of the robot) for each of the following set of inputs: X= -10 and a = 81 X=9 and a = 0 X = -8 and a =220 a= alpha Thanks 3902 Convert +13.125 in a IEEE 754 single precision format. Convert -36.250 in a IEEE 754 double precision format. 3903 Context Web application based on the .NET Framework written in C# and following the MVC design pattern. Question What is the most efficient way to structure an entity layer consisting on various data inputs? Background I am developing an application for a client that requires my reading and writing data from various sources and I would like to build a single entity layer/model to abstract the various data sources so that I only need to query the unified model from code. Here is an example of the disparate sources: MS SQL Data Warehouse (about 200 tables of enterprise-wide data MS Dynamics AX web services A new MS SQL database that is specific to the application being developed MS Active Directory for authenticating users and for getting user profile and group information. In some cases, SharePoint web services. I have used ADO.NET a good bit (.edmx files and so forth) and fundamentally, I know how to do this but I am struggling a bit with a solid, clean approach. Do I create two separate .edmx files for the two SQL DBs and then write object classes for the Active Directory, SharePoint and AX stuff? Do I simply write one big model file? A whole separarate project just to make the abstraction? Many thanks! 3904 Context I've been using with a hierarchy of objects (an expression tree) a "pseudo" visitor pattern (pseudo, as in it does not use double dispatch) : public interface MyInterface { void Accept(SomeClass operationClass); } public class MyImpl : MyInterface { public void Accept(SomeClass operationClass) { operationClass.DoSomething(); operationClass.DoSomethingElse(); // ... and so on ... } } This design was, however questionnable, pretty comfortable since the number of implementations of MyInterface is significant (~50 or more) and I didn't need to add extra operations. Each implementation is unique (it's a different expression or operator), and some are composites (ie, operator nodes that will contain other operator/leaf nodes). Traversal is currently performed by calling the Accept operation on the root node of the tree, which in turns calls Accept on each of its child nodes, which in turn... and so on... But the time has come where I need to add a new operation, such as pretty printing : public class MyImpl : MyInterface { // Property does not come from MyInterface public string SomeProperty { get; set; } public void Accept(SomeClass operationClass) { operationClass.DoSomething(); operationClass.DoSomethingElse(); // ... and so on ... } public void Accept(SomePrettyPrinter printer) { printer.PrettyPrint(this.SomeProperty); } } I basically see two options : Keep the same design, adding a new method for my operation to each derived class, at the expense of maintainibility (not an option, IMHO) Use the "true" Visitor pattern, at the expense of extensibility (not an option, as I expect to have more implementations coming along the way...), with about 50+ overloads of the Visit method, each one matching a specific implementation ? Question Would you recommand using the Visitor pattern ? Is there any other pattern that could help solve this issue ? 3905 Context: I'm an enterprise developer in an all-MS shop. Can anyone recommend a good way of objectively measuring maintainability of a piece of code or an application? Why maintainability: I'm tired of "quality" metrics in my group revolving only around number of bugs and code coverage. Both metrics are easy to game, especially when you're not measuring maintainability. Shortsightedness and deadlines result in huge amounts of technical debt that never really get addressed. Why the ability to measure objectively: I work in a big enterprise group. If you can't objectively measure it, you can't hold people accountable for it or make them get better at it. Subjective measurements either don't happen or don't happen consistently. I'm looking at VS2010 code metrics, but I'm wondering if anyone has any other recommendations. 3906 In a container of candies there are 5 colors randomly placed: red, yellow, green blue and white. Assume that the container holds a maximum of 15 candies. Use a stack program to simulate randomly placing some (between 5 and 12 candies) initially into the container (stack). Now once that is done have the "user" choose a color and using ONLY stack functions remove all candies of that color. All candies in the container (stack) that are NOT of that color are returned to the candy in the same order they were in prior to the color removal. Actually loop the program twice to simulate "filling" and "removing" two sets of candies. Don't assume that there are necessarily all colors of candy all the time...so for example someone might want all red candies but there might not be any red candies at that time. Fill the container (or partially fill) only ONCE for each run. Here is an example: Suppose you place candies in this order: R R Y B G R B Y B G Y R B W B G Then the stack would look like this: R R Y B G R B Y B G Y R B W B G (top of stack) If you asked to remove all green the resulting stack would be: R R Y B R B Y B Y R B W B(top of stack), CAN I EXPECT PROGRAM IN C++?? 3907 construct a truth table foe the following: yz + z(xy)A????1 x(yA????1 + z) + xyz (x + y) (xA????1 +y) xyz + x(yz)A????1 + xA????1 (y+z) + (xyz)A????1 (x + yA????1)(xA????1+zA????1)(yA????1+zA????1) using DeMorganA????1s law, write an expression for the complement of F if F(x,y,z) =xyA????1(x+z) using DeMorganA????1s law, write an expression for the complement of F if F(x,y,z) = (xA????1 + y) (x + z )( yA????1+z)A????1 using DeMorganA????1s law, write an expression for the complement of F if F(x,y,z) = xzA????1(xy + xz) + xyA????1 (wz + y) 3908 Construct a refernce string for which LRU is a really poor page replacement algorithm and its exact opposite - Most Recently Used (MRU) - would be the desirable page replacement policy. Convince yourself that the OPT we presented (which always picks as its victim the page to be referenced furthest into the future) continues to do well even for this reference string 3909 Construct a refernce string for which LRU is a really poor page replacement algorithm and its exact opposite - Most Recently Used (MRU) - would be the desirable page replacement policy. Convince yourself that the OPT we presented (which always picks as its victim the page to be referenced furthest into the future) continues to do well even for this reference string 3910 Construct a refernce string for which LRU is a really poor page replacement algorithm and its exact opposite - Most Recently Used (MRU) - would be the desirable page replacement policy. Convince yourself that the OPT we presented (which always picks as its victim the page to be referenced furthest into the future) continues to do well even for this reference string. 3911 Construct a query that lists book titles and quantity sold for the ten books who have the most total_sales. Database Below: CREATE TABLE Authors (au_id VARCHAR(11) not null, au_lname VARCHAR(40) not null, au_fname VARCHAR(20) not null, phone char(12) not null, address VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, country VARCHAR(12) null, postalcode char(10) null, primary key (au_id)) GO CREATE TABLE Publishers (pub_id char(4) not null, pub_name VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, primary key (pub_id) ) GO CREATE TABLE Stores (stor_id char(4) not null, stor_name VARCHAR(40) not null, stor_address VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, country VARCHAR(12) null, postalcode char(10) null, payterms VARCHAR(12) null, primary key (stor_id)) GO CREATE TABLE Titles (title_id VARCHAR(6) not null, title VARCHAR(80) not null, type VARCHAR(12) not null, pub_id char(4) null, price DECIMAL(12,2) null, advance DECIMAL(12,2) null, total_sales DECIMAL(38) null, notes VARCHAR(200) null, pubdate date not null, contract DECIMAL(1) not null, primary key (title_id), foreign key (pub_id) references publishers ) GO CREATE TABLE Sales (stor_id char(4) not null, ord_num VARCHAR(20) not null, sdate date not null, primary key (stor_id, ord_num), foreign key (stor_id) references stores) GO CREATE TABLE SalesDetail (stor_id char(4) not null, ord_num VARCHAR(20), title_id VARCHAR(6) not null, qty DECIMAL(20) not null, discount DECIMAL not null, primary key (stor_id, ord_num, title_id), foreign key (stor_id, ord_num) references sales, foreign key (title_id) references titles) GO CREATE TABLE TitleAuthor (au_id VARCHAR(11) not null, title_id VARCHAR(6) not null, au_ord DECIMAL(2) null, royaltyper DECIMAL(38) null, primary key (au_id, title_id), foreign key (au_id) references authors, foreign key (title_id) references titles) GO INSERT INTO Authors select * from [$DM_Publisher].dbo.authors GO INSERT INTO Publishers select * from [$DM_Publisher].dbo.publishers GO INSERT INTO Stores select * from [$DM_Publisher].dbo.stores GO INSERT INTO Titles select * from [$DM_Publisher].dbo.titles GO INSERT INTO Sales select * from [$DM_Publisher].dbo.sales GO INSERT INTO SalesDetail select * from [$DM_Publisher].dbo.salesdetail GO INSERT INTO TitleAuthor select * from [$DM_Publisher].dbo.titleauthor GO 3912 Construct a query that lists authorsA????1 last names, the number of books they have authored (name the field TitleCount), and the average book price (name the field AvgPrice) for the books priced between $10 and $20 inclusive. Will rate asap! 3913 Construct a query that inserts a new book into the Titles table: Title_ID = A????1PC1205A????1, Title = A????1Adding Records to a Database TableA????1, Type = A????1popular_compA????1, Pub_ID = 1389, Price = 13.99, Advance = 7500, Total_sales = 0, Notes = A????1Detailed instructions for adding records to a database table, particularly useful for an exam.A????1, Pubdate = 10/15/2014, Contract = 1 Database below: CREATE TABLE Authors (au_id VARCHAR(11) not null, au_lname VARCHAR(40) not null, au_fname VARCHAR(20) not null, phone char(12) not null, address VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, country VARCHAR(12) null, postalcode char(10) null, primary key (au_id)) GO CREATE TABLE Publishers (pub_id char(4) not null, pub_name VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, primary key (pub_id) ) GO CREATE TABLE Stores (stor_id char(4) not null, stor_name VARCHAR(40) not null, stor_address VARCHAR(40) null, city VARCHAR(20) null, state char(2) null, country VARCHAR(12) null, postalcode char(10) null, payterms VARCHAR(12) null, primary key (stor_id)) GO CREATE TABLE Titles (title_id VARCHAR(6) not null, title VARCHAR(80) not null, type VARCHAR(12) not null, pub_id char(4) null, price DECIMAL(12,2) null, advance DECIMAL(12,2) null, total_sales DECIMAL(38) null, notes VARCHAR(200) null, pubdate date not null, contract DECIMAL(1) not null, primary key (title_id), foreign key (pub_id) references publishers ) GO CREATE TABLE Sales (stor_id char(4) not null, ord_num VARCHAR(20) not null, sdate date not null, primary key (stor_id, ord_num), foreign key (stor_id) references stores) GO CREATE TABLE SalesDetail (stor_id char(4) not null, ord_num VARCHAR(20), title_id VARCHAR(6) not null, qty DECIMAL(20) not null, discount DECIMAL not null, primary key (stor_id, ord_num, title_id), foreign key (stor_id, ord_num) references sales, foreign key (title_id) references titles) GO CREATE TABLE TitleAuthor (au_id VARCHAR(11) not null, title_id VARCHAR(6) not null, au_ord DECIMAL(2) null, royaltyper DECIMAL(38) null, primary key (au_id, title_id), foreign key (au_id) references authors, foreign key (title_id) references titles) GO INSERT INTO Authors select * from [$DM_Publisher].dbo.authors GO INSERT INTO Publishers select * from [$DM_Publisher].dbo.publishers GO INSERT INTO Stores select * from [$DM_Publisher].dbo.stores GO INSERT INTO Titles select * from [$DM_Publisher].dbo.titles GO INSERT INTO Sales select * from [$DM_Publisher].dbo.sales GO INSERT INTO SalesDetail select * from [$DM_Publisher].dbo.salesdetail GO INSERT INTO TitleAuthor select * from [$DM_Publisher].dbo.titleauthor GO 3914 Construct a grammar and a push down automaton for: 1.) {a^m b^n : m<=n<=2m} 2.) {w (is a string of) {a,b}* : w = w^R} (i.e. (ab)^R = ba) 3.) {w (is a string of) {a,b}* : w has twice as many b's as a's} 3915 Construct a dpda and npda pushdown automata to accept L={ w <-{x,y}* | same number of x and y } using the format state input stack moves input stack moves q0 state q0 and then trace dpda (q0, xyxyyx, z0) (q0, xxyx, z0) 3916 Construct a context free grammar (CFG) for the following language. The alphabet of the language is {a, b, c}. {w | w does not contain the substring "ab", and w does not contain the substring "bc"} A detailed explanation as to how you got the solution would be greatly helpful. Thanks. 3917 Constraint Satisfaction Problem We plan to plant the flowers on April in the given land in the figure. The bulbs of the following flowers are ready to plant: daffodil, lily, tulip. Since each sub-land belongs to a different owner, any adjacent sub-land should be distinguished by planting a different bulb. [10] Formulate the given problem. [5] Draw its constraint graph. [15] Starting from the current partial assignment {A=daffodil, C = lily}, decide a bulb for each sub-land by HAND using the following strategy: backtracking search with MRV heuristic, the degree heuristic, least-constraining value heuristic, forward checking, constraint propagation (AC-3). At each step, you have to clearly specify and explain what strategy is applied to improve the efficiency. 3918 const int ROWS = 4; const int COLS = 3; double findMax(double a[ROWS][COLS]); Implement a function called findMax that determines the maximum value in a 2-dimensional array. The declaration of the function is given above as well as the variables ROWS and COLS. Provide test code that defines an array of size ROWS by COLS and that uses an assert statement to check that the function returns the correct value. Include test code with assertions. 3919 A consignment shop accepts a product for sale and sets an initial price. each month that the item doesnt sell, the price is reduced by 20 percent. When the item sells, the item's owner receives 60 percent of the sale price, and the shop gets 40 percent. Draw a flow chart or write pseudocode to represent the logic of a program that aloows the user to enter an original product price. The output is the sale price, the owner's cut, and the shop's cut each month for the first three months the item is on sale. This is a programming logic and design question. your help is greatly appreciated. 3920 Consider train timetable data, where each service (or "run") has a data structure as such: public class TimeTable { public int Id {get;set;} public List Runs {get;set;} } public class Run { public List Stops {get;set;} public int RunId {get;set;} } public class Stop { public int StationId {get;set;} public TimeSpan? StopTime {get;set;} public bool IsStop {get;set;} } We have a list of runs that operate against a particular line (the TimeTable class). Further, whilst we have a set collection of stations that are on a line, not all runs stop at all stations (that is, IsStop would be false, and StopTime would be null). Now, imagine that we have received the initial timetable, processed it, and loaded it into the above data structure. Once the initial load is complete, it is persisted into a database - the data structure is used only to load the timetable from its source and to persist it to the database. We are now receiving an updated timetable. The updated timetable may or may not have any changes to it - we don't know and are not told whether any changes are present. What I would like to do is perform a compare for each run in an efficient manner. I don't want to simply replace each run. Instead, I want to have a background task that runs periodically that downloads the updated timetable dataset, and then compares it to the current timetable. If differences are found, some action (not relevant to the question) will take place. I was initially thinking of some sort of checksum process, where I could, for example, load both runs (that is, the one from the new timetable received and the one that has been persisted to the database) into the data structure and then add up all the hour components of the StopTime, and all the minute components of the StopTime and compare the results (i.e. both the sum of Hours and sum of Minutes would be the same, and differences introduced if a stop time is changed, a stop deleted or a new stop added). Would that be a valid way to check for differences, or is there a better way to approach this problem? I can see a problem that, for example, one stop is changed to be 2 minutes earlier, and another changed to be 2 minutes later would have a net zero change. Or am I over thinking this, and would it just be simpler to brute check all stops to ensure that The updated run stops at the same stations; and Each stop is at the same time 3921 Consider three different processors P1, P2, and P3, executing the same instruction set. P1 has a 2 GHz clock rate and a CPI of 1.5. P2 has 2.0 GHz clock rate and a CPI of 1.0. P3 has a 4 GHz clock rate and a CPI of 2.5. Which processor has the highest performance? Please be sure to show and explain the detailed steps of how you arrived at your answer in your submission. I still don't have my text book from the mail yet some Im stuck 3922 Consider the system x + 2y + 5z = 5 .5x + y ? .25z = 8 4x + y + z = 16 The Jacobi and Gauss Seidel methods wonA????1t work. Do 5 iterates of each, and calculate the distances between the corresponding outputs. USE MATLAB SCRIPT 3923 Consider a swapping system in which memory consists of the holes as shown in Fig. 1. Note that A to I represent processes in memory, and H1 to H8 are eight holes. Process P1, P2, and P3 are generated sequentially. Which hole is taken for the process P1, P2, and P3, respectively, when the first fit algorithm is used? Put your answer in Table 2. (i) P1 requests 8 KB. (ii) P2 requests 10KB. (iii) P3 requests 9KB. (iv) P4 requests 5KB. Now repeat the question for best fit, worst fit, and next fit algorithm. 3924 Consider the space-time data cube w(x, y, t) given in file datacube.mat, which loosely represents the displacement time history of a vibrating two-dimensional solid containing some localized spikes in the response. Visualize the data cube by performing an animation of the time frames. For each time frame, use cubic splines to interpolate the data and obtain a higher resolution rendering of the response at the selected time instant. You can use the Matlab built-in interpolation functions to spline the data. Try to conduct the most complete and detailed analysis you can. I have no idea how to tackle this problem. Any tips how to solve the problem? 3925 Consider a segmented paging system with the segment table and the page table within a segment stored in memory. First part of the address is segment number, second part is the page number within a segment and the third part is the offset within a page. a) If a memory reference takes 200 nano seconds, how long does a segmented page memory reference take? b) If we add Translation Lookaside Buffer (TLB), and 80% of all memory references are found in the TLB, what is the effective memory reference time in each case? (Assume that finding a segmented page-table entry in the TLBs takes zero time, if the entry is there. Otherwise memory tables must be searched to determine the physical address. ) 3926 Consider the robot example that was discussed in the class. Simulate a fuzzy controller for the robot using the proposed linguistic variables and values. You should submit a report that includes your design, comments about your simulation, source program, and output of simulation. Your output should include a graph (which represents movement of the robot) for each of the following set of inputs: X= -10 and a = 81 X=9 and a = 0 X = -8 and a =220 a = alpha Thanks 3927 Consider the robot example that was discussed in the class. Simulate a fuzzy controller for the robot using the proposed linguistic variables and values. You should submit a report that includes your design, comments about your simulation, source program, and output of simulation. Your output should include a graph (which represents movement of the robot) for each of the following set of inputs: X= -10 and a = 81 X=9 and a = 0 X = -8 and a =220 a= alpha Thanks 3928 Consider this: public MyClass { private Resource _myResource; public Resource MyResource { get { if(_myResource == null) { _myResource = new Resource(); } return _myResource; } } public void UseResource() { MyResource.DoSomething(); } } Is this a recognised pattern, or possibly an anti-pattern? I've never seen it suggested in any books, but it does come up time and time again in code I see. I think the logic of this is that _myResource is instantiated 'just in time'. To me, it seems a bit smelly. UserResource() is accessing a public property from within the class, and the resource can never really be accessed through the private member - if someone did, _myResource could be null. Maybe performance reasons may sometimes necessitate, but I would generally favour instantiating in the constructor, or just having an instance of Resource local to the method. So is this an accepted pattern, or should it be avoided? 3929 Consider these methods: public List GetAllEmployees() { using (Entities entities = new Entities()) { return entities.Employees.ToList(); } } public List GetAllJobs() { using (Entities entities = new Entities()) { return entities.Jobs.ToList(); } } public List GetAllTasksOfTheJob(Job job) { using (Entities entities = new Entities()) { return entities.Tasks.Where(t => t.JobId == job.Id).ToList(); } } Using block is the same and has been repeated 3 times here (of course, more than 100 times in the real application). How is it possible to implement DRY (Don't Repeat Yourself) principal for using block? Is it considered a breach of DRY principal at all? Update: I'm not talking about what has been implemented inside the using block. What I actually mean here, is the using (Entities entities = new Entities()). This line is repeated 100 times or more. 3930 Consider memory storage of a 32-bit word stored at memory word 42 in a byte-addressable memory. 1.A.) What is the byte address of memory word 42? 1.B.) What are the byte addresses that memory word 42 spans? 1.C.) Draw the number 0xFF223344 stored at word 42 in big-endian computer. 1.D.) Draw the number 0xFF223344 stored at word 42 in little-endian computer. 3931 Consider the mathematical statement A????1For every pair of sets ?? and ??, there is an element ?? appearing in ?? ? ?? if and only if the two sets ?? and ?? are di?erent.A????1 Recall that a biconditional statement like this stands for two di?erent implications. (a) What are the two implications in this case? (b) For each of the implications, decide whether it is true or not; explain. (c) What does that mean about the truth of the original statement? 3932 Consider the mathematical statement A????1For every integer x, if x = ?207 then x^2 + 1 = ?2.A????1 (Keep in mind that the statement concerns all integers, and there are none of these for which x^2 = 207.) Is this true or false? Explain why 3933 Consider the mathematical statement A????1For every integer x, if 6|x then 3|x.A????1 Is this true or false? Explain why. 3934 Consider the mathematical statement A????1For every integer ??, if?? = ?207 then ?? + 1 = ?2.A????1 (Keep in mind that the statement concerns all integers, 2 2 and there are none of these for which ?? = 207.) Is this true or false? Explain why. 3935 2 Consider the mathematical statement A????1 For every integer ??, if ?? =?207 then ?? + 1 = ?2.A????1 (Keep in mind that the statement concerns all 2 integers,and there are none of these for which ?? = 207.) Is this true or false? Explain why. 3936 Consider the language L = {a^n : n is not a perfect square} (a) Show that this language is not regular by applying the pumping lemma directly. (b) Then show the same thing by using the closure properties of regular languages. 3937 consider the language L = { a^m b^n : m>2n}, give context free grammar and Nondeteministc pUSH DOWN AUTOMATON 3938 Consider the interface between A????1A????1 a computer and a printer. For a typical printout it is clearly impractical to send output data to the printer one byte or one word at a time (especially over a network!). In stead data to be printed is stored in a buffer at a known location in memory and transferred in blacks to memory in the printerAc€?cs memory. The printerAc€?cs memory is not always sufficient to hold the entire printout data at delays. Devise and describe, in as much detail as you can, an interrupt/DMA scheme that will assure that all documents will be successfully printed. 3939 Consider the interface between a computer and a printer. For a typical printout it is clearly impractical to send output data to the printer one byte or one word at a time (especially over a network!). In stead data to be printed is stored in a buffer at a known location in memory and transferred in blacks to memory in the printerA????1s memory. The printerA????1s memory is not always sufficient to hold the entire printout data at delays. Devise and describe, in as much detail as you can, an interrupt/DMA scheme that will assure that all documents will be successfully printed. 3940 Consider the instruction statistics below for a multi-cycle datapath Compute the average CPI. In an effort to construct a faster multi-cycle processor, we decide to pipeline the memory access such that each memory access takes three cycles. This will allow us to reduce the clock cycle time by 18%. Given the instruction statistics above, determine if this is indeed a good tradeoff. [Note both instruction fetch and data fetch are affected]. I can introduce a dcb $t0, loop instruction A????1 decrement-and-branch-onzero. 20% of all branch instructions can be replaced in this manner. There is no impact on cycle time. Will this speed up the execution of programs? About 15% of R-type and 10% of the memory operations come from I/O operations performed by the system libraries and operating system code. I/O operations cannot be sped up. What is the maximum speedup that can be obtained by speeding up all instructions in I/O operations? Show transcribed image text Consider the instruction statistics below for a multi-cycle datapath Compute the average CPI. In an effort to construct a faster multi-cycle processor, we decide to pipeline the memory access such that each memory access takes three cycles. This will allow us to reduce the clock cycle time by 18%. Given the instruction statistics above, determine if this is indeed a good tradeoff. [Note both instruction fetch and data fetch are affected]. I can introduce a dcb $t0, loop instruction A????1½ decrement-and-branch-onzero. 20% of all branch instructions can be replaced in this manner. There is no impact on cycle time. Will this speed up the execution of programs? About 15% of R-type and 10% of the memory operations come from I/O operations performed by the system libraries and operating system code. I/O operations cannot be sped up. What is the maximum speedup that can be obtained by speeding up all instructions in I/O operations? 3941 Consider a very high-assurance system developed for the military. The system has a set of specifications, and both the design and implementation have been proven to satisfy the specifications. What questions should school administrators ask when deciding whether to purchase such a system for their schoolA????1s use? 3942 Consider the function LSEARCH(d, L) that returns the last vertex in L that contains data d (or nil if d is not in L); that is, if there is more than a copy of d in L, then it returns the last one encountered when traversing the list from the first to the last item. A. Give Pseudo code for LSEARCH that works from the first to the last element. B. Give Pseudo code for LSEARCH that works from the last to the first element. 3943 Consider the following two functions and assume that container in foo has M data points and the matrix in matrixPrint is 2 dimensional has M rows, M columns. Calculate the big O cost of each of these functions: ..i'm pretty sure a) is O(N^2) because of 2 for loops ... but i'm not sure about b. could you explain reasoning too? thanks! Show transcribed image text Consider the following two functions and assume that container in foo has M data points and the matrix in matrixPrint is 2 dimensional has M rows, M columns. Calculate the big O cost of each of these functions: II This methods calculates a Hermitian product of matrix A multiplied by itself II This product is evaluated element by element as in the product below II assume the matrix is a square MxM matrix void matrixPrA????1nt(myObj matrix) 3944 Consider the following statements: struct nameType struct courseType { { { string first; string name; string last; int callNum; }; char grade; struct studentType int credits; nameType name; double gpa; courseType course; }; }; studentType student; studentType classList[100]; courseType course; nameType name; Mark the following statements as valid or invalid. If a statement is invalid, explain why. a. student.course.callNum = "CSC230"; b. cin >> student.name; c. classList[0] = name; d. classList[1].gpa = 3.45; e. name = classList[15].name; f. student.name = name; g. cout << classList[10] << endl; h. for (int j = 0; j < 100; j++) classList[j].name = name; i. classList.course.credits = 3; j. course = studentType.course; 3945 A) Consider the following simple class: class Rectangle { private: double length, width; public: Rectangle ( double l, double w ){ length = l; width = w; } double area() { return length * width; } double perimeter(){ return 2* ( length + width ); } }; 1) Write a copy constructor for the class. 2) Consider the following class that uses the Rectangle class defined above: class artItem { private: Rectangle canvas_frame; Rectangle canvas; String title; A????1 }; a) Write a constructor which initializes the picture_frame, the canvas, and the title. The constructor receives a string parameter to initialize the title, a Rectangle object to pass to the Rectangle copy constructor when creating the picture_frame object, and a Rectangle object to pass to the Rectangle copy constructor when creating the canvas object. b) Write a print method that prints the title and prints the perimeter of picture_frame and the area of canvas A????1 call the methods area and perimeter to get both values. 3) From the Rectangle class defined in above, derive a class named Box having an additional data member named depth, a constructor with three parameters ( one for the depth and two for the constructor of Rectangle) , and a volume method that returns the volume of the box A????1 volume is length *width * depth. 3946 Consider the following set of requirements for a UNIVERSITY database that is used to keep track of students' transcripts. Draw an ER diagram. Specify key attributes (or partial key) of each entity type and cardinality radio on each relationship type. Please provide your assumptions as needed. (50 points) ? The university keeps track of each student's name, student number, social security number, current address and phone, permanent address and phone, birthdate, sex, class (freshman, sophomore, ..., graduate), major department, minor department (if any), and degree program (B.A., B.S., ..., Ph.D.). Some user applications need to refer to the city, state, and zip of the student's permanent address, and to the student's last name. Both social security number and student number have unique values for each student. ? Each department is described by a name, department code, office number, office phone, and college. Both name and code have unique values for each department. ? Each course has a course name, description, course number, number of semester hours, level, and offering department. The value of course number is unique for each course. ? Each section has an instructor, semester, year, course, and section number. The section number distinguishes different sections of the same course that are taught during the same semester/year; its values are 1, 2, 3, ..., up to the number of sections taught during each semester. ? A grade report has a student, section, letter grade, and numeric grade (0, 1, 2, 3, 4 for F, D, C, B, A, respectively). Question 2 Consider the following set of requirements for a HEALTHCARE database. Draw an ER diagram. Specify key attributes (or partial key) of each entity type and cardinality radio on each relationship type. Please provide your assumptions as needed. (50 points) ? Patients are identified by an SSN, and their names, addresses, and ages must be recorded. ? Doctors are identified by an SSN. For each doctor, the name, specialty, and years of experience must be recorded. ? Each pharmaceutical company is identified by name and has a phone number. ? For each drug, the trade name and formula must be recorded. Each drug is sold by a given pharmaceutical company, and the trade name identifies a drug uniquely from among the products of that company. If a pharmaceutical company is deleted, you need not keep track of its products any longer. ? Each pharmacy has a name, address, and phone number. ? Every patient has a primary doctor. Every doctor has at least one patient. ? Each pharmacy sells several drugs and has a price for each. A drug could be sold at several pharmacies, and the price could vary from one pharmacy to another. ? Doctors prescribe drugs for patients. A doctor could prescribe one or more drugs for several patients, and a patient could obtain prescriptions from several doctors. ? Each prescription has a date and a quantity associated with it. You can assume that, if a doctor prescribes the same drug for the same patient more than once, only the last such prescription needs to be stored. ? Pharmaceutical companies have long-term contracts with pharmacies. A pharmaceutical company can contract with several pharmacies, and a pharmacy can contract with several pharmaceutical companies. For each contract, you have to store a start date, an end date, and the text of the contract. Pharmacies appoint a supervisor for each contract. There must always be a supervisor for each contract, but the contract supervisor can change over the lifetime of the contract. 3947 Consider the following sequence of actual outcomes for a single static branch. T means the branch is taken. N means the branch is not taken. For this question, assume that this is the only branch in the program. TTTNTNTTTNTNTTTNTN Assume a two-level branch predictor that uses one bit of branch historyA????1i.e., a one-bit BHR. Since there is only one branch in the program, it does not matter how the BHR is concatenated with the branch PC to index the BHT. Assume that the BHT uses one-bit counters and that, again, all entries are initialized to N. Which of the branches in this sequence would be mis-predicted? Use the table below. 3948 Consider the following recursive method: public static int p(int x) { if(x<3){ return x; } else{ return p(x-1)* p(x-3); } } let m(x) be the number of multiplication operations that the execution of p(x) performs. a. write a recursive definition of m(x) b.prove that your answer to Part a is correct by using mathmatical induction 3949 Consider the following pseudo-code. For each of the following parameter passing mechanisms, give the value returned for every function call, in the order that the returns occur. Then give the output produced by the program. Assume operands are evaluated leftto-right and values are copied back left-to-right, where appropriate. For example, if f3 is the first function to return and it returns a value 17, simply write something like A????1f3 returns 17.A????1 (a) Value (b) Reference (c) In Out int p = 5; int q = 1; int f1(int b, int c) { b = 2 * c; c = 3 + b; return b + c; } int f2(int a, int b) { return f1(b, a) * f1(a, a); } print f1(p,q) + f2(p, f1(p,q)); 3950 Consider the following pseudo-code. Draw a picture of the run-time stack when control reaches the end of the last call to f3. Include dynamic and static links (if required) and storage for local variables and parameters. You do not have to show the storage for any other control information or temporaries. int p = 3; int q = 2; int f1(int b, int c) { int f3(int n) { return n+1; } b = 2 * f3(c) + b; return b; } int f2(int a, int b) { return f1(a, a) * f1(b, a); } print f2(p, f1(p,q)); 3951 Consider the following for loop: for ( int i = 0; i <= 100; i++ ) { if ( i % 3 == 0 ) cout << "zero" << endl; else cout << "greater than zero" << endl; } cout << "After the for loop" << endl; Question: How many iterations of the for loop will occur? What will be printed to the consol? 3952 Consider the following IP addresses, A and B: A - 192.168.4.14/28 B - 192.168.4.17/28 Use binary to determine whether IP addresses A and B are in the same network, based on the subnet mask. 3953 Consider the following IP addresses, A and B: A - 192.168.4.14/28 B - 192.168.4.17/28 Use binary to determine whether IP addresses A and B are in the same network, based on the subnet mask. 3954 Consider the following grammar: expr -> term term_tail term_tail -> add_op term term_tail | e term -> factor factor_tail factor_tail -> mult_op factor factor_tail | e factor -> (expr) | id | literal add_op -> + | - mult_op -> * | / Show the stack snapshots, step by step, for parsing the expressions (ab * cdf + 314) in a top-down manner (table-driven). Note that ab and cdf are identifiers (names for variables) and 314 is a literal. Do lexical analysis first. The result is a sequence of token kinds. Then do parsing (syntactical analysis). Since the grammar rules are simple enough that one can visually find a grammar rule to apply for each step without building a parsing table first. If the input is syntactically correct, draw a syntax tree for it. 3955 Consider the following function: Void funcExercise6 (int x, int y) { int z; z = x + y; x = y; y = z; z = x; cout << A????1x = A????1 << x << A????1, y = A????1 << y << A????1, z = A????1 << z << end1; } Find the exact number of operations executed by the function funcExercise6. 3956 Consider the following declarations: const int CAR_TYPES = 2; const int COLOR_TYPES = 3; double sales[CAR_TYPES][ COLOR_TYPES]; a. Write C++ code to ask the sales per CAR_TYPE per COLOR_TYPE from the user and store them in the sales array. b. Write C++ code to sum the sales by CAR_TYPES and print a report on the screen. c. Write C++ code to sum the sales by COLOR_TYPES and print a report on the screen. 3957 Consider the following data set and the hash function: Data: 2, 3, 11, 13, 20, 26, 34, 46 Hash function: h(item) = item % (noitem +1) Where item is data value and noitem is the number of given data items. Show step-by-step how the above data items can be stored into a table (onedimensional array). Resolve the collisions using linear probing. Report all single and multiple collisions. Resolve the collisions using quadratic probing. Which of above methods (linear or quadratic) performs better and why? 3958 Consider the following containers: List Stack Map StaticArray Queue Building a record by hand SortingMachine Item #1: Pick a container component (from the list above) to store statistics kept about a basketball player as shown to the right. NAME: last name, first name, MI Enter your answer by typing: FGM, FGA: field goals made, attempted "Item #1" FTM, FTA: free throws made, attempted The container you selected from the list above and if it is a template class the C++ code you would use to create a 3FGM, 3FGA: three-point field goals made, named instance attempted A justification for your selection OREB, DREB: offensive rebounds, defensive rebounds AST: assists STL: steals BLK: blocks TO: turnovers PF: personal fouls MIN: minutes played Item #2: Given the class ArenaData to the right. Pick a container component that would allow efficient look up of a particular arena given its name. Enter your answer by typing: class ArenaData { public: Text arenaName; Text cityLocated; Integer seatingCapacity; Integer yearBuilt; }; "Item #2" The container you selected from the list above and if it is a template class the C++ code you would use to create a named instance A justification for your selection 3959 Consider the following C code snippet. // C code void setArray(int num) { int i; int array[10]; for (i = 0; i < 10; i = i + 1) { array[i] = compare(num, i); } } int compare(int a, int b) { if (sub(a, b) >= 0) return 1; else return 0; } int sub(int a, int b) { return a - b; } Implement the C code snippet in MIPS assembly language. Use $s0 to hold the variable i. Be sure to handle the stack pointer appropriately. The array is stored on the stack of the setArray function (You may see Section 6.4.6 of the textbook for further reference). You may use the MARS MIPS Assembly simulator provided at the URL: http://courses.missouristate.edu/KenVollmar/MARS/download.htm. 3960 Consider the following algorithm. for i {1, 2, 3, 4, 5} do beep for j {1, 2, 3} do beep for k {1, 2, 3, 4} do for l {1, 2, 3, 4, 5, 6} do beep for m {1, 2, 3, 4} do beep How many times does a beep statement get executed? 3961 Consider flash memories with the following characteristics: Data Transfer Rate Controller Transfer Rate a. 120 MB/s 100 MB/s b. 100 MB/s 90 MB/s Question: Calculate the average time to read or write a 1024-byte sector for each flash memory listed in the table.(You only do a. or b. it's enough) 3962 Consider this data sequence: "fish bird reptile reptile bird bird bird mammal fish". Let's define a SINGLETON to be a dataelement that is not repeated immediately before or after itself in the sequence. So, here there are four SINGLETONs (the first appearance of "fish", the first appearance of "bird", "mammal", and the second appearance of "fish"). Write some code that uses a loop to read a sequence of words, terminated by the "xxxxx". The code assigns to the variable nthe number of SINGLETONs that were read. (For example in the above data sequence it would assign 4 to n). Assume that nhas already been declared but not initialized . Assume that there will be at least one word before the terminating "xxxxx".Assume that the maximum length of a string is 8. Answer must be in programming C (not Java or C++). 3963 Consider a complicated Boolean statement ? built from the variables Q1, Q2,A????1, Qn (for example, the statement might begin ? = Q1 ? ((Q2 ? Q1) ? (Q3 ? A????1)) . The truth of a statement like this naturally depends on the truth of the individual variables; we say that ? is a tautology if it is true for every setting of the Qi. Recall that one way to organize this information is by a truth table, which lists the truth value of the statement for each possible setting of the n variables Q1, Q2,A????1, Qn. Then a statement is a tautology if each row of the truth table concludes that ? is T . (a) How many rows are there in such a truth table (that is, how many assignments are there to check, in the worst case)? (b) Suppose that a fast computer can check 1,000,000 assignments per second. What is the size (in terms of the number of variables) of the largest statement that can be checked in this way in a year? (c) A statement ? is a contradiction if it is false for every setting of the Qi. If ? is a contradiction and ? is an arbitrary statement (involving the same variables Q1, A????1, Qn), is it always true that ? ? ? is a tautology? Explain. Curiously, there is no known algorithms that is significantly faster than this. 3964 Consider a complicated Boolean statement ? built from the variables ??1,??2,A????1,???? (for example, the statement might begin ? = ??1 ?((??2 ? ??1)?(??3 ? A????1)). The truth of a statement like this naturally depends on the truth of the individual variables; we say that ? is a tautology if it is true for every setting of the ????. Recall that one way to organize this information is by a truth table, which lists the truth value of the statement for each possible setting of the ?? variables ??1,??2,A????1,????. Then a statement is a tautology if each row of the truth table concludes that ? is ??. (a) How many rows are there in such a truth table (that is, how many assignments are there to check, in the worst case)? (b) Suppose that a fast computer can check 1,000,000 assignments per second. What is the size (in terms of the number of variables) of the largest statement that can be checked in this way in a year? (c) A statement ? is a contradiction if it is false for every setting of the ????. If ? is a contradiction and ? is an arbitrary statement (involving the same variables ??1,A???? 1,????), is it always true that ? ? ? is a tautology? Explain. Curiously, there is no known algorithms that is signi?cantly faster than this. 3965 Consider a complicated Boolean statement ? built from the variables ??1,??2,A????1,???? (for example, the statement might begin ? = ??1 ?((??2 ? ??1)?(??3 ? A????1)). The truth of a statement like this naturally depends on the truth of the individual variables; we say that ? is a tautology if it is true for every setting of the ????. Recall that one way to organize this information is by a truth table, which lists the truth value of the statement for each possible setting of the ?? variables ??1,??2,A????1,????. Then a statement is a tautology if each row of the truth table concludes that ? is ??. (a) How many rows are there in such a truth table (that is, how many assignments are there to check, in the worst case)? (b) Suppose that a fast computer can check 1,000,000 assignments per second. What is the size(in terms of the number of variables)of the largest statement that can be checked in this way in a year? (c) A statement ? is a contradiction if it is false for every setting of the ????. If ? is a contradiction and ? is an arbitrary statement (involving the same variables ??1,A???? 1,????), is it always true that ? ? ? is a tautology? Explain. Curiously, there is no known algorithms that is signi?cantly faster than this. 3966 Consider a 10 bit floating point number system. The sign bit is the most significant bit. 4 bits are reserved for the exponent and remaining 5 bits are the mantissa. A bias of 7 is to be used. What is the floating point representation of number 22.5 0 | 1 0 1 1 | 0 1 1 0 1 This is the answer, but how did they solve 3967 Congruent triangles SSS and SAS proofs. Write a 2 column for each of the following problem. No explaining needed just the 2 column proof please. Images: Thanks for help !! 3968 Configure this network with 2 routers, 2 switches, and 4 PCs. Network 1 ID 15.15.16.0 Network 2 ID 15.15.32.0 Network 3 ID 15.15.48.0 Ethernet 0 150.15.32.1 Ethernet 1 150.15.16.1 Ethernet 2 150.15.48.1 3969 Conduct research on what Ring Counter and Johnson Counter are and what their expected functions are. Include your research results in your lab report. Build a 5-bit Ring Counter using J-K flop-flops, and again using D flip-flops. Include the state tables and confirm that each produces five states. Build a 5-stage Johnson Counter using J-K flip-flops, and again using D flip-flops. Include the state tables and confirm that each produces ten states. Create a new design file .In this design file, draw the circuit for all the four counters you have designed from step 1 and step 2. Apply the same clock source to all the four counters and use different LED arrays to demonstrate the outputs of each counter. 3970 Conditional Formating Cells With Formulas Based on Whether It is Blank Hi, I have a column that is populated with the formulas below. My goal is to conditionally format each cell when it has a value and not format it when the result of the cell formula is null. I tried a few approaches and have not been successful. Could someone please walk me through the process of how to do this? Secondly, please tell me how to copy the conditional formating down to every cell in the column. I really do appreciate your help. :) Selected Categories =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J1)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J2)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J3)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J4)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J5)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J6)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J7)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J8)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J9)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J10)),"") 3971 Conditional Formating Cells With Formulas Based on Whether It is Blank Hi, I have a column that is populated with the formulas below. My goal is to conditionally format each cell when it has a value and not format it when the result of the cell formula is null. I tried a few approaches and have not been successful. Could someone please walk me through the process of how to do this? Secondly, please tell me how to copy the conditional formating down to every cell in the column. I really do appreciate your help. :) Selected Categories =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J1)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J2)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J3)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J4)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J5)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J6)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J7)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J8)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J9)),"") =IFERROR(CUBERANKEDMEMBER("PowerPivot Data",$AE$1,ROW(J10)),"") Thank your for help !! 3972 Conditional Fomatting; Use a formula to determine which cell to format Hi All, I have a label in cell C1 which needs to turn red or green based on what is being calculated in cell C3: If Cell C3 < 97, then C1 is red If Cell C3 is between 97 and 103, then C1 is green If cell C3 > 103, then C1 is red I am struggling to get my head around how best to write a statement in the rule description box. Any help will be greatly appreciated. Thanks for help !! 3973 this is a conceptual question, but if i initialize a variable in c# as public will it be able to be used in the class as I want a variable "player1" and a variable "player2" where either could be one of the two (or more) Player Computer Here is what i would like to know how I would do: public class Game { //equivalent of initializing it here public bool islogging; public string[] log; public int draws, round; public Game(player p1, computer p2) { public player player1 = p1; public computer player2 = p2; } //other overloads here... ... } trying this it doesn't work as the public keyword is rejected public Game(player p1, player p2 ) { public player player1, player2; player player3 = p1; player player4 = p2; } 3974 This is from computing with Matlab* Show transcribed image text 2.8. Modify the lutx function so that it uses explicit for loops instead of MATLAB vector notation. For example, one section of your modified program will read X Compute the multipliers end Compare the execution time of your modified lutx program with the origi Nal lutx program and with the built-in lu function by finding the order of the matrix for which each of the three programs takes about 10 s on your computer. 3975 In a computer using paging-based virtual memory, not all accesses to unallocated memory may be detected (and reported as segmentation faults). Why? Give an illustrative example. 3976 A computer system has 128 byte cache and it is organized as a 4 way set associative cache. Every cache line containt 4 bytes of data In this system a main memory address is 32 bits a) setermine the sizes of TAG, INDEX and OFFSET fields of the main memory address b) if it is desired to map the following two main memory address in hex 0x000010AF and 0xFFFF7Axy to the same cache set what must be the values of the unknown hex digits x and y? Please show me work 3977 computer science context free grammer Show transcribed image text Consider the following context ? free grammar Derive the string , Show each step. How many strings can this grammar derive? 3978 Computer Architecture question: Write a program that prints the content of the instruction memory, in effect, disassembling the program. Start with the default program memory address of 0x00400000; read words from the memory sequentially and output the first N instructions on the console. N will be an integer read from the keyboard. As an example, if you have: Address Content -----------------------[0x00400000] 0x3408010a [0x00400004] 0x3409000c [0x00400008] 0x01195120 in the memory, the result of running your program with N = 3, would print the following to the console window: 0x3408010a 0x3409000c 0x01195120 3979 Computer Architecture 5th edition b.12 [15] A program is running on a computer with a four-entry fully associa- tive (micro) translation lookaside buffer (tlb) exercises by amr zaky ? b-65 the following is a trace of virtual page numbers accessed by a program. for each access indicate whether it produces a tlb hit/miss and, if it accesses the page table, whether it produces a page hit or fault. put an x under the page table column if it is not accessed. vp# pp# entry valid 53 0 1 71 0 10 10 1 15 25 1 virtual page index physical page # present 03y 17n 26n 35y 41 4y 53 0y 62 6y 71 1y 81 3n 91 8n 10 10 y 11 56 y 12 110 y 13 33 y 14 12 n 15 25 y virtual page accessed tlb (hit or miss) page table (hit or fault) 1 5 9 14 10 6 15 12 7 2 3980 A computer has 64-KB virtual address space and 32-KB physical address space. The page size is 4 KB. At an instant ti , the mapping between virtual address space and physical address space is shown in Fig.2. Answer the following questions. 1) Compute virtual page number and offset for the virtual addresses 4000, 8200, 16000, and 48000. 2) Compute the physical address for the virtual addresses 4000, 8200, 16000, and 48000. 3981 A computer has 64-KB virtual address space and 32-KB physical address space. The page size is 4 KB. At an instant ti , the mapping between virtual address space and physical address space is shown in Fig.2. Answer the following questions. 1) Compute virtual page number and offset for the virtual addresses 4000, 8200, 16000, and 48000. 2) Compute the physical address for the virtual addresses 4000, 8200, 16000, and 48000. Show transcribed image text A computer has 64-KB virtual address space and 32-KB physical address space. The page size is 4 KB. At an instant ti , the mapping between virtual address space and physical address space is shown in Fig.2. Answer the following questions. 1) Compute virtual page number and offset for the virtual addresses 4000, 8200, 16000, and 48000. 2) Compute the physical address for the virtual addresses 4000, 8200, 16000, and 48000. 3982 A computer has 64-KB virtual address space and 32-KB physical address space. The page size is 4 KB. At an instant ti , the mapping between virtual address space and physical address space is shown in Fig.2. Answer the following questions. 1) Compute virtual page number and offset for the virtual addresses 4000, 8200, 16000, and 48000. 2) Compute the physical address for the virtual addresses 4000, 8200, 16000, and 48000. 3983 A computer has 128 MB of memory. If there are 8 bytes (namely c1:=$A1, c2 :=$AB, c3 :=$10, c4 :=$EF, c5=$AB12, and c6=FE01), stored at this memory, draw the table and place them (c1, c2, c3, c4, c5, and c6) at the memory with associated address (Little Endian computer. Assume the address for first variable c1 is 000EF110 H). Please draw the table to get the full credits. 3984 Compute the total cost of building a data center that houses 10 ExaBytes of HDD A????1HDDs, networking, racks, building (real-estate), power, cooling, A????1 A????1You could assume the following: one 4U box can contain 64 disk drives; chassis for a 4U is $20K, a rack is 48U so you can put 10 4U chasses in a rack; you can put network switches (either IB or 40GbE) on other 8U. Price the cost of rack as well. A????1You can get the cost of various parts online. State all your assumptions with reference for pricing, etc. The assumptions should be realistic. You will be evaluated based on the completeness and correctness of your solution. A????1Assume the datacenter is built in Buffalo Please give me an estimated cost of the data center and also provide links for the parts. Please make the assumptions as described. 3985 I completed an assignment before, My second one is to add onto my first and I need help with it. There are some classes that need some methods modified, and 3 new small classes to be created. 1500 points :) Here are the Classes that need to be changed according to the instructions above CLASS ACCOUNT public class Account { /* * account balance */ private double balance; /* * interest rate for the account */ private double interestRate; /* * No-parameter constructor, it sets * balance to 0d, and interestRate * to 0.0025 as defaults */ public Account(){ balance = 0d; interestRate = 0.0025; } /* * Access for balance field */ public double getBalance(){ return balance; } /* * Attempts to add the provided amount to the * balance field, ensures that negative amount * values are blocked. Returns a reference to a * TransactionResult to indicate if the operation * succeeded or failed and to return a message * suitable for the view logic */ public TransactionResult deposit(double amount){ if(amount <= 0){ return new TransactionResult(false, "Cannot deposit zero or negative amount"); } else{ this.balance += amount; return new TransactionResult(true, String.format("Deposit of %.2f made", amount)); } } /* * Attempts to add the provided amount to the * balance field, ensures that negative amount * values are blocked. Returns a reference to a * TransactionResult to indicate if the operation * succeeded or failed and to return a message * suitable for the view logic */ public TransactionResult withdraw(double amount){ if(amount <= 0){ return new TransactionResult(false, "Cannot withdraw zero or negative amount"); } else if(amount > balance){ return new TransactionResult(false, String.format("Withrawal of %.2f too large, balance is %.2f", amount, balance)); } else{ this.balance -= amount; return new TransactionResult(true, String.format("Withdrawal of %.2f made", amount)); } } /* * Multiplies interest rate against balance and adds the result to the balance */ public void applyInterest(){ balance = balance + (balance * interestRate); } /* * Returns a String representing the account. */ public String details(){ StringBuilder builder = new StringBuilder(); builder.append("Account balance: $").append(String.format("%.2f", balance)); return builder.toString(); } } CLASS CUSTOMER public class Customer { /* * Array of references to Account objects */ private Account[] accounts; /* * First name of customer */ private String firstName; /* * Last name of customer */ private String lastName; /* * Overloaded constructor, accepts references to Strings for * first and last name fields, also creates * an Array of references to Account objects with a size of 2. * Note that the array elements themselves are left null. */ public Customer(String firstName, String lastName){ this.firstName = firstName; this.lastName = lastName; accounts = new Account[2]; } /* * No-parameter constructor, calls overloaded constructor. */ public Customer(){ this("Unknown first name","Unknown last name"); } /* * Accessor for firstName field */ public String getFirstName(){ return firstName; } /* * Mutator for firstName field */ public void setFirstName(String firstName){ this.firstName = firstName; } /* * Accessor for lastName field */ public String getLastName(){ return lastName; } /* * Mutator for lastName field */ public void setLastName(String lastName){ this.lastName = lastName; } /* * Attempts to create an account and store a reference to it in * the array. The array only stores 2 accounts at most. * Returns a TransactionResult that will indicate if the operation * succeeded or failed with a message. */ public TransactionResult createAccount(){ if(accounts[0] == null){ accounts[0] = new Account(); return new TransactionResult(true, "Account at index 0 created"); } else if(accounts[1] == null){ accounts[1] = new Account(); return new TransactionResult(true, "Account at index 1 created"); } else{ return new TransactionResult(false, "Account not created, account limit reached (2 accounts already exist)"); } } /* * Attempts to deposit an amount into an account at the specified index. * Verifies that there is an Account object at the specified index. * Returns a TransactionResult that will indicate if the operation * succeeded or failed with a message. */ public TransactionResult deposit(int accountIndex, double amount){ if(hasNoAccounts()){ return new TransactionResult(false, "Customer has no accounts, deposit not completed"); } else if(accountIndex < 0 || accountIndex > accounts.length - 1){ return new TransactionResult(false, "Invalid account index, deposit not completed"); } else if(accounts[accountIndex] == null){ return new TransactionResult(false, "Invalid account index, deposit not completed"); } else{ return accounts[accountIndex].deposit(amount); } } /* * Attempts to withdraw an amount from an account at the specified index. * Verifies that there is an Account object at the specified index. * Returns a TransactionResult that will indicate if the operation * succeeded or failed with a message. */ public TransactionResult withdraw(int accountIndex, double amount){ if(hasNoAccounts()){ return new TransactionResult(false, "Customer has no accounts, withdrawal not completed"); } else if(accountIndex < 0 || accountIndex > accounts.length - 1){ return new TransactionResult(false, "Invalid account index, withdrawal not completed"); } else if(accounts[accountIndex] == null){ return new TransactionResult(false, "Invalid account index, withdrawal not completed"); } else{ return accounts[accountIndex].withdraw(amount); } } /* * Generates a String representing this Customer object, including * details on the Accounts (if there are any). */ public String details(){ StringBuilder builder = new StringBuilder(); builder.append("Customer:").append(firstName).append(" ") .append(lastName).append(System.lineSeparator()); if(hasNoAccounts()){ builder.append("Customer has no accounts"); } else{ for(int index = 0; index < accounts.length; index++){ if(accounts[index] != null){ builder.append(accounts[index].details()); if(index != accounts.length - 1){ builder.append(System.lineSeparator()); } } } } return builder.toString(); } /* * Iterates over the accounts array and calls * applyInterest() on each referenced Account object. */ public void applyInterest(){ for(int index = 0; index < accounts.length; index++){ if(accounts[index] != null){ accounts[index].applyInterest(); } } } /* * Helper method used to determine if the customer has no * accounts. Returns true if there are no accounts. */ private boolean hasNoAccounts(){ return (accounts[0] == null && accounts[1] == null); } } CLASS BANK public class Bank { /* * Array of references to customers */ private Customer[] customers; /* * used to track the number of customers in the bank */ private int customerCount; /* * No-parameter constructor, sets customerCount to zero, * and creates an array of references to Customer objects * that can hold a maximum of 5. Note that the * elements in the array are left as null by this constructor. */ public Bank(){ customerCount = 0; customers = new Customer[5]; } /* * Attempts to create a Customer using the specified first and last names * and attempts to assign a reference to it into the customers array. * A reference to a TransactionResult is returned that contains information * on the success / failure and a message. */ public TransactionResult addCustomer(String firstName, String lastName){ if(customerCount >= customers.length){ return new TransactionResult(false, "Could not create customer, bank is full"); } else{ customerCount++; customers[customerCount - 1] = new Customer(firstName, lastName); return new TransactionResult(true, "Customer added to bank"); } } /* * Attempts to add an account to the specified customer based on specified index * by calling createAccount() on the Customer object if there is one available. * A reference to a TransactionResult is returned that contains information * on the success / failure and a message. */ public TransactionResult addAccount(int customerIndex){ if(customerCount == 0){ return new TransactionResult(false, "No customers, cannot add account"); } else if(customerIndex < 0 || customerIndex > customerCount - 1){ return new TransactionResult(false, "Invalid customer index, could not add account"); } else{ return customers[customerIndex].createAccount(); } } /* * Generates a String of customers with index, first name, last name * and with each record on separate lines. */ public String customerList(){ StringBuilder builder = new StringBuilder(); if(customerCount == 0){ builder.append("No customers to list"); } for(int index = 0; index < customerCount; index ++){ builder.append("Index: ").append(index).append(" "); builder.append(" First name: ").append(customers[index].getFirstName()); builder.append(" Last name: ").append(customers[index].getLastName()); builder.append(System.lineSeparator()); } return builder.toString(); } /* * Generates a String representing the customer details of the Customer referenced * at the specified index in the array, or a warning if there is no Customer avaiable. */ public String customerDetails(int index){ if(index < 0 || index > customers.length - 1 || customers[index] == null){ return "Invalid index, no customer available at that index for display"; } else{ StringBuilder builder = new StringBuilder(); builder.append("Customer at index: ").append(index).append(System.lineSeparator()); builder.append(customers[index].details()); return builder.toString(); } } /* * Attempts to make a deposit on the Customers account using customer index, account index, * and the amount. Verifies that there is a customer at the specified index. * A reference to a TransactionResult is returned that contains information * on the success / failure and a message. */ public TransactionResult deposit(int customerIndex, int accountIndex, double amount){ if(customerIndex < 0 || customerIndex > customerCount - 1){ return new TransactionResult(false, "Invalid customer index, could not make deposit"); } else{ return customers[customerIndex].deposit(accountIndex, amount); } } /* * Attempts to make a withdrawal on the Customers account using customer index, account index, * and the amount. Verifies that there is a customer at the specified index. * A reference to a TransactionResult is returned that contains information * on the success / failure and a message. */ public TransactionResult withdraw(int customerIndex, int accountIndex, double amount){ if(customerIndex < 0 || customerIndex > customerCount - 1){ return new TransactionResult(false, "Invalid customer index, could not make withdrawal"); } else{ return customers[customerIndex].withdraw(accountIndex, amount); } } /* * Iterates over the customers array and requests that each referenced Customer * object applies it's interest rate. */ public void applyInterest(){ for(int index = 0; index < customerCount; index++){ customers[index].applyInterest(); } } } CLASS BANK MANAGER public class BankManager { /* Constant used in menu system for creating a customer */ private static final int CREATE_CUSTOMER = 1; /* Constant used in menu system for creating an account */ private static final int CREATE_ACCOUNT = 2; /* Constant used in menu system for making a deposit */ private static final int DEPOSIT = 3; /* Constant used in menu system for making a withdrawal */ private static final int WITHDRAW = 4; /* Constant used in menu system for listing customers */ private static final int LIST_CUSTOMERS = 5; /* Constant used in menu system for displaying one customer's details */ private static final int CUSTOMER_DETAILS = 6; /* Constant used in menu system for applying interest to all customer's accounts */ private static final int APPLY_INTEREST = 7; /* Constant used in menu system for exiting the program */ private static final int EXIT = 8; /* Reference to the bank (the data or model) */ private Bank bank; /* Reference to Scanner used to interact with user */ private Scanner input; /* * No-parameter constructor, create a Bank as well * as the Scanner. The scanner uses System.in */ public BankManager(){ bank = new Bank(); input = new Scanner(System.in); } /* * Core interaction logic, shows menu, reads in user option, * calls methods to match users input option, and repeats this * in a loop until the user chooses to exit the program. */ public void runBank(){ int option = -1; do{ displayMenu(); System.out.println("Please enter menu option, to exit enter 8"); option = input.nextInt(); input.nextLine(); // remove line terminator left in stream switch(option){ case CREATE_CUSTOMER: createCustomer(); break; case CREATE_ACCOUNT: createAccount(); break; case DEPOSIT: deposit(); break; case WITHDRAW: withdraw(); break; case LIST_CUSTOMERS: displayCustomerList(); break; case CUSTOMER_DETAILS: displayCustomerDetails(); break; case APPLY_INTEREST: applyInterest(); break; case EXIT: System.out.println("Thanks for banking"); break; } }while(option != EXIT); } /* * Attempts to create a customer in the Bank after interacting * with the user to get the needed information. */ private void createCustomer(){ System.out.println("Creating new customer..."); System.out.print("Please enter first name: "); String firstName = input.nextLine(); System.out.print("Please enter last name: "); String lastName = input.nextLine(); TransactionResult result = bank.addCustomer(firstName, lastName); System.out.println(result.getMessage()); } /* * Attempts to create an account in a Customer in the Bank after interacting * with the user to get the needed information. */ private void createAccount(){ System.out.println("Creating new account..."); System.out.print("Please enter customer index: "); int index = input.nextInt(); input.nextLine(); // remove line terminator left in stream TransactionResult result = bank.addAccount(index); System.out.println(result.getMessage()); } /* * Attempts to make a deposit on the specified Customer and specified account in * the Bank, gives the user 3 attempts to enter a valid deposit amount before * asking the user to contact their manager at which point control is returned * back the main menu (method runBank()). */ private void deposit(){ TransactionResult result = null; int mistakeCounter = 0; do{ System.out.println("Making a deposit..."); System.out.print("Please enter customer index: "); int customerIndex = input.nextInt(); System.out.print("Please enter account index: "); int accountIndex = input.nextInt(); System.out.print("Please enter the amount (e.g. nn.nn): "); double amount = input.nextDouble(); input.nextLine(); // remove line terminator left in stream result = bank.deposit(customerIndex, accountIndex, amount); if(result.getWasSuccessful()){ System.out.println(result.getMessage()); } else{ System.out.println(result.getMessage()); mistakeCounter++; if(mistakeCounter >= 3){ System.out.println("Please contact your supervisor for help, returning to main menu"); break; } } }while(result.getWasSuccessful() == false); } /* * Attempts to make a withdrawal on the specified Customer and specified account in * the Bank, gives the user 3 attempts to enter a valid withdrawal amount before * asking the user to contact their manager at which point control is returned * back the main menu (method runBank()). */ private void withdraw(){ TransactionResult result = null; int mistakeCounter = 0; do{ System.out.println("Making a withdrawal..."); System.out.print("Please enter customer index: "); int customerIndex = input.nextInt(); System.out.print("Please enter account index: "); int accountIndex = input.nextInt(); System.out.print("Please enter the amount (e.g. nn.nn): "); double amount = input.nextDouble(); input.nextLine(); // remove line terminator left in stream result = bank.withdraw(customerIndex, accountIndex, amount); if(result.getWasSuccessful()){ System.out.println(result.getMessage()); } else{ System.out.println(result.getMessage()); mistakeCounter++; if(mistakeCounter >= 3){ System.out.println("Please contact your supervisor for help, returning to main menu"); break; } } }while(result.getWasSuccessful() == false); } /* * Tells the Bank object to applyInterest to all customer accounts */ private void applyInterest(){ bank.applyInterest(); System.out.println("Interest applied to all customer's accounts"); } /* * Displays a menu for the user using values in the Constants */ private void displayMenu(){ System.out.printf("%d Create Customer %n", CREATE_CUSTOMER); System.out.printf("%d Create Account %n", CREATE_ACCOUNT); System.out.printf("%d Deposit %n", DEPOSIT); System.out.printf("%d Withdraw %n", WITHDRAW); System.out.printf("%d Customer Listing %n", LIST_CUSTOMERS); System.out.printf("%d Customer Details %n", CUSTOMER_DETAILS); System.out.printf("%d Apply interest %n", APPLY_INTEREST); System.out.printf("%d Exit %n", EXIT); } /* * Displays a list of customers retrieved from the Bank */ private void displayCustomerList(){ System.out.println(bank.customerList()); } /* * Displays details for one customer as retrieved from * the Bank based on customer index. */ private void displayCustomerDetails(){ System.out.println("Customer Details..."); System.out.print("Please enter customer index: "); int index = input.nextInt(); input.nextLine(); // remove line terminator left in stream System.out.println(bank.customerDetails(index)); } } 3986 Complete VHDL description of the synchronous sequential circuit with truth table below. (Please explain) Show transcribed image text Complete VHDL description of the synchronous sequential circuit with truth table below. (Please explain) 3987 Complete the unimplemented functions and operators in polynomial.cpp, and add your tests to the testing program polyTest.cpp. The only function you need to write is eval () which computes and returns the value of the variable . you also need to implement some operations including addition , assignment , and the equality testing operators == and != (you can implement one of the equality testing operators by having it call the other one). this is what I have so far polynomial.h #ifndef H_POLYNOMIAL_H #define H_POLYNOMIAL_H #include // to be able to declare overloaded << operator as a friend #include // input type to the main constructor #include // for shared_ptr using namespace std; class Polynomial { friend ostream &operator<<( ostream &, const Polynomial & ); public: Polynomial(); // default polynomial is empty (= 0) Polynomial( string & ); // Set the polynomial according to the string Polynomial &operator=( const Polynomial & ); // assignment bool operator==( const Polynomial & ) const; // equality test bool operator!=( const Polynomial & ) const; // not equal test Polynomial operator+( const Polynomial & ) const; // addition double eval( double x ) const ; // evaluate the polynomial at x private: class Term // a Term of the polynomial { public: Term( double c, int e, shared_ptr n ); double coeff; int exponent; // the coefficient // the exponent shared_ptr next; }; shared_ptr head; static double TOL; // The head of the list // Tolerance for floating point equality }; #endif polynomial.cpp #include "polynomial.h" #include #include #include double Polynomial::TOL = .000000000001; // tolerance for floating pt. equality //+------------------+ //| Term constructor | //+------------------+ Polynomial::Term::Term( double c, int e, shared_ptr n ) { coeff = c; exponent = e; next = n; } //+--------------------------------------+ //| Default Constructor: Polynomial is 0 | //+--------------------------------------+ Polynomial::Polynomial() { head = nullptr; } //+-------------------------------------------------------------+ //| Constructor: The input string contains coefficient-exponent | //| pairs where everything is separated by whitespace | //+-------------------------------------------------------------+ Polynomial::Polynomial( string & str ) { stringstream ss( str ); // stringstream lets us extract items separated by // whitespace simply by using the >> operator double coefficient; // to hold the coefficient int exp; // to hold the exponent head = nullptr; // initialize head to null // read in coefficient-exponent pairs and add each term to the list // ---------------------------------------------------------------- while (ss >> coefficient >> exp) if (coefficient != 0) // don't make a 0 term head = shared_ptr(new Term( coefficient, exp, head )); } ? Polynomial &Polynomial::operator=( const Polynomial &rhs ) { }? bool Polynomial::operator==( const Polynomial &other ) const { shared-ptr a = head; shared-ptr b = other.head; while (a != null && b != null) { if (coeff != || exp !=) a = a-> next; b= b-> next; return false; } } bool Polynomial::operator!=( const Polynomial &other ) const { return !(*this == other); } Polynomial Polynomial::operator+( const Polynomial &other ) const { shared-ptr tail = nullptr; if (tail == nullptr) result -> head = tail; else tail ->next tail = tail -> next; shared-ptr result = shared-ptr (new Polynomial()); return result; } //+---------------------------------------------------------------+ //| Compute and return the value of the polynomial evaluated at x | //+---------------------------------------------------------------+ double Polynomial::eval( double x ) const { double total = 0.0; for (current = current-> next; current != nullptr; current -> next)); total = current-> coefficient + (x * total); return total; } //+--------------------------------------------------------------------------+ //| Overload the outstream << operator. Doesn't print the variable for the | //| constant term. Doesn't print "1" coefficients unless it is the constant | //| term. Prints the sign of the coefficient as addition or subtraction. | //+--------------------------------------------------------------------------+ ostream &operator<<( ostream &os, const Polynomial &poly ) { // special case for 0 polynomial // ----------------------------- if (poly.head == nullptr) { os << "0" << endl; return os; } shared_ptr current = poly.head; // print the first term separately since no leading + or - sign // ------------------------------------------------------------ if (current->exponent == 0) os << current->coeff; else if (current->coeff == 1) os << "x^" << current->exponent; else os << current->coeff << "x^" << current->exponent; // print each remaining term along with leading addition or subt. sign // ------------------------------------------------------------------- for (current = current->next; current != nullptr; current = current->next) if (current->coeff > 0) // positive term? { if (current->exponent == 0) os << " + " << current->coeff; // a constant term else if (current->coeff == 1) os << " + x^" << current->exponent; // no 1 coeffienct else os << " + " << current->coeff << "x^" << current->exponent; } else // negative term { if (current->exponent == 0) os << " - " << -current->coeff; // a constant term else if (current->coeff == -1) os << " - x^" << current->exponent; // don't print the 1 else os << " - " << -current->coeff << "x^" << current->exponent; } os << endl; // print the newline character and flush the output stream return os; } polyTest.cpp #include "polynomial.h" #include #include #include #include // for exit() call using namespace std; void makePolynomials( shared_ptr [], int & ); int main() { shared_ptr poly[ 100 ]; int nPolynomials; makePolynomials( poly, nPolynomials ); // print out the polynomials // ------------------------- for (int j=0; j < nPolynomials; j++) cout << *(poly[j]); return 0; } void makePolynomials( shared_ptr poly[], int & nPolynomials ) { // get the filename from the user and open the file // ------------------------------------------------ char filename[20]; cout << "Enter the filename: "; cin >> filename; ifstream infile; infile.open( filename ); if (! infile.is_open()) { cerr << "ERROR: could not open file " << filename << endl; exit(1); } // read in the data and construct a polynomial for each input line // --------------------------------------------------------------- string polynom; while (getline( infile, polynom )) { poly[ nPolynomials ] = shared_ptr(new Polynomial( polynom )); nPolynomials++; } } } 3988 Complete the unimplemented functions and operators in polynomial.cpp, and add your tests to the testing program polyTest.cpp. The only function you need to write is eval () which computes and returns the value of the variable . you also need to implement some operations including addition , assignment , and the equality testing operators == and != (you can implement one of the equality testing operators by having it call the other one). this is what I have so far #include "polynomial.h" #include #include double Polynomial::TOL = .000000000001; // tolerance for floating pt. equality //+------------------+ //| Term constructor | //+------------------+ Polynomial::Term::Term( double c, int e, shared_ptr n ) { coeff = c; exponent = e; next = n; } //+--------------------------------------+ //| Default Constructor: Polynomial is 0 | //+--------------------------------------+ Polynomial::Polynomial() { head = nullptr; } //+-------------------------------------------------------------+ //| Constructor: The input string contains coefficient-exponent | //| pairs where everything is separated by whitespace | //+-------------------------------------------------------------+ Polynomial::Polynomial( string & str ) { stringstream ss( str ); // stringstream lets us extract items separated by // whitespace simply by using the >> operator double coefficient; int exp; head = nullptr; // to hold the coefficient // to hold the exponent // initialize head to null // read in coefficient-exponent pairs and add each term to the list // ---------------------------------------------------------------while (ss >> coefficient >> exp) if (coefficient != 0) // don't make a 0 term head = shared_ptr(new Term( coefficient, exp, head )); } Polynomial &Polynomial::operator=( const Polynomial &rhs ) { } bool Polynomial::operator==( const Polynomial &other ) const { } bool Polynomial::operator!=( const Polynomial &other ) const { } Polynomial Polynomial::operator+( const Polynomial &other ) const { } //+---------------------------------------------------------------+ //| Compute and return the value of the polynomial evaluated at x | //+---------------------------------------------------------------+ double Polynomial::eval( double x ) const { } //+--------------------------------------------------------------------------+ //| Overload the outstream << operator. Doesn't print the variable for the | //| constant term. Doesn't print "1" coefficients unless it is the constant | //| term. Prints the sign of the coefficient as addition or subtraction. | //+--------------------------------------------------------------------------+ ostream &operator<<( ostream &os, const Polynomial &poly ) { // special case for 0 polynomial // ----------------------------if (poly.head == nullptr) { os << "0" << endl; return os; } shared_ptr current = poly.head; // print the first term separately since no leading + or - sign // -----------------------------------------------------------if (current->exponent == 0) os << current->coeff; else if (current->coeff == 1) os << "x^" << current->exponent; else os << current->coeff << "x^" << current->exponent; // print each remaining term along with leading addition or subt. sign // ------------------------------------------------------------------for (current = current->next; current != nullptr; current = current->next) if (current->coeff > 0) // positive term? { if (current->exponent == 0) os << " + " << current->coeff; // a constant term else if (current->coeff == 1) os << " + x^" << current->exponent; // no 1 coeffienct else os << " + " << current->coeff << "x^" << current->exponent; } else // negative term { if (current->exponent == 0) os << " - " << -current->coeff; // a constant term else if (current->coeff == -1) os << " - x^" << current->exponent; // don't print the 1 else os << " - " << -current->coeff << "x^" << current->exponent; } os << endl; // print the newline character and flush the output stream return os; } #include "polynomial.h" #include #include #include #include // for exit() call using namespace std; void makePolynomials( shared_ptr [], int ); int main() { shared_ptr poly[ 100 ]; int nPolynomials; makePolynomials( poly, int &nPolynomials ); // print out the polynomials // ------------------------for (int j=0; j < i; j++) cout << *(poly[j]); return 0; } void makePolynomials( shared_ptr poly[], int nPolynomials ) { // get the filename from the user and open the file // -----------------------------------------------char filename[20]; cout << "Enter the filename: "; cin >> filename; ifstream infile; infile.open( filename ); if (! infile.is_open()) { cerr << "ERROR: could not open file " << filename << endl; exit(1); } // read in the data and construct a polynomial for each input line // --------------------------------------------------------------string polynom; while (getline( infile, polynom )) { poly[ nPolynomials ] = shared_ptr(new Polynomial( polynom )); nPolynomials++; } } #ifndef H_POLYNOMIAL_H #define H_POLYNOMIAL_H #include // to be able to declare overloaded << operator as a friend #include // input type to the main constructor #include // for shared_ptr using namespace std; class Polynomial { friend ostream &operator<<( ostream &, const Polynomial & ); public: Polynomial(); // default polynomial is empty (= 0) Polynomial( string & ); // Set the polynomial according to the string Polynomial &operator=( const Polynomial & ); // assignment bool operator==( const Polynomial & ) const; // equality test bool operator!=( const Polynomial & ) const; // not equal test Polynomial operator+( const Polynomial & ) const; // addition double eval( double x ) const ; // evaluate the polynomial at x private: class Term // a Term of the polynomial { public: Term( double c, int e, shared_ptr n ); double coeff; int exponent; // the coefficient // the exponent shared_ptr next; }; shared_ptr head; static double TOL; }; #endif // The head of the list // Tolerance for floating point equality 3989 Complete the truth table for the following sequential circuit: Show transcribed image text Complete the truth table for the following sequential circuit: 3990 Complete the TABLE 1 truth tables (see the last two pages) for a one-bit ALU that has 6 inputs: Two operands A0 and B0, CIn0 (the carry-in), control bits F2 F1 F0 (so, 011 is ADD which means F2 = 0, F1 = 1, F0 = 1). And two outputs: C0 and COut0. From the truth tables in the above step, write the entire Boolean formula (simplified) for each output: C0 and COut0. Besides using Boolean algebra or K-maps to simplify, also try looking at the example of a one-bit full adder in the textbook to find other gates that might let you simplify this circuit even further. ADD CIn0 B0 A0 F2 F1 F0 C0 COut0 0 0 0 0 1 1 0 0 0 0 1 0 1 1 0 1 0 0 1 1 0 1 1 0 1 1 1 0 0 0 1 1 1 0 1 0 1 1 1 1 0 0 1 1 1 1 1 0 1 1 AND B0 A0 F2 F1 F0 0 0 1 0 1 0 1 1 0 1 1 F2 F1 F0 C0 OR B0 A0 C0 C0 = COut0 = Overflow = Zero = 3991 This will complete the program described in section 3.9 of the text. You will use the same maxmin.c file from above for this program. Write a new driver main() in the file driver2.c which reads numbers one at a time, and keeps track of the biggest and smallest number seen so far. Use your functions max() and min() to do the comparisons. Think about the algorithm you will use for this one. If you were asked to perform the same task (find the maximum and minimum of a bunch of numbers that you are given just one at a time), how would you do it? As an example, if the input numbers are: 23.5 16.1 -35.2 90 -13.1 0 your program should print that the maximum is 90.0 and minimum is -35.2. Use debug statements (with conditional compilation) to show that the maximum and minimum are being updated correctly with each input number. You can compile this program with the command: cc driver2.c maxmin.c 3992 -Complete the missing parts in the remove(int ID) method. -Add To Class StudentTree 1 void preorderTraversal(): performs preorder traversal. It calls method preorderHelper(). 2 private void preoderHelper(Student root2): a recursive method to actually perform preorder traversal. 3 void postorderTraversal(): performs postorder traversal. It calls method postorderHelper(). 4 private void postorderHelper(Student root2): a recursive method to actually perform postorder traversal. 5 private int getHeight(Student root2): a recursive method that computes the depth of a given node. 6 public int getHeight(): returns the height of a tree. -Complete the test class. to also print the height, postorder and preorder. /////////////// StudentTree class public class StudentTree { Student root; public StudentTree() { root = null; } public boolean insert(int ID, double GPA) { boolean done = false; root= insert (root,ID,GPA,done); if(done) return true; else return false; } private Student insert(Student root2, int id2,double gpa2, boolean done) { if(root2==null) { done = true; root2= new Student(id2,gpa2); } else if(id2root.getID()) { root2.right = insert(root2.right , id2,gpa2,done); } else{} return root2; } public Student find(int ID) { if(root==null) return null; Student s = find(ID,root); if(s==null) return null; else return new Student (s.getID(),s.getGPA()); } private Student find(int ID, Student root2) { Student current = root2; if (current==null) return null; else if(ID==current.getID()) return current; else current = find(ID,current.right); return current; } public void printTree() { printTree(root); } private void printTree(Student root2) { if(root!=null) { if(root2.left!=null) printTree(root2.left); if(root2.getID()==root.getID()) System.out.print("root("+root2.getID()+","+root2.getGPA()+")"); else System.out.print("("+root2.getID()+","+root2.getGPA()+")"); if(root2.right!=null) printTree(root2.right); } System.out.println(); } public boolean remove(int ID) { // Find the node and it's parent. Student current = root, parent = null; while (current != null) { if (ID > current.getID()) { parent = current; current = current.right; } else if (ID < current.getID()) { parent = current; current = current.left; } else break; } if (current == null) return false; // Removing the node // case 1 // if no children, simply delete it // //Complete the missing part ///???????????????? // case 2 // if no right child, replace with left subtree else if(current.right == null) { if(current == root) root = current.left; else if(parent.left == current) // left child of parent parent.left = current.left; else // right child of parent parent.right = current.left; } // if no left child, replace with right subtree //Complete the missing part ///???????????????? // case 3 // two children, so replace with inorder successor else { // get successor of node to delete (current) Student successor = getSuccessor(current); // connect parent of current to successor instead if(current == root) root = successor; else if(parent.left == current) parent.left = successor; else parent.right = successor; // connect successor to currents left child successor.left = current.left; } //end else two children return true; } private Student getSuccessor(Student delNode) { Student successorParent = delNode; Student successor = delNode; Student current = delNode.right; // go to right child while(current != null) { // left children successorParent = successor; successor = current; current = current.left; // go to left child } // if successor not right child, if(successor != delNode.right) { // make connections successorParent.left = successor.right; successor.right = delNode.right; } return successor; } ///////////////////////Student class public class Student { private int ID; private double GPA; Student left; Student right; public Student(int iD, double gPA) { ID = iD; GPA = gPA; left=null; right=null; } public int getID() { return ID; } public void setID(int iD) { ID = iD; } public double getGPA() { return GPA; } public void setGPA(double gPA) { if(gPA>=0 && gPA<=4) GPA = gPA; else {System.out.print("error"); GPA=0; } } public Student getLeft() { return left; } public void setLeft(Student left) { this.left = left; } public Student getRight() { return right; } public void setRight(Student right) { this.right = right; } } /////////////TreeTest class import java.util.Scanner; public class TreeTest { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub StudentTree tree = new StudentTree(); Scanner input = new Scanner (System.in); int choice; int id; double gpa; do { System.out.println("Choose from the menu:"); System.out.println("1. Insert new student"); System.out.println("2. Find a student"); System.out.println("3. Remove a student"); System.out.println("4. Print Tree inorder"); System.out.println("5. Print Tree post order"); System.out.println("6. Print Tree pre order"); System.out.println("7. Print hight"); System.out.println("8. Quit"); System.out.print("Enter your choice: "); choice=input.nextInt(); switch(choice) { case 1: System.out.println("Enter Students IDs and GPAs (-1 to stop):"); id=input.nextInt(); while(id!=-1) { gpa=input.nextDouble(); tree.insert(id,gpa); id =input.nextInt(); } break; case 2: System.out.println("Enter Students IDs to be found (-1 to stop)"); System.out.print("ID: "); id=input.nextInt(); while(id!=-1) { Student s= tree.find(id); if(s!=null) System.out.println("GPA: "); else System.out.println("Student was not found !! "); System.out.println("ID: "); } break; case 3: System.out.println("Enter Students IDs to be removed (-1 to stop)"); System.out.print("ID: "); id=input.nextInt(); while(id!=-1) { boolean result = tree.remove(id); if(result) System.out.print(id+" is removed"); else System.out.print("Error : the ID does not exist!!"); System.out.print("ID: "); } break; case 4: tree.printTree(); break; case 8: break; default: System.out.println("Invalid choice"); } System.out.println(); }while(choice!=5); } } 3993 Complete the following problems marked by a slash or as a group. Links: 1. http://postimg.org/image/3q9ncy4x7/ 2. http://postimg.org/image/7it5sokff/ 3. http://postimg.org/image/j973a2d7v/ 4. http://postimg.org/image/dz24irsyz/ Write the following program in C++. 1. http://postimg.org/image/6yk4izeih/ 3994 Complete the code below to convert any lower case ASCII charters received on USART1 to upper case. All other data should remain unchanged (i.e. only convert A????1aA????1-A????1zA????1). Additionally, every time 50 data bytes are received, these 50 bytes (in uppercase form if appropriate) should be printed to the LCD screen using lprintf(). (10 pts) Note: Assume all required .h file have been included. Note: Add any variables that you wish // Global variables // Convert lower case characters to uppercase ISR( FILL IN VECTOR NAME) { } // Each time 50 data bytes are received on USART1, print the // 50 bytes to the LCD screen using lprintf main { } 3995 Complete the appropriate graphic for each of the following scenarios. You should have 4 different graphics after completing assignment. Use Microsoft Excel or compatible package to create graphics. Paste the completed graphics into the same Word document that contains the document revision above. After each graphic, provide a short justification a s to why your graphic is the best approach--that is, why did you choose this particular graphic and why is it the most effective way of presenting the information? In 1950 there were fewer than 8 social security beneficiaries for every 100 active workers; by 1960 the number had risen to 22 per 100; by 1970 the number had risen to 29 per 100; by 1980 it had risen again to 35 per 100; by 1990 it was 38 per 100; by 2000 the number was as high as 42 per 100 3996 Complete the appropriate graphic for each of the following scenarios. You should have 4 different graphics after completing assignment. Use Microsoft Excel or compatible package to create graphics. Paste the completed graphics into the same Word document that contains the document revision above. After each graphic, provide a short justification a s to why your graphic is the best approach--that is, why did you choose this particular graphic and why is it the most effective way of presenting the information? Assume you are preparing a report on worker absenteeism in your area, which includes Section A and Section B. You uncover the following facts from your records for the past six months. Of the 50 workers you supervise in Section A, five workers never missed a day. Ten workers missed 1-3 days; 5 workers missed 4-6 days; and thirty of the workers missed more than 6 days of work. Of the 50 workers you supervise in Section B, ten workers never missed a day. Fifteen workers missed 1-3 days; twenty missed 4-6 days; and five missed more than 6 days of work. 3997 Complete the appropriate graphic for each of the following scenarios. You should have 4 different graphics after completing assignment. Use Microsoft Excel or compatible package to create graphics. Paste the completed graphics into the same Word document that contains the document revision above. After each graphic, provide a short justification a s to why your graphic is the best approach--that is, why did you choose this particular graphic and why is it the most effective way of presenting the information? On a production line there are three machines producing widgets. The production output for the last six months of these three machines was: For the month of July, machine A produced 139, machine B 222, machine C 168. For the month of August, machine A produced 175, machine B 240, and machine C 115. For the month of September, machine A produced 148, machine B 195, and machine C 145. For the month of October, machine A 205, machine B 155, and machine C 140. For the month of November, machine A produced 100, machine B 240, and machine C 50. For the month of December machine A produced 250, machine B 110, and machine C produced only 20. 3998 Complete the appropriate graphic for each of the following scenario. Use Microsoft Excel or compatible package to create graphic. After the graphic, provide a short justification a s to why your graphic is the best approach--that is, why did you choose this particular graphic and why is it the most effective way of presenting the information? The production costs for rubber manufacturing are as follows. The cost of labor at a typical US. integrated rubber manufacturing plant was approximately $120/metric ton of rubber produced; for a US. Mini rubber manufacturing plant the cost was approximately $75/metric ton of rubber produced. On the other hand, integrated rubber manufacturing plants expended approximately $100/metric ton on purchased scrap, while Mini rubber manufacturing plants spent only $20/metric ton. Energy costs for both plants were $90/metric ton 3999 Complete the appropriate graphic for the following scenario. Use Microsoft Excel or compatible package to create graphic. P After the graphic, provide a short justification a s to why your graphic is the best approach--that is, why did you choose this particular graphic and why is it the most effective way of presenting the information? Assume you are preparing a report on worker absenteeism in your area, which includes Section A and Section B. You uncover the following facts from your records for the past six months. Of the 50 workers you supervise in Section A, five workers never missed a day. Ten workers missed 1-3 days; 5 workers missed 4-6 days; and thirty of the workers missed more than 6 days of work. Of the 50 workers you supervise in Section B, ten workers never missed a day. Fifteen workers missed 1-3 days; twenty missed 4-6 days; and five missed more than 6 days of work. 4000 Complete the appropriate graphic for each of the following scenario. Use Microsoft Excel or compatible package to create graphic. After the graphic, provide a short justification a s to why your graphic is the best approach--that is, why did you choose this particular graphic and why is it the most effective way of presenting the information? In 1950 there were fewer than 8 social security beneficiaries for every 100 active workers; by 1960 the number had risen to 22 per 100; by 1970 the number had risen to 29 per 100; by 1980 it had risen again to 35 per 100; by 1990 it was 38 per 100; by 2000 the number was as high as 42 per 100 4001 Comparing Cells and Returning Value Hi I think this will be an easy one, but I can't figure it out. The first two columns below indicate methods used to fill a position. The third column indicates which method was ultimately successful. In the fourth column, I would like a formula that informs that returns the alternate method that was NOT used. So, the first row should return the value "Certification", the second "No Alternate Used" or some other null value Is this possible? Hiring Method 1 Hiring Method 2 Certification Vacancy Ultimately Filled via Transfer Certification 4002 Alternate Method? Transfer Certification Compare the pros and cons of writing a concurrent program in a multi-process vs. multi-kernel thread vs. multi-user thread style along the following axes: (i) direct overheads of context switching, (ii) indirect overheads of context switching, (iii) memory needs, (iv) pressure on the overall virtual memory system with implications for the performance of other co-located programs. How and to what extent does the use of copy-on-write (COW) based redundant page elimination help improve (iii) and (iv)? Does it have any bearing on (i) or (ii)? 4003 A common memory matching game played by young children is to start with a deck of cards that contain identical pairs. For example, given six cards in the deck, two might be labeled 1, two labeled 2, and two labeled 3. The cards are shuffled and placed face down on the table. A player then selects two cards that are face down, turns them face up, and if the cards match, they are left face up. If the two cards do not match, they are returned to their original face down position. The game continues until all cards are face up. Write a program that plays the memory matching game. Use 16 cards that are laid out in a 4 ?? 4 square and are labeled with pairs of numbers from 1 to 8. Your program should allow the player to specify the cards that he or she would like to select through a coordinate system. For example, in the following layout, 1234 1 8*** 2 **** 3 *8** 4 **** all of the face down cards are indicated by *. The pairs of 8 that are face up are at coordinates (1,1) and (2,3). To hide the cards that have been temporarily placed face up, output a large number of newlines to force the old board off the screen. Hint: Use a 2D array for the arrangement of cards and another 2D array that indicates if a card is face up or face down. Or, a more elegant solution is to create a single 2D array where each element is an object that stores both the cardA????1s value and face. Write a function that A????1shufflesA????1 the cards in the array by repeatedly select- ing two cards at random and swapping them. USE JAVA ONLY 4004 I have come to use LINQ in my every day programming a lot. In fact, I rarely, if ever, use an explicit loop. I have, however, found that I don't use the SQL like syntax anymore. I just use the extension functions. So rather then saying: from x in y select datatransform where filter I use: x.Where(c => filter).Select(c => datatransform) Which style of LINQ do you prefer and what are others on your team are comfortable with? 4005 come from a background of making MVC websites and HTML5 applications, and have recently decided to dive into the sort of stuff i wasn't taught at university, namely the things most people would learn on a computer science course. I've been reading a book on algorithms, and the first one it mentions was the Insertion Sort. I didn't really understand it the first time, but I understood the goal, so I had a crack at coming up with my own solution before reading more into the proper solution to see how close I got. I got pretty close, and here is my function in C#: int[] SortNumbersTomsVersion(int[] numbersIn) { int[] output = new int[numbersIn.Count()]; for (var i = 0; i < numbersIn.Count(); i++) { int cardsLowerThan = 0; for (var n = 0; n < numbersIn.Count(); n++) { if (numbersIn[n] < numbersIn[i]) { cardsLowerThan++; } } output[cardsLowerThan] = numbersIn[i]; } return output; } The concept of it is that, i start off with a group of numbers. Then, for each number, I compare it to all of the other numbers in the array, to see how many others are lower in value. It then takes the resulting count, and places the current number into an output array at that index. The algorithm goes through all the numbers until they are all at the same location. My question is, what makes the original better than my solution? for reference, here is the accepted algorithm outside of a function: int temp, k; for (int i = 1; i < array_size; i++) { temp = array[i]; k = i - 1; while (k >= 0 && array[k] > temp) { array[k + 1] = array[k]; k--; } array[k + 1] = temp; } 4006 Color part of the output ? I used the formula : =IF($G3<$G$2,"Not Ok : " &TEXT(G3,"#.0")&" Less than Your Max "&MAX($G$2:G3),"OK : "&TEXT(G3,"#.0")) and the output is Not Ok : 2.5 Less than Your Max 3 I need to color the numbers in the output ??? Thanks for help !! 4007 Coding Language: MIPS Write a "merge" program that merges two ordered lists of integers into a new ordered list. For example, given two ordered lists (9,6,4,1) and (7,3,2,0) as input arguments, "merge" should produce a new list (9,7,6,4,3,2,1,0) which is also ordered. Another example could be to merge (6,0,-3) and (9,5,4,0,-2) to produce (9,6,5,4,0,0,-2,-3). The "merge" program assumes that the two input lists (in decreasing order) of integers are stored in the data area. It loads the integers and merges them into an ordered list. The resulting ordered list (e.g. (9,6,5,4,0,0,-2,-3)) should be stored back into the data area. It is at your own choice how the data area (i.e. the lists) is arranged, and whether the resulting list is overwritten onto the original two lists. But be sure to give meaningful labels and clearly indicate (using label or comments) where the merged list is stored. Before your program terminates, it should print out the merged list which should be in decreasing order. do NOT implement any sorting algorithm! 4008 Coding isn't that hard actually. The hard part is to write code that makes sense, is readable and understandable. So I want to get a better developer and create some solid architecture. So I want to do create an architecture for NPCs in a video-game. It is a Realtime Strategy game like Starcraft, Age of Empires, Command & Conquers, etc etc.. So I'll have different kinds of NPCs. A NPC can have one to many abilities (methods) of these: Build(), Farm() and Attack(). Examples: Worker can Build() and Farm() Warrior can Attack() Citizen can Build(), Farm() and Attack() Fisherman can Farm() and Attack() I hope everything is clear so far. So now I do have my NPC Types and their abilities. But lets come to the technical / programmatical aspect. What would be a good programmatic architecture for my different kinds of NPCs? Okay I could have a base class. Actually I think this is a good way to stick with the DRY principle. So I can have methods like WalkTo(x,y) in my base class since every NPC will be able to move. But now lets come to the real problem. Where do I implement my abilities? (remember: Build(), Farm() and Attack()) Since the abilities will consists of the same logic it would be annoying / break DRY principle to implement them for each NPC (Worker,Warrior, ..). Okay I could implement the abilities within the base class. This would require some kind of logic that verifies if a NPC can use ability X. IsBuilder, CanBuild, .. I think it is clear what I want to express. But I don't feel very well with this idea. This sounds like a bloated base class with too much functionality. I do use C# as programming language. So multiple inheritance isn't an opinion here. Means: Having extra base classes like Fisherman : Farmer, Attacker won't work. 4009 The codebase I'm working in now has the convention of using private fields and public properties. For example, most classes have their members defined like this: // Fields private double _foo; private double _bar; private double _baz; // Properties public double Foo { get{ return _foo; } set{ _foo = value; } } public double Bar { get{ return _bar; } set{ _bar = value; } } public double Baz { get{ return _baz; } } I know these can be rewritten without their internal private properties: public double Foo{ get; set; } public double Bar{ get; set; } public double Baz{ get; private set; } I'd like some input on this: Is there a good reason to prefer the older, more explicit style over the newer, more concise one? Should I write any new classes using the concise style, or should I try to match the older code for consistency? Is consistency worth enough in this case to justify the older format? 4010 This code has to be written in c++, and full points will go to the answer that works and has the best explanation for each line of code. Write a program that prints the sum of the numbers in a two?dimensional array that are in the same row or the same column as the smallest entry of the array (including the smallest entry). (Assume that the smallest entry occurs within the array only once). The main program is to use a function that returns the row and column position of the smallest entry. Allow for arrays of up to 50 x 50 and user to input array size and array data. Be sure to show output that displays evidence that your program is working correctly. For example the array: ?1 3 ?2 0 ?4 1 0 1 0 5 ?1 2 has smallest entry ?4 and it appears in row 2 and column 1. The sum is therefore ?1 + ?4 + 0 + -4 + 1 + 0 + 1 = ?7. 4011 This is code for the Traveling Saleperson problem. I need to implement code that will also print the total length of the shortest tour then display that total distance in the output. Here is my current code, and the current matrix I am using. import java.util.InputMismatchException; import java.util.Scanner; import java.util.Stack; public class TSPNearestNeighbour { private int numberOfNodes; private Stack stack; public TSPNearestNeighbour() { stack = new Stack(); } public void tsp(int adjacencyMatrix[][]) { numberOfNodes = adjacencyMatrix[1].length - 1; int[] visited = new int[numberOfNodes + 1]; visited[1] = 1; stack.push(1); int element, dst = 0, i; int min = Integer.MAX_VALUE; boolean minFlag = false; System.out.print(1 + "\t"); while (!stack.isEmpty()) { element = stack.peek(); i = 1; min = Integer.MAX_VALUE; while (i <= numberOfNodes) { if (adjacencyMatrix[element][i] > 1 && visited[i] == 0) { if (min > adjacencyMatrix[element][i]) { min = adjacencyMatrix[element][i]; dst = i; minFlag = true; } } i++; } if (minFlag) { visited[dst] = 1; stack.push(dst); System.out.print(dst + "\t"); minFlag = false; continue; } stack.pop(); } } public static void main(String... arg) { int number_of_nodes; Scanner scanner = null; try { System.out.println("Enter the number of nodes in the graph"); scanner = new Scanner(System.in); number_of_nodes = scanner.nextInt(); int adjacency_matrix[][] = new int[number_of_nodes + 1][number_of_nodes + 1]; System.out.println("Enter the adjacency matrix"); for (int i = 1; i <= number_of_nodes; i++) { for (int j = 1; j <= number_of_nodes; j++) { adjacency_matrix[i][j] = scanner.nextInt(); } } for (int i = 1; i <= number_of_nodes; i++) { for (int j = 1; j <= number_of_nodes; j++) { if (adjacency_matrix[i][j] == 1 && adjacency_matrix[j][i] == 0) { adjacency_matrix[j][i] = 1; } } } System.out.println("the citys are visited as follows"); TSPNearestNeighbour tspNearestNeighbour = new TSPNearestNeighbour(); tspNearestNeighbour.tsp(adjacency_matrix); } catch (InputMismatchException inputMismatch) { System.out.println("Wrong Input format"); } scanner.close(); } } Then here is the matrix: -1 1075 716 792 1425 1369 740 802 531 383 811 2211 661 870 999 772 1075 -1 1015 1770 2403 1662 870 1858 941 1426 1437 3026 1486 211 1463 314 716 1015 -1 928 1483 646 390 1085 185 749 530 2034 1377 821 471 772 792 1770 928 -1 633 1089 1111 246 908 409 495 1447 1317 1565 672 1470 1425 2403 1483 633 -1 9999 1630 752 1432 9999 931 814 1938 2198 1016 2103 1369 1662 646 1089 9999 -1 820 1335 832 9999 605 1839 2030 1468 421 1419 740 870 390 1111 1630 820 -1 1224 360 965 690 2197 1480 750 630 705 802 1858 1085 246 752 1335 1224 -1 1021 442 737 1566 1190 1653 918 1558 531 941 185 908 1432 832 360 1021 -1 685 496 2088 1192 736 616 656 383 1426 749 409 9999 9999 965 442 685 -1 738 1858 1938 1221 926 1126 811 1437 530 495 931 605 690 737 496 738 -1 1631 1472 1232 188 1152 2211 3026 2034 1447 814 1839 2197 1566 2088 1858 1631 -1 2752 2824 1563 2744 661 1486 1377 1317 1938 2030 1480 1190 1192 1938 1472 2752 -1 1281 1660 1183 870 211 821 1565 2198 1468 750 1653 736 1221 1232 2824 1281 -1 1269 109 999 1463 471 672 1016 421 630 918 616 926 188 1563 1660 1269 -1 1220 772 314 772 1470 2103 1419 705 1558 656 1126 1152 2744 1183 109 1220 -1 4012 CODE ::: from tkinter import * import re, tkinter.simpledialog class main: def __init__(self): self.root = Tk() self.root.title = "Translator" self.translate = Canvas(self.root) self.translate.pack() self.entry = Entry(self.root) self.entry.pack() self.translatecommand() self.translate = Button(self.root, text = "Translate", command = self.translatecommand) self.translate.pack() self.clear = Button(self.root, text = "Clear") self.clear.pack() self.quit = Button(self.root, text = "Quit") self.quit.pack() self.label= Label(self.root, text = "TTT") self.label.pack() self.root.mainloop() def translatecommand(self): self.test = self.entry.get() main() Show transcribed image text fixing a GUI code using Python, basically Its missing some essential factors like multi-lining, essential values, and reisisbles?. it supposed to be for a text translator.. 4013 code to solve this puzzle in prolog 1. Pedro likes the Plume in CallieA????1s den. 2. DanielaA????1s favorite Plume is the one that releases eight puffs per minute. 3. Callie put the mystery-glen Plume in her living room. 4. The desert-flora Plume releases seven puffs per minute. 5. Each minute, the papaya-paradise Plume releases exactly one puff more than the Plume Renee enjoys but exactly one puff fewer than the Plume located in the bathroom. 6. Each minute, the sweet-breeze Plume releases exactly one more puff than the kitchen air freshener but fewer puffs than the Plume Tina likes. list([room(_,_,6,_),room(_,_,7,_),room(_,_,8,_),room(_,_,9,_),room(_,_,10,_)]). /* room(Room,Plume,Puffs,Guest)*/ answer(A) :- List(A), code here 4014 In the code below, there is one file with incomplete methods for the ArrayList class , you will define the parameter constructor, the getLength, getSize and clear methods. /** * Class implementing an array based list. */ public class ArrayList { /** * Default constructor. Sets length to 0, initializing the list as an empty * list. Default size of array is 20. */ public ArrayList() { list = new int[SIZE]; length = 0; } /** * Determines whether the list is empty * * @return true if the list is empty, false otherwise */ public boolean isEmpty() { return length == 0; } /** * Prints the list elements. */ public void display() { for (int i = 0; i < length; i++) { System.out.print(list[i] + " "); } System.out.println(); } /** * Adds the element x to the end of the list. List length is increased by 1. * * @param x element to be added to the list */ public void add(int x) { if (length == SIZE) { System.out.println("Insertion Error: list is full"); } else { list[length] = x; length++; } } /** * Removes the element at the given location from the list. List length is * decreased by 1. * * @param pos location of the item to be removed */ public void removeAt(int pos) { for (int i = pos; i < length - 1; i++) { list[i] = list[i + 1]; } length--; } //Implementation of methods in the lab exercise /** * Non default constructor. Sets length to 0, initializing the list as an * empty list. Size of array is passed as a parameter. * * @param size size of the array list */ public ArrayList(int size) { } /** * Returns the number of items in the list (accessor method). * * @return the number of items in the list. */ public int getLength() { return -1; } /** * Returns the size of the list (accessor method). * * @return the size of the array */ public int getSize() { return -1; } /** * Removes all of the items from the list. After this operation, the length * of the list is zero. */ public void clear() { } /** * Replaces the item in the list at the position specified by location. * * @param location location of the element to be replaced * @param item value that will replace the value at location */ public void replace(int location, int item) { } /** * Adds an item to the list at the position specified by location. * * @param location location where item will be added. * @param item item to be added to the list. */ public void add(int location, int item) { } /** * Deletes an item from the list. All occurrences of item in the list will * be removed. * * @param item element to be removed. */ public void remove(int item) { } /** * Returns the element at location * * @param location position in the list of the item to be returned * @return element at location */ public int get(int location) { return -1; } private static int SIZE = 20; //size of the array that stores the list items private int[] list; //array to store the list items private int length; //amount of items in the list } 4015 The code needs to be fixed to match the below specification: client.c: /***************************************************************** Sockets Client Program This code is a modified version taken from Nigel Horspool's "The Berkeley Unix Environment". This client connects to a specified server (host) and receives information from it. *****************************************************************/ #include #include #include #include #include #include #include #include /* Display error message on stderr and then exit. */ #define OOPS(msg) {perror(msg); exit(1);} #define MAXLINE 512 int main(int argc, char *argv[]) { struct sockaddr_in bba; /* socket information */ struct hostent *hp; int slen; int s; /* host information */ /* host computer */ /* length socket address */ int rfd; char ch[MAXLINE]; /* character for i/o */ int num_char=MAXLINE; /* number of characters */ int port; /* port to connect to */ char portnum[20]; char hostname[20]; printf("\n hostname:"); scanf("%s", hostname); printf("\n port number:"); scanf("%s", portnum); /* Clear the data structure (saddr) to 0's. */ memset(&bba,0,sizeof(bba)); /* Tell our socket to be of the internet family (AF_INET). */ bba.sin_family = AF_INET; /* Acquire the ip address of the server */ hp=gethostbyname(hostname); /* Acquire the port #. */ port=atoi(portnum); /* Copy the server's address to the socket address data structure. */ memcpy(&bba.sin_addr, hp->h_addr, hp->h_length); /* Convert the integer Port Number to the network-short standard * required for networking stuff. This accounts for byte order differences.*/ bba.sin_port=htons(port); /* Now that we have our data structure full of useful information, * open up the socket the way we want to use it. */ s = socket(AF_INET, SOCK_STREAM, 0); if(s == -1) OOPS("socket"); if(connect(s,(struct sockaddr *)&bba,sizeof(bba)) != 0) OOPS("connect"); /* read from the socket, write to the screen */ while( (num_char=read(s,ch,MAXLINE)) > 0 ) if ( write(1,ch,num_char) < num_char) OOPS("writing"); close(s); return 0; } server.c: /***************************************************************** Sockets Daemon Program This code was modified from Nigel Horspools, "The Berkeley Unix Environment". A daemon process is started on some host. A socket is acquired for use, and it's number is displayed on the screen. For clients to connect to the server, they muse use this socket number. *****************************************************************/ #include #include #include #include #include #include #include #include #include #include /* Use port number 0 so that we can dynamically assign an unused * port number. */ #define PORTNUM 0 /* Set up the location for the file to display when the daemon (okay, * server for you religious types) is contacted by the client. */ #define BBSD_FILE "./test.bbs.file" /*"/nfs/net/share/ftp/pub/class/330/test.file" */ /* Display error message on stderr and then exit. */ #define OOPS(msg) {perror(msg); exit(1);} #define MAXLINE 512 int main() { struct sockaddr_in saddr; struct hostent *hp; char hostname[256]; socklen_t slen; /* socket information */ /* host information */ /* host computer */ /* length socket address */ int s; /* socket return value */ int sfd; /* socket descriptor returned from accept() */ char ch[MAXLINE]; FILE *sf; /* character for i/o */ /* various file descriptors */ int bbf; int num_char=MAXLINE; /* * Build up our network address. Notice how it is made of machine name + port. */ /* Clear the data structure (saddr) to 0's. */ memset(&saddr,0,sizeof(saddr)); /* Tell our socket to be of the internet family (AF_INET). */ saddr.sin_family = AF_INET; /* Aquire the name of the current host system (the local machine). */ gethostname(hostname,sizeof(hostname)); /* Return misc. host information. Store the results in the * hp (hostent) data structure. */ hp = gethostbyname(hostname); /* Copy the host address to the socket data structure. */ memcpy(&saddr.sin_addr, hp->h_addr, hp->h_length); /* Convert the integer Port Number to the network-short standard * required for networking stuff. This accounts for byte order differences.*/ saddr.sin_port = htons(PORTNUM); /* * Now that we have our data structure full of useful information, * open up the socket the way we want to use it. */ s = socket(AF_INET, SOCK_STREAM, 0); if(s == -1) OOPS("socket"); /* Register our address with the system. */ if(bind(s,(struct sockaddr *)&saddr,sizeof(saddr)) != 0) OOPS("bind"); /* Display the port that has been assigned to us. */ slen = sizeof(saddr); getsockname(s,(struct sockaddr *)&saddr,&slen); printf("Socket assigned: %d\n",ntohs(saddr.sin_port)); /* Tell socket to wait for input. Queue length is 1. */ if(listen(s,1) != 0) OOPS("listen"); /* Loop indefinately and wait for events. */ for(;;) { /* Wait in the 'accept()' call for a client to make a connection. */ sfd = accept(s,NULL,NULL); if(sfd == -1) OOPS("accept"); /* Open our file for copying to the socket. */ bbf = open(BBSD_FILE, O_RDONLY); if(bbf == -1) write(sfd,"No information, dude.\n", strlen("No information, dude.\n")); else { /*Read from file, write to socket*/ while((num_char=read(bbf,ch,MAXLINE))> 0) if (write(sfd,ch,num_char) < num_char) OOPS("writing"); close(bbf); } close(sfd); } return 0; } 4016 CODE MUST WORK WITH JAVA ECLIPSE AND MUST BE COMPATIBLE WITH DRIVER AND FILE Lab 08 Tree of Integers! Objective: Trees sure are neat. LetA????1s take this slow and simple and make a tree of integers. Down load this file, the driver file, and fill in the code to create a tree of integers. The class IntBSTree is given fill in the following methods insert: This method returns nothing and takes in an integer value that is then placed as a new node in the tree based on the binary tree properties. A reminder values greater than the parent go to the right subtree and values smaller go to the left subtree. Also it may be a good idea to use a recursive method in order to place these values. printInorder: This method which returns nothing and has no parameters prints the in order traversal of the tree. For in order traversal each left subtree must be visited, then the value is printed out, and finally each of the right subtrees is visited. It is a good idea to make a recursive method to assist with this. Also if done correctly in-order traversals print out each of the integers in ascending order. getDepth: The depth of a node is the number of edges from the root to that number. This method returns nothing and takes in a parameter corresponding to the integer value of a node whose depth is returned. If the value is not in the tree a -1 should be returned. Again a recursive helper method may be useful to solve this. Correct Print Out: Int BST Tester! Creating tree Populating Tree with values Testing insertion by in-order traversal 1 2 3 4 5 6 7 8 9 10 Getting depth of 6 4 Getting depth of 14 -1 __________________________________________________ FILE: public class IntBSTree{ private class Node { private int data; private Node leftChild; private Node rightChild; public Node(int aData) { this.data = aData; this.leftChild = null; this.rightChild = null; } } private Node root; public IntBSTree() { root = null; } public void insert(int data) { //Code this } public void printInorder() { //Code this } public int getDepth(int value) { //Code this } } ___________________________________ File Driver: import java.util.*; public class IntBSTreeTester { public static void main(String[] args) { // TODO Auto-generated method stub System.out.println("Int BST Tester!"); System.out.println("Creating tree"); IntBSTree testTree = new IntBSTree(); System.out.println("Populating Tree with values"); int[] valArr = {4,8,10,2,1,7,3,5,9,6}; for(int i : valArr) { testTree.insert(i); } System.out.println("Testing insertion by in-order traversal"); testTree.printInorder(); System.out.println("Getting depth of 6"); System.out.println(testTree.getDepth(6)); System.out.println("Getting depth of 14"); System.out.println(testTree.getDepth(14)); } } 4017 I have this code in matlab that I would like to convert into maple syntax: % Solve v'(t)=-0.0207v(t)^2-893.58 with y0=0 clc; y0 = 0; % Initial Condition h = 0.1; % Time step t = 0:h:5; % t goes from 0 to 5 seconds. vstar = zeros(size(t)); % Preallocate array (good coding practice) vstar(1) = y0; % Initial condition gives solution at t=0. for i=1:(length(t)-1) k1 = 0.0207*vstar(i)^2-893.58; % Previous approx for y gives approx for derivative vstar(i+1) = vstar(i) + k1*h; % Approximate solution for next value of y end figure(1) plot(t,vstar); y0 = 0; % Initial Condition h = 0.05; % Time step t = 0:h:5; % t goes from 0 to 5 seconds. vstar = zeros(size(t)); % Preallocate array (good coding practice) vstar(1) = y0; % Initial condition gives solution at t=0. for i=1:(length(t)-1) k1 = 0.0207*vstar(i)^2-893.58; % Previous approx for y gives approx for derivative vstar(i+1) = vstar(i) + k1*h; % Approximate solution for next value of y end figure(2) plot(t,vstar); 4018 How to code this macro? I would like to know on how to remove number within a string using macro. CharOnly("32AB43") return AB Does anyone have any suggestions? Thanks in advance for any suggestions In cell A1, 32AB43 should be return AB in cell B1 In cell A2, sfe2323h should be return sfeh in cell B2 In cell A3, 4632g6k should be return gk in cell B3 Thanks for help !! 4019 A or a E or e M or m Code department Accounting Electronics marketing All other code display: Invalid code write an application that prompts the user for one of the department code. when you type in the code the department name should be display You can use ethier the canner or JOptionpane classes to call in the department code and display the result . Do not mix the two classes, that is, do part of the problem using the scanner class and part of the problem using the JoptionPane class You must use switch statement to get the correct message. Below is message I got when I entered E as my input 4020 Have you considered a career as an enterprise architect? What bundle of courses would you put together to design a major or a track in enterprise architecture? Break into small groups with your cl 4021 solve this assignment Attach 4021 4022 Can someone please help me with this assignment Attach 4022 4023 Can someone please help me with this assignment 4024 Assessment item 2ModellingValue:15%Due date:28-Aug-2015Return date:18-Sep-2015Submission method optionsAlternative submission method Task Overview of business case: Alive & Boating (A&B) is a small start-up company that sells small boats in Wagga. A&B keeps its models in several showrooms across the city. At this stage customers cannot view the available models online so to order they must visit one of the showrooms. A&B has been using an Excel spreadsheet to track their business activities; however, this has caused many redundancies and inefficiency. With view to their expanding business and under the new management, they decided to investigate the option of implementing a database system. Accordingly, they hired you to design a relational database to better track and record their operational data. A&B business rules and instructions for creating your ERD: 1. A&B can get boats from several different manufacturers. Each manufacturer produces one or more different types of boats. Each and every type is produced by only one manufacturer. Every manufacturer is identified by a manufacturer code. The company name, street, city, state, postcode, phone number, and account number are kept in the  system for every manufacturer. For each type, the type name (i.e. Paddle, Inflatable, Jet Ski, etc.) and purpose (i.e. fishing, day boating, etc.) are kept in the system. Create an ERD that represents the entities, attributes, the relationships between entities, and the cardinality and optionality of each relationship that are described by this business rule 2. Every type has one or more models. Every model is produced as part of a type. For each model, the model number, engine, length, beam, suggested retail price, A&B retail  price and dry weight must be kept in the system. Add the entities, attributes, the relationships between entities, and the cardinality and optionality of each relationship that are described by this business rule to the same copy of the ERD that you created for business rule 1. 3. Each type’s models are stored in a specific warehouse. Each warehouse stores the models of only one type. Each warehouse is identified by a warehouse ID. For each  warehouse address, postcode, phone number are kept in the system. Add the entities, attributes, the relationships between entities, and the cardinality and optionality of each relationship that are described by this business rule to the same copy of the ERD that you created for business rule 1 and business rule 2. NOTE Use Flow Chart Maker & Online Diagram Software (https://www.draw.io) to create your ERD Use Crows Foot notations Any M:N relationship is to be resolved to a 1:M relationship Manually drawing the ERD is NOT acceptable. Rationale This assessment item is designed to test your understanding of basic database design and modelling concepts, and your ability to interpret business rules into an Entity Relationship Diagram. Additionally, your ability to apply correct relationships, cardinalities, optionalities, and the use of Crows Foot modelling notations are tested. Marking criteria The marking criteria for this assignment is: Task HD DI CR PS Create an ERD that represents the The ERD accurately identifies and The ERD identifies and entities, attributes, the relationships and correctly shows all entities, correctly shows all entities, PKs, correctly shows most entities, PKs, shows some entities, PKs, between entities, and the PKs, attributes, relationships, attributes, relationships, and attributes, but some of the attributes, but most of the cardinality and optionality of each associative entities (if associative entities (if applicable) relationships, associative entities (if relationships, cardinalities relationship that are described by applicable), cardinalities and but some of the cardinalities and applicable), cardinalities and and optionalities are the three business rules optionalities optionalities are incorrect optionalities are incorrect incorrect 4025 The ERD accurately identifies Imagine you are part of an IT team managing a college's computer labs. Set up a User Access and Rights Review document that details the following:  Frequency of the review  Implications if lapsed accounts are detected  Who performs the review  Appeals process if a user disagrees with the findings 4026  The ERD accurately identifies and Based on the readings and your research, draw an entity relationship diagram (ERD) for a patient admission system given the following: Whenever new patients are seen for the first time, they complete a patient information form that asks their name, address, phone number, and insurance carrier, all  of which are stored in the patient information file. Patients can be signed up with only one carrier, but they must be signed up to be seen by the doctor.  Each time a patient visits the doctor, an insurance claim is sent to the carrier for payment.  The claim must contain information about the visit, such as the date, purpose, and cost. It would be possible for a patient to submit two claims on the same day. Use MS Visio to create the diagrams, copy and paste into a MS word document. 4027 In APA format with proper citation and references, complete the following:As you begin to perform the information systems audit for PVSS, assume the identity of a different person in the scenario. For this Discussion Board, you are now the Network Systems Manager for PVSS.  As the Network Systems Manager, how would you create the following four controls (or policies) to be used by PVSS: Entity level control  Network level control  Operating system level control  Web or database server level control Keep in mind that each control should focus on a specific topic and offer the following structure:  The Policy Statement:This is a statement defining the specific action or regulation.  Responsibilities: Who is responsible for various actions?  Enforcement: How the policy will be validated?  Violations: What are the consequences for violation? Grading Rubric: Discussion Topic Points The creation of the 4 controls/policies 80 Quality of writing:  Grammar 10  APA format  Use at least 2 credible sources Responses:  A minimum of 2  They added value to the discussion 10 In your own words, post a substantive response to the Discussion Board question(s) and comment on other postings. Your response should address the DB question(s) and move the conversation forward. You will be graded on the quality of your postings, including mastery of the concept as well as critical thinking. If asked for your opinion, do not simply state that it is a good or bad idea; elaborate on your reasons and argument. Include enough detail to substantiate your thinking as well as your position on the questions or comments. 4028 Any device that is connected to a network is called a a) client b) node c) server d) manager 4029 What is .net 4030 Can the value of a checksum be all Os (in binary)? Defend your answer 4031 Define a class Publication which has a title. Derive two classes from it – a class Book whichhas an accession number and a class Magazine which has volume number. With these two asbases, derive the class Journal. Define a function print() in each of these classes. Ensure thatthe derived class function always invokes the base(s) class function. In main() create a Journalcalled IEEEOOP with an accession number 681.3 and a volume number 1. Invoke the print()function for this object. 4032 How do COTS software products differ from custom software applications? Describe the differences and give an example of each. 4033 Term Paper: Students’ Self-Service Website for Mobile Devices Disclaimer: This is a hypothetical interaction design example. The university has made no accouchements or commitments to a project of this nature. In order to provide a convenient self-service solution for students to access personal and course-related material, Cappela University would like develop a mobile Web application that runs on an iPhone, iPad, Droid, Blackberry, and other mobile devices. Students are currently able to use the Internet Explorer, Chrome, Firefox, and other desktop browsers to perform self-service tasks. The university has asked you to provide a Human-Computer Interaction (HCI) guide that will help with the design and implementation of this service. Write a ten to fifteen (10-15) page term paper that can help the university achieve its objective. The paper must address the following topics: Information Gathering 1. Describe the following: a. The purpose and goals of the mobile self-service. b. The target audience. c. The audience needs and wants. d. The resources that will be required to achieve the desired output. Design Strategy 2. Describe each of the following. a. The design of the Website for mobile devices. b. The interfaces that are applicable to the mobile devices. 3. Design each of the following using Microsoft Visio or any open source wireframing or mockup tool. Note: The graphically depicted solution is not included in the required page length. a Thehttp://icampus.cappela.edu home page for a mobile device. b.. The self-service Web page to enroll in your courses using mobile device. Prototyping 4. Write a proposal to the University including the following: a. The prototypes that could be created. b. The type of usability testing to use in determining the design that will provide the best user experience. c. The type of evaluation methods to use in determining the design that will provide the best user experience. Implementation 5. Provide details of how the mobile self-service will be implemented on the various mobile devices. Note: Keep in mind that the university already provides a self-service Website for non-mobile students. Maintenance and Growth 6. Elaborate on the guidelines for how the self-service Website can be kept current as newer mobile devices are being introduced at a rapid rate. 7. Use at least three (3) quality resources in this assignment. Note: Wikipedia and similar Websites do not qualify as quality resources.  Your assignment must follow these formatting requirements: Be typed, double-spaced, using Times New Roman font (size 12), with one-inch margins on all sides; citations and references must follow APA or school-specific  format. Check with your professor for any additional instructions. Include a cover page containing the title of the assignment, the student’s name, the professor’s name, the course title, and the date. The cover page and the reference page are not included in the required assignment page length. The specific course learning outcomes associated with this assignment are:  Describe the differences in developing user interfaces for different application environments.  Compare and contrast the different types of interactive environments.  Use technology and information resources to research issues in human-computer interaction.  Write clearly and concisely about human-computer interaction topics using proper writing mechanics and technical style conventions. Attach 4033 4034 The base application consists of five classes: FederationHire, HireLocation, Vehicle, Booking and Client. (PROVIDED IN THE FILE). identify bad smell and refactor. 4035 Write a code segment that will analyze a numeric value provided by the user to determine if he or she is short, average height, or tall. Make sure to include the following in your code: · Display the message "Please enter your height in feet.” to the user. · Use the ReadLine() method to obtain a value from the user. · Use the Parse() method to convert the user’s value to an appropriate data type for numeric comparisons. · Check to be sure the user entered a value greater than or equal to 0.0 and less than or equal to 8.0. · Use ElseIf statements to determine whether a user is short, average or tall. An input value of 0 up to but not including 5.0 feet is considered short. An input value of 5.0 up to but not including 6.0 feet is considered average height. Any height greater than or equal to 6.0 is considered tall 4036 Write a C program that will illustrate the equivalence between (a) Shifting a binary number to the left n bits and multiplying the binary number by 2". (b) Shifting a binary number to the right n bits and dividing the binary number by 2n (or equivalently, multiplying the binary number by 2-"). Choose the initial binary number carefully, so that bits will not be lost as a result of the shifting operation. (For the shift left, choose a relatively small number so that there will be several leading zeros in the leftmost bit positions. For the shift right, choose a relatively large number, with zeros in the rightmost bit positions.) 4037 If you have a pc, identify some situation in which you can take advantages of its multitasking capabilities 4038 If you have a PC, identify some situations in which you can take advantage of its multitasking capabilities. 4039 If you have a PC, identify some situations in which you can take advantage of its multit 4040 Consider the following task set, where the numbers in parenthesis are the release time, execution time, and priority (the higher the number the higher the priority). Draw a schedule diagram for the five tasks from time 0 through 20 (use timelines below) using a) the NPCS protocol, b) priority inheritance, and c) the priority ceiling protocol. For each task, its corresponding critical section starts 1 time unit after the task started executing. Each nested critical section starts 1.5 time units after the begin of the previous critical section. Task i Parameters Resources 1 (7,3,5) requires resource R1 for 1 time unit 2 (5,3,4) requires resource R2 for 1 time unit 3 (4,2,3) requires no resources 4 (2,6,2) requires resource R1 for 4 and resource R2 for 1.5 time units (nested) 5 (0,6,1) requires resource R2 for 4 time units 4041 How to do it Attach 4041Suppose that the traffic to be carried on a link has mean rate 2.5 Mbit/s and standard deviation (of the rate, measured over an appropriate time interval) 3 Mbit/s. The available equipment for carrying this traffic has capacity one of: 1 Mbit/s, 2 Mbit/s, 10 Mbit/s, 20 Mbit/s, 50 Mbit/s, 150 Mbit/s, 600 Mbit/s, 2.4 Gbit/s, 10 Gbit/s, or 40 Gbit/s. 4042 We talk about (professionalism and ethics in computing) The topic have many points where it is part of the project , I want you to focus on : Begin by comparing how ‘professional’ and ‘professionalism’ are different. In details , Explain the importance of good communications skills for IT professionals and evaluate ways in which IT managers can promote professionalism amongst their IT staff. Base your evaluation on an analysis of established techniques and how/why they are effective. There are very important notes: Support all of your work with at least three scholarly sources. However, if you include a reference at the end of your essay you also need to use that reference in your work (by way of a citation.) I mentioned this last week as well. Please do not use bullet points (numbers) in your list of references. Please do alphabetize your list of references." the references should be written in Harvard style. It is very important for my instructor to be scholarly the plagiarism should not be more than 10 %. the solution is about 600 words without references words. Please, I wantSANDRA BERNHARD to solve my question. 4043 is to explore what ‘professionalism and ethics’ means and how it applies to computing in general. You will do so with a group that was assigned to you by Day 4 of Week 2. For this week, however, your focus is on analysing topics such as the difference between having professionalism and being professional; the behaviours of IT professionalism; communication skills; and the promotion of professionalism. analyses professionalism as it applies to computing. Begin by comparing how ‘professional’ and ‘professionalism’ are different. With the nuances of these terms in mind, analyse behaviours that can be considered indicative of IT professionalism and explain why. Additionally, explain the importance of good communications skills for IT professionals and evaluate ways in which IT managers can promote professionalism amongst their IT staff. Base your evaluation on an analysis of established techniques and how/why they are effective. Support all of your work with at least three scholarly sources. Understanding professionalism 1. Overview of Professionalism and Ethics and place in computing 2. Professionalism and being professional 3. Behaviours of IT professionalism 4. Communication skills and Promotion of professionalism < Owner: Shaimaa Ismail> Consider Group Project Brief Begin by comparing how ‘professional’ and ‘professionalism’ are different. With the nuances of these terms in mind, analyse behaviours that can be considered indicative of IT professionalism and explain why. Additionally, explain the importance of good communications skills for IT professionals and evaluate ways in which IT managers can promote professionalism amongst their IT staff. Base your evaluation on an analysis of established techniques and how/why they are effective. Support all of your work with at least three scholarly sources. We talk about (professionalism and ethics in computing) The topic have many points where it is part of the project , I want you to focus on : Begin by comparing how ‘professional’ and ‘professionalism’ are different. In details , Explain the importance of good communications skills for IT professionals and evaluate ways in which IT managers can promote professionalism amongst their IT staff. Base your evaluation on an analysis of established techniques and how/why they are effective. There are very important notes: Support all of your work with at least three scholarly sources. However, if you include a reference at the end of your essay you also need to use that reference in your work (by way of a citation.) I mentioned this last week as well. Please do not use bullet points (numbers) in your list of references. Please do alphabetize your list of references." the references should be written in Harvard style. It is very important for my instructor to be scholarly the plagiarism should not be more than 10 %. the solution is about 600 words without references words. Please, I wantSANDRA BERNHARD to solve my question. 4044 refer to the uploaded file for all details Attach 4044 4045 i want u guys to the homework assignment 1 with extra credit part the deadline on 29/8/2015 at 9pm Attach 4045 4046 A friend has recently started a business that has a large amount of intellectual property that he wants to ensure is kept secure and confidential. He plans to hire 75- 100 employees within the next 18 months and is preparing to build his systems infrastructure across three (3) locations: one (1) primary headquarters and two (2) small satellite offices. All three (3) locations will occupy one (1) entire floor of a multitenant building. Your friend has asked your opinion regarding major technology choices that he must make for his business, such as operating systems, mobile devices, cloud services, and wireless networking. Write a six to ten (6-10) page paper in which you: 1. Analyze the security features of Linux, Macintosh, and Windows operating systems, and decide which you believe is the most susceptible to hackers based on hacking techniques and attack vectors. Justify your response. 2. Discuss the primary security concerns surrounding USB and other portable devices, and prioritize the major risks that your hypothetical friend must consider based on the level of potential harm the identified security concern may cause. 3. Take a position on whether you believe a network with wireless access points and clients, or a predominantly wired network, is more susceptible to a network attack. Suggest the tools that you would use to penetrate a wireless network in comparison to a network without wireless access points. Justify your response. 4. Consider the use of cloud providers to allow for access to data for employees and potential clients. Examine the general security concerns for cloud-based solutions, and validate whether or not you would consider the use of a cloud provider an optimal solution for this scenario. 5. Describe what you believe to be the most effective attack against mobile computing devices, and choose one (1) tool that a hacker could use to carry out this attack. Support your response with related examples of the chosen tool in use. 6. Recommend the minimum physical and technical controls for protecting the company’s intellectual property from both internal and external threats. Provide a rationale for your response. 7. Consider the tools explored throughout the course, and suggest what you believe to be the three (3) most useful tools for a hacker to utilize. Justify your response. 8. Design a floor plan of each of the three (3) offices. Include locations of data center(s), telecommunication closet(s), end-user areas, conference rooms, networking equipment, security controls, etc. Use the graphical tools in Microsoft Visio or an open source alternative such as Dia. Note: The graphically depicted solution is not included in the required page length. 9. Use at least three (3) quality resources in this assignment. Note: Wikipedia and similar Websites do not qualify as quality resources. Your assignment must follow these formatting requirements:  Be typed, double spaced, using Times New Roman font (size 12), with one-inch margins on all sides; citations and references must follow APA or school-specific  format. Check with your professor for any additional instructions. Include a cover page containing the title of the assignment, your name, the professor’s name, the course title, and the date. The cover page and the reference  page are not included in the required assignment page length. Include charts or diagrams created in Visio or an equivalent such as Dia. The completed diagrams / charts must be imported into the Word document before the paper is submitted. The specific course learning outcomes associated with this assignment are:  Discuss the concepts of ethical hacking, different types of hacking, and penetration testing techniques.  Explain and apply various hacking technologies and features that administrators deploy to protect their networks.  Review system (Linux and Mac OS X) and networking device hacking techniques and vulnerabilities.  Summarize wired and wireless networking devices and standards, including routers, cables, firewalls and access points, as well as the methods of hacking.  Explain physical security and its associated challenges.  Use technology and information resources to research issues in ethical hacking.  Write clearly and concisely about topics related to Perimeter Defense Techniques using proper writing mechanics and technical style conventions. 4047 1. Write a two to four (2-4) page paper in which you: Analyze the SQL injection steps that Susan used that enabled her to access the E-shopping4u.com database. 2. Describe at least two (2) tools that Susan could have used to assist her in the attack described within the case example, and suggest the key benefits that the chosen tools provide hackers. Justify your response. 3. Examine the critical manner in which different database systems (e.g., Oracle, MySQL, or Microsoft SQL Server-based, etc.) can play a significant role in the SQL injection attack steps. 4. Suggest at least two (2) security controls that E-shopping4u.com could have implemented in order to mitigate the risks of SQL injection. Further, determine whether or not you believe Susan’s attack would have been successful if such security controls were in place. 5. Use at least three (3) quality resources in this assignment. Note: Wikipedia and similar Websites do not qualify as quality resources. Your assignment must follow these formatting requirements:  Be typed, double spaced, using Times New Roman font (size 12), with one-inch margins on all sides; citations and references must follow APA or school-specific  format. Check with your professor for any additional instructions. Include a cover page containing the title of the assignment, the student’s name, the professor’s name, the course title, and the date. The cover page and the reference page are not included in the required assignment page length. The specific course learning outcomes associated with this assignment are:  Summarize the manner in which database servers and applications are compromised and examine the steps that can be taken to mitigate such risks (e.g., SQL injection).  Use technology and information resources to research issues in ethical hacking.  Write clearly and concisely about topics related to Perimeter Defense Techniques, using proper writing mechanics and technical style conventions. 4048 1. 1) What are the key elements of a Disaster Recovery Plan? Why is a Disaster Recovery Plan critical to business operations? 2. 2) What steps are involved in developing a Business Continuity Plan? Why is a Business Continuity plan important? 100 words or more, Plagiarism free please. 4049 1. 1) Below is some information on FHSS: •Part of the Original 802.11 Standard •Uses Clause 14 Radios •Functions in the 2.4 GHz Spectrum •Uses 79 Frequencies from 2.402 - 2.480 GHz •More Resilient in the Presents of a Fixed Noise Source •Low Throughput and Data Rates •Pre September 2000 75 Hops were required •Post September 2000 15 Hops Could be used but with Greatly Reduced Power Settings •Dwell Time = Time on one Frequency •Hop Time = Time to move from one Frequency to Another Does anyone want to tackle Direct Sequence Spread Spectrum? 1. 2. 2) There are numerous types of wireless attacks that are covered in the text. Below is a list of the main attacks that are discussed. Let's discuss each attack by choosing two to discuss. When choosing which type to discuss, make sure it has not been chosen by a fellow student. This way we can hopefully cover them all. •Rogue Wireless Devices •Peer-to-Peer Attacks •Eavesdropping •Encryption Cracking •Authentication Attacks •MAC Spoofing •Management Interface Exploits •Wireless Hijacking •Denial of Service (DoS) •Vendor Specific Attacks •Social Engineering 50 words or more, Plagiarism free please. 4050 need help in this project Attach 4050 4051 A business company wants to computerize some of the job processes currently preformed manually by its employees. You are hired as an Interface design professional to come up with a user interface. You have been given limited information about employee job functions. You do know that there are three departments and each has at least two primary functions. Create your project plan for providing a preliminary prototype to present to management. 4052 There are assignment description word file and codes in the assignment1 folder. can you please help me out. Attach 4052 4053 Dear Sir/Madam, I have Programming C++ Assignment Question SIT172 - Programming for Engineers Assignment Only (3) Due 10 September, 2015 9:00 PM I have attached Helpful information for this assignment 3. · Solution for assignment 1 · Solution for assignment 2 · Data and Code to be used for this assignment 3 are attached. Using Visual Studio for PC,Inside the Visual C++ option, we want to select a Win32 Console Application. Thanks, Regards, Osaman Attach 4053 4054 if you have a PC, identify some situations in which you can take advantage of its multitasking capabilities 4055 Refer this article http://www.pcworld.com/article/126093/article.html I need this lab done. do send all deliverable. Attach 4055 4056 need help in this project Attach 4056 4057 Show how the floating point value (1/16) would be stored using IEEE-754 single precision (be sure to indicate the sign bit, the exponent, and the significand fields)3. Charles Sturt University (CSU) has opened an IT Doctorate study in Sydney Study Centre. The applicant should have a master degree in IT or a master degree in electrical engineering. 4058 Discuss the types of privileges at the account level and those at the relation level. 4059 refer to the uploaded file for all details Attach 4059 4060 i want u guys to the homework assignment 1 with extra credit part the deadline on 29/8/2015 at 9pm Attach 4060 4061 A friend has recently started a business that has a large amount of intellectual property that he wants to ensure is kept secure and confidential. He plans to hire 75- 100 employees within the next 18 months and is preparing to build his systems infrastructure across three (3) locations: one (1) primary headquarters and two (2) small satellite offices. All three (3) locations will occupy one (1) entire floor of a multitenant building. Your friend has asked your opinion regarding major technology choices that he must make for his business, such as operating systems, mobile devices, cloud services, and wireless networking. Write a six to ten (6-10) page paper in which you: 1. Analyze the security features of Linux, Macintosh, and Windows operating systems, and decide which you believe is the most susceptible to hackers based on hacking techniques and attack vectors. Justify your response. 2. Discuss the primary security concerns surrounding USB and other portable devices, and prioritize the major risks that your hypothetical friend must consider based on the level of potential harm the identified security concern may cause. 3. Take a position on whether you believe a network with wireless access points and clients, or a predominantly wired network, is more susceptible to a network attack. Suggest the tools that you would use to penetrate a wireless network in comparison to a network without wireless access points. Justify your response. 4. Consider the use of cloud providers to allow for access to data for employees and potential clients. Examine the general security concerns for cloud-based solutions, and validate whether or not you would consider the use of a cloud provider an optimal solution for this scenario. 5. Describe what you believe to be the most effective attack against mobile computing devices, and choose one (1) tool that a hacker could use to carry out this attack. Support your response with related examples of the chosen tool in use. 6. Recommend the minimum physical and technical controls for protecting the company’s intellectual property from both internal and external threats. Provide a rationale for your response. 7. 8. Consider the tools explored throughout the course, and suggest what you believe to be the three (3) most useful tools for a hacker to utilize. Justify your response. Design a floor plan of each of the three (3) offices. Include locations of data center(s), telecommunication closet(s), end-user areas, conference rooms, networking equipment, security controls, etc. Use the graphical tools in Microsoft Visio or an open source alternative such as Dia. Note: The graphically depicted solution is not included in the required page length. 9. Use at least three (3) quality resources in this assignment. Note: Wikipedia and similar Websites do not qualify as quality resources. Your assignment must follow these formatting requirements:  Be typed, double spaced, using Times New Roman font (size 12), with one-inch margins on all sides; citations and references must follow APA or school-specific  format. Check with your professor for any additional instructions. Include a cover page containing the title of the assignment, your name, the professor’s name, the course title, and the date. The cover page and the reference  page are not included in the required assignment page length. Include charts or diagrams created in Visio or an equivalent such as Dia. The completed diagrams / charts must be imported into the Word document before the paper is submitted. The specific course learning outcomes associated with this assignment are:  Discuss the concepts of ethical hacking, different types of hacking, and penetration testing techniques.  Explain and apply various hacking technologies and features that administrators deploy to protect their networks.  Review system (Linux and Mac OS X) and networking device hacking techniques and vulnerabilities.  Summarize wired and wireless networking devices and standards, including routers, cables, firewalls and access points, as well as the methods of hacking.  Explain physical security and its associated challenges.  Use technology and information resources to research issues in ethical hacking.  Write clearly and concisely about topics related to Perimeter Defense Techniques using proper writing mechanics and technical style conventions. 4062 1. Write a two to four (2-4) page paper in which you: Analyze the SQL injection steps that Susan used that enabled her to access the E-shopping4u.com database. 2. Describe at least two (2) tools that Susan could have used to assist her in the attack described within the case example, and suggest the key benefits that the chosen tools provide hackers. Justify your response. 3. Examine the critical manner in which different database systems (e.g., Oracle, MySQL, or Microsoft SQL Server-based, etc.) can play a significant role in the SQL injection attack steps. 4. Suggest at least two (2) security controls that E-shopping4u.com could have implemented in order to mitigate the risks of SQL injection. Further, determine whether or not you believe Susan’s attack would have been successful if such security controls were in place. 5. Use at least three (3) quality resources in this assignment. Note: Wikipedia and similar Websites do not qualify as quality resources. Your assignment must follow these formatting requirements:  Be typed, double spaced, using Times New Roman font (size 12), with one-inch margins on all sides; citations and references must follow APA or school-specific  format. Check with your professor for any additional instructions. Include a cover page containing the title of the assignment, the student’s name, the professor’s name, the course title, and the date. The cover page and the reference page are not included in the required assignment page length. The specific course learning outcomes associated with this assignment are:  Summarize the manner in which database servers and applications are compromised and examine the steps that can be taken to mitigate such risks (e.g., SQL injection).  Use technology and information resources to research issues in ethical hacking.  Write clearly and concisely about topics related to Perimeter Defense Techniques, using proper writing mechanics and technical style conventions. 4063 1. 1) What are the key elements of a Disaster Recovery Plan? Why is a Disaster Recovery Plan critical to business operations? 2. 2) What steps are involved in developing a Business Continuity Plan? Why is a Business Continuity plan important? 100 words or more, Plagiarism free please. 4064 1. 1) Below is some information on FHSS: •Part of the Original 802.11 Standard •Uses Clause 14 Radios •Functions in the 2.4 GHz Spectrum •Uses 79 Frequencies from 2.402 - 2.480 GHz •More Resilient in the Presents of a Fixed Noise Source •Low Throughput and Data Rates •Pre September 2000 75 Hops were required •Post September 2000 15 Hops Could be used but with Greatly Reduced Power Settings •Dwell Time = Time on one Frequency •Hop Time = Time to move from one Frequency to Another Does anyone want to tackle Direct Sequence Spread Spectrum? 1. 2. 2) There are numerous types of wireless attacks that are covered in the text. Below is a list of the main attacks that are discussed. Let's discuss each attack by choosing two to discuss. When choosing which type to discuss, make sure it has not been chosen by a fellow student. This way we can hopefully cover them all. •Rogue Wireless Devices •Peer-to-Peer Attacks •Eavesdropping •Encryption Cracking •Authentication Attacks •MAC Spoofing •Management Interface Exploits •Wireless Hijacking •Denial of Service (DoS) •Vendor Specific Attacks •Social Engineering 50 words or more, Plagiarism free please. 4065 need help in this project Attach 4065 4066 A business company wants to computerize some of the job processes currently preformed manually by its employees. You are hired as an Interface design professional to come up with a user interface. You have been given limited information about employee job functions. You do know that there are three departments and each has at least two primary functions. Create your project plan for providing a preliminary prototype to present to management. 4067 There are assignment description word file and codes in the assignment1 folder. can you please help me out. Attach 4067 4068 Dear Sir/Madam, I have Programming C++ Assignment Question SIT172 - Programming for Engineers Assignment Only (3) Due 10 September, 2015 9:00 PM I have attached Helpful information for this assignment 3. · Solution for assignment 1 · Solution for assignment 2 · Data and Code to be used for this assignment 3 are attached. Using Visual Studio for PC,Inside the Visual C++ option, we want to select a Win32 Console Application. Thanks, Regards, Osaman Attach 4068 4069 if you have a PC, identify some situations in which you can take advantage of its multitasking capabilities 4070 Refer this article http://www.pcworld.com/article/126093/article.html I need this lab done. do send all deliverable. Attach 4070 4071 need help in this project Attach 4071 4072 Show how the floating point value (1/16) would be stored using IEEE-754 single precision (be sure to indicate the sign bit, the exponent, and the significand fields)3. Charles Sturt University (CSU) has opened an IT Doctorate study in Sydney Study Centre. The applicant should have a master degree in IT or a master degree in electrical engineering. 4073 Discuss the types of privileges at the account level and those at the relation level. 4074 no plagiarism Attach 4074 4075 Design a bidirectional algorithm for stop and wait arq using piggybacking note that both the parties need to use the same algorithm 4076 need before 31st Attach 4076 4077 You have been asked to give a presentation to a law school class on digital crime. After the presentation, a student asks why so few people are actually prosecuted for computer crime when these crimes seem to be happening all the time. Give a five-point outline of your response to this question. Assess the impact on preventing crimes from your perspective given these issues. 4078 (TCOs 5 and 11) What basic PC maintenance tasks or software do you consider to be important for your PC? Please list and describe three maintenance tasks or software and why they are important. 4079 · Comment on any significant TCP flags and what they mean in the context of the packet capture. Significant flags include SYN, FIN, RST, and URG. You must explain why the flag has been set and what it means for this TCP connection. · Comment on the direction of each packet (ie. client -> server or server -> client). Be clear to explain in which direction the interaction is occurring. · Comment on each SMTP command and response between the client and the server. You must explain what each command does. You should also explain the data that is exchanged. This will require that you study the SMTP RFC or other Internet documents relating to SMTP to understand what the commands mean. You should also comment on the 2 port numbers used in this connection and their significance. For example, is it an ephemeral or reserved port? If it is a reserved port, what protocol does it relate to? 4081 Say that you sign up for something online and it requires you to input some personal information (name, address, phone number, etc.). Who now owns those data? It is personal data about you, so do you own it? Does the website that collected the data from you own it? Some say that the owner is whoever owns the database within which the data is stored, while still others say no one owns personal data. This quandary is one of the most significant concerns when it comes to data protection in general. Of course, the personal data examples given are fairly innocuous, but what about your financial, medical and credit information? What about consumer information (e.g. spending habits)? The privacy and security of much of these data is of paramount importance to most people, once again raising the question of ownership. For this Discussion, evaluate the ownership of personal data in regards to information such as medical, credit, personal, financial and consumer data. To complete this Discussion: Post: Create an initial post in which you take a position on the ownership of personal data. To begin, identify the potential owners of this information and analyse how and why they could be considered owner to someone’s personal data. Based on your analysis, evaluate who owns the data about a particular person in regards to medical, credit, personal, financial and consumer information. 4082 The volume of data circulating the Internet is astronomical, and amongst these data are troves of personal information gathered from HTML forms, emails, Google searches and so on. In many cases, the information is relatively ordinary and harmless (e.g. a name or address), but other forms of personal information can be considered ‘sensitive data’. This includes things like ethnic origin, political opinions, medical conditions, financial data and more. In order to protect such data, several countries have enacted ‘Data Protection Acts’ to guard against information loss, misuse and/or theft. Consider for a moment the country within which you reside. What sorts of data protection acts or laws exist there? How effective do you think they are at protecting sensitive information? For this Discussion, research one of these acts along with a type of organisation where data protection is important (e.g. banking, health care, education, etc.). Analyse at least 3-4 potential violations of your selected act within your selected organisation type and recommend countermeasures to mitigate its likeliness to occur. To complete this Discussion: Post: Create an initial post in which you analyse an act within your country with the purpose of protecting data. Focus on how your selected act protects data. Analyse a type of organisation of your choosing (e.g. banking, health, etc.) and identify at least 3-4 violations of data protection that could occur (e.g. disclosure of patient data, disclosure of employee information, etc.) and how the violations might occur. Based on your analyses, evaluate the likelihood of at least one of your noted violations occurring and recommend countermeasures to reduce that likelihood. Explain why you selected that violation to discuss. 4083 assignment Attach 4083 4084 Assgment Attach 4084 4085 Create a hypothetical organization with details including geographic location(s), number of employees in each location, primary business functions, operational and technology details, potential threats to the business and its technology, and anything else that you believe is relevant to the business. Assume this organization is lacking in its contingency planning efforts and requires assistance in ensuring these efforts are appropriately addressed to increase its overall security and preparedness posture. Write a five to six page paper in which you: 1. Provide an overview of the organization and indicate why contingency planning efforts are needed and how these efforts could benefit the business. 2. Develop a full contingency plan for the organization. Include all subordinate functions / sub plans, including BIA, IRP, DRP, and BCP efforts. 3. Determine the policies and procedures that would be needed for all contingency planning efforts. Detail the role of the policy / procedure, and explain how each would help achieve the goals of these efforts. 4. Detail the processes to utilize in order to fully implement the contingency plan and its components, and explain the efforts to consider in maintaining the plans. 5. Create a hypothetical incident scenario where the contingency planning efforts would need to be utilized and detail: A. How the plan is sufficiently equipped to handle the incident. B. a timeline for the incident response and recovery efforts. 6. Identify any ethical concerns that are specific to this organization and its incident response personnel (especially the CP Team Leader), and explain how to plan for these concerns. 7. Use at least five (5) quality resources in this assignment. Note: Wikipedia and similar Websites do not qualify as quality resources. 4086 You have been hired as the CIO of a large multinational Internet advertising company. The president of the company is entertaining a major new software development project to keep track of advertising revenues. She asked you to prepare a report on the current and future state of software development and testing for this advertising company so that she can make an educated decision on how to proceed with the new development. The goal is to have a loosely coupled, Java-based platform for this Web-based company. Use the Library of your choice to conduct research about software development and testing. Write a five or six page paper in which you: 1. Define and explain, in your own words, the primary challenge(s) of software development projects. 2. Compare and contrast at least three (3) different software development methods. 3. Explain why the testing of software products is of great importance. 4. Provide a graphical depiction of your solution through the use of Microsoft Visio or its open source alternative, Dia.Note: The graphically depicted solution is not included in the required page length. 5. Identify potential ethical issues that may arise as a result of the company doing business across several different countries and cultures, and recommend ways to mitigate these challenges. 6. Compare and contrast at least three (3) testing approaches to software development. 7. Use at least four (4) quality resources in this assignment.Note: Wikipedia and similar Websites do not qualify as quality resources 4087 Copy and paste your question here... Attach 4087 4088 Apple iPads continue to be successful. The Samsung Galaxy Tab is one (1) of iPad’s competitors. Use the Internet and Strayer Library to research the advantages and disadvantages of these devices and to determine if they are comparable. Research the features of both tablets, such as the operating systems used and their capabilities 4089 Write a method, reverseDigit, that takes an integer as a parameter and returns the number with its digits reversed. For example, the value of reverseDigit(12345) is 54321. 4090 In this assignment, you will apply your learning from Weeks 2 and 3 about setting up a business Website. Using the South University Online Library or the Internet, research about the Website user interface. Now let's consider a scenario. A business company wants to computerize some of the job processes currently preformed manually by its employees. You are hired as an Interface design professional to come up with a user interface. You have been given limited information about employee job functions. You do know that there are three departments and each has at least two primary functions. Create your project plan for providing a preliminary prototype to present to management. 4091 1. What is the ICD classification system? 2. Describe the major HMIS standards of HL7 and DICOM, including the similarities and differences between the two. 3. How would an organization go about adopting a major HMIS standard such as HL7 or DICOM? In at least 250 words 4092 How would an organization go about adopting a major HMIS standard such as HL7 or DICOM? 4093 Changes made to the system to reduce the future system failure chances is called 4094 What is the purpose of a mixer? Include a discussion of sidebands in your answer. 4095 please read ubuntu.docx as the question & Assign2Concept is the instruction for the answer. The Solution MUST follow the instruction Attach 4095 4096 You have been awarded the contract to create the web site for an international conference. The conference is titled Seventeenth International Theraphosidae Workshop The conference is to be held in the city of Rio de Janeiro from March 21 to 25, 2016. This conference is expected to attract Theraphosidae (Tarantula) experts from around the world. Some of the broad topics of the workshop are: · Dwindling ecosystems · Adaptive survival traits in a changing environment · How Theraphosidae are perceived in the broader community · Theraphosidae as a valuable protein source for humanity The conference organisers want their site in four parts: 1. A program page that lists the sessions over the five days of the conference. This page will also list the invited speakers of the conference—providing a picture of each speaker and the title of the talk they will be giving. There should also be a session timetable. 2. An accommodation page. A page listing the suggested hotels for the conference attendees to stay at while at the conference. Prices should be quoted on this page. 3. A tourist page outlining all the things that a visitor to the area can do while not at the conference. 4. The site-map section. Normally this would be a simplified list of the main sections of the site or search facilites—all as an aid to navigation. For these assignments the site-map section will be used by the student as a site-map for the marker—with links to required elements, discussion of the site and reference links for downloaded elements. Assignment One The first assignment is to set up the basic structure of the web site.Assignment Two will add extra features to the basic structure of Assignment One. Please keep in mind the requirements ofAssignment Two when designing your site for Assignment One. Site Design The site should be broken up into a number of section: · There should be an entrance page to the site. This should be simple but convey the purpose of the site clearly. · From the entrance or welcome page there should be links to the major sections of the site. o The conference program section. o The accommodation section. o The tourist section. o The site-map section to be used by the student to document the solution for the marker. Required elements must appear in the other sections of the site as well as being documented and linked to in this section. · Each main section of the site should consist of a minimum of two pages. Page Design · The design of individual pages must be consistent across the site. This means ALL pages (the site-map section as well). Required elements must be included in the site in a consistent way and be relevant to the page they are on. · You should attempt to apply the ideas discussed in Chapter 5 (Web Design) of the Study Book andWeb Design and Usability Guidelines. The design ideas you attempted to include into your site should be discussed in the site-map section with references to the ideas in Chapter 5 andWeb Design and Usability Guidelines. This discussion should be of order 300 words. · Simple and clear navigation elements must be part of each page's design. These elements should allow the visitor to navigate around the site without any effort. · Your overall page design should be done using CSS positioning or float properties only. As browsers are notconsistent in their implementation of CSS commands you must use either the Firefox browser or a Firefox clone such as Iceweasel to test your site as Firefox will be the browser used to mark your assignment. Required Tasks and Elements The following required elements must be included in the site in a consistent way and be relevant to the pages they are in. Images Transparent Logo · A conference logo should appear on every page. The image for the logo should have a transparent background. · Step by step instructions should be provided in the site-map documentation section for creating the transparent logo. · A link in the site-map documentation section to the logo using the ID attribute of the image element. Image Map · Include a Client Side image map. · Step by step instructions should be provided in the site-map documentation section for creating the image map. · One possibility for a relevant image map could be a local map outlining tourist destinations or accomodation with links to pages describing the destination or accomodation. · A link in the site-map documentation section to the image-map using the ID attribute of the image element. XHTML Code · Your pages should be written in well formed XHTML. The use of the utilitytidy is encouraged · Always use the appropriate XHTML element if it exists—do not over-use div and span elements. · All links should work. All links should be relative - that is they should NOT contain o A machine name, or o start with a slash, and o the XHTMLbase element should not be used. The assignment will be unpacked on different machine, on a different file-system and all links must work. To ensure that all links on your pages are relative try the following. o Start your web browser and load the assignment top page using theOpen File pull down menu item. This will load the page directly off disk into the browser. Now check that no links are broken. Do not have your server running when you do this. Relative links should NOT contain a server name or start with a / (slash)! · Consider XHTML code to be similar to any traditional code, e.g., C, C++ &c. As such, pay attention to your coding style, e.g., your code should: o Be simple and elegant. o Always use the appropriate XHTML element (not div or span only) o Be documented, e.g., comments near the top of each document and on major sections of the document. (be aware that HTML comments should not appear at the very top of a document as it can cause IE to have conniptions). o Have meaningful class/id attribute names. o Have an appropriate layout, e.g., consistent indentation and use of white space. · Write all the pages as XHTML or HTML and use the programtidy to convert your HTML into XHTML or correct your XHTML. Cascading Style Sheets · CSS3 style elements can be used but must be the style elements that work under Firefox (or Iceweasel) · All default style changes to XHTML elements— such as, font changes, text colours, background colours, background images, &c.— should be modified using style sheets only. XHTML elements should not be modified by using deprecated HTML attributes. For example, do not use the deprecated attributes of the BODY element to change the background colour. · Do not use style commands needlessly—creating a class name when an XHTML element already exists that could do the task · Effort is expected to be taken with the style of the site via CSS— half a dozen minor changes to text or element backgrounds is not enough. · Consider CSS code to be similar to any traditional code, e.g., C, C++ &c. As such, pay attention to your coding style, e.g., your code should: o Be simple and elegant, o Be documented, e.g., comments at top of each document and on major sections, o Use meaningful id and class names, o Have an appropriate layout, e.g., consistent indentation and use of white space. o Modularity, reuse and visibility, e.g., appropriate choice of CSS style rules and selectors, e.g., single use of user defined IDs. Printer CSS · Provide a Monochrome Printer style sheet to allow the user to print the XHTML page without wasting paper. E.g., the print preview of your web page should not include any navigational table of contents, unnecessary borders, colours, images, &c. Standards · Your site should use W3C standard XHTML and CSS only. The addition of extra features via Javascript or any other technology will be ignored—unless they do not work and interfere with site navigation or page layout then marks will be lost. · This assignment must work on a machine running Debian GNU/Linux using the supplied copy of Iceweasel (A Firefox clone) as the browser. Browsers are not consistent in their implementation of CSS. To save you effort, this assignment does not need to work on any other browser. Documentation Some specific requirements for the documentation have been provided earlier for individual Required items. Additional, generic requirements for the documentation are provided below. · Descriptions with examples from your site of all the Required items (e.g., transparent logo, and image map). · The actual use of the Required Items (e.g., transparent logo and image map) are all linked to with a NAME anchor. · Include links to all (non-XHTML) source code files in the documentation, e.g., CSS files. · Describe the purpose of the major and any complex sections of your CSS code. For example, discuss the page layout aspects of your CSS code. If you have used CSS3 commands be sure to mention the fact. Do not bother to discuss minor aspects such as colours, and fonts. · You may use text and images from the Internet — but be sure to cite the URL sources in the site-map documentation section with links back to the image or text in the main section (us the ID attribute to tag downloaded material). Marking Scheme: Transparent Logo 10 Image Map 10 Working XHTML, unbroken and clearly defined links, ease of navigation 25 Used CSS for Style and Page Formatting 20 Cascading Style Sheet for Printing 5 Overall design and discussion, style, standards and consistency 20 Documentation 10 Maximum 4097 There are assignment description word file and codes in the assignment1 folder. can you please help me out. Attach 4097 100 4098 I need this ppt refernce slide is must. Attach 4098 4099 Task 1. What does a filter do and why is one needed in a radio system? [3 marks] 2. What is the purpose of a mixer? Include a discussion of sidebands in your answer. [3 marks] 3. Compare and contrast the multiplexing techniques TDMA and FDMA in the area of wireless networking? [4 marks] 4. A local engineering group ask you to present the merits of different antenna, such as dish, yagi, and horn antennas. Research these technologies in details and pay specific attention to how they are used as well their strengths and weakness. Provide an opinion regarding which antenna types will become the dominant players in the future of medium- and long-distance wireless links. Please submit power point slides in your answer. [6 marks] Rationale  The assignment questions are designed to assess students' ability to analyse wireless networking concepts and their applications in real life situations;  analyse and describe wireless signalling techniques and radio frequency communications;  investigate and evaluate various wireless networking protocols and standards;  compare and contrast different wireless networks technologies; 4100 hi i have attached 3 topic u need to read and write 400-500 words about each topics with referenceses in apa style Attach 4100 4101 hii need u to fulfill all the specifications which are given assignment uploaded.The deadline is August 27th before midnight. and also tell me how much it cost? thanks. Attach 4101 4102 there are two attachments first one is the questions and the second one is the case study. Attach 4102 4103 Please check the attached file. Attach 4103 4104 Explain aggregation operation of ER diagram. 4105 refer to question PPSub040815_285389_12. So i need you to do activity journals for me, it separate to 4 journals. i am distant student i have to finish it all by myself no group or team. this is detail of the journal, You need to submit four individual activity journals in weeks 3, 6, 9 and 12. You must use this standard template to write and format your journals. Each Activity Journal worths 2% of total course marks. What you need to submit In your journal entry, make sure to address the questions and issues in the form of Reflections, Group discussions, Resources, Problem Analysis and What next. ps. please find attach file for criteria and template. Attach 4105 4106 develop the class polynomial. The internal representation of a polynomial is an array of terms 4107 A technician testing a logic circuit sees that the output of a particular INVERTER is stuck LOW while its input is pulsing. List as many possible reasons as you can for this faulty operation. 4108 A technician testing a logic circuit sees that the output of a particular INVERTER is stuck LOW while its input is pulsing. List as many possible reasons as you can for this faulty operation. 4109 disaster recovery plan for ANBA 4110 A local engineering group ask you to present the merits of different antenna, such as dish, yagi, and horn antennas. Research these technologies in details and pay specific attention to how they are used as well their strengths and weakness. Provide an opinion regarding which antenna types will become the dominant players in the future of medium- and long-distance wireless links. Please submit power point slides in your answer. 4111 Compare and contrast the multiplexing techniques TDMA and FDMA in the area of wireless networking? 4112 2. What is the purpose of a mixer? Include a discussion of sidebands in your answer. 4113 2. What is the purpose of a mixer? Include a discussion of sidebands in your answer. [3 marks] 4114 i juist want to know these assignment file answers Attach 4114

Computer Science 2

Rating

Date

Size

Views

Categories

Share

Transcript

Hands-on Project 3-1

Lunch selections

Calculate Miles Per Gallon

Forgot your password?.