I need to fill-in TODOs in .cpp file and in .h file Could some.pdf
•
0 likes•2 views
I need to fill-in //TODO\'s in .cpp file and in .h file Could someone help me at least with few of them to give me an idea how deal with it. ***SinglyLinkedList.cpp #include #include #include \"SinglyLinkedList.h\" void test_constructor() { SinglyLinkedList lst = {100, 200, 300, 400, 500}; assert(*lst.at(0) == 100); assert(*lst.at(1) == 200); assert(*lst.at(2) == 300); assert(*lst.at(3) == 400); assert(*lst.at(4) == 500); assert(lst.size() == 5); } void test_remove() { SinglyLinkedList lst = {100, 200, 300, 400, 500}; lst.remove(2); assert(*lst.at(0) == 100); assert(*lst.at(1) == 200); assert(*lst.at(2) == 400); assert(*lst.at(3) == 500); assert(lst.size() == 4); } void test_insert() { // TODO } void test_push_back() { // TODO } void test_push_front() { // TODO } void test_append() { // TODO } void test_sum() { // TODO } int main() { test_constructor(); test_remove(); test_insert(); test_push_back(); test_push_front(); test_append(); test_sum(); } ***SinglyLinkedList.h #include #include template class SinglyLinkedList { // Nested class representing the nodes in the list. class SinglyLinkedListNode { public: // The value stored in this node. T value; // The next node in the sequence. SinglyLinkedListNode *next; SinglyLinkedListNode(T value) : value(value), next(nullptr) {} SinglyLinkedListNode(T value, SinglyLinkedListNode *next) : value(value), next(next) {} // Return the size (length) of the linked list. std::size_t size(); }; SinglyLinkedListNode *head; SinglyLinkedListNode *tail; public: // Constructs a new SinglyLinkedList from an initializer_list of type T[]. // This is mostly for convenience, especially when testing. SinglyLinkedList(std::initializer_list items) : head(nullptr), tail(nullptr) { if (items.size() == 0) { return; } // initializer_lists were designed to be used iteratively, // so thats what we do. // Can you think of how to write this recursively? auto it = items.begin(); while (it != items.end()) { this->push_back(*it++); } } // Return a pointer to the value at the given index. // If the index is larger than the size of the list, // return a nullptr. // // ASIDE: We will cover exceptions later. T* at(std::size_t i); // Pushes a new node onto the back of the list. void push_back(T value); // Pushes a new node onto the front of the list. void push_front(T value); // Return the size (length) of the linked list. std::size_t size(); // Remove the specified node from the list. void remove(std::size_t i); // Insert the value at the index. void insert(std::size_t i, T value); // Append the given list to this one. void append(SinglyLinkedList list); }; template T* SinglyLinkedList::at(std::size_t i) { // TODO } template void SinglyLinkedList::push_back(T value) { // TODO // Make sure that this is a O(1) operation! } template void SinglyLinkedList::push_front(T value) { // TODO // Make sure that this is a O(1) operation! } template void SinglyLinkedList::remove(std::size_t i) { // TODO // Don\'t forget to not only unlink the node, b.
Report
Share
Report
Share
Download to read offline
![}
void test_sum() {
// TODO
}
int main() {
test_constructor();
test_remove();
test_insert();
test_push_back();
test_push_front();
test_append();
test_sum();
}
***SinglyLinkedList.h
#include
#include
template
class SinglyLinkedList {
// Nested class representing the nodes in the list.
class SinglyLinkedListNode {
public:
// The value stored in this node.
T value;
// The next node in the sequence.
SinglyLinkedListNode *next;
SinglyLinkedListNode(T value) :
value(value), next(nullptr) {}
SinglyLinkedListNode(T value, SinglyLinkedListNode *next) :
value(value), next(next) {}
// Return the size (length) of the linked list.
std::size_t size();
};
SinglyLinkedListNode *head;
SinglyLinkedListNode *tail;
public:
// Constructs a new SinglyLinkedList from an initializer_list of type T[].](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
–PLS write program in c++Recursive Linked List OperationsWrite a.pdf
–PLS write program in c++
Recursive Linked List Operations
Write a C++ to manage a list of string elements. Besides the basic operations expected of a
linked list (add an element, remove an element, check for empty list, report size (number) of
elements in the list, and print out the content of the list), the linked list class also needs to have a
method called sort() and a method called reverse() the manipulate the string elements. The sort
method rearranges the elements in the list so they are sorted in alphabetical order. The reverse
method reverses the order of the elements of the list. The class should use recursion to
implement the sort and reverse operations
Solution
#include
#include
#include
#include
struct node //declaring node
{
int info;
struct node *next;
}*start;
class single_llist //declaring class
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
main()
{
int choice, nodes, position, i;
char str[100];
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (strcmp(ptr->info > s->info))
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
void single_llist::delete_pos() //delete element from given position
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2.
Help please, I have attached LinkedList.cpp and LinkedList.hPlease.pdf
Help please, I have attached LinkedList.cpp and LinkedList.h
Please help with the implementation of the Stack.h and Stack.cpp as well
LinkedList.cpp
~~~~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
void LinkedList::insertAtFront(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
if (last == NULL)
first = last = temp;
else
{
temp->next = first;
first = temp;
}
}
bool LinkedList::removeFromFront()
{
if (first == NULL)
return false;
Node *temp = first;
first = first->next;
free(temp);
if (first == NULL)
last = NULL;
return true;
}
LinkedList.h
~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *.
lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx
lab08/build.bat
@echo off
cls
set DRIVE_LETTER=%1:
set PATH=%DRIVE_LETTER%\MinGW\bin;%DRIVE_LETTER%\MinGW\msys\1.0\bin;%DRIVE_LETTER%\MinGW\gtkmm3\bin;%DRIVE_LETTER%\MinGW\gtk\bin;c:\Windows;c:\Windows\system32
set PROJECT_PATH=.
make DRIVE_LETTER="%DRIVE_LETTER%" PROJECT_DIR="%PROJECT_PATH%"
lab08/CSC2110/CD.h
#if !defined CD_H
#define CD_H
#include "Song.h"
#include "Text.h"
using CSC2110::String;
#include "ListArray.h"
using CSC2110::ListArray;
namespace CSC2110
{
class CD
{
private:
String* artist;
String* title;
int year;
int rating;
int num_tracks;
ListArray<Song>* songs;
public:
CD(String* artist, String* title, int year, int rating, int num_tracks);
virtual ~CD();
String* getKey();
void addSong(String* title, String* length);
void displayCD();
static ListArray<CD>* readCDs(const char* file_name);
static int compare_items(CD* one, CD* two);
static int compare_keys(String* sk, CD* cd);
static char getRadixChar(CD* cd, int index); //1-based
};
}
#endif
lab08/CSC2110/Double.h
#if !defined (DOUBLE_H)
#define DOUBLE_H
namespace CSC2110
{
class Double
{
private:
double value;
public:
Double(double val);
~Double();
double getValue();
};
}
#endif
lab08/CSC2110/HighPerformanceCounter.h
#if !defined (HIGHPERFORMANCECOUNTER_H)
#define HIGHPERFORMANCECOUNTER_H
namespace CSC2110
{
class HighPerformanceCounter
{
private:
double micro_spt; //micro_seconds per tick
HighPerformanceCounter();
static HighPerformanceCounter* hpc;
static int getTicksPerSecond();
public:
virtual ~HighPerformanceCounter();
static HighPerformanceCounter* getHighPerformanceCounter();
int getCurrentTimeInTicks();
double getTimeDifferenceInMicroSeconds(int start_time, int end_time);
};
}
#endif
lab08/CSC2110/Integer.h
#if !defined (INTEGER_H)
#define INTEGER_H
namespace CSC2110
{
class Integer
{
private:
int value;
public:
Integer(int val);
virtual ~Integer();
int getValue();
};
}
#endif
lab08/CSC2110/Keyboard.h
#if !defined KEYBOARD_H
#define KEYBOARD_H
#include "Text.h"
using CSC2110::String;
#include <string>
using namespace std;
namespace CSC2110
{
class Keyboard
{
private:
Keyboard();
public:
virtual ~Keyboard();
static Keyboard* getKeyboard();
//pre: the string (character literal) that will prompt the user for input
//post: the input read from the keyboard interpreted as an int is returned
int readInt(string prompt);
int getValidatedInt(string prompt, int min, int max);
//pre: the string that will prompt the user for input
//post: the input read from the keyboard interpreted as a double is returned
double readDouble(string prompt);
double getValidatedDouble(string prom ...
In C++Write a recursive function to determine whether or not a Lin.pdf
In C++
Write a recursive function to determine whether or not a Linked List is in sorted order (smallest
value to largest value).
Add the following function prototypes to your List class under the section for access functions,
then implement the functions below the class definition:
public:
/**Access Functions*/
bool isSorted();
//Wrapper function that calls the isSorted helper function to determine whether
//a list is sorted in ascending order.
//We will consider that a list is trivially sorted if it is empty.
//Therefore, no precondition is needed for this function
private:
bool isSorted(Nodeptr node);
//Helper function for the public isSorted() function.
//Recursively determines whether a list is sorted in ascending order.
#include //for NULL
#include
#include
using namespace std;
template //list stores generic list data, not any specific C++ type
class List
{
private:
struct Node
{
listdata data;
Node* next;
Node* previous;
Node(listdata data): data(data), next(NULL), previous(NULL){}
};
typedef struct Node* Nodeptr;
Nodeptr first;
Nodeptr last;
Nodeptr iterator;
int size;
public:
/**Constructors and Destructors*/
List();
//Default constructor; initializes and empty list
//Postcondition: numeric values equated to zero, or strings should be empty.
List(const List &list);
~List();
//Destructor. Frees memory allocated to the list
//Postcondition: position NodePtr at next Node
/**Accessors*/
listdata getFirst();
//Returns the first element in the list
//Precondition:NodePtr points to the first node on list
listdata getLast();
//Returns the last element in the list
//Precondition: make new node first on the list
listdata getIterator();
bool isEmpty();
//Determines whether a list is empty.
int getSize();
//Returns the size of the list
/**Manipulation Procedures*/
void startIterator();
void advanceIterator();
void removeLast();
//Removes the value of the last element in the list
//Precondition: list is not empty, not the first element.
//Postcondition: one remaining node
void removeIterator();
void removeFirst();
//Removes the value of the first element in the list
//Precondition: list is not empty
//Postcondition: no nodes left
void insertLast(listdata data);
//Inserts a new element at the end of the list
//If the list is empty, the new element becomes both first and last
//Postcondition: next equal to null
void insertFirst(listdata data);
//Inserts a new element at the start of the list
//If the list is empty, the new element becomes both first and last
//Postcondition:point nodePtr next node on list
/**Additional List Operations*/
bool offEnd();
void printList();
//Prints to the console the value of each element in the list sequentially
//and separated by a blank space
//Prints nothing if the list is empty
void insertIterator(listdata data);
bool operator==(const List &list);
};
// constructor definition
template
List::List(): first(NULL), last(NULL), iterator(NULL), size(0) {}
template
List::List(const List &list): size(list.size)
{
if(list..
1- The design of a singly-linked list below is a picture of the functi (1).pdf
1. The design of a singly-linked list
below is a picture of the function that needs to be used
below is the code of the above picture:
#include <string>
#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
#define defaultSize 100
void Assert(bool val, string s)
{
if (!val)
{ // Assertion failed -- close the program
cout << "Assertion Failed: " << s << endl;
exit(-1);
}
}
template <typename E>
class Link {
public:
E element; // Value for this node
Link *next; // Pointer to next node in list
// Constructors
Link(const E& elemval, Link<E>* nextval = NULL)
{ element = elemval; next = nextval; }
Link(Link<E>* nextval =NULL) { next = nextval; }
};
template <typename E>
class LList: public Link<E> {
private:
Link<E>* head;// Intialization helper method
Link<E>* tail;// Pointer to last element
Link<E>* curr;// Access to current element
int cnt;// Size of list
void init(){// Intialization helper method
curr = tail = head = new Link<E>;
cnt = 0;
}
void removeall() {// Return link nodes to free store
while(head != NULL) {
curr = head;
head = head->next;
delete curr;
}
}
public:
LList(int size=defaultSize) { init(); }// Constructor
~LList() { removeall(); }// Destructor
void print() const;// Print list contents
void clear() { removeall(); init(); }// Clear list
// Insert "it" at current position
void insert(const E& it) {
curr->next = new Link<E>(it, curr->next);
if (tail == curr) tail = curr->next; // New tail
cnt++;
}
void append(const E& it) { // Append "it" to list
tail = tail->next = new Link<E>(it, NULL);
cnt++;
}
// Remove and return current element
E remove() {
Assert(curr->next != NULL, "No element");
E it = curr->next->element; // Remember value
Link<E>* ltemp = curr->next; // Remember link node
if (tail == curr->next) tail = curr; // Reset tail
curr->next = curr->next->next; // Remove from list
delete ltemp; // Reclaim space
cnt--; // Decrement the count
return it;
}
void moveToStart()// Place curr at list start
{ curr = head; }
void moveToEnd() // Place curr at list end
{ curr = tail; }
void prev(){
if (curr == head) return;
Link<E>* temp = head;
while (temp->next!=curr) temp=temp->next;
curr = temp;
}
void next(){ if (curr != tail) curr = curr->next; }
int length() const { return cnt; }
int currPos() const {
Link<E>* temp = head;
int i;
for (i=0; curr != temp; i++)
temp = temp->next;
return i;
}
void moveToPos(int pos){
Assert ((pos>=0)&&(pos<=cnt), "Position out of range");
curr = head;
for(int i=0; i<pos; i++) curr = curr->next;
}
const E& getValue() const {
Assert(curr->next != NULL, "No value");
return curr->next->element;
}
};
completed this code to fulfill the requirement below:
Write a function to insert an integer into a singly-linked list of elements arranged from largest to
smallest. Requires that elements remain ordered after insertion.
2. The design of array-based stack
below is a picture of the function that needs to be used
below is the code of the above picture:
#include <string.h>
#.
How do you stop infinite loop Because I believe that it is making a.pdf
How do you stop infinite loop? Because I believe that it is making an infinite circular list.
c++ code:
Here is the list class:
#ifndef LIN_J_LIST
#define LIN_J_LIST
typedef unsigned int uint;
#include
#include
using namespace std;
/**
* a simplified generic singly linked list class to illustrate C++ concepts
* @author Jerry Lin
* @version 2/17/17
*/
template< typename Object >
class List
{
private:
/**
* A class to store data and provide a link to the next node in the list
*/
class Node
{
public:
/**
* The constructor
* @param data the data to be stored in this node
*/
explicit Node( const Object & data )
: data{ data }, next{ nullptr } {}
Object data;
Node * next;
};
public:
/**
* The constructor for an empty list
*/
List()
: size{ 0 }, first{ nullptr }, last{ nullptr } {}
/**
* the copy constructor-creates and copy the list
*/
List( List && rhs ) = delete;
List( const List & rhs )
{
count = 0;
size = 0;
if(rhs.size != 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first;
size++;
while(current->next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op.
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode->next;
size++;
}
}
// you document and implement this method
}
/**
* the operator= method-copies the list
*/
List & operator=( List && rhs) = delete;
List & operator=( const List & rhs )
{
count = 0;
size = 0;
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
if(rhs.size!= 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first; //create a temporary to store
size++;
while(current -> next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode -> next;
size++;
}
}
return *this;
// you document and implement this method
}
/**
* accessor
* @return count
*/
int get_count() const
{
return count;
}
/**
* The destructor that gets rid of everything that\'s in the list and
* resets it to empty. If the list is already empty, do nothing.
*/
~List()
{
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
}
/**
* Put a new element onto the beginning of the list
* @param item the data the new element will contain
*/
void push_front( const Object& item )
{
Node * new_node = new Node( item );//basic op.
if(is_empty())
{
last = new_node;
}
else
{
new_node->next = first;
}
first = new_node;
size++;
/* you complete the rest */
}
/**
* Remove the element that\'s at the front of the list. Causes an
* assertion error if the list is empty.
*/
void pop_front()
{
assert( !is_empty() );
Node * temp = first;
if( first == last )
{
first = last = nullptr;
}
else
{
first = first->next;
}
delete temp;
size--;
}
/**
* Accessor to return the da.
C++ Program to Implement Singly Linked List #includei.pdf
/*
* C++ Program to Implement Singly Linked List
*/
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<<\"1.Insert Node at beginning\"<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (ptr->info > s->info)
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
/*
* Delete element at a given position
*/
void single_llist::delete_pos()
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<>pos;
cout<<\"Enter the new value: \";
cin>>value;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start->info = value;
}
else
{
for (i = 0;i < pos - 1;i++)
{
if (s == NULL)
{
cout<<\"There are less than \"<next;
}
s->info = value;
}
cout<<\"Node Updated\"<>value;
struct node *s;
s = start;
while (s != NULL)
{
pos++;
if (s->info == value)
{
flag = true;
cout<<\"Element \"<next;
}
if (!flag)
cout<<\"Element \"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2 = ptr3;
ptr3 = ptr3->next;
ptr2->next = ptr1;
}
start = ptr2;
}
/*
* Display Elements of a link list
*/
vo.
I want help in the following C++ programming task. Please do coding .pdf
I want help in the following C++ programming task. Please do coding in C++.
Persistent Data Structures
A persistent data structure is one in which we can make changes (such as inserting and removing
elements) while still preserving the original data structure Of course, an easy way to do this is to
create a new copy of the entire data structure every time we perform an operation that changes
the data structure, but it is much more efficient to only make a copy of the smallest possible
portion of the data structure.
First, let\'s look at one of the easiest possible data structures — a stack, implemented using a
linked list.
Persistent Stack
Let\'s say that we have a stack S1, and we want to create a new stack S2, which is the result of
pushing a new element X onto S1, without changing S1 at all. This is easy — we just add a new
element that points to S1:
Starting with the stack S1:
We push X on S1, to get S2, leaving S1 as it was. So after the operation we have two versions of
the stack S1 the older version with elements A, B and C and S2 the newer version with elements
X, A, B and C.
What about popping? That works in the same way. Starting with our original S1 (elements A, B
and C), we can pop off the first element (A), to get S2:
What if we want to push something on to this new stack? It works in the same was as before – if
we push an X onto S2 above to get S3, we have
So for every operation you make a new version of the stack while reusing any existing stack
elements.
You will have to make a linked list of pointers that will point to the head of the different stack
versions.
Also each stack is also implemented as a linked list of elements SAB
Solution
#include #include #include #include #include #include #include #include #include
#include #include namespace dts { template > class PersistentSet { public:
PersistentSet(); PersistentSet(Func); bool add(const T&); bool add(T&&);
bool remove(const T& key); bool empty() const; size_t history_size() const;
class TreeIterator : public std::iterator, std::ptrdiff_t, const T*,
const T&> { using node = typename dts::PersistentSet< std::remove_cv_t,
Func>::Nodeptr; node itr; node nil; std::stack path; node
find_successor(node n) { n = n->rigth; if (n != nil) {
while (n->left != nil) { path.push(n); n = n->left;
} } else { n = path.top();
path.pop(); } return n; } public: explicit
TreeIterator(node n, node pnil) : nil(pnil) //begin { if (n == nil) itr
= nil; else { path.push(nil); while (n->left != nil)
{ path.push(n); n = n->left; } itr =
n; } } explicit TreeIterator(node pnil) // end : itr(pnil),
nil(pnil) { } TreeIterator& operator++ () { itr =
find_successor(itr); return *this; } TreeIterator operator++ (int)
{ TreeIterator tmp(*this); itr = find_successor(itr); return tmp;
} bool operator == (const TreeIterator& rhs) const { return itr ==
rhs.itr; } bool operator != (const TreeIterator& rhs) const {
return itr != rhs.itr; } const T& operator* () const { return itr-
>key; } const T& operator-> () c.
Recommended
–PLS write program in c++Recursive Linked List OperationsWrite a.pdf
–PLS write program in c++
Recursive Linked List Operations
Write a C++ to manage a list of string elements. Besides the basic operations expected of a
linked list (add an element, remove an element, check for empty list, report size (number) of
elements in the list, and print out the content of the list), the linked list class also needs to have a
method called sort() and a method called reverse() the manipulate the string elements. The sort
method rearranges the elements in the list so they are sorted in alphabetical order. The reverse
method reverses the order of the elements of the list. The class should use recursion to
implement the sort and reverse operations
Solution
#include
#include
#include
#include
struct node //declaring node
{
int info;
struct node *next;
}*start;
class single_llist //declaring class
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
main()
{
int choice, nodes, position, i;
char str[100];
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (strcmp(ptr->info > s->info))
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
void single_llist::delete_pos() //delete element from given position
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2.
Help please, I have attached LinkedList.cpp and LinkedList.hPlease.pdf
Help please, I have attached LinkedList.cpp and LinkedList.h
Please help with the implementation of the Stack.h and Stack.cpp as well
LinkedList.cpp
~~~~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
void LinkedList::insertAtFront(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
if (last == NULL)
first = last = temp;
else
{
temp->next = first;
first = temp;
}
}
bool LinkedList::removeFromFront()
{
if (first == NULL)
return false;
Node *temp = first;
first = first->next;
free(temp);
if (first == NULL)
last = NULL;
return true;
}
LinkedList.h
~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *.
lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx
lab08/build.bat
@echo off
cls
set DRIVE_LETTER=%1:
set PATH=%DRIVE_LETTER%\MinGW\bin;%DRIVE_LETTER%\MinGW\msys\1.0\bin;%DRIVE_LETTER%\MinGW\gtkmm3\bin;%DRIVE_LETTER%\MinGW\gtk\bin;c:\Windows;c:\Windows\system32
set PROJECT_PATH=.
make DRIVE_LETTER="%DRIVE_LETTER%" PROJECT_DIR="%PROJECT_PATH%"
lab08/CSC2110/CD.h
#if !defined CD_H
#define CD_H
#include "Song.h"
#include "Text.h"
using CSC2110::String;
#include "ListArray.h"
using CSC2110::ListArray;
namespace CSC2110
{
class CD
{
private:
String* artist;
String* title;
int year;
int rating;
int num_tracks;
ListArray<Song>* songs;
public:
CD(String* artist, String* title, int year, int rating, int num_tracks);
virtual ~CD();
String* getKey();
void addSong(String* title, String* length);
void displayCD();
static ListArray<CD>* readCDs(const char* file_name);
static int compare_items(CD* one, CD* two);
static int compare_keys(String* sk, CD* cd);
static char getRadixChar(CD* cd, int index); //1-based
};
}
#endif
lab08/CSC2110/Double.h
#if !defined (DOUBLE_H)
#define DOUBLE_H
namespace CSC2110
{
class Double
{
private:
double value;
public:
Double(double val);
~Double();
double getValue();
};
}
#endif
lab08/CSC2110/HighPerformanceCounter.h
#if !defined (HIGHPERFORMANCECOUNTER_H)
#define HIGHPERFORMANCECOUNTER_H
namespace CSC2110
{
class HighPerformanceCounter
{
private:
double micro_spt; //micro_seconds per tick
HighPerformanceCounter();
static HighPerformanceCounter* hpc;
static int getTicksPerSecond();
public:
virtual ~HighPerformanceCounter();
static HighPerformanceCounter* getHighPerformanceCounter();
int getCurrentTimeInTicks();
double getTimeDifferenceInMicroSeconds(int start_time, int end_time);
};
}
#endif
lab08/CSC2110/Integer.h
#if !defined (INTEGER_H)
#define INTEGER_H
namespace CSC2110
{
class Integer
{
private:
int value;
public:
Integer(int val);
virtual ~Integer();
int getValue();
};
}
#endif
lab08/CSC2110/Keyboard.h
#if !defined KEYBOARD_H
#define KEYBOARD_H
#include "Text.h"
using CSC2110::String;
#include <string>
using namespace std;
namespace CSC2110
{
class Keyboard
{
private:
Keyboard();
public:
virtual ~Keyboard();
static Keyboard* getKeyboard();
//pre: the string (character literal) that will prompt the user for input
//post: the input read from the keyboard interpreted as an int is returned
int readInt(string prompt);
int getValidatedInt(string prompt, int min, int max);
//pre: the string that will prompt the user for input
//post: the input read from the keyboard interpreted as a double is returned
double readDouble(string prompt);
double getValidatedDouble(string prom ...
In C++Write a recursive function to determine whether or not a Lin.pdf
In C++
Write a recursive function to determine whether or not a Linked List is in sorted order (smallest
value to largest value).
Add the following function prototypes to your List class under the section for access functions,
then implement the functions below the class definition:
public:
/**Access Functions*/
bool isSorted();
//Wrapper function that calls the isSorted helper function to determine whether
//a list is sorted in ascending order.
//We will consider that a list is trivially sorted if it is empty.
//Therefore, no precondition is needed for this function
private:
bool isSorted(Nodeptr node);
//Helper function for the public isSorted() function.
//Recursively determines whether a list is sorted in ascending order.
#include //for NULL
#include
#include
using namespace std;
template //list stores generic list data, not any specific C++ type
class List
{
private:
struct Node
{
listdata data;
Node* next;
Node* previous;
Node(listdata data): data(data), next(NULL), previous(NULL){}
};
typedef struct Node* Nodeptr;
Nodeptr first;
Nodeptr last;
Nodeptr iterator;
int size;
public:
/**Constructors and Destructors*/
List();
//Default constructor; initializes and empty list
//Postcondition: numeric values equated to zero, or strings should be empty.
List(const List &list);
~List();
//Destructor. Frees memory allocated to the list
//Postcondition: position NodePtr at next Node
/**Accessors*/
listdata getFirst();
//Returns the first element in the list
//Precondition:NodePtr points to the first node on list
listdata getLast();
//Returns the last element in the list
//Precondition: make new node first on the list
listdata getIterator();
bool isEmpty();
//Determines whether a list is empty.
int getSize();
//Returns the size of the list
/**Manipulation Procedures*/
void startIterator();
void advanceIterator();
void removeLast();
//Removes the value of the last element in the list
//Precondition: list is not empty, not the first element.
//Postcondition: one remaining node
void removeIterator();
void removeFirst();
//Removes the value of the first element in the list
//Precondition: list is not empty
//Postcondition: no nodes left
void insertLast(listdata data);
//Inserts a new element at the end of the list
//If the list is empty, the new element becomes both first and last
//Postcondition: next equal to null
void insertFirst(listdata data);
//Inserts a new element at the start of the list
//If the list is empty, the new element becomes both first and last
//Postcondition:point nodePtr next node on list
/**Additional List Operations*/
bool offEnd();
void printList();
//Prints to the console the value of each element in the list sequentially
//and separated by a blank space
//Prints nothing if the list is empty
void insertIterator(listdata data);
bool operator==(const List &list);
};
// constructor definition
template
List::List(): first(NULL), last(NULL), iterator(NULL), size(0) {}
template
List::List(const List &list): size(list.size)
{
if(list..
1- The design of a singly-linked list below is a picture of the functi (1).pdf
1. The design of a singly-linked list
below is a picture of the function that needs to be used
below is the code of the above picture:
#include <string>
#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
#define defaultSize 100
void Assert(bool val, string s)
{
if (!val)
{ // Assertion failed -- close the program
cout << "Assertion Failed: " << s << endl;
exit(-1);
}
}
template <typename E>
class Link {
public:
E element; // Value for this node
Link *next; // Pointer to next node in list
// Constructors
Link(const E& elemval, Link<E>* nextval = NULL)
{ element = elemval; next = nextval; }
Link(Link<E>* nextval =NULL) { next = nextval; }
};
template <typename E>
class LList: public Link<E> {
private:
Link<E>* head;// Intialization helper method
Link<E>* tail;// Pointer to last element
Link<E>* curr;// Access to current element
int cnt;// Size of list
void init(){// Intialization helper method
curr = tail = head = new Link<E>;
cnt = 0;
}
void removeall() {// Return link nodes to free store
while(head != NULL) {
curr = head;
head = head->next;
delete curr;
}
}
public:
LList(int size=defaultSize) { init(); }// Constructor
~LList() { removeall(); }// Destructor
void print() const;// Print list contents
void clear() { removeall(); init(); }// Clear list
// Insert "it" at current position
void insert(const E& it) {
curr->next = new Link<E>(it, curr->next);
if (tail == curr) tail = curr->next; // New tail
cnt++;
}
void append(const E& it) { // Append "it" to list
tail = tail->next = new Link<E>(it, NULL);
cnt++;
}
// Remove and return current element
E remove() {
Assert(curr->next != NULL, "No element");
E it = curr->next->element; // Remember value
Link<E>* ltemp = curr->next; // Remember link node
if (tail == curr->next) tail = curr; // Reset tail
curr->next = curr->next->next; // Remove from list
delete ltemp; // Reclaim space
cnt--; // Decrement the count
return it;
}
void moveToStart()// Place curr at list start
{ curr = head; }
void moveToEnd() // Place curr at list end
{ curr = tail; }
void prev(){
if (curr == head) return;
Link<E>* temp = head;
while (temp->next!=curr) temp=temp->next;
curr = temp;
}
void next(){ if (curr != tail) curr = curr->next; }
int length() const { return cnt; }
int currPos() const {
Link<E>* temp = head;
int i;
for (i=0; curr != temp; i++)
temp = temp->next;
return i;
}
void moveToPos(int pos){
Assert ((pos>=0)&&(pos<=cnt), "Position out of range");
curr = head;
for(int i=0; i<pos; i++) curr = curr->next;
}
const E& getValue() const {
Assert(curr->next != NULL, "No value");
return curr->next->element;
}
};
completed this code to fulfill the requirement below:
Write a function to insert an integer into a singly-linked list of elements arranged from largest to
smallest. Requires that elements remain ordered after insertion.
2. The design of array-based stack
below is a picture of the function that needs to be used
below is the code of the above picture:
#include <string.h>
#.
How do you stop infinite loop Because I believe that it is making a.pdf
How do you stop infinite loop? Because I believe that it is making an infinite circular list.
c++ code:
Here is the list class:
#ifndef LIN_J_LIST
#define LIN_J_LIST
typedef unsigned int uint;
#include
#include
using namespace std;
/**
* a simplified generic singly linked list class to illustrate C++ concepts
* @author Jerry Lin
* @version 2/17/17
*/
template< typename Object >
class List
{
private:
/**
* A class to store data and provide a link to the next node in the list
*/
class Node
{
public:
/**
* The constructor
* @param data the data to be stored in this node
*/
explicit Node( const Object & data )
: data{ data }, next{ nullptr } {}
Object data;
Node * next;
};
public:
/**
* The constructor for an empty list
*/
List()
: size{ 0 }, first{ nullptr }, last{ nullptr } {}
/**
* the copy constructor-creates and copy the list
*/
List( List && rhs ) = delete;
List( const List & rhs )
{
count = 0;
size = 0;
if(rhs.size != 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first;
size++;
while(current->next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op.
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode->next;
size++;
}
}
// you document and implement this method
}
/**
* the operator= method-copies the list
*/
List & operator=( List && rhs) = delete;
List & operator=( const List & rhs )
{
count = 0;
size = 0;
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
if(rhs.size!= 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first; //create a temporary to store
size++;
while(current -> next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode -> next;
size++;
}
}
return *this;
// you document and implement this method
}
/**
* accessor
* @return count
*/
int get_count() const
{
return count;
}
/**
* The destructor that gets rid of everything that\'s in the list and
* resets it to empty. If the list is already empty, do nothing.
*/
~List()
{
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
}
/**
* Put a new element onto the beginning of the list
* @param item the data the new element will contain
*/
void push_front( const Object& item )
{
Node * new_node = new Node( item );//basic op.
if(is_empty())
{
last = new_node;
}
else
{
new_node->next = first;
}
first = new_node;
size++;
/* you complete the rest */
}
/**
* Remove the element that\'s at the front of the list. Causes an
* assertion error if the list is empty.
*/
void pop_front()
{
assert( !is_empty() );
Node * temp = first;
if( first == last )
{
first = last = nullptr;
}
else
{
first = first->next;
}
delete temp;
size--;
}
/**
* Accessor to return the da.
C++ Program to Implement Singly Linked List #includei.pdf
/*
* C++ Program to Implement Singly Linked List
*/
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<<\"1.Insert Node at beginning\"<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (ptr->info > s->info)
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
/*
* Delete element at a given position
*/
void single_llist::delete_pos()
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<>pos;
cout<<\"Enter the new value: \";
cin>>value;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start->info = value;
}
else
{
for (i = 0;i < pos - 1;i++)
{
if (s == NULL)
{
cout<<\"There are less than \"<next;
}
s->info = value;
}
cout<<\"Node Updated\"<>value;
struct node *s;
s = start;
while (s != NULL)
{
pos++;
if (s->info == value)
{
flag = true;
cout<<\"Element \"<next;
}
if (!flag)
cout<<\"Element \"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2 = ptr3;
ptr3 = ptr3->next;
ptr2->next = ptr1;
}
start = ptr2;
}
/*
* Display Elements of a link list
*/
vo.
I want help in the following C++ programming task. Please do coding .pdf
I want help in the following C++ programming task. Please do coding in C++.
Persistent Data Structures
A persistent data structure is one in which we can make changes (such as inserting and removing
elements) while still preserving the original data structure Of course, an easy way to do this is to
create a new copy of the entire data structure every time we perform an operation that changes
the data structure, but it is much more efficient to only make a copy of the smallest possible
portion of the data structure.
First, let\'s look at one of the easiest possible data structures — a stack, implemented using a
linked list.
Persistent Stack
Let\'s say that we have a stack S1, and we want to create a new stack S2, which is the result of
pushing a new element X onto S1, without changing S1 at all. This is easy — we just add a new
element that points to S1:
Starting with the stack S1:
We push X on S1, to get S2, leaving S1 as it was. So after the operation we have two versions of
the stack S1 the older version with elements A, B and C and S2 the newer version with elements
X, A, B and C.
What about popping? That works in the same way. Starting with our original S1 (elements A, B
and C), we can pop off the first element (A), to get S2:
What if we want to push something on to this new stack? It works in the same was as before – if
we push an X onto S2 above to get S3, we have
So for every operation you make a new version of the stack while reusing any existing stack
elements.
You will have to make a linked list of pointers that will point to the head of the different stack
versions.
Also each stack is also implemented as a linked list of elements SAB
Solution
#include #include #include #include #include #include #include #include #include
#include #include namespace dts { template > class PersistentSet { public:
PersistentSet(); PersistentSet(Func); bool add(const T&); bool add(T&&);
bool remove(const T& key); bool empty() const; size_t history_size() const;
class TreeIterator : public std::iterator, std::ptrdiff_t, const T*,
const T&> { using node = typename dts::PersistentSet< std::remove_cv_t,
Func>::Nodeptr; node itr; node nil; std::stack path; node
find_successor(node n) { n = n->rigth; if (n != nil) {
while (n->left != nil) { path.push(n); n = n->left;
} } else { n = path.top();
path.pop(); } return n; } public: explicit
TreeIterator(node n, node pnil) : nil(pnil) //begin { if (n == nil) itr
= nil; else { path.push(nil); while (n->left != nil)
{ path.push(n); n = n->left; } itr =
n; } } explicit TreeIterator(node pnil) // end : itr(pnil),
nil(pnil) { } TreeIterator& operator++ () { itr =
find_successor(itr); return *this; } TreeIterator operator++ (int)
{ TreeIterator tmp(*this); itr = find_successor(itr); return tmp;
} bool operator == (const TreeIterator& rhs) const { return itr ==
rhs.itr; } bool operator != (const TreeIterator& rhs) const {
return itr != rhs.itr; } const T& operator* () const { return itr-
>key; } const T& operator-> () c.
Please solve the TODO parts include LinkedListcpph tem.pdf
Please solve the TODO parts.
#include "LinkedListcpp.h"
template <class T>
class Queue: public LinkedList<T>{
//private: ListNode<T> * back;
public:
//Queue<T>();
void add(T t);
void remove();
void remove(std::string title);
};
#include "Queue.h"
//template <class T>
//Queue<T>::Queue(){
// back=nullptr;
//}
//TODO
// add an element t to the end of queue- implement using an existing LinkedList method.
template <class T>
void Queue<T>::add(T t){
}
//TODO
//remove an element from the front of the queue-implement using an existing LinkedList method
template <class T>
void Queue<T>::remove(){
//TODO
// if queue us empty
// throw new std::string("NULL POINTER EXCEPTION QUEUE IS EMPTY n");
}
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
void populateRequests(Queue<Request>& q);
void populateSongDataBase(LinkedList<Song> &list);
void processQueue(LinkedList<Song> &list,Queue<Request>& q);
void processRequest(std::string action, std::string title,std::string singer,int chartPos);
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"*************************************n";
list.printList(); //
std::cout<<"*************************************n";
populateRequests(q); // fill the request q
std::cout<<"n";
std::cout<<"---------------PRINTING QUEUE-------------------n";
q.printList();
std::cout<<"------------------------------------n";
processQueue(list,q); // process the requests
std::cout<<"*************************************n";
list.printList();
std::cout<<"*************************************n";
}
//GIVEN
//Requires an empty linked list
//Effects fills the list with request by reading from the RequestData.txt
//Modifies the queue by filling it
void populateRequests(Queue<Request> &q){
}
//GIVEN
std::string playSong(LinkedList<Song>&list, Song s){
if (list.get(s)>=0){
return "PLAYING :"+ s.toString()+"n";
}
else{
return "SONG NOT FOUNDn";
}
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
std::cout<<"PLAYING TOP TEN SONG __________n";
list.print(10);
;
}
//Requires filled Song Database, a Song to add. The chart position given in the song is where it
will get added. Note this is a Song that is not supposed to exist in database.
//Effects adds the song from its original chart position
//Modifies the Song database. Adjust chart position of all Songs affected by this addition- this
adjustment is done in insert method using adjustPosition method. If the Process Queue adds a
Song that already is in the database, then a duplicate entry can occur.
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
/* Use this code
if (found>=0) {std::cout<<"ADDED THIS SONG "<<found+1<<" " ;list.printSong(found+1);}
else std::cout<<"SORRY CANNOT FIND SONG n";
*/
}
//TODO
//Requires filled Song Database, a Song to remove
//Effects if found, removes the song from its original .
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a problem with the nodes, as it is
posting errors with the nodes.
please help me with this problem. thank you.
public class LinkLists {
/* only need to store a single pointer to the node at the head
* of the list.
* The pointer is null if the list is empty.
* Also record the size of the list.
*/
protected Node head;
/* invariant: size is the number of nodes in the list pointed to by head */
protected int size;
/* no-arguments default constructor creates an empty list */
public LinkLists() {
head = null; // start with an empty list
size = 0;
}
/* accessor method */
public int size() {
return size;
}
/* value to add to the end of the list
*/
public void add(T value) {
head = addAtEnd(head, value);
size++;
}
/* node of the list to which the value should be added
* value to add to the end of the list
*/
private Node addAtEnd(Node node, T value) {
if (node == null) { // special case
return new Node(value, null);
} else if (node.getNext() == null) { // other special case
node.setNext(new Node(value, null));
} else {
addAtEnd(node.getNext(), value);
}
return node;
}
/* iterative implementation of the same method
* value to add to the end of the list
*/
public void add2(T value) {
if (head == null) {
head = new Node(value, null);
} else {
Node node = head; // guaranteed not to be null initially
while (node.getNext() != null) {
node = node.getNext(); // guaranteed not to be null here
}
// now, node.getNext() is guaranteed to be null
// similar to the second special case in addAtEnd
node.setNext(new Node(value, null));
}
size++;
}
public void remove(int position) throws BadItemCountException {
if ((position < 1) || (position > size)) {
throw new
BadItemCountException(\"invalid position \" + position +
\", only 1..\" + size + \" available\");
}
if (position == 1) {
head = head.getNext();
} else {
Node node = head;
for (int i = 2; i < position; i++) {
node = node.getNext();
}
node.setNext(node.getNext().getNext());
}
size--; // one less item
}
public String toString() {
return toString(head);
}
private String toString(Node node) {
if (node == null) {
return \"\";
} else {
return node.getValue() + \"\ \" + toString(node.getNext());
}
}
public static void main(String[] args) {
/* create two empty lists, make sure they print out correctly */
LinkLists list1 = new LinkLists();
LinkLists list2 = new LinkLists();
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* insert some items, keep checking */
list1.add(\"hello\");
list1.add(\"world\");
list2.add(\"foo\");
list2.add(\"bar\");
list2.add(\"baz\");
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* remove an item at an invalid position */
boolean caught = false;
try {
list2.remove(4);
} catch .
C++11 - STL Additions
This presentation considers certain specific features of C++11 and additions to STL library (uniform initialization, new containers and methods, move semantics).
Presentation by Taras Protsiv (Software Engineer, GlobalLogic), Kyiv, delivered at GlobalLogic C++ TechTalk in Lviv, September 18, 2014.
More details -
http://www.globallogic.com.ua/press-releases/lviv-cpp-techtalk-coverage
Shapes and calculate (area and contour) / C++ oop concept
Shapes and calculate (area and contour) / C++ oop concept
C++ projectMachine Problem 7 - HashingWrite a program to do the .pdf
C++ project
Machine Problem 7 - Hashing
Write a program to do the following:
loads username/password sets from the file password.txt and insert them into the hash table until
the end of file is reached on password.txt. The password.txt file will look something like this
with one username/password set per line.
mary changeMe!
The program will then present a login prompt, read one username, present a password prompt,
and after looking up the username\'s password in the hash table, will print either \"Authentication
successful\" or \"Authentication failure\".
The above step will be repeated until the end of the input data (EOF) is reached on the console
input stream (cin). The EOF character on the PC\'s is the CTRL Z character.
To convert from a string to an integer, we can add the ascii value of each character together. For
instance, Mary\'s conversion from string to integer might look something like this:
109(\'m\') + 97(\'a\') + 114(\'r\') + 121(\'y\')=441
We\'ve converted the string to an integer, but we still need to convert the integer to an index. For
an array of 10 elements we can divide by 10 and use the remainder as an index. Combining these
two hash functions, we will get Mary\'s index to be: 441 % 10 = 1
Your primary tasks for this homework are to edit the login.cpp to replace the comments with
lines so that it does the following:
Insert passwords into the Hash Table.
Retrieve one user\'s Password structure from the Hash Table.
Compare retrieved user password to input password and print \"Authentication failure\" or
\"Authentication successful.\"
//--------------------------------------------------------------------
//
// listlnk.h
//
//--------------------------------------------------------------------
#pragma warning( disable : 4290 )
#include
#include
#include
#include
#include
#include
#include
using namespace std;
template < class T > // Forward declaration of the List class
class List;
template < class T >
class ListNode // Facilitator class for the List class
{
private:
ListNode(const T &nodeData, ListNode *nextPtr);
T dataItem; // List data item
ListNode *next; // Pointer to the next list node
friend class List;
};
//--------------------------------------------------------------------
template < class T >
class List
{
public:
List(int ignored = 0);
~List();
void insert(const T &newData) throw (bad_alloc); // Insert after cursor
void remove() throw (logic_error); // Remove data item
void replace(const T &newData) throw (logic_error); // Replace data item
void clear();
bool isEmpty() const;
bool isFull() const;
// List iteration operations
void gotoBeginning() throw (logic_error);
void gotoEnd() throw (logic_error);
bool gotoNext();
bool gotoPrior();
T getCursor() const throw (logic_error); // Return item
void showStructure() const;
void moveToBeginning() throw (logic_error); // Move to beginning
void insertBefore(const T &newElement) throw (bad_alloc); // Insert before cursor
private:
ListNode *head, // Pointer to the beginni.
(C++ exercise) 1.Implement a circular, doubly linked list with a has.docx
(C++ exercise) 1.Implement a circular, doubly linked list with a has
#includeiostream #includecstdio #includecstdlib using na.pdf
#include
#include
#include
using namespace std;
struct node
{
int val;
struct node *next;
}*startNode;
// declaring class
class LinkedList
{
public:
node* create_node(int);
void insert_last();
void sort();
void search();
void reverse();
void display();
LinkedList()
{
startNode = NULL;
}
};
// main
main()
{
int userChoice, linkedListNodes, i;
LinkedList LinkList;
startNode = NULL;
while (1)
{
// displaying menu
cout<<\" 1)Insert\";
cout<<\"2) Remove\";
cout<<\"3) Search\";
cout<<\"4) Display\";
cout<<\"5) Reverse\";
cout<<\"6) Exit \";
// reading user choice
cout<<\"Enter your userChoice : \";
cin>>userChoice;
switch(userChoice)
{
case 1:
cout<<\"Inserting node to linked list: \";
LinkList.insert_begin();
cout;
break;
case 2:
cout<<\"Delete element from linked list: \";
LinkList.delete();
break;
case 3:
cout<<\"Searching data in linked list: \";
LinkList.search();
cout;
break;
case 4:
cout<<\"Displaying linked list data: \";
LinkList.display();
cout;
break;
case 5:
cout<<\"Linked list reversing: \";
LinkList.reverse();
cout;
break;
case 6:
cout<<\"Exiting...\";
exit(1);
break;
default:
cout<<\"Enter correct userChoice\";
}
}
}
// node creating to store into list
node *LinkedList::create_node(int val)
{
struct node *tempNode, *tempNode;
tempNode = new(struct node);
if (tempNode == NULL)
{
cout<<\"No memory allocated \";
return 0;
}
else
{
tempNode->val = val;
tempNode->next = NULL;
return tempNode;
}
}
/*
* Inserting Node at last
*/
void LinkedList::insert_last()
{
int val;
cout<<\"Enter the val to be inserted: \";
cin>>val;
struct node *tempNode, *tempNode;
tempNode = create_node(val);
tempNode = startNode;
while (tempNode->next != NULL)
{
tempNode = tempNode->next;
}
tempNode->next = NULL;
tempNode->next = tempNode;
cout<<\"Element Inserted\";
}
// deleting element
void LinkedList::delete()
{
int position, i, count = 0;
if (startNode == NULL)
{
cout<<\"Linkedlist empty\"<>position;
struct node *tempNode, *ptr;
tempNode = startNode;
if (position == 1)
{
startNode = tempNode->next;
}
else
{
while (tempNode != NULL)
{
tempNode = tempNode->next;
count++;
}
if (position > 0 && position <= count)
{
tempNode = startNode;
for (i = 1;i < position;i++)
{
ptr = tempNode;
tempNode = tempNode->next;
}
ptr->next = tempNode->next;
}
else
{
cout<<\"Enter correct position\";
}
}
}
// search data in linked list
void LinkedList::search()
{
int val, position = 0;
bool flagValue = false;
if (startNode == NULL)
{
cout<<\"List is empty\";
return;
}
cout<<\"Enter the val to search: \";
cin>>val;
struct node *tempNode;
tempNode = startNode;
while (tempNode != NULL)
{
position++;
if (tempNode->val == val)
{
flagValue = true;
cout<<\"Data \"<next;
}
if (!flagValue)
cout<<\"data not found\";
}
// linkedlist reverese
void LinkedList::reverse()
{
struct node *pointer1, *pointer2, *pointer3;
if (startNode == NULL)
{
cout<<\"List is empty\"<next == NULL)
{
return;
}
pointer1 = startNode;
pointer2 = pointer1->next;
pointer3 = pointer2->next;
pointer1->next = NULL;
pointer2->.
#include iostream#include d_node.h #include d_nodel.h.docx
#include iostream#include d_node.h #include d_nodel.h
C++11
A brief presentation on the C++11 standard, including lambda functions, rvalue references, automatic variables, and more.
Implement the unsorted single linked list as we did in the class and .pdf
Implement the unsorted single linked list as we did in the class and implement the following
operations: 1.DeletelastDuplicat(): For any element in the linked list, if there are multiple copies
(> = 2 copies), delete the last copy. DeleteSecondlastDuplicat(): For any element in the linked
list, if there are multiple copies (> = 2 copies), delete the second last copy Test your program
with the following operations: a)insert 5 b)Insert 7 c)Insert 11 d)Insert 5 e)Insert f) Insert 5 g)
Print out the list h) Delete the last duplicate of 5 i)Print out the list i) Delete the last duplicate
of 11 k) Print out the list I) Insert 11 m) Insert 7 n) Print out the list O) Delete the second last
duplicate of 5 p) Print out the list q) Delete the second last duplicate of 7 r) Print out the list
Solution
#include
#include
#include
using namespace std;
struct node
{
int data;
struct node *next;
}*start;
class LinkedList
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos(int);
void delete_lastdup();
void delete_seclast();
int search(int);
void display();
int get_count(int);
LinkedList()
{
start = NULL;
}
};
int main()
{
int choice, pos, value, res=0;
LinkedList sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<>pos;
sl.delete_pos(pos);
break;
case 5:
cout<<\"Search element in Link List: \"<>value;
res=sl.search(value);
cout<<\"Element \"<data = value;
temp->next = NULL;
return temp;
}
}
//function to insert element at beginning
void LinkedList::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<next != NULL)
{
if(s->data == value)
count++;
s = s->next;
}
return count;
}
//function to insert node at last
void LinkedList::insert_last()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<>value;
c=get_count(value);
if(c<2)
{
cout<<\"duplicate does not exist\"<>value;
c=get_count(value);
x=c-1;
if(c<2)
{
cout<<\"duplicate does not exist\"<data == value)
{
f++;
res=pos;
if(f==x)
break;
}
s = s->next;
}
delete_pos(res);
}
}
//delete element at p.
Please complete ALL of the �TO DO�s in this code. I am really strugg.pdf
Please complete ALL of the TO DOs in this code. I am really struggling with this assignment.
The last time I posted this question, they did not complete them all. Please do it! There are two
files, list.h and queue.h. I tried to complete this on my own and none of it worked, so I am
posting the template again instead of my nonworking code. Please do not use chatgpt, I think the
last person used it.
list.h:
#pragma once
#include // size_t
#include // std::bidirectional_iterator_tag
#include // std::is_same, std::enable_if
template
class List {
private:
struct Node {
Node *next, *prev;
T data;
explicit Node(Node* prev = nullptr, Node* next = nullptr)
: next{next}, prev{prev} {}
explicit Node(const T& data, Node* prev = nullptr, Node* next = nullptr)
: next{next}, prev{prev}, data{data} {}
explicit Node(T&& data, Node* prev = nullptr, Node* next = nullptr)
: next{next}, prev{prev}, data{std::move(data)} {}
};
template
class basic_iterator {
public:
using iterator_category = std::bidirectional_iterator_tag;
using value_type = T;
using difference_type = ptrdiff_t;
using pointer = pointer_type;
using reference = reference_type;
private:
friend class List;
using Node = typename List::Node;
Node* node;
explicit basic_iterator(Node* ptr) noexcept : node{ptr} {}
explicit basic_iterator(const Node* ptr) noexcept : node{const_cast(ptr)} {}
public:
basic_iterator() { /* TODO */ };
basic_iterator(const basic_iterator&) = default;
basic_iterator(basic_iterator&&) = default;
~basic_iterator() = default;
basic_iterator& operator=(const basic_iterator&) = default;
basic_iterator& operator=(basic_iterator&&) = default;
reference operator*() const {
// TODO
}
pointer operator->() const {
// TODO
}
// Prefix Increment: ++a
basic_iterator& operator++() {
// TODO
}
// Postfix Increment: a++
basic_iterator operator++(int) {
// TODO
}
// Prefix Decrement: --a
basic_iterator& operator--() {
// TODO
}
// Postfix Decrement: a--
basic_iterator operator--(int) {
// TODO
}
bool operator==(const basic_iterator& other) const noexcept {
// TODO
}
bool operator!=(const basic_iterator& other) const noexcept {
// TODO
}
};
public:
using value_type = T;
using size_type = size_t;
using difference_type = ptrdiff_t;
using reference = value_type&;
using const_reference = const value_type&;
using pointer = value_type*;
using const_pointer = const value_type*;
using iterator = basic_iterator;
using const_iterator = basic_iterator;
private:
Node head, tail;
size_type _size;
public:
List() {
// TODO - Don't forget to initialize the list beforehand
}
List( size_type count, const T& value ) {
// TODO - Don't forget initialize the list beforehand
}
explicit List( size_type count ) {
// TODO - Don't forget initialize the list beforehand
}
List( const List& other ) {
// TODO - Don't forget initialize the list beforehand
}
List( List&& other ) {
// TODO - Don't forget initialize the list beforehand
}
~List() {
// TODO
}
List& operator=( const List& other ) {
// TODO
}
List& operator=( List&& o.
Shapes and calculate (area and contour) / C++ oop concept
Shapes and calculate (area and contour) / C++ oop concept
C++ Program to Implement Singly Linked List #includeiostream.pdf
/* C++ Program to Implement Singly Linked List */
#include
#include
#include
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (ptr->info > s->info)
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
/*
* Delete element at a given position
*/
void single_llist::delete_pos()
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<>pos;
cout<<\"Enter the new value: \";
cin>>value;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start->info = value;
}
else
{
for (i = 0;i < pos - 1;i++)
{
if (s == NULL)
{
cout<<\"There are less than \"<next;
}
s->info = value;
}
cout<<\"Node Updated\"<>value;
struct node *s;
s = start;
while (s != NULL)
{
pos++;
if (s->info == value)
{
flag = true;
cout<<\"Element \"<next;
}
if (!flag)
cout<<\"Element \"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2 = ptr3;
ptr3 = ptr3->next;
ptr2->next = ptr1;
}
start = ptr2;
}
/*
* Display Elements of a link list
*/
void single_llist::display()
{
struct node *temp;
if (sta.
C++ Doubly-Linked ListsThe goal of the exercise is to implement a.pdf
C++: Doubly-Linked Lists
The goal of the exercise is to implement a class List of doubly- linked lists.
My goal is to implement the class in a file doubly-linked.cpp.
The class List implements lists using the following structures for list ele- ments:
struct Node { int val ;
Node next;
Node prev; };
Each Node contains a value (an integer) and two pointers: one meant to point to the next element
of the list and one meant to point to the previous element in the list. The class provides the
following methods that you need to implement:
• A constructor and a destructor, with no arguments;
• void insert(int n): insert an integer at the end of the list;
• void reverse(): reverse the list;
• void print(): print the list to cout in the same format as the input (i.e. integers separated by
spaces);
doubly-linked.h
#ifndef __dll__
#define __dll__
#include
using namespace std;
// Basic structure to store elements of a list
struct Node {
int val; // contains the value
Node * next; // pointer to the next element in the list
Node * prev; // pointer to the previous element in the list
};
// Class List
class List {
public:
List(void); // Constructor
~List(void); // Destructor
void insert(int n); // This should insert n in the list
void reverse(void); // This should reverse the list
void print(void); // This shoiuld print the list
private:
Node * first; // Pointer to the first (if any) element in the list
};
#endif
main.cpp
#include
#include \"doubly-linked.h\"
using namespace std;
int main(void){
List l;
int n;
while(cin >> n){
l.insert(n);
}
// Print list as read from cin
l.print();
// Reverse the list and print it
l.reverse();
l.print();
// Reverse again and print it
l.reverse();
l.print();
return 0;
}
Solution
#include
using namespace std;
/* Linked list structure */
struct list {
struct list *prev;
int data;
struct list *next;
} *node = NULL, *first = NULL, *last = NULL, *node1 = NULL, *node2 = NULL;
class linkedlist {
public:
/* Function for create/insert node at the beginning of Linked list */
void insrt_frnt() {
list *addBeg = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addBeg->data;
if(first == NULL) {
addBeg->prev = NULL;
addBeg->next = NULL;
first = addBeg;
last = addBeg;
cout << \"Linked list Created!\" << endl;
}
else {
addBeg->prev = NULL;
first->prev = addBeg;
addBeg->next = first;
first = addBeg;
cout << \"Data Inserted at the beginning of the Linked list!\" << endl;
}
}
/* Function for create/insert node at the end of Linked list */
void insrt_end() {
list *addEnd = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addEnd->data;
if(first == NULL) {
addEnd->prev = NULL;
addEnd->next = NULL;
first = addEnd;
last = addEnd;
cout << \"Linked list Created!\" << endl;
}
else {
addEnd->next = NULL;
last->next = addEnd;
addEnd->prev = last;
last = addEnd;
cout << \"Data Inserted at the end of the Linked list!\" << endl;
}
}
/* Function for Display Linked list */
void display() {
node = first;
cout << \"List of data in L.
You isolated an enveloped RNA virus. Purified RNA is not capable of .pdf
Without computing eigenvalues, show that the matrices all have the same eigenvalues. [1 2 3
4], [10 4 -12 -5], [19 -11 24 -14]
Solution
HEre we find that on solving that the value of all matrices are same as :
|A|= 1(4) -3(2) = 4-6= -2
|B|= -5(10) -(-12)(4)= -50+48 = -2
|C|=19(-14) - (-11)(24) = -266+264 =-2
So as there values are same, their eigan values will also be the same..
What properties should the following molecules NOT have in common (S.pdf
What has the Better Business Bureau done restore its reputation?
Solution
Answer - BBB provides free business reviews to more than 4 million business, BBB serves as an
intermediary between consumers and businesses. In 2009 BBB moved to new sysem with rating
from A+ to F, 16 factor have been posted on each business review. Initially there was a 17th
factor worth 4 points for businesses that were Accredited and paid a fee to BBB. That process
was changed in November 2010 in response to criticism in the media and from the Connecticut
attorney general who accused BBB of using \'pay to play\' tactic.
In 2010, it was reported that a man created two dummy companies which received A+ ratings as
soon as he had paid the membership fee.
BBB restore reputation by - On December 22, 2010, William Mitchell, CEO of the Los Angeles
BBB, and originator of the BBB Letter Grading System, resigned as a result of an internal
investigation conducted by the CBBB. In 2011, BBB announced the formal integration of
operations in the United States & Canada, effective immediately.he CBBB said it made the move
to withdraw trademark authorization from the offices in Hamilton, Windsor, Montreal and St.
John’s after determining these four Canadian offices did not meet the defined standards of
operation.On March 12, 2013, the Council of Better Business Bureaus expelled the Los Angeles-
based Better Business Bureau of the Southland, the largest local BBB, claiming that the local
group had not met the Council\'s \"standards relating to accreditation, reporting on businesses,
and handling complaints. Thus by firing its CEO and various other steps mainly invoking
memebership of many organization BBB tries o resore its reputation..
More Related Content
Similar to I need to fill-in TODOs in .cpp file and in .h file Could some.pdf
Please solve the TODO parts include LinkedListcpph tem.pdf
Please solve the TODO parts.
#include "LinkedListcpp.h"
template <class T>
class Queue: public LinkedList<T>{
//private: ListNode<T> * back;
public:
//Queue<T>();
void add(T t);
void remove();
void remove(std::string title);
};
#include "Queue.h"
//template <class T>
//Queue<T>::Queue(){
// back=nullptr;
//}
//TODO
// add an element t to the end of queue- implement using an existing LinkedList method.
template <class T>
void Queue<T>::add(T t){
}
//TODO
//remove an element from the front of the queue-implement using an existing LinkedList method
template <class T>
void Queue<T>::remove(){
//TODO
// if queue us empty
// throw new std::string("NULL POINTER EXCEPTION QUEUE IS EMPTY n");
}
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
void populateRequests(Queue<Request>& q);
void populateSongDataBase(LinkedList<Song> &list);
void processQueue(LinkedList<Song> &list,Queue<Request>& q);
void processRequest(std::string action, std::string title,std::string singer,int chartPos);
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"*************************************n";
list.printList(); //
std::cout<<"*************************************n";
populateRequests(q); // fill the request q
std::cout<<"n";
std::cout<<"---------------PRINTING QUEUE-------------------n";
q.printList();
std::cout<<"------------------------------------n";
processQueue(list,q); // process the requests
std::cout<<"*************************************n";
list.printList();
std::cout<<"*************************************n";
}
//GIVEN
//Requires an empty linked list
//Effects fills the list with request by reading from the RequestData.txt
//Modifies the queue by filling it
void populateRequests(Queue<Request> &q){
}
//GIVEN
std::string playSong(LinkedList<Song>&list, Song s){
if (list.get(s)>=0){
return "PLAYING :"+ s.toString()+"n";
}
else{
return "SONG NOT FOUNDn";
}
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
std::cout<<"PLAYING TOP TEN SONG __________n";
list.print(10);
;
}
//Requires filled Song Database, a Song to add. The chart position given in the song is where it
will get added. Note this is a Song that is not supposed to exist in database.
//Effects adds the song from its original chart position
//Modifies the Song database. Adjust chart position of all Songs affected by this addition- this
adjustment is done in insert method using adjustPosition method. If the Process Queue adds a
Song that already is in the database, then a duplicate entry can occur.
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
/* Use this code
if (found>=0) {std::cout<<"ADDED THIS SONG "<<found+1<<" " ;list.printSong(found+1);}
else std::cout<<"SORRY CANNOT FIND SONG n";
*/
}
//TODO
//Requires filled Song Database, a Song to remove
//Effects if found, removes the song from its original .
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a problem with the nodes, as it is
posting errors with the nodes.
please help me with this problem. thank you.
public class LinkLists {
/* only need to store a single pointer to the node at the head
* of the list.
* The pointer is null if the list is empty.
* Also record the size of the list.
*/
protected Node head;
/* invariant: size is the number of nodes in the list pointed to by head */
protected int size;
/* no-arguments default constructor creates an empty list */
public LinkLists() {
head = null; // start with an empty list
size = 0;
}
/* accessor method */
public int size() {
return size;
}
/* value to add to the end of the list
*/
public void add(T value) {
head = addAtEnd(head, value);
size++;
}
/* node of the list to which the value should be added
* value to add to the end of the list
*/
private Node addAtEnd(Node node, T value) {
if (node == null) { // special case
return new Node(value, null);
} else if (node.getNext() == null) { // other special case
node.setNext(new Node(value, null));
} else {
addAtEnd(node.getNext(), value);
}
return node;
}
/* iterative implementation of the same method
* value to add to the end of the list
*/
public void add2(T value) {
if (head == null) {
head = new Node(value, null);
} else {
Node node = head; // guaranteed not to be null initially
while (node.getNext() != null) {
node = node.getNext(); // guaranteed not to be null here
}
// now, node.getNext() is guaranteed to be null
// similar to the second special case in addAtEnd
node.setNext(new Node(value, null));
}
size++;
}
public void remove(int position) throws BadItemCountException {
if ((position < 1) || (position > size)) {
throw new
BadItemCountException(\"invalid position \" + position +
\", only 1..\" + size + \" available\");
}
if (position == 1) {
head = head.getNext();
} else {
Node node = head;
for (int i = 2; i < position; i++) {
node = node.getNext();
}
node.setNext(node.getNext().getNext());
}
size--; // one less item
}
public String toString() {
return toString(head);
}
private String toString(Node node) {
if (node == null) {
return \"\";
} else {
return node.getValue() + \"\ \" + toString(node.getNext());
}
}
public static void main(String[] args) {
/* create two empty lists, make sure they print out correctly */
LinkLists list1 = new LinkLists();
LinkLists list2 = new LinkLists();
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* insert some items, keep checking */
list1.add(\"hello\");
list1.add(\"world\");
list2.add(\"foo\");
list2.add(\"bar\");
list2.add(\"baz\");
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* remove an item at an invalid position */
boolean caught = false;
try {
list2.remove(4);
} catch .
C++11 - STL Additions
This presentation considers certain specific features of C++11 and additions to STL library (uniform initialization, new containers and methods, move semantics).
Presentation by Taras Protsiv (Software Engineer, GlobalLogic), Kyiv, delivered at GlobalLogic C++ TechTalk in Lviv, September 18, 2014.
More details -
http://www.globallogic.com.ua/press-releases/lviv-cpp-techtalk-coverage
Shapes and calculate (area and contour) / C++ oop concept
Shapes and calculate (area and contour) / C++ oop concept
C++ projectMachine Problem 7 - HashingWrite a program to do the .pdf
C++ project
Machine Problem 7 - Hashing
Write a program to do the following:
loads username/password sets from the file password.txt and insert them into the hash table until
the end of file is reached on password.txt. The password.txt file will look something like this
with one username/password set per line.
mary changeMe!
The program will then present a login prompt, read one username, present a password prompt,
and after looking up the username\'s password in the hash table, will print either \"Authentication
successful\" or \"Authentication failure\".
The above step will be repeated until the end of the input data (EOF) is reached on the console
input stream (cin). The EOF character on the PC\'s is the CTRL Z character.
To convert from a string to an integer, we can add the ascii value of each character together. For
instance, Mary\'s conversion from string to integer might look something like this:
109(\'m\') + 97(\'a\') + 114(\'r\') + 121(\'y\')=441
We\'ve converted the string to an integer, but we still need to convert the integer to an index. For
an array of 10 elements we can divide by 10 and use the remainder as an index. Combining these
two hash functions, we will get Mary\'s index to be: 441 % 10 = 1
Your primary tasks for this homework are to edit the login.cpp to replace the comments with
lines so that it does the following:
Insert passwords into the Hash Table.
Retrieve one user\'s Password structure from the Hash Table.
Compare retrieved user password to input password and print \"Authentication failure\" or
\"Authentication successful.\"
//--------------------------------------------------------------------
//
// listlnk.h
//
//--------------------------------------------------------------------
#pragma warning( disable : 4290 )
#include
#include
#include
#include
#include
#include
#include
using namespace std;
template < class T > // Forward declaration of the List class
class List;
template < class T >
class ListNode // Facilitator class for the List class
{
private:
ListNode(const T &nodeData, ListNode *nextPtr);
T dataItem; // List data item
ListNode *next; // Pointer to the next list node
friend class List;
};
//--------------------------------------------------------------------
template < class T >
class List
{
public:
List(int ignored = 0);
~List();
void insert(const T &newData) throw (bad_alloc); // Insert after cursor
void remove() throw (logic_error); // Remove data item
void replace(const T &newData) throw (logic_error); // Replace data item
void clear();
bool isEmpty() const;
bool isFull() const;
// List iteration operations
void gotoBeginning() throw (logic_error);
void gotoEnd() throw (logic_error);
bool gotoNext();
bool gotoPrior();
T getCursor() const throw (logic_error); // Return item
void showStructure() const;
void moveToBeginning() throw (logic_error); // Move to beginning
void insertBefore(const T &newElement) throw (bad_alloc); // Insert before cursor
private:
ListNode *head, // Pointer to the beginni.
(C++ exercise) 1.Implement a circular, doubly linked list with a has.docx
(C++ exercise) 1.Implement a circular, doubly linked list with a has
#includeiostream #includecstdio #includecstdlib using na.pdf
#include
#include
#include
using namespace std;
struct node
{
int val;
struct node *next;
}*startNode;
// declaring class
class LinkedList
{
public:
node* create_node(int);
void insert_last();
void sort();
void search();
void reverse();
void display();
LinkedList()
{
startNode = NULL;
}
};
// main
main()
{
int userChoice, linkedListNodes, i;
LinkedList LinkList;
startNode = NULL;
while (1)
{
// displaying menu
cout<<\" 1)Insert\";
cout<<\"2) Remove\";
cout<<\"3) Search\";
cout<<\"4) Display\";
cout<<\"5) Reverse\";
cout<<\"6) Exit \";
// reading user choice
cout<<\"Enter your userChoice : \";
cin>>userChoice;
switch(userChoice)
{
case 1:
cout<<\"Inserting node to linked list: \";
LinkList.insert_begin();
cout;
break;
case 2:
cout<<\"Delete element from linked list: \";
LinkList.delete();
break;
case 3:
cout<<\"Searching data in linked list: \";
LinkList.search();
cout;
break;
case 4:
cout<<\"Displaying linked list data: \";
LinkList.display();
cout;
break;
case 5:
cout<<\"Linked list reversing: \";
LinkList.reverse();
cout;
break;
case 6:
cout<<\"Exiting...\";
exit(1);
break;
default:
cout<<\"Enter correct userChoice\";
}
}
}
// node creating to store into list
node *LinkedList::create_node(int val)
{
struct node *tempNode, *tempNode;
tempNode = new(struct node);
if (tempNode == NULL)
{
cout<<\"No memory allocated \";
return 0;
}
else
{
tempNode->val = val;
tempNode->next = NULL;
return tempNode;
}
}
/*
* Inserting Node at last
*/
void LinkedList::insert_last()
{
int val;
cout<<\"Enter the val to be inserted: \";
cin>>val;
struct node *tempNode, *tempNode;
tempNode = create_node(val);
tempNode = startNode;
while (tempNode->next != NULL)
{
tempNode = tempNode->next;
}
tempNode->next = NULL;
tempNode->next = tempNode;
cout<<\"Element Inserted\";
}
// deleting element
void LinkedList::delete()
{
int position, i, count = 0;
if (startNode == NULL)
{
cout<<\"Linkedlist empty\"<>position;
struct node *tempNode, *ptr;
tempNode = startNode;
if (position == 1)
{
startNode = tempNode->next;
}
else
{
while (tempNode != NULL)
{
tempNode = tempNode->next;
count++;
}
if (position > 0 && position <= count)
{
tempNode = startNode;
for (i = 1;i < position;i++)
{
ptr = tempNode;
tempNode = tempNode->next;
}
ptr->next = tempNode->next;
}
else
{
cout<<\"Enter correct position\";
}
}
}
// search data in linked list
void LinkedList::search()
{
int val, position = 0;
bool flagValue = false;
if (startNode == NULL)
{
cout<<\"List is empty\";
return;
}
cout<<\"Enter the val to search: \";
cin>>val;
struct node *tempNode;
tempNode = startNode;
while (tempNode != NULL)
{
position++;
if (tempNode->val == val)
{
flagValue = true;
cout<<\"Data \"<next;
}
if (!flagValue)
cout<<\"data not found\";
}
// linkedlist reverese
void LinkedList::reverse()
{
struct node *pointer1, *pointer2, *pointer3;
if (startNode == NULL)
{
cout<<\"List is empty\"<next == NULL)
{
return;
}
pointer1 = startNode;
pointer2 = pointer1->next;
pointer3 = pointer2->next;
pointer1->next = NULL;
pointer2->.
#include iostream#include d_node.h #include d_nodel.h.docx
#include iostream#include d_node.h #include d_nodel.h
C++11
A brief presentation on the C++11 standard, including lambda functions, rvalue references, automatic variables, and more.
Implement the unsorted single linked list as we did in the class and .pdf
Implement the unsorted single linked list as we did in the class and implement the following
operations: 1.DeletelastDuplicat(): For any element in the linked list, if there are multiple copies
(> = 2 copies), delete the last copy. DeleteSecondlastDuplicat(): For any element in the linked
list, if there are multiple copies (> = 2 copies), delete the second last copy Test your program
with the following operations: a)insert 5 b)Insert 7 c)Insert 11 d)Insert 5 e)Insert f) Insert 5 g)
Print out the list h) Delete the last duplicate of 5 i)Print out the list i) Delete the last duplicate
of 11 k) Print out the list I) Insert 11 m) Insert 7 n) Print out the list O) Delete the second last
duplicate of 5 p) Print out the list q) Delete the second last duplicate of 7 r) Print out the list
Solution
#include
#include
#include
using namespace std;
struct node
{
int data;
struct node *next;
}*start;
class LinkedList
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos(int);
void delete_lastdup();
void delete_seclast();
int search(int);
void display();
int get_count(int);
LinkedList()
{
start = NULL;
}
};
int main()
{
int choice, pos, value, res=0;
LinkedList sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<>pos;
sl.delete_pos(pos);
break;
case 5:
cout<<\"Search element in Link List: \"<>value;
res=sl.search(value);
cout<<\"Element \"<data = value;
temp->next = NULL;
return temp;
}
}
//function to insert element at beginning
void LinkedList::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<next != NULL)
{
if(s->data == value)
count++;
s = s->next;
}
return count;
}
//function to insert node at last
void LinkedList::insert_last()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<>value;
c=get_count(value);
if(c<2)
{
cout<<\"duplicate does not exist\"<>value;
c=get_count(value);
x=c-1;
if(c<2)
{
cout<<\"duplicate does not exist\"<data == value)
{
f++;
res=pos;
if(f==x)
break;
}
s = s->next;
}
delete_pos(res);
}
}
//delete element at p.
Please complete ALL of the �TO DO�s in this code. I am really strugg.pdf
Please complete ALL of the TO DOs in this code. I am really struggling with this assignment.
The last time I posted this question, they did not complete them all. Please do it! There are two
files, list.h and queue.h. I tried to complete this on my own and none of it worked, so I am
posting the template again instead of my nonworking code. Please do not use chatgpt, I think the
last person used it.
list.h:
#pragma once
#include // size_t
#include // std::bidirectional_iterator_tag
#include // std::is_same, std::enable_if
template
class List {
private:
struct Node {
Node *next, *prev;
T data;
explicit Node(Node* prev = nullptr, Node* next = nullptr)
: next{next}, prev{prev} {}
explicit Node(const T& data, Node* prev = nullptr, Node* next = nullptr)
: next{next}, prev{prev}, data{data} {}
explicit Node(T&& data, Node* prev = nullptr, Node* next = nullptr)
: next{next}, prev{prev}, data{std::move(data)} {}
};
template
class basic_iterator {
public:
using iterator_category = std::bidirectional_iterator_tag;
using value_type = T;
using difference_type = ptrdiff_t;
using pointer = pointer_type;
using reference = reference_type;
private:
friend class List;
using Node = typename List::Node;
Node* node;
explicit basic_iterator(Node* ptr) noexcept : node{ptr} {}
explicit basic_iterator(const Node* ptr) noexcept : node{const_cast(ptr)} {}
public:
basic_iterator() { /* TODO */ };
basic_iterator(const basic_iterator&) = default;
basic_iterator(basic_iterator&&) = default;
~basic_iterator() = default;
basic_iterator& operator=(const basic_iterator&) = default;
basic_iterator& operator=(basic_iterator&&) = default;
reference operator*() const {
// TODO
}
pointer operator->() const {
// TODO
}
// Prefix Increment: ++a
basic_iterator& operator++() {
// TODO
}
// Postfix Increment: a++
basic_iterator operator++(int) {
// TODO
}
// Prefix Decrement: --a
basic_iterator& operator--() {
// TODO
}
// Postfix Decrement: a--
basic_iterator operator--(int) {
// TODO
}
bool operator==(const basic_iterator& other) const noexcept {
// TODO
}
bool operator!=(const basic_iterator& other) const noexcept {
// TODO
}
};
public:
using value_type = T;
using size_type = size_t;
using difference_type = ptrdiff_t;
using reference = value_type&;
using const_reference = const value_type&;
using pointer = value_type*;
using const_pointer = const value_type*;
using iterator = basic_iterator;
using const_iterator = basic_iterator;
private:
Node head, tail;
size_type _size;
public:
List() {
// TODO - Don't forget to initialize the list beforehand
}
List( size_type count, const T& value ) {
// TODO - Don't forget initialize the list beforehand
}
explicit List( size_type count ) {
// TODO - Don't forget initialize the list beforehand
}
List( const List& other ) {
// TODO - Don't forget initialize the list beforehand
}
List( List&& other ) {
// TODO - Don't forget initialize the list beforehand
}
~List() {
// TODO
}
List& operator=( const List& other ) {
// TODO
}
List& operator=( List&& o.
Shapes and calculate (area and contour) / C++ oop concept
Shapes and calculate (area and contour) / C++ oop concept
C++ Program to Implement Singly Linked List #includeiostream.pdf
/* C++ Program to Implement Singly Linked List */
#include
#include
#include
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (ptr->info > s->info)
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
/*
* Delete element at a given position
*/
void single_llist::delete_pos()
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<>pos;
cout<<\"Enter the new value: \";
cin>>value;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start->info = value;
}
else
{
for (i = 0;i < pos - 1;i++)
{
if (s == NULL)
{
cout<<\"There are less than \"<next;
}
s->info = value;
}
cout<<\"Node Updated\"<>value;
struct node *s;
s = start;
while (s != NULL)
{
pos++;
if (s->info == value)
{
flag = true;
cout<<\"Element \"<next;
}
if (!flag)
cout<<\"Element \"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2 = ptr3;
ptr3 = ptr3->next;
ptr2->next = ptr1;
}
start = ptr2;
}
/*
* Display Elements of a link list
*/
void single_llist::display()
{
struct node *temp;
if (sta.
C++ Doubly-Linked ListsThe goal of the exercise is to implement a.pdf
C++: Doubly-Linked Lists
The goal of the exercise is to implement a class List of doubly- linked lists.
My goal is to implement the class in a file doubly-linked.cpp.
The class List implements lists using the following structures for list ele- ments:
struct Node { int val ;
Node next;
Node prev; };
Each Node contains a value (an integer) and two pointers: one meant to point to the next element
of the list and one meant to point to the previous element in the list. The class provides the
following methods that you need to implement:
• A constructor and a destructor, with no arguments;
• void insert(int n): insert an integer at the end of the list;
• void reverse(): reverse the list;
• void print(): print the list to cout in the same format as the input (i.e. integers separated by
spaces);
doubly-linked.h
#ifndef __dll__
#define __dll__
#include
using namespace std;
// Basic structure to store elements of a list
struct Node {
int val; // contains the value
Node * next; // pointer to the next element in the list
Node * prev; // pointer to the previous element in the list
};
// Class List
class List {
public:
List(void); // Constructor
~List(void); // Destructor
void insert(int n); // This should insert n in the list
void reverse(void); // This should reverse the list
void print(void); // This shoiuld print the list
private:
Node * first; // Pointer to the first (if any) element in the list
};
#endif
main.cpp
#include
#include \"doubly-linked.h\"
using namespace std;
int main(void){
List l;
int n;
while(cin >> n){
l.insert(n);
}
// Print list as read from cin
l.print();
// Reverse the list and print it
l.reverse();
l.print();
// Reverse again and print it
l.reverse();
l.print();
return 0;
}
Solution
#include
using namespace std;
/* Linked list structure */
struct list {
struct list *prev;
int data;
struct list *next;
} *node = NULL, *first = NULL, *last = NULL, *node1 = NULL, *node2 = NULL;
class linkedlist {
public:
/* Function for create/insert node at the beginning of Linked list */
void insrt_frnt() {
list *addBeg = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addBeg->data;
if(first == NULL) {
addBeg->prev = NULL;
addBeg->next = NULL;
first = addBeg;
last = addBeg;
cout << \"Linked list Created!\" << endl;
}
else {
addBeg->prev = NULL;
first->prev = addBeg;
addBeg->next = first;
first = addBeg;
cout << \"Data Inserted at the beginning of the Linked list!\" << endl;
}
}
/* Function for create/insert node at the end of Linked list */
void insrt_end() {
list *addEnd = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addEnd->data;
if(first == NULL) {
addEnd->prev = NULL;
addEnd->next = NULL;
first = addEnd;
last = addEnd;
cout << \"Linked list Created!\" << endl;
}
else {
addEnd->next = NULL;
last->next = addEnd;
addEnd->prev = last;
last = addEnd;
cout << \"Data Inserted at the end of the Linked list!\" << endl;
}
}
/* Function for Display Linked list */
void display() {
node = first;
cout << \"List of data in L.
Similar to I need to fill-in TODOs in .cpp file and in .h file Could some.pdf (20)
Please solve the TODO parts include LinkedListcpph tem.pdf
Please solve the TODO parts include LinkedListcpph tem.pdf
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a pro.pdf
Shapes and calculate (area and contour) / C++ oop concept
Shapes and calculate (area and contour) / C++ oop concept
C++ projectMachine Problem 7 - HashingWrite a program to do the .pdf
C++ projectMachine Problem 7 - HashingWrite a program to do the .pdf
(C++ exercise) 1.Implement a circular, doubly linked list with a has.docx
(C++ exercise) 1.Implement a circular, doubly linked list with a has.docx
#includeiostream #includecstdio #includecstdlib using na.pdf
#includeiostream #includecstdio #includecstdlib using na.pdf
#include iostream#include d_node.h #include d_nodel.h.docx
#include iostream#include d_node.h #include d_nodel.h.docx
Implement the unsorted single linked list as we did in the class and .pdf
Implement the unsorted single linked list as we did in the class and .pdf
Please complete ALL of the �TO DO�s in this code. I am really strugg.pdf
Please complete ALL of the �TO DO�s in this code. I am really strugg.pdf
Shapes and calculate (area and contour) / C++ oop concept
Shapes and calculate (area and contour) / C++ oop concept
C++ Program to Implement Singly Linked List #includeiostream.pdf
C++ Program to Implement Singly Linked List #includeiostream.pdf
C++ Doubly-Linked ListsThe goal of the exercise is to implement a.pdf
C++ Doubly-Linked ListsThe goal of the exercise is to implement a.pdf
More from forladies
You isolated an enveloped RNA virus. Purified RNA is not capable of .pdf
Without computing eigenvalues, show that the matrices all have the same eigenvalues. [1 2 3
4], [10 4 -12 -5], [19 -11 24 -14]
Solution
HEre we find that on solving that the value of all matrices are same as :
|A|= 1(4) -3(2) = 4-6= -2
|B|= -5(10) -(-12)(4)= -50+48 = -2
|C|=19(-14) - (-11)(24) = -266+264 =-2
So as there values are same, their eigan values will also be the same..
What properties should the following molecules NOT have in common (S.pdf
What has the Better Business Bureau done restore its reputation?
Solution
Answer - BBB provides free business reviews to more than 4 million business, BBB serves as an
intermediary between consumers and businesses. In 2009 BBB moved to new sysem with rating
from A+ to F, 16 factor have been posted on each business review. Initially there was a 17th
factor worth 4 points for businesses that were Accredited and paid a fee to BBB. That process
was changed in November 2010 in response to criticism in the media and from the Connecticut
attorney general who accused BBB of using \'pay to play\' tactic.
In 2010, it was reported that a man created two dummy companies which received A+ ratings as
soon as he had paid the membership fee.
BBB restore reputation by - On December 22, 2010, William Mitchell, CEO of the Los Angeles
BBB, and originator of the BBB Letter Grading System, resigned as a result of an internal
investigation conducted by the CBBB. In 2011, BBB announced the formal integration of
operations in the United States & Canada, effective immediately.he CBBB said it made the move
to withdraw trademark authorization from the offices in Hamilton, Windsor, Montreal and St.
John’s after determining these four Canadian offices did not meet the defined standards of
operation.On March 12, 2013, the Council of Better Business Bureaus expelled the Los Angeles-
based Better Business Bureau of the Southland, the largest local BBB, claiming that the local
group had not met the Council\'s \"standards relating to accreditation, reporting on businesses,
and handling complaints. Thus by firing its CEO and various other steps mainly invoking
memebership of many organization BBB tries o resore its reputation..
What is the difference between Schedule C and Schedule E income (i.e.pdf
What are the various learning styles and what impact does a trainee’s learning style have on the
communication process and on the training environment?
Solution
Answer:
Learning styles: Learning styles are defined as the styles used for learning the human beings.
These are the learning method can be used by the individual in learning process.
Following are the key learning styles are as below
The impact of trainee’s learning style on the communication process and on the training
environment as below
Impact on the communication process: The learning style will have great impact on the
communication process during the training program, because the learning style will be enable all
the participants to understand the topic properly and will develop a good communication process
among the participants and the trainer.
Impact on the training environment: The learning style will have a significant impact on the
training environment. The participants will be able to learn during the training session if the
learning style is effective else they will not be able to learn the subject properly. Thus the
communication process in the training program needs to be such that it can easily communicate
with audiences and make the participants learn the topic easily. So it is the learning style which
will decides the learning of the participants though the trainer has delivered the great session.
Communication is base through which the subject expert/speaker shares the information or
knowledge to the listening group. The communication needs to be effective so that the other
followers can understand it properly and can learn the subject.
The message or information cannot be transferred without the effective communication between
the listeners and the speaker.
Effective communication can help to understand the topics in one go, otherwise it will take long
time for the learners to understand the topic in absence of proper communication..
What are the ethical and legal concerns associated with managing tel.pdf
Vignana Corporation manufactures and sells hand-painted clay figurines of popular sports
heroes. Shown below are some of the costs incurred by Vignana for last year:
What is the total of the conversion costs above?
Multiple Choice
$69,000
$155,000
$65,000
$90,000Cost of clay used in production$ 65,000Wages paid to the workers who paint the
figurines$90,000Wages paid to the sales manager\'s secretary$22,000Cost of junk mail
advertising$47,000
Solution
90000$ is the conversion cost
Conversion costs are those production costs required to convert raw material into finished
products
Conversion costs are all manufacturing costs expect cost of raw materials
Some of the examples of costs that may be considered as conversion costs are
Direct labour
Factory rent
Factory insurance
Machinery depreciation etc
Thank you hope this helps you.
Using the Graphical User Interface (GUI)Create a user nam.pdf
Use the data points (28, 3.1) and (10, 2.2) to find an equation of the line through these points. Be
sure to use the equation editor to show all steps (slope, point-slope form and slope intercept
form). Video 35 has several practice problems if you are unsure of the steps. Reminder: It is not
OK to leave a decimal in the numerator or denominator of your fraction!
Solution
(28, 3.1) and ( 10, 2.2)
slope = (2.2- 3.1)/( 10 -28)
= 0.05
slope intercept form equation : y = mx +c
y = 0.05x +c Use ( 10, 2.2) to find c:
2.2 = 0.5 +c ---> c = 1.5
y = 0.05x + 1.5
Point slope form : y - 2.2 = 0.05(x -10).
The adjusting entry to record the salaries earned due to employees f.pdf
The adjusting entry to record the salaries earned due to employees for services provided but
unpaid at the end of the accounting period affects the accounts in which of the following ways?
A. Debit Accrued Salaries and credit Salaries Payable.
B. Debit Salaries Expense and credit Cash.
C. Debit Cash and credit Salaries Expense.
D. Debit Salaries Expense and credit Salaries Payable.
E. Debit Salaries Payable and credit Salaries Expense.
Solution
Answer is DGeneral JournalDebitCreditSalaries ExpenseXXXSalaries PayableXXX.
TF A document type definition (DTD) can be referenced by many Exten.pdf
T/F A document type definition (DTD) can be referenced by many Extensible Markup Language
(XML) documents of the same type.
T/F In a document type definition (DTD) file, a plus (+) symbol beside an element indicates that
it is an optional child element within its parent.
T/F Having a web-based database interface eliminates the design and implementation issues of a
database system.
Solution
1) TRUE An external dtd can be referenced by any number of XML files using the syntax >
SYSTEM \"<>.dtd\">
2) FALSE (+) Symbol indicates that the element has to occur atleast once or more than once. So
it is not an optional child element. (*) indicates the occuence of zero or more times.
3) TRUE This is called managed hosting. This can be availed in Cloud DBMS (CDBMS) where
the clould provider creates, manages and maintains the complete database implementation.
Summarize the first and the second checkpoints during T cell develop.pdf
Summarize the first and the second checkpoints during T cell development in the thymus.
Solution
Lymphocytes develp from pluripotent stem cells in bone marrow. Differentiation of these cells
requires rearrangement of gene segments to produce functional receptors for its further
maturation.
There are two checkpoints to decide the distinct lineage of T cells.
FIRST CHECKPOINT:
1. Rearrangement of T-cell receptor , and genes.
2. Rearrangement of and genes produces a heterodimeric receptor.
3. Rearrangement of gene produces pre T-cell receptor These cells can enter two distinct
lineage i.e or T-cell lineage
If none of above rearrangement is successful, then cell dies through apoptosis.
SECOND CHEKPOINT
1. T-cell lineage undergoes rearrangement at chain locus leading to expression of CD4 and CD8
receptors.
2. antigen receptor ,CD4/CD8 coreceptor of these cells bind to thymic major histocompatibility
complex (MHC) molecules.
3. The type of receptor -MHC interaction produces CD4+CD8-+ lineage or CD4-CD8++ lineage.
4. Both cell lineages have distinct properties and molecular mechanism for receptor specific
antigen interaction.
If none of above rearrangement is successful, then cell dies through apoptosis..
PLEASE HELP!!Loren Seguara and Dale Johnson both work for Southern.pdf
PLEASE HELP!!
Loren Seguara and Dale Johnson both work for Southern Semiconductor Corporation (SSC), a
major producer of computer components. Loren works as a clerical assistant in the Accounting
Department, and Dale works as a packager in the Shipping Department. During their lunch break
one day, they began talking about the company. Dale complained that he had always worked
hard trying not to waste packing materials and efficiently and cost-effectively performing his job.
In spite of his efforts and those of his co-workers in the department, the firm’s stock price had
declined nearly $2.00 per share over the past nine months. Loren indicated that he shared Dale’s
frustration, particularly because the firm’s profits had been rising. Neither could understand why
the firm’s stock price was falling as profits rose. Loren indicated that he had seen documents
describing the firm’s profit-sharing plan under which all managers were partially compensated
on the basis of the firm’s profits. He suggested that maybe it was profit that was important to
management, because it directly affected their pay. Dale said, “That doesn’t make sense, because
the stockholders own the firm. Shouldn’t management do what’s best for stockholders?
Something’s wrong!” Loren responded, “Well, maybe that explains why the company hasn’t
concerned itself with the stock price. Look, the only profits that stockholders receive are in the
form of cash dividends, and this firm has never paid dividends during its 20-year history. We as
stockholders therefore don’t directly benefit from profits. The only way we benefit is for the
stock price to rise.” Dale chimed in, “That probably explains why the firm is being sued by state
and federal environmental officials for dumping pollutants in the adjacent stream. Why spend
money for pollution control? It increases costs, lowers profits, and therefore lowers
management’s earnings!” Loren and Dale realized that the lunch break had ended and they must
quickly return to work. Before leaving, they decided to meet the next day to continue their
discussion.
Please answer the following questions:
1) What should the management of Southern Semiconductor Corporation pursue as its overriding
goal? Why?
2) Does the firm appear to have an “agency problem?” Explain.
3) Evaluate the firm’s approach to pollution control. Does it seem to be ethical? a. Why might
incurring the expense to control pollution be in the best interests of the firm’s owners despite its
negative effect on profits?
4) Does the firm appear to have an effective “corporate governance structure?” Explain any
shortcomings.
5) On the basis of the information provided, what specific recommendations would you offer the
firm?
Appreciate your help in advance!
Solution
1)
The Management of the southern semiconductor should pursue the rise in the wealth of
shareholder. They should think of long term benefit that affects the stock price and not the short
term profit. Currently it looks that the.
Please answer the following at the bottom of the case. ThanksTo ne.pdf
Please answer the following at the bottom of the case. Thanks
To negotiate whether an employee should be retained or not, the CHRO can design the following
line of judgement: Who: Attributes of the person being evaluated, whether they fit in with the
core values of the organization or not. What: Skills of the person, i.e., specialized skills that can
make a difference to the organization’s revenues should be considered.
Where; The geographical region in which they work and whether they are required there or not
need to be evaluated. Why: Major cause for retention should be value-addition or potential for
continued value addition to the organization.
How: Instead of using standard Key Performance Indicators (KPI), customized packages for
valuable employees based on their unique contributions to the organization are a good place to
start. “KPIs are intrinsically linked to a firm\'s strategic goals and are used to help managers
assess whether they\'re on target as they work towards those goals (John, 2017)”. Since Netflix
aims only at retaining A employees, managers at all levels should dedicate time to developing
more A employees to keep adding value to the company.
As we see, the types of power the CHRO has for instance, with the positional power she can
direct the company as per her own methods due to her designation. this power is very crucial as
there are no HR policies in place, there must be a central figure who functions as the model
figure to direct the HR functions of the company which usually work as per the model HR
policies. Then the information power is where the employees coming in can expect to learn and
look up to her as she has an in-depth understanding of the processes and clear about the path she
wishes to take Netflix towards (Patty, 2014).
The Reward power adds to coercive power as Sharon has the power to retain a well performing
employee as what is been envisaged by the company and with her power to take disciplinary
action against anyone who isn\'t performing to the expectations, Sharon can strike the right
balance of maintaining the best of talent. Sharon\'s people centric approach with her social power
helps her exercise the above powers in the negotiation very smoothly as she can identify and
select the best employees through negotiation and the incoming employee doesn\'t feel out of
place.
Aiding to all these powers is her charismatic power which makes the employees listen to her,
follow her advice or fear her for what she is rather than just her designation and hugely helps
during negotiations as her exercising of any power doesn\'t come across as being impersonal or
arrogant but a necessary action.
If an agreement is not reached, the CHRO should look outside for eligible candidates. BATNA
stands for Best Alternative to a Negotiated Agreement. “BATNA, Best Alternative to a
Negotiated Agreement term was introduced by Roger Fischer and William Ury in 1981. They
proposed that, when negotiating a business agreement, we s.
Mitchell sets sail for the Chemiosmotic New World, despite dire w.pdf
\"Mitchell sets sail for the Chemiosmotic New World, despite dire warnings that he will be
consumed: What does this cartoon convey about the nature of scientific discovery? Source:
Courtesy of Abraham Tulp.
Solution
Brave new world
1. From shakespeares the storm miranda speak wonder how multitude goodly living being are
here how beauty of humanity is o soldier new globe that has such human in it.
2. They\'re generating life and hatching human from bottles and situation them to like the
employment surroundings of their social category..
Learn the genetics vocabulary (see HW4)] For each of the following ge.pdf
Learn the genetics vocabulary (see HW4)] For each of the following genotypes, identify (a) it is
homologous or heterozygous; and the possible gametes for that genotype (gametes are haploid)
For each of the following state whether the letter symbol shown represents a genotype (diploid)
of a gamete E - this represents a gamete because it is a single dominate allele; it was E_e - that
would represent a heterozygous with a pair of alleles. Using the letter \"T\" and \"I\" to represent
the alleles for gene for tongue-rolling show the heterozygous and homozygous possible.
Solution
Question 1
Possible gametes
a
Homozygous
One gamete w
b
Heterozygous
Two gamete t& T
c
Heterozygous
Two gamete A & a
d
Heterozygous
Two gamete D & d
Question 2
a
Genotype (heterozygous ) Kk
b
genotype Homozygous AA
c
allele
Question 3
Homozygous
Dominant
TT
Taster
Heterozygous
Dominant
Tt
Taster
Homozygous
Recessive
tt
Non-Taster
4
Homozygous---------- Dominant—GENEOTYPE---PURPLE --- PP
Homozygous ----Recessive GENEOTYPE---white --- pp
PURPLE --- PP x white --- pp
P
P
p
Pp PURPLE
Pp PURPLE
p
Pp PURPLE
Pp PURPLE
All offspring are purple in color
Question 1
Possible gametes
a
Homozygous
One gamete w
b
Heterozygous
Two gamete t& T
c
Heterozygous
Two gamete A & a
d
Heterozygous
Two gamete D & d.
If nominal GDP is 28000 and the money supply is 7000, what is velocit.pdf
If nominal GDP is 28000 and the money supply is 7000, what is velocity? 11.5 .68 4 18
Solution
- 4 is correct
According to quantity theory of money, M*V = P*Y
P*Y= 28000
M= 7000
V= 28000/7000= 4
- money supply in the economy increases.
Central bank buys bonds from the bank in exchange for money, This increases money supply.
- 830 million is correct
Assets include cash in vault, reserves, loans and bonds.
Since sale of loan is balanced by cash received in exchange
Total assets= 50+180+600= 830 million.
Investments in trade securities are always short term investments. T.pdf
Investments in trade securities are always short term investments. True or False
Solution
Answer : True
Trade securties are basically equity and debt instruments or plans . They are traded in current
period and produce profit. Management invest in these securities inorder to get money in short
term period..
Information Securityfind an article online discussing defense-in-d.pdf
Information Security
find an article online discussing defense-in-depth. List your source and provide a paragraph
summary of what the article stated.
Solution
Abstract
The exponential growth of the Internet interconnections has led to a significant growth of cyber
attack incidents often with disastrous and grievous consequences. Malware is the primary choice
of weapon to carry out malicious intents in the cyberspace, either by exploitation into existing
vulnerabilities or utilization of unique characteristics of emerging technologies. The
development of more innovative and effective malware defense mechanisms has been regarded
as an urgent requirement in the cybersecurity community. To assist in achieving this goal, we
first present an overview of the most exploited vulnerabilities in existing hardware, software, and
network layers. This is followed by critiques of existing state-of-the-art mitigation techniques as
why they do or don\'t work. We then discuss new attack patterns in emerging technologies such
as social media, cloud computing, smartphone technology, and critical infrastructure. Finally, we
describe our speculative observations on future research directions.
A multi-layered approach to cyber security utilising machine learning and advanced analytics is
essential to defend against sophisticated multi-stage attacks including:
Insider Threats | Advanced Human Attacks | Supply Chain Infection | Ransomware |
Compromised User Accounts | Data Loss
Prepare for a cyber security incident or attack and how to adequately manage the aftermath with
an organised approach to Incident Response – coordinating resources, people, information,
technology and complying with regulations.
INSIDER THREATS
Insider threat can originate from employees, contractors, third party services or anyone with
access rights to your network, corporate data or business premises.
The challenge is to identify attacks and understand how they develop in real-time by analysing
and correlating the subtle signs of compromise that an insider makes when they infiltrate the
network.
Traditional security measures are no longer sufficient to combat insider threat. A more
sophisticated, intelligence-based approach is required. Cyberseer uses machine-learning
technology to form a behavioural baseline for every user to determine normal activity and spot
new, previously unidentified threat behaviours. The move to a more proactive approach towards
security will enable companies to take action to thwart developing situations escalating into
exfiltrated information or damaging incidents.
ADVANCED HUMAN ATTACKS
Advanced threats use a set of stealthy and continuous processes to target an organisation, which
is often orchestrated for business or political motives by individuals (or groups). The “advanced”
process signifies sophisticated techniques using malware to exploit vulnerabilities in
organisations systems. They are considered persistent because an external command and control
system .
implement the following funtions. myg1 and myg2 are seperate. x and .pdf
implement the following funtions. myg1 and myg2 are seperate. x and y represent the two points
in the graph and w is the distance. after implementing ask the user to choose which funtion they
would like to use.
* insert [myg1 | myg2] x y w
* delete [myg1 | myg2] x y
* printgraph [myg1 | myg2]
* printdegree [myg1 | myg2] // if directed, print both in- and out-degree
* printcomplement [myg1 | myg2]
* eliminatelinks [myg1 | myg2] minW maxW
* differentlinks [myg1 | myg2] [myg1 | myg2]
* commonlinks [myg1 | myg2] [myg1 | myg2]
* dfs_print [myg1 | myg2] x
* bfs_print [myg1 | myg2] x
* isconnected [myg1 | myg2]
* numofconncomp [myg1 | myg2] * quit
here is the program so far. I just need to program and put in those function. I need to make it so
the user can pick what they want to do but I can program that myself. it\'s just programming the
above functions. I put clarifications of them at the bottom.
--------------------------------------------------------------------
graph.c program
#include
#include
typedef enum {FALSE, TRUE} bool;
#define MAXV 100
typedef struct edgenode{
int y;
int weight;
struct edgenode *next;
} edgenodeT;
typedef struct{
edgenodeT *edges[MAXV+1];
int degree[MAXV+1];
int nvertices;
int nedges;
bool directed;
} graphT;
void initialize_graph(graphT *g, bool directed);
void read_graph(graphT *g, char *filename);
void insert_edge(graphT *g, int x, int y, int w);
void print_graph(graphT *g, char *name);
void free_graph(graphT *g);
graphT *copy_graph(graphT *g);
main()
// Assume that MAXV is 6
{
graphT *myg1 = NULL, *myg2 = NULL;
if(argc < 2){
fprintf(stderr, \"Usage: %s graph_filename\", argv[0]);
exit(-1);
}
myg1 = (graphT *) malloc(sizeof(graphT));
if (myg1==NULL) {
fprintf(stderr, \"Cannot allocate memory for the graph\");
exit(-1);
}
initialize_graph(myg1, FALSE);
read_graph(myg1, argv[1]);
print_graph(myg1, \"myg1\");
myg2 = copy_graph(myg1);
print_graph(myg2, \"myg2\");
// NOW in a loop get commands and
// call related functions to perform them...
free_graph(myg1);
}
initialize_graph (graphT*g, bool directed)
{
int i;
g->nvertices= 0;
g->nedges= 0;
g->directed = directed;
for (i=1; i<=MAXV; i++)
g->edges[i] = NULL;
for(i=1; i<=MAXV; i++)
g->degree[i] = 0;
}
read_graph(graphT *g)
{
int i;
int n, m, dir;
int x, y, w;
FILE *fp
if((fp=fopen(filename,\"r\"))==NULL){
fprintf(stderr, \"Cannot open the graph file\");
exit(-1);
}
scanf(”%d %d %d”, &n, &m, &dir);
g->nvertices= n;
g->nedges= 0;
g->directed= dir;
for (i=1; i<=m; i++) {
scanf(”%d %d %d”, &x, &y, &w);
insert _edge(g, x, y, w);
if(dir==FALSE)
insert _edge(g, y, x, w);
}
fclose(fp);
}
insert_edge(graphT *g, int x, int y, int w)
{
edgenodeT *pe;
pe= malloc(sizeof(edgenodeT)); // check if NULL
pe->weight = w;
pe->y = y;
pe->next = g->edges[x];
g->edges[x] = pe;
g->degree[x]++;
g->nedges++;
}
print_graph (graphT *g, char *name)
{
edgenodeT *pe;
int i;
if(!g) return;
printf(\"Graph Name: %s\ \", name);
for(i=1; i<=g->nvertices; i++){
printf(\"Node %d: \", i);
pe = g->edges[i];
wh.
If two peers share a link in the overlay (they are neighbors in the .pdf
If two peers share a link in the overlay (they are neighbors in the overlay network represented as
a graph), can they necessarily exchange information with low latency? In at most 3 sentences,
explain why or why not.
Solution
Yes two peers can exchange information with low latency using PEER EXCHANGE ROUTINE
OPTIMIZING PROTOCOL(PROP).
how important is Negative Emotionality to an accounting career plea.pdf
how important is Negative Emotionality to an accounting career? please explain in detail
Solution
The negative emotional attitude is found to be an important for accounting job because such
emotions like, embarrassment, anxiety, frustration, anger and guilt, would lead to discrete links
towards rigorous assessment and testing, feedback on employee’s performance, personal study
and satisfaction. The functional characteristics have to be performed by an Accountant while on
his/her job.
Through all these characters, the person is derived to report and promote various strategies to
achieve the objectives and goals.
The negative emotions within the academic accounting environments would enhance the
performance and motivation on the job under various situations. To investigate and finding the
evidences are motivated by the negative nature of Accounting Jobs and its functions.
Thus, it is always important to have negative emotionality in an accounting career.
==============================================.
How do I know whether miscellaneous expense goes on top or bottom of.pdf
How do I know whether miscellaneous expense goes on top or bottom of the description in the
general journal?
Solution
Expenses are always debited and in the journal entry accounts are debited first and then credited.
Therefore miscellaneous expense will be debited and hence recorded first.
Thus miscellaneous expense will be recorded on the top..
Given a 1024 by 1024 RAM block, answer the following questions a) If.pdf
Given a 1024 by 1024 RAM block, answer the following questions a) If we used that to make
an 2-bit wide memory i) How many 2-bit locations would there be? ii) How many address bits
would we need to address those locations? iii) How many of those address bits would go to the
decoder? The MUX? b) If we used that to make a 16-bit wide memory [3] i) How many 16-bit
locations would there be? ii) How many address bits would we need to address those locations?
iii) How many of those address bits would go to the decoder? The MUX?
Solution
2)
a) Given Ram = 1024 bytes = 8192 bits
i) If 2 bits = 1 location
then 1024 bytes = 8192 bits = 8192 / 2 locations = 4096 locations
ii) 1 location = 1 binary representation
Therefore, 2n represents the locations .
4096 locations <= 2n where n is no of bits required
4096 locations <= 212 => 12 bits of address bits required
iii)
Out of 12 address bits ; 11 bits goes to the MUX
b)
i) If 16 bits = 1 location
then 1024 bytes = 8192 bits = 8192 / 16 locations = 512 locations
ii) 1 location = 1 binary representation
Therefore, 2n represents the locations .
512 locations <= 2n where n is no of bits required
512 locations <= 29 => 9 bits of address bits required
iii) out of 9 address bits ; 8 bits are given to decoder.
More from forladies (20)
You isolated an enveloped RNA virus. Purified RNA is not capable of .pdf
You isolated an enveloped RNA virus. Purified RNA is not capable of .pdf
What properties should the following molecules NOT have in common (S.pdf
What properties should the following molecules NOT have in common (S.pdf
What is the difference between Schedule C and Schedule E income (i.e.pdf
What is the difference between Schedule C and Schedule E income (i.e.pdf
What are the ethical and legal concerns associated with managing tel.pdf
What are the ethical and legal concerns associated with managing tel.pdf
Using the Graphical User Interface (GUI)Create a user nam.pdf
Using the Graphical User Interface (GUI)Create a user nam.pdf
The adjusting entry to record the salaries earned due to employees f.pdf
The adjusting entry to record the salaries earned due to employees f.pdf
TF A document type definition (DTD) can be referenced by many Exten.pdf
TF A document type definition (DTD) can be referenced by many Exten.pdf
Summarize the first and the second checkpoints during T cell develop.pdf
Summarize the first and the second checkpoints during T cell develop.pdf
PLEASE HELP!!Loren Seguara and Dale Johnson both work for Southern.pdf
PLEASE HELP!!Loren Seguara and Dale Johnson both work for Southern.pdf
Please answer the following at the bottom of the case. ThanksTo ne.pdf
Please answer the following at the bottom of the case. ThanksTo ne.pdf
Mitchell sets sail for the Chemiosmotic New World, despite dire w.pdf
Mitchell sets sail for the Chemiosmotic New World, despite dire w.pdf
Learn the genetics vocabulary (see HW4)] For each of the following ge.pdf
Learn the genetics vocabulary (see HW4)] For each of the following ge.pdf
If nominal GDP is 28000 and the money supply is 7000, what is velocit.pdf
If nominal GDP is 28000 and the money supply is 7000, what is velocit.pdf
Investments in trade securities are always short term investments. T.pdf
Investments in trade securities are always short term investments. T.pdf
Information Securityfind an article online discussing defense-in-d.pdf
Information Securityfind an article online discussing defense-in-d.pdf
implement the following funtions. myg1 and myg2 are seperate. x and .pdf
implement the following funtions. myg1 and myg2 are seperate. x and .pdf
If two peers share a link in the overlay (they are neighbors in the .pdf
If two peers share a link in the overlay (they are neighbors in the .pdf
how important is Negative Emotionality to an accounting career plea.pdf
how important is Negative Emotionality to an accounting career plea.pdf
How do I know whether miscellaneous expense goes on top or bottom of.pdf
How do I know whether miscellaneous expense goes on top or bottom of.pdf
Given a 1024 by 1024 RAM block, answer the following questions a) If.pdf
Given a 1024 by 1024 RAM block, answer the following questions a) If.pdf
Recently uploaded
Overview on Edible Vaccine: Pros & Cons with Mechanism
This ppt include the description of the edible vaccine i.e. a new concept over the traditional vaccine administered by injection.
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Palestine last event orientationfvgnh .pptx
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
678020731-Sumas-y-Restas-Para-Colorear.pdf
KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
Class 11 CBSE Business Studies Project ( AIDS TO TRADE - INSURANCE)
The approach at University of Liverpool.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Embracing GenAI - A Strategic Imperative
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Instructions for Submissions thorugh G- Classroom.pptx
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
Biological Screening of Herbal Drugs in detailed.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Recently uploaded (20)
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
Instructions for Submissions thorugh G- Classroom.pptx
Instructions for Submissions thorugh G- Classroom.pptx
I need to fill-in TODOs in .cpp file and in .h file Could some.pdf
- 1. I need to fill-in //TODO's in .cpp file and in .h file Could someone help me at least with few of them to give me an idea how deal with it. ***SinglyLinkedList.cpp #include #include #include "SinglyLinkedList.h" void test_constructor() { SinglyLinkedList lst = {100, 200, 300, 400, 500}; assert(*lst.at(0) == 100); assert(*lst.at(1) == 200); assert(*lst.at(2) == 300); assert(*lst.at(3) == 400); assert(*lst.at(4) == 500); assert(lst.size() == 5); } void test_remove() { SinglyLinkedList lst = {100, 200, 300, 400, 500}; lst.remove(2); assert(*lst.at(0) == 100); assert(*lst.at(1) == 200); assert(*lst.at(2) == 400); assert(*lst.at(3) == 500); assert(lst.size() == 4); } void test_insert() { // TODO } void test_push_back() { // TODO } void test_push_front() { // TODO } void test_append() { // TODO
- 2. } void test_sum() { // TODO } int main() { test_constructor(); test_remove(); test_insert(); test_push_back(); test_push_front(); test_append(); test_sum(); } ***SinglyLinkedList.h #include #include template class SinglyLinkedList { // Nested class representing the nodes in the list. class SinglyLinkedListNode { public: // The value stored in this node. T value; // The next node in the sequence. SinglyLinkedListNode *next; SinglyLinkedListNode(T value) : value(value), next(nullptr) {} SinglyLinkedListNode(T value, SinglyLinkedListNode *next) : value(value), next(next) {} // Return the size (length) of the linked list. std::size_t size(); }; SinglyLinkedListNode *head; SinglyLinkedListNode *tail; public: // Constructs a new SinglyLinkedList from an initializer_list of type T[].
- 3. // This is mostly for convenience, especially when testing. SinglyLinkedList(std::initializer_list items) : head(nullptr), tail(nullptr) { if (items.size() == 0) { return; } // initializer_lists were designed to be used iteratively, // so thats what we do. // Can you think of how to write this recursively? auto it = items.begin(); while (it != items.end()) { this->push_back(*it++); } } // Return a pointer to the value at the given index. // If the index is larger than the size of the list, // return a nullptr. // // ASIDE: We will cover exceptions later. T* at(std::size_t i); // Pushes a new node onto the back of the list. void push_back(T value); // Pushes a new node onto the front of the list. void push_front(T value); // Return the size (length) of the linked list. std::size_t size(); // Remove the specified node from the list. void remove(std::size_t i); // Insert the value at the index. void insert(std::size_t i, T value); // Append the given list to this one. void append(SinglyLinkedList list); }; template T* SinglyLinkedList::at(std::size_t i) { // TODO }
- 4. template void SinglyLinkedList::push_back(T value) { // TODO // Make sure that this is a O(1) operation! } template void SinglyLinkedList::push_front(T value) { // TODO // Make sure that this is a O(1) operation! } template void SinglyLinkedList::remove(std::size_t i) { // TODO // Don't forget to not only unlink the node, but to delete the memory. } template void SinglyLinkedList::insert(std::size_t i, T value) { // TODO // Don't forget to not only unlink the node, but to delete the memory. } template void SinglyLinkedList::append(SinglyLinkedList list) { // TODO } template std::size_t SinglyLinkedList::size() { if (this->head == nullptr) { return 0; } else { return this->head->size(); } } template std::size_t SinglyLinkedList::SinglyLinkedListNode::size() { if (this == nullptr) { return 0;
- 5. } else if (this->next == nullptr) { return 1; } else { return 1 + this->next->size(); } } // Takes a reference to a list of integers as an argument, // and returns the sum of the items in the list. long sum(const SinglyLinkedList& list) { // TODO } Solution #include #include #include struct node { int info; struct node *next; }*start; class SingleLinkedList { public: node* create_node(int); void insert_begin(); void insert_pos(); void insert_last(); void delete_pos(); void sort(); void search(); void update(); void reverse(); void display(); SingleLinkedList()
- 6. { start = NULL; } }; void main() { int choice, nodes, element, position, i; SingleLinkedList sl; start = NULL; while (1) { cout<>choice; switch(choice) { case 1: cout<<"Inserting Node at Beginning: "<info = value; temp->next = NULL; return temp; } } void SingleLinkedList::insert_begin() { int value; cout<<"Enter the value to be inserted: "; cin>>value; struct node *temp, *p; temp = create_node(value); if (start == NULL) { start = temp; start->next = NULL; } else { p = start; start = temp;
- 7. start->next = p; } cout<<"Element Inserted at beginning"<>value; struct node *temp, *s; temp = create_node(value); s = start; while (s->next != NULL) { s = s->next; } temp->next = NULL; s->next = temp; cout<<"Element Inserted at last"<>value; struct node *temp, *s, *ptr; temp = create_node(value); cout<<"Enter the postion at which node to be inserted: "; cin>>pos; int i; s = start; while (s != NULL) { s = s->next; counter++; } if (pos == 1) { if (start == NULL) { start = temp; start->next = NULL; } else { ptr = start; start = temp; start->next = ptr;
- 8. } } else if (pos > 1 && pos <= counter) { s = start; for (i = 1; i < pos; i++) { ptr = s; s = s->next; } ptr->next = temp; temp->next = s; } else { cout<<"Positon out of range"<next;s !=NULL;s = s->next) { if (ptr->info > s->info) { value = ptr->info; ptr->info = s->info; s->info = value; } } ptr = ptr->next; } } void SingleLinkedList::delete_pos() { int pos, i, counter = 0; if (start == NULL) { cout<<"List is empty"<>pos; struct node *s, *ptr; s = start; if (pos == 1)
- 9. { start = s->next; } else { while (s != NULL) { s = s->next; counter++; } if (pos > 0 && pos <= counter) { s = start; for (i = 1;i < pos;i++) { ptr = s; s = s->next; } ptr->next = s->next; } else { cout<<"Position out of range"<>pos; cout<<"Enter the new value: "; cin>>value; struct node *s, *ptr; s = start; if (pos == 1) { start->info = value; } else { for (i = 0;i < pos - 1;i++) { if (s == NULL)
- 10. { cout<<"There are less than "<next; } s->info = value; } cout<<"Node Updated"<>value; struct node *s; s = start; while (s != NULL) { pos++; if (s->info == value) { flag = true; cout<<"Element "<next; } if (!flag) cout<<"Element "<next == NULL) { return; } ptr1 = start; ptr2 = ptr1->next; ptr3 = ptr2->next; ptr1->next = NULL; ptr2->next = ptr1; while (ptr3 != NULL) { ptr1 = ptr2; ptr2 = ptr3; ptr3 = ptr3->next; ptr2->next = ptr1; } start = ptr2; } void SingleLinkedList::display()
- 11. { struct node *temp; if (start == NULL) { cout<<"The List is Empty"<info<<"->"; temp = temp->next; } cout<<"NULL"<