Programming in Coday we are working with singly linked lists. Las.pdf
•
0 likes•1 view
Please show work with the answer Gerald plans to prepare steak picado for a dinner party of 25. He will use a recipe for 4. When Gerald shops for the ingredients of the recipe, his best choice would be to use 1. D. 4. his calculator to figure approximate ingredients, and then round amounts to the nearest whole number. paper-and-pencil to figure approximate amounts of ingredients and buy that amount. mental math to get a rough estimate of ingredients and then double estimate to be on the safe side. a spreadsheet to convert the recipe for 25 so that he buys exactly what he needs. a calculator or pencil-and-paper to convert the recipe and then round, up the ingredients to ensure he has enough for 25 people. Solution Gerald plans to prepare steak picado for a dinner party for 25. Since he has arecipe for 4 and since 25/4 = 6.25, he needs a calculator or pencil -and-paper to convert the recipe ( by multiplying each ingrdient in the recipe for 4 by 6.25)and then round up the ingredients to ensure that he has enpugh for 25 people. Option E is the appropriate answer..
Report
Share
Report
Share
Download to read offline
Recommended
please help me in C++Objective Create a singly linked list of num.pdf
please help me in C++
Objective: Create a singly linked list of numbers based upon user input.
Program logic: Ask for a number, add that number to the front of the list, print the list. Repeat
until they enter -1 for the number. .
Sample Input: 10, 15, 5, 2, 4, -1 Output: 4, 2, 5, 15, 10
Solution
#include
#include
using namespace std;
// It contains the value and the pointer to the next element in the list.
struct element {
int value;
struct element *next;
};
struct element *head = NULL;
// The list is stored in the object of this class.
class linkedlist {
public:
// To display list, we first see if head is NULL,
// If head is NULL it means the list is empty.
// Then we traverse along the list and display each item, until the next pointer is NULL.
void display() {
if(head == NULL){
cout << \"The list is empty\ \";
} else {
struct element *temp;
temp = head;
while(temp != NULL){
cout << temp->value << \" \" ;
temp = temp->next;
}
cout << \"\ \";
}
}
// To add an element to the list,create a newElement and store the value.
// If head is NULL, add the newElement to the head.
// To add an element at the starting of the list.
// The next pointer of the newElement must point to the old head.
// The new head must be pointed to the newElement.
void add(int a){
struct element *newElement;
newElement = (struct element *)malloc(sizeof(struct element));
newElement->value = a;
newElement->next = NULL;
if(head == NULL) {
head = newElement;
} else {
newElement->next = head;
head = newElement;
}
}
};
int main()
{
// Create an object of the class linkedlist.
linkedlist l = linkedlist();
int a;
do {
cout << \"Enter a number : \";
cin >> a;
if(a!=-1) { // If the number is -1 do not add it to the list.
l.add(a); // Add the number to the list.
}
l.display(); // Display the list.
} while(a!=-1); // Keep asking for a number until -1 is pressed.
return 0;
}.
create a stack trace for this code I have provided the starter code as.pdf
create a stack trace for this code I have provided the starter code as well.
starter code:
# Write a function called middle(), that takes a list as a parameter.
# Your function should return a NEW list that contains all but the first and last
elements.
# You MAY NOT use any built in methods except for .append() and len().
"""** DO NOT MODIFY BELOW **"""
#DEFINE OUR LISTS
listToMiddleOne = ['a', 'b', 'c', 'd', 'e']
listToMiddleTwo = [1,2,3,4,5]
listToMiddleThree = [True, False, True, False, True]
#INCOMPLETE FUNCTION THAT NEEDS TO BE COMPLETED
def middle():#PASS LIST TO MIDDLE
#CREATE NEW LIST BY SLICING THE OLD LIST
return #RETURN THE NEW LIST
"""** DO NOT MODIFY BELOW **"""
outputOne = middle(listToMiddleOne)
outputTwo = middle(listToMiddleTwo)
outputThree = middle(listToMiddleThree)
print("Before removing the first and last elements -> ", listToMiddleOne, " ,after
removing -> ", outputOne)
print("Before removing the first and last elements -> ", listToMiddleTwo, " ,after
removing -> ", outputTwo)
print("Before removing the first and last elements -> ", listToMiddleThree,
" ,after removing -> ", outputThree)
code:
listToMiddleOne=['a','b','c','d','e'] #initializing the list
listToMiddleTwo=[1,2,3,4,5]
listToMiddleThree=[True,False,True,False,True]
def middle(l):
new_list=l[1:len(l)-1] #in the old list from 1 to len(l)-1 store the elements into new_list
return new_list #returning the new list
outputOne=middle(listToMiddleOne) #calling the function
outputTwo=middle(listToMiddleTwo)
outputThree=middle(listToMiddleThree)
print("Before removing the first and last elements->",listToMiddleOne," ,after removing -
>",outputOne) #printing the results
print("Before removing the first and last elements->",listToMiddleTwo," ,after removing -
>",outputTwo)
print("Before removing the first and last elements->",listToMiddleThree," ,after removing -
>",outputThree)
.
Need to be done in C++ Please Sorted number list implementation wit.pdf
Need to be done in C++ Please
Sorted number list implementation with linked lists
Step 1: Inspect the Node.h file
Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking
on the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables:
a double data value,
a pointer to the next node, and
a pointer to the previous node.
Each member variable is protected. So code outside of the class must use the provided getter and
setter member functions to get or set a member variable.
Node.h is read only, since no changes are required.
Step 2: Implement the Insert() member function
A class for a sorted, doubly-linked list is declared in SortedNumberList.h. Implement the
SortedNumberList class's Insert() member function. The function must create a new node with
the parameter value, then insert the node into the proper sorted position in the linked list. Ex:
Suppose a SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node
with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's
sorted order and yielding: 23 35.5 47.25 86
Step 3: Test in develop mode
Code in main() takes a space-separated list of numbers and inserts each into a SortedNumberList.
The list is displayed after each insertion. Ex: If input is
then output is:
Try various program inputs, ensuring that each outputs a sorted list.
Step 4: Implement the Remove() member function
Implement the SortedNumberList class's Remove() member function. The function takes a
parameter for the number to be removed from the list. If the number does not exist in the list, the
list is not changed and false is returned. Otherwise, the first instance of the number is removed
from the list and true is returned.
Uncomment the commented-out part in main() that reads a second input line and removes
numbers from the list. Test in develop mode to ensure that insertion and removal both work
properly, then submit code for grading. Ex: If input is
then output is:
Main.cpp
#include <iostream>
#include <string>
#include <vector>
#include "Node.h"
#include "SortedNumberList.h"
using namespace std;
void PrintList(SortedNumberList& list);
vector<string> SpaceSplit(string source);
int main(int argc, char *argv[]) {
// Read the line of input numbers
string inputLine;
getline(cin, inputLine);
// Split on space character
vector<string> terms = SpaceSplit(inputLine);
// Insert each value and show the sorted list's contents after each insertion
SortedNumberList list;
for (auto term : terms) {
double number = stod(term);
cout << "List after inserting " << number << ": " << endl;
list.Insert(number);
PrintList(list);
}
/*
// Read the input line with numbers to remove
getline(cin, inputLine);
terms = SpaceSplit(inputLine);
// Remove each value
for (auto term : terms) {
double number = stod(term);
cout << "List after removing " << number << ": " << endl;
list.Remove(number);
PrintList(list).
Inspect the class declaration for a doubly-linked list node in Node-h-.pdf
Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking
on the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables: a double data value, a pointer to the next node, and a pointer to the previous
node. Each member variable is protected. So code outside of the class must use the provided
getter and setter member functions to get or set a member variable. Node.h is read only, since no
changes are required. Step 2: Implement the Insert() member function A class for a sorted,
doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList class's
Insert() member function. The function must create a new node with the parameter value, then
insert the node into the proper sorted position in the linked list. Ex: Suppose a
SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node with data
value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order
and yielding: 23 35.5 47.25 86 Step 3: Test in develop mode Code in main() takes a space-
separated list of numbers and inserts each into a SortedNumberList. The list is displayed after
each insertion. Ex: If input is 77 15 -42 63.5 then output is: List after inserting 77: 77 List after
inserting 15: 15 77 List after inserting -42: -42 15 77 List after inserting 63.5: -42 15 63.5 77 Try
various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove()
member function Implement the SortedNumberList class's Remove() member function. The
function takes a parameter for the number to be removed from the list. If the number does not
exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the
number is removed from the list and true is returned. Uncomment the commented-out part in
main() that reads a second input line and removes numbers from the list. Test in develop mode to
ensure that insertion and removal both work properly, then submit code for grading. Ex: If input
is 84 72 19 61 19 84 then output is: List after inserting 84: 84 List after inserting 72: 72 84 List
after inserting 19: 19 72 84 List after inserting 61: 19 61 72 84 List after removing 19: 61 72 84
List after removing 84: 61 72
main.cpp
#include
#include
#include
#include "Node.h"
#include "SortedNumberList.h"
using namespace std; void PrintList(SortedNumberList& list); vector SpaceSplit(string source);
int main(int argc, char *argv[]) { // Read the line of input numbers string inputLine; getline(cin,
inputLine); // Split on space character vector terms = SpaceSplit(inputLine); // Insert each value
and show the sorted list's contents after each insertion SortedNumberList list; for (auto term :
terms) { double number = stod(term); cout << "List after inserting " << number << ": " << endl;
list.Insert(number); PrintList(list); } /* // Read the input line with numbers to remove getline(cin,
inputLi.
Need to be done in C Please Sorted number list implementation with.pdf
Need to be done in C Please
Sorted number list implementation with linked lists
Step 1: Inspect the Node.h file
Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking
on the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables:
a double data value,
a pointer to the next node, and
a pointer to the previous node.
Each member variable is protected. So code outside of the class must use the provided getter and
setter member functions to get or set a member variable.
Node.h is read only, since no changes are required.
Step 2: Implement the Insert() member function
A class for a sorted, doubly-linked list is declared in SortedNumberList.h. Implement the
SortedNumberList class's Insert() member function. The function must create a new node with
the parameter value, then insert the node into the proper sorted position in the linked list. Ex:
Suppose a SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node
with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's
sorted order and yielding: 23 35.5 47.25 86
Step 3: Test in develop mode
Code in main() takes a space-separated list of numbers and inserts each into a SortedNumberList.
The list is displayed after each insertion. Ex: If input is
then output is:
Try various program inputs, ensuring that each outputs a sorted list.
Step 4: Implement the Remove() member function
Implement the SortedNumberList class's Remove() member function. The function takes a
parameter for the number to be removed from the list. If the number does not exist in the list, the
list is not changed and false is returned. Otherwise, the first instance of the number is removed
from the list and true is returned.
Uncomment the commented-out part in main() that reads a second input line and removes
numbers from the list. Test in develop mode to ensure that insertion and removal both work
properly, then submit code for grading. Ex: If input is
then output is:
Main.cpp
#include <iostream>
#include <string>
#include <vector>
#include "Node.h"
#include "SortedNumberList.h"
using namespace std;
void PrintList(SortedNumberList& list);
vector<string> SpaceSplit(string source);
int main(int argc, char *argv[]) {
// Read the line of input numbers
string inputLine;
getline(cin, inputLine);
// Split on space character
vector<string> terms = SpaceSplit(inputLine);
// Insert each value and show the sorted list's contents after each insertion
SortedNumberList list;
for (auto term : terms) {
double number = stod(term);
cout << "List after inserting " << number << ": " << endl;
list.Insert(number);
PrintList(list);
}
/*
// Read the input line with numbers to remove
getline(cin, inputLine);
terms = SpaceSplit(inputLine);
// Remove each value
for (auto term : terms) {
double number = stod(term);
cout << "List after removing " << number << ": " << endl;
list.Remove(number);
PrintList(list);
.
Please help solve this in C++ So the program is working fin.pdf
Please help solve this in C++. So the program is working fine but when submitting it, it gives me a
code -11, and I believe the problem is that after inserting the numbers it removes them one by one
until the last in the list, and when it tries to remove the last number in the list that is when it
counters the problem. Below is the full code but you just need to change something in the
SortedNumberList.h file under the bool remove function.
4.18 LAB: Sorted number list implementation with linked lists Step 1: Inspect the Node.h file
Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking on
the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables: - a double data value, - a pointer to the next node, and - a pointer to the
previous node. Each member variable is protected. So code outside of the class must use the
provided getter and setter member functions to get or set a member variable. Node.h is read only,
since no changes are required. Step 2: Implement the Insert() member function A class for a
sorted, doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList
class's Insert() member function. The function must create a new node with the parameter value,
then insert the node into the proper sorted position in the linked list. Ex: Suppose a
SortedNumberList's current list is 2347.2586, then Insert(33.5) is called. A new node with data
value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order
and yielding: 2335.547.2586Step 3: Test in develop mode Code in main() takes a space-
separated list of numbers and inserts each into a SortedNumberList. The list is displayed after
each insertion. Ex: If input is 77154263.5 then output is: List after inserting 77 : 77 List after
inserting 15 : 1577 List after inserting -42 : -421577 List after inserting 63.5: -421563.577 Try
various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove()
member function Implement the SortedNumberList class's Remove(0 member function. The
function takes a parameter for the number to be removed from the list. If the number does not
exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the
number is removed from the list and true is returned. Uncomment the commented-out part in
main() that reads a second input line and removes numbers from the list. Test in develop mode to
ensure that insertion and removal both work properly, then submit code for grading. Ex: If input is
841972841961 then output is: List after inserting 84: 84 List after inserting 72 : 7284 List after
inserting 19: 1972 84 List after inserting 61: 1961 : 72 8 List after removing 19: 6172 84 List after
removing 84: 6172Current file: main.cpp - // Insert each value and show the sorted List's contents
after each insertion sortedNumberList list; for (auto term : terms) { doubl.
Lab_3- Objective- Experiment with Lists- Stacks- and Queues- Simulate.docx
Lab_3: Objective: Experiment with Lists, Stacks, and Queues: Simulate an OS task manager
Assignment:
Using the startup code, implement the following:
1-Create List L1 of 10 elements (task IDs), e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
2-Insert a new list element in between (at every other element), such as: 1,100, 2,200, 3,300, 4,400, ... 10,1000;
Simulate a new CPU core assignment:
3-Create another List L2, and extract the newly inserted elements into this new list L2
i.e. L1 should go back to the original list: L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
L2 should be: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000
Start executing:
4-Create a Queue Q1 by extracting L1, and inserting L2 elements: i.e. Q should start with: 1,2,3, ... 10, and (10, 20 ... 100) will be inserted
Q1=1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000
Label tasks as finished with the possibility of revisiting a task, such as:
5-Create a Stack S1 which by deleting the elements of Q1 and inserting them in L1
6-Pop out all elements of the Stack, i.e. should end up with an empty stack
Extra credit: Simulate a re-executed task, i.e. Pop out a task out of the Stack and reinsert, this simulate a failed task.
7-Verify the functionality and capture the results in a report form.
List.h
main.cpp
#include "List.h"
#include <stdlib.h>
#include <iostream>
using namespace std;
template <typename Object>
class Stack
{
public:
bool isEmpty() const
{
return theList.empty();
}
const Object& top() const
{
return theList.front();
}
void push(const Object& x)
{
theList.push_front(x);
}
void pop(Object& x)
{
x = theList.front(); theList.pop_front();
}
private:
List<Object> theList;
};
template <typename Object>
class Queue
{
public:
bool isEmpty() const
{
return theList.empty();
}
const Object& getFront() const
{
return theList.front();
}
void enqueue(const Object& x)
{
theList.push_back(x);
}
void dequeue(Object& x)
{
x = theList.front(); theList.pop_front();
}
private:
List<Object> theList;
};
int main()
{
int i;
const int N = 10;
List<int> L1;
Stack<int> S1;
Queue<int> Q1;
List<int>::iterator node; //Variable to keep track of the position as we traverse
// List Section example:
//Q1: Create List L1 of 10 elements, e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
// create the list array as a starting point:
for (i = N; i > 0; --i)
{
L1.push_front(i);
}
// show L1 with an iterator
cout << "List L1 is:" << endl;
for (auto it = L1.begin(); it != L1.end(); ++it)
{
cout << *it << ' ';
}
// Stack Section example:
//
// Stack to be created per the above assignment requirment
cout << "\nStack S1 is:" << endl;;
for (i = N - 1; i >= 0; --i)
{
S1.push(i);
cout << S1.top() << " " << endl;
}
while (!S1.isEmpty())
{
cout << S1.top() << endl;
S1.pop(i);
}
// Queue section, to be created per the above assignment requirment
//
//
return 0;
}
please answer with C++ code thank you!
private: int theSize; Node *head.
Recommended
please help me in C++Objective Create a singly linked list of num.pdf
please help me in C++
Objective: Create a singly linked list of numbers based upon user input.
Program logic: Ask for a number, add that number to the front of the list, print the list. Repeat
until they enter -1 for the number. .
Sample Input: 10, 15, 5, 2, 4, -1 Output: 4, 2, 5, 15, 10
Solution
#include
#include
using namespace std;
// It contains the value and the pointer to the next element in the list.
struct element {
int value;
struct element *next;
};
struct element *head = NULL;
// The list is stored in the object of this class.
class linkedlist {
public:
// To display list, we first see if head is NULL,
// If head is NULL it means the list is empty.
// Then we traverse along the list and display each item, until the next pointer is NULL.
void display() {
if(head == NULL){
cout << \"The list is empty\ \";
} else {
struct element *temp;
temp = head;
while(temp != NULL){
cout << temp->value << \" \" ;
temp = temp->next;
}
cout << \"\ \";
}
}
// To add an element to the list,create a newElement and store the value.
// If head is NULL, add the newElement to the head.
// To add an element at the starting of the list.
// The next pointer of the newElement must point to the old head.
// The new head must be pointed to the newElement.
void add(int a){
struct element *newElement;
newElement = (struct element *)malloc(sizeof(struct element));
newElement->value = a;
newElement->next = NULL;
if(head == NULL) {
head = newElement;
} else {
newElement->next = head;
head = newElement;
}
}
};
int main()
{
// Create an object of the class linkedlist.
linkedlist l = linkedlist();
int a;
do {
cout << \"Enter a number : \";
cin >> a;
if(a!=-1) { // If the number is -1 do not add it to the list.
l.add(a); // Add the number to the list.
}
l.display(); // Display the list.
} while(a!=-1); // Keep asking for a number until -1 is pressed.
return 0;
}.
create a stack trace for this code I have provided the starter code as.pdf
create a stack trace for this code I have provided the starter code as well.
starter code:
# Write a function called middle(), that takes a list as a parameter.
# Your function should return a NEW list that contains all but the first and last
elements.
# You MAY NOT use any built in methods except for .append() and len().
"""** DO NOT MODIFY BELOW **"""
#DEFINE OUR LISTS
listToMiddleOne = ['a', 'b', 'c', 'd', 'e']
listToMiddleTwo = [1,2,3,4,5]
listToMiddleThree = [True, False, True, False, True]
#INCOMPLETE FUNCTION THAT NEEDS TO BE COMPLETED
def middle():#PASS LIST TO MIDDLE
#CREATE NEW LIST BY SLICING THE OLD LIST
return #RETURN THE NEW LIST
"""** DO NOT MODIFY BELOW **"""
outputOne = middle(listToMiddleOne)
outputTwo = middle(listToMiddleTwo)
outputThree = middle(listToMiddleThree)
print("Before removing the first and last elements -> ", listToMiddleOne, " ,after
removing -> ", outputOne)
print("Before removing the first and last elements -> ", listToMiddleTwo, " ,after
removing -> ", outputTwo)
print("Before removing the first and last elements -> ", listToMiddleThree,
" ,after removing -> ", outputThree)
code:
listToMiddleOne=['a','b','c','d','e'] #initializing the list
listToMiddleTwo=[1,2,3,4,5]
listToMiddleThree=[True,False,True,False,True]
def middle(l):
new_list=l[1:len(l)-1] #in the old list from 1 to len(l)-1 store the elements into new_list
return new_list #returning the new list
outputOne=middle(listToMiddleOne) #calling the function
outputTwo=middle(listToMiddleTwo)
outputThree=middle(listToMiddleThree)
print("Before removing the first and last elements->",listToMiddleOne," ,after removing -
>",outputOne) #printing the results
print("Before removing the first and last elements->",listToMiddleTwo," ,after removing -
>",outputTwo)
print("Before removing the first and last elements->",listToMiddleThree," ,after removing -
>",outputThree)
.
Need to be done in C++ Please Sorted number list implementation wit.pdf
Need to be done in C++ Please
Sorted number list implementation with linked lists
Step 1: Inspect the Node.h file
Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking
on the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables:
a double data value,
a pointer to the next node, and
a pointer to the previous node.
Each member variable is protected. So code outside of the class must use the provided getter and
setter member functions to get or set a member variable.
Node.h is read only, since no changes are required.
Step 2: Implement the Insert() member function
A class for a sorted, doubly-linked list is declared in SortedNumberList.h. Implement the
SortedNumberList class's Insert() member function. The function must create a new node with
the parameter value, then insert the node into the proper sorted position in the linked list. Ex:
Suppose a SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node
with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's
sorted order and yielding: 23 35.5 47.25 86
Step 3: Test in develop mode
Code in main() takes a space-separated list of numbers and inserts each into a SortedNumberList.
The list is displayed after each insertion. Ex: If input is
then output is:
Try various program inputs, ensuring that each outputs a sorted list.
Step 4: Implement the Remove() member function
Implement the SortedNumberList class's Remove() member function. The function takes a
parameter for the number to be removed from the list. If the number does not exist in the list, the
list is not changed and false is returned. Otherwise, the first instance of the number is removed
from the list and true is returned.
Uncomment the commented-out part in main() that reads a second input line and removes
numbers from the list. Test in develop mode to ensure that insertion and removal both work
properly, then submit code for grading. Ex: If input is
then output is:
Main.cpp
#include <iostream>
#include <string>
#include <vector>
#include "Node.h"
#include "SortedNumberList.h"
using namespace std;
void PrintList(SortedNumberList& list);
vector<string> SpaceSplit(string source);
int main(int argc, char *argv[]) {
// Read the line of input numbers
string inputLine;
getline(cin, inputLine);
// Split on space character
vector<string> terms = SpaceSplit(inputLine);
// Insert each value and show the sorted list's contents after each insertion
SortedNumberList list;
for (auto term : terms) {
double number = stod(term);
cout << "List after inserting " << number << ": " << endl;
list.Insert(number);
PrintList(list);
}
/*
// Read the input line with numbers to remove
getline(cin, inputLine);
terms = SpaceSplit(inputLine);
// Remove each value
for (auto term : terms) {
double number = stod(term);
cout << "List after removing " << number << ": " << endl;
list.Remove(number);
PrintList(list).
Inspect the class declaration for a doubly-linked list node in Node-h-.pdf
Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking
on the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables: a double data value, a pointer to the next node, and a pointer to the previous
node. Each member variable is protected. So code outside of the class must use the provided
getter and setter member functions to get or set a member variable. Node.h is read only, since no
changes are required. Step 2: Implement the Insert() member function A class for a sorted,
doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList class's
Insert() member function. The function must create a new node with the parameter value, then
insert the node into the proper sorted position in the linked list. Ex: Suppose a
SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node with data
value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order
and yielding: 23 35.5 47.25 86 Step 3: Test in develop mode Code in main() takes a space-
separated list of numbers and inserts each into a SortedNumberList. The list is displayed after
each insertion. Ex: If input is 77 15 -42 63.5 then output is: List after inserting 77: 77 List after
inserting 15: 15 77 List after inserting -42: -42 15 77 List after inserting 63.5: -42 15 63.5 77 Try
various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove()
member function Implement the SortedNumberList class's Remove() member function. The
function takes a parameter for the number to be removed from the list. If the number does not
exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the
number is removed from the list and true is returned. Uncomment the commented-out part in
main() that reads a second input line and removes numbers from the list. Test in develop mode to
ensure that insertion and removal both work properly, then submit code for grading. Ex: If input
is 84 72 19 61 19 84 then output is: List after inserting 84: 84 List after inserting 72: 72 84 List
after inserting 19: 19 72 84 List after inserting 61: 19 61 72 84 List after removing 19: 61 72 84
List after removing 84: 61 72
main.cpp
#include
#include
#include
#include "Node.h"
#include "SortedNumberList.h"
using namespace std; void PrintList(SortedNumberList& list); vector SpaceSplit(string source);
int main(int argc, char *argv[]) { // Read the line of input numbers string inputLine; getline(cin,
inputLine); // Split on space character vector terms = SpaceSplit(inputLine); // Insert each value
and show the sorted list's contents after each insertion SortedNumberList list; for (auto term :
terms) { double number = stod(term); cout << "List after inserting " << number << ": " << endl;
list.Insert(number); PrintList(list); } /* // Read the input line with numbers to remove getline(cin,
inputLi.
Need to be done in C Please Sorted number list implementation with.pdf
Need to be done in C Please
Sorted number list implementation with linked lists
Step 1: Inspect the Node.h file
Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking
on the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables:
a double data value,
a pointer to the next node, and
a pointer to the previous node.
Each member variable is protected. So code outside of the class must use the provided getter and
setter member functions to get or set a member variable.
Node.h is read only, since no changes are required.
Step 2: Implement the Insert() member function
A class for a sorted, doubly-linked list is declared in SortedNumberList.h. Implement the
SortedNumberList class's Insert() member function. The function must create a new node with
the parameter value, then insert the node into the proper sorted position in the linked list. Ex:
Suppose a SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node
with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's
sorted order and yielding: 23 35.5 47.25 86
Step 3: Test in develop mode
Code in main() takes a space-separated list of numbers and inserts each into a SortedNumberList.
The list is displayed after each insertion. Ex: If input is
then output is:
Try various program inputs, ensuring that each outputs a sorted list.
Step 4: Implement the Remove() member function
Implement the SortedNumberList class's Remove() member function. The function takes a
parameter for the number to be removed from the list. If the number does not exist in the list, the
list is not changed and false is returned. Otherwise, the first instance of the number is removed
from the list and true is returned.
Uncomment the commented-out part in main() that reads a second input line and removes
numbers from the list. Test in develop mode to ensure that insertion and removal both work
properly, then submit code for grading. Ex: If input is
then output is:
Main.cpp
#include <iostream>
#include <string>
#include <vector>
#include "Node.h"
#include "SortedNumberList.h"
using namespace std;
void PrintList(SortedNumberList& list);
vector<string> SpaceSplit(string source);
int main(int argc, char *argv[]) {
// Read the line of input numbers
string inputLine;
getline(cin, inputLine);
// Split on space character
vector<string> terms = SpaceSplit(inputLine);
// Insert each value and show the sorted list's contents after each insertion
SortedNumberList list;
for (auto term : terms) {
double number = stod(term);
cout << "List after inserting " << number << ": " << endl;
list.Insert(number);
PrintList(list);
}
/*
// Read the input line with numbers to remove
getline(cin, inputLine);
terms = SpaceSplit(inputLine);
// Remove each value
for (auto term : terms) {
double number = stod(term);
cout << "List after removing " << number << ": " << endl;
list.Remove(number);
PrintList(list);
.
Please help solve this in C++ So the program is working fin.pdf
Please help solve this in C++. So the program is working fine but when submitting it, it gives me a
code -11, and I believe the problem is that after inserting the numbers it removes them one by one
until the last in the list, and when it tries to remove the last number in the list that is when it
counters the problem. Below is the full code but you just need to change something in the
SortedNumberList.h file under the bool remove function.
4.18 LAB: Sorted number list implementation with linked lists Step 1: Inspect the Node.h file
Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking on
the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables: - a double data value, - a pointer to the next node, and - a pointer to the
previous node. Each member variable is protected. So code outside of the class must use the
provided getter and setter member functions to get or set a member variable. Node.h is read only,
since no changes are required. Step 2: Implement the Insert() member function A class for a
sorted, doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList
class's Insert() member function. The function must create a new node with the parameter value,
then insert the node into the proper sorted position in the linked list. Ex: Suppose a
SortedNumberList's current list is 2347.2586, then Insert(33.5) is called. A new node with data
value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order
and yielding: 2335.547.2586Step 3: Test in develop mode Code in main() takes a space-
separated list of numbers and inserts each into a SortedNumberList. The list is displayed after
each insertion. Ex: If input is 77154263.5 then output is: List after inserting 77 : 77 List after
inserting 15 : 1577 List after inserting -42 : -421577 List after inserting 63.5: -421563.577 Try
various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove()
member function Implement the SortedNumberList class's Remove(0 member function. The
function takes a parameter for the number to be removed from the list. If the number does not
exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the
number is removed from the list and true is returned. Uncomment the commented-out part in
main() that reads a second input line and removes numbers from the list. Test in develop mode to
ensure that insertion and removal both work properly, then submit code for grading. Ex: If input is
841972841961 then output is: List after inserting 84: 84 List after inserting 72 : 7284 List after
inserting 19: 1972 84 List after inserting 61: 1961 : 72 8 List after removing 19: 6172 84 List after
removing 84: 6172Current file: main.cpp - // Insert each value and show the sorted List's contents
after each insertion sortedNumberList list; for (auto term : terms) { doubl.
Lab_3- Objective- Experiment with Lists- Stacks- and Queues- Simulate.docx
Lab_3: Objective: Experiment with Lists, Stacks, and Queues: Simulate an OS task manager
Assignment:
Using the startup code, implement the following:
1-Create List L1 of 10 elements (task IDs), e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
2-Insert a new list element in between (at every other element), such as: 1,100, 2,200, 3,300, 4,400, ... 10,1000;
Simulate a new CPU core assignment:
3-Create another List L2, and extract the newly inserted elements into this new list L2
i.e. L1 should go back to the original list: L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
L2 should be: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000
Start executing:
4-Create a Queue Q1 by extracting L1, and inserting L2 elements: i.e. Q should start with: 1,2,3, ... 10, and (10, 20 ... 100) will be inserted
Q1=1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000
Label tasks as finished with the possibility of revisiting a task, such as:
5-Create a Stack S1 which by deleting the elements of Q1 and inserting them in L1
6-Pop out all elements of the Stack, i.e. should end up with an empty stack
Extra credit: Simulate a re-executed task, i.e. Pop out a task out of the Stack and reinsert, this simulate a failed task.
7-Verify the functionality and capture the results in a report form.
List.h
main.cpp
#include "List.h"
#include <stdlib.h>
#include <iostream>
using namespace std;
template <typename Object>
class Stack
{
public:
bool isEmpty() const
{
return theList.empty();
}
const Object& top() const
{
return theList.front();
}
void push(const Object& x)
{
theList.push_front(x);
}
void pop(Object& x)
{
x = theList.front(); theList.pop_front();
}
private:
List<Object> theList;
};
template <typename Object>
class Queue
{
public:
bool isEmpty() const
{
return theList.empty();
}
const Object& getFront() const
{
return theList.front();
}
void enqueue(const Object& x)
{
theList.push_back(x);
}
void dequeue(Object& x)
{
x = theList.front(); theList.pop_front();
}
private:
List<Object> theList;
};
int main()
{
int i;
const int N = 10;
List<int> L1;
Stack<int> S1;
Queue<int> Q1;
List<int>::iterator node; //Variable to keep track of the position as we traverse
// List Section example:
//Q1: Create List L1 of 10 elements, e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
// create the list array as a starting point:
for (i = N; i > 0; --i)
{
L1.push_front(i);
}
// show L1 with an iterator
cout << "List L1 is:" << endl;
for (auto it = L1.begin(); it != L1.end(); ++it)
{
cout << *it << ' ';
}
// Stack Section example:
//
// Stack to be created per the above assignment requirment
cout << "\nStack S1 is:" << endl;;
for (i = N - 1; i >= 0; --i)
{
S1.push(i);
cout << S1.top() << " " << endl;
}
while (!S1.isEmpty())
{
cout << S1.top() << endl;
S1.pop(i);
}
// Queue section, to be created per the above assignment requirment
//
//
return 0;
}
please answer with C++ code thank you!
private: int theSize; Node *head.
template ltclass Tgt struct nodeType T data n.pdf
template <class T>
struct nodeType
{
T data;
nodeType *next;
};
template <class T>
class LinkedList {
nodeType<T> *head, *tail;
int count;
public:
LinkedList();
void insertFirst(T item);
void insertLast(T item);
void insertAt(T item, int pos);
void print();
bool simplecompare(LinkedList<T> &rL)
{
if (count != rL.count)
return false;
nodeType<T> *cur, *rCur;
for (cur = head, rCur = rL.head; cur != NULL; cur = cur->next, rCur = rCur->next)
if (cur->data != rCur->data)
return false;
return true;
}
int compare(LinkedList<T> &rL);
~LinkedList();
};
//driver program:
int main(void)
{
char item;
LinkedList<char> list1, list2;
cout << "Please enter the first list of characters"
<< "nPress Ctrl+Z to stop entering." << endl;
cin >> item;
while (!cin.eof()) {
list1.insertLast(item);
cin >> item;
}
cin.clear();
cout << "Please enter the second list of characters"
<< "nPress Ctrl+Z to stop entering." << endl;
cin >> item;
while (!cin.eof()) {
list2.insertLast(item);
cin >> item;
}
list1.print();
list2.print();
int result = list1.compare(list2);
if (result == 0)
cout << "The lists are same!n";
else if (result == -1)
cout << "first list < second listn" << endl;
else cout << "first list > second listn" << endl;
return 0;
}
1 Questions A simplified doublyLinkedList class is provided in lab03doublyLinkedList_template.h
file on CATS. Solve the following questions by using that elass. 1. The definition of insertFirst(T
item) function is missing. Complete it. 2. The definition of insertLast(T item) function is missing.
Complete it. 3. The definition of insertAt(T item, int order) function is missing. Complete it. 4.
Update print() function to print the list in forward direction. 5. The definition of deleteItem(T item)
function is missing. Complete it. 6. Add an extractMax(T max) function to the doublyLinkedList
class. The function must extract all nodes containing elements less than max from the list, and
construct a new list using those nodes. After the function call, the original list must only have the
nodes whose data fields are greater than max, while the new list is containing the smaller ones.
The new list must be returned by the function. You're not allowed to delete and/or create new
nodes. Your function must just move the subjected nodes from one list to the other. Let the
following list be the original list: If the function is called as newList = myList.extractMax (30), then
the newList becomes: 2 Assignment Implement a class to represent a circular linked list. You can
directly adapt SinglyLinkedList class that we've already defined in linkedList.h. Only the following
member functions will be defined for the class: - default constructor to set the pointer data
members to NULL and count to 0 . - insertItem to insert a given item to the list. - deleteItem to
remove a specific item from the list. Item may occur multiple times, thus the function must remove
every occurrences of the item from the list. 1 - print to print the linked list from head to tail. .
QUESTION If you look at the code, youll see that we keep two list.pdf
QUESTION: If you look at the code, you\'ll see that we keep two lists, one to print the text in
forward order, and one to print the text in reverse order. The forward one is using our empty
add() function, so nothing gets put into it. You\'ll fix that, as well as modifiying insert() and
erase(). The reverse on works by inserting always at the head of the list, like a Stack.Functions
insert(), erase(), and add() must be modified so that if the last node of the list changes, List::last
must change, as well. YOU JUST HAVE TO COMPLETE THE LIST.CPP FILE SO THAT IT
PRINTS THE OUTPUT IN THE FORWARD ORDER.FINISH THE CODE ONLY IN
LIST.CPP FILE AND OTHER FILES ARE JUST FOR REFERENCE. MORE
INFORMATION AND HINTS ARE GIVEN IN THE COMMENTS IN LIST.CPP FILE.
HINT: AFTER the existing code runs, there\'s an easy way to know if you just changed the last
node in the list; if you did, it\'s time to update the \"last\" pointer. And remember that \'add\'-ing
the first item is a special case. We could make a Linked List behave a lot like a Queue if it were
really efficient to add a node at the end of the list, that is, without having to chase links from the
head to the tail. So we will add another pointer to our List class that will always point at the last
item in the list. Read the existing code carefully and understand how it works. The \"add\"
function is now empty. If you run the file you should get an output that starts out like this:
?CURRENT LIST.CPP:
CURRENT OUTPUT:
MAIN.CPP FILE:
LIST.H FILE: include list include
Solution
PROGRAM CODE:
/*
* List.cpp
*
* Created on: 29-Nov-2016
* Author: kasturi
*/
#include \"List.h\"
#include
#include
#include
using namespace std;
void List::insert(ElemetType item, int position)
{
Node * predptr = first;
for(int i=1; i< position && predptr && predptr->next; i++)
{
predptr = predptr->next;
}
Node * newptr = new Node;
newptr->payload = item;
if(!predptr)
{
newptr->next = 0;
first = newptr;
}
else if(position == 0)
{
newptr->next = first;
first = newptr;
}
else
{
newptr->next = predptr->next;
predptr->next = newptr;
}
}
void List::erase(int position)
{
Node * predptr = first;
for(int i=1; inext; i++)
{
predptr = predptr->next;
}
if(!predptr)
{
}
else if(position == 1)
{
first = predptr->next;
delete predptr;
}
else
{
Node *ptr = predptr->next;
predptr->next = ptr->next;
delete ptr;
}
}
void List::display(ostream& ostr)
{
Node * ptr = last; //changed the display function to print the first
while(ptr)
{
ostr<payload<next;
}
}
List::List()
{
first = 0;
last = 0;
}
List::~List()
{
while(first)
{
Node *nxt = first->next;
delete first;
first = nxt;
}
}
void List::add(ElemetType item)
{
//added code to add values into the last node
Node * predptr = last;
Node *newptr = new Node;
newptr->payload= item;
while( predptr && predptr->next)
{
predptr = predptr->next;
}
if(!predptr)
{
newptr->next = 0;
last = newptr;
}
else
{
newptr->next = predptr->next;
predptr->next = newptr;
}
}
OUTPUT:
Forward:
The
quick
brown
fox
jumped
over
the
back.
I need to fill-in TODOs in .cpp file and in .h file Could some.pdf
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.
in C++ , Design a linked list class named IntegerList to hold a seri.pdf
in C++ , Design a linked list class named IntegerList to hold a series of integers. The class must
have public member functions for appending , inserting, deleting and displaying nodes. The
append function must append a node to the end of the list. The insert function must insert node in
ascending order. The delete function must delete the node with the given value. The display
function should display the list from head to tail. The IntegerList class should also have a
destructor that destroys the list and release memory. The list node must be declared as a structure
using keyword struct. This structure is a private member of IntegerList. You should also store the
head of the list as a private member.
Write a test program to test the implementation your IntegerList class works properly.
Solution
Here is the code for the above scenario:
#include
using namespace std;
struct ListNode
{
float value;
ListNode *next;
};
ListNode *head;
class LinkedList
{
public:
int insertNode(float num);
int appendNode(float num);
void deleteNode(float num);
void destroyList();
void displayList();
LinkedList(void) {head = NULL;}
~LinkedList(void) {destroyList();}
};
int LinkedList::appendNode(float num)
{
ListNode *newNode, *nodePtr = head;
newNode = new ListNode;
if(newNode == NULL)
{
cout << \"Error allocating memory for new list member!\ \";
return 1;
}
newNode->value = num;
newNode->next = NULL;
if(head == NULL)
{
cout << \"List was empty - \" << newNode->value;
cout << \" is part of list\'s first node.\ \";
head = newNode;
}
else
{
while(nodePtr->next != NULL)
nodePtr = nodePtr->next;
nodePtr->next = newNode;
}
return 0;
}
int LinkedList::insertNode(float num)
{
struct ListNode *newNode, *nodePtr = head, *prevNodePtr = NULL;
newNode = new ListNode;
if(newNode == NULL)
{
cout << \"Error allocating memory for new list member!\ \";
return 1;
}
newNode->value = num;
newNode->next = NULL;
if(head==NULL) {
cout << \"List was empty - \" << newNode->value;
cout << \" is part of list\'s first node.\ \";
head = newNode;
}
else
{
while((nodePtr != NULL) && (nodePtr->value < num)) {
prevNodePtr = nodePtr;
nodePtr = nodePtr->next;
}
if(prevNodePtr==NULL)
newNode->next = head;
else
newNode->next = nodePtr; prevNodePtr->next = newNode;
}
return 0;
}
void LinkedList::deleteNode(float num)
{
struct ListNode *nodePtr = head, *prevNodePtr = NULL;
if(head==NULL) {
cout << \"The list was empty!\ \";
return;
}
if(head->value == num) {
head = nodePtr->next;
delete [] nodePtr;
}
else
{
while((nodePtr!= NULL)&&(nodePtr->value != num)) {
prevNodePtr = nodePtr;
nodePtr = nodePtr->next;
}
if(nodePtr==NULL)
cout << \"The value \" << num << \" is not in this list!\ \";
else {
prevNodePtr->next = nodePtr->next;
delete [] nodePtr;
}
}
}
void LinkedList::destroyList()
{
struct ListNode *nodePtr = head, *nextNode = nodePtr;
if(head==NULL) {
cout << \"The list is empty!\ \";
return;
}
while (nodePtr != NULL) {
nextNode = nodePtr->next;
delete [] nodePtr;
nodePtr = nextNode;
}
}
void LinkedList.
stacks and queues
Stacks and Queues: Introduction to stacks
applications of stacks
implementation and comparison of stack implementations.
Introduction to queues
applications of queues and implementations
Priority Queues and applications
Basic data structures in python
Python is a widely used high-level programming language for general-purpose programming. Python is a simple, powerful and easy to learn the programming language. It is commonly used for Web and Internet development, Scientific and Numeric computing, Business application and Desktop GUI development etc. The basic data structures in python are lists, dictionaries, tuples, strings and sets
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
Assignment is:
\"Page 349-350 #4 and #5 Use the \"Linked List lab\" you have been working on in class and add
the two functions the questions are asking you to develop: divideMid and divideAt. Be sure to
include comments Use meaningful identifier names (constants where appropriate) Turn in .cpp
file AND Turn in a \"print-screen\' of your output (press \"print-screen\' on keyboard, then
\'paste\' in MS-Word)\"
How do you solve QUESTION #4 in the book data structures using c++ by D.S. Malik in Visiual
Studios using the linked list below with what is being asked? Please need help
Linked list :
#include
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *first, *last;
int num;
createList(first, last);
int choice;
while(true)
{
cout<<\"1. Insert Front.\ 2. Insert Last.\ 3. Delete Front.\ 4. Delete Last.\ 5. Print List.\ 6. Exit.\
\";
cout<<\"Enter your choice: \";
cin>>choice;
switch(choice)
{
case 1: insertFront(first); break;
case 2: insertBack(last); break;
case 3: deleteFirst(first); break;
case 4: deleteLast(last, first); break;
case 5: printList(first); break;
case 6: return 0;
default: cout<<\"Invalid menu option. Try again.\"<>number;
while (number != -999)
{
newNode = new nodeType; // create new node
newNode->info = number;
newNode->link = NULL;
if (first == NULL)
{
first = newNode;
last = newNode;
}
else
{
last->link = newNode;
last = newNode;
}
cout<<\"Enter an integer (-999 to stop): \";
cin>>number;
} // end of while-loop
} // end of build list function
void deleteFirst(nodeType*& first)
{
nodeType *temp;
temp= first;
first= temp->link;
delete temp;
return;
}
void deleteLast(nodeType*& last, nodeType* current)
{
nodeType *temp;
while(current->link != NULL)
{
temp=current;
current=current->link;
}
temp=last;
current->link=NULL;
delete temp;
last = current;
return;
}
void insertFront(nodeType*& front)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= front;
front= newNode;
return;
}
void insertBack(nodeType*& last)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= NULL;
last->link= newNode;
last = newNode;
return;
}
void printList(nodeType*& first)
{
cout<<\"Inside printList...printing linked list...\ \"<info << \" \";
current = current->link;
}
cout<
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *firs.
Lecture 6: linked list
This slide is part of course designed for placement preparation for students of IIT Guwahati.
coding in C- Create a function called reverseList that takes the head.docx
coding in C;
Create a function called reverseList that takes the head of a linked list, reverses the order of all the nodes. For example, if the list contained 1, 2, 3, 4 in its nodes, the list will now contain 4, 3, 2, 1.
please add a main test.
Solution
Please find the required program below:
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node* next;
};
void push(struct node** head, int new_element)
{
struct node* new_node =
(struct node*) malloc(sizeof(struct node));
new_node->data = new_element;
new_node->next = (*head);
(*head) = new_node;
}
void printList(struct node *head)
{
struct node *temp = head;
while(temp != NULL)
{
printf(\"%d \", temp->data);
temp = temp->next;
}
}
void reverseList(struct node** head)
{
struct node* prev = NULL;
struct node* current = *head;
struct node* next;
while (current != NULL)
{
next = current->next;
current->next = prev;
prev = current;
current = next;
}
*head = prev;
}
int main()
{
struct node* head = NULL;
push(&head, 12);
push(&head, 14);
push(&head, 5);
push(&head, 8);
printf(\"\ Linked list Before Reversing :\ \");
printList(head);
reverseList(&head);
printf(\"\ Linked list After Reversing :\ \");
printList(head);
}
--------------------------------------------------------------------------------
OUTPUT:
Linked list Before Reversing :
8Â Â 5Â Â 14Â Â 12
Linked list After Reversing :
12Â Â 14Â Â 5Â Â 8
.
in Java (ignore the last line thats hidden) Create a doubly linked l.pdf
in Java (ignore the last line thats hidden) Create a doubly linked list whose nodes contain Strings.
Your list should include the following methods: Insert a node in the list in alphabetical order
Find a node that matches a String Traverse the list forwards and print Traverse the list backwards
and print Delete a node from the list Delete/destroy the list In addition to creating the class(es)
for your linked list, you\'ll need to create a main method that thoroughly tests each function you
build to show that it works. You should do these things in
Solution
/ Java program to create , insert , traverse and delete a node from doubly linked list
class LinkedList {
static Node head = null;
class Node {
int data;
Node next, prev;
Node(int d) {
data = d;
next = prev = null;
}
}
/* Let us create the doubly linked list 10<->8<->4<->2 */
list.push(head, 2);
list.push(head, 4);
list.push(head, 8);
list.push(head, 10);
System.out.println(\"Original Linked list \");
list.printList(head);
/*Function to delete a node in a Doubly Linked List.
head_ref --> pointer to head node pointer.
del --> pointer to node to be deleted. */
void deleteNode(Node head_ref, Node del) {
/* base case */
if (head == null || del == null) {
return;
}
/* If node to be deleted is head node */
if (head == del) {
head = del.next;
}
/* Change next only if node to be deleted is NOT the last node */
if (del.next != null) {
del.next.prev = del.prev;
}
/* Change prev only if node to be deleted is NOT the first node */
if (del.prev != null) {
del.prev.next = del.next;
}
/* Finally, free the memory occupied by del*/
return;
}
/* UTILITY FUNCTIONS */
/* Function to insert a node at the beginning of the Doubly Linked List */
void push(Node head_ref, int new_data) {
/* allocate node */
Node new_node = new Node(new_data);
/* since we are adding at the begining,
prev is always NULL */
new_node.prev = null;
/* link the old list off the new node */
new_node.next = (head);
/* change prev of head node to new node */
if ((head) != null) {
(head).prev = new_node;
}
/* move the head to point to the new node */
(head) = new_node;
}
/*Function to print nodes in a given doubly linked list
This function is same as printList() of singly linked lsit */
void printList(Node node) {
while (node != null) {
System.out.print(node.data + \" \");
node = node.next;
}
}
public static void main(String[] args) {
LinkedList list = new LinkedList();
/* delete nodes from the doubly linked list */
list.deleteNode(head, head); /*delete first node*/
list.deleteNode(head, head.next); /*delete middle node*/
list.deleteNode(head, head.next); /*delete last node*/
System.out.println(\"\");
/* Modified linked list will be NULL<-8->NULL */
System.out.println(\"Modified Linked List\");
list.printList(head);
}
}.
Assignment is Page 349-350 #4 and #5 Use the Linked Lis.pdf
Assignment is :
\"Page 349-350 #4 and #5 Use the \"Linked List lab\" you have been working on in class and add
the two functions the questions are asking you to develop: divideMid and divideAt. Be sure to
include comments Use meaningful identifier names (constants where appropriate) Do not work
together; no two people should have identical work!?!? Turn in .cpp file AND Turn in a \"print-
screen\' of your output (press \"print-screen\' on keyboard, then \'paste\' in MS-Word)\"
How do you solve QUESTION #5 in the book data structures using c++ by D.S. Malik in Visiual
Studios using the linked list below with what is being asked? Please need help
Linked list :
#include
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *first, *last;
int num;
createList(first, last);
int choice;
while(true)
{
cout<<\"1. Insert Front.\ 2. Insert Last.\ 3. Delete Front.\ 4. Delete Last.\ 5. Print List.\ 6. Exit.\
\";
cout<<\"Enter your choice: \";
cin>>choice;
switch(choice)
{
case 1: insertFront(first); break;
case 2: insertBack(last); break;
case 3: deleteFirst(first); break;
case 4: deleteLast(last, first); break;
case 5: printList(first); break;
case 6: return 0;
default: cout<<\"Invalid menu option. Try again.\"<>number;
while (number != -999)
{
newNode = new nodeType; // create new node
newNode->info = number;
newNode->link = NULL;
if (first == NULL)
{
first = newNode;
last = newNode;
}
else
{
last->link = newNode;
last = newNode;
}
cout<<\"Enter an integer (-999 to stop): \";
cin>>number;
} // end of while-loop
} // end of build list function
void deleteFirst(nodeType*& first)
{
nodeType *temp;
temp= first;
first= temp->link;
delete temp;
return;
}
void deleteLast(nodeType*& last, nodeType* current)
{
nodeType *temp;
while(current->link != NULL)
{
temp=current;
current=current->link;
}
temp=last;
current->link=NULL;
delete temp;
last = current;
return;
}
void insertFront(nodeType*& front)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= front;
front= newNode;
return;
}
void insertBack(nodeType*& last)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= NULL;
last->link= newNode;
last = newNode;
return;
}
void printList(nodeType*& first)
{
cout<<\"Inside printList...printing linked list...\ \"<info << \" \";
current = current->link;
}
cout<
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void dele.
The Ring programming language version 1.6 book - Part 24 of 189
The Ring programming language version 1.6 book - Part 24 of 189
Implement a singly linked list as a functional data structure in Kot.pdf
Implement a singly linked list as a functional data structure in Kotlin. As discussed in
the class, the list should be a sealed class with enclosed classes to construct a list,
including construction of an empty list. The following methods should be available for a
singly linked list:
1. modifyListHead() method to replace the head of the list with a different element. This
function accepts an input list and an input variable, and returns a list where the head of
the input list has been replaced with the input variable. For example, calling
modifyListHead(exList, 10) where exList = (1,2,3,4,5) would return (10,2,3,4,5).
2. dropFromList() method to drop the first n elements from the list. This function accepts
an input list and a value for n, and returns a list with the first n elements dropped. For
example, calling dropFromList(exList,1) where exList = (1,2,3,4,5) would return (2,3,4,5).
3. sumTwoLists() method that accepts two lists and adds corresponding elements of each
list. This function accepts two input lists and returns their sum as illustrated in the
example below. For two input lists (1,2,3) and (4,5,6), this function returns (5,7,9)
4. multiplyTwoLists() method that accepts two lists and multiplies corresponding elements
in the same way sumTwoLists() adds elements of two arrays.
NB:
Solution
that I earlier got showed some errors when tried to run it. I am also sharing the solution below:
sealed class SinglyLinkedList {
object Empty : SinglyLinkedList()
data class Cons(val head: T, val tail: SinglyLinkedList) :
SinglyLinkedList()
}
fun modifyListHead(list: SinglyLinkedList, newHead: T): SinglyLinkedList =
when (list) {
is SinglyLinkedList.Empty -> SinglyLinkedList.Empty
is SinglyLinkedList.Cons -> SinglyLinkedList.Cons(newHead, list.tail)
}
fun dropFromList(list: SinglyLinkedList, n: Int): SinglyLinkedList =
when (list) {
is SinglyLinkedList.Empty -> SinglyLinkedList.Empty
is SinglyLinkedList.Cons -> if (n == 0) list else dropFromList(list.tail, n - 1)
}
fun sumTwoLists(list1: SinglyLinkedList, list2: SinglyLinkedList): SinglyLinkedList =
when {
list1 is SinglyLinkedList.Empty && list2 is SinglyLinkedList.Empty ->
SinglyLinkedList.Empty
list1 is SinglyLinkedList.Empty -> list2
list2 is SinglyLinkedList.Empty -> list1
else -> SinglyLinkedList.Cons(list1.head + list2.head, sumTwoLists(list1.tail, list2.tail))
}
fun multiplyTwoLists(list1: SinglyLinkedList, list2: SinglyLinkedList): SinglyLinkedList =
when {
list1 is SinglyLinkedList.Empty || list2 is SinglyLinkedList.Empty ->
SinglyLinkedList.Empty
else -> SinglyLinkedList.Cons(list1.head * list2.head, multiplyTwoLists(list1.tail,
list2.tail))
}
fun main(){
val exList = linkedListOf(1, 2, 3, 4, 5)
println(exList)
// Output: 1 2 3 4 5
val modifiedList = exList.modifyListHead(10)
println(modifiedList)
// Output: 10 2 3 4 5
val droppedList = exList.dropFromList(1)
println(droppedList)
// Output: 2 3 4 5
val list1 = linkedListOf(1, 2, 3)
val list2 = linkedListOf(4, 5, 6)
val sumList = list.
The Ring programming language version 1.10 book - Part 30 of 212
The Ring programming language version 1.10 book - Part 30 of 212
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.
Hi, I need help with a java programming project. specifically practi.pdf
Given 8 distinct integers from the set {1, 2, . . . , 16}, prove that there exists k such that ai aj = k
has at least 3 distinct solutions (ai , aj ) ?
Solution
For any k (unless the K is zero), at least 3 distinct solutions need not be existing.
Let\'s look at the next most favourable case
If k= 2;
We have to consider the case where the number of solutions of ai-aj=2 are minimum since we
have to show that at least 3 distinct solutions exist (which means even in the most unfavourable
case for a chosen k there will be 3 distinct solutions satisfying the equation ai-aj=2)
If k = 2; we start by taking numbers that are not at all 2 units apart from each other;
So we start with 1 and move 3 units successively ahead
1, 4, 7, 10,13, 16; Now we notice that these 6 numbers are of 3k+1 form; remaining numbers
can be any 2 ranomdly selected say 2 and 11; we get 4-2 = 2 and 13-11=2; Hence only 2 distinct
solutions are possible..
Find the sum of the infinite geometric series if it exists. (If an .pdf
Find the general solution to the following differential equation. d^2y/dx^2 - 2 dy/dx - 35 y = 1 +
13sin x - e^3x.
Solution
Ans-
A differential equation is a mathematical equation that relates some function with its derivatives.
In applications, the functions usually represent physical quantities, the derivatives represent their
rates of change, and the equation defines a relationship between the two. Because such relations
are extremely common, differential equations play a prominent role in many disciplines
including engineering, physics, economics, and biology.
In pure mathematics, differential equations are studied from several different perspectives,
mostly concerned with their solutions—the set of functions that satisfy the equation. Only the
simplest differential equations are solvable by explicit formulas; however, some properties of
solutions of a given differential equation may be determined without finding their exact form.
If a self-contained formula for the solution is not available, the solution may be numerically
approximated using computers. The theory of dynamical systems puts emphasis on qualitative
analysis of systems described by differential equations, while manynumerical methods have been
developed to determine solutions with a given degree of accuracy..
More Related Content
Similar to Programming in Coday we are working with singly linked lists. Las.pdf
template ltclass Tgt struct nodeType T data n.pdf
template <class T>
struct nodeType
{
T data;
nodeType *next;
};
template <class T>
class LinkedList {
nodeType<T> *head, *tail;
int count;
public:
LinkedList();
void insertFirst(T item);
void insertLast(T item);
void insertAt(T item, int pos);
void print();
bool simplecompare(LinkedList<T> &rL)
{
if (count != rL.count)
return false;
nodeType<T> *cur, *rCur;
for (cur = head, rCur = rL.head; cur != NULL; cur = cur->next, rCur = rCur->next)
if (cur->data != rCur->data)
return false;
return true;
}
int compare(LinkedList<T> &rL);
~LinkedList();
};
//driver program:
int main(void)
{
char item;
LinkedList<char> list1, list2;
cout << "Please enter the first list of characters"
<< "nPress Ctrl+Z to stop entering." << endl;
cin >> item;
while (!cin.eof()) {
list1.insertLast(item);
cin >> item;
}
cin.clear();
cout << "Please enter the second list of characters"
<< "nPress Ctrl+Z to stop entering." << endl;
cin >> item;
while (!cin.eof()) {
list2.insertLast(item);
cin >> item;
}
list1.print();
list2.print();
int result = list1.compare(list2);
if (result == 0)
cout << "The lists are same!n";
else if (result == -1)
cout << "first list < second listn" << endl;
else cout << "first list > second listn" << endl;
return 0;
}
1 Questions A simplified doublyLinkedList class is provided in lab03doublyLinkedList_template.h
file on CATS. Solve the following questions by using that elass. 1. The definition of insertFirst(T
item) function is missing. Complete it. 2. The definition of insertLast(T item) function is missing.
Complete it. 3. The definition of insertAt(T item, int order) function is missing. Complete it. 4.
Update print() function to print the list in forward direction. 5. The definition of deleteItem(T item)
function is missing. Complete it. 6. Add an extractMax(T max) function to the doublyLinkedList
class. The function must extract all nodes containing elements less than max from the list, and
construct a new list using those nodes. After the function call, the original list must only have the
nodes whose data fields are greater than max, while the new list is containing the smaller ones.
The new list must be returned by the function. You're not allowed to delete and/or create new
nodes. Your function must just move the subjected nodes from one list to the other. Let the
following list be the original list: If the function is called as newList = myList.extractMax (30), then
the newList becomes: 2 Assignment Implement a class to represent a circular linked list. You can
directly adapt SinglyLinkedList class that we've already defined in linkedList.h. Only the following
member functions will be defined for the class: - default constructor to set the pointer data
members to NULL and count to 0 . - insertItem to insert a given item to the list. - deleteItem to
remove a specific item from the list. Item may occur multiple times, thus the function must remove
every occurrences of the item from the list. 1 - print to print the linked list from head to tail. .
QUESTION If you look at the code, youll see that we keep two list.pdf
QUESTION: If you look at the code, you\'ll see that we keep two lists, one to print the text in
forward order, and one to print the text in reverse order. The forward one is using our empty
add() function, so nothing gets put into it. You\'ll fix that, as well as modifiying insert() and
erase(). The reverse on works by inserting always at the head of the list, like a Stack.Functions
insert(), erase(), and add() must be modified so that if the last node of the list changes, List::last
must change, as well. YOU JUST HAVE TO COMPLETE THE LIST.CPP FILE SO THAT IT
PRINTS THE OUTPUT IN THE FORWARD ORDER.FINISH THE CODE ONLY IN
LIST.CPP FILE AND OTHER FILES ARE JUST FOR REFERENCE. MORE
INFORMATION AND HINTS ARE GIVEN IN THE COMMENTS IN LIST.CPP FILE.
HINT: AFTER the existing code runs, there\'s an easy way to know if you just changed the last
node in the list; if you did, it\'s time to update the \"last\" pointer. And remember that \'add\'-ing
the first item is a special case. We could make a Linked List behave a lot like a Queue if it were
really efficient to add a node at the end of the list, that is, without having to chase links from the
head to the tail. So we will add another pointer to our List class that will always point at the last
item in the list. Read the existing code carefully and understand how it works. The \"add\"
function is now empty. If you run the file you should get an output that starts out like this:
?CURRENT LIST.CPP:
CURRENT OUTPUT:
MAIN.CPP FILE:
LIST.H FILE: include list include
Solution
PROGRAM CODE:
/*
* List.cpp
*
* Created on: 29-Nov-2016
* Author: kasturi
*/
#include \"List.h\"
#include
#include
#include
using namespace std;
void List::insert(ElemetType item, int position)
{
Node * predptr = first;
for(int i=1; i< position && predptr && predptr->next; i++)
{
predptr = predptr->next;
}
Node * newptr = new Node;
newptr->payload = item;
if(!predptr)
{
newptr->next = 0;
first = newptr;
}
else if(position == 0)
{
newptr->next = first;
first = newptr;
}
else
{
newptr->next = predptr->next;
predptr->next = newptr;
}
}
void List::erase(int position)
{
Node * predptr = first;
for(int i=1; inext; i++)
{
predptr = predptr->next;
}
if(!predptr)
{
}
else if(position == 1)
{
first = predptr->next;
delete predptr;
}
else
{
Node *ptr = predptr->next;
predptr->next = ptr->next;
delete ptr;
}
}
void List::display(ostream& ostr)
{
Node * ptr = last; //changed the display function to print the first
while(ptr)
{
ostr<payload<next;
}
}
List::List()
{
first = 0;
last = 0;
}
List::~List()
{
while(first)
{
Node *nxt = first->next;
delete first;
first = nxt;
}
}
void List::add(ElemetType item)
{
//added code to add values into the last node
Node * predptr = last;
Node *newptr = new Node;
newptr->payload= item;
while( predptr && predptr->next)
{
predptr = predptr->next;
}
if(!predptr)
{
newptr->next = 0;
last = newptr;
}
else
{
newptr->next = predptr->next;
predptr->next = newptr;
}
}
OUTPUT:
Forward:
The
quick
brown
fox
jumped
over
the
back.
I need to fill-in TODOs in .cpp file and in .h file Could some.pdf
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.
in C++ , Design a linked list class named IntegerList to hold a seri.pdf
in C++ , Design a linked list class named IntegerList to hold a series of integers. The class must
have public member functions for appending , inserting, deleting and displaying nodes. The
append function must append a node to the end of the list. The insert function must insert node in
ascending order. The delete function must delete the node with the given value. The display
function should display the list from head to tail. The IntegerList class should also have a
destructor that destroys the list and release memory. The list node must be declared as a structure
using keyword struct. This structure is a private member of IntegerList. You should also store the
head of the list as a private member.
Write a test program to test the implementation your IntegerList class works properly.
Solution
Here is the code for the above scenario:
#include
using namespace std;
struct ListNode
{
float value;
ListNode *next;
};
ListNode *head;
class LinkedList
{
public:
int insertNode(float num);
int appendNode(float num);
void deleteNode(float num);
void destroyList();
void displayList();
LinkedList(void) {head = NULL;}
~LinkedList(void) {destroyList();}
};
int LinkedList::appendNode(float num)
{
ListNode *newNode, *nodePtr = head;
newNode = new ListNode;
if(newNode == NULL)
{
cout << \"Error allocating memory for new list member!\ \";
return 1;
}
newNode->value = num;
newNode->next = NULL;
if(head == NULL)
{
cout << \"List was empty - \" << newNode->value;
cout << \" is part of list\'s first node.\ \";
head = newNode;
}
else
{
while(nodePtr->next != NULL)
nodePtr = nodePtr->next;
nodePtr->next = newNode;
}
return 0;
}
int LinkedList::insertNode(float num)
{
struct ListNode *newNode, *nodePtr = head, *prevNodePtr = NULL;
newNode = new ListNode;
if(newNode == NULL)
{
cout << \"Error allocating memory for new list member!\ \";
return 1;
}
newNode->value = num;
newNode->next = NULL;
if(head==NULL) {
cout << \"List was empty - \" << newNode->value;
cout << \" is part of list\'s first node.\ \";
head = newNode;
}
else
{
while((nodePtr != NULL) && (nodePtr->value < num)) {
prevNodePtr = nodePtr;
nodePtr = nodePtr->next;
}
if(prevNodePtr==NULL)
newNode->next = head;
else
newNode->next = nodePtr; prevNodePtr->next = newNode;
}
return 0;
}
void LinkedList::deleteNode(float num)
{
struct ListNode *nodePtr = head, *prevNodePtr = NULL;
if(head==NULL) {
cout << \"The list was empty!\ \";
return;
}
if(head->value == num) {
head = nodePtr->next;
delete [] nodePtr;
}
else
{
while((nodePtr!= NULL)&&(nodePtr->value != num)) {
prevNodePtr = nodePtr;
nodePtr = nodePtr->next;
}
if(nodePtr==NULL)
cout << \"The value \" << num << \" is not in this list!\ \";
else {
prevNodePtr->next = nodePtr->next;
delete [] nodePtr;
}
}
}
void LinkedList::destroyList()
{
struct ListNode *nodePtr = head, *nextNode = nodePtr;
if(head==NULL) {
cout << \"The list is empty!\ \";
return;
}
while (nodePtr != NULL) {
nextNode = nodePtr->next;
delete [] nodePtr;
nodePtr = nextNode;
}
}
void LinkedList.
stacks and queues
Stacks and Queues: Introduction to stacks
applications of stacks
implementation and comparison of stack implementations.
Introduction to queues
applications of queues and implementations
Priority Queues and applications
Basic data structures in python
Python is a widely used high-level programming language for general-purpose programming. Python is a simple, powerful and easy to learn the programming language. It is commonly used for Web and Internet development, Scientific and Numeric computing, Business application and Desktop GUI development etc. The basic data structures in python are lists, dictionaries, tuples, strings and sets
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
Assignment is:
\"Page 349-350 #4 and #5 Use the \"Linked List lab\" you have been working on in class and add
the two functions the questions are asking you to develop: divideMid and divideAt. Be sure to
include comments Use meaningful identifier names (constants where appropriate) Turn in .cpp
file AND Turn in a \"print-screen\' of your output (press \"print-screen\' on keyboard, then
\'paste\' in MS-Word)\"
How do you solve QUESTION #4 in the book data structures using c++ by D.S. Malik in Visiual
Studios using the linked list below with what is being asked? Please need help
Linked list :
#include
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *first, *last;
int num;
createList(first, last);
int choice;
while(true)
{
cout<<\"1. Insert Front.\ 2. Insert Last.\ 3. Delete Front.\ 4. Delete Last.\ 5. Print List.\ 6. Exit.\
\";
cout<<\"Enter your choice: \";
cin>>choice;
switch(choice)
{
case 1: insertFront(first); break;
case 2: insertBack(last); break;
case 3: deleteFirst(first); break;
case 4: deleteLast(last, first); break;
case 5: printList(first); break;
case 6: return 0;
default: cout<<\"Invalid menu option. Try again.\"<>number;
while (number != -999)
{
newNode = new nodeType; // create new node
newNode->info = number;
newNode->link = NULL;
if (first == NULL)
{
first = newNode;
last = newNode;
}
else
{
last->link = newNode;
last = newNode;
}
cout<<\"Enter an integer (-999 to stop): \";
cin>>number;
} // end of while-loop
} // end of build list function
void deleteFirst(nodeType*& first)
{
nodeType *temp;
temp= first;
first= temp->link;
delete temp;
return;
}
void deleteLast(nodeType*& last, nodeType* current)
{
nodeType *temp;
while(current->link != NULL)
{
temp=current;
current=current->link;
}
temp=last;
current->link=NULL;
delete temp;
last = current;
return;
}
void insertFront(nodeType*& front)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= front;
front= newNode;
return;
}
void insertBack(nodeType*& last)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= NULL;
last->link= newNode;
last = newNode;
return;
}
void printList(nodeType*& first)
{
cout<<\"Inside printList...printing linked list...\ \"<info << \" \";
current = current->link;
}
cout<
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *firs.
Lecture 6: linked list
This slide is part of course designed for placement preparation for students of IIT Guwahati.
coding in C- Create a function called reverseList that takes the head.docx
coding in C;
Create a function called reverseList that takes the head of a linked list, reverses the order of all the nodes. For example, if the list contained 1, 2, 3, 4 in its nodes, the list will now contain 4, 3, 2, 1.
please add a main test.
Solution
Please find the required program below:
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node* next;
};
void push(struct node** head, int new_element)
{
struct node* new_node =
(struct node*) malloc(sizeof(struct node));
new_node->data = new_element;
new_node->next = (*head);
(*head) = new_node;
}
void printList(struct node *head)
{
struct node *temp = head;
while(temp != NULL)
{
printf(\"%d \", temp->data);
temp = temp->next;
}
}
void reverseList(struct node** head)
{
struct node* prev = NULL;
struct node* current = *head;
struct node* next;
while (current != NULL)
{
next = current->next;
current->next = prev;
prev = current;
current = next;
}
*head = prev;
}
int main()
{
struct node* head = NULL;
push(&head, 12);
push(&head, 14);
push(&head, 5);
push(&head, 8);
printf(\"\ Linked list Before Reversing :\ \");
printList(head);
reverseList(&head);
printf(\"\ Linked list After Reversing :\ \");
printList(head);
}
--------------------------------------------------------------------------------
OUTPUT:
Linked list Before Reversing :
8Â Â 5Â Â 14Â Â 12
Linked list After Reversing :
12Â Â 14Â Â 5Â Â 8
.
in Java (ignore the last line thats hidden) Create a doubly linked l.pdf
in Java (ignore the last line thats hidden) Create a doubly linked list whose nodes contain Strings.
Your list should include the following methods: Insert a node in the list in alphabetical order
Find a node that matches a String Traverse the list forwards and print Traverse the list backwards
and print Delete a node from the list Delete/destroy the list In addition to creating the class(es)
for your linked list, you\'ll need to create a main method that thoroughly tests each function you
build to show that it works. You should do these things in
Solution
/ Java program to create , insert , traverse and delete a node from doubly linked list
class LinkedList {
static Node head = null;
class Node {
int data;
Node next, prev;
Node(int d) {
data = d;
next = prev = null;
}
}
/* Let us create the doubly linked list 10<->8<->4<->2 */
list.push(head, 2);
list.push(head, 4);
list.push(head, 8);
list.push(head, 10);
System.out.println(\"Original Linked list \");
list.printList(head);
/*Function to delete a node in a Doubly Linked List.
head_ref --> pointer to head node pointer.
del --> pointer to node to be deleted. */
void deleteNode(Node head_ref, Node del) {
/* base case */
if (head == null || del == null) {
return;
}
/* If node to be deleted is head node */
if (head == del) {
head = del.next;
}
/* Change next only if node to be deleted is NOT the last node */
if (del.next != null) {
del.next.prev = del.prev;
}
/* Change prev only if node to be deleted is NOT the first node */
if (del.prev != null) {
del.prev.next = del.next;
}
/* Finally, free the memory occupied by del*/
return;
}
/* UTILITY FUNCTIONS */
/* Function to insert a node at the beginning of the Doubly Linked List */
void push(Node head_ref, int new_data) {
/* allocate node */
Node new_node = new Node(new_data);
/* since we are adding at the begining,
prev is always NULL */
new_node.prev = null;
/* link the old list off the new node */
new_node.next = (head);
/* change prev of head node to new node */
if ((head) != null) {
(head).prev = new_node;
}
/* move the head to point to the new node */
(head) = new_node;
}
/*Function to print nodes in a given doubly linked list
This function is same as printList() of singly linked lsit */
void printList(Node node) {
while (node != null) {
System.out.print(node.data + \" \");
node = node.next;
}
}
public static void main(String[] args) {
LinkedList list = new LinkedList();
/* delete nodes from the doubly linked list */
list.deleteNode(head, head); /*delete first node*/
list.deleteNode(head, head.next); /*delete middle node*/
list.deleteNode(head, head.next); /*delete last node*/
System.out.println(\"\");
/* Modified linked list will be NULL<-8->NULL */
System.out.println(\"Modified Linked List\");
list.printList(head);
}
}.
Assignment is Page 349-350 #4 and #5 Use the Linked Lis.pdf
Assignment is :
\"Page 349-350 #4 and #5 Use the \"Linked List lab\" you have been working on in class and add
the two functions the questions are asking you to develop: divideMid and divideAt. Be sure to
include comments Use meaningful identifier names (constants where appropriate) Do not work
together; no two people should have identical work!?!? Turn in .cpp file AND Turn in a \"print-
screen\' of your output (press \"print-screen\' on keyboard, then \'paste\' in MS-Word)\"
How do you solve QUESTION #5 in the book data structures using c++ by D.S. Malik in Visiual
Studios using the linked list below with what is being asked? Please need help
Linked list :
#include
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *first, *last;
int num;
createList(first, last);
int choice;
while(true)
{
cout<<\"1. Insert Front.\ 2. Insert Last.\ 3. Delete Front.\ 4. Delete Last.\ 5. Print List.\ 6. Exit.\
\";
cout<<\"Enter your choice: \";
cin>>choice;
switch(choice)
{
case 1: insertFront(first); break;
case 2: insertBack(last); break;
case 3: deleteFirst(first); break;
case 4: deleteLast(last, first); break;
case 5: printList(first); break;
case 6: return 0;
default: cout<<\"Invalid menu option. Try again.\"<>number;
while (number != -999)
{
newNode = new nodeType; // create new node
newNode->info = number;
newNode->link = NULL;
if (first == NULL)
{
first = newNode;
last = newNode;
}
else
{
last->link = newNode;
last = newNode;
}
cout<<\"Enter an integer (-999 to stop): \";
cin>>number;
} // end of while-loop
} // end of build list function
void deleteFirst(nodeType*& first)
{
nodeType *temp;
temp= first;
first= temp->link;
delete temp;
return;
}
void deleteLast(nodeType*& last, nodeType* current)
{
nodeType *temp;
while(current->link != NULL)
{
temp=current;
current=current->link;
}
temp=last;
current->link=NULL;
delete temp;
last = current;
return;
}
void insertFront(nodeType*& front)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= front;
front= newNode;
return;
}
void insertBack(nodeType*& last)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= NULL;
last->link= newNode;
last = newNode;
return;
}
void printList(nodeType*& first)
{
cout<<\"Inside printList...printing linked list...\ \"<info << \" \";
current = current->link;
}
cout<
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void dele.
The Ring programming language version 1.6 book - Part 24 of 189
The Ring programming language version 1.6 book - Part 24 of 189
Implement a singly linked list as a functional data structure in Kot.pdf
Implement a singly linked list as a functional data structure in Kotlin. As discussed in
the class, the list should be a sealed class with enclosed classes to construct a list,
including construction of an empty list. The following methods should be available for a
singly linked list:
1. modifyListHead() method to replace the head of the list with a different element. This
function accepts an input list and an input variable, and returns a list where the head of
the input list has been replaced with the input variable. For example, calling
modifyListHead(exList, 10) where exList = (1,2,3,4,5) would return (10,2,3,4,5).
2. dropFromList() method to drop the first n elements from the list. This function accepts
an input list and a value for n, and returns a list with the first n elements dropped. For
example, calling dropFromList(exList,1) where exList = (1,2,3,4,5) would return (2,3,4,5).
3. sumTwoLists() method that accepts two lists and adds corresponding elements of each
list. This function accepts two input lists and returns their sum as illustrated in the
example below. For two input lists (1,2,3) and (4,5,6), this function returns (5,7,9)
4. multiplyTwoLists() method that accepts two lists and multiplies corresponding elements
in the same way sumTwoLists() adds elements of two arrays.
NB:
Solution
that I earlier got showed some errors when tried to run it. I am also sharing the solution below:
sealed class SinglyLinkedList {
object Empty : SinglyLinkedList()
data class Cons(val head: T, val tail: SinglyLinkedList) :
SinglyLinkedList()
}
fun modifyListHead(list: SinglyLinkedList, newHead: T): SinglyLinkedList =
when (list) {
is SinglyLinkedList.Empty -> SinglyLinkedList.Empty
is SinglyLinkedList.Cons -> SinglyLinkedList.Cons(newHead, list.tail)
}
fun dropFromList(list: SinglyLinkedList, n: Int): SinglyLinkedList =
when (list) {
is SinglyLinkedList.Empty -> SinglyLinkedList.Empty
is SinglyLinkedList.Cons -> if (n == 0) list else dropFromList(list.tail, n - 1)
}
fun sumTwoLists(list1: SinglyLinkedList, list2: SinglyLinkedList): SinglyLinkedList =
when {
list1 is SinglyLinkedList.Empty && list2 is SinglyLinkedList.Empty ->
SinglyLinkedList.Empty
list1 is SinglyLinkedList.Empty -> list2
list2 is SinglyLinkedList.Empty -> list1
else -> SinglyLinkedList.Cons(list1.head + list2.head, sumTwoLists(list1.tail, list2.tail))
}
fun multiplyTwoLists(list1: SinglyLinkedList, list2: SinglyLinkedList): SinglyLinkedList =
when {
list1 is SinglyLinkedList.Empty || list2 is SinglyLinkedList.Empty ->
SinglyLinkedList.Empty
else -> SinglyLinkedList.Cons(list1.head * list2.head, multiplyTwoLists(list1.tail,
list2.tail))
}
fun main(){
val exList = linkedListOf(1, 2, 3, 4, 5)
println(exList)
// Output: 1 2 3 4 5
val modifiedList = exList.modifyListHead(10)
println(modifiedList)
// Output: 10 2 3 4 5
val droppedList = exList.dropFromList(1)
println(droppedList)
// Output: 2 3 4 5
val list1 = linkedListOf(1, 2, 3)
val list2 = linkedListOf(4, 5, 6)
val sumList = list.
The Ring programming language version 1.10 book - Part 30 of 212
The Ring programming language version 1.10 book - Part 30 of 212
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 Programming in Coday we are working with singly linked lists. Las.pdf (20)
QUESTION If you look at the code, youll see that we keep two list.pdf
QUESTION If you look at the code, youll see that we keep two list.pdf
I need to fill-in TODOs in .cpp file and in .h file Could some.pdf
I need to fill-in TODOs in .cpp file and in .h file Could some.pdf
in C++ , Design a linked list class named IntegerList to hold a seri.pdf
in C++ , Design a linked list class named IntegerList to hold a seri.pdf
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
coding in C- Create a function called reverseList that takes the head.docx
coding in C- Create a function called reverseList that takes the head.docx
in Java (ignore the last line thats hidden) Create a doubly linked l.pdf
in Java (ignore the last line thats hidden) Create a doubly linked l.pdf
Assignment is Page 349-350 #4 and #5 Use the Linked Lis.pdf
Assignment is Page 349-350 #4 and #5 Use the Linked Lis.pdf
The Ring programming language version 1.6 book - Part 24 of 189
The Ring programming language version 1.6 book - Part 24 of 189
Implement a singly linked list as a functional data structure in Kot.pdf
Implement a singly linked list as a functional data structure in Kot.pdf
The Ring programming language version 1.10 book - Part 30 of 212
The Ring programming language version 1.10 book - Part 30 of 212
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 PRATIKSINHA7304
Hi, I need help with a java programming project. specifically practi.pdf
Given 8 distinct integers from the set {1, 2, . . . , 16}, prove that there exists k such that ai aj = k
has at least 3 distinct solutions (ai , aj ) ?
Solution
For any k (unless the K is zero), at least 3 distinct solutions need not be existing.
Let\'s look at the next most favourable case
If k= 2;
We have to consider the case where the number of solutions of ai-aj=2 are minimum since we
have to show that at least 3 distinct solutions exist (which means even in the most unfavourable
case for a chosen k there will be 3 distinct solutions satisfying the equation ai-aj=2)
If k = 2; we start by taking numbers that are not at all 2 units apart from each other;
So we start with 1 and move 3 units successively ahead
1, 4, 7, 10,13, 16; Now we notice that these 6 numbers are of 3k+1 form; remaining numbers
can be any 2 ranomdly selected say 2 and 11; we get 4-2 = 2 and 13-11=2; Hence only 2 distinct
solutions are possible..
Find the sum of the infinite geometric series if it exists. (If an .pdf
Find the general solution to the following differential equation. d^2y/dx^2 - 2 dy/dx - 35 y = 1 +
13sin x - e^3x.
Solution
Ans-
A differential equation is a mathematical equation that relates some function with its derivatives.
In applications, the functions usually represent physical quantities, the derivatives represent their
rates of change, and the equation defines a relationship between the two. Because such relations
are extremely common, differential equations play a prominent role in many disciplines
including engineering, physics, economics, and biology.
In pure mathematics, differential equations are studied from several different perspectives,
mostly concerned with their solutions—the set of functions that satisfy the equation. Only the
simplest differential equations are solvable by explicit formulas; however, some properties of
solutions of a given differential equation may be determined without finding their exact form.
If a self-contained formula for the solution is not available, the solution may be numerically
approximated using computers. The theory of dynamical systems puts emphasis on qualitative
analysis of systems described by differential equations, while manynumerical methods have been
developed to determine solutions with a given degree of accuracy..
A new class will be added to the startup package to start up the eve.pdf
A new class will be added to the startup package to start up the event-driven application. This
should be a small class to create the main window (JFrame) and make it visible. The other new
classes are to be placed in a new package called ‘gui’.
When the project first starts, a window should appear and give the user six options. Five of the
options will be buttons to press, while the sixth will be a prompt and a text field. Each of these
options will be discussed.
The first button will be one to initiate the task of adding a flight to the system. When it is
pressed, a new window should appear. In this window, there should be prompts and fields for the
entry of the flight’s number, width and capacity. Provide a Submit button that will cause the data
to be collected from the fields and passed to the command to add the flight. If the command fails,
the error message should appear in the window, and the window remains visible for the user to
correct the information. If the command is successful, the window should disappear, so that the
user is returned to the main menu.
The second button is for the addition of a new passenger. Its affect will be very similar to the add
flight button: a new window will appear for the entry of the data for the new passenger. This
time, instead of a Submit button, the command to add a passenger should be created and
executed whenever the user presses the Enter key in either one of the fields. If the addition of a
passenger fails, the error message should appear in the window for the user to correct the data. If
the addition was successful, the window to add a passenger should remain visible (with the fields
blank) for the user to enter another passenger. The user can close the window via the X in the
upper right corner, or you can supply a close button (the close button is optional).
The third and fourth buttons are to display the all passengers in the system, and to display all the
flights in the system. In both cases, when the button is pressed, a new window should appear
with the information. It should have a 2-D field to display the information, and scroll bars should
be provided in case there is too much information for the field. This can be done by
and put myPane into a suitable JPanel, or directly into a JFrame. The preferred size of the scroll
pane may want to be set to a suitable size if it is placed in a JPanel. If a scroll pane is directly
added into a JFrame, it will take on the size of the available window. Don’t worry about
formatting the text in a fancy way.
The fifth button is to terminate the project. The project can also be terminated by the X in the
right hand corner of the main window. However, selecting the X in another window should just
close that window (the default action for that (built in) button).
The sixth option in the main window are a prompt and a text field to handle an existing flight.
When the user enters a number in the field (presumably the number of a flight) and presses the
En.
Are these statements regarding Rhizobacteria true Plant Growth P.pdf
Are these statements regarding Rhizobacteria true ?:
Plant Growth Promoting Rhizobacteria, known as PGPRs, are bacteria that colonize the roots of
plants through the formation of nodules. They are beneficial to the plant because they fix
Nitrogen, and stimulate the plant to grow.
There are many kinds of bacteria found in the root nodules of plants, but not all have the ability
to stimulate the formation of nodules or promote growth. In order to find out what kinds of
bacteria were found in the nodule of the Adzuki bean plant, we obtained an Adzuki bean plant
grown in soil from Temescal canyon, and isolated bacteria from the nodule.
Anything incorrect about what is said above?
Solution
Symbiosis: It is an ecological relationship between two different species organisms that live
together in direct intimate contact.
Ex: Legumes
Nitrogen fixation Formula: Bacteria reduce N2 (nitrogen) to NH3 (ammonia).
Legume Species: Legumes are the plants that forms a relationship with rhizbacteria (N fixing
bacteria). Ex: Beans, peanuts, etc...
Rhizobacteria:
The statements above give in the question is True.
Explanation:
It is a soil bacteria lives closely to the plant roots in the soil. It capable to form nodules and
inside the nodules rhizobacteria are present.
Rhizosphere activites:
It is Biological N2 fixation bacteria and also known as a PGPRs(Plant Growth Promoting
Rhizobacteria). PGPR\'s are the bacteria that colonize the roots of plants through the formation
of nodules. They are beneficial to the plant because they fix Nitrogen, and stimulate the plant to
grow.
This bacteria increasing plant nutrient availability of P, Mn, Fe, Z, Cu and controlling deleterious
microorganisms. It improves soil aggregation.
Adzuki bean plant:
The statements above give in the question is True.
Explanation:
Adzuki bean, Vigna angularis (Willd.) is an important legume crop, It is widely used as a diet
due to its highest protein and low fat content. In developing countries Europe and America it is
used highly. it is valued for its high protein
adzuki bean did not increase yield with inorganic N fertilization, indicating the priority of
symbiotic nitrogen fixation (SNF). In this plant symbiosis (N2 fixation) is taken placed with
some bacterial strains of the genera Bradyrhizobium, Rhizobium and Sinorhizobium. The native
rhizobial strains are generally poor efficient in N fixation in this plant..
1. Prices may be different between two countries whenA. Both count.pdf
1. Prices may be different between two countries when
A. Both countries have the same endowment but different preferences
B Both countries have the same preferences but different endowments
C There are differences in endowment and preference
D (a) or (b) may be true
E All of the above
Solution
Ans is E
As prices are determined by demand and supply where demand comes from preferences and
supply comes from endowment. Thus both prefernce and endowment determines price. And thus
difference in any one factor leads to different pricing in the market..
[10 points]Add the.pdf
Write an algebraic expression that is equivalent to sin (tan^-1 x/2). 2/Squarerootx ^2+4
x/Squarerootx ^2+4 Squareroot x^2+4/x Squareroot x^2+4/x
Solution
sin ( tan^-1 x / 2 )
let
( tan^-1 x / 2 ) = y
tan y = x/2
perpendicular = x
base = 2
hypotenuse = sqrt ( x^2 + 2^2 ) = sqrt ( x^2 + 4 )
sin y = x / sqrt ( x^2 + 4)
or
sin ( tan^-1 x / 2 ) = x / sqrt ( x^2 + 4)
option b is correct.
§ 7.3 7.6 Which member of the following pairs is likely to decompose .pdf
Write the converse, inverse, and contrapositive of the statement.
If you clean your room, then you can play outside.
Solution
Coverse statement : \"If you can play outside then you clean your room.\"
Contrapositive statement : \" If you can not clean your room, then you can not play outside.\"
Inverse statement : \" If you can not play outside, then you can not clean your room.\".
You are requested to write the SQL commands to perform the following.pdf
Write a function Noodles(), with int parameter minutes, and void return type. Print \"N minutes\"
for each minute in decreasing order, where N is the number of minutes, followed by
\"Done\".End with a newline. The number of minutes is generated from a random number
generator that selects between 1-3 minutes. The seed for the random number generator is input
by the user.
Example output for minutes = 2:
Solution
#include
#include
using namespace std;
void Noodles(int);
int main() {
int minutes = 0;
int seed;
cout<<\"enter random seed\"<<\"\ \";
cin >> seed; // reading seed
srand(seed);
minutes=rand()%3; // random number generation
cout<.
write a prgoram that displays four images or objects in a 2 x 2 grid.pdf
Which of the three types of activities reported on the statement of cash flows is the MOST
critical for a company\'s long-tetm OA. operating activities O B. investing activities O C.
financing activities O D. noncash investing and financing activities
Solution
A. Operating activities
This are the functions of business related to the provision of its offering. It is an activity that
directly affects an orgainzation\'s cash inflows and outflows, and determine its net income..
Wiater Company operates a small manufacturing facility. On January 1,.pdf
Which mechanism does not repair double strand breaks? recombination photolyase followed by
photoreactivation synthesis-dependent strand annealing (SDSA) non-homologous end joining
The fluctuation test, regarding the origin of mutations, shows that: Mutations occur randomly,
prior to selective pressure The mutation rate fluctuates greatly from organism to organism The
mutation rate fluctuates greatly from cell to cell The mutation rate is fairly even across
organisms The P element in Drosophila: is active in all cells during embryogenesis is a
functional transposon carrying the transposase gene is active when crossing a P female with any
male is a functional retrotransposon carrying the reverse transcriptase gene During bacterial
conjugation, the F element: is transferred as a double stranded molecule is transferred as a single
stranded molecule. 3\' end first enters the donor is transferred as a single stranded molecule. 5\'
end first enters the donor is transferred as a single stranded molecule, the leading end is random
Which of the following could result in a frameshift mutation? deletion of one nucleotide deletion
of three nucleotides deletion of six nucleotides incorporation of a base analog
Solution
1Repair of double strand DNA break is a very serious problem if not solved it may cause
mutation. So there is several repair mechanisms are present. in the above question all
mechanisms can repair DNA break.
recombination repair is of two types homologous recombination and NHEJ ( non homologous
end joining). in NHEJ no homologous template is used and break ends are linked directly.
photolyase is a enzyme activated by light it repairs the mutagenic effect caused by UV light.
such as formation of THYMINE dimer.
SDSA or synthesis dependent strand annealing is a repair mechanism seen in yeast. in this
process repair is initiated by resection of a double strand break to provide 3\' single stranded
DNA..
Which of the three types of activities reported on the statement of c.pdf
What led to the demise of ‘conventional Keynesian wisdom’ in the mid 1970s and why did the
theory of rational expectations make the ‘monetarist experiment’ in the early 1980s more
attractive to politicians?
Solution
theory has its origins in the study of business cycles and monetary theory.[1][2] In general, early
theorists believed monetary factors could not affect real factors such as real output. John
Maynard Keynes attacked some of these \"classical\" theories and produced a general theory that
described the whole economy in terms of aggregates rather than individual, microeconomic
parts. Attempting to explain unemployment and recessions, he noticed the tendency for people
and businesses to hoard cash and avoid investment during a recession. He argued that this
invalidated the assumptions of classical economists who thought that markets always clear,
leaving no surplus of goods and no willing labor left idle.[3]
The generation of economists that followed Keynes synthesized his theory with neoclassical
microeconomics to form the neoclassical synthesis. Although Keynesian theory originally
omitted an explanation of price levels and inflation, later Keynesians adopted the Phillips curve
to model price-level changes. Some Keynesians opposed the synthesis method of combining
Keynes\'s theory with an equilibrium system and advocated disequilibrium models instead.
Monetarists, led by Milton Friedman, adopted some Keynesian ideas, such as the importance of
the demand for money, but argued that Keynesians ignored the role of money supply in
inflation.[4] Robert Lucas and other new classical macroeconomists criticized Keynesian models
that did not work under rational expectations. Lucas also argued that Keynesian empirical
models would not be as stable as models based on microeconomic foundations..
111. Definition Explanation (15) 1. Job speciation SolutionIII.pdf
111. Definition Explanation (15%) 1. Job speciation
Solution
III.
1. Job specification refers to job description which includes the work that needs to be performed,
roles and responsibilities, and the minimum qualification required to perform the job effectively.
Job specification is one of the essential part of job analysis information.
Job analysis helps in determining job requirements and is comprehensive in nature. It focus on
developing the techniques of doing a job and helps in recruitment and selection, appraisal, job
evaluation, job designing, compensation, training and development and to assess the job worth..
What are the pros and cons of using exFAT and ReFS on a Windows 2012.pdf
Using C++,
Write a program segment that dynamically allocates an array large enough to hold a user defined
number of (double) test scores. Once all the scores are entered, the array should be passed to a
function that calculates and returns the average score. Use Pointer notation whenever possible.
double calculateAverage(function parameter goes here) //
int main()
{ int size;
double * ptrScores;
// complete rest of the main function following the directions above
}
double calculateAverage(function parameter goes here)
{
// complete the rest of this function following the directions above
}
Solution
Program:
#include
#include
using namespace std;
double calcAverage(double, int);
void bubbleSort(double scores[], int numScores);
int main()
{
double *scores, // To dynamically allocate an array
total = 0.0, // Accumulator
average; // To hold average scores
int numScores, // To hold the number of days of scores
count; // Counter variable
// Get the number of days of scores.
cout << \"How many days of test scores do you wish \";
cout << \"to process? \ \";
cin >> numScores;
// Dynamically allocate an array large enough to hold
// that many days of scores amounts.
scores = new double[numScores];
// Get the scores figures for each day.
cout << \"Enter the test scores below.\ \";
for (count = 0; count < numScores; count++)
{
cout << \"Day \" << (count + 1) << \": \";
cin >> scores[count];
}
// Calculate the total scores
for (count = 0; count < numScores; count++)
{
total += scores[count];
}
bubbleSort(scores,numScores);
average = calcAverage(total, numScores);
cout << endl;
for (count = 0; count < numScores; count++)
{
cout<<\"Day \"<<(count+1)<<\": \"<< *(scores + count) < array[count + 1])
{
temp = array[count];
array[count] = array[count + 1];
array[count + 1] = temp;
swap = true;
}
}
} while (swap);
}.
What led to the demise of ‘conventional Keynesian wisdom’ in the mid.pdf
What are the pros and cons of using exFAT and ReFS on a Windows 2012 server? How do they
compare to NTFS?
Solution
ReFS:
Pros: 1.unique in private cloud manipulations
2.also in age of big data
3.storage space assits the mirroring and striping.
cons: 1.it is unable to utilize for booting drives.
2.seen only in case of windows server 2012
3.unable to format the removable drives.
Hence due to all the above prons and cons the REFS are used and prefered in widows server
2012 .
...........................................................................................................................................................
...........
NFTS
pros: 1.File compression
2.Advanced auditing
cons: The NFTS are unable to manipulate on REFS disks though several features operate on
REFS like bitlocker..
What is the connection between relative frequency and probability.pdf
Waterways prepared the balance sheet and income statement for the irrigation installation
division for last year. Now the company needs to prepare a cash flow statement for the same
division. The comparative balance sheets for Waterways Corporation’s Irrigation Installation
Division for last year and the prior year and the income statement for last year are presented
below. (Note: Work in Process is a current asset and should be treated as any other current asset.)
Additional information:
1. Waterways sold a piece of company equipment for $30,000. The equipment had been used for
six years. It had cost $100,000 when purchases and had a 10-years life and a $10,000 salvage
value. Straight-line depreciation was used.
2. Waterways purchased new equipment costing $200,000.
3. The division paid $100,000 in dividends.
Waterways Corporation - Installation Division
Income Statement
For the Year Ending December 31, Last Year
Sales
$5,536,077
Less: Cost of goods sold
3,132,777
Gross Profit
2,403,300
Operating expenses:
Advertising
$52,000
Insurance
382,000
Salaries and wages
594,650
Depreciation
72,500
Other operating expenses
30,500
Total operating expenses
1,131,650
Income from operations
1,271,650
Other income
Loss on sale of equip
(16,000)
Other expenses
Interest expense
(12,200)
Net other income and expenses
(28,200)
Income before income tax
1,243,450
Income tax expenses
373,035
Net income
$870,415
Waterways Corporation - Installation Division
Balance Sheet
December 31
Assets
Last Year
Prior Year
Current assets
Cash
$792,306
$746,681
Accounts receivable
680,750
542,685
Work in process
680,450
0
Inventory
16,750
7,500
Prepaid expenses
71,500
42,590
Total current assets
2,241,756
1,339,456
Property, plant, and equipment
Furnishings
40,416
40,416
Equipment
900,200
800,200
Buildings
450,000
450,000
Land
300,000
300,000
Accumulated depreciation
(503,704)
(485,204)
Total property, plant, and
equipment
1,186,912
1,105,412
Total Assets
$3,428,668
$2,444,868
Liabilities and Stockholders\' Equity
Current liabilities
Accounts payable
$156,300
$128,360
Income taxes payable
100,344
79,989
Wages payable
600
1,984
Interest payable
1,200
0
Other current liabilities
14,520
15,246
Revolving bank loan payable
16,000
0
Total current liabilities
288,964
225,579
Long-term liabilities
Notes payable
150,000
0
Total liabilities
438,964
225,579
Stockholders\' equity
Common stock
1,250,000
1,250,000
Retained earnings
1,739,704
969,289
Total stockholders\' equity
2,989,704
2,219,289
Total liabilities and stockholders\' equity
$3,428,668
$2,444,868
Instructions:
For last year:
a. Prepare a statement of cash flow using the indirect method.
b. Determine free cash flow.
Waterways Corporation - Installation Division
Income Statement
For the Year Ending December 31, Last Year
Sales
$5,536,077
Less: Cost of goods sold
3,132,777
Gross Profit
2,403,300
Operating expenses:
Advertising
$52,000
Insurance
382,000
Salaries and wages
594,650
Depreciation
72,500
Other operating expenses
30,50.
What factors led President Truman to support the creation of Israel .pdf
var testScores = [];
testScores[0] = [80, 82, 90, 87, 85];
testScores[1] = [79, 80, 74, 82, 81];
testScores[2] = [93, 95, 89, 100, 85];
testScores[3] = [60, 72, 65, 71, 79];
This code creates a tabular structure that has
5 rows and 4 columns
4 rows and 5 columns
4 rows and 4 columns
5 rows and 5 columnsa.
5 rows and 4 columnsb.
4 rows and 5 columnsc.
4 rows and 4 columnsd.
5 rows and 5 columns
Solution
Here is the given structure:-
var testScores = [];
testScores[0] = [80, 82, 90, 87, 85];
testScores[1] = [79, 80, 74, 82, 81];
testScores[2] = [93, 95, 89, 100, 85];
testScores[3] = [60, 72, 65, 71, 79];
And this will create a tabular structure that has 4 rows and 5 columns.
unixlinux - kernelexplain yield in user spaceexplain yield in k.pdf
this is java. problem.
i already make employee class. but i can not make employeetester class. i want to know
Employeetester class.
EmployeeTester class:
Write a main method that produces a dialog like this:
-->Enter a name : dave
-->Enter hours worked (7 values separated by spaces): 5 2 1 0 0 3 3
Output: dave worked for 5 day(s) for a total of 14.0 hours.
-->Enter a day of the week (0-6): 2
Output: Hours worked on day 2 is 1.0
************and this is my employee class.**********************
public class Employee {
private double[] hours=new double[7];
private String name;
public Employee(String name){
this.name=name;
}
public double getHours(int day){
return hours[day];
}
public void setHours(int day,double hrs){
hours[day]=hrs;
}
public int numDaysWorked(){
int totalD=0;
for(int i=0;i<7;i++){
if(hours[i]==0.0){
}else{
totalD=totalD+1;
}
}
return totalD;
}
public double totalHours(){
double totalH=0;
for(int i=0;i<7;i++){
if(hours[i]==0.0){
}else{
totalH=totalH+hours[i];
}
}
return totalH;
}
public String toString(){
return name+\" Worked \" +numDaysWorked() + \" day(s) for a total of \"+totalHours() +
\"hours\ .\";
}
}
Solution
Note:
I have made some changes to the Employee class which have provided to meet the required
output.Thank You.
________________________
Employee.java
public class Employee {
//Creating an double type array of size 7
private double[] hours=new double[7];
//Declaring variable
private String name;
//Parameterized constructor
public Employee(double[] hours, String name) {
super();
this.hours = hours;
this.name = name;
}
//Setters and getters
public double[] getHours() {
return hours;
}
public void setHours(double[] hours) {
this.hours = hours;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
//This method will calculate the no of days worked by an employee
public int numDaysWorked(){
int totalD=0;
for(int i=0;i<7;i++){
if(hours[i]!=0.0){
totalD=totalD+1;
}
}
return totalD;
}
//This method will return the total no of hours worked by an employee
public double totalHours(){
double totalH=0;
for(int i=0;i<7;i++){
//Calculating the total hours worked
totalH=totalH+hours[i];
}
return totalH;
}
//this method will return the hours worked on particular day of an employee
public double hoursWorkedOnParticularday(int day)
{
return hours[day];
}
//this method will display the contents of an object inside it
public String toString(){
return name+\" Worked \" +numDaysWorked() + \" day(s) for a total of \"+totalHours() + \"
hours\ .\";
}
}
____________________
EmployeeTester.java
import java.util.Scanner;
public class EmployeeTester {
public static void main(String[] args) {
//Declaring variables
String name;
double tot_hours=0;
int no_of_days_worked=0;
int week_day=0;
//Scanner object is used to get the inputs entered by the user
Scanner sc=new Scanner(System.in);
//Creating an double type array of size 7
double hours[]=new double[7];
//getting the name of an employee entered by the us.
this is java. problem.i already make employee class. but i can not.pdf
The price p and the quantity x sold of a certain product obey the demand equation
x =- 8p + 80, 0 p l 10
(a) Express the revenue R as a function of x.
(b) What is the revenue if 24 units are sold?
(c) What quantity x maximizes revenue? What is the maximum revenue?
(d) What price should the company charge to maximize revenue?
Solution
A.
Revenue = Price*quantity
x = -8p + 80, and 0 <= P <= 10
8p = 80 - x
p = -x/8 + 10
R = p*x
R = x*(-x/8 + 10)
R = -x^2/8 + 10x
B.
x = 24
R = -x^2/8 + 10x
R = -24^2/8 + 10*24
R = 168
C.
In this parabolic equation
R = -x^2/8 + 10x
a = -1/8, b = 10
maximize x = -b/2a
x = -10/(2*(-1/8)) = 40
maximum revenue
R = -x^2/8 + 10x
R = -40^2/8 + 10*40 = 200
D.
p = -x/8 + 10
so for x = 40
p = -40/8 + 10 = 5
price = 5.
This fall Millie finally repaid her student loan. She originally bor.pdf
The preprocessor is part of vi checks for correct C++ syntax converts Unicode characters to
ASCII all of the above none of the above Which of the following is true in C++? A literal is an
expression A literal is an lvalue A literal is an rvalue all of the above none of the above
Solution
Answer:
Preprocessor is used in C++ to process the data before the compilation.
2) d) All of the above , Literal is written inside the code and is not been altered by the program ,
it remains as such . It can be any expression , lvalue , rvalue ..
The term refers to a. Global Analysis of the proteins produced in .pdf
The issues of inflation, unemployment, and business cycles are Multiple Choice major topics of
macroeconomics. not relevant to the U.S. economy the primary focus of microeconomics.
Solution
a) Major topics of macroeconomics.
Macroeconomics is that branch of economics which deals in economic relations and economic
problems at the level of economy as a whole. It includes inflation, national income, government
budget, unemployment, business cycle..
More from PRATIKSINHA7304 (20)
Hi, I need help with a java programming project. specifically practi.pdf
Hi, I need help with a java programming project. specifically practi.pdf
Find the sum of the infinite geometric series if it exists. (If an .pdf
Find the sum of the infinite geometric series if it exists. (If an .pdf
A new class will be added to the startup package to start up the eve.pdf
A new class will be added to the startup package to start up the eve.pdf
Are these statements regarding Rhizobacteria true Plant Growth P.pdf
Are these statements regarding Rhizobacteria true Plant Growth P.pdf
1. Prices may be different between two countries whenA. Both count.pdf
1. Prices may be different between two countries whenA. Both count.pdf
§ 7.3 7.6 Which member of the following pairs is likely to decompose .pdf
§ 7.3 7.6 Which member of the following pairs is likely to decompose .pdf
You are requested to write the SQL commands to perform the following.pdf
You are requested to write the SQL commands to perform the following.pdf
write a prgoram that displays four images or objects in a 2 x 2 grid.pdf
write a prgoram that displays four images or objects in a 2 x 2 grid.pdf
Wiater Company operates a small manufacturing facility. On January 1,.pdf
Wiater Company operates a small manufacturing facility. On January 1,.pdf
Which of the three types of activities reported on the statement of c.pdf
Which of the three types of activities reported on the statement of c.pdf
111. Definition Explanation (15) 1. Job speciation SolutionIII.pdf
111. Definition Explanation (15) 1. Job speciation SolutionIII.pdf
What are the pros and cons of using exFAT and ReFS on a Windows 2012.pdf
What are the pros and cons of using exFAT and ReFS on a Windows 2012.pdf
What led to the demise of ‘conventional Keynesian wisdom’ in the mid.pdf
What led to the demise of ‘conventional Keynesian wisdom’ in the mid.pdf
What is the connection between relative frequency and probability.pdf
What is the connection between relative frequency and probability.pdf
What factors led President Truman to support the creation of Israel .pdf
What factors led President Truman to support the creation of Israel .pdf
unixlinux - kernelexplain yield in user spaceexplain yield in k.pdf
unixlinux - kernelexplain yield in user spaceexplain yield in k.pdf
this is java. problem.i already make employee class. but i can not.pdf
this is java. problem.i already make employee class. but i can not.pdf
This fall Millie finally repaid her student loan. She originally bor.pdf
This fall Millie finally repaid her student loan. She originally bor.pdf
The term refers to a. Global Analysis of the proteins produced in .pdf
The term refers to a. Global Analysis of the proteins produced in .pdf
Recently uploaded
Operation Blue Star - Saka Neela Tara
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
How to Create Map Views in the Odoo 17 ERP
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
How to Split Bills in the Odoo 17 POS Module
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
Ethnobotany and Ethnopharmacology ......
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
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.
The Art Pastor's Guide to Sabbath | Steve Thomason
What is the purpose of the Sabbath Law in the Torah. It is interesting to compare how the context of the law shifts from Exodus to Deuteronomy. Who gets to rest, and why?
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
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
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
Class 11 CBSE Business Studies Project ( AIDS TO TRADE - INSURANCE)
Introduction to Quality Improvement Essentials
This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024.
He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.
Model Attribute Check Company Auto Property
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
Template Jadual Bertugas Kelas (Boleh Edit)
Jadual Bertugas kelas dalam bentuk softcopy PowerPoint. Cikgu boleh download >> edit >> print >> laminate. Semoga bermanfaat.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
Recently uploaded (20)
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
The Art Pastor's Guide to Sabbath | Steve Thomason
The Art Pastor's Guide to Sabbath | Steve Thomason
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Programming in Coday we are working with singly linked lists. Las.pdf
- 1. Programming in C: oday we are working with singly linked lists. Last week in class we covered inserting into, deleting from, sorting, and printing a singly linked list. For lab today we want you to create a new function called insertSorted() that is similar to insert() we created last week, but instead of just inserting the new value at the beginning of the list, the function should insert the value into the linked-list so that the values in the list are in sorted order from LARGEST to SMALLEST. The largest value should always be the first item in the list, and the smallest should always be the last item in the list. The function should take two arguments, 1) The reference (pointer) to the beginning of the list and 2) the value to be inserted. The function should return the new reference (pointer) to the list. Here is an example list detailing what the function should do: Let's say we start with a linked list as follows: head --> 100 --> 65 --> 29 --> -5 --> -138 --> if we now want to insert 51, the value would NOT go at the beginning of the list, instead it would go somewhere in the middle and would look like: head --> 100 --> 65 --> 51 --> 29 --> -5 --> - 138 --> We have included the code from class on thursday 11/16, that contains insert( ), deleteFromList( ), sortList( ), and printList( ) so you can use that code as a starting point. Solution #include "stdio.h" #include "stdlib.h" /* linked list structure */ typedef struct node{ int data; struct node *next; }ll; /* insert in sorted order */ ll* insertSorted(ll *head,int d){ // create a temp node ll *temp = (ll *)malloc(sizeof(ll)); // insert data to node temp->data = d; temp->next = NULL;
- 2. // create reference node ll *temp1 = head; // if head is empty make temp as head if(head==NULL){ return temp; } // insert at beginning. if(temp1->data<=d){ temp->next = temp1; return temp; } // insert in middle while(temp1->next!=NULL){ if(temp1->next->datanext = temp1->next; temp1->next = temp; return head; } else{ temp1 = temp1->next; } } // insert at the end. temp1->next = temp; return head; } /*printing the linked list */ void printList(ll *head){ ll *temp = head; while(temp!=NULL){ printf("%d-->",temp->data); temp = temp->next; }
- 3. printf(" "); } int main(void) { // Disable stdout buffering setvbuf(stdout, NULL, _IONBF, 0); ll *head = NULL; head = insertSorted(head,100); head = insertSorted(head,65); head = insertSorted(head,29); head = insertSorted(head,-5); head = insertSorted(head,-138); printList(head); head = insertSorted(head,51); printList(head); return 0; } /* sample output 100-->65-->29-->-5-->-138--> 100-->65-->51-->29-->-5-->-138--> */