Questions
1. Define the four types of chips observed in machining. Explain how different chips are obtained...

1. Define the four types of chips observed in machining. Explain how different chips are obtained from materials of different ductility. 2. According to the Merchant Equation, an increase in rake angle would have which of the following results, if all remaining factors are constant (more than one correct answer): a. Decrease in friction angle b. Decrease in power requirements c. Decrease in shear plane angle d. Increase in cutting temperature e. Increase in shear plane angle 3. State and describe the orthogonal cutting model. Define chip ratio and explain why chip ratio is always < 1.0. 4. Explain the effect of cutting temperature in machining on the chip formation and finish of the machined parts. 5. Describe and state the difference between roughing and finishing in machining operations. 6. Define (a) cutting power, (b) Gross Power, and (c) Specific Power along with pertinent equations. 7. State and briefly describe the 3 stages of Tool Wear Rate using a plot. 8. Turning tests have resulted in a 1 minute tool life for cutting speed v = 4 m/s and a 20 minute tool life at a speed v = 2 m/s. a. Determine the values of n and C in the Taylor tool life equation ( , T = tool life [min], v = cutting speed [m/min]) b. Project how long the tool would last at a speed of v = 1 m/s 9. What are the 3 time components of the total production cycle for a part? What is the equation for the cycle time (Tc)? 10. Whatarethe4mainingredientsofacuttingfluid?Whatarethe3mainmethodsbywhichcutting fluids are introduced in a machining operation? 11. Whatarethe4maincosts(withequations)involvedwithproductionofapart?Howiscycletime related to the unit cost of production?

In: Mechanical Engineering

Use the following information for questions 4-5: i. increase in unemployment within the wheat sector ii....

Use the following information for questions 4-5:
i. increase in unemployment within the wheat sector
ii. increase in migration of unskilled laboreres in Country X
iii. increase in productivity associated with producing wheat
iv. increase in demand for wheat during a period of full employment
v. increase in capital stock within Country X
vi. improvement in technology associated with producing corn

4. Which of the event(s) listed above would not shift Country X's PPC?
A. events i and iv
B. events i and ii
C. events i, ii, and iv
D. event iv
E. none of the above

5. Which event(s) listed above would shift Country X's PPC along both axes?
A. event i
B. event i, ii and v
C. events i, iii and vi
D. events ii, iv, v and vi
E. events ii and v

6. The negative slope of the PPC directly illustrates which of the following:
A. any country has only a limited number of fixed factors to use and producing goods and services
B. that country faces opportunity cost when making production-related decisions
C. that a country has fixed rates of productivity associated with producing goods and services
D. The country is incapable of producing outside of their PPC

7. If a country's PPC gets increasingly steeper over time, then:
A. this shift could be explained by an increase in unemployment in the machinery or oil sector
B. this shift could be explained by an increase in demand within the machinery or oil sector
C. this shift could be explained by technological change within the machinery or oil sector
D. The shift could be explained by general increase in productivity within that country
E. both A and B are correct

In: Economics

Electromagnetics Question B1. (a) A generator with Vg = 300 V, and Zg = 50 Ω...

Electromagnetics

Question B1.

(a) A generator with Vg = 300 V, and Zg = 50 Ω is connected to a load ZL =75 Ω through a 50-Ω lossless transmission line of length, l = 0.15λ. Determine the,

(i) Zin, the input impedance of the line at the generator end;

(ii) input current I i and voltage Vi ;

(iii) time-average power delivered to the line, = 0.5 x Re{V .I*};

(iv) load voltage VL, and current, IL; and

(v) the time-average power delivered to the load, = 0.5 x Re{VL .IL*};how does compare to ? Explain?

(vi) compute the time average power delivered by the generator, Pg , and the time average power dissipated in Zg . Is conservation of power satisfied?. [12 marks]

(b) A team of scientists is designing a radar as a probe for measuring the depth of the ice layer over the antarctic land mass. In order to measure a detectable echo due to the reflection by the ice-rock boundary, the thickness of the ice sheet should not exceed three skin depths. If ε' = 3 a n d ε'' = 10-2 for ice and if the maximum anticipated ice thickness in the area under exploration is 1.2 km, what frequency range is useable with the radar? [6 marks]

(c) A 0.5-MHz antenna carried by an airplane flying over the ocean surface generates a wave that approaches the water surface in the form of a normally incident plane wave with an electricfield amplitude of 3,000 (V/m). Sea water is characterized by μr = 1, εr = 72, and σ = 4 S/m. The plane is trying to communicate a message to a submarine submerged at a depth d below the water surface. The submarine’s receiver requires a minimum signal of 0.01 μV/m amplitude, what is the maximum depth d to which successful communication is still possible? [7 marks]

In: Electrical Engineering

Please find error and fill the blank and send as I can copy and paste like...

Please find error and fill the blank and send as I can copy and paste like file or just codes if you can ?
1)
#include <stdio.h>
#include <stdlib.h>

#define Error( Str ) FatalError( Str )
#define FatalError( Str ) fprintf( stderr, "%s ", Str ), exit( 1 )
2) #include "list.h"
#include <stdlib.h>
#include "fatal.h"

/* Place in the interface file */

int Equal(ElementType x, ElementType y)
{
return x==y;
}
void Print(ElementType x)
{
printf("%2d", x);
}

List
CreateList( void )
{
List L;

L = ________________________________;
if( L == NULL )
Error( "Out of memory!" );
L->Next = NULL;
return L;
}

void
MakeEmpty( List L )
{
Position P, Tmp;

/* 1*/ P = L->Next; /* Header assumed */
/* 2*/ L->Next = NULL;
/* 3*/ while( P != NULL )
{
/* 4*/ Tmp = P->Next;
/* 5*/ free( P );
/* 6*/ P = Tmp;
}
}


/* START: fig3_8.txt */
/* Return true if L is empty */

int
IsEmpty( List L )
{
return L->Next == NULL;
}
/* END */

/* START: fig3_9.txt */
/* Return true if P is the last position in list L */
/* Parameter L is unused in this implementation */

int IsLast( Position P, List L )
{
return P->Next == NULL;
}
/* END */

/* START: fig3_10.txt */
/* Return Position of X in L; NULL if not found */

Position
Find( ElementType X, List L )
{
Position P;

/* 1*/ P = L->Next;
/* 2*/ while( P != NULL && !Equal(P->Element, X))
/* 3*/ P = P->Next;

/* 4*/ return _______;
}
/* END */

/* START: fig3_11.txt */
/* Delete (after legal position P) */
/* Assume use of a header node */
void
Delete(List L, Position P )
{
Position TmpCell;

TmpCell = P->Next;
P->Next = TmpCell->Next; /* Bypass deleted cell */
free( TmpCell );
}

/* END */

/* START: fig3_12.txt */
/* If X is not found, then Next field of returned value is NULL */
/* Assumes a header */

Position
FindPrevious( ElementType X, List L )
{
Position P;

/* 1*/ P = L;
/* 2*/ while( P->Next != NULL && !Equal(P->Next->Element, X) )
/* 3*/ P = P->Next;

/* 4*/ return P;
}
/* END */

/* START: fig3_13.txt */
/* Insert (after legal position P) */
/* Header implementation assumed */
/* Parameter L is unused in this implementation */

void
Insert( ElementType X, List L, Position P )
{
Position TmpCell;

/* 1*/ TmpCell = (Position)malloc( sizeof( struct Node ) );
/* 2*/ if( TmpCell == NULL )
/* 3*/ Error( "Out of space!!!" );

/* 4*/ TmpCell->Element = X;
/* 5*/ ____________________;
/* 6*/ P->Next = TmpCell;
}
/* END */

/* START: fig3_15.txt */
/* Correct DeleteList algorithm */

void
DeleteList( List L )
{
PtrToNode P, Tmp;

P = L;
while( P != NULL )
{
Tmp = P->Next;
free( P );
____________;
}
}
/* END */

Position
Header( List L )
{
return ________;
}

Position
First( List L )
{
return _________;
}

Position
Advance( Position P )
{
return ___________;
}

ElementType
Retrieve( Position P )
{
return ____________;
}

void Modify( ElementType X, Position P )
{
P->Element = X;
}

void PrintList(List L)
{
Position pL;
ElementType e;

pL = First(L);
while (pL) {
e = Retrieve(pL);
Print(e);
pL = Advance(pL);
}
printf(" ");
}

3)

#ifndef _List_H
#define _List_H



typedef int ElementType;
struct Node {
ElementType Element;
struct Node *Next;
};
typedef struct Node
*PtrToNode, *List, *Position;


void MakeEmpty( List L );
List CreateList( void );
int IsEmpty( List L );
int IsLast( Position P, List L );
Position Find( ElementType X, List L );
void Delete( List L, Position P );
Position FindPrevious( ElementType X, List L );
void Insert( ElementType X, List L, Position P );
void DeleteList( List L );
Position Header( List L );
Position First( List L );
Position Advance( Position P );
ElementType Retrieve( Position P );
void Modify( ElementType X, Position P );
void PrintList(List L);

#endif /* _List_H */
/* END */

4)

#include "stdio.h"
#include "list.h"
#include "fatal.h"


List Union(List A, List B) {
List C;
Position pA, pB, pC;
ElementType e;

C = CreateList();
pC = Header(C);

pA = First(A);
while (pA) {
e = Retrieve(pA);
Insert(e, C, pC);
pA = Advance(pA);
}

pB = First(B);
while (pB) {
e = Retrieve(pB);
if (!Find(e, A))
Insert(e, C, pC);
pB = Advance(pB);
}
return C;
}


int main() {
List A, B, C;
int j;


A = CreateList(); B = CreateList();

printf("Please input set A(finished with -1): ");
scanf("%d", &j);
while (j != -1){
Insert(j, A, Header(A));
scanf("%d", &j);
}
printf("A:"); PrintList(A);

printf("Please input set B(finished with -1): ");
scanf("%d", &j);
while (j != -1){
Insert(j, B, Header(B));
scanf("%d", &j);
}
printf("B:"); PrintList(B);

C = Union(A, B);
printf("C:"); PrintList(C);

DeleteList(A); DeleteList(B); DeleteList(C);

return 1;
}

In: Computer Science

c++ programming What will the following C++ code display? int numbers[4]={99,87}; cout<<numbers[3]<<endl; 87                     &nbs

c++ programming

  1. What will the following C++ code display?

int numbers[4]={99,87};

cout<<numbers[3]<<endl;

  1. 87                            b. 0                                  c. garbage                        d. an error
  1. What is the output of the following program segment?

double mylist[5];

for(int i=0; i<5; i++)

mylist[i]= (pow(i,2)+ 1 /2.0;

cout<<fixed<<showpoint<<setprecision(2);

for(int i=0; i<5; i++)

{ cout<<setw(5)<<mylist[i];

}

              a. .5           1.5        4.5        9.5        16.5

              b. 0.50      1.50      4.50      9.50     16.50

             c. 0.50      1.50      8.50     27.50     64.50

            d. 0.50      1.50      2.50      3.50      4.50

     15. what is stored in list after the following C++ statement is executed?

     int list [8];

list[0]=1;

list[1]=2;

for(int i=2; i<7; i++)

{

     list[i]= list[i-1] * list[i-2];

     cout<<setw(5)<<list[i];

}

  1. 2    4    8   16   32          b. 2    4    8   16 256         c. 2    4    8   64 256        d. 2    4    8   32 256

  1. What is the output of the following C++ segment?

      int i;

int list [8];

list[0]=1;

list[1]=2;

for(int i=2; i<7; i++)

{

     list[i]= list[i-1] * list[i-2];

     cout<<setw(5)<<list[i];

}

for(int i=2; i<7; i++)

{

if( i>3)

    list[i]= list[i]- list[i-1];

cout<<setw(5)<<list[i];

}   

    a.    2    4    16   32 256    2    4    8   28   228      b. 2    4    4   16 256    2    4    4   28      228

   c. 2    4    8   32       256     2     2    4   28 228      d. 2    4    8   32 256    2    4    4   28     228

Given int numbers[]= { 12,145,567,100,1001};

  1. Write a function to indicate the position of the highest data?
  2. Write a function to determine the maximum value of the numbers [];

Given:

struct nameType { string first_name;   string last_Name;      string middle_Name;   };

struct addressType { string address; string city; string state; string zip; };

struct courseType { string course_Name; int course_number; string major; };

struct dateType { int month; int day; int year;   };

struct studentType { nameType name; int student_ID; addressType address; dateType enrolled;};

  1. How many of the following are invalid ?

studentType student;

studentType array[89];

courseType course;

nameType name;

student.gpa=4.0;

student.name.first_name="Robert";

student.course.course_Name="Chem";

array[0].enrolled=student.enrolled;

array[1].name.first_name="Jane";

  1. 1                                        b. 3                             c. 2.                                  d. none
  1. How of the following statements are invalid ?

studentType student;

studentType array[89];

courseType course;

nameType name;

student.gpa=4.0;

student.name="Robert";

student.course.="Chem";

array[0].enrolled=student.enrolled;

array[1].name.first_name="Jane";

  1. 1                                     b. 3                                  c. 2                                   d. none

In: Computer Science

In November 24, 2014, Netflix filed a lawsuit against its former vice president of IT operations,...

In November 24, 2014, Netflix filed a lawsuit against its former vice president of IT operations, Mike Kail, alleging fraud, breach of fiduciary duties, and other charges. Here is an excerpt from the lawsuit filing in Superior Court of the State of California, Santa Clara County:.

“…During his tenure at Netflix, including as Netflix’s Vice President of Information Technology Operations, Kail was a trusted senior-level Netflix employee.  Kail’s job responsibilities at Netflixincluded negotiating and executing contracts on behalf of Netflix to acquire IT-related products and services…approving invoices for payments that third parties would request related to IT products and services purchased by Netflix….after Kail approved such invoices, Netflix would pay the third parties for these approved invoices. Kail was a trusted, senior-level Netflix employee, with authority to enter into appropriate contracts and approve appropriate invoices.” (See entire legal document at http://www.scribd.com/doc/248259590/Netflix-v-Kail.)

Netflix is suing Mr. Kail for fraud, breach of fiduciary duties, and other actions. Mr. Kail was in charge of entering into and authorizing contracts for Netflix’s tech vendors, which included two companies, Vistara IT and Netenrich (both founded/owned by Mr. Raju Chekuri.) At the same time, Mr. Kail had his own company on the side called Unix Mercenary, which he did not disclose to Netflix.

Mr. Kail’s company Unix Mercenary received 12 – 15% commissions on all contract invoices paid by Netflix to Vistara IT and Netenrich. Part of the evidence that Netflix outlines in its lawsuit are emails between Mr. Kail and employees of Netenrich which refer to “referral fees” from Netenrich to Unix. Here is an excerpt from an email from Netenrich to Kail (from the above-mentioned lawsuit filing):

…”[We] discussed getting you paid and I just need to ensure the payments from Netflix are in Netenrich’s bank account…I suggest we employ the following process to ensure you receive your referral fees on a timely basis…”

Over a three year period, Netflix paid approximately $3.7 million to Vistara IT and Netenrich, which would translate into commission payments of between $440,000 - $550,000 to Unix Mercenary. The lawsuit only mentions specific payments of $76,000 to Unix Mercenary.

Incidentally, Mike Kail left Netflix in August 2014 to become Yahoo’s Chief Information Officer (CIO).

Respond to the following questions in the MODULE 6 Discussion Forum

What internal control principle(s) does it appear was (were) violated at Netflix?

How might Netflix have designed its internal processes differently to avoid the situation that arose with Mr. Kail?

Should Mr. Kail be held totally liable for this situation? Does Netflix have any degree of responsibility in this situation?

Specifications

In: Accounting

Complete the Module 6 Discussion Forum In November 24, 2014, Netflix filed a lawsuit against its...

Complete the Module 6 Discussion Forum

In November 24, 2014, Netflix filed a lawsuit against its former vice president of IT operations, Mike Kail, alleging fraud, breach of fiduciary duties, and other charges. Here is an excerpt from the lawsuit filing in Superior Court of the State of California, Santa Clara County:.

“…During his tenure at Netflix, including as Netflix’s Vice President of Information Technology Operations, Kail was a trusted senior-level Netflix employee.  Kail’s job responsibilities at Netflix included negotiating and executing contracts on behalf of Netflix to acquire IT-related products and services…approving invoices for payments that third parties would request related to IT products and services purchased by Netflix….after Kail approved such invoices, Netflix would pay the third parties for these approved invoices. Kail was a trusted, senior-level Netflix employee, with authority to enter into appropriate contracts and approve appropriate invoices.” (See entire legal document at http://www.scribd.com/doc/248259590/Netflix-v-Kail.)

Netflix is suing Mr. Kail for fraud, breach of fiduciary duties, and other actions. Mr. Kail was in charge of entering into and authorizing contracts for Netflix’s tech vendors, which included two companies, Vistara IT and Netenrich (both founded/owned by Mr. Raju Chekuri.) At the same time, Mr. Kail had his own company on the side called Unix Mercenary, which he did not disclose to Netflix.

Mr. Kail’s company Unix Mercenary received 12 – 15% commissions on all contract invoices paid by Netflix to Vistara IT and Netenrich. Part of the evidence that Netflix outlines in its lawsuit are emails between Mr. Kail and employees of Netenrich which refer to “referral fees” from Netenrich to Unix. Here is an excerpt from an email from Netenrich to Kail (from the above-mentioned lawsuit filing):

…”[We] discussed getting you paid and I just need to ensure the payments from Netflix are in Netenrich’s bank account…I suggest we employ the following process to ensure you receive your referral fees on a timely basis…”

Over a three year period, Netflix paid approximately $3.7 million to Vistara IT and Netenrich, which would translate into commission payments of between $440,000 - $550,000 to Unix Mercenary. The lawsuit only mentions specific payments of $76,000 to Unix Mercenary.

Incidentally, Mike Kail left Netflix in August 2014 to become Yahoo’s Chief Information Officer (CIO).

Respond to the following questions in the MODULE 6 Discussion Forum

What internal control principle(s) does it appear was (were) violated at Netflix?

How might Netflix have designed its internal processes differently to avoid the situation that arose with Mr. Kail?

Should Mr. Kail be held totally liable for this situation? Does Netflix have any degree of responsibility in this situation?

In: Accounting

Task 1: Remove Number Complete the function remove number such that given a list of integers...

Task 1: Remove Number

Complete the function remove number such that given a list of integers and an integer n, the function removes every instance of n from the list. Remember that this function needs to modify the list, not return a new list.

Task 2: Logged List

The log2() function is one of an algorithm designer’s favourite functions. You’ll learn more about this later, but briefly – if your input size is 1048576 elements, but you only look at log2(1048576) elements, you’ll really just look at 20 elements.

Bongo, an algorithm designer, designs algorithms that take lists as inputs. Being an efficient designer, all his algorithms are designed such that they look at log2(n) elements if the number of elements in the input list is n.

To assist him, we’ve designed the logged list function. This function takes a list l as input and returns a new list such that it has all the elements in original list l which occur at indices that are powers of 2. For example: indices 1, 2, 4, 8, 16, 32, etc.

However, something is wrong. The function isn’t just returning a list with elements at all indices that are powers of 2. Fix the function so it works correctly!

You must make sure that the fixes are minor fixes. Just like major lab 2, this means that your code will not need a lot of changes.

Task 3: Move Zeros

It’s trivial that the value of a number remains the same no matter how many zeros precede it. However, adding the zeros at the end of the number increases the value * 10.

Jasmine is tired of seeing “001/100” on her tests (well yes, no one really writes 001, but Jasmine’s teacher finds it funny to do so). So, she managed to login to her teacher’s computer and now wants to design a function that can move the 0’s in her grade to the end before her teacher uploads her grades.

Although we don’t agree with Jasmine’s tactics, Krish (Jasmine’s mentor) told us to help her out by finishing the ‘move zeros’ function. This function should move all the 0’s in the given list to the end while preserving the order of the other elements. Remember that this function needs to modify the list, not return a new list!

Task 4: Find Number

Tony (your team member at work) implemented a function find number which is supposed to return the index of a number in a list if the number is in the list, else return -1. However, it doesn’t work the way it’s expected to...

Fix the function so it works correctly. Just like Task 2, your fixes should be minor fixes. Don’t try adding more code, you only need to see how you can change the existing code a bit.

See the Starter code below:

# DO NOT ADD ANY OTHER IMPORTS

from typing import List

def remove_number(lst: List[int], number: int) -> None:

    """

        Remove every instance of number in lst. Do this

        *in-place*, i.e. *modify* the list. Do NOT

        return a new list.

    >>> lst = [1, 2, 3]

    >>> remove_number(lst, 3)

    >>> lst

    [1, 2]

    """

    pass

def logged_list(lst: List[object]) -> List[object]:

    """

    Return a new list such that it has all the objects

    in lst which occur at indices which are powers of 2

    >>> logged_list([0, 1, 2, 3, 4, 5, 6, 7, 8])

    [1, 2, 4, 8]

    """

    # TODO: FIX

    i = 0

    new_lst = []

    while i < len(lst) - 1:

        new_lst.append(lst[i])

        i += 2

    return new_lst

def move_zeros(lst: List[int]) -> None:

    """

    Move all the 0's in lst to the END of the lst *in-place*,

    i.e. *modify* the list, DONT return a new list

    >>> lst = [1, 0, 2, 3]

    >>> move_zeros(lst)

    >>> lst

    [1, 2, 3, 0]

    """

    pass

def find_number(lst: List[int], number: int) -> int:

    """

    Return the first index of the number if the number is in the

    lst else return -1

    >>> find_number([1, 2, 3], 3)

    2

    >>> find_number([1, 2, 3], 4)

    -1

    """

    # TODO: this code needs to be fixed. Fix

    found = False

    i = 0

    while not found:

        if lst[i] == number:

            found = True

        else:

            found = False

            i += 1

    if found:

        return i

    return -1

if __name__ == '__main__':

    # uncomment the code below once you are done the lab

    # import doctest

    # doctest.testmod()

    pass

In: Computer Science

Complete the provided C++ program, by adding the following functions. Use prototypes and put your functions...

Complete the provided C++ program, by adding the following functions. Use prototypes and put your functions below main.

1. Write a function harmonicMeans that repeatedly asks the user for two int values until at least one of them is 0. For each pair, the function should calculate and display the harmonic mean of the numbers. The harmonic mean of the numbers is the inverse of the average of the inverses. The harmonic mean of x and y can be calculated as harmonic_mean = 2.0 * x * y / (x + y);. Sample output: Enter two integer values: 2 4 The harmonic mean of 2 and 4 is 2.66667 Enter two integer values: 2 6 The harmonic mean of 2 and 6 is 3 Enter two integer values: 2 9 The harmonic mean of 2 and 9 is 3.27273 Enter two integer values: 2 0

2. Write a function named capEs that takes a string reference as a parameter and changes every 'e' character to 'E'. The function should not return a value. Expected output: Hello Ernie! with cap Es: HEllo ErniE! Eeeee Eee Eeee with cap Es: EEEEE EEE EEEE

3. Write a function named binaryToDecimal that accepts an integer parameter whose digits are meant to represent binary (base-2) digits, and returns an integer of that number's representation in decimal (base-10). For example, the call of binaryToDecimal(101011) should return 43. Constraints: Do not use a string in your solution. Do not use any container such as array or vector. Also do not use any built-in base conversion functions from the system libraries.

4. Write a function named removeConsecutiveDuplicates that accepts as a parameter a reference to a vector of integers, and modifies it by removing any consecutive duplicates. For example, if a vector named v stores {1, 2, 2, 3, 2, 2, 3}, the call of removeConsecutiveDuplicates(v); should modify it to store {1, 2, 3, 2, 3}. Note: to remove an element at index i in a vector named v, use this: v.erase(v.begin() + i);

#include <iostream>

#include <string>

#include <vector>

#include <cstdlib>

// Code for the problems

using namespace std;

int main() {

// problem 1 test

harmonicMeans();

cout << endl;

// problem 2 tests

string testString1 = "Hello Ernie!";

cout << testString1 << " with cap Es: ";

capEs(testString1);

cout << testString1 << endl;

testString1 = "Eeeee Eee Eeee";

cout << testString1 << " with cap Es: ";

capEs(testString1);

cout << testString1 << endl << endl;;

// problem 3 tests

int n = 101100;

cout << n << " in binary: " << binaryToDecimal(n) << endl;

n = 1000;

cout << n << " in binary: " << binaryToDecimal(n) << endl << endl;

// problem 4 tests

vector<int> v{ 1, 2, 2, 3, 2, 2, 3 };

cout << "before removeConsecutiveDuplicates: ";

for (int i = 0; i < v.size(); ++i) {

cout << v[i] << ' ';

}

removeConsecutiveDuplicates(v);

cout << endl << "after removeConsecutiveDuplicates: ";

for (int i = 0; i < v.size(); ++i) {

cout << v[i] << ' ';

}

cout << endl;

vector<int> w{ 11, 11, 11, 44, 44, 0, 29, 33, 33, 33, 33, 33 };

cout << "before removeConsecutiveDuplicates: ";

for (int i = 0; i < w.size(); ++i) {

cout << w[i] << ' ';

}

removeConsecutiveDuplicates(w);

cout << endl << "after removeConsecutiveDuplicates: ";

for (int i = 0; i < w.size(); ++i) {

cout << w[i] << ' ';

}

cout << endl;

system("pause");

return 0;

}

In: Computer Science

Use the ListInterface operations only to create a tackPunct routine in C++ that will take a...

Use the ListInterface operations only to create a tackPunct routine in C++ that will take a list of string (array or linked, your choice) as a reference. Use the list operations on the passed list to make all items that don’t have a ‘.’, ‘?’ or ‘!’ have a ‘.’ tacked on.

In: Computer Science