–PLS write program in c++ thanxLinked List Sorting and Reversing.pdf
•
0 likes•5 views
–PLS write program in c++ thanx Linked List Sorting and Reversing Write a C++ using your own linked list class to manage a list of string elements. Besides the basic operations expected of a linked list (add an element, remove an element, check for empty list, report size (number) of elements in the list, and print out the content of the list), the linked list class also needs to have a method called sort() and a method called reverse() the manipulate the string elements. The sort method rearranges the elements in the list so they are sorted in alphabetical order. The reverse method reverses the order of the elements of the list. Do NOT use recursion to implement either of these operations. pls write program in c++ thanx Solution #include #include using namespace std; class Node{ //class node public: string data; Node* next; void SetData(string aData) { data = aData; }; void SetNext(Node* aNext) { next = aNext; }; }; class List{ //class list Node *head; public: List() { head = NULL; }; void addElement(string data); void removeElement(string data); int isEmpty(Node* temp); int size(); void print(); void sort(); void reverse(); }; int List::isEmpty(Node* temp){ //method to check whether list is empty or not if(temp!=NULL) return 1; else return 0; } void List::addElement(string data){ //method to add Node* newNode=new Node(); newNode->SetData(data); newNode->SetNext(NULL); Node* temp=head; if(temp!=NULL) { while(temp->next!=NULL) {temp=temp->next;} temp->next=newNode; } else head=newNode; } void List::removeElement(string data){ //method for delete Node* temp=head; Node *prev=head; if(isEmpty(temp)==1) {//prev=temp; while(temp!=NULL) { if(temp->data==data) {prev->next=temp->next; temp->next=NULL; } else {prev=temp; temp=temp->next; } } } else cout<<\"Nothing to delete as linked list is empty \"<next; } } return count; } void List::print(){ //method for print Node* temp=head; if(isEmpty(temp)==1){ while(temp!=NULL) { cout<data<<\" \"; temp=temp->next; } } } int main() { List list; list.addElement(\"anshu\"); list.addElement(\"anurag\"); list.addElement(\"how\"); list.addElement(\"are\"); list.addElement(\"you?\"); int count=list.size(); cout<<\"size of the linked list= \"<.
Report
Share
Report
Share
Download to read offline
Recommended
Data structures & algorithms lecture 3
the introduction to data structures and the concept of algorithm and about stack,linked list and queue of implementation of ADT
Please solve the following problem using C++- Thank you Instructions-.docx
Please solve the following problem using C++. Thank you
Instructions: ----
A LinkNode structure or class which will have two attributes -
a data attribute, and
a pointer attribute to the next node.
The data attribute of the LinkNode should be a reference/pointer of the Currency class of Lab 2.
Do not make it an inner class or member structure to the SinglyLinkedList class of #2 below.
A SinglyLinkedList class which will be composed of three attributes -
a count attribute,
a LinkNode pointer/reference attribute named as and pointing to the start of the list and
a LinkNode pointer/reference attribute named as and pointing to the end of the list.
Since this is a class, make sure all these attributes are private.
The class and attribute names for the node and linked list are the words in bold in #1 and #2.
For the Linked List, implement the following linked-list behaviors as explained in class -
getters/setters/constructors/destructors, as needed, for the attributes of the class.
createList method in addition to the constructor - this is optional for overloading purposes.
destroyList method in place of or in addition to the destructor - this is optional for overloading purposes,
addCurrency method which takes a Currency object and a node index value as parameters to add the Currency to the list at that index.
removeCurrency method which takes a Currency object as parameter and removes that Currency object from the list and may return a copy of the Currency.
removeCurrency overload method which takes a node index as parameter and removes the Currency object at that index and may return a copy of the Currency.
findCurrency method which takes a Currency object as parameter and returns the node index at which the Currency is found in the list.
getCurrency method which takes an index values as a parameter and returns the Currency object.
printList method which returns a string of all the Currency objects in the list in the order of index, tab spaced.
isListEmpty method which returns if a list is empty or not.
countCurrency method which returns a count of Currency nodes in the list.
Any other methods you think would be useful in your program.
A Stack class derived from the SinglyLinkedList but with no additional attributes and the usual stack methods -
constructor and createStack (optional) methods,
push which takes a Currency object as parameter and adds it to the top of the stack.
pop which takes no parameter and removes and returns the Currency object from the top of the stack.
peek which takes no parameter and returns a copy of the Currency object at the top of the stack.
printStack method which returns a string signifying the contents of the stack from the top to bottom, tab spaced.
destructor and/or destroyStack (optional) methods.
Ensure that the Stack objects do not allow Linked List functions to be used on them.
A Queue class derived from the SinglyLinkedList but with no additional attributes and the usual queue methods -
constructor and creat.
Can somebody solve the TODO parts of the following problem- Thanks D.pdf
Can somebody solve the TODO parts of the following problem.
Thanks
Description
This assignment builds on top of the ListNode class designed and tested in Assignment 4 where
constructionand testing of the ListNode class has already been done. Recall that a ListNode
object contains a data field and a pointer to the next ListNode object.
We now encapsulate the functions to create, search and update the database into a LinkedList
class. There are two members in this class. A pointer called front that points to a ListNode object
and an integer count of the total number of objects currently in the list.
As before, we are not going to use pre-fabricated classes from the c++ library, but construct the
LinkedList ADT from scratch.
We can now use this class to create a LinkedList object which contains a collection of ListNodes
each having a Song object in the data field. The api is put through its paces by initially testing it
on a dummy database containing four songs. The main program then repeats the testing process
with the song list in the file SongData.txt and then again with the song list in the file
SongDataDouble.txt.
The number of steps taken to populate the database for both files is recorded.
Instruction
#This assignment requires you to
Read the Assignment 5 Notes
Watch the Assignment 5 Support video
Implement the following methods of the LinkedList class
-custom constructor
-setters for next pointer and data
Implement the insert, remove and get method in the LinkedListcpp.h file
Scan the given template to find the above //TODO and implement the code needed
//Requires: Song for inserting
//Effects: creates a new ListNode with input value and inserts in proper position (increasing order
of chart position)in the chain. If LinkedList, adds to the beginning
//Modifies: front, if node is added at the beginning.
//Also changes the next pointer of the previous node to point to the newly inserted list node. the
next pointer of the newly inserted pointer points to what was the next of the previous node. This
way both previous and current links are adjusted
//TODO
template <class T>
int LinkedList<T>::insert( T value, SortBy<T> f){
int steps=0;
//TODO
return steps;
}
//Requires: Song title for searching
//Effects: traverses the LinkedList (database) starting from front until the end comparing titles
Returns the original search value if found otherwise returns an empty song with blank title
//Modifies: Nothing
//TODO
template <class T>
T LinkedList<T>::get(T value){
ListNode<T> * current = front;//this may need to change
//TODO
return current->getData();
}
//TODO
template <class T>
int LinkedList<T>::remove(T value){
//TODO
int steps=0;
return steps;
}
/ /Requires: index position of Song to be found
//Effects: traverses the LinkedList starting from front and travels to the index position (if valid)
and returns the song at that index position. Note index position may NOT be the same as chart
position
//Modifies: Nothing
//TODO
template <class T>
T Linke.
Recommended
Data structures & algorithms lecture 3
the introduction to data structures and the concept of algorithm and about stack,linked list and queue of implementation of ADT
Please solve the following problem using C++- Thank you Instructions-.docx
Please solve the following problem using C++. Thank you
Instructions: ----
A LinkNode structure or class which will have two attributes -
a data attribute, and
a pointer attribute to the next node.
The data attribute of the LinkNode should be a reference/pointer of the Currency class of Lab 2.
Do not make it an inner class or member structure to the SinglyLinkedList class of #2 below.
A SinglyLinkedList class which will be composed of three attributes -
a count attribute,
a LinkNode pointer/reference attribute named as and pointing to the start of the list and
a LinkNode pointer/reference attribute named as and pointing to the end of the list.
Since this is a class, make sure all these attributes are private.
The class and attribute names for the node and linked list are the words in bold in #1 and #2.
For the Linked List, implement the following linked-list behaviors as explained in class -
getters/setters/constructors/destructors, as needed, for the attributes of the class.
createList method in addition to the constructor - this is optional for overloading purposes.
destroyList method in place of or in addition to the destructor - this is optional for overloading purposes,
addCurrency method which takes a Currency object and a node index value as parameters to add the Currency to the list at that index.
removeCurrency method which takes a Currency object as parameter and removes that Currency object from the list and may return a copy of the Currency.
removeCurrency overload method which takes a node index as parameter and removes the Currency object at that index and may return a copy of the Currency.
findCurrency method which takes a Currency object as parameter and returns the node index at which the Currency is found in the list.
getCurrency method which takes an index values as a parameter and returns the Currency object.
printList method which returns a string of all the Currency objects in the list in the order of index, tab spaced.
isListEmpty method which returns if a list is empty or not.
countCurrency method which returns a count of Currency nodes in the list.
Any other methods you think would be useful in your program.
A Stack class derived from the SinglyLinkedList but with no additional attributes and the usual stack methods -
constructor and createStack (optional) methods,
push which takes a Currency object as parameter and adds it to the top of the stack.
pop which takes no parameter and removes and returns the Currency object from the top of the stack.
peek which takes no parameter and returns a copy of the Currency object at the top of the stack.
printStack method which returns a string signifying the contents of the stack from the top to bottom, tab spaced.
destructor and/or destroyStack (optional) methods.
Ensure that the Stack objects do not allow Linked List functions to be used on them.
A Queue class derived from the SinglyLinkedList but with no additional attributes and the usual queue methods -
constructor and creat.
Can somebody solve the TODO parts of the following problem- Thanks D.pdf
Can somebody solve the TODO parts of the following problem.
Thanks
Description
This assignment builds on top of the ListNode class designed and tested in Assignment 4 where
constructionand testing of the ListNode class has already been done. Recall that a ListNode
object contains a data field and a pointer to the next ListNode object.
We now encapsulate the functions to create, search and update the database into a LinkedList
class. There are two members in this class. A pointer called front that points to a ListNode object
and an integer count of the total number of objects currently in the list.
As before, we are not going to use pre-fabricated classes from the c++ library, but construct the
LinkedList ADT from scratch.
We can now use this class to create a LinkedList object which contains a collection of ListNodes
each having a Song object in the data field. The api is put through its paces by initially testing it
on a dummy database containing four songs. The main program then repeats the testing process
with the song list in the file SongData.txt and then again with the song list in the file
SongDataDouble.txt.
The number of steps taken to populate the database for both files is recorded.
Instruction
#This assignment requires you to
Read the Assignment 5 Notes
Watch the Assignment 5 Support video
Implement the following methods of the LinkedList class
-custom constructor
-setters for next pointer and data
Implement the insert, remove and get method in the LinkedListcpp.h file
Scan the given template to find the above //TODO and implement the code needed
//Requires: Song for inserting
//Effects: creates a new ListNode with input value and inserts in proper position (increasing order
of chart position)in the chain. If LinkedList, adds to the beginning
//Modifies: front, if node is added at the beginning.
//Also changes the next pointer of the previous node to point to the newly inserted list node. the
next pointer of the newly inserted pointer points to what was the next of the previous node. This
way both previous and current links are adjusted
//TODO
template <class T>
int LinkedList<T>::insert( T value, SortBy<T> f){
int steps=0;
//TODO
return steps;
}
//Requires: Song title for searching
//Effects: traverses the LinkedList (database) starting from front until the end comparing titles
Returns the original search value if found otherwise returns an empty song with blank title
//Modifies: Nothing
//TODO
template <class T>
T LinkedList<T>::get(T value){
ListNode<T> * current = front;//this may need to change
//TODO
return current->getData();
}
//TODO
template <class T>
int LinkedList<T>::remove(T value){
//TODO
int steps=0;
return steps;
}
/ /Requires: index position of Song to be found
//Effects: traverses the LinkedList starting from front and travels to the index position (if valid)
and returns the song at that index position. Note index position may NOT be the same as chart
position
//Modifies: Nothing
//TODO
template <class T>
T Linke.
BackgroundIn many applications, the composition of a collection o.pdf
Background:
In many applications, the composition of a collection of data items changes over time. Not only
are new data items added and existing ones removed, but data items may be duplicated. A list
data structure is a member of the general category of abstract data types called containers, whose
purpose is to hold other objects. In C++, lists are provided in the Standard Template Library.
However, for this assignment you will design and write your own linked list implementation to
support the ADT operations specified below.
Objective:
Design and implement the specifications for a List Abstract Data Type where the items in the list
are unsorted.
Requirements:
Define a list and develop a set of operations for creating and manipulating a list that satisfies the
list ADT specification.
List ADT Specification
Structure: The list elements are of ItemType. The list has a property called the current position
which designates the position of the last element accessed by GetNextItem during an iteration
through the list. Only ResetList and GetNextItem alter the current position.
Definitions (provided by the user):
MAX_ITEMS: A constant specifying the maximum capacity of items allowed on the list
Item Type: Class encapsulating the type of items in the list
RelationType: An enumeration type that consists of LESS, GREATER, EQUAL
Member function of ItemType that must be included:
RelationType ComparedTo(ItemType Item)
Function: Determines the ordering of two ItemType objects based on their keys
Precondition: Self and item have their key members initialized
Postcondition:
Function value = LESS if the key of self is less than the key of item
= GREATER if the key of self is greater than the key of item
= EQUAL if the keys are equal
Operations (provided by Unsorted List ADT)
Make Empty
Function: Initializes list to empty state
Preconditions: None
Postcondition: List is empty
Boolean IsFull
Function: Determines whether list is full
Preconditions: List has been initialized
Postcondition: Function value = (list is full)
int GetLength
Function: Determines the number of elements in list
Preconditions: List has been initialized
Postcondition: Function value = number of elements in list
ItemType GetItem(Item Typeitem, Boolean& found)
Function: Get list element whose key matches item’s key (if present)
Preconditions: List has been initialized
Key member of item is initialized
Postcondition: If there is an element someItem whose keymatches item’s key, then found =
true and copy of someItemis returned; otherwise found = false and item is returned
List is unchanged
PutItem(ItemType item)
Function: Puts item into list
Preconditions: List has been initialized
List is not full
Item is not in list
Postcondition: Item is in the list
DeleteItem(ItemType item)
Function: Deletes the element whose key matches item’s key
Preconditions: List has been initialized
Postcondition: One and only one element in list has a key matching item’s key
ResetList
Function: Initializes current p.
hello- please dont just copy from other answers- the following is the.docx
hello. please dont just copy from other answers, the following is the code that is already have and can u modified it for the following instructions.
instructions ----A LinkNode structure or class which will have two attributes -
a data attribute, and
a pointer attribute to the next node.
The data attribute of the LinkNode should be a reference/pointer of the Currency class of Lab 2.
Do not make it an inner class or member structure to the SinglyLinkedList class of #2 below.
A SinglyLinkedList class which will be composed of three attributes -
a count attribute,
a LinkNode pointer/reference attribute named as and pointing to the start of the list and
a LinkNode pointer/reference attribute named as and pointing to the end of the list.
Since this is a class, make sure all these attributes are private.
The class and attribute names for the node and linked list are the words in bold in #1 and #2.
For the Linked List, implement the following linked-list behaviors as explained in class -
getters/setters/constructors/destructors, as needed, for the attributes of the class.
createList method in addition to the constructor - this is optional for overloading purposes.
destroyList method in place of or in addition to the destructor - this is optional for overloading purposes,
addCurrency method which takes a Currency object and a node index value as parameters to add the Currency to the list at that index.
removeCurrency method which takes a Currency object as parameter and removes that Currency object from the list and may return a copy of the Currency.
removeCurrency overload method which takes a node index as parameter and removes the Currency object at that index and may return a copy of the Currency.
findCurrency method which takes a Currency object as parameter and returns the node index at which the Currency is found in the list.
getCurrency method which takes an index values as a parameter and returns the Currency object.
printList method which returns a string of all the Currency objects in the list in the order of index, tab spaced.
isListEmpty method which returns if a list is empty or not.
countCurrency method which returns a count of Currency nodes in the list.
Any other methods you think would be useful in your program.
A Stack class derived from the SinglyLinkedList but with no additional attributes and the usual stack methods -
constructor and createStack (optional) methods,
push which takes a Currency object as parameter and adds it to the top of the stack.
pop which takes no parameter and removes and returns the Currency object from the top of the stack.
peek which takes no parameter and returns a copy of the Currency object at the top of the stack.
printStack method which returns a string signifying the contents of the stack from the top to bottom, tab spaced.
destructor and/or destroyStack (optional) methods.
Ensure that the Stack objects do not allow Linked List functions to be used on them.
A Queue class derived from the SinglyLink.
Week 2 - Data Structures and Algorithms
Linked Lists, Doubly Linked Lists, Circular Linked List
18 January 2019
Data Structures for Data Scientists
#TNIDSA107
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).
Data structures: linear lists
Textbook Solutions refer https://pythonxiisolutions.blogspot.com/
Practical's Solutions refer https://prippython12.blogspot.com/
Contiguous memory locations are occupied to store data in memory, this structure of storing data is Array.
Introduction to Lists
Elementary Data Representation Different data structures, Operations on Data structures.
–PLS write program in c++Recursive Linked List OperationsWrite a.pdf
–PLS write program in c++
Recursive Linked List Operations
Write a C++ to manage a list of string elements. Besides the basic operations expected of a
linked list (add an element, remove an element, check for empty list, report size (number) of
elements in the list, and print out the content of the list), the linked list class also needs to have a
method called sort() and a method called reverse() the manipulate the string elements. The sort
method rearranges the elements in the list so they are sorted in alphabetical order. The reverse
method reverses the order of the elements of the list. The class should use recursion to
implement the sort and reverse operations
Solution
#include
#include
#include
#include
struct node //declaring node
{
int info;
struct node *next;
}*start;
class single_llist //declaring class
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
main()
{
int choice, nodes, position, i;
char str[100];
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (strcmp(ptr->info > s->info))
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
void single_llist::delete_pos() //delete element from given position
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2.
For this homework, you will write a program to create and manipulate.pdf
For this homework, you will write a program to create and manipulate a simple linked list. For
each node in the linked list you will generate a random number, create a node that holds that
number, and insert that node into its sorted position in the linked list. Once the nodes are
inserted, you will traverse the list, printing the value held in each node. Then you will clean up
the list (deleting all the nodes) and exit the program. You will also learn about a tool that you can
use to help you check for memory errors in your code.
Specifications:
Define a struct appropriate for holding a random integer. This struct will also contain a \"next\"
pointer to reference a separate instance of the struct.
You may use the typedef keyword to give your struct a separate typename if you wish, but this is
not a requirement.
The program will read command line arguments. The first argument is the program name (as it
will always be) followed by a random number seed, the number of random numbers to generate
and ending with the Maximum Possible Value of the Random numbers generated (i.e. argc
should be 4).
Your program will use a \"dummy node\" for the linked list. In other words, the head of the list
will be an actual node, but the data field in that node will not be used for sorting purposes.
Your program must contain the following functions:
main() (for obvious reasons)
insertNodeSorted() - You may implement this either of two ways.
One way is to use the head of the list as one parameter and the integer value as the second. The
function will allocate memory for the node, initialize it and then insert it in the proper location in
the list.
The other way is to pass the head of the list as one parameter and a previously allocated and
initialized node as the other. The existing node is inserted in the proper location in the list.
printList() - Takes the head of the list as its only parameter, traverses the list, printing out the
data in sorted order.
deleteList() - Takes the head of the list as its only parameter, traverses the list, deleting all nodes.
The basic algorithm of your program is
Use a loop (based upon command line input values) that:
Generates a random number
Prints the number to stdout
Creates a node that contains that random number
Inserts the new node in sorted order into the existing list
Print the sorted linked list
Delete the linked list
You will use a Makefile to compile your program
Solution
#include
#include
#include
struct test_struct
{
int val;
struct test_struct *next;
};
struct test_struct *head = NULL;
struct test_struct *curr = NULL;
struct test_struct* create_list(int val)
{
printf(\"\ creating list with headnode as [%d]\ \",val);
struct test_struct *ptr = (struct test_struct*)malloc(sizeof(struct test_struct));
if(NULL == ptr)
{
printf(\"\ Node creation failed \ \");
return NULL;
}
ptr->val = val;
ptr->next = NULL;
head = curr = ptr;
return ptr;
}
struct test_struct* add_to_list(int val, bool add_to_end)
{
if(NULL == head)
{
retur.
DATA STRUCTURES USING C -ENGGDIGEST
Blog @Enggdigest
Data Structures using C | Swapnil Mishra
For more visit: https://enggdigest.blogspot.com
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);
.
need it in c++ Task 2 Reuse the Task 1 and create 2 linkedl.pdf
need it in c++
Task 2: Reuse the Task 1 and create 2 linkedlists L1 and L2, with data elements mentioned below.
L1={1,3,5,7}// contains odd numbers L2={2,4,6,8}// contains even numbers Write a function
mergeLists to merge the elements of L2 with L1 in such a way that the resultant list L1 should look
like the one below: L1={1,2,3,4,5,6,7,8} Task 3: In doubly LL, each node of a linked list will have a
data item which will represent the record of an employee. Following Table shows the list of
Employee; Each emp is list contain 5 attributes of Employee. The data items form a linear
structure in which list data items follow one after the other, from the beginning of the list to its end.
The ordering of the data items is determined by when and where each data item is inserted into
the list and is not a function of the data contained in the list data items. At any point in time, one
data item in any nonempty list is marked using the list's cursor. You travel through the list using
operations that change the position of the cursor. Your class must provide implementation for the
following - Constructor to create empty list - Copy Constructor to copy all elements of linked list -
IsEmpty to check if there is no data element in the list. It returns true if a list is empty. Otherwise,
returns false - Insert function to insert employee. If the list is not empty, then inserts emp at the
end - Search function to search employee - Remove function to remove the data item whose
employee id matched the parameter id Foundation for Advancement of science and Technology
National University of Computer & Emerging Sciences (NUCES), School of Computing -
UpdateSalary function which locate the data item whose employee id matches the parameter id,
then update the respective data item salary member with the parameter salary - MaximumSalary
function which searches for the employee having maximum salary - A function to print the data of
linked list.
you will implement some sorting algorithms for arrays and linked lis.pdf
you will implement some sorting algorithms for arrays and linked lists.
Insertion Sort and Quicksort of an array
Implement the insertion sort and quicksort for an integer array. The functions are defined in the
"sorting.h" header file.
/**
* @brief Insertion sort algorithm
* @param array Array to be sorted. The array is modified in place.
* @param lowindex Lowest index of the array
* @param highindex Highest index of the array
* @param reversed If reversed = true, the array should be sorted in descending order, otherwise
in ascending order
*/
void insertionSort(int array[], int lowindex, int highindex, bool reversed = false);
and
**
* @brief Quick sort algorithm
*
* @param array Array to be sorted. The array is modified in place.
* @param lowindex Lowest index of the array
* @param highindex Highest index of the array
* @param reversed If reversed = true, the array should be sorted in descending order, otherwise
in ascending order
*/
void quickSort(int array[], int lowindex, int highindex, bool reversed = false);
The array should be sorted in place. Compared to the examples in the textbook, those functions
have an additional parameter reversed. If reversed = true, the array should be sorted in
descending order, otherwise in ascending order. You should complete the implementations of
those two functions in the "sorting_basic.cpp" file.
A better quicksort algorithm
Quicksort is a very fast comparison sorting algorithm, especially wheb the array or list gets large.
However, when the arrays/lists are small enough, quicksort may run slower than some of the
(n^2) algorithms. This might not seem important until you note that when sorting a large array
with quicksort, many small sublists must be sorted. While the savings on sorting one small list
with a faster algorithm might be negligible, sorting hundreds of small lists with a faster algorithm
can make a difference in the overall efficiency of the sort. For this part of the assignment, you
will combine quicksort with another sorting algorithm to build a faster sorting algorithm. One
option is to
use quicksort until the array/list gets small enough, and then use insertion sort or another sort to
sort the small arrays/lists
What does "small enough" mean? You can try a percentage of the list (say, 5% or 10%), or an
absolute number (5 elements, 8 elements, 10 elements, 15 elements, 100 elements, etc), or
something else of your choosing. Based on your tests, choose the one that is the most efficient.
You should also tests to ensure that your hybrid quicksort has reasonable performance on all lists
-- most notably, it should be efficient on sorted and inverse sorted lists as well as random lists.
The definition of the hybrid quicksort function is as the following:
/**
* @brief A hybrid of insertion sort and quick sort algorithm. The algorithm is based on the idea
that if the array is short, it is better to use insertion sort.
* It uses quicksort until the list gets small enough, and then uses insertion s.
AD3251-LINKED LIST,STACK ADT,QUEUE ADT.docx
Here's a suggestion for a description to upload your document on a website:
"Unlock the power of data structures with our comprehensive guide! Dive into the world of linked lists, Stack ADT (Abstract Data Type), and Queue ADT with our expertly curated document. Whether you're a seasoned programmer or just starting out, our resource provides clear explanations, insightful examples, and practical applications to help you master these fundamental concepts. Explore the intricacies of linked lists for efficient data storage, understand the versatility of Stack ADT for managing data in a Last-In, First-Out (LIFO) fashion, and delve into the functionality of Queue ADT for orderly data processing in a First-In, First-Out (FIFO) manner. Elevate your understanding of data structures and revolutionize your programming skills with our invaluable document. With clear explanations, illustrative examples, and practical exercises, our document equips you with the knowledge and skills needed to conquer data structure challenges with confidence. Whether you're a student embarking on your journey into computer science or a seasoned developer .Seeking to expand your repertoire, our resource is your roadmap to success.
Download our document now and embark on a transformative learning experience that will elevate your programming prowess to new heights!"
Give examples of two zoonotic diseases. Explain how these zoonotic d.pdf
Give examples of two zoonotic diseases. Explain how these zoonotic diseases can be transmitted.
Discuss the impact of malaria on environmental health. Provide one example of the economic
impact this disease has on the developing world.
Describe how vectors play a role in the transmission of disease.
Give an example of an emerging disease and another example of a re-emerging disease.
Solution
Major modern diseases such as
1. Ebola virus disease, 2 .Salmonellosis and 3 influenza .
1.Ebola virus disease, :
It also called Ebola hemorrhagic fever (EHF) or just Ebola, is a viral hemorrhagic fever of
people and different primates brought about by ebolaviruses.
Signs and indications ordinarily begin between two days and three weeks in the wake of getting
the infection with a fever, sore throat, solid torment, and migraines.
At that point, spewing, looseness of the bowels and rash typically take after, with diminished
capacity of the liver and kidneys.
2.salmonellosis
It is a disease caused by the Salmonella microscopic organisms.
The vast majority with salmonellosis create loose bowels, fever, heaving, and stomach issues 12
to 72 hours after disease.
Much of the time, the disease endures four to seven days, and a great many people recuperate
without treatment i
Transmission :Sullied nourishment, frequently having no bizarre look or smell
Poor kitchen cleanliness, particularly hazardous in institutional kitchens and eateries since this
can prompt to a huge flare-up .
Discharges from either wiped out or tainted yet clearly clinically sound individuals
Contaminated surface water and standing water, (for example, in shower hoses or unused water
distributors)
and
3 influenza ..
Create the variables, and methods needed for this classA DicePlay.pdf
Create the variables, and methods needed for this class:
A DicePlayer is a class that represents the player in a Craps game. A DicePlayer is a data class.
The data we need to manage (the fields or class variables) are the players name and how much
money the player has to bet.
Methods are needed to manage this data.
Solution
import java.util.Scanner; // inporting required packages
class DicePlayer
{
private String name; // creating requried variables
private double cash;
Scanner sc=new Scanner(System.in); // scanner variable to take i/p\'s
public void setName()
{
System.out.println(\"Enter the name of the player\ \");
name=sc.next(); // taking player name
}
public void setCash ()
{
System.out.println(\"Give the amount on the hand\ \");
cash=sc.nextDouble(); // taking cash
}
public String getName()
{
return name; // getting name when needed
}
public double getCash()
{
return cash; // getting cash when needed
}
public boolean addCash()
{
double add;
System.out.println(\"Give the amount to add\ \");
add=sc.nextInt();
if (add>0) // checking the taken value is non-negative
{
cash=cash+add; // if yes add it to cash
return true;
}
else
return false; // else retrun false
}
public boolean subCash()
{
double sub;
System.out.println(\"Give the amount to sub\ \");
sub=sc.nextInt();
if (sub>0 && sub.
More Related Content
Similar to –PLS write program in c++ thanxLinked List Sorting and Reversing.pdf
BackgroundIn many applications, the composition of a collection o.pdf
Background:
In many applications, the composition of a collection of data items changes over time. Not only
are new data items added and existing ones removed, but data items may be duplicated. A list
data structure is a member of the general category of abstract data types called containers, whose
purpose is to hold other objects. In C++, lists are provided in the Standard Template Library.
However, for this assignment you will design and write your own linked list implementation to
support the ADT operations specified below.
Objective:
Design and implement the specifications for a List Abstract Data Type where the items in the list
are unsorted.
Requirements:
Define a list and develop a set of operations for creating and manipulating a list that satisfies the
list ADT specification.
List ADT Specification
Structure: The list elements are of ItemType. The list has a property called the current position
which designates the position of the last element accessed by GetNextItem during an iteration
through the list. Only ResetList and GetNextItem alter the current position.
Definitions (provided by the user):
MAX_ITEMS: A constant specifying the maximum capacity of items allowed on the list
Item Type: Class encapsulating the type of items in the list
RelationType: An enumeration type that consists of LESS, GREATER, EQUAL
Member function of ItemType that must be included:
RelationType ComparedTo(ItemType Item)
Function: Determines the ordering of two ItemType objects based on their keys
Precondition: Self and item have their key members initialized
Postcondition:
Function value = LESS if the key of self is less than the key of item
= GREATER if the key of self is greater than the key of item
= EQUAL if the keys are equal
Operations (provided by Unsorted List ADT)
Make Empty
Function: Initializes list to empty state
Preconditions: None
Postcondition: List is empty
Boolean IsFull
Function: Determines whether list is full
Preconditions: List has been initialized
Postcondition: Function value = (list is full)
int GetLength
Function: Determines the number of elements in list
Preconditions: List has been initialized
Postcondition: Function value = number of elements in list
ItemType GetItem(Item Typeitem, Boolean& found)
Function: Get list element whose key matches item’s key (if present)
Preconditions: List has been initialized
Key member of item is initialized
Postcondition: If there is an element someItem whose keymatches item’s key, then found =
true and copy of someItemis returned; otherwise found = false and item is returned
List is unchanged
PutItem(ItemType item)
Function: Puts item into list
Preconditions: List has been initialized
List is not full
Item is not in list
Postcondition: Item is in the list
DeleteItem(ItemType item)
Function: Deletes the element whose key matches item’s key
Preconditions: List has been initialized
Postcondition: One and only one element in list has a key matching item’s key
ResetList
Function: Initializes current p.
hello- please dont just copy from other answers- the following is the.docx
hello. please dont just copy from other answers, the following is the code that is already have and can u modified it for the following instructions.
instructions ----A LinkNode structure or class which will have two attributes -
a data attribute, and
a pointer attribute to the next node.
The data attribute of the LinkNode should be a reference/pointer of the Currency class of Lab 2.
Do not make it an inner class or member structure to the SinglyLinkedList class of #2 below.
A SinglyLinkedList class which will be composed of three attributes -
a count attribute,
a LinkNode pointer/reference attribute named as and pointing to the start of the list and
a LinkNode pointer/reference attribute named as and pointing to the end of the list.
Since this is a class, make sure all these attributes are private.
The class and attribute names for the node and linked list are the words in bold in #1 and #2.
For the Linked List, implement the following linked-list behaviors as explained in class -
getters/setters/constructors/destructors, as needed, for the attributes of the class.
createList method in addition to the constructor - this is optional for overloading purposes.
destroyList method in place of or in addition to the destructor - this is optional for overloading purposes,
addCurrency method which takes a Currency object and a node index value as parameters to add the Currency to the list at that index.
removeCurrency method which takes a Currency object as parameter and removes that Currency object from the list and may return a copy of the Currency.
removeCurrency overload method which takes a node index as parameter and removes the Currency object at that index and may return a copy of the Currency.
findCurrency method which takes a Currency object as parameter and returns the node index at which the Currency is found in the list.
getCurrency method which takes an index values as a parameter and returns the Currency object.
printList method which returns a string of all the Currency objects in the list in the order of index, tab spaced.
isListEmpty method which returns if a list is empty or not.
countCurrency method which returns a count of Currency nodes in the list.
Any other methods you think would be useful in your program.
A Stack class derived from the SinglyLinkedList but with no additional attributes and the usual stack methods -
constructor and createStack (optional) methods,
push which takes a Currency object as parameter and adds it to the top of the stack.
pop which takes no parameter and removes and returns the Currency object from the top of the stack.
peek which takes no parameter and returns a copy of the Currency object at the top of the stack.
printStack method which returns a string signifying the contents of the stack from the top to bottom, tab spaced.
destructor and/or destroyStack (optional) methods.
Ensure that the Stack objects do not allow Linked List functions to be used on them.
A Queue class derived from the SinglyLink.
Week 2 - Data Structures and Algorithms
Linked Lists, Doubly Linked Lists, Circular Linked List
18 January 2019
Data Structures for Data Scientists
#TNIDSA107
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).
Data structures: linear lists
Textbook Solutions refer https://pythonxiisolutions.blogspot.com/
Practical's Solutions refer https://prippython12.blogspot.com/
Contiguous memory locations are occupied to store data in memory, this structure of storing data is Array.
Introduction to Lists
Elementary Data Representation Different data structures, Operations on Data structures.
–PLS write program in c++Recursive Linked List OperationsWrite a.pdf
–PLS write program in c++
Recursive Linked List Operations
Write a C++ to manage a list of string elements. Besides the basic operations expected of a
linked list (add an element, remove an element, check for empty list, report size (number) of
elements in the list, and print out the content of the list), the linked list class also needs to have a
method called sort() and a method called reverse() the manipulate the string elements. The sort
method rearranges the elements in the list so they are sorted in alphabetical order. The reverse
method reverses the order of the elements of the list. The class should use recursion to
implement the sort and reverse operations
Solution
#include
#include
#include
#include
struct node //declaring node
{
int info;
struct node *next;
}*start;
class single_llist //declaring class
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
main()
{
int choice, nodes, position, i;
char str[100];
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (strcmp(ptr->info > s->info))
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
void single_llist::delete_pos() //delete element from given position
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2.
For this homework, you will write a program to create and manipulate.pdf
For this homework, you will write a program to create and manipulate a simple linked list. For
each node in the linked list you will generate a random number, create a node that holds that
number, and insert that node into its sorted position in the linked list. Once the nodes are
inserted, you will traverse the list, printing the value held in each node. Then you will clean up
the list (deleting all the nodes) and exit the program. You will also learn about a tool that you can
use to help you check for memory errors in your code.
Specifications:
Define a struct appropriate for holding a random integer. This struct will also contain a \"next\"
pointer to reference a separate instance of the struct.
You may use the typedef keyword to give your struct a separate typename if you wish, but this is
not a requirement.
The program will read command line arguments. The first argument is the program name (as it
will always be) followed by a random number seed, the number of random numbers to generate
and ending with the Maximum Possible Value of the Random numbers generated (i.e. argc
should be 4).
Your program will use a \"dummy node\" for the linked list. In other words, the head of the list
will be an actual node, but the data field in that node will not be used for sorting purposes.
Your program must contain the following functions:
main() (for obvious reasons)
insertNodeSorted() - You may implement this either of two ways.
One way is to use the head of the list as one parameter and the integer value as the second. The
function will allocate memory for the node, initialize it and then insert it in the proper location in
the list.
The other way is to pass the head of the list as one parameter and a previously allocated and
initialized node as the other. The existing node is inserted in the proper location in the list.
printList() - Takes the head of the list as its only parameter, traverses the list, printing out the
data in sorted order.
deleteList() - Takes the head of the list as its only parameter, traverses the list, deleting all nodes.
The basic algorithm of your program is
Use a loop (based upon command line input values) that:
Generates a random number
Prints the number to stdout
Creates a node that contains that random number
Inserts the new node in sorted order into the existing list
Print the sorted linked list
Delete the linked list
You will use a Makefile to compile your program
Solution
#include
#include
#include
struct test_struct
{
int val;
struct test_struct *next;
};
struct test_struct *head = NULL;
struct test_struct *curr = NULL;
struct test_struct* create_list(int val)
{
printf(\"\ creating list with headnode as [%d]\ \",val);
struct test_struct *ptr = (struct test_struct*)malloc(sizeof(struct test_struct));
if(NULL == ptr)
{
printf(\"\ Node creation failed \ \");
return NULL;
}
ptr->val = val;
ptr->next = NULL;
head = curr = ptr;
return ptr;
}
struct test_struct* add_to_list(int val, bool add_to_end)
{
if(NULL == head)
{
retur.
DATA STRUCTURES USING C -ENGGDIGEST
Blog @Enggdigest
Data Structures using C | Swapnil Mishra
For more visit: https://enggdigest.blogspot.com
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);
.
need it in c++ Task 2 Reuse the Task 1 and create 2 linkedl.pdf
need it in c++
Task 2: Reuse the Task 1 and create 2 linkedlists L1 and L2, with data elements mentioned below.
L1={1,3,5,7}// contains odd numbers L2={2,4,6,8}// contains even numbers Write a function
mergeLists to merge the elements of L2 with L1 in such a way that the resultant list L1 should look
like the one below: L1={1,2,3,4,5,6,7,8} Task 3: In doubly LL, each node of a linked list will have a
data item which will represent the record of an employee. Following Table shows the list of
Employee; Each emp is list contain 5 attributes of Employee. The data items form a linear
structure in which list data items follow one after the other, from the beginning of the list to its end.
The ordering of the data items is determined by when and where each data item is inserted into
the list and is not a function of the data contained in the list data items. At any point in time, one
data item in any nonempty list is marked using the list's cursor. You travel through the list using
operations that change the position of the cursor. Your class must provide implementation for the
following - Constructor to create empty list - Copy Constructor to copy all elements of linked list -
IsEmpty to check if there is no data element in the list. It returns true if a list is empty. Otherwise,
returns false - Insert function to insert employee. If the list is not empty, then inserts emp at the
end - Search function to search employee - Remove function to remove the data item whose
employee id matched the parameter id Foundation for Advancement of science and Technology
National University of Computer & Emerging Sciences (NUCES), School of Computing -
UpdateSalary function which locate the data item whose employee id matches the parameter id,
then update the respective data item salary member with the parameter salary - MaximumSalary
function which searches for the employee having maximum salary - A function to print the data of
linked list.
you will implement some sorting algorithms for arrays and linked lis.pdf
you will implement some sorting algorithms for arrays and linked lists.
Insertion Sort and Quicksort of an array
Implement the insertion sort and quicksort for an integer array. The functions are defined in the
"sorting.h" header file.
/**
* @brief Insertion sort algorithm
* @param array Array to be sorted. The array is modified in place.
* @param lowindex Lowest index of the array
* @param highindex Highest index of the array
* @param reversed If reversed = true, the array should be sorted in descending order, otherwise
in ascending order
*/
void insertionSort(int array[], int lowindex, int highindex, bool reversed = false);
and
**
* @brief Quick sort algorithm
*
* @param array Array to be sorted. The array is modified in place.
* @param lowindex Lowest index of the array
* @param highindex Highest index of the array
* @param reversed If reversed = true, the array should be sorted in descending order, otherwise
in ascending order
*/
void quickSort(int array[], int lowindex, int highindex, bool reversed = false);
The array should be sorted in place. Compared to the examples in the textbook, those functions
have an additional parameter reversed. If reversed = true, the array should be sorted in
descending order, otherwise in ascending order. You should complete the implementations of
those two functions in the "sorting_basic.cpp" file.
A better quicksort algorithm
Quicksort is a very fast comparison sorting algorithm, especially wheb the array or list gets large.
However, when the arrays/lists are small enough, quicksort may run slower than some of the
(n^2) algorithms. This might not seem important until you note that when sorting a large array
with quicksort, many small sublists must be sorted. While the savings on sorting one small list
with a faster algorithm might be negligible, sorting hundreds of small lists with a faster algorithm
can make a difference in the overall efficiency of the sort. For this part of the assignment, you
will combine quicksort with another sorting algorithm to build a faster sorting algorithm. One
option is to
use quicksort until the array/list gets small enough, and then use insertion sort or another sort to
sort the small arrays/lists
What does "small enough" mean? You can try a percentage of the list (say, 5% or 10%), or an
absolute number (5 elements, 8 elements, 10 elements, 15 elements, 100 elements, etc), or
something else of your choosing. Based on your tests, choose the one that is the most efficient.
You should also tests to ensure that your hybrid quicksort has reasonable performance on all lists
-- most notably, it should be efficient on sorted and inverse sorted lists as well as random lists.
The definition of the hybrid quicksort function is as the following:
/**
* @brief A hybrid of insertion sort and quick sort algorithm. The algorithm is based on the idea
that if the array is short, it is better to use insertion sort.
* It uses quicksort until the list gets small enough, and then uses insertion s.
AD3251-LINKED LIST,STACK ADT,QUEUE ADT.docx
Here's a suggestion for a description to upload your document on a website:
"Unlock the power of data structures with our comprehensive guide! Dive into the world of linked lists, Stack ADT (Abstract Data Type), and Queue ADT with our expertly curated document. Whether you're a seasoned programmer or just starting out, our resource provides clear explanations, insightful examples, and practical applications to help you master these fundamental concepts. Explore the intricacies of linked lists for efficient data storage, understand the versatility of Stack ADT for managing data in a Last-In, First-Out (LIFO) fashion, and delve into the functionality of Queue ADT for orderly data processing in a First-In, First-Out (FIFO) manner. Elevate your understanding of data structures and revolutionize your programming skills with our invaluable document. With clear explanations, illustrative examples, and practical exercises, our document equips you with the knowledge and skills needed to conquer data structure challenges with confidence. Whether you're a student embarking on your journey into computer science or a seasoned developer .Seeking to expand your repertoire, our resource is your roadmap to success.
Download our document now and embark on a transformative learning experience that will elevate your programming prowess to new heights!"
Similar to –PLS write program in c++ thanxLinked List Sorting and Reversing.pdf (20)
BackgroundIn many applications, the composition of a collection o.pdf
BackgroundIn many applications, the composition of a collection o.pdf
hello- please dont just copy from other answers- the following is the.docx
hello- please dont just copy from other answers- the following is the.docx
Need to be done in C++ Please Sorted number list implementation wit.pdf
Need to be done in C++ Please Sorted number list implementation wit.pdf
–PLS write program in c++Recursive Linked List OperationsWrite a.pdf
–PLS write program in c++Recursive Linked List OperationsWrite a.pdf
For this homework, you will write a program to create and manipulate.pdf
For this homework, you will write a program to create and manipulate.pdf
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.pdf
need it in c++ Task 2 Reuse the Task 1 and create 2 linkedl.pdf
need it in c++ Task 2 Reuse the Task 1 and create 2 linkedl.pdf
you will implement some sorting algorithms for arrays and linked lis.pdf
you will implement some sorting algorithms for arrays and linked lis.pdf
More from poblettesedanoree498
Give examples of two zoonotic diseases. Explain how these zoonotic d.pdf
Give examples of two zoonotic diseases. Explain how these zoonotic diseases can be transmitted.
Discuss the impact of malaria on environmental health. Provide one example of the economic
impact this disease has on the developing world.
Describe how vectors play a role in the transmission of disease.
Give an example of an emerging disease and another example of a re-emerging disease.
Solution
Major modern diseases such as
1. Ebola virus disease, 2 .Salmonellosis and 3 influenza .
1.Ebola virus disease, :
It also called Ebola hemorrhagic fever (EHF) or just Ebola, is a viral hemorrhagic fever of
people and different primates brought about by ebolaviruses.
Signs and indications ordinarily begin between two days and three weeks in the wake of getting
the infection with a fever, sore throat, solid torment, and migraines.
At that point, spewing, looseness of the bowels and rash typically take after, with diminished
capacity of the liver and kidneys.
2.salmonellosis
It is a disease caused by the Salmonella microscopic organisms.
The vast majority with salmonellosis create loose bowels, fever, heaving, and stomach issues 12
to 72 hours after disease.
Much of the time, the disease endures four to seven days, and a great many people recuperate
without treatment i
Transmission :Sullied nourishment, frequently having no bizarre look or smell
Poor kitchen cleanliness, particularly hazardous in institutional kitchens and eateries since this
can prompt to a huge flare-up .
Discharges from either wiped out or tainted yet clearly clinically sound individuals
Contaminated surface water and standing water, (for example, in shower hoses or unused water
distributors)
and
3 influenza ..
Create the variables, and methods needed for this classA DicePlay.pdf
Create the variables, and methods needed for this class:
A DicePlayer is a class that represents the player in a Craps game. A DicePlayer is a data class.
The data we need to manage (the fields or class variables) are the players name and how much
money the player has to bet.
Methods are needed to manage this data.
Solution
import java.util.Scanner; // inporting required packages
class DicePlayer
{
private String name; // creating requried variables
private double cash;
Scanner sc=new Scanner(System.in); // scanner variable to take i/p\'s
public void setName()
{
System.out.println(\"Enter the name of the player\ \");
name=sc.next(); // taking player name
}
public void setCash ()
{
System.out.println(\"Give the amount on the hand\ \");
cash=sc.nextDouble(); // taking cash
}
public String getName()
{
return name; // getting name when needed
}
public double getCash()
{
return cash; // getting cash when needed
}
public boolean addCash()
{
double add;
System.out.println(\"Give the amount to add\ \");
add=sc.nextInt();
if (add>0) // checking the taken value is non-negative
{
cash=cash+add; // if yes add it to cash
return true;
}
else
return false; // else retrun false
}
public boolean subCash()
{
double sub;
System.out.println(\"Give the amount to sub\ \");
sub=sc.nextInt();
if (sub>0 && sub.
Describe different flow control valves with figures. Include referenc.pdf
Describe different flow control valves with figures. Include references for the material and
figures.
Solution
DIFFERENT TYPES OF FLOW CONTROL VALVES
1. BALL VALVE
A ball valve is a form of quarter-turn valve which uses a hollow, perforated and pivoting ball to
control flow through it. It is open when the ball\'s hole is in line with the flow and closed when it
is pivoted 90-degrees by the valve handle. The handle lies flat in alignment with the flow when
open, and is perpendicular to it when closed, making for easy visual confirmation of the valve\'s
status.
Ball valves are durable, performing well after many cycles, and reliable, closing securely even
after long periods of disuse. These qualities make them an excellent choice for shutoff and
control applications, where they are often preferred to gates and globe valves, but they lack their
fine control in throttling applications.
The ball valve\'s ease of operation, repair, and versatility lend it to extensive industrial use,
supporting pressures up to 1000 bar and temperatures up to 752 °F (500 °C), depending on
design and materials used. Sizes typically range from 0.2 to 48 inches (0.5 cm to 121 cm). One
disadvantage of a ball valve is that they trap water in the center cavity while in the closed
position. In the event of a freeze, the sides can crack due to expansion of ice forming. Some
means of insulation or heat tape in this situation will usually prevent damage. Another option for
cold climates is the \"freeze tolerant ball valve\". This style of ball valve incorporates a freeze
plug in the side so in the event of a freeze up, the freeze plug ruptures, (acts as a sacrificial disk),
thus making for an easy repair. Now instead of replacing the whole valve, just screw in a new
freeze plug.
2.GATE VALVE
A gate valve, also known as a sluice valve, is a valve which opens by lifting a round or
rectangular gate/wedge out of the path of the fluid. The distinct feature of a gate valve is the
sealing surfaces between the gate and seats are planar, so gate valves are often used when a
straight-line flow of fluid and minimum restriction is desired. The gate faces can be parallel, but
are most commonly wedge-shaped. Gate valves are primarily used to permit or prevent the flow
of liquids, but typical gate valves shouldn\'t be used for regulating flow, unless they are
specifically designed for that purpose. Because of their ability to cut through liquids, gate valves
are often used in the petroleum industry. For extremely thick fluids, a specialty valve often
known as a knife gate valve is used to cut through the liquid. On opening the gate valve, the flow
path is enlarged in a highly nonlinear manner with respect to percent of opening. This means that
flow rate does not change evenly with stem travel. Also, a partially open gate tends to vibrate
from the fluid flow. Most of the flow change occurs near shutoff with a relatively high fluid
velocity causing gate and seat wear and eventual leakage if u.
Consider a sample with data values of 10, 20, 12, 17, and 16.Compute.pdf
Consider a sample with data values of 10, 20, 12, 17, and 16.Compute the z-score for each of the
five observations (to2 decimals).
Observed valuez-score1020121716
Solution
mean = (10+20+12+17+16)/5=15
standard deviation = 4 (based on the data)
Z-score = (X-mean)/standard deviationObserved ValueZ-score10(10-15)/4 =-1.2520(20-
15)/4=1.2512(12-15)/4=-0.7517(17-15)/4=0.516(16-15)/4=0.25.
Compare and contrast transmit and receive diversity. Describe how ea.pdf
Compare and contrast transmit and receive diversity. Describe how each diversity type lead to an
improvement in system performance.
Solution
Diversity refers to a technique for improving the transmission of a signal, by receiving and
processing multiple versions of the same transmitted signal. The multiple versions can be the
result of signals following different propagation paths, being transmitted at different times or
frequencies. In Transmit diversity, Spatial diversity is introduced into the signal by transmitting
through multiple antennas. The antennas are spaced far enough so that the signals emanating
from them can be assumed to undergo independent fading. In addition to diversity gain, antenna
gain can also be incorporated through channel state feedback. TD can improve the receiver
performance in the presence of flat fading. It reduces impact of fading by offering mutliple
copies of the digitally modulated waveform at the receiver, where the chance that all copies are
simultaneously in a fade is very small. In receiver diversity, the use of diversity at receiver
needs combining the outputs of statistically independent fading channels, in accordance with a
criterion that leads to improved receiver performance. Several techniques have been studied for
diversity combining. Some of these techniques are selection combining, maximal ratio, equal
gain and square law combining. When using diversity transmission and reception, the amount of
received signal improvement depends on the independence of the fading characteristics of the
signal as well as circuit outages and failures..
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.
Blood in the femoral artery will flow into what artery next Bl.pdf
Blood in the femoral artery will flow into what artery next?
Blood in the femoral artery will flow into what artery next?
Solution
Answer: popliteal artery
The popliteal artery branches off from the femoral artery. It is located in the knee and the back of
the leg. Its courses near the adductor canal and the adductor hiatus, distinctive open areas inside
the thigh. At its far end, it splits into the anterior and posterior tibial arteries..
Assume that 96 of ticket holders show up for an airline flight. If .pdf
Assume that 96% of ticket holders show up for an airline flight. If a plane seats 200 people, how
many tickets should be sold to make the chance of an overbooked flight (more ticket holders
show up for a flight than there are seats available) is at most 10%.
Solution
Say no. of tickets booked = x
Now only 0.96x will turn up
No. of seats = 200
Now these 0.96x people should get a seat with 90% probability
200 / (0.96x) >=0.9
200/0.864 >= x
x <=231.48
x = 231
Airline will make 231 reservations.
Although some male crab spiders find and mate with adult female spide.pdf
Although some male crab spiders find and mate with adult female spiders, others that find
immature females remain with them although the sub adult females are incapable of mating until
they become adults. This behavior would puzzle most evolutionary biologists because: a. The
genetic basis for this behavior would be very difficult to determine. b. Mating is instinctive in
spiders and therefore all males should behave the same, either mating with adult females only or
guarding sub adult females only. c. Males that guard sub adults cannot use the time to find
receptive females. d. One would think that immature female spiders should accept and store
sperm from males in order to permit good female-finding males to have time to find many mates.
Solution
The answer to this concept is ans (4)..one the female immature spider should store the sperms in
them for good female - findings males to have time to find many other...
7. At October 1, Smithson Enterprises reported owners equity of $.pdf
7. At October 1, Smithson Enterprises reported owner\'s equity of $35,000. During October no
additional investments were made and the company earned net income of $4.000. If owner\'s
equity at October 31 totals $32,000, what amount of owner d during the month? A) S0 rawings
was m B) $1.000
Solution
Amount of owner drawings were made during the month:
= $35,000 + $4,000 - $32,000
= $7,000.
5. A repeated measures analysis of variane shows, F(4,20)=14.56. How.pdf
5. A repeated measures analysis of variane shows, F(4,20)=14.56. How many repeated measures
were there? How many subjects?
Solution
5.
There are
k = df1 + 1 = 4 + 1 = 5 repeated measures [ANSWER]
********************
Meanwhile, there are
n = df2/(k-1) + 1
subjects, so,
n = 20/(5-1) + 1 = 6 subjects [ANSWER].
Write a Java program that calculates the distance between two points.pdf
Write a Java program that calculates the distance between two points when a user types the
coordinates.
Solution
DistBetPoints.java
import java.util.Scanner;//package for keyboard inputting
//distance = square root of [(a2-a1)squared + (b2-b1)squared]
public class DistBetPoints
{//main class
static double distance(double a1, double b1, double a2, double b2)
{
return Math.sqrt((a2-a1)*(a2-a1) + (b2-b1)*(b2-b1));
}
public static void main(String[] args)
{ //main function
double a2, a1, b2, b1;
double distance;
Scanner scan = new Scanner (System.in);
System.out.println(\"Enter the x coordinate for point 1: \");
a1 = scan.nextDouble();//keyboard inputting
System.out.println(\"Enter the y coordinate for point 1: \");
b1 = scan.nextDouble();//keyboard inputting
System.out.println(\"Enter the x coordinate for point 2: \");
a2 = scan.nextDouble();//keyboard inputting
System.out.println(\"Enter the y coordinate for point 2: \");
b2 = scan.nextDouble();//keyboard inputting
distance = distance(a1,b1,a2,b2);//calling function
System.out.println(\"The distance between the two points is \" + distance + \" .\");
}
}
output
Enter the x coordinate for point 1:
0
Enter the y coordinate for point 1:
0
Enter the x coordinate for point 2:
2
Enter the y coordinate for point 2:
2
The distance between the two points is 2.8284271247461903 ..
Which of the following light waves has the most amount of energyH.pdf
Which of the following light waves has the most amount of energy?
High frequency
Low frequency
long wavelength
light speed
Solution
At low frequency ,light waves show High amount of energy.
The different types of raditions present in light energy ,found in the photons. Photons are the
pockets of light energy. Radio waves have photons with low energy,microwave photons have
little more energy than radio waves, ..
What is the wobble position What is the consequence of its pres.pdf
What is the \'wobble\' position? What is the consequence of its presence?
Solution
Answer : During intercation between mRNA/codons and tRNA/anticodons, The third base of the
codon and the first base of the anticodon constitutes the wobble position.
Wobble Allows Some tRNAs to Recognize More than One Codon. This is due to the fact that
strict watson and crick base pairing rules applies only to the first two bases of the codon where as
third base tRNA can recognise more than one codon..
What is an advantage of having homologous chromosomes (compared to h.pdf
What is an advantage of having homologous chromosomes (compared to haploid cells that only
have a single copy of each gene)?
Solution
Humans, including many other organisms contain a double set of chromosomes in their genetic
material. The purpose and benefits of having a homologus chromosomes can be discussed as
below:
Thus, the above given explanations represent the benefits of having a homologous pair of
chromosomes in diploid organisms over haploids..
What are oncogenic viruses Which of the following groups of viruses.pdf
What are oncogenic viruses? Which of the following groups of viruses are most likely to be
oncogenic? Circle all that apply. Retroviruses (single stranded RNA + reverse transcriptase)
Double stranded RNA viruses Single-stranded DNA viruses Double-stranded DNA viruses
Solution
5a)IOncogenic vrisuses are the viruses which are usually suspected of causing cancer humans
and animals .The Examples is human papillomaviruses
b) a and b because retrovirus and double stranded DNA are oncogenic here..
Unlike the biological species concept, the morphospecies concept rel.pdf
Unlike the biological species concept, the morphospecies concept relies on:
a. offspring.
phenotype.
physiology.
behavior.
a. offspring.b.
phenotype.c.
physiology.d.
behavior.
Solution
B). Phenotype
Biological species concept (BSC): According to the biological species concept, a biological
species is the one in which, organisms can have interbreeding and produce the viable offspring.
In contrast, the morphospecies concept relies on phenotype. The species are grouped according
to the similarities in their morphological features..
1.) Which macronutrient do we consume in large amounts, but which we.pdf
1.) Which macronutrient do we consume in large amounts, but which we don\'t use for energy
stores?
a.) Lipid
b.) Protein
c.) Carbohydrate
d.) Minerals
2.) There are no essential _________.
a.) amino acids
b.) fatty acids
c.) carbohydrates
d.) minerals
e.) vitamins
Solution
1). b). Protein
Proteins are taken in large quantities but are not used as direct energy stores. The primary
function of proteins is not energy production, they are the structural elements of muscles and
many other cellular structures. In the absence of carbohydrates and lipids, proteins are
breakdown to derive energy.
We generally take carbohydrates in higher quantities, excess glucose is stored as glycogen. But
glycogen is not the long term energy storage because glucose is water soluble. Lipids are water-
insoluble and they serve as long-term energy stores.
2). c.) carbohydrates
Essential nutrients are those that must be taken through food to meet the body\'s metabolic
requirements. No particular carbohydrate is considered essential..
11.1.2 Entered Answer Preview 28 28 128 128 At least one of the an.pdf
11.1.2 Entered Answer Preview 28 28 1/28 1/28 At least one of the answers above is NOT
correct (1 pt ind an equation for the parabola that has its vertex at the origin and focus F(0,7) f
your answer is in the form r2 Ay, then input here: A 28 if your answer is in the form y E Ar, then
input here A 1/28 Result correct In Correct
Solution
Please see for the given information, we get parabola as x^2=Ay, so x^2=28y is only answer for
this problem..
The systemic circuit delivers oxygenated blood to and returns blood t.pdf
The systemic circuit delivers oxygenated blood to and returns blood to the body organs, night
atrium lungs, right atrium lungs: left atrium body organs: left atrium lungs, right ventricle All of
the vessel names below refer to both an artery and a vein except femoral. gonadal. radial.
axillary. basilica. The common iliac artery branches off of the inferior vena cava. abdominal
aorta thoracic aorta. celiac trunk. pulmonary trunk. After ending the aim. the axillary artery
becomes the artery. radial ulnar brachial subclavian digital the vein is a superficial vein that
ascends along the medial side of the forearm. radial ulnar cephalic basilica brachial
Solution
Answers
4. A body organs , right atrium
System circulation carries oxygenated blood from the left ventricle , through the arteries , to the
capillaries in the tissues of the body . From the tissue capillaries the deoxygenated blood returns
through a system of veins to the right atrium of the heart .
5. E. basilic
6. B . Abdominal aorta
The Abdominal aorta divides to form the common iliac arteries in the lower abdomen , and these
vessels supply blood to the pelvic organs , glutenal region and legs . Each common iliac artery
descends a short distance and divides into an internal and an external branch.
7. C. Brachial
8. D. Basilic
The basilic vein is a large superficial vein of the upper limb that helps drain parts of the hand and
forearm . It originated on the medial (ulnar ) side of the dorsal venous network of the hand and
travels up the Base of the forearm , where it\'s course is generally visible through the skin or it
travels in the subcutaneous fat and fascia lying superficial to the muscle ..
More from poblettesedanoree498 (20)
Give examples of two zoonotic diseases. Explain how these zoonotic d.pdf
Give examples of two zoonotic diseases. Explain how these zoonotic d.pdf
Create the variables, and methods needed for this classA DicePlay.pdf
Create the variables, and methods needed for this classA DicePlay.pdf
Describe different flow control valves with figures. Include referenc.pdf
Describe different flow control valves with figures. Include referenc.pdf
Consider a sample with data values of 10, 20, 12, 17, and 16.Compute.pdf
Consider a sample with data values of 10, 20, 12, 17, and 16.Compute.pdf
Compare and contrast transmit and receive diversity. Describe how ea.pdf
Compare and contrast transmit and receive diversity. Describe how ea.pdf
C++ Doubly-Linked ListsThe goal of the exercise is to implement a.pdf
C++ Doubly-Linked ListsThe goal of the exercise is to implement a.pdf
Blood in the femoral artery will flow into what artery next Bl.pdf
Blood in the femoral artery will flow into what artery next Bl.pdf
Assume that 96 of ticket holders show up for an airline flight. If .pdf
Assume that 96 of ticket holders show up for an airline flight. If .pdf
Although some male crab spiders find and mate with adult female spide.pdf
Although some male crab spiders find and mate with adult female spide.pdf
7. At October 1, Smithson Enterprises reported owners equity of $.pdf
7. At October 1, Smithson Enterprises reported owners equity of $.pdf
5. A repeated measures analysis of variane shows, F(4,20)=14.56. How.pdf
5. A repeated measures analysis of variane shows, F(4,20)=14.56. How.pdf
Write a Java program that calculates the distance between two points.pdf
Write a Java program that calculates the distance between two points.pdf
Which of the following light waves has the most amount of energyH.pdf
Which of the following light waves has the most amount of energyH.pdf
What is the wobble position What is the consequence of its pres.pdf
What is the wobble position What is the consequence of its pres.pdf
What is an advantage of having homologous chromosomes (compared to h.pdf
What is an advantage of having homologous chromosomes (compared to h.pdf
What are oncogenic viruses Which of the following groups of viruses.pdf
What are oncogenic viruses Which of the following groups of viruses.pdf
Unlike the biological species concept, the morphospecies concept rel.pdf
Unlike the biological species concept, the morphospecies concept rel.pdf
1.) Which macronutrient do we consume in large amounts, but which we.pdf
1.) Which macronutrient do we consume in large amounts, but which we.pdf
11.1.2 Entered Answer Preview 28 28 128 128 At least one of the an.pdf
11.1.2 Entered Answer Preview 28 28 128 128 At least one of the an.pdf
The systemic circuit delivers oxygenated blood to and returns blood t.pdf
The systemic circuit delivers oxygenated blood to and returns blood t.pdf
Recently uploaded
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
Acetabularia Information For Class 9 .docx
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Introduction to AI for Nonprofits with Tapp Network
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
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
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
Biological Screening of Herbal Drugs in detailed.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
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.
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
Recently uploaded (20)
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance.pptx
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
–PLS write program in c++ thanxLinked List Sorting and Reversing.pdf
- 1. –PLS write program in c++ thanx Linked List Sorting and Reversing Write a C++ using your own linked list class to manage a list of string elements. Besides the basic operations expected of a linked list (add an element, remove an element, check for empty list, report size (number) of elements in the list, and print out the content of the list), the linked list class also needs to have a method called sort() and a method called reverse() the manipulate the string elements. The sort method rearranges the elements in the list so they are sorted in alphabetical order. The reverse method reverses the order of the elements of the list. Do NOT use recursion to implement either of these operations. pls write program in c++ thanx Solution #include #include using namespace std; class Node{ //class node public: string data; Node* next; void SetData(string aData) { data = aData; }; void SetNext(Node* aNext) { next = aNext; }; }; class List{ //class list Node *head; public: List() { head = NULL; }; void addElement(string data); void removeElement(string data); int isEmpty(Node* temp); int size(); void print(); void sort(); void reverse();
- 2. }; int List::isEmpty(Node* temp){ //method to check whether list is empty or not if(temp!=NULL) return 1; else return 0; } void List::addElement(string data){ //method to add Node* newNode=new Node(); newNode->SetData(data); newNode->SetNext(NULL); Node* temp=head; if(temp!=NULL) { while(temp->next!=NULL) {temp=temp->next;} temp->next=newNode; } else head=newNode; } void List::removeElement(string data){ //method for delete Node* temp=head; Node *prev=head; if(isEmpty(temp)==1) {//prev=temp; while(temp!=NULL) { if(temp->data==data) {prev->next=temp->next; temp->next=NULL; } else {prev=temp;
- 3. temp=temp->next; } } } else cout<<"Nothing to delete as linked list is empty "<next; } } return count; } void List::print(){ //method for print Node* temp=head; if(isEmpty(temp)==1){ while(temp!=NULL) { cout<data<<" "; temp=temp->next; } } } int main() { List list; list.addElement("anshu"); list.addElement("anurag"); list.addElement("how"); list.addElement("are"); list.addElement("you?"); int count=list.size(); cout<<"size of the linked list= "<