C / C++ / MFC

pbBuff = 0x000001d45061df80 "{\\rtf1\\ansi\\deff0{\\fonttbl{\\f0\\fnil\\fcharset0 Courier New;}}\r\n\\viewkind4\\uc1\\pard\\lang1033\\f0\\fs17

 {\rtf1\ansi\deff0{\fonttbl{\f0\fnil\
\viewkind4 GPR 00=000000_00000114 GPR 04=00000000_FFFF

static DWORD MyStreamOutGPRCallback(DWORD_PTR dwCookie, LPBYTE pbBuff, LONG cb, LONG* pcb)

BOOL CGPRegs::OnInitDialog()
{
	gprrichedit = new CRichEditCtrl;
	CDialog::OnInitDialog();
	gprrichedit->SetSel(0, -1);
	gprrichedit->Clear();
	return TRUE;
}
CGPRegs::~CGPRegs()
{
}

void CGPRegs::DoDataExchange(CDataExchange* pDX)
{
	CDialog::DoDataExchange(pDX);
	DDX_Control(pDX, IDC_RICHEDIT22, (CWnd &)*gprrichedit);
}

Given following definition for singly linked list node and a pointer type:

 

struct Node {

     int num;

     Node* next;

     Node() = delete;

     Node(int num) : num{ num }, next{ nullptr } {}

};

 

typedef Node* NodePtr;

 

 

Use following prototype:

 

void quiz2(NodePtr& head1, NodePtr& target, NodePtr& head2)

 

to design a function that:

Takes in two linked lists, indicated by head1 and head2, and a NodePtr target
Searches target Node in linked list 1 (by comparing address, not by value):
If found, then connect the whole linked list 2 to the target node. In other words, use list 2 to replace nodes after target. Also update head2 to nullptr as the merged linked list should have only one entry point at head1.
If not found, then connect list 2 to the end of list 1, and set head2 to nullptr for the same above reason.
 

For example,

list 1: 10->20->30->40, target is the address of node 20, list 2: 11->12->13, then after calling the function, list 1 should be 10->20->11->12->13.
list 1: 10->20->30->40, target is an address that cannot be found in list 1, list 2: 11->12->13, then after calling the function, list 1 should be 10->20->30->40->11->12->13.
 

When merging, please take care of memory and do not let leak happen. You will be deducted by 10 points if memory leak happens. (Hint: in the first example, what should happen to nodes 30 and 40?)

 

Submit one .cpp file as your answer to Quiz 2.

 

Develop your own work and DO NOT CHEAT. Violator will be found, reported, and penalized with F grade for this course. 

 

Attach FileNo file chosen 

// Get Latest Windows Update
        private void LastWinUpd()
        {
           
            Runspace runspace = RunspaceFactory.CreateRunspace();
            runspace.Open();

            PowerShell ps = PowerShell.Create();
            ps.Runspace = runspace;

            //ps.Commands.AddScript("gwmi win32_quickfixengineering | Select-Object -expandProperty 'installedon' | sort installedon -desc | Select-Object -First 1 | Get-Date -Format 'yyyy - MM - dd K'");

            ps.AddCommand("$a = (New - Object - com 'Microsoft.Update.AutoUpdate').Results");
            ps.AddCommand("$a.LastInstallationSuccessDate | Get - Date - Format 'yyyy-MM-dd K'");

            Collection<PSObject> results = ps.Invoke();

            runspace.Close();

            StringBuilder stringBuilder = new StringBuilder();
            foreach (PSObject obj in results)
            {
                text_LastWinUpd.Text = obj.ToString();
            }
           
        }
        // END