Suppose that you have a list containing the following 10 letters: A C E G L M P S T Y. Binary search is applied for the following questions.

A)   What is the maximum number of comparisons needed to find if any letter in the alphabet is in the list?
B)   How many comparisons would it take to find if A is in the list? If K is in the list?

2.2.1
cLL
The class is described according to the simple UML diagram below:
2cLL<T>
-head:item<T> *
-size:int
------------------------
+cLL()
+~cLL()
+isEmpty():bool
+getSize():int
+push(newItem: item<T>*):void
+pop():item<T>*
+removeAt(x:T):item<T> *
+printList():void
The class variables are as follows:
• head: The head pointer for the linked list.
• size: The current size of the circular linked list. It starts at 0 and grows as the list
does.
The class methods are as follows:
• cLL: The constructor. It will set the size to 0 and initialise head as null.
• ∼cLL: The class destructor. It will iterate through the circular linked list and
deallocate all of the memory assigned for the items.
• isEmpty: This function returns a bool. If the circular linked list is empty, then it
will return true. Otherwise, if it has items then it will return false.
• getSize: This returns the current size of the circular linked list. If the list is empty
the size should be 0.
• push: This receives a new item and adds it to the circular linked list. It is added to
the front of the list. The front in this case refers to the head.
• pop: This receives, and returns, the first element in the list. The first element is
removed from the list in the process. If the list is empty, return null. The first
element referring to the head pointer in this case.
• removeAt: This will remove an item from the linked list based on its value. If
the value is not found, nothing should be removed. Also note that in the event of
multiple values being found, the first one in the list, from head, should be removed.
Note that nothing is deleted. Instead the node must be removed through relinking
and then returned.
• printList: This will print out the entire list from head onwards. The output consists
of a single comma delimited line, with a newline at the end. For example:
1,2,3,4,5
32.2.2
item
The class is described according to the simple UML diagram below:
item <T>
-data:T
-------------------
+item(t:T)
+~item()
+next: item*
+getData():T
The class has the following variables:
• data: A template variable that stores some piece of information.
• next: A pointer of item type to the next item in the linked list.
The class has the following methods:
• item: This constructor receives an argument and instantiates the data variable with
it.
• ∼item: This is the destructor for the item class. It prints out ”Item Deleted” with
no quotation marks and a new line at the end.
• getData: This returns the data element stored in the item.

In C++ please modify the following program and add characters (char) and names (strings) to be added to the linked list along with integers. The current demo program accepts only integer data, so you would ask the user to select the data type to be added to the linked list. The user should be given the following three choices:

(a) whole numbers

(b) single characters

(c) strings

Once the user makes a selection from the list above then your program should be able to process the data appropriately. This includes:

(a) insert

(b) print

(c) delete

(d) search

(e) copy

You will use the following existing code and modify it to process char and string data type.

Please upload .cpp file(s) along with screenshots of all solutions/screens. You can take a screenshot of your solutions by hitting PrintScreen button on your keyboard and then by pasting that image into a Word document.

Code:
//This program tests various operation of a linked list
//45 67 23 89 -999

#include  
#include  

using namespace std;

template 
struct nodeType
{
        Type info;
        nodeType *link;
};

template 
class circularLinkedList
{
public:
        //Overloads the assignment operator.
        const circularLinkedList& operator=(const circularLinkedList& otherList)
        {
                if (this != &otherList) //avoid self-copy
                {
                        copyList(otherList);
                }//end else

                return *this;
        }

        //Initializes the list to an empty state.
        //Postcondition: first = NULL, last = NULL,
        //                count = 0
        void initializeList()
        {
                destroyList();
        }

        //Function to determine whether the list is empty. 
        //Postcondition: Returns true if the list is empty; otherwise, returns false.
        bool isEmptyList()
        {
                return (first == NULL);
        }


        void print() const
        {
                nodeType *current; //pointer to traverse the list

                current = first->link;

                while (current != first) //while more data to print
                {
                        cout << current->info << " ";
                        current = current->link;
                }

                cout << first->info << " ";
        }

        //Function to return the number of nodes in the list.
        //Postcondition: The value of count is returned.
        int length()
        {
                return count;
        }


        //Function to delete all the nodes from the list.
        //Postcondition: first = NULL, last = NULL, 
        //               count = 0
        void destroyList()
        {
                nodeType *temp;
                nodeType *current = NULL;

                if (first != NULL)
                {
                        current = first->link;
                        first->link = NULL;
                }

                while (current != NULL)
                {
                        temp = current;
                        current = current->link;
                        delete temp;
                }

                first = NULL;   //initialize last to NULL; first has already
                                                //been set to NULL by the while loop
                count = 0;
        }


        //Function to return the first element of the list.
        //Precondition: The list must exist and must not be empty.
        //Postcondition: If the list is empty, then the program terminates; otherwise, the first element of the list is returned.
        Type front()
        {
                assert(first != NULL);
                return first->link->info; //return the info of the first node     
        }


        //Function to return the last element of the list.
        //Precondition: The list must exist and must not be empty.
        //Postcondition: If the list is empty, then the program terminates; otherwise, the last element of the list is returned.
        Type back()
        {
                assert(first != NULL);
                return first->info; //return the info of the first node      
        }


        //Function to determine whether searchItem is in the list.              
        //Postcondition: Returns true if searchItem is found in the list; otherwise, it returns false.
        bool search(const Type& searchItem)
        {
                nodeType *current; //pointer to traverse the list
                bool found = false;

                if (first != NULL)
                {
                        current = first->link;

                        while (current != first && !found)
                        {
                                if (current->info >= searchItem)
                                        found = true;
                                else
                                        current = current->link;

                                found = (current->info == searchItem);
                        }
                }

                return found;
        }


        void insertNode(const Type& newitem)
        {
                nodeType *current; //pointer to traverse the list
                nodeType *trailCurrent; //pointer just before current
                nodeType *newNode;  //pointer to create a node

                bool  found;

                newNode = new nodeType; //create the node

                newNode->info = newitem;   //store newitem in the node
                newNode->link = NULL;      //set the link field of the node
                                                                   //to NULL

                if (first == NULL)  //Case 1    e.g., 3
                {
                        first = newNode;
                        first->link = newNode;
                        count++;
                }
                else
                {
                        if (newitem >= first->info)//e.g., 25 > 3
                        {
                                newNode->link = first->link;
                                first->link = newNode;
                                first = newNode;
                        }
                        else
                        {
                                trailCurrent = first; //e.g., 1 < 3 
                                current = first->link;
                                found = false;

                                while (current != first && !found)
                                        if (current->info >= newitem)
                                                found = true;
                                        else
                                        {
                                                trailCurrent = current;
                                                current = current->link;
                                        }

                                trailCurrent->link = newNode;
                                newNode->link = current;
                        }

                        count++;
                }//end else
        }

        //Function to delete deleteItem from the list.
        //Postcondition: If found, the node containing deleteItem is deleted from the list, first points to the first           
        //                node, and last points to the last node of the updated list. 
        void deleteNode(const Type& deleteItem)
        {
                nodeType *current; //pointer to traverse the list
                nodeType *trailCurrent; //pointer just before current
                bool found;

                if (first == NULL)    //Case 1; list is empty. 
                        cout << "Can not delete from an empty list." << endl;
                else
                {
                        found = false;
                        trailCurrent = first;
                        current = first->link;

                        while (current != first && !found)
                                if (current->info >= deleteItem)
                                        found = true;
                                else
                                {
                                        trailCurrent = current;
                                        current = current->link;
                                }

                        if (current == first)
                        {
                                if (first->info == deleteItem)
                                {
                                        if (first == first->link)
                                                first = NULL;
                                        else
                                        {
                                                trailCurrent->link = current->link;
                                                first = trailCurrent;
                                        }
                                        delete current;

                                        count--;
                                }
                                else
                                        cout << "The item to be deleted is not in the list." << endl;
                        }
                        else
                                if (current->info == deleteItem)
                                {
                                        trailCurrent->link = current->link;
                                        count--;
                                        delete current;
                                }
                                else
                                        cout << "Item to be deleted is not in the list." << endl;
                } //end else
        }


        //Default constructor
        //Initializes the list to an empty state.               
        //Postcondition: first = NULL, last = NULL, 
        //               count = 0 
        circularLinkedList()
        {
                first = NULL;
                count = 0;
        }


        //Copy constructor
        circularLinkedList(const circularLinkedList& otherList)
        {
                first = NULL;
                copyList(otherList);
        }


        //Destructor
        //Deletes all the nodes from the list.
        //Postcondition: The list object is destroyed. 
        ~circularLinkedList()
        {
                destroyList();
        }


protected:
        int count;              //variable to store the number of elements in the list
        nodeType *first; //pointer to the first node of the list
        nodeType *last;  //pointer to the last node of the list 
private:
        //Function to make a copy of otherList.
        //Postcondition: A copy of otherList is created and assigned to this list.
        void copyList(const circularLinkedList& otherList)
        {
                nodeType *newNode;
                nodeType *current;
                nodeType *tempFirst;

                if (first != NULL)
                        destroyList();

                if (otherList.first == NULL)
                {
                        first = NULL;
                        count = 0;
                }
                else
                {
                        current = otherList.first->link;  //current points to the 
                                                                                          //list to be copied
                        count = otherList.count;

                        //copy the first node
                        tempFirst = new nodeType;  //create the node

                        tempFirst->info = current->info; //copy the info
                        last = tempFirst;                    //make last point to the 
                                                                                         //first node
                        current = current->link;     //make current point to the 
                                                                                 //next node

                                                                                 //copy the remaining list
                        while (current != otherList.first)
                        {
                                newNode = new nodeType;  //create a node
                                newNode->info = current->info;
                                last->link = newNode;
                                last = newNode;

                                current = current->link;

                        }//end while

                        if (tempFirst == last)
                        {
                                first = tempFirst;
                                first->link = first;
                        }
                        else
                        {
                                newNode = new nodeType;  //create a node
                                newNode->info = current->info;
                                last->link = newNode;
                                first = newNode;
                                first->link = tempFirst;
                        }

                }//end else
        }
};

int main()
{
        circularLinkedList list1, list2;
        int num;

        cout << "Enter number ending with -999" << endl;
        cin >> num;

        while (num != -999)
        {
                list1.insertNode(num);
                cin >> num;
        }

        cout << endl;

        cout << "List 1: ";
        list1.print();
        cout << endl;

        cout << "Length List 1: " << list1.length() << endl;

        cout << "Enter the number to be searched:  ";
        cin >> num;
        cout << endl;

        if (list1.search(num))
                cout << num << " found in the list" << endl;
        else
                cout << num << " not in the list" << endl;

        cout << "Enter the number to be deleted: ";
        cin >> num;
        cout << endl;

        list1.deleteNode(num);

        cout << "After deleting the node, "
                << "List 1: ";
        list1.print();
        cout << endl;

        cout << "Length List 1: " << list1.length() << endl;

        list2 = list1;

        cout << "List 2: ";
        list2.print();
        cout << endl;

        cout << "Length List 2: " << list2.length() << endl;

        cout << "List 1: ";
        list1.print();
        cout << endl;

        return 0;
}

Baxter, 39 with unexplained weight loss, treated for hyperthyroidism.

Recently married with 1 child. Lives with family in a private home. Employed as a night worker in a factory. Pays out of packet for health services. Resides in zip code 11233

A client scheduled for discharge back to their community New York, Brooklyn, Zip code 11233 from the acute care setting. As the Community Health Nurse assigned to be the Case Manager for this client, you will be required to prepare a discharge plan of care for the client (template provided). Plan of care must focus on Primary, Secondary and Tertiary levels of prevention for management of the client while in the community, resources and knowledge of the resources available within the community. Students provided with a discharge plan template.

Points allotted as follows:

• Identification of 3 Priority Nursing Diagnoses for care in the community – 12%
• Identification of Primary, Secondary and Tertiary levels of prevention appropriate for age, gender and diagnosis – 6%
• Setting S.M.A.R.T objectives for continuity of care in the community setting – 2.0%
• Using the Function Health Status Approach to Community Health Assessment (Chapters 11 and 13), identify the health care agencies within the community ( 11226) that you would most likely collaborate with to ensure that your client receives optimal care in the community setting – 5.0%

As the Community Health Nurse for this client, use the Functional Health Status Approach method for Community Assessment list the agencies available in the zip-code area to facilitate partnering for care of the individual in their community:

For each problem below, state the distribution, list the parameter values and then solve the problem. You may use Excel to solve but you still need to list the distribution name and parameter value(s). For example: Poisson distribution, x=5, ?=0.24, P(5; 0.24) = 0.78

a) A skeet shooter hits a target with probability 0.5. What is the probability that they will hit at least four of the next five targets?

b) You draw a random sample of 15 first graders to participate in a survey, from a class of 39 which has 19 boys and 20 girls. What is the probability that seven of the students selected will be boys?

c) You are given an unlimited number of chances to complete a very difficult problem, but your grade will be lowered each chance you take. Past history says that you have a 30% chance of getting it right. What is the probability that you will get it right on the third try?

Use the following to solve parts d through g

Cars in Miami are sold at a rate of 1.13 per day and on average 12.3% of the cars sold are considered “old” – that is they are model year 2007 or older. It seems to you – a car dealer – that the number of cars and the number of buyers and sellers in the market are very large this month compared to other moths. You decide that age of cars, number of sales and time until next sale are independent across time periods.

d) Find the probability that exactly 1 of the next 7 cars sold will be an “old” car.

e) Find the probability that exactly 9 cars will be sold in the next 7 days.

f) What is the probability that it will be at least 8 days before the next car is sold?

g) Suppose no cars are sold in March. What is the probability that no cars will be sold in the first 7 days of April?

Leadership in Accreditation. As a new university Dean, you learn that two of the three programs in your school did not pass an accrediting review. The school has already implemented three different programs to assist in addressing the issues, but the consultant hired to assist with the remediation process, has told you that these options are still insufficient. What next steps would you recommend be implemented to ensure the programs meet accrediting requirements? Funding is limited, faculty are resistant to more changes, and graduate assistants are no longer available.

In your response to these questions, list models, theories, and authors that you believe to be relevant to the questions. Also, list all standards that may be applicable to the questions and how they apply to your answer-see standards of Education listed below to assist with the answer:

______________________________________________________________________________________________

Educational Leader Standards Option

Standard 1: Human Capital Management

Educational leaders use their role as human capital manager to drive improvements in building leader effectiveness and student achievement.

Standard 2: Instructional Leadership

Educational leaders are acutely focused on effective teaching and learning, possess a deep and comprehensive understanding of best instructional practices, and continuously promote activities that contribute to the academic success of all students.

Standard 3: Personal Behavior

Educational leaders model personal behavior that sets the tone for all student and adult relationships.

Standard 4: Building Relationships

Educational leaders build relationships to ensure that all key stakeholders work effectively with each other to achieve transformative results.

Standard 5: Culture of Achievement

Educational leaders develop an encompassing culture of achievement aligned to the institution’s vision of success for every student.

Standard 6: Organizational, Operational, and Resource Management

Educational leaders’ leverage organizational, operational, and resource management skills to support improvement and achieve desired educational outcomes.

Assignment Details

Framing the Issue

It is important to know that there are at least two sides to every issue. Each side (opinion) should be based on facts that are supported with convincing, reasonable evidence that is credible and current. Before you form an opinion, consider the pros and cons of the issue. Doing this can strengthen your position on the issue—or it can result in a change of opinion on the issue.

For this week’s discussion, complete the following:

1. Choose 1 of the issues in the list below, or you can select any topic you like. If you choose your own topic, make sure the topic is appropriate for an argumentative essay and related to an issue that will hold your interest when you return to the essay in the coming weeks. A good source for this would be current events. Please e-mail your instructor for approval first, and remember academic research methods still apply.
2. Read 1 article on your topic from the list provided in the Topic Bibliography.
3. Express your opinion about the issue in 1 sentence.
4. Use the article you selected to write a paragraph to support your opinion, and be sure to cite it in your response.

Issues to Choose From

• Is TV a leftover media source from the past that will soon be outdated, or is TV keeping up with the times and attracting new viewers?
• How is social media affecting young adults, parents, or teens for better or worse?
• Should high school students be required to take a civics course as a graduation requirement?
• Should journalists try to be objective to regain the public’s confidence?
• Do charter schools hurt traditional public schools?
• Are drug courts the solution to addressing nonviolent drug offenders?
• Should forensic techniques require federal approval for use in court?
• Should the U.S. government provide universal health care?
• Do video games portray positive or negative gender stereotypes?

Baxter, 39 with unexplained weight loss, treated for hyperthyroidism.

Recently married with 1 child. Lives with family in a private home. Employed as a night worker in a factory. Pays out of packet for health services. Resides in zip code 11233

A client scheduled for discharge back to their community New York, Brooklyn, Zip code 11233 from the acute care setting. As the Community Health Nurse assigned to be the Case Manager for this client, you will be required to prepare a discharge plan of care for the client (template provided). Plan of care must focus on Primary, Secondary and Tertiary levels of prevention for management of the client while in the community, resources and knowledge of the resources available within the community. Students provided with a discharge plan template.

Points allotted as follows:

• Identification of 3 Priority Nursing Diagnoses for care in the community – 12%
• Identification of Primary, Secondary and Tertiary levels of prevention appropriate for age, gender and diagnosis – 6%
• Setting S.M.A.R.T objectives for continuity of care in the community setting – 2.0%
• Using the Function Health Status Approach to Community Health Assessment (Chapters 11 and 13), identify the health care agencies within the community ( 11226) that you would most likely collaborate with to ensure that your client receives optimal care in the community setting – 5.0%

As the Community Health Nurse for this client, use the Functional Health Status Approach method for Community Assessment list the agencies available in the zip-code area to facilitate partnering for care of the individual in their community:

Consider this case: Beatrice owns an art supply store called "Betty's Art Store", and has been in the business for over ten years. She is located in downtown Windsor and has many clients including local artists and university/college art students. She sells just about any item a visual artist can imagine, from canvas to coloured paint, charcoal pen, rulers, etc. Betty has a lot of stock and can handle special orders direct from her suppliers should a client needs any special items not found in her inventory. Beatrice is struggling now with her business walk-ins are very low, but knows she can improve her sales if she can have an online storefront and able to carry out online sales. Beatrice wants your services to develop an online eCommerce presence for her business. For this Assignment, you are to take this case study and complete the Inception Phase for it. You will submit the following: 1) Using the FURPS+ model as your guide, what are the list of questions would you want to ask Beatrice before you proceed at your first meeting with her. [MAX 500 words] [3 pts] 2) A complete Inception report (consisting of the artifacts of inception list as your guide), [MAX 2 pages] and [4 pts] 3) A rapid prototype to share with Beatrice at your next meeting in just about 2 weeks, [A partial prototype for <10% of requirements; typically tackles a high-risk item] [2 pts] 4) A decision on whether to proceed with the development (i.e. you build it from scratch) or not to proceed (go somewhere else), clearly outlining the reasoning behind your decision. [1 pts