Q. Can you write a code to search for number 5 in 7 3 6 8 2 9 5 4? A. The code below uses the linear search algorithm. The linear search algorithm’s two advantages are simplicity and the ability to search either sorted or unsorted one-dimensional arrays. … Read...
Q. How to create a LinkedList from scratch A. Adding Removing Step 1: The node that stores the data and the reference to the next Node. … Read more ›...
Cobertura is a free code coverage tool, which calculates the percentage of Java code accessed by unit tests.
Step 1: The pom.xml file with the relevant reporting plugins. The properties also shown to set the coverage percentage and to skip code coverage or not.
…
Q1 How will you go about monitoring your Java application for potential performance or memory issues? A1 1. Visual VM for monitoring Java memory, CPU, threads, etc VisualVM is a visual tool integrating several command-line JDK tools and lightweight profiling capabilities. Designed for both production and development time use, …...
Q1. What is a multi-tenant architecture? A1. A “tenant” in cloud computing is a single customer or to be more specific a group of users who share a common access with specific privileges to the software instance. … Read more ›...
Q1. Can you write a function to determine if a given string input is a palindrome? A palindrome is a word or sentence that reads the same forward as it does backward. For example, the terms “racecar”, “dad”, “madam” and the name “Hannah”. The longest palindromic substring of “bananas” …...
This tutorial focuses on testing data access logic with spring-test and hsqldb. This extends Part #2: JPA Hibernate Spring Maven Eclipse Tutorial – JPA configs and repository Testing the mapping of entities managed by hibernate and wiring up of JPA, Hibernate, etc via Spring. Schema and mock data similar to...
4 Part practical design concept series Part 1: Abstraction | Part 2: Single Responsibility Principle | Part 3: Open Close Principle | Part 4: Dependency Inversion Principle. … Read more ›...
4 Part practical design concept series Part 1: Abstraction | Part 2: Single Responsibility Principle | Part 3: Open Close Principle | Part 4: Dependency Inversion Principle. … Read more ›...
4 Part practical design concept series Part 1: Abstraction | Part 2: Single Responsibility Principle | Part 3: Open Closed Principle | Part 4: Dependency Inversion Principle. … Read more ›...
4 Part practical design concept series Part 1: Abstraction | Part 2: Single Responsibility Principle | Part 3: Open Close Principle | Part 4: Dependency Inversion Principle. … Read more ›...
Here are the basic steps as to how I set up “passing” project using maven & eclipse for the coding exercises. If you are using other IDEs or command line approach then you can ignore this prerequisite. Just create the relevant packages and copy the classes in the passing the test exercises.
…
Q. Complete the following “DataProcessingImpl.java” class ….. so that the unit tests shown below pass?
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
package com.passing.unittests; public class DataProcessingImpl implements DataProcessing { public String getContents(String path) { return null; } public String getSortedByFirstName(String input) { return null; } public String getSortedByLastName(String input) { return null; } public String getSortedByYear(String input) { return null; } } |
Following unit tests fail. You need to implement the logic to pass these tests.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 |
package com.passing.unittests; import org.junit.Assert; import org.junit.Before; import org.junit.Test; public class DataProcessingTest { private static final String PATH = "src/test/java/employees.txt"; private DataProcessing dp = null; @Before public void init() { dp = new DataProcessingImpl(); } @Test public void testGetContents() { String contents = dp.getContents(PATH); Assert.assertEquals("Wrong", "Samuel, Peter, 1995\nJohn, Elliot, 2013\nSimon, Gregory, 1990", contents); } @Test public void sortByFirstName() { String contents = dp.getContents(PATH); String sortedContents = dp.getSortedByFirstName(contents); Assert.assertEquals("Wrong", "John, Elliot, 2013\nSamuel, Peter, 1995\nSimon, Gregory, 1990", sortedContents); } @Test public void sortByLastName() { String contents = dp.getContents(PATH); String sortedContents = dp.getSortedByLastName(contents); Assert.assertEquals("Wrong", "John, Elliot, 2013\nSimon, Gregory, 1990\nSamuel, Peter, 1995", sortedContents); } @Test public void sortByYear() { String contents = dp.getContents(PATH); String sortedContents = dp.getSortedByYear(contents); Assert.assertEquals("Wrong", "Simon, Gregory, 1990\nSamuel, Peter, 1995\nJohn, Elliot, 2013", sortedContents); } } |
Solution:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 |
package com.passing.unittests; import java.io.File; import java.io.FileInputStream; import java.util.Map; import java.util.Scanner; import java.util.TreeMap; public class DataProcessingImpl implements DataProcessing { public String getContents(String path) { Scanner scanner = null; StringBuilder sb = new StringBuilder(20); try { FileInputStream fis = new FileInputStream(new File(path)); scanner = new Scanner(fis); while ((scanner.hasNextLine())) { String next = scanner.nextLine(); sb.append(next + "\n"); } } catch (Exception ex) { ex.printStackTrace(); } finally { if(scanner != null) { scanner.close(); } } return sb.toString().trim(); } public String getSortedByFirstName(String input) { if(input == null || input.length() == 0){ throw new IllegalArgumentException("input=" + input); } return getSortedContents(input, 0); } public String getSortedByLastName(String input) { if(input == null || input.length() == 0){ throw new IllegalArgumentException("input=" + input); } return getSortedContents(input, 1); } public String getSortedByYear(String input) { if(input == null || input.length() == 0){ throw new IllegalArgumentException("input=" + input); } return getSortedContents(input, 2); } /** * Generic method to sort using a TreeMap. * @param input CSV format: first name, last name, year joined * @param sortIndex index of CSV line to sort by * @return */ private String getSortedContents(String input, int sortIndex){ Map<String, String> map = new TreeMap<String, String>(); String[] split = input.split("\n"); for (String line : split) { String key = getSortKey(line, sortIndex); map.put(key, line); } StringBuilder sb = new StringBuilder(20); for (String key : map.keySet()) { sb.append(map.get(key) + "\n"); } return sb.toString().trim(); } /** * Splits it into an array using "," as delimiter * and returns the given index, 0 is first name, 1 is last name, and 2 is year joined * @param line * @param index * @return */ private static String getSortKey(String line, int index) { return line.split(",")[index];// extract value you want to sort on } } |
Key Points If you are using Java 7, … Read more ›...
