def count_crossings_and_nestings(arcs): Count the number of crossings and nestings between a set of arcs. Parameters: arcs (list): A list of tuples representing arcs. Each tuple contains two integers representing the start and end points of an arc. Returns: tuple: A tuple containing the number of crossings and nestings. || || || crossings = 0 nestings = 0 num_arcs = len(arcs) # Get the number of arcs using the len() function for i in range(num_arcs): for j in range(i+1, num_arcs): arci_start, arci_end = arcs [i] arcj_start, arcj_end: = arcs [j] # Check for crossings if arci_start < arcj_start < arci_end < arcj_end: crossings += 1 elif arcj_start < arci_start < arcj_end < arci_end: crossings += 1 # Check for nestings elif arci_start < arcj_start < arcj_end < arci_end: nestings += 1 elif arcj_start < arci_start < arci_end < arcj_end: nestings += 1 return crossings, nestings # Test the function arcs = [(1, 4), (0, 6), (3, 5), (2, 9), (7, 8)] crossings, nestings = count_crossings_and_nestings (arcs) print (f"Number of crossings: {crossings}") # Expected: 1 print (f"Number of nestings: {nestings}") Number of crossings: 3 Number of nestings: 4 # Expected: 3

def count_crossings_and_nestings(arcs): Count the number of crossings and nestings between a set of arcs. Parameters: arcs (list): A list of tuples representing arcs. Each tuple contains two integers representing the start and end points of an arc. Returns: tuple: A tuple containing the number of crossings and nestings. || || || crossings = 0 nestings = 0 num_arcs = len(arcs) # Get the number of arcs using the len() function for i in range(num_arcs): for j in range(i+1, num_arcs): arci_start, arci_end = arcs [i] arcj_start, arcj_end: = arcs [j] # Check for crossings if arci_start < arcj_start < arci_end < arcj_end: crossings += 1 elif arcj_start < arci_start < arcj_end < arci_end: crossings += 1 # Check for nestings elif arci_start < arcj_start < arcj_end < arci_end: nestings += 1 elif arcj_start < arci_start < arci_end < arcj_end: nestings += 1 return crossings, nestings # Test the function arcs = [(1, 4), (0, 6), (3, 5), (2, 9), (7, 8)] crossings, nestings = count_crossings_and_nestings (arcs) print (f"Number of crossings: {crossings}") # Expected: 1 print (f"Number of nestings: {nestings}") Number of crossings: 3 Number of nestings: 4 # Expected: 3

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 2PE

See similar textbooks

Similar questions

Parameter: An array of strings. Return value: A list of the three strings that occur most frequently in the parameter array
DiceSet Class in Python Write a class named DiceSet that contains a list of Die objects. Fields dice a list of Die objects Methods __init__(self, dice_faces) The constructor should instantiate the dice list to an empty list if no parameters are set. The constructor should take a list of integers. Add one die to the dice set for each integer with the number of faces equal to the integer. pop_die(self, value) Remove and return the first die with the given value from the list. add_die(self, die) Adds the given die (of class Die) to the dice list. roll(self) Roll all the die objects in the list of dice and return their sum. die_values(self) Return a list of the int values (last rolls) of the dice in the list. __str__(self) returns a string version of a dice set. Example: "{[d3] 1, [d6] 4, [d12] 5, [d4] 3}"
Library class: Fields: books as arraylist to store all the books available in the library B3 B1 B2 В4 B5 Constructor: Library() } : No parameterized constructor to create the books object Methods: 1. addBook(Book bookobj): to add a new book to the arraylist; send the book object as a parameter to this method. 2. searchBook(String name): search a book by a given name in the arraylist. if exits print bookX found; otherwise print not found!!! 3. RemoveBook(String name): to delete a book object from arraylist by a given name: Hint: you need to use iterator class and remove method. Book class: Fileds: bookld, bookname. Constructor: two parameterized constructor that accepts name a parameter Book(int ID, String name) ..... Methods: 1. Accessor method to return the name of the book 2. Mutator method to change the id of the book. Use this Main method: in your program: public static void main(String args[]) { Library lib=new Library(); lib.addBook(new Book("b1")); lib.addBook(new Book("b2"));…
Counting hashtags Write Python code to count the frequency of hashtags in a twitter feed. Your code assumes a twitter feed variable tweets exists, which is a list of strings containing tweets. Each element of this list is a single tweet, stored as a string. For example, tweets may look like: tweets = ["Happy #IlliniFriday!", "It is a pretty campus, isn't it, #illini?", "Diving into the last weekend of winter break like... #ILLINI #JoinTheFight", "Are you wearing your Orange and Blue today, #Illini Nation?"] Your code should produce a sorted list of tuples stored in hashtag_counts, where each tuple looks like (hashtag, count), hashtag is a string and count is an integer. The list should be sorted by count in descending order, and if there are hashtags with identical counts, these should be sorted alphabetically, in ascending order, by hashtag. From the above example, our unsorted hashtag_counts might look like: [('#illini', 2), ('#jointhefight', 1),…
class Divisible:def div(minr, maxr, div1, div2):listdiv = []i = minrwhile i<maxr:if i%div1==0 and i%div2==0:listdiv.append(i)i+=1return listdiv if __name__ == "__main__":min = int(input("Enter the min: "))max = int(input("Enter the max: "))div1 = int(input("Enter div1: "))div2 = int(input("Enter div2: "))d1 = Divisible.div(min,max,div1,div2)print(d1) flowchart
function myChoice(items) {if (!this.value && !this.items) {this.items = items[0];} else if (!this.value || (params.length > 0 && params[0] == "rechoose")) {let index = Math.floor(Math.random() * (this.items.length - 0)) + 0;this.value = this.items[index];return this.value;}return this.value;} var a = myChoice([1, "a", 3, false]);console.log(myChoice(3, 12));console.log(myChoice(51, -2));console.log(myChoice("happy", false));console.log(myChoice([1, 2, 3]));console.log(myChoice("rechoose"));console.log(myChoice(a, a)); these are directions and examples myChoice( items ) This function accepts a list of items as input and creates a function that returns a randomly-chosen item. After choosing a random item, that same item will be always be returned, regardless of the functions input, with one exception. If the first input is the string 'rechoose', then a new random item will be chosen and therafter returned. this is KEYYYY!! Examples var a = myChoice( [1, "a", 3, false]…
double tab[5] = {3,6,9,9,15}; for(int i = 0;i<5;i++) { tab[i] = tab[i]/3; cout<<tab[i]<<" "; } 1 3 3 4 5 5 3 3 4 5 1 2 3 4 5 1 2 3 3 5
#ifndef lab5ExF_h #define lab5ExF_h typedef struct point { char label[10]; double x ; // x coordinate for point in a Cartesian coordinate system double y; // y coordinate for point in a Cartesian coordinate system double z; // z coordinate for point in a Cartesian coordinate system }Point; void reverse (Point *a, int n); /* REQUIRES: Elements a[0] ... a[n-2], a[n-1] exists. * PROMISES: places the existing Point objects in array a, in reverse order. * The new a[0] value is the old a[n-1] value, the new a[1] is the * old a[n-2], etc. */ int search(const Point* struct_array, const char* target, int n); /* REQUIRES: Elements struct-array[0] ... struct_array[n-2], struct_array[n-1] * exists. target points to string to be searched for. * PROMISES: returns the index of the element in the array that contains an * instance of point with a matching label. Otherwise, if there is * no point in the array that its label matches the target-label, * it should return -1. * If there are more than…
interface IResit { int row = 5; int col = 3; int upperBound = 10; public int[][] initTable(); // initialize 5x3 table with random (upper bound is:10) integer // numbers. “table” is class variable public int[] convertTwoToOne(int[][] a); // convert a two dimensional array into one dimensional // array /* * for example: * a= 1 3 5 * 6 9 -6 * 2 7 4 * * Your method should return: * 4 7 2 -6 9 6 5 3 1 * */ public double averageOfOddElements(int[] a); public double averageOfEvenElements(int[][] a); }// end of the interface /* Write a class that implements the given interface above. 1. Your class should have two constructors: 1. Default constructor: In this case, row, column and upper bound are same as the data that defined in the interface. 2. Overloaded constructor: in this case it should get three parameters, row, column, upper bound respectively. 2. Your constructor parameters are…
class Keyboard: """A Keyboard takes in a list of buttons, and has a dictionary of positions as keys, and Buttons as values. >>> b1 = Button("button1", "H") >>> b2 = Button("button2", "I") >>> k = Keyboard ([b1, b2]) >>> "button1" in k.buttons.keys () # Make sure to add the button to dictionary True >>> k.buttons ["button1"].letter 'H' >>> k.buttons ["button1"].name 'button1' >>> k. press ("button1") 'H' >>> k.press ("button100") >>> b1.pressed 1 >>>b2.pressed 0 >>> k. typing ( ["button1", "button2"]) 'HI' >>> k. typing ( ["button2", "button1"]) 'IH' >>> b1.pressed # make sure typing calls press! 3 >>>b2.pressed 2 definit__(self, buttons): self.buttons = {} "*** YOUR CODE HERE ***" def press (self, name): """Takes in a name of the button pressed, and returns that button's letter. Return an empty string if the button does not exist. You can access the keys of a dictionary d with d. keys (). "*** YOUR CODE HERE ***" def typing (self, typing_input): ""Takes in a list of names of buttons to…
class Node: def __init__(self, e, n): self.element = e self.next = n class LinkedList: def __init__(self, a): # Design the constructor based on data type of a. If 'a' is built in python list then # Creates a linked list using the values from the given array. head will refer # to the Node that contains the element from a[0] # Else Sets the value of head. head will refer # to the given LinkedList # Hint: Use the type() function to determine the data type of a self.head = None # To Do # Count the number of nodes in the list def countNode(self): # To Do # Print elements in the list def printList(self): # To Do # returns the reference of the Node at the given index. For invalid index return None. def nodeAt(self, idx): # To Do
Calendaritem -month int -day:int Calendaritem(int, int) move(int, int):void +tostring()intring Meeting Birthday -time: String -nameistring +birth year int -participants: ArrayList +Meeting(int, int, String) +addParticipant(String) :void +move(int, int, String):void +Birthday (String, int, int) +toString(): String Based on the UML diagrams shown above, write complete Java class for Birthday, as follows: C) Birthday 1. Define the class and its attributes. Note that Birthday is a subclass of Calendaritem 2. Implement the constructor, which takes 3 parameters for the name, day, and month, and set these values correctly 3. Implement the toString() method to return a string in the following format: name's birthday is on day/month For the toolbar, press ALT F10 (PC) or ALT+FN+F10 (Mac)