Defanging an IP Address • Given a valid (IPv4) IP address, a defanged IP address replaces every period “.” with “[.]”. • Example: address = “255.100.50.0”, defanged = “255[.]100[.]50[.]0” • Write a function that accepts a string as input (valid IP address) and returns the defanged IP address. • Test the function in the main method. Sample output at the bottom. • Have the expected defanged address hardcoded and compare it to result from the function

Defanging an IP Address • Given a valid (IPv4) IP address, a defanged IP address replaces every period “.” with “[.]”. • Example: address = “255.100.50.0”, defanged = “255[.]100[.]50[.]0” • Write a function that accepts a string as input (valid IP address) and returns the defanged IP address. • Test the function in the main method. Sample output at the bottom. • Have the expected defanged address hardcoded and compare it to result from the function

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Your task is to implement Depth-first search algorithm to solve the problem of placing 8 Queens on a chess board so none can “take” each other.• A code framework, supporting videos and html documentation of the provided code-base will be provided via Moodle in assignments section.• The implementation should accept one command-line argument at the time it is invoked for the starting position of the first queen.o It will be tested with a range of values for that input.o If the input is not an integer in the range of 0-7 it should report “Invalid Input” and exit. • You will be supplied with a partially completed file ‘main.c’ which contains the code need to read the command line and sets up the initial working candidate within the code framework.o Your task is to complete the code to implement depth-first search. o Your code must finish with a call to the function PrintFinalSolutionAndExit(); when a valid final solution stored in the variable “workingCandidate”. please solve full…
Please code this question in Java according to the function attached in picture. Given two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and return the sum as linked list: Example : Input : (7-> 1 -> 6) + (5-> 9-> 2). That is 617 + 295 = 912 Output : 2-> 1 -> 9 Expected time complexity : O(m+n), where m and n are no. of nodes in first and second linked list respectively.
implement getbyte function. getByte(x,n) Extract byte n from word x /* * getByte - Extract byte n from word x* Bytes numbered from 0 (LSB) to 3 (MSB)* Examples: getByte(0x12345678,1) = 0x56* Legal ops: ! ~ & ^ | + << >>* Max ops: 6*/int getByte(int x, int n) {return 2;}
An “inverted file” is a critical data structure for implementing applications like the index of a book, or a web search engine. Given a document D (which can be viewed as an unordered, numbered list of words), an inverted file is an ordered list of words L such that for each word W in L, we store the indices of the places in D where W appears. Write a C# program (from scratch please, written by yourself (ask instructor if you are stuck), not borrowed from any other sources) that reads in a list of words separated by spaces from a text file, then uses an efficient O(N) algorithm to create the inverted file index (hint: consider the topic of this chapter, consider using a Dictionary/hashtable to help you), and writes this index out to another file or prints it to the screen. Each line of the output file should start with the next word (the words should be listed in alphabetical order, and this sorting does not have to be part of the O(N) runtime complexity, e.g. you can use regular…
Not pseudocode Suppose the economies of the world use a set of currencies C1, . . . , Cn; think of these as dollars, pounds, Bitcoin, etc. Your bank allows you to trade each currency Ci for any other currency Cj, and finds some way to charge you for this service. Suppose that for each ordered pair of currencies (Ci, Cj ), the bank charges a flat fee of fij > 0 dollars to exchange Ci for Cj (regardless of the quantity of currency being exchanged). Describe an algorithm which, given a starting currency Cs, a target currency Ct, and a list of fees fij for all i, j ∈ {1, . . . , n}, computes the cheapest way (that is, incurring the least in fees) to exchange all of our currency in Cs into currency Ct. Also, justify the its runtime. [We are expecting a description of the algorithm, as well as a brief justification of its runtime.]
write python program 10x10 grid, agent top right corner, traversing terrain = 1 time unit, rough terrain = 5 time units, and others terain = cannot be reached An A* based search function that takes a list of lists as argument and generates as a result a list of grid cell coordinates starting at the upper right and ending at the lower left and representing the fastest path for the agent to travel. E.g., path = aStarSearch(map). The path can be empty if there is no route.
Substitution ciphers are encryption/decryption algorithms that replace one letter or number with another. The first attested use of a substitution cipher in military affairs was by Julius Caesar, described by him in Gallic Wars (cf. Kahn pp83-84). In caesar cipher , you replace each letter by 3rd letter on. If it is out of bound (later than Z), then round to the head (letter A) and continue the shift. For example:meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB Please write a program in Java to implement the Caesar Cipher: a. Implement the encryption algorithm. Ask the user to input one all lower case normal sentence (called plaintext) using the nextLine method, and then output the encrypted text (called ciphertext). b. Implement the decryption algorithm. Ask the user to input one encrypted sentence (i.e. ciphertext) using the nextLine method, and then output the decrypted text (i.e. plaintext).
Write a script using PHP that takes a link from the user and parses through its associated web page to print a list of every link embedded on that site. This program must work recursively, so for each link that gets printed, the program should automatically take each of those links as a new input and do the same for them until there are no more links left. If the same link exists twice on the same page, or if it exists on more than one page, the program should ignore all duplicate instances of the link.
Can you please help update this? //A6Utilities.java import java.io.IOException;import java.nio.file.Files;import java.nio.file.Paths;import java.security.SecureRandom;import java.util.List;import java.util.TreeMap;import java.util.function.Function;import java.util.stream.Collectors;public class A6Utilities {/*** Returns the corresponding letter grade. Don't modify this method, simply use it when converting single* grades to their equivalent letter grade** @param grade the integer grade to convert* @return the letter grade equivalent to the integer grade*/private static char letterGrade(final int grade) {if (grade < 0) return '?';else if (grade < 60) return 'F';else if (grade < 70) return 'D';else if (grade < 80) return 'C';else if (grade < 90) return 'B';else if (grade <= 100) return 'A';else return '?';}/*** The method uses Java Streams only. Don't use any looping structures, conditional statements are OK (IF, TERNARY, SWITCH)* <p>* Generates a list of secure…
In a flight reservation system, the number of available seats in each plane model is an input. A plane may have any number of available seats (the number of available seats must be greater than zero), up to the given capacity of the plane. Using boundary value analysis, a list of available seat values were generated. Which of the following lists is correct? a) 0, 1, 2, capacity + 1, a very large number b) 0, 1, 100, capacity, capacity + 1 c) 0, 1, capacity, capacity + 1 d) 1, 2, capacity -1, capacity, capacity + 1
do for heaps.Create a data type for domain names called Domain, along with a suitable compareTo() function, with the natural order being the reverse domain name. For instance, cs.princeton.edu's reverse domain is edu.princeton.cs. Analysis of web logs can benefit from this. Use s.split(".") to divide the string s into tokens that are separated by dots. Create a client that outputs the reverse domains in sorted order after reading domain names from standard input.
Consider reading a stream of numbers in. You should occasionally be able to search up a number's rank. (the number of values less than or equal to x). Implement the algorithms and data structures needed to enable these operations. Implement the methods getRankOfNumber(int x), which returns the number of values less than or equal to x, and track (int x), which is called when each number is created. (not including x itself).EXAMPLEStream (in order of appearance): 5, 1, 4, 4, 5, 9, 7, 13, 3getRankOfNumber(l) 0getRankOfNumber(3) = 1getRankOfNumber(4)= 3