Write a Kotlin program with a checkSorting generic functio.pdf

•

0 likes•3 views

A Kotlin program should be written to check if a list is sorted or not using a generic checkSorting() function that accepts the list and a comparison function. The function should work for any Number subtype lists. It should return True if sorted based on the comparison condition, else False. checkSorting() needs to be pure, recursive and use an internal helper function. The program should be tested using at least two Number subtype calls from main. Extension functions like tail() and head() are required to compare list elements by accessing the first and remaining elements.

Education

Write a Kotlin program with a checkSorting() generic function. The checkSorting()
function accepts two arguments: an input list and a function that determines the
comparison condition. The function should be able to accept any list belonging to the
Number supertype. The user should be able to specify through the function argument the
condition using which a list will be considered sorted. For example, a list (1,2,3,4,5) is
considered sorted if we are using a comparison condition where each (n-1)th element
should be less than each nth element, otherwise it is considered unsorted. The function
checkSorting() returns True of a list is sorted, otherwise it returns false.
Please note that checkSorting should be written as a pure function, therefore, it should be
recursive and use an internal helper function. Test your program by at least two calls to this
function from main using any two distinct number subtypes of your choice.
Hint: To compare elements of an array, you will need to write two extension functions. An
extension function allows you to add helpful behavior for a type or instance. To declare an
extension function, prefix its name with the type of the data to which you would like to add
the behavior. The following is an example of an extension function show() that we would like
to apply to an Int to show the Ints value.
fun Int.show(): String = "The value of this Int is $this"
1.show()
res1: kotlin.String = The value of this Int is 1
The two extension function you will require are tail() and head(). tail() uses the drop method
for lists which returns a list containing all elements except the first n elements. head() uses
the first method for lists which returns the first element on the list. For more information,
please refer to the following links:
Extension functions: http://developer.android.com
drop(): https://kotlinlang.org/api/latest/jvm/stdlib/kotlin.collections/drop.html
first(): https://kotlinlang.org/api/latest/jvm/stdlib/kotlin.collections/first.html

Similar to Write a Kotlin program with a checkSorting generic functio.pdf

Python programming: Anonymous functions, String operations

Megha V

C++. Please, make sure that your answer is fully submitted. A circular linked list is a linked list where a non-empty list has no null pointers. Unless empty, each node has a pointer to the next node, and the last node points back to the first node. Assignment: Create a file called CLinkedList.h that will contain templates of the following classes and functions. 1) A circular linked list class, with nodes arranged in ascending order. It must have a single data member, a pointer to a Node object named last, which points to the last node of a non-empty list. It must have following public member functions: a constructor, copy constructor, destructor (implemented recursively), and assignment operator. Its other public member functions will be named insert() and remove(), which will be used to insert and remove integers given by the user in later cpp assignment. Use a LinkedList.h as a basis. 2) Include or Implement the Node.h file. 3) A list iterator class, templated and have as data member a reference to a circular linked list and a pointer to the templated type. OR in other words :The iterator class providing a public interface to the list. The pointer points at nodes in the linked list. You may Refer to the << operator in the LinkedList.h Its member functions are as follows: Constructor: Assigns the linked list data member to the parameter, a reference to a circular linked list. begin() sets the iterator to the first node of the linked list (or NULL if the list is empty) isEmpty() returns whether or not the wrapped linked list is empty isFirstNode() returns whether the present node is the first node of the linked list isLastNode() returns whether the present node is the last node of the linked list operator*() returns the data of the node currently pointed at. (You need 2, one of them with constant reference like in LinkedList.h) operator++() pre-increment operator advances the pointer to the next node in the list, if there is one operator++(int) post-increment operator advances the pointer to the next node in the list, if there is one Please, document as much as you can!.

C++ Please make sure that your answer is fully submitted .pdf

aashkaahm

functions- best.pdf

MikialeTesfamariam

Functions

abdullahcte

Lecture 11 - Functions

Md. Imran Hossain Showrov

Amit user defined functions xi (2)

Arpit Meena

All About ... Functions

Michal Bigos

Introduction to Python - Part Two

amiable_indian

Function overloading

Selvin Josy Bai Somu

PE1 Module 3.ppt

balewayalew

Complete a C++ class implementation for a linked-list of sorted (ascending) positive integers. The class name for this class is LLSortedPosInt and its specification is outlined in the file LLSortedPosInt.h. The specification is accompained by two other files: (1) a partial implementation of the class in the file LLSortedPosInt.cpp and (2) a test program called testLL.cpp. You are to complete the partial implementation of the class by writing code for the stubbed member functions. You may NOT make any changes to the specification file. You may develop and test your class implementation either under Visual Studio or linux; however, your program must be executable under linux, because that is where it will be tested. Details: Linked lists are useful data structures for storing data records, particularly in situations where the items are to be kept sorted, the number of records are dynamic (i.e., changing during the course of the program’s execution) and the maximum number is arbitrary. In this exercise, you’ll get a chance to complete the implementation of a linked-list specification. In doing so, you’ll learn not only how to manipulate pointer objects, but also begin to learn how to create a new and useful data type. To get started, I have written a simple linked list definition within the header file called LLSortedPosInt.h. My definition is, of course, not the only way to define a linked list, but it is suitable for our simple project. Accompanying the definition is a partial implementation in the source file LLSortedPosInt.cpp. You are to edit this file using the comments in the file and the instructions below. Altogether, this assignment asks you to implement 13 functions. To help with testing your functions implementations, I have provided a main program. This main program is in the source file testLL.cpp. One quick way to repeatedly exercise your function tests is to write a test file (I called mine testCases.txt) and use input re-direction. The 13 functions you must add to complete the implementation are as follows: a. Constructors (4): Classes must have constructors to initialize instances of the objects. The constructors you will implement for this project are i. A default constructor ii. A constructor taking a single int parameter iii. A constructor which builds a list from an array of integers iv. A copy constructor b. Destructor (1): Because the class specification includes a pointer among the attributes, you will need to implement a destructor to delete (i.e., free or release) any storage allocated in the constructors or other member functions. c. Boolean Functions (2): You are to implement two Boolean functions i. A function isEmpty() which returns true if the associated list contains no data elements, and returns false otherwise. ii. A function containsElement(key) which returns true is key is an element in the list and returns false otherwise. d. Member Operator Functions (3): When a class has a pointer among its attributes, as .

Complete a C++ class implementation for a linked-list of sorted (asc.pdf

Parametricity

Lecture 4

Vizwik Coding Manual

Need done for Date Structures please! 4.18 LAB: Sorted number list implementation with linked lists Step 1: Inspect the Node.h file Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking on the orange arrow next to main.cpp at the top of the coding window. The Node class has three member variables: a double data value, a pointer to the next node, and a pointer to the previous node. Each member variable is protected. So code outside of the class must use the provided getter and setter member functions to get or set a member variable. Node.h is read only, since no changes are required. Step 2: Implement the Insert() member function A class for a sorted, doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList class's Insert() member function. The function must create a new node with the parameter value, then insert the node into the proper sorted position in the linked list. Ex: Suppose a SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order and yielding: 23 35.5 47.25 86 Step 3: Test in develop mode Code in main() takes a space-separated list of numbers and inserts each into a SortedNumberList. The list is displayed after each insertion. Ex: If input is then output is: Try various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove() member function Implement the SortedNumberList class's Remove() member function. The function takes a parameter for the number to be removed from the list. If the number does not exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the number is removed from the list and true is returned. Uncomment the commented-out part in main() that reads a second input line and removes numbers from the list. Test in develop mode to ensure that insertion and removal both work properly, then submit code for grading. Ex: If input is then output is: main.cpp #include <iostream> #include <string> #include <vector> #include "Node.h" #include "SortedNumberList.h" using namespace std; void PrintList(SortedNumberList& list); vector<string> SpaceSplit(string source); int main(int argc, char *argv[]) { // Read the line of input numbers string inputLine; getline(cin, inputLine); // Split on space character vector<string> terms = SpaceSplit(inputLine); // Insert each value and show the sorted list's contents after each insertion SortedNumberList list; for (auto term : terms) { double number = stod(term); cout << "List after inserting " << number << ": " << endl; list.Insert(number); PrintList(list); } /* // Read the input line with numbers to remove getline(cin, inputLine); terms = SpaceSplit(inputLine); // Remove each value for (auto term : terms) { double number = stod(term); cout << "List after removing " << number << ": " << endl; list.Remove(number.

Need done for Date Structures please! 4-18 LAB- Sorted number list imp.pdf

info114

Assg 05: Quicksort COSC 2336 Data Structures Objectives • Practice writing functions • Practice writing recursive functions. • Learn about Analysis of algorithms and O(n log n) sorts Description In this assignment we will be implementing one of the most popular sorting algorithms used in libraries (like the C++ STL library, and the UNIX qsort function) to provide basic sorting abilities, the Quicksort algorithm. I would recommend that you at least read section 7.5 from our supplemental Shaffer textbook on Quicksort, if not sections 7.1-7.5 talking about three well known O(n log n) sorting algorithms, and the 3 O(n2) algorithms we discussed last week. Quicksort, when properly implemented, is very attractive because it pro- vides a way to do a fast sort completely in-place (without having to allocate additional memory to do the sort, beyond a single value needed when swapping two values in the list being sorted). In the worst case, Quicksort is actually O(n2), no better than bubble sort. But this worse case only occurs when every pivot selected is the wort possible, and does not divide the list at all. This is very unlikely to happen, unless you know how the pivot is selected, and specifically design the input list to always choose the worst possible pivot. On average the cost of Quicksort is O(n log n), and it is usually very likely that average case performance will result when lists to be sorted are relatively random. The most direct implementation of Quicksort is as a recursive algorithm. Quicksort is an example of a divide and conquer approach to solving the problem of sorting the list. We are given a list of items, A and indexes left 1 and right that indicate a sub-portion of the list to be sorted. left and right indicate the actual indexes, so if the list is a regular C array of integers, and the array is of size 10 int left; int right; const inst SIZE = 10; int A[size]; Then to sort the whole list we set left = 0 and right = 9 to initially call the Quicksort function: left = 0; right = size-1; quicksort(A, left, right); Conceptually the steps of the Quicksort algorithm are as follows: 1. if list size is 0 or 1 (left <= right) return (lists of this size are sorted by definition). 2. Choose a pivot value and swap the pivot value to the end of the list swap(pivotIndex, right) 3. Partition the list. Partitioning means all values less than the pivot value should end up on the left of the list, and all values greater will be on the right. The first index k where a value >= to the pivot value is at indicates the new left and right side sub-lists. 4. Swap the pivot value to its correct position k swap(k, right) 5. Recursively call Quicksort on the new left and right sub-lists • quicksort(A, left, k-1) • quicksort(A, k+1, right) Most of the real work happens in the function/code to partition the list. The partitioning of the list, for Quicksort to be an in-place sort, must work by swapping values in-place in the list o.

Assg 05 QuicksortCOSC 2336 Data StructuresObjectives.docx

jane3dyson92312

Assg 05 QuicksortCOSC 2336 Data StructuresObjectives.docx

festockton

Functions in C++

home

User defined function in C.pptx

Rhishav Poudyal

Linked List Objective: The purpose of this exercise is to create a Linked List data structure that mimics the behavior of the Java Standard Library Version (Java API). The outcomes/results of using the library features should be identical with your own version (My API). However, the underlying implementation should follow with the descriptions listed below. Instructions : Create the following Linked List Data Structure with the given description below in your utils package and use "for loops" for your repetitive tasks. Where to find starter code in my-api package.class : utils.LinkedList package.class : tests.console.week04.LinkedListTest Where to find your JUNIT test in my-api package.class : tests.junit.LinkedListJUnitTest Nested Class that has to be added to LinkedList class package.class : utils.LinkedList.Node Task Check List ONLY "for" loops should be used within the data structure class. There is an automatic 30% deduction, if other loops are used. The names of identifiers MUST match the names listed in the description below. Deductions otherwise. Complete coding Assignment in your "my-api" GitHub Repository. You will not be graded otherwise and will receive a 0, if not uploaded there. Run JUNIT TEST and take a SNAPSHOT of results. Upload PDF of snapshot of your JUnitTest results to Canvas. Description The internal structure of the Linked List is a doubly linked Node data structure and should have at a minimum the following specifications: data fields: The data fields to declare are private and you will keep track of the size of the list with the variable size and the start of the list with the reference variable data. first is a reference variable for the first Node<E> in the list. last is a reference variable for the last Node<E> in the list. size keeps track of the number of nodes in the list of type int. This will allow you to know the current size of the list without having to traversing the list. constructors: The overloaded constructors will initialize the data fields size and data. A constructor that is a default constructor initializes the starting node location first and size to a zero equivalent, that is, constructs an empty list. methods: methods that manages the behavior of the linked nodes. Together, the methods below give the illusion of a index or countable location. Implement these methods within your generic Linked List class. Method Description Header public boolean add(E item) public void add(int index, E item) public void append( E item) private void checkIndex(int index) public boolean contains(E item) public void clear() private E detach(int index) public E get(int index) public int indexOf(E item) private void insertBefore(int index, E item) public boolean isEmpty() private Node<E> node(int index) public E remove(int index) public boolean remove(E item) public E set(int index, E item) public int size() public String toString() Node Data Structure The generic Linked List class includes a static Node class as a ne.

Linked List Objective The purpose of this exercise is to cr.pdf

adityacomputers001

Similar to Write a Kotlin program with a checkSorting generic functio.pdf (20)

Python programming: Anonymous functions, String operations

C++ Please make sure that your answer is fully submitted .pdf

functions- best.pdf

Functions

Lecture 11 - Functions

Amit user defined functions xi (2)

All About ... Functions

Introduction to Python - Part Two

Function overloading

PE1 Module 3.ppt

Complete a C++ class implementation for a linked-list of sorted (asc.pdf

Parametricity

Lecture 4

Vizwik Coding Manual

Need done for Date Structures please! 4-18 LAB- Sorted number list imp.pdf

Assg 05 QuicksortCOSC 2336 Data StructuresObjectives.docx

Functions in C++

User defined function in C.pptx

Linked List Objective The purpose of this exercise is to cr.pdf

More from vivekemailid

Write a Python Monster class. Monster should have the following: - an _init_method that takes the name and the size of the monster and creates and sets instance variables with these values - an attack method that takes the name of the location the monster attacks and prints out a message like Godzilla attacks Tokyo - getters for the name and size of the monster - a reasonable _str_ method - an _ eq_. method that overloadss the = operator so that two monsters are equal if and only if they have the same name and the same size - an __ add__ method that retums a new Monster whose name is the names of the two original monsters concatenated..

Write a Python Monster class Monster should have the follow.pdf

vivekemailid

Write a program in Java that will display a letter from fiv.pdf

vivekemailid

Write a program that contains the following functions: The input_fp() function uses an input loop and try/except that accepts only floating-point values and returns the result. The input_int() function uses an input loop and try/except that accepts positive or negative integers and returns the result. The input_index() function takes a list and uses input_int() and try/except to return only valid indexes for the list. The main() function calls each of the others. Call it from the body of the program..

Write a program that contains the following functions The i.pdf

vivekemailid

Write a program named FavoriteWordsjava that prompts user t.pdf

vivekemailid

Write a program in Python that implements Newton's method to find the roots of a function. The program must request an initial value. the maximum number of iterations. to tolerance, the function to which you want to look for the root, and the first derivative of the function. Verify the operation of your program by finding the root of the function f (x) = cos(x)- with initial value Po=7/4 and tolerance of 10*-4 Verify the operation of your program by finding the root of the function f (x) = cos(x)- with initial value Po=7/4 and tolerance of 10*-4 Newton's Method To find a solution to f(x)=0 given an initial approximation p0 : INPUT initial approximation p0; tolerance TOL; maximum number of iterations N0. OUTPUT approximate solution p or message of failure. Step 1 Set i=1. Step 2 While iN0 do Steps 3-6. Step 3 Set p=p0f( p0)/f(p0). (Compute pi.) Step 4 If pp0<TOL then OUTPUT ( p); (The procedure was successful.) STOP. Step 5 Set i=i+1. Step 6 Set p0=p. (Update p0.) Step 7 OUTPUT ('The method failed after N0 iterations, N0= ', N0 ); (The procedure was unsuccessful.) STOP. Numerical Analysis de Burden, Faires, & Burden (2016).

Write a program in Python that implements Newtons method to.pdf

vivekemailid

Write a program called diagnosis.py that simulates an expert system for diagnosing medical conditions based on symptoms using nested if-else statements. The program should be able to interact with the user by answering simple yes/no questions of various symptoms from a patient and then use a series of nested if-else statements to determine the possible medical conditions that the patient may have..

Write a program called diagnosispy that simulates an expe.pdf

vivekemailid

Write a program that prints the message, "Hello, my name is Hal!" Then, on a new line, the program should print the message "What would you like me to do?" Then it's the user's turn to type in an input. You haven't yet learned how to do it- Just use the following lines of code: string user input; getline (cin, user input): Finally, the program should ignore the user input and print the message "I am sorry. I cannot do that." This program uses the string data type. To access this feature, you must place the line Anclude estring? before the main function. Here is a typical program run. The user input is printed in color. Hello, my nase is Hall What would you like ne to do? Clean up my roon I an sorry, I cannot do that. When running the program, remember to press the Enter key after typing the last word of the input line..

Write a program that prints the message Hello my name is .pdf

vivekemailid

Write a method called recAdd that will add the (integer) elements of an array. For example if the array were {4,8,10} the method would return 22. Note the method will need to take as parameter the array and also the index of the last element. public class Lab14Num2 { public static void main (String []args) { int A[] = { 3,4,16,8,-9,10}; System.out.println(recAdd(A, 5)); } public static int recAdd(int A[], int n) //n is the index of the last element { } }.

Write a method called recAdd that will add the integer ele.pdf

vivekemailid

Write a Python function named validInput that displays to .pdf

vivekemailid

Write a program defines a Person class that has private instance variables for the person's name and age. The class hosts public getters and setters for these variables, which are used to encapsulate the data and provide controlled access to these (for example, while printing). In particular, the setName and setAge methods are designed to enforce some basic validation rules: the name should be a non-empty string, and the age should be a positive integer between 0 and 120 (inclusive). If the age is not within the limit, the program should display the message Invalid age: [age] instead of printing the name and age information. // Input Enter name: John Smith Enter age: 35 //Output Name: John Smith Age: 35 Hint: The main method of the program prompts the user to enter a name and age for a person, uses the setters to set the corresponding instance variables, and then uses the getters to retrieve and print out the data..

Write a program defines a Person class that has private inst.pdf

vivekemailid

Write a main method that will request the user to enter Strings using a JOptionPane input dialog. The method should continue accepting strings until the user types "STOP". For each string entered, tell the user via a JOptionPane message dialog if the String had an odd or even length. After the user enters STOP, tell the user via a JOptionPane how many strings had an odd length and how many had an even length..

Write a main method that will request the user to enter Stri.pdf

vivekemailid

Write a Java program using while loop or do -while and switch to convert letters of the alphabet into their corresponding digits on the telephone. The program should let the user enter letters from A to Z. An error message should be printed for any nonalphabetic character that is entered. When the & is entered, the program will be terminated. The letters and digits on the telephone have the following correspondence: ABC = 2 DEF = 3 GHI = 4 JKL = 5 MNO = 6 PQRS = 7 TUV = 8 WXYZ = 9.

Write a Java program using while loop or do while and swi.pdf

vivekemailid

Write a Java program to accept 10 integers from the user an.pdf

vivekemailid

More from vivekemailid (13)