Design a customer care class for AIRTEL. Hava sufficient variables and operations maintain the log data for the customers those who call airtel. Maintain the log data of the objects as an entry in the Linked List of a collection. Maintain necessary functions supported by linked list collection class.

Design a customer care class for AIRTEL. Hava sufficient variables and operations maintain the log data for the customers those who call airtel. Maintain the log data of the objects as an entry in the Linked List of a collection. Maintain necessary functions supported by linked list collection class.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 15PE

See similar textbooks

Similar questions

Question 4 For this question, let's combine ADTS and dictionaries! Let's try to make an ADT that represents a politician. The politician ADT has a constructor make_politician. There are three selectors, get_name, get_party, and get_age. When implementing an ADT, you have the freedom to choose how you want to represent it. Some common data structures used to represent ADTs are lists and dictionaries. The city ADT was implemented using a list. Now, let's use dictionaries to implement our politician ADT. You must use a dictionary for this question, or else you will not pass the tests.
A linked list cannot be used to represent a collection. This is a data structure that does not contain any data. Sets do not include any resemblance to one other. Union and intersection are examples of set functions that may be used to sets.
in c++ please A LinkNode structure or class which will have two attributes - a data attribute, and a pointer attribute to the next node. The data attribute of the LinkNode should be a reference/pointer of the Currency class of Lab 2. Do not make it an inner class or member structure to the SinglyLinkedList class of #2 below. A SinglyLinkedList class which will be composed of three attributes - a count attribute, a LinkNode pointer/reference attribute named as and pointing to the start of the list and a LinkNode pointer/reference attribute named as and pointing to the end of the list. Since this is a class, make sure all these attributes are private. The class and attribute names for the node and linked list are the words in bold in #1 and #2. For the Linked List, implement the following linked-list behaviors as explained in class - getters/setters/constructors/destructors, as needed, for the attributes of the class. createList method in addition to the constructor - this is…
Create a header and source files that contain the class definition and implementation of the following members: a. Define studentName (string), studentId(string), and grade (float) data members. b. Define three constructors to initialize the data members. c. Define member methods to implement the creation, insertion (could be anywhere), and deletion (could be anywhere) of student records implemented as linked list. Name the source file that contains the main function as ProgExer03.cpp. You may choose an appropriate name for the class header and source files.
Tour.java Create a Tour data type that represents the sequence of points visited in a TSP tour. Represent the tour as a circular linked list of nodes, one for each point in the tour. Each Node contains two references: one to the associated Point and the other to the next Node in the tour. Each constructor must take constant time. All instance methods must take time linear (or better) in the number of points currently in the tour. To represent a node, within Tour.java, define a nested class Node: private class Node { private Point p; private Node next; } Your Tour data type must implement the following API. You must not add public methods to the API; however, you may add private instance variables or methods (which are only accessible in the class in which they are declared). public class Tour // Creates an empty tour. public Tour() // Creates the 4-point tour a→b→c→d→a (for debugging). public Tour(Point a, Point b, Point c, Point d) // Returns the number of points in this tour. public…
Subject : Data Structure Q: As discussed in the class that for implementation of the list data structures the interface of the list will be stayed the same. Explain what is meant by interface of list? What are the different operations performed on any data structure?
To separate the implementation's functionality from the kind of data it uses, the programmer creates a class. Functions and classes can handle any data type because of this. headers in a file a method that is not real As a generic class, a design template is
TRUE OR FALSE 1. It is possible to traverse the elements of a Set without using an Iterator? 2. The functionality of functional interfaces is limited to one.
You are required to implement the following functions using the Last In First Out data structure.Create a Student class with data-members name, regNo, department and cGpa. You are required to implement the following functions using the First In First Out (queue) data structure• Constructor – for initializing the default values of a Students• setData( ) – for setting the data in the data members from the user• isEmpty( ) – for checking whether queue of students is empty• isFull( ) – for checking whether queue of students is full• enqueue( ) – for inserting a student in a queue. If the queue is full, you are required to ask the user whether he/she wants to insert even if the queue is full. If the user says yes, then re-size your queue to create a bigger queue. Also, check whether the student is already in the queue or not. If the new student is already in the stack, display the user a message stating the book is already in the queue.• dequeue( ) – for removing a student from the queue•…
To partition the functionality of an implementation from the information it requires, programmers often establish a class. Consequently, this means that functions and classes may work with any kind of data. a data file with headers an artificial approach Instances of a generic class layout
Your Tasks ● Read the description thoroughly and carefully to understand exactly what IsolateTargetSoloAsTail is meant to do and the IMPORTANT requirements you must meet when implementing the function. ● Fill in the prototype for IsolateTargetSoloAsTail in the supplied header file (llcpInt.h). ● Fill in the definition for IsolateTargetSoloAsTail in the supplied implementation file (llcpImp.cpp). ●If node target cannot be found on the given list, a new node containing target is created and added to the end (made the new tail node) of the list. ●If target appears only once on the given list, the target-matching node is moved to the end (made the new tail node) of the list. If target appears multiple times on the given list, the first target-matching node is moved to the end (made the new tail node) of the list, and all other target-matching nodes are to be deleted from the list. The order in which non-target-matching nodes originally appear in the given…
Coding language: C++. (Try to avoid linked lists if possible please). Add comments. Thanks. • Each functionality component must be implemented as a separate function, though the function does not need to be declared and defined separately • No global variables are allowed • No separate.hor.hpp are allowed • You may not use any of the hash tables, or hashing functions provided by the STL or Boost library to implement your hash table • Appropriate, informative messages must be provided for prompts and outputs You must implement a hash table using the Double Hashing collision strategy and the mid-square base 10 hashing function with an R of 2. Your collision strategy must be implemented as a separate function, though it may be implemented inside your insert/search/delete functions, and should halt an insert / search/delete functions, and should halt an insert/search/delete after table size number of collisions. Your hash function must be implemented as a separate function. Your hash table…