Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Dynamic Programming Articles
Page 10 of 14
How to verify a JSON response body using Assertions in Rest Assured?
We can verify the JSON response body using Assertions in Rest Assured. This is done with the help of the Hamcrest Assertion. It uses the Matcher class for Assertion.To work with Hamcrest we have to add the Hamcrest Core dependency in the pom.xml in our Maven project. The link to this dependency is available in the below link −https://mvnrepository.com/artifact/org.hamcrest/hamcrest-coreWe shall send a GET request via Postman on a mock API, observe the Response.Using Rest Assured, we shall verify the value of the Location in the Response body.Code Implementationimport org.hamcrest.Matchers; import org.testng.annotations.Test; import static io.restassured.RestAssured.given; import io.restassured.RestAssured; public class NewTest { ...
Read MoreUploading file to S3 using Rest Assured multipart.
We can upload files to S3 using Rest Assured multipart with the help of the below techniques −Rest Assured has the default URL encoding feature. The issue with S3 URLs is that they contain special characters such as %2A, %3D. As the URL encoding feature is configured to true value by default in Rest Assured, we are required to set it to false so that the special characters are not transformed to ASCII equivalent value during runtime.Syntax −given().urlEncodingEnabled(false)Rest Assured appends a default charset to the content. This causes a problem if the content type is not given. In some scenarios, ...
Read MoreHow to parameterize tests with multiple data sets using Rest Assured?
We can parameterize tests with multiple data sets using Rest Assured. Using data providers we can execute a single test case in multiple runs. To know more about TestNG data providers visit the below link −https://www.tutorialspoint.com/testng/testng_parameterized_test.htmThis technique can be used for dynamic payloads. For this, we shall create a Java class containing the payload.Then in the second Java class (having the implementation of the POST request), we shall pass the dynamic fields of the payload as parameters to the request body.Please find the project structure for the implementation below.Code Implementation in NewTest.javaimport org.testng.annotations.DataProvider; import org.testng.annotations.Test; import static io.restassured.RestAssured.*; import io.restassured.RestAssured; ...
Read MoreHow to create a project with Cucumber and Rest Assured dependencies?
We can create a project with Cucumber and Rest Assured dependencies. This can be done by following the below steps −Step 1 − Create a Maven project. The details on how to create a Maven project is discussed in detail in the below link −https://www.tutorialspoint.com/maven/index.htmStep 2 − Add the following dependencies in the pom.xml file in a project for Cucumber.Cucumber JVM - Java dependencyCucumber JVM - JUnit dependencyhttps://mvnrepository.com/artifact/io.cucumber/cucumber-junitStep 3 − Add the following dependencies in the pom.xml file in the project for Rest Assured.Rest Assured dependencyhttps://mvnrepository.com/artifact/io.rest-assured/rest-assuredJackson Databind dependencyhttps://mvnrepository.com/artifact/com.fasterxml.jackson.core/jacksondatabind
Read MoreRod Cutting
A rod is given of length n. Another table is also provided, which contains different size and price for each size. Determine the maximum price by cutting the rod and selling them in the market.To get the best price by making a cut at different positions and comparing the prices after cutting the rod.Let the f(n) will return the max possible price after cutting a row with length n. We can simply write the function f(n) like this.f(n) := maximum value from price[i]+f(n – i – 1), where i is in range 0 to (n – 1).Input and OutputInput:The price ...
Read MoreShortest Common Super Sequence
Shortest common super-sequence is a sequence where each element of both of the given sequences is present. In other words, we can say that the given two strings, both are sub-sequence of Shortest Common Super-Sequence.When there are no common characters in two strings, then we can simply concatenate them to get Super-sequence. But when they have some common characters, then firstly we have to find the longest string, then add extra characters of the other string.Input and OutputInput: Two strings. “ABCDEF” and “XYDEF” Output: The length of the shortest common super-sequence. Here the super-sequence is “ABCDEFXY”. So the length is ...
Read MoreUgly Numbers
Ugly numbers are those number whose prime factors are 2, 3 or 5. From 1 to 15, there are 11 ugly numbers 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15. The numbers 7, 11, 13 are not ugly because they are prime. The number 14 is not ugly because in its prime factor the 7 will come.In this program, we will try to find the nth ugly number.Input and OutputInput: Take the term number. Say it is 10 Output: The 10th ugly number is 12AlgorithmgetUglyNumbers(n)Input: The number of terms.Output: Find nth Ugly numbers.Begin define array named ...
Read MoreWord Wrap Problem
A sequence of words is given, there is a limit on the number of characters for each line. By putting line breaks, in such a way that lines are printed clearly.The lines must be balanced, when some lines have lots of extra spaces and some lines are containing a small number of extra spaces, it will balance them to separate lines. It tries to use the same number of extra spaces to make them balanced.This algorithm will produce how many words can be placed in one line, and how many lines are needed.Input and OutputInput: The length of words for ...
Read MoreWeighted Job Scheduling
A list of different jobs is given, with the starting time, the ending time and profit of that job are also provided for those jobs. Our task is to find a subset of jobs, where the profit is maximum and no jobs are overlapping each other.In this algorithm, we use a table to store the results of sub-problems and using the results of subproblems, the whole problem can be solved in a bottom-up manner.The time complexity of this algorithm is O(n^2), but we can change it to O(n Log n) by using a binary search method to search con-conflicting jobs.Input ...
Read MoreMinimum Number of Jumps Problem
In this problem, a list of positive integers is given. Each integer is denoting that how many maximum steps that can be made from the current element. Starting from the first element, we have to find the minimum number of jumps to reach the end item of the list.For the dynamic programming approach, a jumps array is defined to store the minimum number of jumps required. Like for a value of jumps[i], it indicates that how many minimum jumps are needed to reach the ith index of the array from the 0th index.Input and OutputInput: A list of integers. {1, ...
Read More