Qestion Please add pre-condition, post-conditions and descriptions .pdf
•
0 likes•2 views
Qestion: Please add pre-condition, post-conditions and descriptions for each member function of the LINKED_LIST_CLASS. Answer with your new version of the program. #include using namespace std; class LIST_NODE { public: int data; // data element of node LIST_NODE *next; // pointer element of node }; class LINKED_LIST_CLASS { public: LINKED_LIST_CLASS(); // default constructor LINKED_LIST_CLASS(LINKED_LIST_CLASS &); // copy constructor ~LINKED_LIST_CLASS(); // destructor void Add(int); // mutator void Print(); // accessor LIST_NODE * Search(int); // accessor void Remove(int); // mutator bool Is_Empty(); // accessor private: LIST_NODE *front; // pointer to front of list }; LINKED_LIST_CLASS::LINKED_LIST_CLASS() { cout << endl << \"The default constructor has been called.\ \"; front = new LIST_NODE; front->next = 0; // initialize the next field to null front->data = -10000; } LINKED_LIST_CLASS::LINKED_LIST_CLASS(LINKED_LIST_CLASS & org) { cout << endl << \"The copy constructor has been called.\ \"; front = new LIST_NODE; front->next = 0; front->data = -10000; LIST_NODE *p = org.front->next; LIST_NODE *back = 0; while(p!=0) { if (back == 0) { front->next = new LIST_NODE; back = front->next; back->next = 0; back->data = p->data; } else { back->next = new LIST_NODE; back = back->next; back->data = p->data; back->next = 0; } p=p->next; } } LINKED_LIST_CLASS::~LINKED_LIST_CLASS() { cout << endl << \"The destructor has been called.\ \"; while (front->next != 0) { LIST_NODE *p = front->next; front->next = front->next->next; delete p; } delete front; front = 0; } void LINKED_LIST_CLASS::Add(int item) { LIST_NODE *p = new LIST_NODE; p->data = item; if (front->next== 0) // empty list { front->next = p; p->next = 0; } else // list has information and is not empty { p->next = front->next; front->next = p; } } void LINKED_LIST_CLASS::Print() { cout << endl; for(LIST_NODE *p = front->next; p != 0; p = p->next) { cout << p->data; if (p->next != 0) { cout << \"-->\"; } } cout<next; p!=0; p=p->next) { if (p->data == key) return p; } return 0; // key not found in list } void LINKED_LIST_CLASS::Remove(int key) { LIST_NODE *p = Search(key); if (Is_Empty()) { cout << key << \" is not in the list. No removal performed!\ \"; } else { LIST_NODE *q = front; while (q->next->data != key) { q = q->next; } q->next = p->next; // CRITICAL STEP!!!! delete p; } } bool LINKED_LIST_CLASS::Is_Empty() { return front->next == 0; } int main() { LINKED_LIST_CLASS L1; L1.Add(5); L1.Add(10); L1.Add(29); L1.Print(); LINKED_LIST_CLASS L2 = L1; L2.Print(); L1.Remove(10); L1.Print(); return 0; } Solution #include using namespace std; class LIST_NODE { public: int data; // data element of node LIST_NODE *next; // pointer element of node }; class LINKED_LIST_CLASS { public: LINKED_LIST_CLASS(); // default constructor LINKED_LIST_CLASS(LINKED_LIST_CLASS &); // copy constructor ~LINKED_LIST_CLASS(); // destructor void Add(int); // mutator void Print(); // accessor LIST_NODE * Search(int); // ac.
Report
Share
Report
Share
Download to read offline
Recommended
Consider a double-linked linked list implementation with the followin.pdf
Consider a double-linked linked list implementation with the following node: struct Node {int
data; Node *prev; Node *next;} Write a copyList method that is not a member of any class.
The method should take a head pointer and return another pointer. Do not modify the input.
Solution
struct Node {
Node *prev; // previous node
Node *next; // next node
int data; // stored value
};
#include
#include \"List.h\" // std: #include
using namespace std;
typedef DataList ; // std: typedef list Data;
int main() {
Data k;
// back stuff
k.push_back(5);
k.push_back(6);
cout << k.back() << endl;
k.pop_back();
// front stuff
k.push_front(4);
k.push_front(3);
cout << k.front() << endl;
k.pop_front();
// forward iterator
Data::iterator pos;
for (pos = k.begin(); pos != k.end(); ++pos)
cout << *pos << endl;
// output and delete list
while (!k.empty()) {
cout << k.front() << endl;
k.pop_front();
}
k.push_front(5);
k.push_front(6);
// remove and erase
k.remove(5);
pos = k.begin();
k.erase(pos);
k.push_front(5);
k.push_front(6);
// copy constructor
Data l = k;
// assignment operator
Data m;
m = k;
return 0;
}
// List.h
struct Node;
classIterator List;
class List {
public:
typedef ListIterator iterator;
// constructor
List();
// destructor
virtual ~List();
// copy constructor
List(const List& k);
// assignment operator
List& operator=(const List& k);
// insert value in front of list
void push_front(double data);
// insert value in back of list
void push_back(double data);
// delete value from front of list
void pop_front();
// delete value from back of list
void pop_back();
// return value on front of list
double front() const;
// return value on back of list
double back() const;
// delete value specified by iterator
void erase(const iterator& i);
// delete all nodes with specified value
void remove(double data);
// return true if list is empty
bool empty() const;
// return reference to first element in list
iterator begin() const;
// return reference to one past last element in list
iterator end() const;
private:
Node *head; // head of list
};
class ListIterator {
public:
// default constructor
ListIterator() {
i = 0;
}
// construct iterator for given pointer (used for begin/end)
ListIterator(Node *p) {
i = p;
}
// convert iterator to Node*
operator Node*() const {
return i;
}
// test two iterators for not equal
bool operator!=(const ListIterator& k) const {
return i != k.i;
}
// preincrement operator
ListIterator& operator++() {
i = i->next;
return *this;
}
// return value associated with iterator
double& operator*() const {
return i->data;
}
private:
Node *i; // current value of iterator
};
list.cpp
// delete list
static void deleteList(Node *head) {
Node *p = head->next;
while (p != head) {
Node *next = p->next;
delete p;
p = next;
}
delete head;
}
// copy list
static void copyList(const Node *from, Node *&to) {
// create dummy header
to = new Node;
to->next = to->prev = to;
// copy nodes
for (Node *p = from->next; p != from; p = p->next) {
Node *t = new Node;
t.
How to delete one specific node in linked list in CThanksSolu.pdf
How to delete one specific node in linked list in C?
Thanks
Solution
#include
#include
struct node
{
int data;
struct node *next;
};
void deleteNode(struct node *head, struct node *n)
{
if(head == n)
{
if(head->next == NULL)
{
printf(\"There is only one node. The list can\'t be made empty \");
return;
}
head->data = head->next->data;
n = head->next;
head->next = head->next->next;
free(n);
return;
}
struct node *prev = head;
while(prev->next != NULL && prev->next != n)
prev = prev->next;
if(prev->next == NULL)
{
printf(\"\ Given node is not present in Linked List\");
return;
}
prev->next = prev->next->next;
free(n);
return;
}
void push(struct node **head_ref, int new_data)
{
struct node *new_node =
(struct node *)malloc(sizeof(struct node));
new_node->data = new_data;
new_node->next = *head_ref;
*head_ref = new_node;
}
void printList(struct node *head)
{
while(head!=NULL)
{
printf(\"%d \",head->data);
head=head->next;
}
printf(\"\ \");
}
int main()
{
struct node *head = NULL;
push(&head,3);
push(&head,2);
push(&head,6);
push(&head,5);
push(&head,11);
push(&head,10);
push(&head,15);
push(&head,12);
printf(\"Given Linked List: \");
printList(head);
printf(\"\ Deleting node %d: \", head->next->next->data);
deleteNode(head, head->next->next);
printf(\"\ Modified Linked List: \");
printList(head);
printf(\"\ Deleting first node \");
deleteNode(head, head);
printf(\"\ Modified Linked List: \");
printList(head);
getchar();
return 0;
}.
In C++Write a recursive function to determine whether or not a Lin.pdf
In C++
Write a recursive function to determine whether or not a Linked List is in sorted order (smallest
value to largest value).
Add the following function prototypes to your List class under the section for access functions,
then implement the functions below the class definition:
public:
/**Access Functions*/
bool isSorted();
//Wrapper function that calls the isSorted helper function to determine whether
//a list is sorted in ascending order.
//We will consider that a list is trivially sorted if it is empty.
//Therefore, no precondition is needed for this function
private:
bool isSorted(Nodeptr node);
//Helper function for the public isSorted() function.
//Recursively determines whether a list is sorted in ascending order.
#include //for NULL
#include
#include
using namespace std;
template //list stores generic list data, not any specific C++ type
class List
{
private:
struct Node
{
listdata data;
Node* next;
Node* previous;
Node(listdata data): data(data), next(NULL), previous(NULL){}
};
typedef struct Node* Nodeptr;
Nodeptr first;
Nodeptr last;
Nodeptr iterator;
int size;
public:
/**Constructors and Destructors*/
List();
//Default constructor; initializes and empty list
//Postcondition: numeric values equated to zero, or strings should be empty.
List(const List &list);
~List();
//Destructor. Frees memory allocated to the list
//Postcondition: position NodePtr at next Node
/**Accessors*/
listdata getFirst();
//Returns the first element in the list
//Precondition:NodePtr points to the first node on list
listdata getLast();
//Returns the last element in the list
//Precondition: make new node first on the list
listdata getIterator();
bool isEmpty();
//Determines whether a list is empty.
int getSize();
//Returns the size of the list
/**Manipulation Procedures*/
void startIterator();
void advanceIterator();
void removeLast();
//Removes the value of the last element in the list
//Precondition: list is not empty, not the first element.
//Postcondition: one remaining node
void removeIterator();
void removeFirst();
//Removes the value of the first element in the list
//Precondition: list is not empty
//Postcondition: no nodes left
void insertLast(listdata data);
//Inserts a new element at the end of the list
//If the list is empty, the new element becomes both first and last
//Postcondition: next equal to null
void insertFirst(listdata data);
//Inserts a new element at the start of the list
//If the list is empty, the new element becomes both first and last
//Postcondition:point nodePtr next node on list
/**Additional List Operations*/
bool offEnd();
void printList();
//Prints to the console the value of each element in the list sequentially
//and separated by a blank space
//Prints nothing if the list is empty
void insertIterator(listdata data);
bool operator==(const List &list);
};
// constructor definition
template
List::List(): first(NULL), last(NULL), iterator(NULL), size(0) {}
template
List::List(const List &list): size(list.size)
{
if(list..
File name a2.cppTaskFor this assignment, you are required to ei.pdf
File name: a2.cpp
Task
For this assignment, you are required to either A) modify your linked list code to implement a
queue or B) modify the provided stack code to implement a queue. Your program should
implement a C++ queue class with the following member functions:
- Void enq(int)
- Void deq()
- Void front()
- Bool isEmpty()
- Void printq()
Your program will take in a command file called “cmd.txt” which will instruct your program
what operations to run
File Format
<0 or 1 arguments>
Commands
- 1 enq
- 2 deq
- 3 front
- 4 isEmpty
- 5 printq
Example File
1 1
5
1 2
5
1 3
5
1 4
5
3
2
5
2
5
3
Expectations
You should not use any already pre implemented code for your queue such as a standard library
object
Your code should be well formatted with proper spacing and proper naming
Your code should have well named variables. No a’s b’s or c’s as names unless it is for
something like a loop counter
Your code should have the same output formatting you see below
Your code MUST follow the formatting you see below
Your file MUST be named a2.cpp
My example file does not contain all possible test cases it is up to you to determine any other
special cases to test your program against.
Example Output
//LinkedList class
#include
#include
#include
#include
#include
using namespace std;
struct Node
{
int data;
Node *next;
};
class LinkedList
{
private:
Node *head;
Node *tail;
public:
LinkedList(); //constructor
void prepend(int num);
void append(int num);
void removeFront();
void removeBack();
void remove(int num);
int search(int num);
void printList();
};
//constructor
LinkedList::LinkedList()
{
head=NULL;
tail=NULL;
}
//prepend() method
void LinkedList::prepend(int num)
{
//allocate space for new node
Node *node=new Node;
//populate node
node->data=num;
node->next= NULL;
//attach new node to start of list
//if linked list empty
if(head==NULL)
{
head=node;
tail=node;
}
else //linked list not empty
{
node->next=head;
head=node;
}
}
//append() method
void LinkedList::append(int num)
{
//allocate space for new node
Node *node=new Node;
//populate node
node->data=num;
node->next= NULL;
//attach new node to end of list
//if linked list empty
if(head==NULL)
{
head=node;
tail=node;
}
else //linked list not empty
{
tail->next=node;
tail=node;
}
}
//removeFront() method
void LinkedList::removeFront()
{
//if linked list empty, then underflow
if(head==NULL)
{
cerr<<\"Underflow\"<next;
//delete node
cout<<\"Removing \"<data<<\" from the list\"<next!=NULL)
{
/*if(curr==tail)
break;*/
prev=curr;
curr=curr->next;
}
prev->next=NULL;
tail=prev;
//delete node
cout<<\"Removing \"<data<<\" from the list\"<data=num)
break;
prev=curr;
curr=curr->next;
}
//preserve node
Node *temp=curr;
//detach node from linked list
prev->next=curr->next;
//delete node
cout<<\"Removing \"<data<<\" from the list\"<data=num)
{
found=1; //num found
break;
}
curr=curr->next;
}
return found;
}
//printList() method
void LinkedList::printList()
{
//traverse linked list
Node *curr=head;
while(curr!=NULL)
{
c.
linked List.docx vhjgvjhvgjhjhbbjkhkjhkjh
This C code defines structures for nodes and linked lists. It provides functions for creating nodes, inserting nodes at the beginning or end of a linked list, deleting nodes with a specific value, searching for a node, and displaying the linked list. These functions are used in the main function to demonstrate manipulating a linked list, including inserting nodes, deleting nodes, and searching.
Program to insert in a sorted list #includestdio.h#include.pdf
* Program to insert in a sorted list */
#include
#include
/* Link list node */
struct node
{
int data;
struct node* next;
};
/* function to insert a new_node in a list. Note that this
function expects a pointer to head_ref as this can modify the
head of the input linked list (similar to push())*/
void sortedInsert(struct node** head_ref, struct node* new_node)
{
struct node* current;
/* Special case for the head end */
if (*head_ref == NULL || (*head_ref)->data >= new_node->data)
{
new_node->next = *head_ref;
*head_ref = new_node;
}
else
{
/* Locate the node before the point of insertion */
current = *head_ref;
while (current->next!=NULL &&
current->next->data < new_node->data)
{
current = current->next;
}
new_node->next = current->next;
current->next = new_node;
}
}
/* BELOW FUNCTIONS ARE JUST UTILITY TO TEST sortedInsert */
/* A utility function to create a new node */
struct node *newNode(int new_data)
{
/* allocate node */
struct node* new_node =
(struct node*) malloc(sizeof(struct node));
/* put in the data */
new_node->data = new_data;
new_node->next = NULL;
return new_node;
}
/* Function to print linked list */
void printList(struct node *head)
{
struct node *temp = head;
while(temp != NULL)
{
printf(\"%d \", temp->data);
temp = temp->next;
}
}
/* Drier program to test count function*/
int main()
{
/* Start with the empty list */
struct node* head = NULL;
struct node *new_node = newNode(5);
sortedInsert(&head, new_node);
new_node = newNode(10);
sortedInsert(&head, new_node);
new_node = newNode(7);
sortedInsert(&head, new_node);
new_node = newNode(3);
sortedInsert(&head, new_node);
new_node = newNode(1);
sortedInsert(&head, new_node);
new_node = newNode(9);
sortedInsert(&head, new_node);
printf(\"\ Created Linked List\ \");
printList(head);
return 0;
}
public class Listnode {
//*** fields ***
private Object data;
private Listnode next;
//*** methods ***
// 2 constructors
public Listnode(Object d) {
this(d, null);
}
public Listnode(Object d, Listnode n) {
data = d;
next = n;
}
// access to fields
public Object getData() {
return data;
}
public Listnode getNext() {
return next;
}
// modify fields
public void setData(Object ob) {
data = ob;
}
public void setNext(Listnode n) {
next = n;
}
}
Thsi below program print out all the varibles in SLL
#include
#include
#include
/* Link list node */
struct node
{
int data;
struct node* next;
};
/* Given a reference (pointer to pointer) to the head
of a list and an int, push a new node on the front
of the list. */
void push(struct node** head_ref, int new_data)
{
/* allocate node */
struct node* new_node =
(struct node*) malloc(sizeof(struct node));
/* put in the data */
new_node->data = new_data;
/* link the old list off the new node */
new_node->next = (*head_ref);
/* move the head to point to the new node */
(*head_ref) = new_node;
}
/* Takes head pointer of the linked list and index
as arguments and return data at index*/
int GetNth(struct node* head, int index)
{
struct node* current = head;
int .
Adt of lists
This document discusses lists as an abstract data type (ADT) and their implementation using arrays and linked lists. It defines a list as a finite, ordered sequence of elements and describes common list operations like insertion, deletion, traversal etc. Linked lists are introduced as an alternative implementation where each node contains a data field and link to the next node. The advantages of linked lists over arrays for dynamic data are also highlighted. Various real-world applications of lists are listed like implementing stacks, queues, graphs and dynamic memory allocation.
could you implement this function please, im having issues with it..pdf
could you implement this function please, im having issues with it.
void makeList (const ListNode::value_type [],const size_t& count)
class ListNode
{
public:
typedef int value_type;
ListNode (value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum () const { return datum; }
ListNode const* getNext () const { return next; }
//Mutator
void setDatum (const value_type& d) {datum = d; }
ListNode* getNext () { return next; }
void setNext (ListNode* new_link) {next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList ();
virtual ~LinkedList ();
void insertItem (ListNode::value_type);
void makeList (const ListNode::value_type [],const size_t& count);
void deleteList ();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
This is the pseudocode, but i still have a hard time undertanding it.
Creating a List (makeList(const ListNode::value_type [],const size_t& count)) This function
receives an array in the order that we want to add it to the linkedlist. Index 0 will be the head
node, index n will be the last node.
First, create a node initialized with a data value and a NULL pointer. Set the \"head\" to point to
the first node. Set up a current-pointer to the first node (or \"head\"). Get a data value for the next
node. While more nodes to add { Create a new node initialized with the data value and a NULL
pointer. Set the current-pointer link member (\"next\") to the new node. Set the current-pointer to
point to the new node. Get a data value for the next node. }
Thanks.
Solution
//linkedList.h
#ifndef LINKEDLIST_H
#define LINKEDLIST_H
#include
#include
class ListNode
{
public:
typedef int value_type;
ListNode(value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum() const { return datum; }
ListNode const* getNext() const { return next; }
//Mutator
void setDatum(const value_type& d) { datum = d; }
ListNode* getNext() { return next; }
void setNext(ListNode* new_link) { next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList();
virtual ~LinkedList();
void insertItem(ListNode::value_type);
void makeList(const ListNode::value_type[], const size_t& count);
void deleteList();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
#endif
-------------------------------------------------------------
//linkedList.cpp
#include \"linkedlist.h\"
LinkedList::LinkedList()
{
head = NULL;
}
LinkedList::~LinkedList()
{
ListNode *tmp = head;
while (tmp != NULL)
{
head = head->getNext();
delete tmp;
tmp = head;
}
}
void LinkedList::insertItem(ListNode::value_type item)
{
ListNode *newNode,*cur = head;
newNode = new ListNode;
newNode->setDatum(item);
newNode->setNext(NULL);.
Recommended
Consider a double-linked linked list implementation with the followin.pdf
Consider a double-linked linked list implementation with the following node: struct Node {int
data; Node *prev; Node *next;} Write a copyList method that is not a member of any class.
The method should take a head pointer and return another pointer. Do not modify the input.
Solution
struct Node {
Node *prev; // previous node
Node *next; // next node
int data; // stored value
};
#include
#include \"List.h\" // std: #include
using namespace std;
typedef DataList ; // std: typedef list Data;
int main() {
Data k;
// back stuff
k.push_back(5);
k.push_back(6);
cout << k.back() << endl;
k.pop_back();
// front stuff
k.push_front(4);
k.push_front(3);
cout << k.front() << endl;
k.pop_front();
// forward iterator
Data::iterator pos;
for (pos = k.begin(); pos != k.end(); ++pos)
cout << *pos << endl;
// output and delete list
while (!k.empty()) {
cout << k.front() << endl;
k.pop_front();
}
k.push_front(5);
k.push_front(6);
// remove and erase
k.remove(5);
pos = k.begin();
k.erase(pos);
k.push_front(5);
k.push_front(6);
// copy constructor
Data l = k;
// assignment operator
Data m;
m = k;
return 0;
}
// List.h
struct Node;
classIterator List;
class List {
public:
typedef ListIterator iterator;
// constructor
List();
// destructor
virtual ~List();
// copy constructor
List(const List& k);
// assignment operator
List& operator=(const List& k);
// insert value in front of list
void push_front(double data);
// insert value in back of list
void push_back(double data);
// delete value from front of list
void pop_front();
// delete value from back of list
void pop_back();
// return value on front of list
double front() const;
// return value on back of list
double back() const;
// delete value specified by iterator
void erase(const iterator& i);
// delete all nodes with specified value
void remove(double data);
// return true if list is empty
bool empty() const;
// return reference to first element in list
iterator begin() const;
// return reference to one past last element in list
iterator end() const;
private:
Node *head; // head of list
};
class ListIterator {
public:
// default constructor
ListIterator() {
i = 0;
}
// construct iterator for given pointer (used for begin/end)
ListIterator(Node *p) {
i = p;
}
// convert iterator to Node*
operator Node*() const {
return i;
}
// test two iterators for not equal
bool operator!=(const ListIterator& k) const {
return i != k.i;
}
// preincrement operator
ListIterator& operator++() {
i = i->next;
return *this;
}
// return value associated with iterator
double& operator*() const {
return i->data;
}
private:
Node *i; // current value of iterator
};
list.cpp
// delete list
static void deleteList(Node *head) {
Node *p = head->next;
while (p != head) {
Node *next = p->next;
delete p;
p = next;
}
delete head;
}
// copy list
static void copyList(const Node *from, Node *&to) {
// create dummy header
to = new Node;
to->next = to->prev = to;
// copy nodes
for (Node *p = from->next; p != from; p = p->next) {
Node *t = new Node;
t.
How to delete one specific node in linked list in CThanksSolu.pdf
How to delete one specific node in linked list in C?
Thanks
Solution
#include
#include
struct node
{
int data;
struct node *next;
};
void deleteNode(struct node *head, struct node *n)
{
if(head == n)
{
if(head->next == NULL)
{
printf(\"There is only one node. The list can\'t be made empty \");
return;
}
head->data = head->next->data;
n = head->next;
head->next = head->next->next;
free(n);
return;
}
struct node *prev = head;
while(prev->next != NULL && prev->next != n)
prev = prev->next;
if(prev->next == NULL)
{
printf(\"\ Given node is not present in Linked List\");
return;
}
prev->next = prev->next->next;
free(n);
return;
}
void push(struct node **head_ref, int new_data)
{
struct node *new_node =
(struct node *)malloc(sizeof(struct node));
new_node->data = new_data;
new_node->next = *head_ref;
*head_ref = new_node;
}
void printList(struct node *head)
{
while(head!=NULL)
{
printf(\"%d \",head->data);
head=head->next;
}
printf(\"\ \");
}
int main()
{
struct node *head = NULL;
push(&head,3);
push(&head,2);
push(&head,6);
push(&head,5);
push(&head,11);
push(&head,10);
push(&head,15);
push(&head,12);
printf(\"Given Linked List: \");
printList(head);
printf(\"\ Deleting node %d: \", head->next->next->data);
deleteNode(head, head->next->next);
printf(\"\ Modified Linked List: \");
printList(head);
printf(\"\ Deleting first node \");
deleteNode(head, head);
printf(\"\ Modified Linked List: \");
printList(head);
getchar();
return 0;
}.
In C++Write a recursive function to determine whether or not a Lin.pdf
In C++
Write a recursive function to determine whether or not a Linked List is in sorted order (smallest
value to largest value).
Add the following function prototypes to your List class under the section for access functions,
then implement the functions below the class definition:
public:
/**Access Functions*/
bool isSorted();
//Wrapper function that calls the isSorted helper function to determine whether
//a list is sorted in ascending order.
//We will consider that a list is trivially sorted if it is empty.
//Therefore, no precondition is needed for this function
private:
bool isSorted(Nodeptr node);
//Helper function for the public isSorted() function.
//Recursively determines whether a list is sorted in ascending order.
#include //for NULL
#include
#include
using namespace std;
template //list stores generic list data, not any specific C++ type
class List
{
private:
struct Node
{
listdata data;
Node* next;
Node* previous;
Node(listdata data): data(data), next(NULL), previous(NULL){}
};
typedef struct Node* Nodeptr;
Nodeptr first;
Nodeptr last;
Nodeptr iterator;
int size;
public:
/**Constructors and Destructors*/
List();
//Default constructor; initializes and empty list
//Postcondition: numeric values equated to zero, or strings should be empty.
List(const List &list);
~List();
//Destructor. Frees memory allocated to the list
//Postcondition: position NodePtr at next Node
/**Accessors*/
listdata getFirst();
//Returns the first element in the list
//Precondition:NodePtr points to the first node on list
listdata getLast();
//Returns the last element in the list
//Precondition: make new node first on the list
listdata getIterator();
bool isEmpty();
//Determines whether a list is empty.
int getSize();
//Returns the size of the list
/**Manipulation Procedures*/
void startIterator();
void advanceIterator();
void removeLast();
//Removes the value of the last element in the list
//Precondition: list is not empty, not the first element.
//Postcondition: one remaining node
void removeIterator();
void removeFirst();
//Removes the value of the first element in the list
//Precondition: list is not empty
//Postcondition: no nodes left
void insertLast(listdata data);
//Inserts a new element at the end of the list
//If the list is empty, the new element becomes both first and last
//Postcondition: next equal to null
void insertFirst(listdata data);
//Inserts a new element at the start of the list
//If the list is empty, the new element becomes both first and last
//Postcondition:point nodePtr next node on list
/**Additional List Operations*/
bool offEnd();
void printList();
//Prints to the console the value of each element in the list sequentially
//and separated by a blank space
//Prints nothing if the list is empty
void insertIterator(listdata data);
bool operator==(const List &list);
};
// constructor definition
template
List::List(): first(NULL), last(NULL), iterator(NULL), size(0) {}
template
List::List(const List &list): size(list.size)
{
if(list..
File name a2.cppTaskFor this assignment, you are required to ei.pdf
File name: a2.cpp
Task
For this assignment, you are required to either A) modify your linked list code to implement a
queue or B) modify the provided stack code to implement a queue. Your program should
implement a C++ queue class with the following member functions:
- Void enq(int)
- Void deq()
- Void front()
- Bool isEmpty()
- Void printq()
Your program will take in a command file called “cmd.txt” which will instruct your program
what operations to run
File Format
<0 or 1 arguments>
Commands
- 1 enq
- 2 deq
- 3 front
- 4 isEmpty
- 5 printq
Example File
1 1
5
1 2
5
1 3
5
1 4
5
3
2
5
2
5
3
Expectations
You should not use any already pre implemented code for your queue such as a standard library
object
Your code should be well formatted with proper spacing and proper naming
Your code should have well named variables. No a’s b’s or c’s as names unless it is for
something like a loop counter
Your code should have the same output formatting you see below
Your code MUST follow the formatting you see below
Your file MUST be named a2.cpp
My example file does not contain all possible test cases it is up to you to determine any other
special cases to test your program against.
Example Output
//LinkedList class
#include
#include
#include
#include
#include
using namespace std;
struct Node
{
int data;
Node *next;
};
class LinkedList
{
private:
Node *head;
Node *tail;
public:
LinkedList(); //constructor
void prepend(int num);
void append(int num);
void removeFront();
void removeBack();
void remove(int num);
int search(int num);
void printList();
};
//constructor
LinkedList::LinkedList()
{
head=NULL;
tail=NULL;
}
//prepend() method
void LinkedList::prepend(int num)
{
//allocate space for new node
Node *node=new Node;
//populate node
node->data=num;
node->next= NULL;
//attach new node to start of list
//if linked list empty
if(head==NULL)
{
head=node;
tail=node;
}
else //linked list not empty
{
node->next=head;
head=node;
}
}
//append() method
void LinkedList::append(int num)
{
//allocate space for new node
Node *node=new Node;
//populate node
node->data=num;
node->next= NULL;
//attach new node to end of list
//if linked list empty
if(head==NULL)
{
head=node;
tail=node;
}
else //linked list not empty
{
tail->next=node;
tail=node;
}
}
//removeFront() method
void LinkedList::removeFront()
{
//if linked list empty, then underflow
if(head==NULL)
{
cerr<<\"Underflow\"<next;
//delete node
cout<<\"Removing \"<data<<\" from the list\"<next!=NULL)
{
/*if(curr==tail)
break;*/
prev=curr;
curr=curr->next;
}
prev->next=NULL;
tail=prev;
//delete node
cout<<\"Removing \"<data<<\" from the list\"<data=num)
break;
prev=curr;
curr=curr->next;
}
//preserve node
Node *temp=curr;
//detach node from linked list
prev->next=curr->next;
//delete node
cout<<\"Removing \"<data<<\" from the list\"<data=num)
{
found=1; //num found
break;
}
curr=curr->next;
}
return found;
}
//printList() method
void LinkedList::printList()
{
//traverse linked list
Node *curr=head;
while(curr!=NULL)
{
c.
linked List.docx vhjgvjhvgjhjhbbjkhkjhkjh
This C code defines structures for nodes and linked lists. It provides functions for creating nodes, inserting nodes at the beginning or end of a linked list, deleting nodes with a specific value, searching for a node, and displaying the linked list. These functions are used in the main function to demonstrate manipulating a linked list, including inserting nodes, deleting nodes, and searching.
Program to insert in a sorted list #includestdio.h#include.pdf
* Program to insert in a sorted list */
#include
#include
/* Link list node */
struct node
{
int data;
struct node* next;
};
/* function to insert a new_node in a list. Note that this
function expects a pointer to head_ref as this can modify the
head of the input linked list (similar to push())*/
void sortedInsert(struct node** head_ref, struct node* new_node)
{
struct node* current;
/* Special case for the head end */
if (*head_ref == NULL || (*head_ref)->data >= new_node->data)
{
new_node->next = *head_ref;
*head_ref = new_node;
}
else
{
/* Locate the node before the point of insertion */
current = *head_ref;
while (current->next!=NULL &&
current->next->data < new_node->data)
{
current = current->next;
}
new_node->next = current->next;
current->next = new_node;
}
}
/* BELOW FUNCTIONS ARE JUST UTILITY TO TEST sortedInsert */
/* A utility function to create a new node */
struct node *newNode(int new_data)
{
/* allocate node */
struct node* new_node =
(struct node*) malloc(sizeof(struct node));
/* put in the data */
new_node->data = new_data;
new_node->next = NULL;
return new_node;
}
/* Function to print linked list */
void printList(struct node *head)
{
struct node *temp = head;
while(temp != NULL)
{
printf(\"%d \", temp->data);
temp = temp->next;
}
}
/* Drier program to test count function*/
int main()
{
/* Start with the empty list */
struct node* head = NULL;
struct node *new_node = newNode(5);
sortedInsert(&head, new_node);
new_node = newNode(10);
sortedInsert(&head, new_node);
new_node = newNode(7);
sortedInsert(&head, new_node);
new_node = newNode(3);
sortedInsert(&head, new_node);
new_node = newNode(1);
sortedInsert(&head, new_node);
new_node = newNode(9);
sortedInsert(&head, new_node);
printf(\"\ Created Linked List\ \");
printList(head);
return 0;
}
public class Listnode {
//*** fields ***
private Object data;
private Listnode next;
//*** methods ***
// 2 constructors
public Listnode(Object d) {
this(d, null);
}
public Listnode(Object d, Listnode n) {
data = d;
next = n;
}
// access to fields
public Object getData() {
return data;
}
public Listnode getNext() {
return next;
}
// modify fields
public void setData(Object ob) {
data = ob;
}
public void setNext(Listnode n) {
next = n;
}
}
Thsi below program print out all the varibles in SLL
#include
#include
#include
/* Link list node */
struct node
{
int data;
struct node* next;
};
/* Given a reference (pointer to pointer) to the head
of a list and an int, push a new node on the front
of the list. */
void push(struct node** head_ref, int new_data)
{
/* allocate node */
struct node* new_node =
(struct node*) malloc(sizeof(struct node));
/* put in the data */
new_node->data = new_data;
/* link the old list off the new node */
new_node->next = (*head_ref);
/* move the head to point to the new node */
(*head_ref) = new_node;
}
/* Takes head pointer of the linked list and index
as arguments and return data at index*/
int GetNth(struct node* head, int index)
{
struct node* current = head;
int .
Adt of lists
This document discusses lists as an abstract data type (ADT) and their implementation using arrays and linked lists. It defines a list as a finite, ordered sequence of elements and describes common list operations like insertion, deletion, traversal etc. Linked lists are introduced as an alternative implementation where each node contains a data field and link to the next node. The advantages of linked lists over arrays for dynamic data are also highlighted. Various real-world applications of lists are listed like implementing stacks, queues, graphs and dynamic memory allocation.
could you implement this function please, im having issues with it..pdf
could you implement this function please, im having issues with it.
void makeList (const ListNode::value_type [],const size_t& count)
class ListNode
{
public:
typedef int value_type;
ListNode (value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum () const { return datum; }
ListNode const* getNext () const { return next; }
//Mutator
void setDatum (const value_type& d) {datum = d; }
ListNode* getNext () { return next; }
void setNext (ListNode* new_link) {next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList ();
virtual ~LinkedList ();
void insertItem (ListNode::value_type);
void makeList (const ListNode::value_type [],const size_t& count);
void deleteList ();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
This is the pseudocode, but i still have a hard time undertanding it.
Creating a List (makeList(const ListNode::value_type [],const size_t& count)) This function
receives an array in the order that we want to add it to the linkedlist. Index 0 will be the head
node, index n will be the last node.
First, create a node initialized with a data value and a NULL pointer. Set the \"head\" to point to
the first node. Set up a current-pointer to the first node (or \"head\"). Get a data value for the next
node. While more nodes to add { Create a new node initialized with the data value and a NULL
pointer. Set the current-pointer link member (\"next\") to the new node. Set the current-pointer to
point to the new node. Get a data value for the next node. }
Thanks.
Solution
//linkedList.h
#ifndef LINKEDLIST_H
#define LINKEDLIST_H
#include
#include
class ListNode
{
public:
typedef int value_type;
ListNode(value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum() const { return datum; }
ListNode const* getNext() const { return next; }
//Mutator
void setDatum(const value_type& d) { datum = d; }
ListNode* getNext() { return next; }
void setNext(ListNode* new_link) { next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList();
virtual ~LinkedList();
void insertItem(ListNode::value_type);
void makeList(const ListNode::value_type[], const size_t& count);
void deleteList();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
#endif
-------------------------------------------------------------
//linkedList.cpp
#include \"linkedlist.h\"
LinkedList::LinkedList()
{
head = NULL;
}
LinkedList::~LinkedList()
{
ListNode *tmp = head;
while (tmp != NULL)
{
head = head->getNext();
delete tmp;
tmp = head;
}
}
void LinkedList::insertItem(ListNode::value_type item)
{
ListNode *newNode,*cur = head;
newNode = new ListNode;
newNode->setDatum(item);
newNode->setNext(NULL);.
Linked lists
The document contains C++ code for implementing and testing various operations on linked lists, including adding/deleting nodes, sorting, splitting lists, reversing lists, and checking for circularity. It defines a Node struct with data and next pointer, and includes functions for initializing nodes, adding/deleting nodes, sorting, splitting, reversing lists, checking for circularity, and more. It also includes unit tests for various functions using the BOOST test framework.
Complete the provided partial C++ Linked List program. Main.cpp is g.pdf
Complete the provided partial C++ Linked List program. Main.cpp is given and Link list header
file is also given. The given testfile listmain.cpp is given for demonstration of unsorted list
functionality. The functions header file is also given. Complete the functions of the header file
linked_list.h below.
=========================================================
// listmain.cpp
#include \"Linked_List.h\"
int main(int argc, char **argv)
{
float f;
Linked_List *theList;
cout << \"Simple List Demonstration\ \";
cout << \"(List implemented as an Array - Do not try this at home)\ \ \";
cout << \"Create a list and add a few tasks to the list\";
theList = new Linked_List(); // Instantiate a list object
theList->Insert(5, 3.1f); // Note: The argument to the funtion should be a float
theList->Insert(1, 5.6f); // A constant real number like 3.1 is interpreted as
theList->Insert(3, 8.3f); // a double unless it is explicitly defined as a float
theList->Insert(2, 7.4f); // by adding an \'f\' to the end of the number.
theList->Insert(4, 2.5f);
// Show what is in the list
theList->PrintList();
// Test the list length function
cout << \"\ List now contains \" << theList->ListLength() << \"items.\ \ \";
// Test delete function
cout << \"Testing delete of last item in list.\ \";
theList->Delete(4);
theList->PrintList();
// Test delete function
cout << \"Testing delete of first item in list.\ \";
theList->Delete(5);
theList->PrintList();
// Test delete function
cout << \"Testing delete of a middle item in list.\ \";
theList->Delete(3);
theList->PrintList();
// Test delete function with a known failure argument
cout << \"Testing failure in delete function.\ \";
if(theList->Delete(4))
cout << \"Oops! Should not have been able to delete.\ \";
else
cout << \"Unable to locate item to delete.\ \";
// Test search (known failure)
cout << \"Testing Search function. Search for key 3\ \";
if(theList->Search(3, &f))
cout << \"Search result: theData = %f\ \", f;
else
cout << \"Search result: Unable to locate item in list\ \";
// Test search (known success)
cout << \"Testing Search function. Search for key 2\ \";
if(theList->Search(2, &f))
cout << \"Search result: theData = \" << f << \"\ \";
else
cout << \"Search result: Unable to locate item in list\ \";
cout << \"\ \ End list demonstration...\";
return 0;
}
=====================================================================
===================
// linked_list.h functions
#include
using namespace std;
// Define a structure to use as the list item
struct ListItem
{
int key;
float theData;
ListItem *next;
};
class Linked_List
{
private:
ListItem *head; // Pointer to head of the list
public:
Linked_List(); // Class constructor
~Linked_List(); // Class destuctor
void ClearList(); // Remove all items from the list
bool Insert(int key, float f);// Add an item to the list
bool Delete(int key); // Delete an item from the list
bool Search(int key, float *retVal); // Search for an item in the list
int ListLength(); // Return numb.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using arrays or linked lists. The document also discusses queues, which follow FIFO order. Key queue operations are enqueue and dequeue. Queues can also be implemented using arrays or linked lists. The document provides examples of implementing both stacks and queues as classes using these underlying data structures.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using arrays or linked lists. The document also discusses queues, which follow FIFO order. Key queue operations are enqueue and dequeue. Queues can also be implemented using arrays or linked lists. The document provides examples of implementing both stacks and queues as classes with the appropriate member functions.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using arrays or linked lists. The document also discusses queue operations like enqueue and dequeue. Queues follow FIFO order and can also be implemented using arrays or linked lists. It provides examples of implementing both stacks and queues as classes with the appropriate member functions.
Stack queue
The document discusses stacks and queues as data structures. It describes stacks as lists where insertion and deletion occur at the same end, following LIFO order. The primary stack operations are push and pop. Stacks can be implemented using arrays or linked lists. Queues are lists where insertion occurs at one end and deletion at the other, following FIFO order. The primary queue operations are enqueue and dequeue. Queues can also be implemented using arrays or linked lists. Examples of stack and queue implementations and uses are provided.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using arrays or linked lists. The document also discusses queues, which follow FIFO order. Key queue operations are enqueue and dequeue. Queues can also be implemented using arrays or linked lists. The document provides examples of implementing both stacks and queues as classes using these underlying data structures.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using arrays or linked lists. The document also discusses queues, which follow FIFO order. Key queue operations are enqueue and dequeue. Queues can also be implemented using arrays or linked lists. The document provides examples of implementing both stacks and queues as classes using these underlying data structures.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using either arrays or linked lists. The document also discusses queues, which follow FIFO order. Like stacks, queues support basic operations like enqueue and dequeue and can be implemented with arrays or linked lists. It provides examples of implementing both stacks and queues as class structures.
Link list part 2
This document discusses linked lists and their applications. It contains the following key points:
1. Linked lists can be used to implement stacks and queues using nodes with next pointers. Circular linked lists are also discussed where the last node points back to the first node.
2. The code template provided shows the implementation of a queue using a linked list with nodes containing data and next pointers. Functions like add, delete, and empty are demonstrated.
3. Doubly linked lists are introduced which contain previous and next pointers in each node. This allows traversal in both directions and simplifies operations like deletion compared to circular single linked lists.
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a problem with the nodes, as it is
posting errors with the nodes.
please help me with this problem. thank you.
public class LinkLists {
/* only need to store a single pointer to the node at the head
* of the list.
* The pointer is null if the list is empty.
* Also record the size of the list.
*/
protected Node head;
/* invariant: size is the number of nodes in the list pointed to by head */
protected int size;
/* no-arguments default constructor creates an empty list */
public LinkLists() {
head = null; // start with an empty list
size = 0;
}
/* accessor method */
public int size() {
return size;
}
/* value to add to the end of the list
*/
public void add(T value) {
head = addAtEnd(head, value);
size++;
}
/* node of the list to which the value should be added
* value to add to the end of the list
*/
private Node addAtEnd(Node node, T value) {
if (node == null) { // special case
return new Node(value, null);
} else if (node.getNext() == null) { // other special case
node.setNext(new Node(value, null));
} else {
addAtEnd(node.getNext(), value);
}
return node;
}
/* iterative implementation of the same method
* value to add to the end of the list
*/
public void add2(T value) {
if (head == null) {
head = new Node(value, null);
} else {
Node node = head; // guaranteed not to be null initially
while (node.getNext() != null) {
node = node.getNext(); // guaranteed not to be null here
}
// now, node.getNext() is guaranteed to be null
// similar to the second special case in addAtEnd
node.setNext(new Node(value, null));
}
size++;
}
public void remove(int position) throws BadItemCountException {
if ((position < 1) || (position > size)) {
throw new
BadItemCountException(\"invalid position \" + position +
\", only 1..\" + size + \" available\");
}
if (position == 1) {
head = head.getNext();
} else {
Node node = head;
for (int i = 2; i < position; i++) {
node = node.getNext();
}
node.setNext(node.getNext().getNext());
}
size--; // one less item
}
public String toString() {
return toString(head);
}
private String toString(Node node) {
if (node == null) {
return \"\";
} else {
return node.getValue() + \"\ \" + toString(node.getNext());
}
}
public static void main(String[] args) {
/* create two empty lists, make sure they print out correctly */
LinkLists list1 = new LinkLists();
LinkLists list2 = new LinkLists();
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* insert some items, keep checking */
list1.add(\"hello\");
list1.add(\"world\");
list2.add(\"foo\");
list2.add(\"bar\");
list2.add(\"baz\");
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* remove an item at an invalid position */
boolean caught = false;
try {
list2.remove(4);
} catch .
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program and set of functions (maybein
a library) that can be performed on a binary search tree.
Your program should allow user to insert/delete integer values into the binary search tree along
with several other operations on the binary search tree. You can use the code given in slides. But
this time your key will be int! Specifically, your program will ask user to enter a command and
related parameters (if any) in a loop, and then perform the given commands. Here is the list of
commands that your program must implement:
* insert
*find\'
*delete
*list inorder
*list preorder
*list postorder
*list levelorder
* max
* min
* height
*count
* sum
*quit
As always, make sure you release (free) the dynamically allocated memories if you allocate any
memory in your programs. So, before submitting your program, run it with valgrind to see if
there is any memory leakage
//my proggram in C
struct tree_node {
int data;
struct tree_node *left, *right;
}
typedef struct nodeT {
int key;
struct nodeT *left, *right;
} nodeT, *treeT;
int main(){
while (TRUE) {
printf(\"> \");
line = GetLine();
ch = toupper(line[0]);
switch (ch) {
case \'I\': insert(); break;
case \'F\': find(); break;
case \'D\': delete(); break;
case \'LI\': listInorder; break;
case \'LPR\': listPreorder(); break;
case \'LPO\': listPostorder(); break;
case \'MAX\': max(); break;
case \'min\': min(); break;
case \'H\': height(); break;
case \'C\': count(); break;
case \'S\': sum(); break;
case \'Q\': exit(0);
default:printf(\"Illegal command\ \"); break;
}
}
}
nodeT *FindNode(nodeT *t, int key){
while(t !=NULL) {
if (key == t->key) return t;
if (key < t->key) {
t = t->left;
} else {
t = t->right;
}
return NULL;
}
void delete(nodeT **p){
nodeT
*target;
target=*p;
if (target->left==NULL && target->right==NULL) {
*p=NULL;
} else if (target->left == NULL) {
*p=target->right;
} else
if (target->right == NULL) {
*p=target->left;
} else {
/* target has two children, see next slide */
}
free(target);
}
void listInorder(nodeT *T){
if (t != NULL) {
DisplayTree(t->left);
printf(“%d “, t->key);
DisplayTree(t->right);
}
}
void listPreorder(nodeT *t) {
if (t != NULL) {
printf(“%d “, t->key);
DisplayTree(t->left);
DisplayTree(t->right);
}
}
void listPostOrder(nodeT *t){
if (t != NULL) {
DisplayTree(t->left);
DisplayTree(t->right);
printf(“%d “, t->key);
}
}
void intsert(nodeT **tptr, int key){
nodeT*t, *tmp;
t=*tptr;
if (t == NULL) {
tmp=New(nodeT*);
tmp->key = key;
tmp->left=tmp->right=NULL;
*tptr=tmp;
return;
}
if (key < t->key) {
InsertNode
(&t->left, key);
} else {
InsertNode(&t->right, key);
}
}
int height(nodeT *t){
if (t == NULL)
return 0;
else
return (1 + maximumof(
height(t->left),
height(t->right)) );
}
int sum(struct tree_node *p){
if (p == NULL)
return 0;
else
return (p->data +
sum(p->left) +
sum(p->right) );
}
Solution
1. /*
2. * Java Program to Implement Binary Search Tree
3. */
4.
5. import java.util.Scanner;
6.
7. /* Class BSTNode */
8. cl.
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.
maincpp Build and procees a sorted linked list of Patie.pdf
main.cpp
/*
Build and procees a sorted linked list of Patient objects.
The list is sorted in ascending order by name.
Assume that the name is unique.
*/
#include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <string>
#include <cctype>
#include "LinkedList.h"
using namespace std;
void buildList(const string &filename, LinkedList &list);
void deleteManager(LinkedList &list);
void searchManager(const LinkedList &list);
void displayManager(const LinkedList &list);
int main() {
string inputFileName;
LinkedList list;
cout << "Enter file name: ";
getline(cin, inputFileName);
buildList(inputFileName, list);
displayManager(list);
searchManager(list);
deleteManager(list);
displayManager(list);
return 0;
}
/*
This function reads data from a file and inserts them
into a sorted linked list. The list is sorted in ascending order by name
*/
void buildList(const string &filename, LinkedList &list) {
ifstream inFile(filename);
cout << "Reading data from "" << filename << ""n";
if(!inFile) {
cout << "Error opening the input file: ""<< filename << """ << endl;
exit(EXIT_FAILURE);
}
string id;
int year;
string name;
int amount;
string line;
while (getline(inFile, line)) {
stringstream temp(line);
temp >> id >> year;
temp.ignore();
getline(temp, name, ';');
temp >> amount;
// create a Sales object and initialize it with data from file
/* Write your code here */
// call insert to insert this new Sales object into the sorted list
/* Write your code here */
}
inFile.close();
}
/*
Delete manager: delete items from the list until the user enters Q to quit
deleting
Input Parameter: list
*/
void deleteManager(LinkedList &list) {
string target = "";
cout << " Delete" << endl;
cout << "========" << endl;
while(target != "Q") {
cout << "Enter a name (or Q to stop deleting):" << endl;
getline(cin, target);
target[0] = toupper(target[0]);
if(target != "Q") {
if(list.deleteNode(target))
cout << target << " has been deleted!" << endl;
else
cout << target << " not found!" << endl;
}
}
cout << "___________________END DELETE SECTION_____" << endl;
}
/*
Search manager: search the list until the user enters Q to quit searching
Input Parameter: list
*/
void searchManager(const LinkedList &list) {
string target = "";
Sales obj;
cout << " Search" << endl;
cout << "========" << endl;
/* Write your code here */
cout << "___________________END SEARCH SECTION _____" << endl;
}
/*
Display manager: all, average, or year hired reports including header and footer where
appropriate,
depending on the user's choice;
displays the number of nodes (always)
Input Parameter: list
*/
void displayManager(const LinkedList &list) {
// Sub-functions of displayManager()
void showMenu(void);
string getOption(void);
void showHeader(string line);
string line = "==== ==================== =============n";
string option;
showMenu();
option = getOption();
while(option[0] != 'Q') {
switch (option[0]) {
case 'A':
showHeader(line);
list.displayList();
cout << line;
break;
case 'G':
cou.
Please solve the TODO parts include LinkedListcpph tem.pdf
Please solve the TODO parts.
#include "LinkedListcpp.h"
template <class T>
class Queue: public LinkedList<T>{
//private: ListNode<T> * back;
public:
//Queue<T>();
void add(T t);
void remove();
void remove(std::string title);
};
#include "Queue.h"
//template <class T>
//Queue<T>::Queue(){
// back=nullptr;
//}
//TODO
// add an element t to the end of queue- implement using an existing LinkedList method.
template <class T>
void Queue<T>::add(T t){
}
//TODO
//remove an element from the front of the queue-implement using an existing LinkedList method
template <class T>
void Queue<T>::remove(){
//TODO
// if queue us empty
// throw new std::string("NULL POINTER EXCEPTION QUEUE IS EMPTY n");
}
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
void populateRequests(Queue<Request>& q);
void populateSongDataBase(LinkedList<Song> &list);
void processQueue(LinkedList<Song> &list,Queue<Request>& q);
void processRequest(std::string action, std::string title,std::string singer,int chartPos);
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"*************************************n";
list.printList(); //
std::cout<<"*************************************n";
populateRequests(q); // fill the request q
std::cout<<"n";
std::cout<<"---------------PRINTING QUEUE-------------------n";
q.printList();
std::cout<<"------------------------------------n";
processQueue(list,q); // process the requests
std::cout<<"*************************************n";
list.printList();
std::cout<<"*************************************n";
}
//GIVEN
//Requires an empty linked list
//Effects fills the list with request by reading from the RequestData.txt
//Modifies the queue by filling it
void populateRequests(Queue<Request> &q){
}
//GIVEN
std::string playSong(LinkedList<Song>&list, Song s){
if (list.get(s)>=0){
return "PLAYING :"+ s.toString()+"n";
}
else{
return "SONG NOT FOUNDn";
}
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
std::cout<<"PLAYING TOP TEN SONG __________n";
list.print(10);
;
}
//Requires filled Song Database, a Song to add. The chart position given in the song is where it
will get added. Note this is a Song that is not supposed to exist in database.
//Effects adds the song from its original chart position
//Modifies the Song database. Adjust chart position of all Songs affected by this addition- this
adjustment is done in insert method using adjustPosition method. If the Process Queue adds a
Song that already is in the database, then a duplicate entry can occur.
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
/* Use this code
if (found>=0) {std::cout<<"ADDED THIS SONG "<<found+1<<" " ;list.printSong(found+1);}
else std::cout<<"SORRY CANNOT FIND SONG n";
*/
}
//TODO
//Requires filled Song Database, a Song to remove
//Effects if found, removes the song from its original .
Doublylinklist
This document presents information on doubly linked lists including their representation, initialization, node creation, and various operations like insertion, deletion, and traversal. It discusses inserting and deleting nodes at the beginning or end of the list, as well as inserting before or after a specified node. Code examples are provided for initializing a doubly linked list and performing each operation.
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
in C++ , Design a linked list class named IntegerList to hold a seri.pdf
in C++ , Design a linked list class named IntegerList to hold a series of integers. The class must
have public member functions for appending , inserting, deleting and displaying nodes. The
append function must append a node to the end of the list. The insert function must insert node in
ascending order. The delete function must delete the node with the given value. The display
function should display the list from head to tail. The IntegerList class should also have a
destructor that destroys the list and release memory. The list node must be declared as a structure
using keyword struct. This structure is a private member of IntegerList. You should also store the
head of the list as a private member.
Write a test program to test the implementation your IntegerList class works properly.
Solution
Here is the code for the above scenario:
#include
using namespace std;
struct ListNode
{
float value;
ListNode *next;
};
ListNode *head;
class LinkedList
{
public:
int insertNode(float num);
int appendNode(float num);
void deleteNode(float num);
void destroyList();
void displayList();
LinkedList(void) {head = NULL;}
~LinkedList(void) {destroyList();}
};
int LinkedList::appendNode(float num)
{
ListNode *newNode, *nodePtr = head;
newNode = new ListNode;
if(newNode == NULL)
{
cout << \"Error allocating memory for new list member!\ \";
return 1;
}
newNode->value = num;
newNode->next = NULL;
if(head == NULL)
{
cout << \"List was empty - \" << newNode->value;
cout << \" is part of list\'s first node.\ \";
head = newNode;
}
else
{
while(nodePtr->next != NULL)
nodePtr = nodePtr->next;
nodePtr->next = newNode;
}
return 0;
}
int LinkedList::insertNode(float num)
{
struct ListNode *newNode, *nodePtr = head, *prevNodePtr = NULL;
newNode = new ListNode;
if(newNode == NULL)
{
cout << \"Error allocating memory for new list member!\ \";
return 1;
}
newNode->value = num;
newNode->next = NULL;
if(head==NULL) {
cout << \"List was empty - \" << newNode->value;
cout << \" is part of list\'s first node.\ \";
head = newNode;
}
else
{
while((nodePtr != NULL) && (nodePtr->value < num)) {
prevNodePtr = nodePtr;
nodePtr = nodePtr->next;
}
if(prevNodePtr==NULL)
newNode->next = head;
else
newNode->next = nodePtr; prevNodePtr->next = newNode;
}
return 0;
}
void LinkedList::deleteNode(float num)
{
struct ListNode *nodePtr = head, *prevNodePtr = NULL;
if(head==NULL) {
cout << \"The list was empty!\ \";
return;
}
if(head->value == num) {
head = nodePtr->next;
delete [] nodePtr;
}
else
{
while((nodePtr!= NULL)&&(nodePtr->value != num)) {
prevNodePtr = nodePtr;
nodePtr = nodePtr->next;
}
if(nodePtr==NULL)
cout << \"The value \" << num << \" is not in this list!\ \";
else {
prevNodePtr->next = nodePtr->next;
delete [] nodePtr;
}
}
}
void LinkedList::destroyList()
{
struct ListNode *nodePtr = head, *nextNode = nodePtr;
if(head==NULL) {
cout << \"The list is empty!\ \";
return;
}
while (nodePtr != NULL) {
nextNode = nodePtr->next;
delete [] nodePtr;
nodePtr = nextNode;
}
}
void LinkedList.
Modify this code to change the underlying data structure to .pdf
Modify this code to change the underlying data structure to a double ended doubly-linked list. Data
records should be added to the end of the main array (the database) and three double ended
doubly linked lists should be maintained ; one each for the ID, LastName and FirstName. The
linked lists should (of course) be maintained in order You MUST use the driver program I have
provided , and make some additions. Remember, you should NOT be permitted to add a record
with a duplicate index number. You MUST implement all methods as I have indicated. Printing out
the data in forward order should use the "next" link in each node, printing out in reverse order
should employ the "prev" link.
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
public class DataBase {
private DataBaseArray dbArr;
private IndexArray firstIA, lastIA, IDIA;
private DeleteStack deleteStack;
private Scanner scan;
private String nld = "n-----------------------------n";
private String dnl = "-----------------------------n";
//Default Constructor
public DataBase() {
this.dbArr = new DataBaseArray(100);
this.firstIA = new IndexArray(100, false);
this.lastIA = new IndexArray(100, false);
this.IDIA = new IndexArray(100, true);
this.deleteStack = new DeleteStack(100);
readInDataFromFile();
scan = new Scanner(System.in);
}
//Constructor for custom size
public DataBase(int maxSize) {
this.dbArr = new DataBaseArray(maxSize);
this.firstIA = new IndexArray(maxSize, false);
this.lastIA = new IndexArray(maxSize, false);
this.IDIA = new IndexArray(maxSize, true);
this.deleteStack = new DeleteStack(maxSize);
readInDataFromFile();
scan = new Scanner(System.in);
}
//Read in the initial records
public void readInDataFromFile() {
File dbData = new File("dbData.txt");
Scanner scan = new Scanner(System.in); //Have to initialize to something for compilation
try {
scan = new Scanner(dbData);
} catch (FileNotFoundException e) {
e.printStackTrace();
}
String ID = "";
String fname = "";
String lname = "";
String[] values;
while(scan.hasNextLine()) {
values = scan.nextLine().split(",");
lname = values[0];
fname = values[1];
ID = values[2];
this.insertIt(ID, fname, lname);
}
}
//Ask user to specify ID, delete that record
public void deleteIt() {
String ID = "";
System.out.println("nDELETING" + nld);
System.out.println("Please enter the ID of the record to be deleted: ");
ID = this.scan.nextLine();
if (this.IDIA.searchByKey(ID) == -1) {
System.out.println(dnl + "Record not found, please try again." + nld);
return;
}
this.delete(ID);
System.out.println(dnl + "Record successfully deleted" + nld);
}
//Ask user to specify ID, return data of that record
public void findIt() {
String ID = "";
System.out.println("nFINDING" + nld);
System.out.println("Please enter the ID of the record to be found: ");
ID = this.scan.nextLine();
int iaIndexOfRecord = this.IDIA.searchByKey(ID);
if (iaIndexOfRecord == -1) {
System.out.println(dnl + "Record not found, please try again." + nld);
return.
Please need help on following program using c++ language. Please inc.pdf
Please need help on following program using c++ language. Please include all header files and
main file with their own title.
Extend the class linkedListType by adding the following operations:
Write a function that returns the info of the kth element of the linked list. If no such element
exists, terminate the program.
Write a function that deletes the kth element of the linked list. If no such element exists,
terminate the program.
Provide the definitions of these functions in the class linkedListType. Also, write a program to
test these functions. (Use either the class unorderedLinkedList or the
class orderedLinkedList to test your function.)
Solution
C++ Code for the given problem is below.....
.....................................................
/*
* C++ Program to Implement Singly Linked List
*/
#include
#include
#include
//using namespace std;
/*
* Node Declaration
*/
typedef struct nodetype
{
int info;
nodetype *next ;
} node;
/*
* Class Declaration
*/
class linkedListType
{
public:
void insfrombeg( node **head, int);
void delfromkth(node **head,int);
void findthekthnode(node *head,int);
void traverse(node *head);
int item,ch,kth;
node *ptr,*head,*temp;
};
/*
* Main :contains menu
*/
void main()
{
int item,ch,kth;
node *ptr,*head,*temp;
linkedListType s1;
clrscr();
while (1)
{
while(1)
{
cout<<\"PRESS (1) FOR INSERT INTO LIST\"<>ch;
switch(ch)
{
case 1:
cout<<\"ENTER THE VALUE \"<>item;
s1.insfrombeg(&head,item);
break;
case 2:
s1.traverse(head);
break;
case 3:
cout<<\"ENTER THE Kth Element which you want\'s to delete\"<>kth;
s1.delfromkth(&head,kth);
break;
case 4:
cout<<\"ENTER THE Kth Element which you want\'s to search \ \"<>kth;
s1.findthekthnode(head,kth);
break;
case 5:
exit(1);
}
}
// getch();
}
}
/*
* Inserting element in beginning
*/
void linkedListType::insfrombeg(node **head,int item)
{
temp= ( node * ) malloc (sizeof( node ));
temp->info= item;
temp->next= NULL;
if(*head == NULL)
{
temp->next= *head;
*head= temp;
}
else
{
temp->next= *head;
*head= temp;
}
}
/*
* Delete element at a given position
*/
void linkedListType::delfromkth(node **head,int kth)
{ node* temp1=*head,*temp2;
if(*head ==NULL)
{
cout<<\"LINK LIST IS EMPTY\ \"<next;
free(temp);
}
else
for(int j=0;jnext;
temp2= temp1->next;
temp1->next=temp2->next;
free(temp2);
}
/*
* Searching an element
*/
void linkedListType::findthekthnode(node *head,int kth)
{
ptr=head;
int i=1;
while((ptr!=NULL))
{
if(i==kth)
{
cout<<\"\ The Element at\"<< kth<< \"position with value is \\t
\"<info<info<next;
i++;
}
}
}
/*
* Traverse Link List
*/
void linkedListType::traverse(node *head)
{
ptr = head;
while((ptr->next)->next!=NULL)
{
cout<info<<\"\\t\";
ptr=ptr->next;
}
cout<
#include
#include
typedef struct nodetype
{
int info;
nodetype *next ;
} node;
int item,ch,kth,total=1;
node *ptr,*head,*temp;
void insfrombeg( node **head, int);
void delfromkth(node **head,int);
void findthekthnode(node *head,int);
void traverse(node *head);
void main()
{
clrscr();
while(1)
{
printf(\"PRESS .
How are the epimysium and tendons relatedA. The epimysium surroun.pdf
How are the epimysium and tendons related?
A. The epimysium surrounds the tendon.
B. Tendons surround the epimysium.
C. Tendons and epimysium both surround the end of the muscle.
D. The tendon is a continuation of the epimysium.
Solution
Answer:
D. The tendon is a continuation of the epimysium.
Explanation:
At the ends of a muscle, the fibers of the Epimysium may form a cable-like tendon or a sheet-
like aponeurosis..
How does DNA differ from RNAA. RNA uses only purinesB. RNA uses.pdf
How does DNA differ from RNA?
A. RNA uses only purines
B. RNA uses a different five-carbon sugar
C. RNA has a contains different sized phosphate groups
D. RNA has multiple bases attached to the sugar
Solution
B. RNA uses a different five-carbon sugar. RNA has the ribose pentose; whereas in DNA, the
pentose is deoxyribose..
More Related Content
Similar to Qestion Please add pre-condition, post-conditions and descriptions .pdf
Linked lists
The document contains C++ code for implementing and testing various operations on linked lists, including adding/deleting nodes, sorting, splitting lists, reversing lists, and checking for circularity. It defines a Node struct with data and next pointer, and includes functions for initializing nodes, adding/deleting nodes, sorting, splitting, reversing lists, checking for circularity, and more. It also includes unit tests for various functions using the BOOST test framework.
Complete the provided partial C++ Linked List program. Main.cpp is g.pdf
Complete the provided partial C++ Linked List program. Main.cpp is given and Link list header
file is also given. The given testfile listmain.cpp is given for demonstration of unsorted list
functionality. The functions header file is also given. Complete the functions of the header file
linked_list.h below.
=========================================================
// listmain.cpp
#include \"Linked_List.h\"
int main(int argc, char **argv)
{
float f;
Linked_List *theList;
cout << \"Simple List Demonstration\ \";
cout << \"(List implemented as an Array - Do not try this at home)\ \ \";
cout << \"Create a list and add a few tasks to the list\";
theList = new Linked_List(); // Instantiate a list object
theList->Insert(5, 3.1f); // Note: The argument to the funtion should be a float
theList->Insert(1, 5.6f); // A constant real number like 3.1 is interpreted as
theList->Insert(3, 8.3f); // a double unless it is explicitly defined as a float
theList->Insert(2, 7.4f); // by adding an \'f\' to the end of the number.
theList->Insert(4, 2.5f);
// Show what is in the list
theList->PrintList();
// Test the list length function
cout << \"\ List now contains \" << theList->ListLength() << \"items.\ \ \";
// Test delete function
cout << \"Testing delete of last item in list.\ \";
theList->Delete(4);
theList->PrintList();
// Test delete function
cout << \"Testing delete of first item in list.\ \";
theList->Delete(5);
theList->PrintList();
// Test delete function
cout << \"Testing delete of a middle item in list.\ \";
theList->Delete(3);
theList->PrintList();
// Test delete function with a known failure argument
cout << \"Testing failure in delete function.\ \";
if(theList->Delete(4))
cout << \"Oops! Should not have been able to delete.\ \";
else
cout << \"Unable to locate item to delete.\ \";
// Test search (known failure)
cout << \"Testing Search function. Search for key 3\ \";
if(theList->Search(3, &f))
cout << \"Search result: theData = %f\ \", f;
else
cout << \"Search result: Unable to locate item in list\ \";
// Test search (known success)
cout << \"Testing Search function. Search for key 2\ \";
if(theList->Search(2, &f))
cout << \"Search result: theData = \" << f << \"\ \";
else
cout << \"Search result: Unable to locate item in list\ \";
cout << \"\ \ End list demonstration...\";
return 0;
}
=====================================================================
===================
// linked_list.h functions
#include
using namespace std;
// Define a structure to use as the list item
struct ListItem
{
int key;
float theData;
ListItem *next;
};
class Linked_List
{
private:
ListItem *head; // Pointer to head of the list
public:
Linked_List(); // Class constructor
~Linked_List(); // Class destuctor
void ClearList(); // Remove all items from the list
bool Insert(int key, float f);// Add an item to the list
bool Delete(int key); // Delete an item from the list
bool Search(int key, float *retVal); // Search for an item in the list
int ListLength(); // Return numb.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using arrays or linked lists. The document also discusses queues, which follow FIFO order. Key queue operations are enqueue and dequeue. Queues can also be implemented using arrays or linked lists. The document provides examples of implementing both stacks and queues as classes using these underlying data structures.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using arrays or linked lists. The document also discusses queues, which follow FIFO order. Key queue operations are enqueue and dequeue. Queues can also be implemented using arrays or linked lists. The document provides examples of implementing both stacks and queues as classes with the appropriate member functions.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using arrays or linked lists. The document also discusses queue operations like enqueue and dequeue. Queues follow FIFO order and can also be implemented using arrays or linked lists. It provides examples of implementing both stacks and queues as classes with the appropriate member functions.
Stack queue
The document discusses stacks and queues as data structures. It describes stacks as lists where insertion and deletion occur at the same end, following LIFO order. The primary stack operations are push and pop. Stacks can be implemented using arrays or linked lists. Queues are lists where insertion occurs at one end and deletion at the other, following FIFO order. The primary queue operations are enqueue and dequeue. Queues can also be implemented using arrays or linked lists. Examples of stack and queue implementations and uses are provided.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using arrays or linked lists. The document also discusses queues, which follow FIFO order. Key queue operations are enqueue and dequeue. Queues can also be implemented using arrays or linked lists. The document provides examples of implementing both stacks and queues as classes using these underlying data structures.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using arrays or linked lists. The document also discusses queues, which follow FIFO order. Key queue operations are enqueue and dequeue. Queues can also be implemented using arrays or linked lists. The document provides examples of implementing both stacks and queues as classes using these underlying data structures.
Stack queue
The document discusses stacks and queues as data structures. It begins by defining a Node struct and List class to implement a linked list. It then provides an overview of stacks, including common stack operations like push and pop. Stacks follow LIFO order and can be implemented using either arrays or linked lists. The document also discusses queues, which follow FIFO order. Like stacks, queues support basic operations like enqueue and dequeue and can be implemented with arrays or linked lists. It provides examples of implementing both stacks and queues as class structures.
Link list part 2
This document discusses linked lists and their applications. It contains the following key points:
1. Linked lists can be used to implement stacks and queues using nodes with next pointers. Circular linked lists are also discussed where the last node points back to the first node.
2. The code template provided shows the implementation of a queue using a linked list with nodes containing data and next pointers. Functions like add, delete, and empty are demonstrated.
3. Doubly linked lists are introduced which contain previous and next pointers in each node. This allows traversal in both directions and simplifies operations like deletion compared to circular single linked lists.
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a problem with the nodes, as it is
posting errors with the nodes.
please help me with this problem. thank you.
public class LinkLists {
/* only need to store a single pointer to the node at the head
* of the list.
* The pointer is null if the list is empty.
* Also record the size of the list.
*/
protected Node head;
/* invariant: size is the number of nodes in the list pointed to by head */
protected int size;
/* no-arguments default constructor creates an empty list */
public LinkLists() {
head = null; // start with an empty list
size = 0;
}
/* accessor method */
public int size() {
return size;
}
/* value to add to the end of the list
*/
public void add(T value) {
head = addAtEnd(head, value);
size++;
}
/* node of the list to which the value should be added
* value to add to the end of the list
*/
private Node addAtEnd(Node node, T value) {
if (node == null) { // special case
return new Node(value, null);
} else if (node.getNext() == null) { // other special case
node.setNext(new Node(value, null));
} else {
addAtEnd(node.getNext(), value);
}
return node;
}
/* iterative implementation of the same method
* value to add to the end of the list
*/
public void add2(T value) {
if (head == null) {
head = new Node(value, null);
} else {
Node node = head; // guaranteed not to be null initially
while (node.getNext() != null) {
node = node.getNext(); // guaranteed not to be null here
}
// now, node.getNext() is guaranteed to be null
// similar to the second special case in addAtEnd
node.setNext(new Node(value, null));
}
size++;
}
public void remove(int position) throws BadItemCountException {
if ((position < 1) || (position > size)) {
throw new
BadItemCountException(\"invalid position \" + position +
\", only 1..\" + size + \" available\");
}
if (position == 1) {
head = head.getNext();
} else {
Node node = head;
for (int i = 2; i < position; i++) {
node = node.getNext();
}
node.setNext(node.getNext().getNext());
}
size--; // one less item
}
public String toString() {
return toString(head);
}
private String toString(Node node) {
if (node == null) {
return \"\";
} else {
return node.getValue() + \"\ \" + toString(node.getNext());
}
}
public static void main(String[] args) {
/* create two empty lists, make sure they print out correctly */
LinkLists list1 = new LinkLists();
LinkLists list2 = new LinkLists();
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* insert some items, keep checking */
list1.add(\"hello\");
list1.add(\"world\");
list2.add(\"foo\");
list2.add(\"bar\");
list2.add(\"baz\");
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* remove an item at an invalid position */
boolean caught = false;
try {
list2.remove(4);
} catch .
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program and set of functions (maybein
a library) that can be performed on a binary search tree.
Your program should allow user to insert/delete integer values into the binary search tree along
with several other operations on the binary search tree. You can use the code given in slides. But
this time your key will be int! Specifically, your program will ask user to enter a command and
related parameters (if any) in a loop, and then perform the given commands. Here is the list of
commands that your program must implement:
* insert
*find\'
*delete
*list inorder
*list preorder
*list postorder
*list levelorder
* max
* min
* height
*count
* sum
*quit
As always, make sure you release (free) the dynamically allocated memories if you allocate any
memory in your programs. So, before submitting your program, run it with valgrind to see if
there is any memory leakage
//my proggram in C
struct tree_node {
int data;
struct tree_node *left, *right;
}
typedef struct nodeT {
int key;
struct nodeT *left, *right;
} nodeT, *treeT;
int main(){
while (TRUE) {
printf(\"> \");
line = GetLine();
ch = toupper(line[0]);
switch (ch) {
case \'I\': insert(); break;
case \'F\': find(); break;
case \'D\': delete(); break;
case \'LI\': listInorder; break;
case \'LPR\': listPreorder(); break;
case \'LPO\': listPostorder(); break;
case \'MAX\': max(); break;
case \'min\': min(); break;
case \'H\': height(); break;
case \'C\': count(); break;
case \'S\': sum(); break;
case \'Q\': exit(0);
default:printf(\"Illegal command\ \"); break;
}
}
}
nodeT *FindNode(nodeT *t, int key){
while(t !=NULL) {
if (key == t->key) return t;
if (key < t->key) {
t = t->left;
} else {
t = t->right;
}
return NULL;
}
void delete(nodeT **p){
nodeT
*target;
target=*p;
if (target->left==NULL && target->right==NULL) {
*p=NULL;
} else if (target->left == NULL) {
*p=target->right;
} else
if (target->right == NULL) {
*p=target->left;
} else {
/* target has two children, see next slide */
}
free(target);
}
void listInorder(nodeT *T){
if (t != NULL) {
DisplayTree(t->left);
printf(“%d “, t->key);
DisplayTree(t->right);
}
}
void listPreorder(nodeT *t) {
if (t != NULL) {
printf(“%d “, t->key);
DisplayTree(t->left);
DisplayTree(t->right);
}
}
void listPostOrder(nodeT *t){
if (t != NULL) {
DisplayTree(t->left);
DisplayTree(t->right);
printf(“%d “, t->key);
}
}
void intsert(nodeT **tptr, int key){
nodeT*t, *tmp;
t=*tptr;
if (t == NULL) {
tmp=New(nodeT*);
tmp->key = key;
tmp->left=tmp->right=NULL;
*tptr=tmp;
return;
}
if (key < t->key) {
InsertNode
(&t->left, key);
} else {
InsertNode(&t->right, key);
}
}
int height(nodeT *t){
if (t == NULL)
return 0;
else
return (1 + maximumof(
height(t->left),
height(t->right)) );
}
int sum(struct tree_node *p){
if (p == NULL)
return 0;
else
return (p->data +
sum(p->left) +
sum(p->right) );
}
Solution
1. /*
2. * Java Program to Implement Binary Search Tree
3. */
4.
5. import java.util.Scanner;
6.
7. /* Class BSTNode */
8. cl.
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.
maincpp Build and procees a sorted linked list of Patie.pdf
main.cpp
/*
Build and procees a sorted linked list of Patient objects.
The list is sorted in ascending order by name.
Assume that the name is unique.
*/
#include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <string>
#include <cctype>
#include "LinkedList.h"
using namespace std;
void buildList(const string &filename, LinkedList &list);
void deleteManager(LinkedList &list);
void searchManager(const LinkedList &list);
void displayManager(const LinkedList &list);
int main() {
string inputFileName;
LinkedList list;
cout << "Enter file name: ";
getline(cin, inputFileName);
buildList(inputFileName, list);
displayManager(list);
searchManager(list);
deleteManager(list);
displayManager(list);
return 0;
}
/*
This function reads data from a file and inserts them
into a sorted linked list. The list is sorted in ascending order by name
*/
void buildList(const string &filename, LinkedList &list) {
ifstream inFile(filename);
cout << "Reading data from "" << filename << ""n";
if(!inFile) {
cout << "Error opening the input file: ""<< filename << """ << endl;
exit(EXIT_FAILURE);
}
string id;
int year;
string name;
int amount;
string line;
while (getline(inFile, line)) {
stringstream temp(line);
temp >> id >> year;
temp.ignore();
getline(temp, name, ';');
temp >> amount;
// create a Sales object and initialize it with data from file
/* Write your code here */
// call insert to insert this new Sales object into the sorted list
/* Write your code here */
}
inFile.close();
}
/*
Delete manager: delete items from the list until the user enters Q to quit
deleting
Input Parameter: list
*/
void deleteManager(LinkedList &list) {
string target = "";
cout << " Delete" << endl;
cout << "========" << endl;
while(target != "Q") {
cout << "Enter a name (or Q to stop deleting):" << endl;
getline(cin, target);
target[0] = toupper(target[0]);
if(target != "Q") {
if(list.deleteNode(target))
cout << target << " has been deleted!" << endl;
else
cout << target << " not found!" << endl;
}
}
cout << "___________________END DELETE SECTION_____" << endl;
}
/*
Search manager: search the list until the user enters Q to quit searching
Input Parameter: list
*/
void searchManager(const LinkedList &list) {
string target = "";
Sales obj;
cout << " Search" << endl;
cout << "========" << endl;
/* Write your code here */
cout << "___________________END SEARCH SECTION _____" << endl;
}
/*
Display manager: all, average, or year hired reports including header and footer where
appropriate,
depending on the user's choice;
displays the number of nodes (always)
Input Parameter: list
*/
void displayManager(const LinkedList &list) {
// Sub-functions of displayManager()
void showMenu(void);
string getOption(void);
void showHeader(string line);
string line = "==== ==================== =============n";
string option;
showMenu();
option = getOption();
while(option[0] != 'Q') {
switch (option[0]) {
case 'A':
showHeader(line);
list.displayList();
cout << line;
break;
case 'G':
cou.
Please solve the TODO parts include LinkedListcpph tem.pdf
Please solve the TODO parts.
#include "LinkedListcpp.h"
template <class T>
class Queue: public LinkedList<T>{
//private: ListNode<T> * back;
public:
//Queue<T>();
void add(T t);
void remove();
void remove(std::string title);
};
#include "Queue.h"
//template <class T>
//Queue<T>::Queue(){
// back=nullptr;
//}
//TODO
// add an element t to the end of queue- implement using an existing LinkedList method.
template <class T>
void Queue<T>::add(T t){
}
//TODO
//remove an element from the front of the queue-implement using an existing LinkedList method
template <class T>
void Queue<T>::remove(){
//TODO
// if queue us empty
// throw new std::string("NULL POINTER EXCEPTION QUEUE IS EMPTY n");
}
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
void populateRequests(Queue<Request>& q);
void populateSongDataBase(LinkedList<Song> &list);
void processQueue(LinkedList<Song> &list,Queue<Request>& q);
void processRequest(std::string action, std::string title,std::string singer,int chartPos);
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"*************************************n";
list.printList(); //
std::cout<<"*************************************n";
populateRequests(q); // fill the request q
std::cout<<"n";
std::cout<<"---------------PRINTING QUEUE-------------------n";
q.printList();
std::cout<<"------------------------------------n";
processQueue(list,q); // process the requests
std::cout<<"*************************************n";
list.printList();
std::cout<<"*************************************n";
}
//GIVEN
//Requires an empty linked list
//Effects fills the list with request by reading from the RequestData.txt
//Modifies the queue by filling it
void populateRequests(Queue<Request> &q){
}
//GIVEN
std::string playSong(LinkedList<Song>&list, Song s){
if (list.get(s)>=0){
return "PLAYING :"+ s.toString()+"n";
}
else{
return "SONG NOT FOUNDn";
}
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
std::cout<<"PLAYING TOP TEN SONG __________n";
list.print(10);
;
}
//Requires filled Song Database, a Song to add. The chart position given in the song is where it
will get added. Note this is a Song that is not supposed to exist in database.
//Effects adds the song from its original chart position
//Modifies the Song database. Adjust chart position of all Songs affected by this addition- this
adjustment is done in insert method using adjustPosition method. If the Process Queue adds a
Song that already is in the database, then a duplicate entry can occur.
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
/* Use this code
if (found>=0) {std::cout<<"ADDED THIS SONG "<<found+1<<" " ;list.printSong(found+1);}
else std::cout<<"SORRY CANNOT FIND SONG n";
*/
}
//TODO
//Requires filled Song Database, a Song to remove
//Effects if found, removes the song from its original .
Doublylinklist
This document presents information on doubly linked lists including their representation, initialization, node creation, and various operations like insertion, deletion, and traversal. It discusses inserting and deleting nodes at the beginning or end of the list, as well as inserting before or after a specified node. Code examples are provided for initializing a doubly linked list and performing each operation.
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
in C++ , Design a linked list class named IntegerList to hold a seri.pdf
in C++ , Design a linked list class named IntegerList to hold a series of integers. The class must
have public member functions for appending , inserting, deleting and displaying nodes. The
append function must append a node to the end of the list. The insert function must insert node in
ascending order. The delete function must delete the node with the given value. The display
function should display the list from head to tail. The IntegerList class should also have a
destructor that destroys the list and release memory. The list node must be declared as a structure
using keyword struct. This structure is a private member of IntegerList. You should also store the
head of the list as a private member.
Write a test program to test the implementation your IntegerList class works properly.
Solution
Here is the code for the above scenario:
#include
using namespace std;
struct ListNode
{
float value;
ListNode *next;
};
ListNode *head;
class LinkedList
{
public:
int insertNode(float num);
int appendNode(float num);
void deleteNode(float num);
void destroyList();
void displayList();
LinkedList(void) {head = NULL;}
~LinkedList(void) {destroyList();}
};
int LinkedList::appendNode(float num)
{
ListNode *newNode, *nodePtr = head;
newNode = new ListNode;
if(newNode == NULL)
{
cout << \"Error allocating memory for new list member!\ \";
return 1;
}
newNode->value = num;
newNode->next = NULL;
if(head == NULL)
{
cout << \"List was empty - \" << newNode->value;
cout << \" is part of list\'s first node.\ \";
head = newNode;
}
else
{
while(nodePtr->next != NULL)
nodePtr = nodePtr->next;
nodePtr->next = newNode;
}
return 0;
}
int LinkedList::insertNode(float num)
{
struct ListNode *newNode, *nodePtr = head, *prevNodePtr = NULL;
newNode = new ListNode;
if(newNode == NULL)
{
cout << \"Error allocating memory for new list member!\ \";
return 1;
}
newNode->value = num;
newNode->next = NULL;
if(head==NULL) {
cout << \"List was empty - \" << newNode->value;
cout << \" is part of list\'s first node.\ \";
head = newNode;
}
else
{
while((nodePtr != NULL) && (nodePtr->value < num)) {
prevNodePtr = nodePtr;
nodePtr = nodePtr->next;
}
if(prevNodePtr==NULL)
newNode->next = head;
else
newNode->next = nodePtr; prevNodePtr->next = newNode;
}
return 0;
}
void LinkedList::deleteNode(float num)
{
struct ListNode *nodePtr = head, *prevNodePtr = NULL;
if(head==NULL) {
cout << \"The list was empty!\ \";
return;
}
if(head->value == num) {
head = nodePtr->next;
delete [] nodePtr;
}
else
{
while((nodePtr!= NULL)&&(nodePtr->value != num)) {
prevNodePtr = nodePtr;
nodePtr = nodePtr->next;
}
if(nodePtr==NULL)
cout << \"The value \" << num << \" is not in this list!\ \";
else {
prevNodePtr->next = nodePtr->next;
delete [] nodePtr;
}
}
}
void LinkedList::destroyList()
{
struct ListNode *nodePtr = head, *nextNode = nodePtr;
if(head==NULL) {
cout << \"The list is empty!\ \";
return;
}
while (nodePtr != NULL) {
nextNode = nodePtr->next;
delete [] nodePtr;
nodePtr = nextNode;
}
}
void LinkedList.
Modify this code to change the underlying data structure to .pdf
Modify this code to change the underlying data structure to a double ended doubly-linked list. Data
records should be added to the end of the main array (the database) and three double ended
doubly linked lists should be maintained ; one each for the ID, LastName and FirstName. The
linked lists should (of course) be maintained in order You MUST use the driver program I have
provided , and make some additions. Remember, you should NOT be permitted to add a record
with a duplicate index number. You MUST implement all methods as I have indicated. Printing out
the data in forward order should use the "next" link in each node, printing out in reverse order
should employ the "prev" link.
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
public class DataBase {
private DataBaseArray dbArr;
private IndexArray firstIA, lastIA, IDIA;
private DeleteStack deleteStack;
private Scanner scan;
private String nld = "n-----------------------------n";
private String dnl = "-----------------------------n";
//Default Constructor
public DataBase() {
this.dbArr = new DataBaseArray(100);
this.firstIA = new IndexArray(100, false);
this.lastIA = new IndexArray(100, false);
this.IDIA = new IndexArray(100, true);
this.deleteStack = new DeleteStack(100);
readInDataFromFile();
scan = new Scanner(System.in);
}
//Constructor for custom size
public DataBase(int maxSize) {
this.dbArr = new DataBaseArray(maxSize);
this.firstIA = new IndexArray(maxSize, false);
this.lastIA = new IndexArray(maxSize, false);
this.IDIA = new IndexArray(maxSize, true);
this.deleteStack = new DeleteStack(maxSize);
readInDataFromFile();
scan = new Scanner(System.in);
}
//Read in the initial records
public void readInDataFromFile() {
File dbData = new File("dbData.txt");
Scanner scan = new Scanner(System.in); //Have to initialize to something for compilation
try {
scan = new Scanner(dbData);
} catch (FileNotFoundException e) {
e.printStackTrace();
}
String ID = "";
String fname = "";
String lname = "";
String[] values;
while(scan.hasNextLine()) {
values = scan.nextLine().split(",");
lname = values[0];
fname = values[1];
ID = values[2];
this.insertIt(ID, fname, lname);
}
}
//Ask user to specify ID, delete that record
public void deleteIt() {
String ID = "";
System.out.println("nDELETING" + nld);
System.out.println("Please enter the ID of the record to be deleted: ");
ID = this.scan.nextLine();
if (this.IDIA.searchByKey(ID) == -1) {
System.out.println(dnl + "Record not found, please try again." + nld);
return;
}
this.delete(ID);
System.out.println(dnl + "Record successfully deleted" + nld);
}
//Ask user to specify ID, return data of that record
public void findIt() {
String ID = "";
System.out.println("nFINDING" + nld);
System.out.println("Please enter the ID of the record to be found: ");
ID = this.scan.nextLine();
int iaIndexOfRecord = this.IDIA.searchByKey(ID);
if (iaIndexOfRecord == -1) {
System.out.println(dnl + "Record not found, please try again." + nld);
return.
Please need help on following program using c++ language. Please inc.pdf
Please need help on following program using c++ language. Please include all header files and
main file with their own title.
Extend the class linkedListType by adding the following operations:
Write a function that returns the info of the kth element of the linked list. If no such element
exists, terminate the program.
Write a function that deletes the kth element of the linked list. If no such element exists,
terminate the program.
Provide the definitions of these functions in the class linkedListType. Also, write a program to
test these functions. (Use either the class unorderedLinkedList or the
class orderedLinkedList to test your function.)
Solution
C++ Code for the given problem is below.....
.....................................................
/*
* C++ Program to Implement Singly Linked List
*/
#include
#include
#include
//using namespace std;
/*
* Node Declaration
*/
typedef struct nodetype
{
int info;
nodetype *next ;
} node;
/*
* Class Declaration
*/
class linkedListType
{
public:
void insfrombeg( node **head, int);
void delfromkth(node **head,int);
void findthekthnode(node *head,int);
void traverse(node *head);
int item,ch,kth;
node *ptr,*head,*temp;
};
/*
* Main :contains menu
*/
void main()
{
int item,ch,kth;
node *ptr,*head,*temp;
linkedListType s1;
clrscr();
while (1)
{
while(1)
{
cout<<\"PRESS (1) FOR INSERT INTO LIST\"<>ch;
switch(ch)
{
case 1:
cout<<\"ENTER THE VALUE \"<>item;
s1.insfrombeg(&head,item);
break;
case 2:
s1.traverse(head);
break;
case 3:
cout<<\"ENTER THE Kth Element which you want\'s to delete\"<>kth;
s1.delfromkth(&head,kth);
break;
case 4:
cout<<\"ENTER THE Kth Element which you want\'s to search \ \"<>kth;
s1.findthekthnode(head,kth);
break;
case 5:
exit(1);
}
}
// getch();
}
}
/*
* Inserting element in beginning
*/
void linkedListType::insfrombeg(node **head,int item)
{
temp= ( node * ) malloc (sizeof( node ));
temp->info= item;
temp->next= NULL;
if(*head == NULL)
{
temp->next= *head;
*head= temp;
}
else
{
temp->next= *head;
*head= temp;
}
}
/*
* Delete element at a given position
*/
void linkedListType::delfromkth(node **head,int kth)
{ node* temp1=*head,*temp2;
if(*head ==NULL)
{
cout<<\"LINK LIST IS EMPTY\ \"<next;
free(temp);
}
else
for(int j=0;jnext;
temp2= temp1->next;
temp1->next=temp2->next;
free(temp2);
}
/*
* Searching an element
*/
void linkedListType::findthekthnode(node *head,int kth)
{
ptr=head;
int i=1;
while((ptr!=NULL))
{
if(i==kth)
{
cout<<\"\ The Element at\"<< kth<< \"position with value is \\t
\"<info<info<next;
i++;
}
}
}
/*
* Traverse Link List
*/
void linkedListType::traverse(node *head)
{
ptr = head;
while((ptr->next)->next!=NULL)
{
cout<info<<\"\\t\";
ptr=ptr->next;
}
cout<
#include
#include
typedef struct nodetype
{
int info;
nodetype *next ;
} node;
int item,ch,kth,total=1;
node *ptr,*head,*temp;
void insfrombeg( node **head, int);
void delfromkth(node **head,int);
void findthekthnode(node *head,int);
void traverse(node *head);
void main()
{
clrscr();
while(1)
{
printf(\"PRESS .
Similar to Qestion Please add pre-condition, post-conditions and descriptions .pdf (20)
Complete the provided partial C++ Linked List program. Main.cpp is g.pdf
Complete the provided partial C++ Linked List program. Main.cpp is g.pdf
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a pro.pdf
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program an.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
maincpp Build and procees a sorted linked list of Patie.pdf
maincpp Build and procees a sorted linked list of Patie.pdf
Please solve the TODO parts include LinkedListcpph tem.pdf
Please solve the TODO parts include LinkedListcpph tem.pdf
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
in C++ , Design a linked list class named IntegerList to hold a seri.pdf
in C++ , Design a linked list class named IntegerList to hold a seri.pdf
Modify this code to change the underlying data structure to .pdf
Modify this code to change the underlying data structure to .pdf
Please need help on following program using c++ language. Please inc.pdf
Please need help on following program using c++ language. Please inc.pdf
More from arihantmobileselepun
How are the epimysium and tendons relatedA. The epimysium surroun.pdf
How are the epimysium and tendons related?
A. The epimysium surrounds the tendon.
B. Tendons surround the epimysium.
C. Tendons and epimysium both surround the end of the muscle.
D. The tendon is a continuation of the epimysium.
Solution
Answer:
D. The tendon is a continuation of the epimysium.
Explanation:
At the ends of a muscle, the fibers of the Epimysium may form a cable-like tendon or a sheet-
like aponeurosis..
How does DNA differ from RNAA. RNA uses only purinesB. RNA uses.pdf
How does DNA differ from RNA?
A. RNA uses only purines
B. RNA uses a different five-carbon sugar
C. RNA has a contains different sized phosphate groups
D. RNA has multiple bases attached to the sugar
Solution
B. RNA uses a different five-carbon sugar. RNA has the ribose pentose; whereas in DNA, the
pentose is deoxyribose..
Gerard throws a discus distances of 10 meters, 14.5 meters, 14.8 met.pdf
Gerard throws a discus distances of 10 meters, 14.5 meters, 14.8 meters, 16.7 meters, and 15.4
meters. On his last attempt he faults, which counts as 0 meters. What is his average throwing
distance?
A. 11.9 meters
B. 12.8 meters
C. 13.78 meters
D. 14.28 meters
Solution
A. To find the average, add the numbers and divide by the number of numbers. In this problem
add 10, 14.5, 14.8, 16.7, 15.4, and 0 to get 71.4. Divide this by 6.
71.4/6 = 11.9.
For Printing and personal use ONLY. DO NOT Hand in this copy of the a.pdf
For Printing and personal use ONLY. DO NOT Hand in this copy of the assignment. Only
responses submitted to the corresponding D2L quiz will be graded. The D2L version is exactly
like this document. Membrane proteins are proteins that are suspended within the lipid bilayer of
a membrane. They are held in place because some R-groups of the protein interact with the
phosphate heads of the phospholipids of the membrane, while other R-groups of the protein
interact with the hydrocarbon tails of the phospholipids of the membrane. From the amino acids
shown below, which one likely has an R-group that interacts with the phopholipid tails? If a cell
has some salt inside it but lacks ion channels, and the cell is put into a beaker of pure water, what
will happen?
Solution
Leucine (green color) is most likely to be part of the protein that interact with the hydrocarbon
chain of phospholipid in the membrane (since it is hydrophobic amino acid).
Find and provide a link to a multi-year capital plan from any Illino.pdf
Find and provide a link to a multi-year capital plan from any Illinois municipality. Discuss the
presentation of the plan (i.e. - is there detail about specific projects, funding sources, etc) and
how you think it could be improved.
Solution
The Link can\'t be provided so you can find it in the document centre of the village of the round
lake beach and the multi year capital plan is for the years from 2015- 2024.
The plan is presented in detail proving the names of the specific projects that would be
undertaken by the village and all the ways in which they will be collecting the funds needed. The
plan talks about the following specific projects:
The funding is alot dependent upon the taxes from the people inhabiting the place and a very
small amount has been estimated as allocations from outside. The plan is highly unrealistic as
there may be instances where the people residing the place may not choose to pay so much or
simply not buy the bonds they are expecting to issue..
A geneticist is working with a new bacteriophage called phage Y3 that.pdf
A geneticist is working with a new bacteriophage called phage Y3 that infects E. coli. He has
isolated eight mutant phages that fail to produce plaques when grown on E. coli strain K. To
determine whether these mutations occur at the same functional gene, he simultaneously infects
E. coli K with paired combination of the mutants and looks to see whether plaques are formed.
He obtains the following results. (A plus sign means that plaques were formed on E. coll K; a
minus sign means that no plaques were formed on E. coli K.) To how many functional genes
(cistrons) do these mutations belong? 5 1 8 2 7 3
Solution
Answer: Correct answer: 3
Reason: The geneticist has conducted the transformation experiment in which “trans” portion of
the cis–trans test to determine the complementation between the different phage mutants infected
with E. coli K cells. Finally, these cells were looked whether the plaques are generated in the
plates. It can be seen in the above results table, in which plus sign means that plaques were
formed due to complimentaion in 3 mutants (5, 6 & 8) have meticulously specific defects in the
same functional so that on E. coli K; a minus sign means that no plaques. Therefore, it can be
concluded that complementation can happen when the mutations of the different phages come
together in the sample as part of transformation.
Assume that the four living species in the figure below evolved from.pdf
Assume that the four living species in the figure below evolved from their common ancestor
without convergence or reversal.
1. Reconstruct their evolutionary relationships and label the character transitions. Show diagram.
2. Which evolved first: red eyes (living species 3) or fin stripes? Explain your answer.
***I have the answer but I don\'t know how we got it. I\'ve seen some incorrect/incomplete
answers here and that wasn\'t helpful. Please explain you answer for BOTH parts and show
diagram. If you\'re not sure don\'t answer! Thanks!*** Common ancestor Living species
Solution
a)the transition is as follows
common ancestor->Panderichthys,->Tiktaalik with the fins->tetrapods with legs and wings-
>amphibian
b)The eyes came first because the fish first has a body with eyes and then it has fins to swim.The
fins stripes increase with type into long wings and it can swim more and more.The eye is to see
the direction to swim.
Declining BalanceThe cost of the asset $10,000.00 The salvage v.pdf
Declining Balance
The cost of the asset: $10,000.00
The salvage value: $800.00
The life of the asset: 4 years
Calculate the Depreciation Expense to the Nearest One Dollar at End of Year 2.
Solution
Since No depreciation rate is given it is assumed theat depreciation is calclucated based on
double decling balance method
Hence depreciation Rate =1/4*2 =50%
Depreciation Exxpense at year 2 is $3750Carrying Value
at the beginningDepreciationCarrying value at the EndYear 11000025007500Year
2750037503750.
Create a java project that - Draw a circle with three random init.pdf
Create a java project that:
- Draw a circle with three random initial points on the circle.
- Link the points to form a triangle.
- Print the angles values in the triangle.
- Use the mouse to drag a point along the perimeter of the circle. As you drag it, the triangle and
angles are redisplayed dynamically.
Here is the formula to compute angles:
A = acos((a * a - b * b - c * c) / (-2 * b * c))
B = acos((b * b - a * a - c * c) / (-2 * a * c))
C = acos((c * c - b * b - a * a) / (-2 * a * b))
Solution
@Suppresswarnings(\"WeakerAccess\")
public class DragPoints extends Application {
@Override
public void start(Stage primaryStage) {
final PointPane pane = new PointPane(640, 480);
pane.setStyle(\"-fx-background-color: wheat;\");
Label label = new Label(\"Click and drag the points.\");
BorderPane borderPane = new BorderPane(pane);
BorderPane.setAlignment(label, Pos.CENTER);
label.setPadding(new Insets(5));
borderPane.setBottom(label);
Scene scene = new Scene(borderPane);
primaryStage.setTitle(\"Exercise15_21\");
primaryStage.setScene(scene);
primaryStage.show();
}
private class PointPane extends Pane {
final Circle circle = new Circle();
final Vertex[] v = new Vertex[3];
final int strokeWidth = 2;
final Color circleStroke = Color.GRAY, legStroke = Color.BLACK;
@SuppressWarnings(\"SameParameterValue\")
PointPane(double w, double h) {
this.setPrefSize(w, h);
this.setWidth(w);
this.setHeight(h);
circle.setStroke(circleStroke);
circle.setFill(Color.TRANSPARENT);
circle.setStrokeWidth(strokeWidth);
circle.radiusProperty().bind(this.heightProperty().multiply(0.4));
circle.centerXProperty().bind(this.widthProperty().divide(2));
circle.centerYProperty().bind(this.heightProperty().divide(2));
this.getChildren().add(circle);
for (int i = 0; i < v.length; i++) {
v[i] = new Vertex(circle, 2 * Math.PI / v.length * (i + Math.random()));
v[i].radiusProperty().bind(circle.radiusProperty().divide(10));
v[i].setPosition();
v[i].setStroke(new Color(i == 0 ? 1 : 0, i == 1 ? 1 : 0, i == 2 ? 1 : 0, 1));
v[i].setFill(Color.TRANSPARENT);
v[i].setStrokeWidth(strokeWidth);
this.getChildren().add(v[i]);
v[i].setOnMouseDragged(new EventHandler() {
@Override
public void handle(MouseEvent event) {
int i;
for (i = 0; i < v.length; i++)
if (v[i] == event.getSource())
break;
v[i].setAngle(event.getX(), event.getY());
moveUpdate((Vertex) event.getSource());
}
});
}
for (int i = 0; i < v.length; i++) {
int j = i + 1 < v.length ? i + 1 : 0;
int k = j + 1 < v.length ? j + 1 : 0;
v[i].bindLeg(v[j], v[k]);
v[i].leg.setStroke(legStroke);
v[i].leg.setStrokeWidth(strokeWidth);
this.getChildren().add(v[i].leg);
this.getChildren().add(v[i].text);
}
for(DoubleProperty p: new DoubleProperty[]
{circle.radiusProperty(), circle.centerXProperty(), circle.centerYProperty()})
p.addListener(new ResizeListener());
moveUpdate(v[0]);
}
void moveUpdate(Vertex vert) {
vert.setPosition();
double[] legLength = new double[3];
for (int i = 0; i < v.length; i++)
legLength[i] = v[i].getLegLength();
for (int i = .
aphase The spindle contracts and the sister chromatids are separated.pdf
aphase: The spindle contracts and the sister chromatids are separated at the centromere Once the
sister for each replicated chromosome have separated, each is now called in the cell an
unreplicated chromosome. It is at this point t chromosome num Telophase: Telophase reverse.
List the events below that happen in is essentially prophase in telophase SIMULATE CELL
DIVISION MITOSIS Using pop beads and magnetic centromeres, create 4 chromosomes as
follows: Red 6 pop beads on each side of the centromere Yellow: Same as Red. Blue 5 pop beads
on one sided of the centromere, 3 pop beads on the other side Green: Same as Blue. Work
through the phases of cell division, beginning at G1, with 4 unreplicated chromosomes
Remember that we can not see chromosomes during interphase, but this can not be modeled in
this lab. It is important to note what happens during the S phase when you do the simulation
Chromosome count Use the adjective \"unreplicated\" or \"replicated\" with your count G1: rom
DS ones S: osomes As best as you are able, and without looking at the descriptions above or
your text, describe what is happening in each phase of mitosis as you simulate the process. Avoid
using pronouns (it and they). Speak the language of genetics as you simulate mitosis. Help your
lab partner if she and provide feedback with the language. Chromosome counts and description
(replicated or unreplicated) in each phase of mitosis: Prophase: mm Somes Metaphase 1,-L
Chromosome Anaphase Telophase: What event occurs after Telophase to complete the process
of mitosis? What C4 Kenesis mitosis has been completed? is the chromosome count in each cell
after Summarizing Mitosis 1 parent cell produces 2 essentially identical daughter cells. Mitosis
separates sister chromatids.
Solution
G1: 4 unreplicated chromosomes (singlet chromosomes)
S: 4 replicated chromosomes (doublet chromosomes)
G2: 4 replicated chromosomes (doublet chromosomes)
Prophase: 4 replicated chromosomes
Metaphase: 4 replicated chromosomes arranged on metaphasic plate.
Anaphase: 8 unreplicated (singlet) chromosomes (4 singlet chromosomes move toward one end,
while the other 4 singlet (unreplicated) chromosomes move to the opposite end.)
Telophase: 8 unreplicated chromosomes (4 unreplicated chromosomes in each of the two
dividing daughter cells)
cytokinesis occurs after telophase that completes mitosis
after mitosis, 2 daughter cells are formed. each daughter cell contains 4 unreplicated
chromosomes. (similar to parent cell at G1 phase).
A population of wild deer mice includes individuals with long or sho.pdf
A population of wild deer mice includes individuals with long or short hair. When two short
haird indviduals breed, one-third of the pups have long hair. How do you explain the unusual
phenotype ratio?
Solution
it can be autosomal inheritance where homozygous dominant is lethal.
consider short hair to be dominant S, long hair to be recessive s
so cross between two short haired can be
Ss X Ss
S s
S SS Ss
s Ss ss
1:2:1 ratio for SS:Ss:ss
but we considered homozygous dominant to be lethal, so SS are dead, therefore Ss:ss is 2:1 and
1/3rd population have long hair..
Who is it important that the lymphatic system operate separately f.pdf
Who is it important that the lymphatic system operate separately from the cardiovascular
system? Explain
Describe the relationship between the lymphatic vessels and blood vessels.
Who is it important that the lymphatic system operate separately from the cardiovascular
system? Explain
Describe the relationship between the lymphatic vessels and blood vessels.
Describe the relationship between the lymphatic vessels and blood vessels.
Solution
It is important that the lymphatic system operate separately from the cardiovascular system
becuase lymphatic system is a closed circulatory system that consists of lymph capillaries, lymph
vessels, and lymph nodes different to blood vessels. The lymph present in capillaries flows into
lymphatic vessels, which are presented deep or superficial but blood vessels are deep innervating
various parts of body to maintain pheripheral resistance & mean arterial blood pressure. Blood
flows through three types of blood vessels (arteries, capillaries and veins) distributed throughout
the body. Capillaries are the fine endings of blood vessels. These capillaries are responsible for
the exchange of respiratory gases, nutrients and waste products. The molecules move across the
capillaries through a process called “diffusion.” These lymph vessels combine to form lymphatic
trunks that empty into the large collecting vessels of lymphatic system called “thoracic duct and
right lymphatic duct.”
The lymphoid tissue is mostly composed of a reticular connective tissue (a type of loose
connective tissue). The fibres of the reticular network contain macrophages. A number of
lymphocytes from the postcapillary venule walls occupy this network and leave to the body
again. This ensures the lymphocytes to identify the infected sites at a faster rate.
Lymphatic system is a closed circulatory system that consists of lymph capillaries, lymph
vessels, and lymph nodes. Lymph is a tissue fluid, which is formed by the diffusion of
substances from blood capillaries into tissue spaces. The lymph present in capillaries flows into
lymphatic vessels, which are presented deep or superficial. These lymph vessels combine to form
lymphatic trunks that empty into the large collecting vessels of lymphatic system called “thoracic
duct and right lymphatic duct.”
It is important that the lymphatic system operate separately from the cardiovascular system due
to the follwoing reasons and exerts differentail effects of innate immune system. The lymph is
generated to produce defensive mechanisms via innate immunity include physical barriers,
phagocytes, immune surveillance,interferons, complement system, inflammation and fever.
1. Fluid recovery: Filtration of the fluid into the tissue spaces from the blood capillaries will
occur continuously. 85% of it will be absorbed by the blood capillaries. About 15% will be
remained unabsorbed. This unabsorbed portion of the fluid is about 2-4 litres of water and 1/4th
to 1/2th of plasma protein. If this water protein an.
Provide a full explanation to the below question.1. Summarize the .pdf
Provide a full explanation to the below question.
1. Summarize the 802.11 standard and describe the various flavors of the standard, its
architecture and how the standard is contributing to easing of congestion in cellular networks.
Solution
IEEE 802.11 is a standard that defines the physical and MAC layers of Wireless Local Area
Network (WLAN). Under this standard, the Mobile terminals (MTs) can communicate with a
Access Point (AP) in two modes. First mode is the Infrastructure Mode, in which the MTs
communicate with the APs which forward their data to the WLAN. Second mode is the Adhoc
mode, in which the MTs communicate directly with each other without the use of a AP. The
IEEE 802.11 has a very robust Medium Access Control (MAC) mechanism that helps in
alleviating te congestion in the LANs. The inherent working of MAC protocol employed by
802.11 standard is same as that of Carrier Sense Multiple Access/ Collision Aviodance
(CSMA/CA). However, in IEEE 802.11 the protocol is implemented in two different ways. First
way is called as the Distributed Coordination Function based Wireless MAC (DCFWMAC), and
the second way is Point Coordination Function based Wireless MAC (PCFWMAC).
In the DCFWMAC, every node tries to access the medium based on some fixed duration of time
defined in the standard. Normally there are three such time intervals defined based on which a
node attempts to access the channel and transmit its packets. The first interval is the Short Inter
frame Spacing (SIFS). It is the smallest duration of time between two frames and gives the node
higher priority for sending its data. Such a interval is employed only when the node has correctly
sent its data through the channel and the receiver node needs to send a Acknowlegement (ACK)
after waiting for SIFS period of time. The second most priority interval is PCF Inter Frame
Spacing (PIFS) used during Polling mechanism by the AP. Its duration is between SIFS and
DCF Inter frame Spacing (DIFS). The DIFS is the longest time duration and hence of least
priority, in which a AP has to wait between two successive channel accesses for the given
duration. Once the channel is sensed idle, the AP waits for DIFS period of time to transmit data
through the channel. If the channel is sensed busy, then it backs off for a period of time based on
the minimum and maximum value of a contention window. During the back off period, if the
node senses the channel as busy, then it freezes the backoff counter and starts the backoff(with
the remaining time left) once the channel is idle. In this manner, the nodes which have waited
longer get higher priority over others which accessing the channel. Once the node sends the data
after accessing the channel, the receiver waits for SIFS duration of time to finally send the
acknowledgement to the sender. In order to tackle the hidden terminal problem, the DCFWMAC
employs an additional mechanism called as the RTS-CTS mechanism, in which any node that
wants to transmit.
Write a program to generate the entire calendar for one year. The pr.pdf
Write a program to generate the entire calendar for one year. The program must get two values
from the user: (1) the year and (2) the day of the week for January 1st of that year. The year,
which should be positive, is needed to check for and handle leap years1. The day of the week for
January 1st is needed so that you know where to start the calendar. The user should enter 0 for
Sunday, 1 for Monday, ... or 6 for Saturday. As always, you need to validate the user\'s input. To
actually print the calendar, you must use a single method that prints out the calendar for one
month and then call this function 12 times from main(), once for each month in the year. To
check for a leap year you will need to write another method that takes the year as a parameter
and returns true if it’s a leap year, or false otherwise. Stubs (i.e. method signatures without any
code) for both of these methods have been provided for you.
The calendar should be printed in the form below. In this example, January starts on a Saturday
(day 6). Note that February starts on a Tuesday in this example because January ended on a
Monday.
January
1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 2829
30 31
February
1 2 3 4 5
6 7 8 9 10 11 12 ...
The format he gave us is as follows:
public class PA6a {
/**
* Error to output if year is not positive
*/
static final String E_YEAR = \"The year must be positive!\";
/**
* Error to output if the day is not between 0 and 6
*/
static final String E_DAY = \"The day of January 1st must be between 0 and 6!\";
/**
* Determines if an input is a leap year
*
* @param year year in question
* @ereturn true if a leap year
*/
public static boolean isLeapYear(int year) {
return false; // TODO: replace with your code
}
/**
* Outputs a month to the console
*
* @param month title
* @param startDay 0=Sunday ... 6=Saturday
* @param numDays number of days in the month
* @return day of the week of the last day of the month
*/
public static int printMonth(String month, int startDay, int numDays) {
return 0; // TODO: replace with your code
}
/**
* Program execution point:
* input year, day of the week (0-6) of january 1
* output calendar for that year
*
* @param args command-line arguments (ignored)
*/
public static void main(String[] args) {
// TODO: write your code here
}
I am confused especially with the print month method, help is greatly appreciated.
Solution
package org.students;
import java.util.Scanner;
import com.sun.org.apache.bcel.internal.generic.IUSHR;
public class Calander {
//declaring static variables
static final String E_YEAR = \"The year must be positive!\";
static final String E_DAY = \"The day of January 1st must be between 0 and 6!\";
public static void main(String[] args) {
//Declaring variables
int getFirstDay;
int year;
Scanner scanner = new Scanner(System.in);
//This while loop continue to execute until user enters valid year
while (true) {
//Getting the year entered by the user
System.out.print(\"Enter the year:.
Write the interval notation for the set of numbers graphed. Solu.pdf
Write the interval notation for the set of numbers graphed.
Solution
The open circle represents that the value is not included in the interval while a solid (filled) circle
represents that the value is included in the interval.
So, we can see that there is open circle for (-2) and closed for (5).
Hence the required interval is (-2,5]..
Hyenas are diploid organisms, and their gametes contain 20 chromosome.pdf
Hyenas are diploid organisms, and their gametes contain 20 chromosomes. Fill in the blank in
each sentences using the terms below. Each term may be used more than once or not at all.
When the somatic cells of a hyena are in interphase, the ploidy level is denoted as The ploidy
level of the hyena\'s gametes is denoted as The 2n number of a hyena is 40 20 1n 80 2n
Solution
When the somatic cells of hyena in interphase = diploid [2n] because they are not divided and
tend to divide by preparing enzymes and multiplying DNA.
The ploidy level of hyena is haploid or 1n because they are developed through meiosis process.
The 2n number of chromosomes of hyena is 40 because gametes are haploid so n=20 [as given]
and the 2n = 2x 20 = 40.
Why doesnt hemoglobin have any intermediate conformations between .pdf
Why doesn\'t hemoglobin have any intermediate conformations between R-state and T-state?
Solution
Answer:
X-ray crystallogarphy has determined two major conformations of hemoglobin- the T state
which is stabilized in the absence of oxygen and the R state which is relatively more stable in the
presence of oxygen.
The pair of identical dimers of Hemoglobin are linked by several ion pairs at the interface that
stabilize it in its deoxy-state. Many of these interactions are disrupted upon binding to oxygen
and new ones are formed.
There are intermediate conformations between T and R states, but the intermediate
conformations have intermediate binding affinities. Also, these transition states are
thermodynamically unfavourable and short lived. These states have been utilized in studying the
allosteric pathways of hemoglobin. The binding of the ligand destabilizes the T state and makes
it more likely to switch to the high-affinity oxygenated (oxy)-R state..
4. What is gyanandromorphy How does this happenSolutionAnswe.pdf
4. What is gyanandromorphy? How does this happen?
Solution
Answer : Gynandromorphy is a phenamenan in which there is an occurence of both male and
female charectorstics in a single individual (part of the body expresses as male charectors, where
as the other part express female charectors. Individuals with this phenotype are called
gynandromorphs.
It results due to the loss of an X chromosome in a particular cell during development through
mitosis.For instance, a cell with XY through mitosis produces XXYY upon duplication which in
turn divides to form XY cells. But in gynandromorphs, this cell divides into an X cell and an
XYY cells. Due to this the organism develops with both male and female charectors..
Which of the following requires the mitochondria to create contact po.pdf
Which of the following requires the mitochondria to create contact points with the ER? mt
fission mt fusion mt biogenesis of more mitochondria autophagy of mitochondria (Mitophagy)
apoptosis
Solution
Answer= The mitochondria requires the following to create a contact with ER is
mt fission - mitochondrial fission
Explaination= The mitochondria & RE are tubular organelles with a characteristic network
structure that facilitates the formation of interorganeller connections
The mito.& ER joins together at multiple contact sites to form specific domains called as
mitochondria ER associated membranes.
why nitrogen fixation is so importantSolutionNitrogen fixation.pdf
why nitrogen fixation is so important
Solution
Nitrogen fixation
It is characteristic and manufactured, is basic for all types of life since nitrogen is required to
biosynthesize fundamental building pieces of plants, creatures and other living things, e.g.,
nucleotides for DNA and RNA, the coenzyme nicotinamide adenine dinucleotide for its part in
digestion system (exchanging electrons amongst atoms), and amino acids for proteins. Along
these lines, as a major aspect of the nitrogen cycle, it is fundamental for horticulture and the
fabricate of compost. It is additionally, in a roundabout way, important to the make of every
concoction intensify that contain nitrogen, which incorporates explosives, most pharmaceuticals,
colors, and so on.
Nitrogen fixation : it happens normally in the dirt by nitrogen settling microscopic organisms
(for instance, Azotobacter partnered with a few plants, particularly vegetables). Some nitrogen-
settling microbes have cozy associations with plants, alluded to as harmonious nitrogen
obsession. Looser connections between nitrogen-settling microorganisms and plants are regularly
alluded to as cooperative or non-advantageous, as found in nitrogen obsession happening on rice
roots. It additionally happens actually noticeable all around by method for lightning.
All natural nitrogen fixation is finished by method for metalloenzymes called nitrogenases.
These catalysts contain press, frequently with a moment metal, generally molybdenum yet here
and there vanadium. Microorganisms that can settle nitrogen are prokaryotes (both microscopic
organisms and archaea, conveyed all through their particular Domains) called diazotrophs. Some
higher plants, and a few creatures (termites), have shaped affiliations (advantageous interaction)
with diazotrophs..
More from arihantmobileselepun (20)
How are the epimysium and tendons relatedA. The epimysium surroun.pdf
How are the epimysium and tendons relatedA. The epimysium surroun.pdf
How does DNA differ from RNAA. RNA uses only purinesB. RNA uses.pdf
How does DNA differ from RNAA. RNA uses only purinesB. RNA uses.pdf
Gerard throws a discus distances of 10 meters, 14.5 meters, 14.8 met.pdf
Gerard throws a discus distances of 10 meters, 14.5 meters, 14.8 met.pdf
For Printing and personal use ONLY. DO NOT Hand in this copy of the a.pdf
For Printing and personal use ONLY. DO NOT Hand in this copy of the a.pdf
Find and provide a link to a multi-year capital plan from any Illino.pdf
Find and provide a link to a multi-year capital plan from any Illino.pdf
A geneticist is working with a new bacteriophage called phage Y3 that.pdf
A geneticist is working with a new bacteriophage called phage Y3 that.pdf
Assume that the four living species in the figure below evolved from.pdf
Assume that the four living species in the figure below evolved from.pdf
Declining BalanceThe cost of the asset $10,000.00 The salvage v.pdf
Declining BalanceThe cost of the asset $10,000.00 The salvage v.pdf
Create a java project that - Draw a circle with three random init.pdf
Create a java project that - Draw a circle with three random init.pdf
aphase The spindle contracts and the sister chromatids are separated.pdf
aphase The spindle contracts and the sister chromatids are separated.pdf
A population of wild deer mice includes individuals with long or sho.pdf
A population of wild deer mice includes individuals with long or sho.pdf
Who is it important that the lymphatic system operate separately f.pdf
Who is it important that the lymphatic system operate separately f.pdf
Provide a full explanation to the below question.1. Summarize the .pdf
Provide a full explanation to the below question.1. Summarize the .pdf
Write a program to generate the entire calendar for one year. The pr.pdf
Write a program to generate the entire calendar for one year. The pr.pdf
Write the interval notation for the set of numbers graphed. Solu.pdf
Write the interval notation for the set of numbers graphed. Solu.pdf
Hyenas are diploid organisms, and their gametes contain 20 chromosome.pdf
Hyenas are diploid organisms, and their gametes contain 20 chromosome.pdf
Why doesnt hemoglobin have any intermediate conformations between .pdf
Why doesnt hemoglobin have any intermediate conformations between .pdf
4. What is gyanandromorphy How does this happenSolutionAnswe.pdf
4. What is gyanandromorphy How does this happenSolutionAnswe.pdf
Which of the following requires the mitochondria to create contact po.pdf
Which of the following requires the mitochondria to create contact po.pdf
why nitrogen fixation is so importantSolutionNitrogen fixation.pdf
why nitrogen fixation is so importantSolutionNitrogen fixation.pdf
Recently uploaded
How to Setup Warehouse & Location in Odoo 17 Inventory
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
Temple of Asclepius in Thrace. Excavation results
The temple and the sanctuary around were dedicated to Asklepios Zmidrenus. This name has been known since 1875 when an inscription dedicated to him was discovered in Rome. The inscription is dated in 227 AD and was left by soldiers originating from the city of Philippopolis (modern Plovdiv).
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingExcellence Foundation for South Sudan
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh
Bed Making ( Introduction, Purpose, Types, Articles, Scientific principles, N...
Topic : Bed making
Subject : Nursing Foundation
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Physical pharmaceutics notes for B.pharm students
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Aberdeen
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
Gender and Mental Health - Counselling and Family Therapy Applications and In...
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!
How to Make a Field Mandatory in Odoo 17
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
Hindi varnamala | hindi alphabet PPT.pdf
हिंदी वर्णमाला पीपीटी, hindi alphabet PPT presentation, hindi varnamala PPT, Hindi Varnamala pdf, हिंदी स्वर, हिंदी व्यंजन, sikhiye hindi varnmala, dr. mulla adam ali, hindi language and literature, hindi alphabet with drawing, hindi alphabet pdf, hindi varnamala for childrens, hindi language, hindi varnamala practice for kids, https://www.drmullaadamali.com
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
Solutons Maths Escape Room Spatial .pptx
Solutions of Puzzles of Mathematics Escape Room Game in Spatial.io
Recently uploaded (20)
How to Setup Warehouse & Location in Odoo 17 Inventory
How to Setup Warehouse & Location in Odoo 17 Inventory
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Bed Making ( Introduction, Purpose, Types, Articles, Scientific principles, N...
Bed Making ( Introduction, Purpose, Types, Articles, Scientific principles, N...
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
B. Ed Syllabus for babasaheb ambedkar education university.pdf
B. Ed Syllabus for babasaheb ambedkar education university.pdf
Qestion Please add pre-condition, post-conditions and descriptions .pdf
- 1. Qestion: Please add pre-condition, post-conditions and descriptions for each member function of the LINKED_LIST_CLASS. Answer with your new version of the program. #include using namespace std; class LIST_NODE { public: int data; // data element of node LIST_NODE *next; // pointer element of node }; class LINKED_LIST_CLASS { public: LINKED_LIST_CLASS(); // default constructor LINKED_LIST_CLASS(LINKED_LIST_CLASS &); // copy constructor ~LINKED_LIST_CLASS(); // destructor void Add(int); // mutator void Print(); // accessor LIST_NODE * Search(int); // accessor void Remove(int); // mutator bool Is_Empty(); // accessor private: LIST_NODE *front; // pointer to front of list }; LINKED_LIST_CLASS::LINKED_LIST_CLASS() { cout << endl << "The default constructor has been called. "; front = new LIST_NODE; front->next = 0; // initialize the next field to null front->data = -10000; } LINKED_LIST_CLASS::LINKED_LIST_CLASS(LINKED_LIST_CLASS & org) { cout << endl << "The copy constructor has been called. "; front = new LIST_NODE;
- 2. front->next = 0; front->data = -10000; LIST_NODE *p = org.front->next; LIST_NODE *back = 0; while(p!=0) { if (back == 0) { front->next = new LIST_NODE; back = front->next; back->next = 0; back->data = p->data; } else { back->next = new LIST_NODE; back = back->next; back->data = p->data; back->next = 0; } p=p->next; } } LINKED_LIST_CLASS::~LINKED_LIST_CLASS() { cout << endl << "The destructor has been called. "; while (front->next != 0) { LIST_NODE *p = front->next; front->next = front->next->next; delete p; } delete front; front = 0; } void LINKED_LIST_CLASS::Add(int item)
- 3. { LIST_NODE *p = new LIST_NODE; p->data = item; if (front->next== 0) // empty list { front->next = p; p->next = 0; } else // list has information and is not empty { p->next = front->next; front->next = p; } } void LINKED_LIST_CLASS::Print() { cout << endl; for(LIST_NODE *p = front->next; p != 0; p = p->next) { cout << p->data; if (p->next != 0) { cout << "-->"; } } cout<next; p!=0; p=p->next) { if (p->data == key) return p; } return 0; // key not found in list } void LINKED_LIST_CLASS::Remove(int key) { LIST_NODE *p = Search(key); if (Is_Empty())
- 4. { cout << key << " is not in the list. No removal performed! "; } else { LIST_NODE *q = front; while (q->next->data != key) { q = q->next; } q->next = p->next; // CRITICAL STEP!!!! delete p; } } bool LINKED_LIST_CLASS::Is_Empty() { return front->next == 0; } int main() { LINKED_LIST_CLASS L1; L1.Add(5); L1.Add(10); L1.Add(29); L1.Print(); LINKED_LIST_CLASS L2 = L1; L2.Print(); L1.Remove(10); L1.Print(); return 0; } Solution #include using namespace std;
- 5. class LIST_NODE { public: int data; // data element of node LIST_NODE *next; // pointer element of node }; class LINKED_LIST_CLASS { public: LINKED_LIST_CLASS(); // default constructor LINKED_LIST_CLASS(LINKED_LIST_CLASS &); // copy constructor ~LINKED_LIST_CLASS(); // destructor void Add(int); // mutator void Print(); // accessor LIST_NODE * Search(int); // accessor void Remove(int); // mutator bool Is_Empty(); // accessor private: LIST_NODE *front; // pointer to front of list }; LINKED_LIST_CLASS::LINKED_LIST_CLASS() { //Pre-condition : front should be null i.e. list should be empty if(front == 0) { cout << endl << "The default constructor has been called. "; front = new LIST_NODE; front->next = 0; // initialize the next field to null front->data = -10000; //Post-condition : front should not be null if(Is_Empty()) cout<<"Post-condition failed for default constructor"; }
- 6. } LINKED_LIST_CLASS::LINKED_LIST_CLASS(LINKED_LIST_CLASS & org) { //Pre condition : linked list should not be empty if(!org.Is_Empty()) { cout << endl << "The copy constructor has been called. "; front = new LIST_NODE; front->next = 0; front->data = -10000; LIST_NODE *p = org.front->next; LIST_NODE *back = 0; while(p!=0) { if (back == 0) { front->next = new LIST_NODE; back = front->next; back->next = 0; back->data = p->data; } else { back->next = new LIST_NODE; back = back->next; back->data = p->data; back->next = 0; } p=p->next; } //Post-condition: Linked list copied to should not be empty if(Is_Empty()) { cout<<"Copy constructor failed";
- 7. } } } LINKED_LIST_CLASS::~LINKED_LIST_CLASS() { if(front != 0) //front should be initialized for it to destroy { cout << endl << "The destructor has been called. "; while (front->next != 0) { LIST_NODE *p = front->next; front->next = front->next->next; delete p; } delete front; front = 0; if(front != 0) //front is not destroyed if it is not null { cout<< "Destructor failed"; } } } void LINKED_LIST_CLASS::Add(int item) { //Pre-condition: item is already added in linked list if(Search(item) == 0) { LIST_NODE *p = new LIST_NODE; p->data = item; if (front->next== 0) // empty list { front->next = p; p->next = 0;
- 8. } else // list has information and is not empty { p->next = front->next; front->next = p; } //Post-condition : item should be at the front of linked list if(front->next->data != item) cout<<"Add operation failed"<next; p != 0; p = p->next) { cout << p->data; if (p->next != 0) { cout << "-->"; } } cout<next != 0) { for(LIST_NODE *p = front->next; p!=0; p=p->next) { if (p->data == key) return p; } } return 0; // key not found in list } void LINKED_LIST_CLASS::Remove(int key) { //Pre-condition: Item should be present in list if(Search(key) != 0) { LIST_NODE *p = Search(key); if (Is_Empty()) { cout << key << " is not in the list. No removal performed! ";
- 9. } else { LIST_NODE *q = front; while (q->next->data != key) { q = q->next; } q->next = p->next; // CRITICAL STEP!!!! delete p; } //Post-condition: Item should not be present in array if(Search(key) != 0) cout<<"Remove failed"; } } bool LINKED_LIST_CLASS::Is_Empty() { return front->next == 0; } int main() { LINKED_LIST_CLASS L1; L1.Add(5); L1.Add(10); L1.Add(29); L1.Print(); LINKED_LIST_CLASS L2 = L1; L2.Print(); L1.Remove(10); L1.Print(); return 0; }