Computer Science Questions

You are running an Amazon EC2 instance and want to store data in an attached resource. Your data is temporary and will not be kept long term. Which resource should you use?

Which service should an admin use to register a new domain name with AWS?

Which AWS service provides infrastructure security optimization recommendations?

What is the value of having AWS cloud services accessible through an Application programming interface (API)?

Where can a customer go to get more detail about EC2 billing activity that took place 3 months ago?

Which of the following is a benefit of Amazon Elastic Compute Cloud over physical servers?

What tool can display distribution of AWS spending?

A company needs to know which user was responsible for terminating several EC2 instances, where can the customer find this info?

A disaster recover strategy on AWS should be based on launching infrastructure in separate what?

What AWS feature enables a user to manage services through a web-based interface?

How can the AWS management console be secured against unauthorized access?

Which service allows an admin to create and modify AWS user permissions?

Which service allows for the collection and tracking of metric for AWS services?

What is the responsibility of the aws customer according to the shared security model?

Which example supports the cloud design principle "design for failure and nothing will fail"?

Which AWS service automates infrastructure provisioning and administrative tasks for an analytical data warehouse?

A Linked Lists can contain duplicate elements (True or False)?

1. Give examples (outside of computer science) of each of the followingstructures: list, stack, queue, and tree.2. Summarize the distinction between lists, stacks, and queues.3. Suppose the letter A is pushed onto an empty stack, followed by the lettersB and C, in that order. Then suppose that a letter is popped off thestack and the letters D and E are pushed on. List the letters that would beon the stack in the order they would appear from top to bottom. If a letteris popped off the stack, which letter will be retrieved?4. Suppose the letter A is placed in an empty queue, followed by the lettersB and C, in that order. Then suppose that a letter is removed from thequeue and the letters D and E are inserted. List the letters that would bein the queue in the order they would appear from head to tail. If a letteris now removed from the queue, which letter will it be?5. Suppose a tree has four nodes A, B, C, and D. If A and C are siblings andD's parent is A, which nodes are leaf nodes? Which node is the root?

Show how the array below would be arranged in main memory whenstored in row major order.Figure 8.19 A procedure for printing a linked listprocedure PrintList (List)CurrentPointer head pointer of List.while (CurrentPointer is not NIL) do(Print the name in the entry pointed to by CurrentPointer;Observe the value in the pointer cell of the List entrypointed to by CurrentPointer, and reassign CurrentPointerto be that value.)5 3 74 2 81 9 62. Give a formula for finding the entry in the ith row and jth column of atwo-dimensional array if it is stored in column major order rather thanrow major order.3. In the C, C, Java, and C# programming languages, indices of arraysstart at 0 rather than at 1. Thus the entry in the first row, fourth column of an array named Array is referenced by Array[0][3]. In this case,what address polynomial is used by the translator to convert references ofthe form Array[i][j] into memory addresses?4. What condition indicates that a linked list is empty?5. Modify the procedure in Figure 8.19 so that it stops printing once a particular name has been printed.6. Based on the technique of this section for implementing a stack in a contiguous block of cells, what condition indicates that the stack is empty?7. Describe how a stack can be implemented in a high-level language interms of a one-dimensional array.8. When a queue is implemented in a circular fashion as described in thissection, what is the relationship between the head and tail pointers whenthe queue is empty? What about when the queue is full? How can onedetect whether a queue is full or empty?

1. Suppose the machine language described in Appendix C has been extendedas suggested at the end of this section. Moreover, suppose register 8 containsthe pattern DB, the memory cell at address DB contains the pattern CA, andthe cell at address CA contains the pattern A5. What bit pattern will be inregister 5 immediately after executing each of the following instructions?a. 25A5b. 15CAc. D5082. Using the extensions described at the end of this section, write a completemachine language routine to perform a pop operation. Assumethat the stack is implemented as shown in Figure 8.12, the stack pointeris in register F, and the top of the stack is to be popped into register 5.3. Using the extensions described at the end of this section, write a programto copy the contents of five contiguous memory cells starting ataddress A0 to the five cells starting at address B0. Assume your programstarts at address 00.4. In the chapter, we introduced a machine instruction of the form DR0S.Suppose we extended this form to DRXS, meaning "Load register R with thedata pointed to by the value in register S plus the value X." Thus the pointerto the data is obtained by retrieving the value in register S and then incrementingthat value by X. The value in register S is not altered. (If register Fcontained 04, then the instruction DE2F would load register E with the contentsof the memory cell at address 06. The value of register F wouldremain 04.) What advantages would this instruction have? What about aninstruction of the form DRTS—meaning "Load register R with the datapointed to by the value in register S incremented by the value in register T"?