**Build a node express server with a GET endpoint for a "greetings" resource that takes a parameter :name and responds with a text greeting. E.g.: GET Igreetings/VenturX Should return: "Hello, VenturX!" Then, contenarize the server using Docker and deploy it somewhere (ideally Aws, but anywhere it can be accessed it's fine). You should provide both the link to the deployed instance and a link to the github repo where the solution is stored. We'll evaluate: • The strict adherence to the above specifications • The cleanliness of both your application code and your docker image The application's handling of edge cases: sending no parameters, sending null or undefined as a parameter, sending code or regex as a parameter and sending or " as a parameter (feel free to handle and document other parameters on top of those) • How easy it is to run the application**

Build a node express server with a GET endpoint for a "greetings" resource that takes a parameter :name and responds with a text greeting. E.g.: GET Igreetings/VenturX Should return: "Hello, VenturX!" Then, contenarize the server using Docker and deploy it somewhere (ideally Aws, but anywhere it can be accessed it's fine). You should provide both the link to the deployed instance and a link to the github repo where the solution is stored. We'll evaluate: • The strict adherence to the above specifications • The cleanliness of both your application code and your docker image The application's handling of edge cases: sending no parameters, sending null or undefined as a parameter, sending code or regex as a parameter and sending or " as a parameter (feel free to handle and document other parameters on top of those) • How easy it is to run the application

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

PP 13.3 Make a new version of the LinkedStack class that includes a fake record at the beginning of the list. PP 13.4 Create a basic graphical programme that allows a user to execute push, pop, and peek operations on a stack and displays the resulting stack in a text area (using toString).
Write a Java program that creates and maintains a binary search tree (BST) whose nodes are student records. Each student record (BST node) contains the student's id (String), name (String) and GPA (float). Use the student id as a key for the BST. The program starts with an empty BST and offers the following menu options to the user repeatedly until the user selects the 'Q' option (quit). A: Add a new student record to the BST. Here the user is prompted to enter the new student’s id, name and GPA. The program should display an error message if the student id already exists in the BST. F: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the program displays the student id, name and GPA, otherwise the program displays an error message. D: Delete a student record. Here the user is prompted to enter the id of the student record to be deleted. The program should display an error message if the student id is not found in the BST. P:…
How did you decide to handle the possibility of queue underflow in java? A. Assume as a precondition that it will not occur. B. Provide an isEmpty operation so a client can prevent underflow. C. Ignore it. D. Throw a QueueUnderflowException if it occurs. E. Throw a QueueUnderflowException if it occurs, and provide an isEmpty operation so a client can prevent underflow
Create a class Queue that implements the functionality of a queue providing all the requiredoperations (Enqueue(), Dequeue(), is_Empty(), is_Full(),display() , getFront(), getRare()).
JAVA please Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Code provided in the assignment ItemNode.java:
Create a class named CustomerITD, the tests in this class will not be hard coded, instead, the main method creates a LinkedQueue and give the user a list of operations they can perform on the linked queue like, enqueue, dequeue, peekFront, contains, display, size, isEmpty and display. The serviceNumber for the first customer added to the queue should be a 4-digit random number and increments for each new customer. Test your ITD by adding, removing and performing other operations on the Linked Queue. On the next page, I'm showing an example of the ITD usage. This is just an example of how the ITD should look like. Remember, the Customer ITD is a separate class you have to create, you are free to add any methods to that class in order to create the ITD.
Write a Java Program to do the following: Create a LinkedList object and store 5 different Double objects Using a Listlterator do the following: a. Print all data stored in LinkedList object in FORWARD and BACKWARD direction.
The ADT stack lets you peek at its top entry without removing it. For some applications of stacks, you also need to peek at the entry beneath the top entry without removing it. We will call such an operation peek2. If the stack has more than one entry, peek2 returns the second entry from the top without altering the stack. If the stack has fewer than two entries, peek2 throws an exception. Write a linked implementation of a stack class call First_Last_LinkStack.java that includes a method peek2
Complete the following code. The goal is to implement the producer-consumer problem. You are expected to extend the provided C code to synchronize the thread operations consumer() and producer() such that an underflow and overflow of the queue is prevented. You are not allowed to change the code for implementing the queue operations, that is the code between lines 25 and 126 as shown in the Figure below. You must complete the missing parts between lines 226-261 as shown in the screenshot.
1. Write linked list classes (one class for Node and another class for List), which store the items in the transaction. 2. Test the classes by printing the items in the linked list 3. Show the total price of the transaction. 4. Delete an item from the linked list and show new output (total price of the transaction). The following listing is the shmple output foryour reference: BC Items Price 10 Pagoda Gnut 110g 11 Hup Seng Cream Cracker 4.19 12 Yit Poh 2n1 Kopi-o 13 Zoelife SN & Seed 3.49 7.28 5.24 14 Gatsby S/FO Wet&Hard 15 GB W/G U/Hold 150g 16.99 6.49 Total (GST Incl.) 43,68
1. Show the ListStackADT<T> interface 2. Create a ListStackDataStrucClass<T> with the following methods: defaultconstructor, overloaded constructor, copy constructor, getTop, setTop,isEmpty, ifEmpty (if empty throw the exception), push, peek, pop, toString. 3. Create a private inner class of ListStack<T> called StackNode<T> with thefollowing methods: default constructor, overloaded constructor, copyconstructor, getValue, getNext, setValue, setNext 4. Create a BaseConverter class (non-generic) with the following methods: defaultconstructor, inputPrompt, convert [converts a BaseNumber to a convertedString], convertAll [instantiate a String object] , toString, processAndPrint 5. Create a private inner class BaseNumber. The inner class has the following methods: default constructor, overloaded constructor, getNumber, getBase,setNumber, setBase. [Make your private instance variables in the inner classLong type]. 6. Create a BaseConverterDemo class that only…
Add Boolean instance variables to indicate whether a node pointer is a thread or regular pointer. You may not add any additional pointers to BSTNode. The whole idea of threads is that they take advantage of unused BSTNode pointers and thereby reduce the binary tree’s wasted overhead. Add setter/getter methods to access the Boolean instance variables or modify existing setters/getters as necessary.