1. Start with analysing the problem by using a flowchart/pseudo code. 2. As mention above, build a C++ program based on the appropriate method/function. You are free to create your own menu and display. Consider the following case: You have been appointed as a teacher of 3 Gemilang class in SMK Tanjung Malim. Please create a program that can keep the name list of your students in the class. The list must consist of two lists, first list is for all female student's names and the second list is for all male student's names. You must also provide the list of all the student's name. In order to do that, you need to merge both of the list together. The name in the list needs to be sorted alphabetically. The program must consist of the following method function: a) menu() – as interface for the user b) add list(string) - to add name to the list c) sort list) – to sort the name in the list d) show list) - to display the lists e) search list(string) – to search a name in the list f) merge_list(list1, list2) – to display list of students name (merge list)

1. Start with analysing the problem by using a flowchart/pseudo code. 2. As mention above, build a C++ program based on the appropriate method/function. You are free to create your own menu and display. Consider the following case: You have been appointed as a teacher of 3 Gemilang class in SMK Tanjung Malim. Please create a program that can keep the name list of your students in the class. The list must consist of two lists, first list is for all female student's names and the second list is for all male student's names. You must also provide the list of all the student's name. In order to do that, you need to merge both of the list together. The name in the list needs to be sorted alphabetically. The program must consist of the following method function: a) menu() – as interface for the user b) add list(string) - to add name to the list c) sort list) – to sort the name in the list d) show list) - to display the lists e) search list(string) – to search a name in the list f) merge_list(list1, list2) – to display list of students name (merge list)

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

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
Ocaml Map functions left Writeafunctionmap_fun_left : (’a -> ’a) list -> ’a list -> ’a list = that is given a list of functions and a list of elements. For each element apply all functions from left to it and keep the result. Return the results as a list. examples map_fun_left [((+)1);( * )2;fun x->x-10] [1;2;3;4];; - : int list = [-6; -4; -2; 0] map_fun_left [(fun x->int_of_char x|> (+) 32 |> char_of_int);(fun x->char_of_int ((int_of_char x) +1))] [’A’;’B’;’C’;’D’];; - : char list = [’b’; ’c’; ’d’; ’e’]
Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. (See attached photo for reference) void isEmpty() This method will return true if the linked list is empty, otherwise return false. void clear() This method will empty your linked list. Effectively, this should and already has been called in your destructor (i.e., the ~LinkedList() method) so that it will deallocate the nodes created first before deallocating the linked list itself.
Java - Write a non-member method for a "enqueue" that utilizes a doubly linked list. There are three variables available (can be sent) to the method; a “front” reference, a “rear” reference, and a data element (string) (you decide what you need). Empty case is when front and rear are NULL. The node is defined as follows: class node{ node after; node before string data }
Question 40 An application can indicate a specific way to order the elements of a SortedABList list by passing a(n) Comparator object to a constructor of the list class. True False Question 41 A header node is a placeholder node at the beginning of a list, used to simplify list processing. True False Question 42 O(N) is the order of growth execution time of the indexOf operation when using the ABList class, assuming a list size of N. True False Question 43 A trailer node is a placeholder node at the end of a list, used to simplify list processing. True False Question 44 O(1) is the order of growth execution time of the indexOf operation when using the LBList class, assuming a list size of N. True False Question 45 Recall that within the ABList the numElements variable holds the number of elements currently in the list, and the elements array stores those elements. Assuming that a legal index is used, which of the following represents the code for the index-based T…
Java/Data Structures: The public ArrayList() constructor in the Java Class Library ArrayList creates an empty list with an initial capacity of ____. Multiple choice. A) 0 B) 1 C) 10 D) 100
Complete the following function where a node is perculated through a MaxHeap when given the value of the parent node (through the use of a linked list) void BinMaxHeap::percolateUp(BHNode *p) { }
detemine if the following statement are true or false The iterator operation is required by the Iterable interface. A list allows retrieval of information based on the contents of the information.
Use the following node definition for this problem.struct NodeInt32{int32_t value; NodeInt32* next; } Write a function which concatenates two non-empty linked lists. Its exact signature should be: void concat(NodeInt32* headA, NodeInt32* headB); After execution, the tail of headA should point to headB. The skeleton file is below
linked_list_stack_shopping_list_manager.py This is a file that includes the class of linked list based shopping list manager. This class contains such methods as init, insert_item, is_list_empty, print_item_recursive_from_top, print_items_from_top, print_item_recursive_from_bottom, print_items_from_bottom, getLastItem, removeLastItem. In addition, this class requires the inner class to hold onto data as a linked list based on Stack. DO NOT use standard python library, such as deque from the collections module. Please keep in mind the following notes for each method during implementation: Init(): initializes linked list based on Stack object to be used throughout object life. insert_item(item): inserts item at the front of the linked list based on Stack. Parameters: item name. is_list_empty (): checks if the current Stack object is empty (ex. check if head is None). print_item_recursive_from_top(currentNode): a helper method to print linked list based on Stack item recursively. Note:…
a) Understanding linked list with class. Write the following program in your IDE and do the exercise. #include <iostream> using namespace std; // Node class class Node { int data; Node* next; public: Node() {}; void setData(int aData) { data = aData; }; void setNext(Node* aNext) { next = aNext; }; int Data() { return data; }; Node* Next() { return next; }; }; // List class class List { Node *head; public: List() { head = NULL; }; void addNode(int data); }; //Append a node to the linked list void List::addNode(int data) { // Create a new node Node* newNode = new Node(); newNode->setData(data); newNode->setNext(NULL); // Create a temp pointer Node *tmp = head; if ( tmp != NULL ) { // Nodes already present in the list while ( tmp->Next() != NULL ) { tmp = tmp->Next(); } // Point the last node to the new node…
Use the following node definition for this problem.struct NodeInt32{int32_t value; NodeInt32* next;} Write a function which searches a non-empty linked list for a target value. Its exact signature should be: NodeInt32* find(NodeInt32* head, int32_t target); The function should return the first node whose value equals target. If the target is not found in the list, then the function should return NULL.