Exercise 2 Define a function member of type 'a * 'a list -> bool sothat member (e, L) is true if and only ife is an element of the list L.

Implementation of the member function: let rec member (e, L) = match L with | [] -> false | x…

Answered: Exercise 2 Define a function member of…

Exercise 2 Define a function member of type ''a that member (e, L) is true if and only if e is an element of the list L. a list -> bool so

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a function f1 that takes the root of a binary tree as a parameter and returns thesum of the nodes which are the left child of another node. The root of the tree is not achild of any node.Consider the following class definitions while writing your code.class Node {public:int key;Node* left;Node* right;};
I NEED HELP WITH THE FUNCTION THAT PRINTS THE LINKED LIST AND THE ASSINGNMENT OPERATOR FUNTION ONLY Here is a C++ class definition for an abstract data type WordTree of string objects. You must store the words and the counts of the words in a single binary search tree. Each word occurring in the text can only be stored once in the tree. Implement each member function in the class below. The WordTree class may have only one member variable, root, and it must be private. You may add additional private members functions to the WordTree class. Some of the functions we may have already done in lecture, that's fine, try to do those first without looking at your notes. Remember to provide an appropriate copy constructor, destructor and assignment operator for the WordTree class as well. #include <iostream> #include <string> typedef std::string WordType; struct WordNode { WordType m_data; WordNode *m_left; WordNode *m_right; // You may add additional data members and member…
Provide a detailed explanation line by line. Explain how this C++ program functionsSource Codes #include <iostream> using namespace std; // Node struct to hold data and pointer to next node struct Node { int data; Node* next; }; // Linked List class class LinkedList { private: Node* head; // pointer to head node public: LinkedList() { head = NULL; // initialize head to NULL } // Insert a new node at the front of the list void insert(int value) { Node* newNode = new Node(); // create a new node newNode->data = value; // set the data of the new node to the input value newNode->next = head; // set the next pointer of the new node to the current head node head = newNode; // set the head pointer to the new node } // Delete a node with a specific value from the list void deleteNode(int value) { Node* current = head; // set a pointer to the current node Node* previous =…
Rewrite the following class template as a template function bool math_func(int a, double b, long c) { if(a*b==c) { return true} else {return false;} }
for c++ please List ReverseModify the linked list class you created in the previous programming challenges byadding a member function named reverse that rearranges the nodes in the list so thattheir order is reversed. Demonstrate the function in a simple driver program. here is my first programming #include <iostream> using namespace std; struct node { int data; node *next; }; class list { private: node *head,*tail; public: list() { head = NULL; tail = NULL; } ~list() { } void append() { int value; cout<<"Enter the value to append: "; cin>>value; node *temp=new node; node *s; temp->data = value; temp->next = NULL; s = head; if(head==NULL) head=temp; else { while (s->next != NULL) s = s->next; s->next = temp; } } void insert() { int value,pos,i,count=0; cout<<"Enter the value to be inserted: "; cin>>value; node *temp=new node; node *s, *ptr; temp->data = value; temp->next = NULL; cout<<"Enter the postion at which node to be…
In Haskell Language write matchEmpty, which determines whether the language for a regular-- expression includes the empty string.matchEmpty :: RE symbol -> BoolmatchEmpty = ?-- Note that the type signature does not restrict symbol to types with-- equality testing, so we cannot use match or match' to check whether the-- empty string is allowed.---- matchEmpty r = match r [] -- type error---- Similarly, we cannot use generate' and check whether the first string-- it provides is the empty string.---- Finally, while generate has the proper type, we cannot use it to write a-- function that always terminates, as we cannot conclude that the empty-- string is not present until we have examined every string.---- *HW3> matchEmpty (getRE "e")-- True-- *HW3> matchEmpty (getRE "abc*")-- False-- *HW3> matchEmpty (getRE "a*")-- True-- *HW3> matchEmpty (getRE "0")-- False-- *HW3> matchEmpty (getRE "0*")-- True NOTE: Above are a few examples of what the output will look like. All…
Write an abstract data type for a queue whose elements include both a 20-character string and an integer priority. This queue must have the following methods: enqueue, which takes a string and an integer as parameters; dequeue, which returns the string from the queue that has the highest priority; and empty. The queue is not to be maintained in priority order of its elements, so the dequeue operation must always search the whole queue.
Solve it in Standard Template Library (STL)
7) Consider a Linked List class called LL, that has a Node pointer (Node*) called head. A Node is a struct composed of an integer element called value and a Node pointer to the next Node called next. The last Node's next is nullptr. Fill in functions A and B below. Note: You do NOT need to implement other functions of LL. struct Node { int value; Node* next; } class LL { private: Node* head; public: void insertAtFront(int num); void deleteRear(int num); }; // Function A: insert a node with value num at the front of the list. void LL:insertAtFront(int num) { //provide your code here } /* Function B: delete the last node in the list. If the list is empty when this is called, print an error message (çcout) stating so instead of deleting anything. Your function must not cause a memory leak! */ void LL::deleteRear(int num) // insert a node with value num at the front of the list. { //provide your code here
(c) The following is the incomplete abstract class definition as ADT: template class listType { public: const listType & operator= (const listType&); bool isEmptyList () const; void display () ;//to display data in linked list int length () const; void destroyList(); //function to delete all the nodes www w wwwww w ww ww ww Type front () const; Type back (0 const; void copyData (const listType &, int) ; void insert inOrder( 1); void deleteNode (Type & id); // default constructor // default destructor ww protected: (_2_) // to declare pointer named first (_3_) // to declared pointer named last } ; (i) Give the correct statements for 3(c) (1), (2) and (3) above. Assume that the structure's name of the node is nodeType.
write in c++ Define the 3 bolded functions for the Queue (circular array): class Queue { private: double array[10000]; int front, rear, numItems; public: Queue() {front = numItems = 0; rear = -1;} bool isEmpty(); bool isFull(); void enqueue(double d); int dequeue(); void dequeueMany(int n); //remove n values from the front void enqueueMany(double values[], int n); //add n values from the array}; Hints: void dequeueMany(int n) (hint 6 lines of code, no loops, if there are more than n elements in the queue, use math to re-compute front. Otherwise, make the queue empty. Don’t forget to update numItems. void enqueueMany(int values[], int n) (hint 3 lines of code, use a for loop, call another function, but make sure there’s enough room in the array first!! )
Design an implementation of an Abstract Data Type consisting of a set with the following operations: insert(S, x) Insert x into the set S. delete(S, x) Delete x fromthe set S. member(S, x) Return true if x ∈ S, false otherwise. position(S, x) Return the number of elements of S less than x. concatenate(S, T) Set S to the union of S and T, assuming every element in S is smaller than every element of T. All operations involving n-element sets are to take time O(log n).