This assignment consists of three F# exercises. The code for all exercises are included in the single file, hw4.fsx. For each of the exercises, you are only required to write the provided functions. There is no additional global functionality. Your functions should produce no output. To test your functions, either: Test the functions using the interactive simulator Add your own tests to the script (but be sure to remove them or comment them out before submission) Implementation Rules You may define and use additional functions if your feel it is appropriate. Without prior approval from me, you may only use the subset of F# described in class. In particular, you may NOT use F# system functions (such as min) or methods Even though they were mentioned in class, you are NOT allowed to use the methods in the List module such as List.map.

This assignment consists of three F# exercises. The code for all exercises are included in the single file, hw4.fsx. For each of the exercises, you are only required to write the provided functions. There is no additional global functionality. Your functions should produce no output. To test your functions, either: Test the functions using the interactive simulator Add your own tests to the script (but be sure to remove them or comment them out before submission) Implementation Rules You may define and use additional functions if your feel it is appropriate. Without prior approval from me, you may only use the subset of F# described in class. In particular, you may NOT use F# system functions (such as min) or methods Even though they were mentioned in class, you are NOT allowed to use the methods in the List module such as List.map.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16SA

See similar textbooks

Implementation Rules

You may define and use additional functions if your feel it is appropriate.
Without prior approval from me, you may only use the subset of F# described in class.
- In particular, you may NOT use F# system functions (such as min) or methods
- Even though they were mentioned in class, you are NOT allowed to use the methods in the List module such as List.map.

Write a function elimDuplicates that takes a list of integers and eliminates consecutive duplicates; replacing them with a
single instance of the value. Order is preserved and non- consecutive duplicates are unaffected.
Examples:
> elimDuplicates [1; 2; 2; 3; 3; 3; 4; 4; 4; 4; 5; 5; 5; 5; 51;
val it : int list
> elimDuplicates [1; 2; 2; 1; 3; 3; 1; 4; 4; 1; _5; 5; 1];;
val it : int list = [1; 2; 1; 3; 1; 4; 1; 5; 1]
= [1; 2; 3; 4; 5]

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Suppose a node of a doubly linked list is defined as follows: struct Node{ int data; struct Node* next; struct Node* prev; }; Write the function definition of the function deleteElement as presented below. This function deletes a node at position n from a doubly linked list. struct Node* deleteElement(struct Node* head, int n){ //write the function definition }
struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };
F# system function such as min and list.map are not allowed write a function in F# elimDuplicates that takes a list of integers and eliminates consecutive duplicates; replacing them with a single instance of the value. Order is preserved and non- consecutive duplicates are unaffected. Examples: > elimDuplicates [1; 2; 2; 3; 3; 3; 4; 4; 4; 4; 5; 5; 5; 5; 5];; val it : int list = [1; 2; 3; 4; 5] > elimDuplicates [1; 2; 2; 1; 3; 3; 1; 4; 4; 1; 5; 5; 1];; val it : int list = [1; 2; 1; 3; 1; 4; 1; 5; 1]
struct insert_at_back_of_dll { // Function takes a constant Book as a parameter, inserts that book at the // back of a doubly linked list, and returns nothing. void operator()(const Book& book) { / // TO-DO (2) |||| // Write the lines of code to insert "book" at the back of "my_dll". // // // END-TO-DO (2) ||| } std::list& my_dll; };
Write a function reverse_iter_for that takes a list and returns a new list that is the reverse of the original using a for loop. You should not need any indexing notation. def reverse_iter_for(lst): """Returns the reverse of the given list. >>> reverse_iter_for([1, 2, 3, 4]) [4, 3, 2, 1] TELEEL "*** YOUR CODE HERE ***" Complete the function reverse_iter_while that behaves identically to reverse_iter_for but is implemented as using a while loop. You may use indexing or slicing notation. Do not use 1st [::-1] ! def reverse_iter_while(lst): """Returns the reverse of the given list. >>> reverse_iter_while([1, 2, 3, 4]) [4, 3, 2, 1] rev_lst, i = [], 0 while i < len(lst): "*** YOUR CODE HERE ***"
C++
struct node{int num;node *next, *before;};start 18 27 36 45 54 63 The above-linked list is made of nodes of the type struct ex. Your task is now to Write a complete function code to a. Find the sum of all the values of the node in the linked list. b. Print the values in the linked list in reverse order. Use a temporary pointer temp for a and b. i dont need a full code just the list part
An Unsorted Type ADT is to be extended by the addition of functionSplitLists, which has the following specifications:Function: Divides list into two lists according to the key of item.Preconditions: list has been initialized and is not empty.Postconditions: list1 contains all the items of list whose keys are less than orequal to item’s key; list2 contains all the items of list whose keys are greaterthan item’s key. - Implement SplitLists as a client function of the Unsorted list ADT
C++
in c++
In C++ Plz LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main(), define an InsertAtEnd() member function in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts ItemNode.h Default Code: #include <iostream>#include <string>using namespace std; class ItemNode {private: string item; ItemNode* nextNodeRef; public: // Constructor ItemNode() { item = ""; nextNodeRef = NULL; } // Constructor ItemNode(string itemInit) { this->item = itemInit; this->nextNodeRef = NULL; } // ConstructorItemNode(string itemInit, ItemNode *nextLoc) {this->item = itemInit;this->nextNodeRef = nextLoc;} // Insert node after this…
Max Absolute In List Function Lab Description Implement function max_abs_val(lst), which returns the maximum absolutevalue of the elements in list.For example, given a list lst: [-19, -3, 20, -1, 0, -25], the functionshould return 25. The name of the method should be max_abs_val and the method should take one parameter which is the list of values to test. Here is an example call to the function print(max_abs_val([-19, -3, 20, -1, 0, -25])) File Name maxabsinlst.py Score There are three tests each worth 2 points Note: You do not need any other code including the main method or any print statements. ONLY the max_abs_val method is required. Otherwise, the autograder will fail and be unable to grade your code. (I.e., do not include the above example in your code.) The above example should be used be test your code but deleted or comment out upon submission. PYTHON LAB