Node file code below#ifndef NODE_H#define NODE_H#include .pdf
0 likes2 views
Node file code below #ifndef NODE_H #define NODE_H #include using namespace std; // the node class Node{ public: int value; // Array of pointers to the next nodes (which may be located at various levels) // next[i] is the next link for level i // the size of this vector determines the number of levels that the current node is part of vector next; vector prev; // previous links for each level the node is part of Node(int val, int level){ value = val; next = vector(level+1, nullptr); // initialize array of pointers to nulls prev = vector(level+1, nullptr); // initialize array of pointers to nulls }; }; #endif SKIPLIST.H FILE CODE BELOW #include #include #include #include #include #include #include "Node.h" #ifndef SKIPLIST_H #define SKIPLIST_H using namespace std; class SkipList{ public: // Maximum allowed level index int MAXIMUM_ALLOWED_LEVEL_INDEX; // current maximum level amongst the inserted nodes int currentHighestLevelIndex; // the head node's next links are connected to the first node at every level Node *head; Node* tail; // last node at every level SkipList(int maxLevels){ MAXIMUM_ALLOWED_LEVEL_INDEX = maxLevels; // initially we have the bottom-most level only currentHighestLevelIndex = 0; // create the header node, value is irrelevant (as long as it doesn't match an inserted value - NO REPEATS), number of next links is important (initially this node is the first node at every level) head = new Node(INT_MIN, MAXIMUM_ALLOWED_LEVEL_INDEX); tail = new Node(INT_MAX, MAXIMUM_ALLOWED_LEVEL_INDEX); // last nodes at each level // connect head to tail at every level for(int i = 0; i <= MAXIMUM_ALLOWED_LEVEL_INDEX; i++){ head->next[i] = tail; // head's prev is null tail->prev[i] = head; // tail's next is null } } int RandomLevel(){ float probablity = (float)rand()/RAND_MAX; // flip a coin int lvl = 0; while (probablity < 0.5 && lvl < MAXIMUM_ALLOWED_LEVEL_INDEX){ lvl++; // landed heads so increase level by 1 probablity = (float)rand()/RAND_MAX; // flip a coin again } return lvl; } Node* CreateNode(int value, int level){ // create a new node with next links for every level that this node will be part of // it will use these links to connect to the next node at each level return new Node(value, level); } void InsertElement(int value){ Node *current = head; // start at head node vector update(MAXIMUM_ALLOWED_LEVEL_INDEX+1, nullptr); // this will hold the nodes that need updating at every level after the insert takes place for (int i = currentHighestLevelIndex; i >= 0; i--){ // start at the highest level and move down so that more nodes may be skipped // for level i, if value is to be inserted here then find out where (i.e. after which node) while (current->next[i] != nullptr && current->next[i]->value < value){ current = current->next[i]; } // found the node after which the value is to be placed at level i update[i] = current; // move down a level, if possible } // at level 0, where current is pointing to by the end of the preceding loop, move over.
1 of 11
Download to read offline
![Node file code below
#ifndef NODE_H
#define NODE_H
#include
using namespace std;
// the node
class Node{
public:
int value;
// Array of pointers to the next nodes (which may be located at various levels)
// next[i] is the next link for level i
// the size of this vector determines the number of levels that the current node is part of
vector next;
vector prev; // previous links for each level the node is part of
Node(int val, int level){
value = val;
next = vector(level+1, nullptr); // initialize array of pointers to nulls
prev = vector(level+1, nullptr); // initialize array of pointers to nulls
};
};
#endif
SKIPLIST.H FILE CODE BELOW
#include
#include
#include
#include
#include](https://image.slidesharecdn.com/nodefilecodebelowifndefnodehdefinenodehinclude-231008005105-f56c39ec/85/Node-file-code-below-ifndef-NODE_H-define-NODE_H-include-pdf-1-320.jpg)
![tail = new Node(INT_MAX, MAXIMUM_ALLOWED_LEVEL_INDEX); // last nodes at
each level
// connect head to tail at every level
for(int i = 0; i <= MAXIMUM_ALLOWED_LEVEL_INDEX; i++){
head->next[i] = tail; // head's prev is null
tail->prev[i] = head; // tail's next is null
}
}
int RandomLevel(){
float probablity = (float)rand()/RAND_MAX; // flip a coin
int lvl = 0;
while (probablity < 0.5 && lvl < MAXIMUM_ALLOWED_LEVEL_INDEX){
lvl++; // landed heads so increase level by 1
probablity = (float)rand()/RAND_MAX; // flip a coin again
}
return lvl;
}
Node* CreateNode(int value, int level){
// create a new node with next links for every level that this node will be part of
// it will use these links to connect to the next node at each level
return new Node(value, level);
}
void InsertElement(int value){
Node *current = head; // start at head node
vector update(MAXIMUM_ALLOWED_LEVEL_INDEX+1, nullptr); // this will hold the
nodes that need updating at every level after the insert takes place
for (int i = currentHighestLevelIndex; i >= 0; i--){ // start at the highest level and move
down so that more nodes may be skipped
// for level i, if value is to be inserted here then find out where (i.e. after which node)
while (current->next[i] != nullptr && current->next[i]->value < value){](https://image.slidesharecdn.com/nodefilecodebelowifndefnodehdefinenodehinclude-231008005105-f56c39ec/85/Node-file-code-below-ifndef-NODE_H-define-NODE_H-include-pdf-3-320.jpg)
![current = current->next[i];
}
// found the node after which the value is to be placed at level i
update[i] = current;
// move down a level, if possible
}
// at level 0, where current is pointing to by the end of the preceding loop, move over one
node to the right where the value is to be inserted to see if the value already exists there (NO
REPEATS allowed)
current = current->next[0];
if (current == nullptr || current->value != value){
int ranLevel = RandomLevel(); // choose a random level upto where the new node will be
placed (starting from level 0)
if (ranLevel > currentHighestLevelIndex){
// if random level for current node is higher than the current maximum level for
existing nodes; then set head as the node after which the new value is to be inserted for each
level over current maximum to the level chosen for new value to be inserted (update currently
contains nulls for these level(s)).
for (int i = currentHighestLevelIndex+1; i <= ranLevel; i++){
update[i] = head;
}
// also change the current maximum level for the existing nodes
currentHighestLevelIndex = ranLevel;
}
// create new node with next links for every level from ranLevel to zero
Node* n = CreateNode(value, ranLevel);
// placing new node in the correct place at every level
for (int i = 0; i<=ranLevel; i++){
// n connects as a new node between update[i] and update[i]->next[i]
n->next[i] = update[i]->next[i];](https://image.slidesharecdn.com/nodefilecodebelowifndefnodehdefinenodehinclude-231008005105-f56c39ec/85/Node-file-code-below-ifndef-NODE_H-define-NODE_H-include-pdf-4-320.jpg)
![n->prev[i] = update[i];
// update[i] connects to n (update[i] is the node before n)
update[i]->next[i] = n;
// n->next[i] (this was originally update[i]->next[i], the node that should be after n)
connects back to n
n->next[i]->prev[i] = n;
}
}
}
void Delete(int value){
// remove value from skip list (all levels) if it exists (output a message if it does not exist)
Node *current = head; // start at head node
vector update(MAXIMUM_ALLOWED_LEVEL_INDEX+1, nullptr); // this will hold the
nodes that need updating at every level after the delete takes place
for (int i = currentHighestLevelIndex; i >= 0; i--){ // start at the highest level and move
down so that more nodes may be skipped
// for level i, if value is to be deleted from here then find out where from (i.e. after which
node could it be)
while (current->next[i] != nullptr && current->next[i]->value < value){
current = current->next[i]; // moving right on level i
}
if(current->next[i] != nullptr && current->next[i]->value == value){
// found the node after which exists the target node (node that is to be deleted from
level i)
update[i] = current;
}
// move down a level, if possible
}
// at level 0, where current is pointing to by the end of the preceding loop, move over one
node to the right to see value exists there before we try to delete it
current = current->next[0];](https://image.slidesharecdn.com/nodefilecodebelowifndefnodehdefinenodehinclude-231008005105-f56c39ec/85/Node-file-code-below-ifndef-NODE_H-define-NODE_H-include-pdf-5-320.jpg)
![if (current != nullptr && current->value == value){
// value exists at level 0, so delete it from all levels where it is located.
for (int i = 0; i <= currentHighestLevelIndex; i++){
if(update[i]){ // first we ensure that value exists at level i (otherwise update[i] will be
null)
// update[i] connects to the node after current (current->next[i])
update[i]->next[i] = current->next[i];
// current->next[i] (the node that should be after update[i]) connects back to
update[i]
current->next[i]->prev[i] = update[i];
// disconnect current from level i - are these necessary?
current->next[i] = nullptr;
current->prev[i] = nullptr;
}
}
// delete current
delete current;
// update currentHighestLevelIndex if necessary
while (currentHighestLevelIndex >= 0 && head->next[currentHighestLevelIndex] ==
tail){
currentHighestLevelIndex--;
}
}
else{
// if update[0] is nullptr then preceding loop was unable to find value at level 0
cout << "Value " << value << " does not exist in the skip list.n";
}
}
bool Search(int value){
// TO BE COMPLETED
// search for value in skip list and return true if it exists; false otherwise](https://image.slidesharecdn.com/nodefilecodebelowifndefnodehdefinenodehinclude-231008005105-f56c39ec/85/Node-file-code-below-ifndef-NODE_H-define-NODE_H-include-pdf-6-320.jpg)
![Node *current = head; // start at head node
for (int i = currentHighestLevelIndex; i >= 0; i--){ // start at the highest level and move
down so that more nodes may be skipped
// for level i, keep moving right while values are less than what we are looking for (and if
it is possible to move any further right
while (current->next[i] != nullptr && current->next[i]->value < value){
current = current->next[i]; // moving right
}
if(current->next[i] != nullptr && current->next[i]->value == value){
return true; // found the value at level i
}
// move down a level, if possible
}
return false; // value not found, we are at level 0 and to the farthest right at level 0 (value
always exists at level 0 if in the list)
}
void ShowForward(){
cout << "Showing forward:n";
for (int i = currentHighestLevelIndex; i >= 0;i--){
Node *node = head->next[i];
cout << "Level " << i << ": ";
while (node != nullptr && node->next[i] != tail){
cout << node->value << " -> ";
node = node->next[i];
}
if(node){
cout << node->value << " .n";
}
else{
cout << " .n";
}
}
}](https://image.slidesharecdn.com/nodefilecodebelowifndefnodehdefinenodehinclude-231008005105-f56c39ec/85/Node-file-code-below-ifndef-NODE_H-define-NODE_H-include-pdf-7-320.jpg)
![void ShowBackward(){
cout << "Showing backward:n";
for (int i = currentHighestLevelIndex; i >= 0;i--){
Node *node = tail->prev[i];
cout << "Level " << i << ": ";
while (node != nullptr && node->prev[i] != head){
cout << node->value << " -> ";
node = node->prev[i];
}
if(node){
cout << node->value << " .n";
}
else{
cout << " .n";
}
}
}
};
#endif
PRIORITYQ file code below
#ifndef PRIORITYQ_H
#define PRIORITYQ_H
#include
#include
#include
#include
#include "Skiplist.h"
using namespace std;
class PriorityQ{
public:
Node *head;](https://image.slidesharecdn.com/nodefilecodebelowifndefnodehdefinenodehinclude-231008005105-f56c39ec/85/Node-file-code-below-ifndef-NODE_H-define-NODE_H-include-pdf-8-320.jpg)
![Node *tail;
int priority;
int maxlevel;
PriorityQ(int Level){
srand(time(0));
//priority = rand() % (Level-1);
maxlevel = Level-1;
head = new Node(INT_MIN, Level-1);
tail = new Node(INT_MAX, Level-1);
}
bool isEmpty() {
return head->next[0] == tail;
}
void enqueue(int data) {
priority = rand() % (maxlevel + 1);
//cout << "priority " << priority << endl;
Node *curr = head;
for (int i = maxlevel; i >= 0; i--) {
curr = head;
while (curr->next[i] != nullptr && curr->next[i]->value < data) {
curr = curr->next[i];
}
if (i <= priority) {
Node *newNode = new Node(data, i);
newNode->next[i] = curr->next[i];
curr->next[i] = newNode;
}
}
}
void dequeue(int value, int level) {
for (int i = level; i >= 0; i--) {
Node *curr = head->next[i];
while (curr->next[i] != nullptr && curr->value < value) {](https://image.slidesharecdn.com/nodefilecodebelowifndefnodehdefinenodehinclude-231008005105-f56c39ec/85/Node-file-code-below-ifndef-NODE_H-define-NODE_H-include-pdf-9-320.jpg)
![if(curr->value == value){
Node *temp = curr;
curr->prev[i]->next[i] = curr->next[i];
curr->next[i]->prev[i]=curr->prev[i];
curr = curr->next[i];
delete temp;
}
curr = curr->next[i];
}
}
}
void process() {
for (int i = maxlevel; i >= 0; i--) {
Node *curr = head;
cout << "Process " << i << ": ";
while (curr->next[i] != tail) {
cout << curr->next[i]->value << ", ";
dequeue(curr->next[i]->value, i);
curr = curr->next[i];
}
}
}
void show(){
for (int i = maxlevel; i >= 0;i--){
Node *node = head->next[i];
cout << "Level " << i << ": ";
while (node != nullptr && node->next[i] != tail){
cout << node->value << " -> ";
node = node->next[i];
}
if(node){
cout << node->value << " .n";
}
else{
cout << " .n";](https://image.slidesharecdn.com/nodefilecodebelowifndefnodehdefinenodehinclude-231008005105-f56c39ec/85/Node-file-code-below-ifndef-NODE_H-define-NODE_H-include-pdf-10-320.jpg)
Ad
Recommended
double Skiplist code below#include iostream#include vector.pdf
double Skiplist code below#include iostream#include vector.pdftxkev double Skiplist code below
#include
#include
#include
#include
#include
#include
#include "Node.h"
#ifndef SKIPLIST_H
#define SKIPLIST_H
using namespace std;
class SkipList{
public:
// Maximum number of levels allowed for this skip list
int MAXIMUM_ALLOWED_LEVELS;
// current maximum level amongst the inserted nodes
int level;
// the head node's next links are connected to the first node at every level
Node *head;
SkipList(int maxLevels){
MAXIMUM_ALLOWED_LEVELS = maxLevels;
// initially we have the bottom-most level only
level = 0;
// create the header node, value is irrelevant (as long as it doesn't match an inserted value -
NO REPEATS), number of next links is important (this node is connected to the first node at
every level)
head = new Node(INT_MIN, MAXIMUM_ALLOWED_LEVELS);
}
int RandomLevel(){
float probablity = (float)rand()/RAND_MAX; // flip a coin
int lvl = 0;
/*Olog(n) */while (probablity < 0.5 && lvl < MAXIMUM_ALLOWED_LEVELS){
lvl++; // landed heads so increase level by 1
probablity = (float)rand()/RAND_MAX; // flip a coin again
}
return lvl;
}
Node* CreateNode(int value, int level){
// create a new node with next links for every level that this node will be part of
// it will use these links to connect to the next node at each level
return new Node(value, level);
}
void InsertElement(int value)/*Olog(n) becuase all the functions in it are Olog(n) */{
/**
* THIS CODE HAS A BUG,
*
* ***********FIND THE BUG,
* *************EXPLAIN THE WHY THE BUG EXIST
* AND
* **********************SUGGEST A FIX *
*
*/
//w
Node *current = head; // start at head node at the toppest level
/*Olog(n)*/vector update(MAXIMUM_ALLOWED_LEVELS+1, nullptr); // this will hold
the nodes that need updating at every level after the insert takes place
/*BIG Olog(n)*/for (int i = level; i >= 0; i--){ //level is the current maximum level
// for level i, if value is to be inserted here then find out where (i.e. after which node)
/*O(1) constant */ while (current->next[i] != nullptr && current->next[i]->value <
value){ //the while loop is saying keep moving right until null or the current.value > value
current = current->next[i];
}
// found the node after which the value is to be placed at level i
update[i] = current;
}
//if
current = current->next[0]; // current moves bcoz we need to check if the value exists
if (current == nullptr || current->value != value){
/*Olog(n) */int ranLevel = RandomLevel(); // choose a random level upto where the new
node will be placed
if (ranLevel > level){
// if random level for current node is higher than the current maximum level for the
existing nodes then set updates for each level over current maximum to head (since there are no
nodes at these levels yet).
/*Olog(n)*/for (int i=level+1;i<=ranLevel;i++){
update[i] = head;
}
// also change the current maximum level for the existing nodes
level = ranLevel;
}
// create new node with next links for every level from ranLevel to zero
/*Olog(n) */Node* n = CreateNode(value, ranLevel);
// placi.
double linked list header file code#include iostream#include.pdf
double linked list header file code#include iostream#include.pdffacevenky This document contains C++ code for implementing a priority queue using a doubly linked skip list. It includes class definitions for a Node and SkipList that make up the skip list, and a PriorityQueue class that uses the skip list to store and retrieve elements based on priority. The main() function creates a PriorityQueue and SkipList, adds some sample elements, and calls the Process() method to iteratively remove and output elements by highest priority. However, the code is not fully implementing the Process() method and is not outputting the processed data as intended.
Double linked list header file below for FYI#include iostream.pdf
Double linked list header file below for FYI#include iostream.pdffacevenky Double linked list header file below for FYI
#include
#include
#include
#include
#ifndef DOUBLYSKIPLIST_H
#define DOUBLYSKIPLIST_H
using namespace std;
class Node {
public:
int value;
int level;
vector next;
vector prev;
Node(int val, int lvl) : value(val), level(lvl) {
next.resize(lvl + 1, nullptr);
prev.resize(lvl + 1, nullptr);
}
};
class SkipList {
public:
int level;
Node* head;
Node* tail;
int MAXIMUM_ALLOWED_LEVELS;
SkipList(int maxLevels) : MAXIMUM_ALLOWED_LEVELS(maxLevels), level(0) {
head = new Node(INT_MIN, MAXIMUM_ALLOWED_LEVELS);
tail = new Node(INT_MAX, MAXIMUM_ALLOWED_LEVELS);
for (int i = 0; i <= MAXIMUM_ALLOWED_LEVELS; i++) {
head->next[i] = tail;
tail->prev[i] = head;
}
}
int RandomLevel() {
float probability = (float)rand() / RAND_MAX;
int lvl = 0;
while (probability < 0.5 && lvl < MAXIMUM_ALLOWED_LEVELS) {
lvl++;
probability = (float)rand() / RAND_MAX;
}
return lvl;
}
Node* CreateNode(int value, int level) {
return new Node(value, level);
}
void InsertElement(int value) {
Node* current = head;
vector update(MAXIMUM_ALLOWED_LEVELS + 1, nullptr);
for (int i = level; i >= 0; i--) {
while (current->next[i]->value < value) {
current = current->next[i];
}
update[i] = current;
}
current = current->next[0];
if (current->value != value) {
int ranLevel = RandomLevel();
if (ranLevel > level) {
for (int i = level + 1; i <= ranLevel; i++) {
update[i] = head;
}
level = ranLevel;
}
Node* n = CreateNode(value, ranLevel);
for (int i = 0; i <= ranLevel; i++) {
n->next[i] = update[i]->next[i];
n->prev[i] = update[i];
update[i]->next[i]->prev[i] = n;
update[i]->next[i] = n;
}
}
}
void Delete(int value) {
if (!Search(value)) {
cout << value << " does not exist" << endl;
return;
}
Node* current = head;
vector update(MAXIMUM_ALLOWED_LEVELS + 1, nullptr);
for (int i = level; i >= 0; i--) {
while (current->next[i]->value < value) {
current = current->next[i];
}
update[i] = current;
}
current = current->next[0];
for (int i = 0; i <= level; i++) {
if (update[i]->next[i] == current) {
update[i]->next[i] = current->next[i];
current->next[i]->prev[i] = update[i];
}
}
delete current;
}
bool Search(int value) {
Node* current = head;
for (int i = level; i >= 0; i--) {
while (current->next[i]->value < value) {
current = current->next[i];
}
}
current = current->next[0];
return current->value == value;
}
void Show() {
for (int i = 0; i <= level; i++) {
Node* node = head->next[i];
cout << "Level " << i << ": ";
while (node != tail) {
cout << node->value << " -> ";
node = node->next[i];
}
cout << "Tail" << endl;
}
}
void ShowBackwards() {
Node* currTail = tail;
for (int i = 0; i <= level; i++) {
Node* node = currTail->prev[i];
cout << "Level " << i << ": ";
while (node != head) {
cout << node->value << " <- ";
node = node->prev[i];
}
cout << "Head" << endl;
}
}
};
#endif
PriorityQueue header file code below
#ifndef PRIORITYQ_H
#define PRIORITYQ_H
#include
#include
#include // for INT_MAX
#include // for rand()
#include
using namespace std;
class Node {
public:
.
the header file code for double link list#include iostream#.pdf
the header file code for double link list#include iostream#.pdffashination Here are a few things to check in your enqueue implementation:
- Make sure you are properly initializing the next and prev vectors in the Node constructor based on the priority.
- When finding the insertion point, you need to traverse all levels from MAXIMUM_ALLOWED_LEVELS down to 0, not just level 0.
- When linking in the new node, you need to link it in at all levels from 0 to the randomPriority level inclusive.
- Double check that your next and prev pointers are set correctly when linking the new node in (node->next[i] points to current->next[i], node->prev[i] points to current, etc.)
- Print out the values as
Write java program using linked list to get integer from user and.docx
Write java program using linked list to get integer from user and.docxajoy21 This document provides the code for a Java program that uses a linked list to count even and odd numbers entered by the user. The program defines a Node class to create nodes for the linked list. It also defines methods to push nodes onto the front of the list, segregate the even and odd nodes, and print the list. The main method tests the program by pushing sample integers onto a linked list, segregating the even and odd nodes, and printing the modified list.
C Homework Help
C Homework HelpProgramming Homework Help I am Andrew O. I am a C Homework Expert at programminghomeworkhelp.com. I hold a master’s in Programming from, the University of Southampton, UK. I have been helping students with their homework for the past 10 years. I solve homework related to C.
Visit programminghomeworkhelp.com or email [email protected].
You can also call on +1 678 648 4277 for any assistance with C Homework.
C Exam Help 
C Exam Help Programming Exam Help I am Gabriel C. I am a C Exam Expert at programmingexamhelp.com. I hold a PhD. in Business analyst of Information Technology, Montreal College of Information Technology, Canada. I have been helping students with their exams for the past 8 years. You can hire me to take your exam in C.
Visit programmingexamhelp.com or email [email protected]. You can also call on +1 678 648 4277 for any assistance with the C Exam.
Using the provided table interface table.h and the sample linked lis.pdf
Using the provided table interface table.h and the sample linked lis.pdfconnellalykshamesb60 Using the provided table interface table.h and the sample linked list code linkedList.c, complete
an implementation of the Table ADT. Make sure that you apply the concepts of design by
contract (DbC) to your implementation.
Once you have fully implemented the table, create a main.c file that implements a testing
framework for your table.
Your table implementation must ensure that values inserted are unique, and internally sorted
within a linked list.
table.h
linkedList.c
Solution
khsdg
#include
#include
typedef enum BOOL { false, true } bool;
// Linked list node definition
typedef struct Node node;
struct Node
{
int number;
node *next;
};
static node *top = NULL;
// used to track where we are for the list traversal methods
static node *traverseNode = NULL;
// \"destroy\" will deallocate all nodes in a linked list object
// and will set \"top\" to NULL.
void destroy()
{
node *curr = top;
node *temp = NULL;
while ( curr != NULL )
{
// flip order to see it blow up...
temp = curr;
curr = curr->next;
free( temp );
}
top = NULL;
}
// \"build\" will create an ordered linked list consisting
// of the first \"size\" even integers.
void build( int size )
{
node *newNode = NULL;
int i = 0;
// make sure we don\'t have a list yet
destroy();
for ( i=size ; i>0 ; i-- )
{
newNode = malloc( sizeof( node ) );
newNode->number = i*2;
newNode->next = top;
top = newNode;
}
}
// starts a list traversal by getting the data at top.
// returns false if top == NULL.
bool firstNode( int *item )
{
bool result = false;
if ( top )
{
*item = top->number;
traverseNode = top->next;
result = true;
}
return result;
}
// gets the data at the current traversal node and increments the traversal.
// returns false if we\'re at the end of the list.
bool nextNode( int *item )
{
bool result = false;
if ( traverseNode )
{
*item = traverseNode->number;
traverseNode = traverseNode->next;
result = true;
}
return result;
}
// \"print\" will output an object\'s entire linked list
// to the standard output device -- one \"number\" per line.
void print()
{
int value;
if ( firstNode( &value ) )
{
do
{
printf( \"%d\ \", value );
} while ( nextNode( &value ) );
}
}
int main( int argc, char *argv[] )
{
build( 10 );
print();
destroy();
build( 5 );
build( 20 );
print();
destroy();
return 0;
}.
In the class we extensively discussed a node class called IntNode in.pdf
In the class we extensively discussed a node class called IntNode in.pdfarjunstores123 In the class we extensively discussed a node class called IntNode in which each linked list node
contains an integer and each node is linked forward to the next element in the list. Implement a
node class called DoublyIntNode in which each node contains an integer number and each node
is linked not only forward to the next element in the list but also backward to the previous
element in the list. Your implementation of DoublyIntNode should adapt and implement all the
methods of IntNode including the following methods:
Constructor for DoublyIntNode
addNodeAfter, removeNodeAfter
getData, setData
getForeLink, setForeLink
getBackLink, setBackLink
listCopy
listCopyWithTail
listLength
listPart
listPosition
listSearch
IntNode and Node classes:
public class IntNode{
private int data;
private IntNode link;
// methods here
}
public class Node {
private E data;
private Node link;
// methods here
}
Solution
program
#include
using namespace std;
struct list
{
struct list *prev;
int data;
struct list *next;
}
*node = NULL, *first = NULL, *last = NULL, *node1 = NULL, *node2 = NULL;
class Dlist
{
public:
void insert_beg() {
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;
}
}
void insert_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;
}
}
void display() {
node = first;
cout << \"List of data in Linked list in Ascending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->next;
}
node = last;
cout << \"List of data in Linked list in Descending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->prev;
}
}
void del()
{
int count = 0, number, i;
node = node1 = node2 = first;
for(node = first; node != NULL; node = node->next)
cout << \"Enter value for the node:\" << endl;
count++;
display();
cout << count << \" nodes available here!\" << endl;
cout << \"Enter the node number which you want to delete:\" << endl;
cin >> number;
if(number != 1)
{
if(number < count && number > 0)
{
for(i = 2; i <= number; i++)
node = node->next;
for(i = 2; i <= number-1; i++)
node1 = node1->next;
for(i = 2; i <= number+1; i++)
node2 = node2->next;
node2->prev = node1;
node1->next = node2;
node->prev = NULL;
node->next = NULL;
node = NULL;
}
else if(number == count)
{
node = last;
last = node->prev;
last->next = NULL;
node = NULL;
}
else
cout << \"Invalid node.
take the following code and give details of what each line of code i.pdf
take the following code and give details of what each line of code i.pdffastechsrv take the following code and give details of what each line of code is doing
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<info<<\"->\";
temp = temp->next;
}
cout<<\"NULL\"<
Solution
ANSWER ::
ASSMUING THE TOTAL LINE IN CODE ARE 158*(INCLUDING COMMENTS)
SO...
PROGRAM STARTS WITH SPECIFING HEADER FILES AND GLOBAL VARIABLE
DECLARATION
THEN Node Declaration USING STRUCTURES,
THEN WE WANT TO DECLARE THE CLASS USING SINGLE LINKED LIST AND THE
PROTOTYPE IS PUBLIC
IN THE PUBLIC WE WANT TO CREATE THE NODE AS INTEGER DATATYPE
THE NODE CONSIST OF insert_begin();
insert_pos();-> INDICATES THE CURRENT POSSITION
insert_last();->INSERT AT LAST
delete_pos();->TO DELETE THE NUMBER AT CURRENT POSITION
sort();->START THE SORTING
search();->USED TO SEARCH
update();->UPDATE THE NODE
reverse();->REVERSE NUMBERS
display();->TO DISPLAY THE NODE
single_llist()->FIFO
WE ARE STARTING TAKING NULL VALUE
AND THEN TAKE USER DEFIND FUNCTION MAIN()
CREATE THE DATATYPES choice, nodes, element, position, i
OBJECT CREATION OF SLL IS SL
USING WHILE LOOP THE NODE INSERT AT THE BEGINING OR ENDING STAGE
WE ARE USING SWITCH CASES TO PERFORM SLL ON NODE
NODE CREATION AS
node *single_llist::create_node(int value)
ALSO DECLARE THE TEMP IS TAKEN AS NULL VALUE
INSERT THE ELEMENT AT THE BEGINING
USING IF CONDITION WE CAN INSERT THE NODE AT THE BEGINING
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
AND THEN INSERT THE NODE AT THE LAST
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
USING WHILE LOOP WE ARE INSERTING THE NODE AT LAST
USING THIS BELLOW CODE WE CAN SEARCH THE ELEMENTS IN THE NODE
struct node *temp;
if (start == NULL)
{
cout<<\"The List is Empty\"<info<<\"->\";
temp = temp->next;
}
cout.
#include iostream using namespace std; const int nil = 0; cl.docx
#include iostream using namespace std; const int nil = 0; cl.docxajoy21 The program implements a binary search tree to store 20 integers input by the user. It performs level order, preorder, inorder and postorder traversals of the tree, printing the value and level of each node. It also outputs the number of leaf nodes, nodes with one child, and nodes with two children. Finally, it calculates and prints the maximum and minimum leaf levels and checks if the tree is balanced.
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptxRashidFaridChishti Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
#include stdafx.h #include iostream using namespace std;vo.docx
#include stdafx.h #include iostream using namespace std;vo.docxajoy21 This document contains C++ code to implement a linked list program that performs the following tasks:
1. Inputs 10 integers into a linked list while sorting them as they are inserted
2. Prints the sorted list and computes the average of the values
3. Deletes nodes from the list with values less than the average
4. Creates a second list of 10 sorted integers
5. Merges the two lists together, eliminating duplicates, and prints the final list
THE CODE HAS A SEGMENTATION FAULT BUT I CANNOT FIND OUT WHERE. NEED .pdf
THE CODE HAS A SEGMENTATION FAULT BUT I CANNOT FIND OUT WHERE. NEED .pdffathimahardwareelect THE CODE HAS A SEGMENTATION FAULT BUT I CANNOT FIND OUT WHERE. NEED
HELP FIXING THIS CODE?
THIS IS THE PROBLEM
Write a program that allows the user to enter two positive integers and outputs their sum. Sounds
simple? Here\'s the catch: The numbers may be any size! They may be way too large to store in a
single variable. You may not assume any particular maximum number of digits.
HERE IS THE CODE
#include
#include
struct node /* Linked list node*/
{
int data;
struct node* next;
};
struct node *newNode(int data) /* Function to create a new node with giving the data*/
{
struct node *new_node = (struct node *) malloc(sizeof(struct node));
new_node->data = data;
new_node->next = NULL;
return new_node;
}
void push(struct node** head_ref, int new_data) /* Function to insert a node at the beginning of
the Doubly Linked List*/
{
struct node* new_node = newNode(new_data); /*allocate a node*/
new_node->next = (*head_ref); /* link the old list off to the new node*/
(*head_ref) = new_node; /*move the head to point to the new node*/
}
/* Adding the contents of two linked lists and return the head node of resultant list*/
struct node* addTwoLists (struct node* first, struct node* second)
{
struct node* res = NULL; /* res is head node of the resultant list*/
struct node *temp, *prev = NULL;
int carry = 0, sum;
while (first != NULL || second != NULL) /*while both the lists exists*/
{
/* Calculate value of next digit in resultant list.
// The next digit is sum of following things
// (i) Carry
// (ii) Next digit of first list (if there is a next digit)
// (ii) Next digit of second list (if there is a next digit)*/
sum = carry + (first? first->data: 0) + (second? second->data: 0);
carry = (sum >= 10)? 1 : 0; /* update carry for next calulation*/
sum = sum % 10; /*update sum if it is greater than 10*/
temp = newNode(sum); /*Create a new node with sum as data*/
if(res == NULL) /*if this is the first node then set it as head of the resultant list*/
res = temp;
else /* If this is not the first node then connect it to the rest.*/
prev->next = temp;
prev = temp; /* Set prev for next insertion*/
if (first) first = first->next; /* Move first pointers to next node*/
if (second) second = second->next; /*Move second pointer to the next node*/
}
if (carry > 0)
temp->next = newNode(carry);
return res; /* return head of the resultant list*/
}
void printList(struct node *node) /* function to print a linked list*/
{
while(node != NULL)
{
printf(\"%d \", node->data);
node = node->next;
}
printf(\"\ \");
}
int main(void) /* program to test above function*/
{
struct node* res = NULL;
struct node* first = NULL;
struct node* second = NULL;
printf(\"Enter first positive integer: \");
scanf(\"%d\",&first);
printList(first);
printf(\"Enter second positive integer: \");
scanf(\"%d\",&second);
printList(second);
/*Add the two lists and see result*/
res = addTwoLists(first, second);
printf(\"Sum is: %d\");
printList(res);
return 0;
}
Solution
#include
#include
typedef struct Node
{
int da.
Linkedlist
LinkedlistMasud Parvaze Linked lists are a data structure where each node contains a pointer to the next node in the list. Each node contains data and a pointer to the next node. The last node's pointer is set to NULL. Linked lists can dynamically grow and shrink during program execution. Nodes are implemented as structs containing data and a pointer. The head pointer points to the first node. Linked lists allow traversing the list by following node pointers until NULL is reached.
#includeiostream #includecstdio #includecstdlib using na.pdf
#includeiostream #includecstdio #includecstdlib using na.pdfharihelectronicspune #include
#include
#include
using namespace std;
struct node
{
int val;
struct node *next;
}*startNode;
// declaring class
class LinkedList
{
public:
node* create_node(int);
void insert_last();
void sort();
void search();
void reverse();
void display();
LinkedList()
{
startNode = NULL;
}
};
// main
main()
{
int userChoice, linkedListNodes, i;
LinkedList LinkList;
startNode = NULL;
while (1)
{
// displaying menu
cout<<\" 1)Insert\";
cout<<\"2) Remove\";
cout<<\"3) Search\";
cout<<\"4) Display\";
cout<<\"5) Reverse\";
cout<<\"6) Exit \";
// reading user choice
cout<<\"Enter your userChoice : \";
cin>>userChoice;
switch(userChoice)
{
case 1:
cout<<\"Inserting node to linked list: \";
LinkList.insert_begin();
cout;
break;
case 2:
cout<<\"Delete element from linked list: \";
LinkList.delete();
break;
case 3:
cout<<\"Searching data in linked list: \";
LinkList.search();
cout;
break;
case 4:
cout<<\"Displaying linked list data: \";
LinkList.display();
cout;
break;
case 5:
cout<<\"Linked list reversing: \";
LinkList.reverse();
cout;
break;
case 6:
cout<<\"Exiting...\";
exit(1);
break;
default:
cout<<\"Enter correct userChoice\";
}
}
}
// node creating to store into list
node *LinkedList::create_node(int val)
{
struct node *tempNode, *tempNode;
tempNode = new(struct node);
if (tempNode == NULL)
{
cout<<\"No memory allocated \";
return 0;
}
else
{
tempNode->val = val;
tempNode->next = NULL;
return tempNode;
}
}
/*
* Inserting Node at last
*/
void LinkedList::insert_last()
{
int val;
cout<<\"Enter the val to be inserted: \";
cin>>val;
struct node *tempNode, *tempNode;
tempNode = create_node(val);
tempNode = startNode;
while (tempNode->next != NULL)
{
tempNode = tempNode->next;
}
tempNode->next = NULL;
tempNode->next = tempNode;
cout<<\"Element Inserted\";
}
// deleting element
void LinkedList::delete()
{
int position, i, count = 0;
if (startNode == NULL)
{
cout<<\"Linkedlist empty\"<>position;
struct node *tempNode, *ptr;
tempNode = startNode;
if (position == 1)
{
startNode = tempNode->next;
}
else
{
while (tempNode != NULL)
{
tempNode = tempNode->next;
count++;
}
if (position > 0 && position <= count)
{
tempNode = startNode;
for (i = 1;i < position;i++)
{
ptr = tempNode;
tempNode = tempNode->next;
}
ptr->next = tempNode->next;
}
else
{
cout<<\"Enter correct position\";
}
}
}
// search data in linked list
void LinkedList::search()
{
int val, position = 0;
bool flagValue = false;
if (startNode == NULL)
{
cout<<\"List is empty\";
return;
}
cout<<\"Enter the val to search: \";
cin>>val;
struct node *tempNode;
tempNode = startNode;
while (tempNode != NULL)
{
position++;
if (tempNode->val == val)
{
flagValue = true;
cout<<\"Data \"<next;
}
if (!flagValue)
cout<<\"data not found\";
}
// linkedlist reverese
void LinkedList::reverse()
{
struct node *pointer1, *pointer2, *pointer3;
if (startNode == NULL)
{
cout<<\"List is empty\"<next == NULL)
{
return;
}
pointer1 = startNode;
pointer2 = pointer1->next;
pointer3 = pointer2->next;
pointer1->next = NULL;
pointer2->.
C++ Program to Implement Singly Linked List #includei.pdf
C++ Program to Implement Singly Linked List #includei.pdfanupambedcovers /*
* C++ Program to Implement Singly Linked List
*/
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<<\"1.Insert Node at beginning\"<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (ptr->info > s->info)
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
/*
* Delete element at a given position
*/
void single_llist::delete_pos()
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<>pos;
cout<<\"Enter the new value: \";
cin>>value;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start->info = value;
}
else
{
for (i = 0;i < pos - 1;i++)
{
if (s == NULL)
{
cout<<\"There are less than \"<next;
}
s->info = value;
}
cout<<\"Node Updated\"<>value;
struct node *s;
s = start;
while (s != NULL)
{
pos++;
if (s->info == value)
{
flag = true;
cout<<\"Element \"<next;
}
if (!flag)
cout<<\"Element \"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2 = ptr3;
ptr3 = ptr3->next;
ptr2->next = ptr1;
}
start = ptr2;
}
/*
* Display Elements of a link list
*/
vo.
Im creating a skip list program for my Algorithms and Advanced Data.pdf
Im creating a skip list program for my Algorithms and Advanced Data.pdfarkmuzikllc I'm creating a skip list program for my Algorithms and Advanced Data Structure class. I was
tasked with implementing a find & add method for the skiplist. Here is my program, I'm running
into a segmentation fault when I add my second value into the skiplist. My first issue that I fixed
was that I wasn't checking the first node in the list to see if it was nullptr, but that was not my
only issue apparently.
Add Method:
void SkipList::add(const ElemType &el) {
// Create a new node with the given element
Node *newNode = new Node(el);
// Get the height of the new node
int newHeight = newNode->nodeHeight;
// If the height of the new node is greater than the current list height,
// update the list height.
if (newHeight > listHeight) {
listHeight = newHeight;
}
// Array to keep track of nodes to update
Node *update[MAX_NUM_LISTS];
// Start from the top level
Node *current = head[listHeight - 1]; // Initialize current correctly
// If the list is empty, assign the first node to head
if (head[0] == nullptr) {
head[0] = newNode;
} else {
// Loop to traverse through list
for (int i = listHeight - 1; i >= 0; i--) {
// Move forward in the current level
while (current->next[i] != nullptr && current->next[i]->elem < el) {
current = current->next[i];
}
// Store the node before which the new node should be inserted
update[i] = current;
}
// Insert the new node at each level
for (int i = 0; i < newHeight; i++) {
newNode->next[i] = update[i]->next[i];
update[i]->next[i] = newNode;
}
}
}
Find Method:
bool SkipList::find(const ElemType &el) const {
// Start from the top level
Node *current = head[listHeight - 1];
bool found = false;
// Iterate through the levels of the skip list
for (int i = listHeight - 1; i >= 0; i--) {
// Move forward in the current level until reaching the end or finding a larger element
while (current->next[i] != nullptr && current->next[i]->elem < el) {
current = current->next[i];
}
// Check if the current node's next node contains the target element
if (current->next[i] != nullptr && current->next[i]->elem == el) {
found = true; // Element found
}
}
return found; // Element not found in the skip list
}
Main:
int main()
{
ElemType inputs[] = {5, 7, 8, 10, 12, 17, 19, 22, 28, 31, 33, 35, 42, 51, 59};
SkipList list1;
cout << "For list1 (same as in the slide 10 of Skip List1 Lecture Note):\n";
// for (int i=0; i(std::size(inputs)); i++)
{
cout << "add " << inputs[i] << endl;
list1.add(inputs[i]);
cout << "list1:\n"
<< list1 << endl;
}
if (list1.find(33))
cout << "33 is found!\n";
else
cout << "33 is not found!!!!\n";
if (list1.find(70))
cout << "70 is found!\n";
else
cout << "70 is not found!!!!\n";
if (list1.find(10))
cout << "10 is found!\n";
else
cout << "10 is not found!!!!\n";
cout << "\n===================================\n";
cout << "For list2:\n";
ElemType inputs2[] = {19, 8, 17, 59, 12, 7, 5, 22, 28, 35, 33, 31, 42, 51, 10};
SkipList list2;
for (int i = 0; i < static_cast(std::size(inputs2)); i++)
{
cout << "add " << inputs2[i] << endl.
DSA(1).pptx
DSA(1).pptxDaniyalAli81 The document summarizes key concepts about linked lists including different types like singly linked lists, doubly linked lists, and circular linked lists. It provides code examples for creating nodes and performing operations like insertion, deletion, and traversal for each type of linked list. Specifically, it shows code for inserting nodes at the head, tail, and middle of singly, doubly, and circular linked lists. It also includes code for deleting nodes from singly, doubly, and circular linked lists.
C++ Program to Implement Singly Linked List #includeiostream.pdf
C++ Program to Implement Singly Linked List #includeiostream.pdfangelsfashion1 /* C++ Program to Implement Singly Linked List */
#include
#include
#include
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (ptr->info > s->info)
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
/*
* Delete element at a given position
*/
void single_llist::delete_pos()
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<>pos;
cout<<\"Enter the new value: \";
cin>>value;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start->info = value;
}
else
{
for (i = 0;i < pos - 1;i++)
{
if (s == NULL)
{
cout<<\"There are less than \"<next;
}
s->info = value;
}
cout<<\"Node Updated\"<>value;
struct node *s;
s = start;
while (s != NULL)
{
pos++;
if (s->info == value)
{
flag = true;
cout<<\"Element \"<next;
}
if (!flag)
cout<<\"Element \"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2 = ptr3;
ptr3 = ptr3->next;
ptr2->next = ptr1;
}
start = ptr2;
}
/*
* Display Elements of a link list
*/
void single_llist::display()
{
struct node *temp;
if (sta.
Write an algorithm that reads a list of integers from the keyboard, .pdf
Write an algorithm that reads a list of integers from the keyboard, .pdfArrowdeepak Write an algorithm that reads a list of integers from the keyboard, creates
a list of them using linked list implementation, and prints the result
Solution
/*
Algorithm:
Implementation of linked list.
Create a node type class which will hold an integer and next pointer to point to another node.
Create a constructor which will construct an object of type node with the integer type data as the
only parameter
and initializing next pointer to NULL.
Create LinkedList class which will only have head pointer.
Create a constructor which will initialize this head pointer to NULL.
Create a append method which will recieve an input of type integer from the user and append it
to LinkedList
using below steps:
1.Create a Node type object.
1.IF head is NULL assign a Node type object created in 1st step.
2.IF head is not NULL then traverse to the end of the linked list till you found a Node which has
next pointer
set to NULL.
3.Add Node type object created in first step to the next pointer of last node.
Create a print method which will traverse the list from the head of the linked list to the last
node(Node
with next pointer NULL) and while traversing it will keep printing the node data.
Get the userinput:
Ask user for integer continously till user input -1 and append all the integers to the linked list.
*/
PROGRAM:
#include
using namespace std;
class Node
{
public:
int data;
Node *next;
Node(int data)
{
this->data = data;
this->next = NULL;
}
};
class LinkedList
{
private:
Node *head;
public:
LinkedList()
{
head = NULL;
}
void addToFront(int data)
{
Node *temp = new Node(data);
if(head == NULL)
head = temp;
else
{
temp->next = head;
head = temp;
}
}
void append(int data)
{
Node *temp = new Node(data);
Node *current = head;
if(current == NULL)
{
head = temp;
return;
}
while(current->next != NULL)
{
current = current->next;
}
current->next = temp;
}
void print()
{
Node *current = head;
if(current == NULL)
cout << \"No element in list. \ \";
while(current != NULL)
{
cout << current->data << \" \";
current = current->next;
}
cout << endl;
}
void deleteLinkedList()
{
Node *prev;
Node *current = head;
while(current!=NULL)
{
prev = current;
current = current->next;
delete prev;
}
}
void deleteLastNode()
{
Node *current = head;
Node *prev = NULL;
if(current == NULL)
return;
while(current->next != NULL)
{
prev = current;
current = current->next;
}
if(prev == NULL)
{
delete current;
head = NULL;
}
else
{
prev->next = NULL;
delete current;
}
}
~LinkedList()
{
deleteLinkedList();
}
};
int main()
{
LinkedList list;
int data;
while(1)
{
cout << \"Enter the integer(-1 to Quit) : \";
cin >> data;
if(data==-1)
break;
list.append(data);
}
cout << \"Content of LinkedList is : \";
list.print();
return 0;
}
OUTPUT:
Enter the integer(-1 to Quit) : 1
Enter the integer(-1 to Quit) : 2
Enter the integer(-1 to Quit) : 3
Enter the integer(-1 to Quit) : 4
Enter the integer(-1 to Quit) : -1
Content of LinkedList is : 1 2 3 4.
17 linkedlist (1)
17 linkedlist (1)Himadri Sen Gupta This document discusses linked lists and their implementation in C. It begins by describing the differences between array-based and linked list implementations. Specifically, it notes that linked lists use dynamic memory allocation and pointers to connect nodes rather than contiguous memory blocks. The document then covers creating and traversing linked lists using nodes with data fields and next pointers. It provides code examples for inserting, finding, deleting and destroying nodes in a singly linked list. Finally, it briefly lists some other common linked list operations like sorting, reversing and finding min/max elements.
Inspect the class declaration for a doubly-linked list node in Node-h-.pdf
Inspect the class declaration for a doubly-linked list node in Node-h-.pdfvishalateen Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking
on the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables: a double data value, a pointer to the next node, and a pointer to the previous
node. Each member variable is protected. So code outside of the class must use the provided
getter and setter member functions to get or set a member variable. Node.h is read only, since no
changes are required. Step 2: Implement the Insert() member function A class for a sorted,
doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList class's
Insert() member function. The function must create a new node with the parameter value, then
insert the node into the proper sorted position in the linked list. Ex: Suppose a
SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node with data
value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order
and yielding: 23 35.5 47.25 86 Step 3: Test in develop mode Code in main() takes a space-
separated list of numbers and inserts each into a SortedNumberList. The list is displayed after
each insertion. Ex: If input is 77 15 -42 63.5 then output is: List after inserting 77: 77 List after
inserting 15: 15 77 List after inserting -42: -42 15 77 List after inserting 63.5: -42 15 63.5 77 Try
various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove()
member function Implement the SortedNumberList class's Remove() member function. The
function takes a parameter for the number to be removed from the list. If the number does not
exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the
number is removed from the list and true is returned. Uncomment the commented-out part in
main() that reads a second input line and removes numbers from the list. Test in develop mode to
ensure that insertion and removal both work properly, then submit code for grading. Ex: If input
is 84 72 19 61 19 84 then output is: List after inserting 84: 84 List after inserting 72: 72 84 List
after inserting 19: 19 72 84 List after inserting 61: 19 61 72 84 List after removing 19: 61 72 84
List after removing 84: 61 72
main.cpp
#include
#include
#include
#include "Node.h"
#include "SortedNumberList.h"
using namespace std; void PrintList(SortedNumberList& list); vector SpaceSplit(string source);
int main(int argc, char *argv[]) { // Read the line of input numbers string inputLine; getline(cin,
inputLine); // Split on space character vector terms = SpaceSplit(inputLine); // Insert each value
and show the sorted list's contents after each insertion SortedNumberList list; for (auto term :
terms) { double number = stod(term); cout << "List after inserting " << number << ": " << endl;
list.Insert(number); PrintList(list); } /* // Read the input line with numbers to remove getline(cin,
inputLi.
Please refer this solution. This is working file for IntegersHeade.pdf
Please refer this solution. This is working file for IntegersHeade.pdfsooryasalini Please refer this solution. This is working file for Integers
Header file :-
-----------------------------------
#ifndef LINKEDLIST_H
#define LINKEDLIST_H
struct node{
void * data;
node * next;
};
class LinkedList
{
private:
node* head ;
int size;
public:
LinkedList();
//method to create a node
node * create(void* data);
//method to append
void append(node * item);
//method to prepend
void prepend(node * item);
//insert in ascending order
void insertAscend(node * item);
//insert in ascending order
void insertDescend(node * item);
//display all nodes
void display();
//free the list
void freeUp();
};
#endif // LINKEDLIST_H
Source file :-
----------------------------------
#include \"linkedlist.h\"
#include
#include
#include
LinkedList::LinkedList()
{
//head = (node *)malloc(sizeof(node));
size = 0;
head = NULL;
}
//method to create a node
node * LinkedList::create(void* data){
node * newNode = (node *)malloc(sizeof(node));
newNode->data = malloc(sizeof(data));
memcpy(newNode->data,data,sizeof(data));
newNode->next = NULL;
return newNode;
}
//method to append
void LinkedList::append(node * item){
if(head == NULL){
head = item;
size++;
return;
}
node* current;
current = head;
while (current->next!=NULL )
{
current = current->next;
}
current->next = item ;
size++;
}
//method to prepend
void LinkedList::prepend(node * item){
if(head == NULL){
head = item;
size++;
return;
}
item->next = head;
head = item;
size++;
}
//insert in ascending order
void LinkedList::insertAscend(node * item){
if(head == NULL){
head = item;
size++;
return;
}
node* current;
current = head;
node * prev = NULL;
bool found = false;
while (current !=NULL){
int *current_data = static_cast(current->data);
int *item_data = static_cast(item->data);
if(*item_data < *current_data){
if(prev == NULL){
item->next = current;
if(current == head){
head = item;
}
}
else{
prev->next = item;
item->next = current;
}
found = true;
break;
}
prev = current;
current = current->next;
}
if(!found){
prev->next = item;
}
size++;
}
//insert in Descending order
void LinkedList::insertDescend(node * item){
if(head == NULL){
head = item;
size++;
return;
}
node* current;
current = head;
node * prev = NULL;
bool found = false;
while (current !=NULL){
int *current_data = static_cast(current->data);
int *item_data = static_cast(item->data);
if(*item_data > *current_data){
if(prev == NULL){
item->next = current;
if(current == head){
head = item;
}
}
else{
prev->next = item;
item->next = current;
}
found = true;
break;
}
prev = current;
current = current->next;
}
if(!found){
prev->next = item;
}
size++;
}
//display all nodes
void LinkedList::display(){
int idx = 0;
node* current;
current = head;
while (current != NULL ){
idx++;
int *data = static_cast(current->data);
printf(\"data for item ::%dis :: %d\ \",idx,*data);
current = current->next;
}
}
//free the list
void LinkedList::freeUp(){
node* current;
current = head;
while (current->next!=NULL ){
head = current->next;
delete current;
current = head;
}
}
Main f.
Program In C You are required to write an interactive C program that.pdf
Program In C You are required to write an interactive C program that.pdfamitbagga0808 Program In C You are required to write an interactive C program that prompts the user for
commands, accepts commands from the keyboard (stdin) and executes those commands. When a
command requires output, it must be written to stdout. The program must continue to accept and
process commands until the user types the end command ourput, it must be writen to stdout. The
program must continue to accept and proces.commands The program deals with linked lists.
Each node of such a list contains a string of length at most 10, a positive integer (i.e., an integer
value 2 1) and a pointer to the next node of the list. For any node, the string and the integer
stored in that node will be referred to as the symbol and count for that node respectively. At all
times, the list must satisfy the following two important properties. 1. The symbols appearing in
the list are all distinct; that is, no two nodes have the same symbol. 2. When the list is scanned
from left to right, the counts must be in non-increasing order. An example of such a linked list is
shown below. Search 4 Maxval4 begin/ Loop head
Solution
/**********************************************/
/****** NAMES ******************** COMMANDS ***/
/* Insert Command : ins str */
/* Delete Command : del str */
/* Forced Delete Command : fde val */
/* Print Statistics Command : pst */
/* Print List Command : prl */
/* Print using Count Range Command: pcr v1 v2 */
/* Print Prefix Command : ppr str */
/* Print Suffix Command : psu str */
/* End Command : end */
/***********************************************/
#include
#include
#include
#define CSIZE 4
#define SSIZE 11
/* Struct for each node in the linked list */
struct node
{
int count;
char symbol[SSIZE];
struct node *next;
};
struct node *head;
/* Prototypes for the functions */
void insert(char *);
void delete(char *);
void forced_delete(int value);
void print_stats();
void print_list();
void print_count(int, int);
void print_prefix(char pre[]);
void print_suffix(char suf[]);
void sort_list();
/****************
** Main Method **
****************/
int main(void)
{
int count;
char symbol[SSIZE];
char cmd[CSIZE];
int v1;
int v2;
/* Enter commands */
printf(\"Command? \"); fflush(stdout);
scanf(\"%s\", cmd);
/* Check for command*/
while(strcmp(cmd,\"end\") != 0)
{
/* check which function to use */
if(strcmp(cmd,\"ins\") == 0) { scanf(\"%s\", symbol); insert(symbol); }
if(strcmp(cmd,\"del\") == 0) { scanf(\"%s\", symbol); delete(symbol); }
else if(strcmp(cmd,\"fde\")==0){scanf(\"%d\",&count); forced_delete(count); }
if(strcmp(cmd,\"pst\") == 0) { print_stats();}
if(strcmp(cmd,\"prl\") == 0) { print_list(); }
if(strcmp(cmd,\"pcr\") == 0) { scanf(\"%d %d\",&v1,&v2); print_count(v1,v2); }
if(strcmp(cmd,\"ppr\") == 0) { scanf(\"%s\", symbol); print_prefix(symbol);}
if(strcmp(cmd,\"psu\") == 0) { scanf(\"%s\", symbol); print_suffix(symbol);}
printf(\"Command? \"); fflush(stdout);
scanf(\"%s\", cmd);
}// End of While Loop
return 0;
}// End of main method
/*********.
Please correct my errors upvote Clears our entire .pdf
Please correct my errors upvote Clears our entire .pdfkitty811 Please correct my errors. upvote
/**
* Clears our entire list, making it empty
* Remember: All removal operations should be memory-leak free.
*/
void clear()
{
// Set a pointer to the head of the list
Node<T> *current = head_;
// Loop through each node in the list
while (current != nullptr)
{
Node<T> *next = current->getNext();
delete current;
current = next;
}
// Set head and tail pointers to null and reset the size of the list
head_ = nullptr;
tail_ = nullptr;
size_ = 0;
}
/**
* Insert an element after the node pointed to by the pos Iterator
*
* If the list is currently empty,
* ignore the iterator and just make the new node at the head/tail (list of length 1).
*
* If the incoming iterator is this->end(), insert the element at the tail
*
* Should return an iterator that points to the newly added node
*
* To avoid repeated code, it might be a good idea to have other methods
* rely on this one.
*/
Iterator insert_after(Iterator pos, const T& value) {
}
/**
* Insert a new element after the index pos.
* Should work with an empty list.
*
* Should return an iterator pointing to the newly created node
*
* To reduce repeated code, you may want to simply find
* an iterator to the node at the pos index, then
* send it to the other overload of this method.
*/
Iterator insert_after(size_t pos, const T &value)
{
Iterator it = begin();
for (size_t i = 0; i < pos && it != end(); i++)
{
++it;
}
return insert_after(it, value);
}
/**
* Erase the node pointed to by the Iterators cursor.
*
* If the 'pos' iterator does not point to a valid node,
* throw an std::range_error
*
* Return an iterator to the node AFTER the one we erased,
* or this->end() if we just erased the tail
*/
Iterator erase(Iterator pos)
{
Node<T> *node = pos.node_;
if (node == nullptr || node == head_ || node == tail_)
{
throw std::range_error("Invalid iterator");
}
Node<T> *prevNode = node->prev_;
Node<T> *nextNode = node->next_;
// Updates the next_ pointer of the previous node to point to the next node or updates the head_
pointer
if (prevNode != nullptr)
{
prevNode->next_ = nextNode;
}
else
{
head_ = nextNode;
}
if (nextNode != nullptr)
{
nextNode->prev_ = prevNode;
}
else
{
tail_ = prevNode;
}
Iterator nextIt(nextNode, head_, tail_);
delete node;
return nextIt;
}
/**
* Add an element just after the one pointed to by the 'pos' iterator
*
* Should return an iterator pointing to the newly created node
*/
Iterator push_after(Iterator pos, const T &value)
{
Node<T> *node = pos.node_;
if (node == nullptr)
{
throw std::range_error("Invalid iterator");
}
Node<T> *nextNode = node->next_;
Node<T> *newNode = new Node(value, node, nextNode);
node->next_ = newNode;
if (nextNode != nullptr)
{
nextNode->prev_ = newNode;
}
else
{
tail_ = newNode;
}
return Iterator(newNode, head_, tail_);
}
/**
* Add a new element to the front of our list.
*/
void push_front(const T &value)
{
Node<T> *new_node = new Node<T>(value, nullptr, head_);
if (head_ == nullptr)
{
tail_ = new_node;
}
else
{
head_->setPrevious(new.
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the.pdfmail931892 Help I keep getting the same error when running a code. Below is the code and the instructions
about the code.
import java.util.Arrays;
public class Album implements Comparable {
private final int id;
private final String[] artists;
private final int numSongs;
public Album(int id, String title, String[] artists, int numSongs) {
this.id = id;
this.artists = new String[]{Arrays.toString(artists)};
this.numSongs = numSongs;
}
public int getId() {
return id;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
StringBuilder artistNames = new StringBuilder();
for (String artist : artists) {
artistNames.append(artist).append(", ");
}
artistNames.delete(artistNames.length() - 2, artistNames.length());
return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]";
}
}
import java.util.Random;
public class DoublyLinkedList {
private static class Node {
T data;
Node prev;
Node next;
Node(T data) {
this.data = data;
}
}
private Node head;
private Node tail;
private int size;
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public Node append(T data) {
Node newNode = new Node<>(data);
if (head == null) {
head = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
}
tail = newNode;
size++;
return newNode;
}
public Node insert(int location, T data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node<>(data);
if (location == 0) {
newNode.next = head;
if (head != null) {
head.prev = newNode;
}
head = newNode;
if (tail == null) {
tail = newNode;
}
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
newNode.prev = current.prev;
newNode.next = current;
current.prev.next = newNode;
current.prev = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(T data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder result = new StringBuilder();
Node current = head;
while (current != null) {
result.append(current.data).append(" -> ");
current = current.next;
}
result.append("NULL");
return result.toString();
}
public Node shuffle() {
Random r.
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdf
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdfangelsfashion1 #ifndef LINKED_LIST_
#define LINKED_LIST_
template
class LinkedList {
private:
std::shared_ptr> headPtr; // Pointer to first node in the chain;
// (contains the first entry in the list)
int itemCount; // Current count of list items
std::shared_ptr> getNodeAt(int position) const;
public:
LinkedList();
LinkedList(const LinkedList& aList);
virtual ~LinkedList();
bool isEmpty() const;
int getLength() const;
bool insert(int newPosition, const ItemType& newEntry);
bool remove(int position);
void clear();
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
ItemType getEntry(int position) const throw(PrecondViolatedExcept);
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
void replace(int position, const ItemType& newEntry)
throw(PrecondViolatedExcept);
// Operator Overloading
void operator = (const LinkedList& arg);
friend std::ostream& operator << (std::ostream& os, const LinkedList& arg)
{
os << \"There are \" << arg.getLength() << \" values in the list:\" << std::endl;
for (int i{ 1 }; i <= arg.getLength(); i++) {
os << arg.getEntry(i) << std::endl;
}
os << std::endl << std::endl << std::endl << std::endl;
return os;
}
};
// Returns a pointer to the Node at the given position.
template
std::shared_ptr> LinkedList::getNodeAt (int position) const {
std::shared_ptr> currPtr{ headPtr };
for (int i{ 1 }; i < position; i++)
currPtr = currPtr->getNext();
return currPtr;
}
// Default constructor.
template
LinkedList::LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Copy constructor.
template
LinkedList::LinkedList(const LinkedList& aList) {
itemCount = aList.getLength();
auto currPtr{ aList.headPtr };
auto newNodePtr{ headPtr = std::make_shared>(currPtr->getItem()) };
auto prevNodePtr{ newNodePtr };
currPtr = currPtr->getNext();
for (int i{ 2 }; i <= itemCount; i++) {
newNodePtr = std::make_shared>(currPtr->getItem());
prevNodePtr->setNext(newNodePtr);
prevNodePtr = newNodePtr;
currPtr = currPtr->getNext();
}
}
// Destructor.
template
LinkedList::~LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Accessor/Info Functions.
template
bool LinkedList::isEmpty() const {
return (itemCount > 0)?0:1;
}
template
int LinkedList::getLength() const {
return itemCount;
}
// Places a Node at a given position (element at the same position is now pos+1).
template
bool LinkedList::insert(const int newPosition,
const ItemType& newEntry)
{
bool ableToInsert{ (newPosition >= 1) &&
(newPosition <= itemCount + 1) };
if (ableToInsert)
{
// Create a new node containing the new entry
auto newNodePtr{ std::make_shared>(newEntry) };
// Attach new node to chain
if (newPosition == 1)
{
// Insert new node at beginning of chain
newNodePtr->setNext(headPtr);
headPtr = newNodePtr;
}
else
{
// Find node that will be before new node
auto prevPtr{ getNodeAt(newPosition - 1) };
// Insert new node after node to which prevPtr points
newNodePtr->setNext(prevPtr->getNext());
prevPtr->setNext(newNodePtr);
} // end if
itemCount++; // .
Need to elaborate on this discussion post Marvin Mower (MM) has t.pdf
Need to elaborate on this discussion post Marvin Mower (MM) has t.pdfcontact41 Need to elaborate on this discussion post:
Marvin Mower (MM) has the right to receive payment as the work was completed to Ursula
Unhappys (UU) satisfaction at the time of service, and a document or promissory note was given
by UU stating that the work was completed and MM was owed $50. For that reason, UU is
responsible for paying MM as he is the holder of a document stating his work that was
completed and the amount owed by UU. UU may refuse the right to payment, but she would
need to prove she was not satisfied with the work done by MM. Given the document provided,
Tommy's third party (TT) can seek the amount owed from UU. UU has the responsibility to pay
TT unless she can prove she was dissatisfied with MMs work, and then that responsibility would
fall to MM to reimburse TT. If UU were to prove she was not satisfied with MMs work and the
contract was voided, TT would have the right to seek reimbursement from MM for the $40. TT
may also have the right to seek damages from MM if he can prove MM provided false
representation of the document he provided..
Manufacturing and service operations can be divided into different t.pdf
Manufacturing and service operations can be divided into different t.pdfcontact41 Manufacturing and service operations can be divided into different types of processes. Which of
the following are basic characteristics of all operations systems? (0) Systems have inputs that
make up the system, and inputs that are processed by the system. Systems consist of dynamically
linked, interdependent elements. (1) (0) Systems transform inputs into outputs by performing
certain activities on some of the inputs. (iv) A system runs better if there is no feedback from the
output side to the input side. Choose the correct answer. systiomis? 6. Systems have irputs that
make up the system, and inputs that are procesand by the aystem. () Systerrs consist of
dynamicaly inked, intertependant elements (ii) Syeterns traneform inguts into outputs by
porforming cerfain sctivitens on some of the inputa. (iv) A rystem runs bettor if there ie no
feedback froen the output sibe to the input side Chosse the corruct answer:.
Ad
More Related Content
Similar to Node file code below#ifndef NODE_H#define NODE_H#include .pdf (20)
In the class we extensively discussed a node class called IntNode in.pdf
In the class we extensively discussed a node class called IntNode in.pdfarjunstores123 In the class we extensively discussed a node class called IntNode in which each linked list node
contains an integer and each node is linked forward to the next element in the list. Implement a
node class called DoublyIntNode in which each node contains an integer number and each node
is linked not only forward to the next element in the list but also backward to the previous
element in the list. Your implementation of DoublyIntNode should adapt and implement all the
methods of IntNode including the following methods:
Constructor for DoublyIntNode
addNodeAfter, removeNodeAfter
getData, setData
getForeLink, setForeLink
getBackLink, setBackLink
listCopy
listCopyWithTail
listLength
listPart
listPosition
listSearch
IntNode and Node classes:
public class IntNode{
private int data;
private IntNode link;
// methods here
}
public class Node {
private E data;
private Node link;
// methods here
}
Solution
program
#include
using namespace std;
struct list
{
struct list *prev;
int data;
struct list *next;
}
*node = NULL, *first = NULL, *last = NULL, *node1 = NULL, *node2 = NULL;
class Dlist
{
public:
void insert_beg() {
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;
}
}
void insert_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;
}
}
void display() {
node = first;
cout << \"List of data in Linked list in Ascending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->next;
}
node = last;
cout << \"List of data in Linked list in Descending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->prev;
}
}
void del()
{
int count = 0, number, i;
node = node1 = node2 = first;
for(node = first; node != NULL; node = node->next)
cout << \"Enter value for the node:\" << endl;
count++;
display();
cout << count << \" nodes available here!\" << endl;
cout << \"Enter the node number which you want to delete:\" << endl;
cin >> number;
if(number != 1)
{
if(number < count && number > 0)
{
for(i = 2; i <= number; i++)
node = node->next;
for(i = 2; i <= number-1; i++)
node1 = node1->next;
for(i = 2; i <= number+1; i++)
node2 = node2->next;
node2->prev = node1;
node1->next = node2;
node->prev = NULL;
node->next = NULL;
node = NULL;
}
else if(number == count)
{
node = last;
last = node->prev;
last->next = NULL;
node = NULL;
}
else
cout << \"Invalid node.
take the following code and give details of what each line of code i.pdf
take the following code and give details of what each line of code i.pdffastechsrv take the following code and give details of what each line of code is doing
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<info<<\"->\";
temp = temp->next;
}
cout<<\"NULL\"<
Solution
ANSWER ::
ASSMUING THE TOTAL LINE IN CODE ARE 158*(INCLUDING COMMENTS)
SO...
PROGRAM STARTS WITH SPECIFING HEADER FILES AND GLOBAL VARIABLE
DECLARATION
THEN Node Declaration USING STRUCTURES,
THEN WE WANT TO DECLARE THE CLASS USING SINGLE LINKED LIST AND THE
PROTOTYPE IS PUBLIC
IN THE PUBLIC WE WANT TO CREATE THE NODE AS INTEGER DATATYPE
THE NODE CONSIST OF insert_begin();
insert_pos();-> INDICATES THE CURRENT POSSITION
insert_last();->INSERT AT LAST
delete_pos();->TO DELETE THE NUMBER AT CURRENT POSITION
sort();->START THE SORTING
search();->USED TO SEARCH
update();->UPDATE THE NODE
reverse();->REVERSE NUMBERS
display();->TO DISPLAY THE NODE
single_llist()->FIFO
WE ARE STARTING TAKING NULL VALUE
AND THEN TAKE USER DEFIND FUNCTION MAIN()
CREATE THE DATATYPES choice, nodes, element, position, i
OBJECT CREATION OF SLL IS SL
USING WHILE LOOP THE NODE INSERT AT THE BEGINING OR ENDING STAGE
WE ARE USING SWITCH CASES TO PERFORM SLL ON NODE
NODE CREATION AS
node *single_llist::create_node(int value)
ALSO DECLARE THE TEMP IS TAKEN AS NULL VALUE
INSERT THE ELEMENT AT THE BEGINING
USING IF CONDITION WE CAN INSERT THE NODE AT THE BEGINING
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
AND THEN INSERT THE NODE AT THE LAST
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
USING WHILE LOOP WE ARE INSERTING THE NODE AT LAST
USING THIS BELLOW CODE WE CAN SEARCH THE ELEMENTS IN THE NODE
struct node *temp;
if (start == NULL)
{
cout<<\"The List is Empty\"<info<<\"->\";
temp = temp->next;
}
cout.
#include iostream using namespace std; const int nil = 0; cl.docx
#include iostream using namespace std; const int nil = 0; cl.docxajoy21 The program implements a binary search tree to store 20 integers input by the user. It performs level order, preorder, inorder and postorder traversals of the tree, printing the value and level of each node. It also outputs the number of leaf nodes, nodes with one child, and nodes with two children. Finally, it calculates and prints the maximum and minimum leaf levels and checks if the tree is balanced.
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptxRashidFaridChishti Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
#include stdafx.h #include iostream using namespace std;vo.docx
#include stdafx.h #include iostream using namespace std;vo.docxajoy21 This document contains C++ code to implement a linked list program that performs the following tasks:
1. Inputs 10 integers into a linked list while sorting them as they are inserted
2. Prints the sorted list and computes the average of the values
3. Deletes nodes from the list with values less than the average
4. Creates a second list of 10 sorted integers
5. Merges the two lists together, eliminating duplicates, and prints the final list
THE CODE HAS A SEGMENTATION FAULT BUT I CANNOT FIND OUT WHERE. NEED .pdf
THE CODE HAS A SEGMENTATION FAULT BUT I CANNOT FIND OUT WHERE. NEED .pdffathimahardwareelect THE CODE HAS A SEGMENTATION FAULT BUT I CANNOT FIND OUT WHERE. NEED
HELP FIXING THIS CODE?
THIS IS THE PROBLEM
Write a program that allows the user to enter two positive integers and outputs their sum. Sounds
simple? Here\'s the catch: The numbers may be any size! They may be way too large to store in a
single variable. You may not assume any particular maximum number of digits.
HERE IS THE CODE
#include
#include
struct node /* Linked list node*/
{
int data;
struct node* next;
};
struct node *newNode(int data) /* Function to create a new node with giving the data*/
{
struct node *new_node = (struct node *) malloc(sizeof(struct node));
new_node->data = data;
new_node->next = NULL;
return new_node;
}
void push(struct node** head_ref, int new_data) /* Function to insert a node at the beginning of
the Doubly Linked List*/
{
struct node* new_node = newNode(new_data); /*allocate a node*/
new_node->next = (*head_ref); /* link the old list off to the new node*/
(*head_ref) = new_node; /*move the head to point to the new node*/
}
/* Adding the contents of two linked lists and return the head node of resultant list*/
struct node* addTwoLists (struct node* first, struct node* second)
{
struct node* res = NULL; /* res is head node of the resultant list*/
struct node *temp, *prev = NULL;
int carry = 0, sum;
while (first != NULL || second != NULL) /*while both the lists exists*/
{
/* Calculate value of next digit in resultant list.
// The next digit is sum of following things
// (i) Carry
// (ii) Next digit of first list (if there is a next digit)
// (ii) Next digit of second list (if there is a next digit)*/
sum = carry + (first? first->data: 0) + (second? second->data: 0);
carry = (sum >= 10)? 1 : 0; /* update carry for next calulation*/
sum = sum % 10; /*update sum if it is greater than 10*/
temp = newNode(sum); /*Create a new node with sum as data*/
if(res == NULL) /*if this is the first node then set it as head of the resultant list*/
res = temp;
else /* If this is not the first node then connect it to the rest.*/
prev->next = temp;
prev = temp; /* Set prev for next insertion*/
if (first) first = first->next; /* Move first pointers to next node*/
if (second) second = second->next; /*Move second pointer to the next node*/
}
if (carry > 0)
temp->next = newNode(carry);
return res; /* return head of the resultant list*/
}
void printList(struct node *node) /* function to print a linked list*/
{
while(node != NULL)
{
printf(\"%d \", node->data);
node = node->next;
}
printf(\"\ \");
}
int main(void) /* program to test above function*/
{
struct node* res = NULL;
struct node* first = NULL;
struct node* second = NULL;
printf(\"Enter first positive integer: \");
scanf(\"%d\",&first);
printList(first);
printf(\"Enter second positive integer: \");
scanf(\"%d\",&second);
printList(second);
/*Add the two lists and see result*/
res = addTwoLists(first, second);
printf(\"Sum is: %d\");
printList(res);
return 0;
}
Solution
#include
#include
typedef struct Node
{
int da.
Linkedlist
LinkedlistMasud Parvaze Linked lists are a data structure where each node contains a pointer to the next node in the list. Each node contains data and a pointer to the next node. The last node's pointer is set to NULL. Linked lists can dynamically grow and shrink during program execution. Nodes are implemented as structs containing data and a pointer. The head pointer points to the first node. Linked lists allow traversing the list by following node pointers until NULL is reached.
#includeiostream #includecstdio #includecstdlib using na.pdf
#includeiostream #includecstdio #includecstdlib using na.pdfharihelectronicspune #include
#include
#include
using namespace std;
struct node
{
int val;
struct node *next;
}*startNode;
// declaring class
class LinkedList
{
public:
node* create_node(int);
void insert_last();
void sort();
void search();
void reverse();
void display();
LinkedList()
{
startNode = NULL;
}
};
// main
main()
{
int userChoice, linkedListNodes, i;
LinkedList LinkList;
startNode = NULL;
while (1)
{
// displaying menu
cout<<\" 1)Insert\";
cout<<\"2) Remove\";
cout<<\"3) Search\";
cout<<\"4) Display\";
cout<<\"5) Reverse\";
cout<<\"6) Exit \";
// reading user choice
cout<<\"Enter your userChoice : \";
cin>>userChoice;
switch(userChoice)
{
case 1:
cout<<\"Inserting node to linked list: \";
LinkList.insert_begin();
cout;
break;
case 2:
cout<<\"Delete element from linked list: \";
LinkList.delete();
break;
case 3:
cout<<\"Searching data in linked list: \";
LinkList.search();
cout;
break;
case 4:
cout<<\"Displaying linked list data: \";
LinkList.display();
cout;
break;
case 5:
cout<<\"Linked list reversing: \";
LinkList.reverse();
cout;
break;
case 6:
cout<<\"Exiting...\";
exit(1);
break;
default:
cout<<\"Enter correct userChoice\";
}
}
}
// node creating to store into list
node *LinkedList::create_node(int val)
{
struct node *tempNode, *tempNode;
tempNode = new(struct node);
if (tempNode == NULL)
{
cout<<\"No memory allocated \";
return 0;
}
else
{
tempNode->val = val;
tempNode->next = NULL;
return tempNode;
}
}
/*
* Inserting Node at last
*/
void LinkedList::insert_last()
{
int val;
cout<<\"Enter the val to be inserted: \";
cin>>val;
struct node *tempNode, *tempNode;
tempNode = create_node(val);
tempNode = startNode;
while (tempNode->next != NULL)
{
tempNode = tempNode->next;
}
tempNode->next = NULL;
tempNode->next = tempNode;
cout<<\"Element Inserted\";
}
// deleting element
void LinkedList::delete()
{
int position, i, count = 0;
if (startNode == NULL)
{
cout<<\"Linkedlist empty\"<>position;
struct node *tempNode, *ptr;
tempNode = startNode;
if (position == 1)
{
startNode = tempNode->next;
}
else
{
while (tempNode != NULL)
{
tempNode = tempNode->next;
count++;
}
if (position > 0 && position <= count)
{
tempNode = startNode;
for (i = 1;i < position;i++)
{
ptr = tempNode;
tempNode = tempNode->next;
}
ptr->next = tempNode->next;
}
else
{
cout<<\"Enter correct position\";
}
}
}
// search data in linked list
void LinkedList::search()
{
int val, position = 0;
bool flagValue = false;
if (startNode == NULL)
{
cout<<\"List is empty\";
return;
}
cout<<\"Enter the val to search: \";
cin>>val;
struct node *tempNode;
tempNode = startNode;
while (tempNode != NULL)
{
position++;
if (tempNode->val == val)
{
flagValue = true;
cout<<\"Data \"<next;
}
if (!flagValue)
cout<<\"data not found\";
}
// linkedlist reverese
void LinkedList::reverse()
{
struct node *pointer1, *pointer2, *pointer3;
if (startNode == NULL)
{
cout<<\"List is empty\"<next == NULL)
{
return;
}
pointer1 = startNode;
pointer2 = pointer1->next;
pointer3 = pointer2->next;
pointer1->next = NULL;
pointer2->.
C++ Program to Implement Singly Linked List #includei.pdf
C++ Program to Implement Singly Linked List #includei.pdfanupambedcovers /*
* C++ Program to Implement Singly Linked List
*/
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<<\"1.Insert Node at beginning\"<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (ptr->info > s->info)
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
/*
* Delete element at a given position
*/
void single_llist::delete_pos()
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<>pos;
cout<<\"Enter the new value: \";
cin>>value;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start->info = value;
}
else
{
for (i = 0;i < pos - 1;i++)
{
if (s == NULL)
{
cout<<\"There are less than \"<next;
}
s->info = value;
}
cout<<\"Node Updated\"<>value;
struct node *s;
s = start;
while (s != NULL)
{
pos++;
if (s->info == value)
{
flag = true;
cout<<\"Element \"<next;
}
if (!flag)
cout<<\"Element \"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2 = ptr3;
ptr3 = ptr3->next;
ptr2->next = ptr1;
}
start = ptr2;
}
/*
* Display Elements of a link list
*/
vo.
Im creating a skip list program for my Algorithms and Advanced Data.pdf
Im creating a skip list program for my Algorithms and Advanced Data.pdfarkmuzikllc I'm creating a skip list program for my Algorithms and Advanced Data Structure class. I was
tasked with implementing a find & add method for the skiplist. Here is my program, I'm running
into a segmentation fault when I add my second value into the skiplist. My first issue that I fixed
was that I wasn't checking the first node in the list to see if it was nullptr, but that was not my
only issue apparently.
Add Method:
void SkipList::add(const ElemType &el) {
// Create a new node with the given element
Node *newNode = new Node(el);
// Get the height of the new node
int newHeight = newNode->nodeHeight;
// If the height of the new node is greater than the current list height,
// update the list height.
if (newHeight > listHeight) {
listHeight = newHeight;
}
// Array to keep track of nodes to update
Node *update[MAX_NUM_LISTS];
// Start from the top level
Node *current = head[listHeight - 1]; // Initialize current correctly
// If the list is empty, assign the first node to head
if (head[0] == nullptr) {
head[0] = newNode;
} else {
// Loop to traverse through list
for (int i = listHeight - 1; i >= 0; i--) {
// Move forward in the current level
while (current->next[i] != nullptr && current->next[i]->elem < el) {
current = current->next[i];
}
// Store the node before which the new node should be inserted
update[i] = current;
}
// Insert the new node at each level
for (int i = 0; i < newHeight; i++) {
newNode->next[i] = update[i]->next[i];
update[i]->next[i] = newNode;
}
}
}
Find Method:
bool SkipList::find(const ElemType &el) const {
// Start from the top level
Node *current = head[listHeight - 1];
bool found = false;
// Iterate through the levels of the skip list
for (int i = listHeight - 1; i >= 0; i--) {
// Move forward in the current level until reaching the end or finding a larger element
while (current->next[i] != nullptr && current->next[i]->elem < el) {
current = current->next[i];
}
// Check if the current node's next node contains the target element
if (current->next[i] != nullptr && current->next[i]->elem == el) {
found = true; // Element found
}
}
return found; // Element not found in the skip list
}
Main:
int main()
{
ElemType inputs[] = {5, 7, 8, 10, 12, 17, 19, 22, 28, 31, 33, 35, 42, 51, 59};
SkipList list1;
cout << "For list1 (same as in the slide 10 of Skip List1 Lecture Note):\n";
// for (int i=0; i(std::size(inputs)); i++)
{
cout << "add " << inputs[i] << endl;
list1.add(inputs[i]);
cout << "list1:\n"
<< list1 << endl;
}
if (list1.find(33))
cout << "33 is found!\n";
else
cout << "33 is not found!!!!\n";
if (list1.find(70))
cout << "70 is found!\n";
else
cout << "70 is not found!!!!\n";
if (list1.find(10))
cout << "10 is found!\n";
else
cout << "10 is not found!!!!\n";
cout << "\n===================================\n";
cout << "For list2:\n";
ElemType inputs2[] = {19, 8, 17, 59, 12, 7, 5, 22, 28, 35, 33, 31, 42, 51, 10};
SkipList list2;
for (int i = 0; i < static_cast(std::size(inputs2)); i++)
{
cout << "add " << inputs2[i] << endl.
DSA(1).pptx
DSA(1).pptxDaniyalAli81 The document summarizes key concepts about linked lists including different types like singly linked lists, doubly linked lists, and circular linked lists. It provides code examples for creating nodes and performing operations like insertion, deletion, and traversal for each type of linked list. Specifically, it shows code for inserting nodes at the head, tail, and middle of singly, doubly, and circular linked lists. It also includes code for deleting nodes from singly, doubly, and circular linked lists.
C++ Program to Implement Singly Linked List #includeiostream.pdf
C++ Program to Implement Singly Linked List #includeiostream.pdfangelsfashion1 /* C++ Program to Implement Singly Linked List */
#include
#include
#include
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<next;s !=NULL;s = s->next)
{
if (ptr->info > s->info)
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}
/*
* Delete element at a given position
*/
void single_llist::delete_pos()
{
int pos, i, counter = 0;
if (start == NULL)
{
cout<<\"List is empty\"<>pos;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start = s->next;
}
else
{
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos > 0 && pos <= counter)
{
s = start;
for (i = 1;i < pos;i++)
{
ptr = s;
s = s->next;
}
ptr->next = s->next;
}
else
{
cout<<\"Position out of range\"<>pos;
cout<<\"Enter the new value: \";
cin>>value;
struct node *s, *ptr;
s = start;
if (pos == 1)
{
start->info = value;
}
else
{
for (i = 0;i < pos - 1;i++)
{
if (s == NULL)
{
cout<<\"There are less than \"<next;
}
s->info = value;
}
cout<<\"Node Updated\"<>value;
struct node *s;
s = start;
while (s != NULL)
{
pos++;
if (s->info == value)
{
flag = true;
cout<<\"Element \"<next;
}
if (!flag)
cout<<\"Element \"<next == NULL)
{
return;
}
ptr1 = start;
ptr2 = ptr1->next;
ptr3 = ptr2->next;
ptr1->next = NULL;
ptr2->next = ptr1;
while (ptr3 != NULL)
{
ptr1 = ptr2;
ptr2 = ptr3;
ptr3 = ptr3->next;
ptr2->next = ptr1;
}
start = ptr2;
}
/*
* Display Elements of a link list
*/
void single_llist::display()
{
struct node *temp;
if (sta.
Write an algorithm that reads a list of integers from the keyboard, .pdf
Write an algorithm that reads a list of integers from the keyboard, .pdfArrowdeepak Write an algorithm that reads a list of integers from the keyboard, creates
a list of them using linked list implementation, and prints the result
Solution
/*
Algorithm:
Implementation of linked list.
Create a node type class which will hold an integer and next pointer to point to another node.
Create a constructor which will construct an object of type node with the integer type data as the
only parameter
and initializing next pointer to NULL.
Create LinkedList class which will only have head pointer.
Create a constructor which will initialize this head pointer to NULL.
Create a append method which will recieve an input of type integer from the user and append it
to LinkedList
using below steps:
1.Create a Node type object.
1.IF head is NULL assign a Node type object created in 1st step.
2.IF head is not NULL then traverse to the end of the linked list till you found a Node which has
next pointer
set to NULL.
3.Add Node type object created in first step to the next pointer of last node.
Create a print method which will traverse the list from the head of the linked list to the last
node(Node
with next pointer NULL) and while traversing it will keep printing the node data.
Get the userinput:
Ask user for integer continously till user input -1 and append all the integers to the linked list.
*/
PROGRAM:
#include
using namespace std;
class Node
{
public:
int data;
Node *next;
Node(int data)
{
this->data = data;
this->next = NULL;
}
};
class LinkedList
{
private:
Node *head;
public:
LinkedList()
{
head = NULL;
}
void addToFront(int data)
{
Node *temp = new Node(data);
if(head == NULL)
head = temp;
else
{
temp->next = head;
head = temp;
}
}
void append(int data)
{
Node *temp = new Node(data);
Node *current = head;
if(current == NULL)
{
head = temp;
return;
}
while(current->next != NULL)
{
current = current->next;
}
current->next = temp;
}
void print()
{
Node *current = head;
if(current == NULL)
cout << \"No element in list. \ \";
while(current != NULL)
{
cout << current->data << \" \";
current = current->next;
}
cout << endl;
}
void deleteLinkedList()
{
Node *prev;
Node *current = head;
while(current!=NULL)
{
prev = current;
current = current->next;
delete prev;
}
}
void deleteLastNode()
{
Node *current = head;
Node *prev = NULL;
if(current == NULL)
return;
while(current->next != NULL)
{
prev = current;
current = current->next;
}
if(prev == NULL)
{
delete current;
head = NULL;
}
else
{
prev->next = NULL;
delete current;
}
}
~LinkedList()
{
deleteLinkedList();
}
};
int main()
{
LinkedList list;
int data;
while(1)
{
cout << \"Enter the integer(-1 to Quit) : \";
cin >> data;
if(data==-1)
break;
list.append(data);
}
cout << \"Content of LinkedList is : \";
list.print();
return 0;
}
OUTPUT:
Enter the integer(-1 to Quit) : 1
Enter the integer(-1 to Quit) : 2
Enter the integer(-1 to Quit) : 3
Enter the integer(-1 to Quit) : 4
Enter the integer(-1 to Quit) : -1
Content of LinkedList is : 1 2 3 4.
17 linkedlist (1)
17 linkedlist (1)Himadri Sen Gupta This document discusses linked lists and their implementation in C. It begins by describing the differences between array-based and linked list implementations. Specifically, it notes that linked lists use dynamic memory allocation and pointers to connect nodes rather than contiguous memory blocks. The document then covers creating and traversing linked lists using nodes with data fields and next pointers. It provides code examples for inserting, finding, deleting and destroying nodes in a singly linked list. Finally, it briefly lists some other common linked list operations like sorting, reversing and finding min/max elements.
Inspect the class declaration for a doubly-linked list node in Node-h-.pdf
Inspect the class declaration for a doubly-linked list node in Node-h-.pdfvishalateen Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking
on the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables: a double data value, a pointer to the next node, and a pointer to the previous
node. Each member variable is protected. So code outside of the class must use the provided
getter and setter member functions to get or set a member variable. Node.h is read only, since no
changes are required. Step 2: Implement the Insert() member function A class for a sorted,
doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList class's
Insert() member function. The function must create a new node with the parameter value, then
insert the node into the proper sorted position in the linked list. Ex: Suppose a
SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node with data
value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order
and yielding: 23 35.5 47.25 86 Step 3: Test in develop mode Code in main() takes a space-
separated list of numbers and inserts each into a SortedNumberList. The list is displayed after
each insertion. Ex: If input is 77 15 -42 63.5 then output is: List after inserting 77: 77 List after
inserting 15: 15 77 List after inserting -42: -42 15 77 List after inserting 63.5: -42 15 63.5 77 Try
various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove()
member function Implement the SortedNumberList class's Remove() member function. The
function takes a parameter for the number to be removed from the list. If the number does not
exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the
number is removed from the list and true is returned. Uncomment the commented-out part in
main() that reads a second input line and removes numbers from the list. Test in develop mode to
ensure that insertion and removal both work properly, then submit code for grading. Ex: If input
is 84 72 19 61 19 84 then output is: List after inserting 84: 84 List after inserting 72: 72 84 List
after inserting 19: 19 72 84 List after inserting 61: 19 61 72 84 List after removing 19: 61 72 84
List after removing 84: 61 72
main.cpp
#include
#include
#include
#include "Node.h"
#include "SortedNumberList.h"
using namespace std; void PrintList(SortedNumberList& list); vector SpaceSplit(string source);
int main(int argc, char *argv[]) { // Read the line of input numbers string inputLine; getline(cin,
inputLine); // Split on space character vector terms = SpaceSplit(inputLine); // Insert each value
and show the sorted list's contents after each insertion SortedNumberList list; for (auto term :
terms) { double number = stod(term); cout << "List after inserting " << number << ": " << endl;
list.Insert(number); PrintList(list); } /* // Read the input line with numbers to remove getline(cin,
inputLi.
Please refer this solution. This is working file for IntegersHeade.pdf
Please refer this solution. This is working file for IntegersHeade.pdfsooryasalini Please refer this solution. This is working file for Integers
Header file :-
-----------------------------------
#ifndef LINKEDLIST_H
#define LINKEDLIST_H
struct node{
void * data;
node * next;
};
class LinkedList
{
private:
node* head ;
int size;
public:
LinkedList();
//method to create a node
node * create(void* data);
//method to append
void append(node * item);
//method to prepend
void prepend(node * item);
//insert in ascending order
void insertAscend(node * item);
//insert in ascending order
void insertDescend(node * item);
//display all nodes
void display();
//free the list
void freeUp();
};
#endif // LINKEDLIST_H
Source file :-
----------------------------------
#include \"linkedlist.h\"
#include
#include
#include
LinkedList::LinkedList()
{
//head = (node *)malloc(sizeof(node));
size = 0;
head = NULL;
}
//method to create a node
node * LinkedList::create(void* data){
node * newNode = (node *)malloc(sizeof(node));
newNode->data = malloc(sizeof(data));
memcpy(newNode->data,data,sizeof(data));
newNode->next = NULL;
return newNode;
}
//method to append
void LinkedList::append(node * item){
if(head == NULL){
head = item;
size++;
return;
}
node* current;
current = head;
while (current->next!=NULL )
{
current = current->next;
}
current->next = item ;
size++;
}
//method to prepend
void LinkedList::prepend(node * item){
if(head == NULL){
head = item;
size++;
return;
}
item->next = head;
head = item;
size++;
}
//insert in ascending order
void LinkedList::insertAscend(node * item){
if(head == NULL){
head = item;
size++;
return;
}
node* current;
current = head;
node * prev = NULL;
bool found = false;
while (current !=NULL){
int *current_data = static_cast(current->data);
int *item_data = static_cast(item->data);
if(*item_data < *current_data){
if(prev == NULL){
item->next = current;
if(current == head){
head = item;
}
}
else{
prev->next = item;
item->next = current;
}
found = true;
break;
}
prev = current;
current = current->next;
}
if(!found){
prev->next = item;
}
size++;
}
//insert in Descending order
void LinkedList::insertDescend(node * item){
if(head == NULL){
head = item;
size++;
return;
}
node* current;
current = head;
node * prev = NULL;
bool found = false;
while (current !=NULL){
int *current_data = static_cast(current->data);
int *item_data = static_cast(item->data);
if(*item_data > *current_data){
if(prev == NULL){
item->next = current;
if(current == head){
head = item;
}
}
else{
prev->next = item;
item->next = current;
}
found = true;
break;
}
prev = current;
current = current->next;
}
if(!found){
prev->next = item;
}
size++;
}
//display all nodes
void LinkedList::display(){
int idx = 0;
node* current;
current = head;
while (current != NULL ){
idx++;
int *data = static_cast(current->data);
printf(\"data for item ::%dis :: %d\ \",idx,*data);
current = current->next;
}
}
//free the list
void LinkedList::freeUp(){
node* current;
current = head;
while (current->next!=NULL ){
head = current->next;
delete current;
current = head;
}
}
Main f.
Program In C You are required to write an interactive C program that.pdf
Program In C You are required to write an interactive C program that.pdfamitbagga0808 Program In C You are required to write an interactive C program that prompts the user for
commands, accepts commands from the keyboard (stdin) and executes those commands. When a
command requires output, it must be written to stdout. The program must continue to accept and
process commands until the user types the end command ourput, it must be writen to stdout. The
program must continue to accept and proces.commands The program deals with linked lists.
Each node of such a list contains a string of length at most 10, a positive integer (i.e., an integer
value 2 1) and a pointer to the next node of the list. For any node, the string and the integer
stored in that node will be referred to as the symbol and count for that node respectively. At all
times, the list must satisfy the following two important properties. 1. The symbols appearing in
the list are all distinct; that is, no two nodes have the same symbol. 2. When the list is scanned
from left to right, the counts must be in non-increasing order. An example of such a linked list is
shown below. Search 4 Maxval4 begin/ Loop head
Solution
/**********************************************/
/****** NAMES ******************** COMMANDS ***/
/* Insert Command : ins str */
/* Delete Command : del str */
/* Forced Delete Command : fde val */
/* Print Statistics Command : pst */
/* Print List Command : prl */
/* Print using Count Range Command: pcr v1 v2 */
/* Print Prefix Command : ppr str */
/* Print Suffix Command : psu str */
/* End Command : end */
/***********************************************/
#include
#include
#include
#define CSIZE 4
#define SSIZE 11
/* Struct for each node in the linked list */
struct node
{
int count;
char symbol[SSIZE];
struct node *next;
};
struct node *head;
/* Prototypes for the functions */
void insert(char *);
void delete(char *);
void forced_delete(int value);
void print_stats();
void print_list();
void print_count(int, int);
void print_prefix(char pre[]);
void print_suffix(char suf[]);
void sort_list();
/****************
** Main Method **
****************/
int main(void)
{
int count;
char symbol[SSIZE];
char cmd[CSIZE];
int v1;
int v2;
/* Enter commands */
printf(\"Command? \"); fflush(stdout);
scanf(\"%s\", cmd);
/* Check for command*/
while(strcmp(cmd,\"end\") != 0)
{
/* check which function to use */
if(strcmp(cmd,\"ins\") == 0) { scanf(\"%s\", symbol); insert(symbol); }
if(strcmp(cmd,\"del\") == 0) { scanf(\"%s\", symbol); delete(symbol); }
else if(strcmp(cmd,\"fde\")==0){scanf(\"%d\",&count); forced_delete(count); }
if(strcmp(cmd,\"pst\") == 0) { print_stats();}
if(strcmp(cmd,\"prl\") == 0) { print_list(); }
if(strcmp(cmd,\"pcr\") == 0) { scanf(\"%d %d\",&v1,&v2); print_count(v1,v2); }
if(strcmp(cmd,\"ppr\") == 0) { scanf(\"%s\", symbol); print_prefix(symbol);}
if(strcmp(cmd,\"psu\") == 0) { scanf(\"%s\", symbol); print_suffix(symbol);}
printf(\"Command? \"); fflush(stdout);
scanf(\"%s\", cmd);
}// End of While Loop
return 0;
}// End of main method
/*********.
Please correct my errors upvote Clears our entire .pdf
Please correct my errors upvote Clears our entire .pdfkitty811 Please correct my errors. upvote
/**
* Clears our entire list, making it empty
* Remember: All removal operations should be memory-leak free.
*/
void clear()
{
// Set a pointer to the head of the list
Node<T> *current = head_;
// Loop through each node in the list
while (current != nullptr)
{
Node<T> *next = current->getNext();
delete current;
current = next;
}
// Set head and tail pointers to null and reset the size of the list
head_ = nullptr;
tail_ = nullptr;
size_ = 0;
}
/**
* Insert an element after the node pointed to by the pos Iterator
*
* If the list is currently empty,
* ignore the iterator and just make the new node at the head/tail (list of length 1).
*
* If the incoming iterator is this->end(), insert the element at the tail
*
* Should return an iterator that points to the newly added node
*
* To avoid repeated code, it might be a good idea to have other methods
* rely on this one.
*/
Iterator insert_after(Iterator pos, const T& value) {
}
/**
* Insert a new element after the index pos.
* Should work with an empty list.
*
* Should return an iterator pointing to the newly created node
*
* To reduce repeated code, you may want to simply find
* an iterator to the node at the pos index, then
* send it to the other overload of this method.
*/
Iterator insert_after(size_t pos, const T &value)
{
Iterator it = begin();
for (size_t i = 0; i < pos && it != end(); i++)
{
++it;
}
return insert_after(it, value);
}
/**
* Erase the node pointed to by the Iterators cursor.
*
* If the 'pos' iterator does not point to a valid node,
* throw an std::range_error
*
* Return an iterator to the node AFTER the one we erased,
* or this->end() if we just erased the tail
*/
Iterator erase(Iterator pos)
{
Node<T> *node = pos.node_;
if (node == nullptr || node == head_ || node == tail_)
{
throw std::range_error("Invalid iterator");
}
Node<T> *prevNode = node->prev_;
Node<T> *nextNode = node->next_;
// Updates the next_ pointer of the previous node to point to the next node or updates the head_
pointer
if (prevNode != nullptr)
{
prevNode->next_ = nextNode;
}
else
{
head_ = nextNode;
}
if (nextNode != nullptr)
{
nextNode->prev_ = prevNode;
}
else
{
tail_ = prevNode;
}
Iterator nextIt(nextNode, head_, tail_);
delete node;
return nextIt;
}
/**
* Add an element just after the one pointed to by the 'pos' iterator
*
* Should return an iterator pointing to the newly created node
*/
Iterator push_after(Iterator pos, const T &value)
{
Node<T> *node = pos.node_;
if (node == nullptr)
{
throw std::range_error("Invalid iterator");
}
Node<T> *nextNode = node->next_;
Node<T> *newNode = new Node(value, node, nextNode);
node->next_ = newNode;
if (nextNode != nullptr)
{
nextNode->prev_ = newNode;
}
else
{
tail_ = newNode;
}
return Iterator(newNode, head_, tail_);
}
/**
* Add a new element to the front of our list.
*/
void push_front(const T &value)
{
Node<T> *new_node = new Node<T>(value, nullptr, head_);
if (head_ == nullptr)
{
tail_ = new_node;
}
else
{
head_->setPrevious(new.
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the.pdfmail931892 Help I keep getting the same error when running a code. Below is the code and the instructions
about the code.
import java.util.Arrays;
public class Album implements Comparable {
private final int id;
private final String[] artists;
private final int numSongs;
public Album(int id, String title, String[] artists, int numSongs) {
this.id = id;
this.artists = new String[]{Arrays.toString(artists)};
this.numSongs = numSongs;
}
public int getId() {
return id;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
StringBuilder artistNames = new StringBuilder();
for (String artist : artists) {
artistNames.append(artist).append(", ");
}
artistNames.delete(artistNames.length() - 2, artistNames.length());
return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]";
}
}
import java.util.Random;
public class DoublyLinkedList {
private static class Node {
T data;
Node prev;
Node next;
Node(T data) {
this.data = data;
}
}
private Node head;
private Node tail;
private int size;
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public Node append(T data) {
Node newNode = new Node<>(data);
if (head == null) {
head = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
}
tail = newNode;
size++;
return newNode;
}
public Node insert(int location, T data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node<>(data);
if (location == 0) {
newNode.next = head;
if (head != null) {
head.prev = newNode;
}
head = newNode;
if (tail == null) {
tail = newNode;
}
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
newNode.prev = current.prev;
newNode.next = current;
current.prev.next = newNode;
current.prev = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(T data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder result = new StringBuilder();
Node current = head;
while (current != null) {
result.append(current.data).append(" -> ");
current = current.next;
}
result.append("NULL");
return result.toString();
}
public Node shuffle() {
Random r.
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdf
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdfangelsfashion1 #ifndef LINKED_LIST_
#define LINKED_LIST_
template
class LinkedList {
private:
std::shared_ptr> headPtr; // Pointer to first node in the chain;
// (contains the first entry in the list)
int itemCount; // Current count of list items
std::shared_ptr> getNodeAt(int position) const;
public:
LinkedList();
LinkedList(const LinkedList& aList);
virtual ~LinkedList();
bool isEmpty() const;
int getLength() const;
bool insert(int newPosition, const ItemType& newEntry);
bool remove(int position);
void clear();
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
ItemType getEntry(int position) const throw(PrecondViolatedExcept);
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
void replace(int position, const ItemType& newEntry)
throw(PrecondViolatedExcept);
// Operator Overloading
void operator = (const LinkedList& arg);
friend std::ostream& operator << (std::ostream& os, const LinkedList& arg)
{
os << \"There are \" << arg.getLength() << \" values in the list:\" << std::endl;
for (int i{ 1 }; i <= arg.getLength(); i++) {
os << arg.getEntry(i) << std::endl;
}
os << std::endl << std::endl << std::endl << std::endl;
return os;
}
};
// Returns a pointer to the Node at the given position.
template
std::shared_ptr> LinkedList::getNodeAt (int position) const {
std::shared_ptr> currPtr{ headPtr };
for (int i{ 1 }; i < position; i++)
currPtr = currPtr->getNext();
return currPtr;
}
// Default constructor.
template
LinkedList::LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Copy constructor.
template
LinkedList::LinkedList(const LinkedList& aList) {
itemCount = aList.getLength();
auto currPtr{ aList.headPtr };
auto newNodePtr{ headPtr = std::make_shared>(currPtr->getItem()) };
auto prevNodePtr{ newNodePtr };
currPtr = currPtr->getNext();
for (int i{ 2 }; i <= itemCount; i++) {
newNodePtr = std::make_shared>(currPtr->getItem());
prevNodePtr->setNext(newNodePtr);
prevNodePtr = newNodePtr;
currPtr = currPtr->getNext();
}
}
// Destructor.
template
LinkedList::~LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Accessor/Info Functions.
template
bool LinkedList::isEmpty() const {
return (itemCount > 0)?0:1;
}
template
int LinkedList::getLength() const {
return itemCount;
}
// Places a Node at a given position (element at the same position is now pos+1).
template
bool LinkedList::insert(const int newPosition,
const ItemType& newEntry)
{
bool ableToInsert{ (newPosition >= 1) &&
(newPosition <= itemCount + 1) };
if (ableToInsert)
{
// Create a new node containing the new entry
auto newNodePtr{ std::make_shared>(newEntry) };
// Attach new node to chain
if (newPosition == 1)
{
// Insert new node at beginning of chain
newNodePtr->setNext(headPtr);
headPtr = newNodePtr;
}
else
{
// Find node that will be before new node
auto prevPtr{ getNodeAt(newPosition - 1) };
// Insert new node after node to which prevPtr points
newNodePtr->setNext(prevPtr->getNext());
prevPtr->setNext(newNodePtr);
} // end if
itemCount++; // .
More from contact41 (14)
Need to elaborate on this discussion post Marvin Mower (MM) has t.pdf
Need to elaborate on this discussion post Marvin Mower (MM) has t.pdfcontact41 Need to elaborate on this discussion post:
Marvin Mower (MM) has the right to receive payment as the work was completed to Ursula
Unhappys (UU) satisfaction at the time of service, and a document or promissory note was given
by UU stating that the work was completed and MM was owed $50. For that reason, UU is
responsible for paying MM as he is the holder of a document stating his work that was
completed and the amount owed by UU. UU may refuse the right to payment, but she would
need to prove she was not satisfied with the work done by MM. Given the document provided,
Tommy's third party (TT) can seek the amount owed from UU. UU has the responsibility to pay
TT unless she can prove she was dissatisfied with MMs work, and then that responsibility would
fall to MM to reimburse TT. If UU were to prove she was not satisfied with MMs work and the
contract was voided, TT would have the right to seek reimbursement from MM for the $40. TT
may also have the right to seek damages from MM if he can prove MM provided false
representation of the document he provided..
Manufacturing and service operations can be divided into different t.pdf
Manufacturing and service operations can be divided into different t.pdfcontact41 Manufacturing and service operations can be divided into different types of processes. Which of
the following are basic characteristics of all operations systems? (0) Systems have inputs that
make up the system, and inputs that are processed by the system. Systems consist of dynamically
linked, interdependent elements. (1) (0) Systems transform inputs into outputs by performing
certain activities on some of the inputs. (iv) A system runs better if there is no feedback from the
output side to the input side. Choose the correct answer. systiomis? 6. Systems have irputs that
make up the system, and inputs that are procesand by the aystem. () Systerrs consist of
dynamicaly inked, intertependant elements (ii) Syeterns traneform inguts into outputs by
porforming cerfain sctivitens on some of the inputa. (iv) A rystem runs bettor if there ie no
feedback froen the output sibe to the input side Chosse the corruct answer:.
Make sure its correct for a thumbs up! Thank you! 6. Suppose the qu.pdf
Make sure its correct for a thumbs up! Thank you! 6. Suppose the qu.pdfcontact41 Make sure it's correct for a thumbs up! Thank you! 6. Suppose the quantity theory holds at all
points in time so that there is an immediate and full response of the price level (and no response
of either velocity or output) of a change in the total stock of money in the economy. Andy,
Martha, and Chris make up the whole population in this economy; their holdings of money are
$60,$40, and $100, respectively. Assume that the government's holdings of money are zero (the
total stock of money is the amount of money held by both consumers and the government).
Suppose now that, as a statement of protest against his former employer - the Council of
Economic Advisers (Andy used to be an economist there) - and on live TV, Andy burns all his
money. (a) Does Andy's money fire destroy real resources? Explain. (b) Does the money fire
change the distribution of real wealth of the different people in this economy? Assume that the
money was all the wealth of these consumers (i.e., they owned no other assets) and try to
calculate how the money fire changed the real distribution of wealth. (c) If Andy's fire was
observed by Chair Powell and, as a result, he instructed his New York Fed crew to issue $60 to
fully sterilize Andy's money fire (i.e., so that the total money stock remained at $200 ), what
would the implication have been in terms of wealth redistribution? You may assume that the new
money issue is a purchase of a $60 government bond directly from the government..
John Stewart was a political candidate running for the Garden Hills .pdf
John Stewart was a political candidate running for the Garden Hills .pdfcontact41 John Stewart was a political candidate running for the Garden Hills constituency. He was behind
schedule in his campaign and wanted to have a rally to begin putting himself out to his
constituents. John however was on a very limited budget and instructed his generals not to
purchase any campaign materials unless they receive specific instructions from him to do so.
Ignoring John's instructions, one of John's generals went ahead and ordered an assortment of
campaign and rally materials. When the materials arrived John did not ask any questions as to
where they came from but instead used them and had a very successful rally. After several
weeks, the company did not receive payment for the materials after requesting the same. The
company then sued John for their money. John told them to go and get the money from whoever
ordered the materials because he never gave anyone permission to order anything. Advise the
company as to their chances of success of suing John or whether they should sue someone else.
This question relates to agency of a contract in business law.
Joe and Jessie are married and have one dependent child, Lizzie. L.pdf
Joe and Jessie are married and have one dependent child, Lizzie. L.pdfcontact41 Joe and Jessie are married and have one dependent child, Lizzie. Lizzie is currently in college at
State University. Joe works as a design engineer for a manufacturing firm, while Jessie runs a
craft business from their home. Jessie's craft business consists of making craft items for sale at
craft shows that are held periodically at various locations. Jessie spends considerable time and
effort on her craft business, and it has been consistently profitable over the years. Joe and Jessie
own a home and pay interest on their home loan (balance of $220,000) and a personal loan to
pay for Lizzie's college expenses (balance of $35,000).
Neither Joe nor Jessie is blind or over age 65, and they plan to file as married joint. Assume that
the employer portion of the self-employment tax on Jessie's income is $784. Joe and Jessie have
summarized the income and expenses they expect to report this year as follows:
Complete page 1 of Form 1040 (through taxable income, line 15), Schedule 1, and Schedule A.
Please show on an actual tax form and provide formulas for calculations if possible to see how
the answer occurred.Income:Joe's salary$ 144,700Jessie's craft sales18,460Interest from
certificate of deposit1,710Interest from Treasury bond funds728Interest from municipal bond
funds932Expenditures:Federal income tax withheld from Joe's wages$ 13,700State income tax
withheld from Joe's wages6,520Social Security tax withheld from Joe's wages7,506Real estate
taxes on residence6,320Automobile licenses (based on weight)322State sales tax
paid1,210Home mortgage interest26,600Interest on Masterdebt credit card2,420Medical
expenses (unreimbursed)1,750Joe's employee expenses (unreimbursed)2,520Cost of Jessie's craft
supplies4,920Postage for mailing crafts151Travel and lodging for craft shows2,290Self-
employment tax on Jessie's craft income1,568College tuition paid for Lizzie5,900Interest on
loans to pay Lizzie's tuition3,320Lizzie's room and board at college12,740Cash contributions to
the Red Cross555.
In the current ever-evolving landscape of higher education, the Univer.pdf
In the current ever-evolving landscape of higher education, the Univer.pdfcontact41 In the current ever-evolving landscape of higher education, the University of South Africa
(UNISA) is expanding their horizons by embarking in global journeys that does not on enrich
their academic stature but also foster collaborations with institutions worldwide. The different
academic staff explores the creation and nurturing the international partnersips while traveling
the world which contributesd to the globals reach and impact. UNISA is currently sending their
academics to different countries and universities to create the relationshsip that will benefit
UNISA and their partnering with the institutions. The key milestones for traveling include the
following: Participation in Global Conferences: The academics will present their research at
internatio.
In this lab, we will write an application to store a deck of cards i.pdf
In this lab, we will write an application to store a deck of cards i.pdfcontact41 In this lab, we will write an application to store a deck of cards in a linked list, and then write
methods to sort and shuffle the deck.
Copy your completed LinkedList class from Lab 4 into the LinkedList.java file below.
Complete all methods of the Card class as described by the Javadoc comments. The class
contains both a suit and a rank. A suit is one of the categories into which the cards of a deck are
divided. The rank is the relative importance of the card within its suit.
Note that the Card constructor must convert any rank and suit letters to uppercase.
For the equals() method, be sure to follow the steps outlined in Lesson 4. How to implement the
compareTo() method is also covered in Lesson 4.
Note that you are not allowed to add any additional methods or member variables to this class or
you will not receive credit for this assignment.
Complete all methods of the CardApp class in the CardApp.java file as described by the Javadoc
comments.
You may add as many methods as you would like to this file, but are not allowed to add any
additional member variables.
The CardApp program must prompt for and allow the user to enter the name of any input file as
shown in the Example output below.
Implement the shuffle() method as specified in the comments for shuffle(). After you have
shuffled the deck of cards, write the result into a file named shuffled.txt.
Implement the sort() method using bubble sort from Lesson 4. First sort by suit in alphabetical
order and then by rank from 2 to A. The pseudocode for bubble sort is as follows:
After you have sorted the deck of cards, write the result to a file named sorted.txt.
The CardApp.java file also contains the main() method of the application. Use Develop mode to
test your CardApp code along with your Card and LinkedList code.
All input and output files must contain a list of cards, with each card stored on its own line. See
the example files cards1.txt and cards2.txt for example file formats.
[[[cards1.txt]]]
2H
3H
4H
5H
6H
7H
8H
9H
10H
JH
[[[cards2.txt]]]
AS
2S
3S
4S
5S
6S
7S
8S
9S
10S
JS
QS
KS
AC
2C
3C
4C
5C
6C
7C
8C
9C
10C
JC
QC
KC
AH
2H
3H
4H
5H
6H
7H
8H
9H
10H
JH
QH
KH
AD
2D
3D
4D
5D
6D
7D
8D
9D
10D
JD
QD
KD
[[[CardApp.java]]]
/**
* CardApp.java
* @author Your name
* @author Partner's name
* CIS 22C, Applied Lab 1
*/
public class CardApp {
private LinkedList list;
/**
* User interface prompts user, reads and writes files.
*/
public static void main(String[] args) {
}
/**
* Default constructor to initialize the deck
*/
public CardApp() {
}
/**
* Inserts a new Card into the deck
* @param card a playing Card
*/
public void addCard(Card card) {
}
/**
* Shuffles cards following this algorithm:
* First swaps first and last card
* Next, swaps every even card with the card 3
* nodes away from that card. Stops when it
* reaches the 3rd to last node
* Then, swaps ALL cards with the card that is
* 2 nodes away from it, starting at the 2nd card
* and stopping stopping at the 3rd to last node
*/
public vo.
Imagine youre part of a security team of a startup that is creating.pdf
Imagine youre part of a security team of a startup that is creating.pdfcontact41 Imagine you're part of a security team of a startup that is creating a next-generation social
networking platform that encourages users to share personal experiences, thoughts, and
multimedia content. This platform aims to rival existing popular platforms by offering innovative
features (e.g., AI friend-bots, AI-assisted post editing, etc.) and a seamless user experience.
Questions:
1. Discuss the potential trade-offs between implementing robust security measures and
providing a smooth, intuitive user experience. Can you think of real-world examples where a
company's decision to prioritize one over the other has led to either success or failure?
2. Propose a creative feature or mechanism that could enhance both the security and usability of
this social networking platform. How would this innovation address potential vulnerabilities
while ensuring a positive user experience?.
In September 2016, the bodies of two children and their father were .pdf
In September 2016, the bodies of two children and their father were .pdfcontact41 In September 2016, the bodies of two children and their father were found in a house in
Segambut, Kuala Lumpur. The surviving two children told stories of a violent father and a
mother who were both jobless. People are speculating about the reasons behind this tragedy. It
must have been a very difficult situation to survive in a city without jobs and have four children,
even with support, even with support from the childrens paternal grandfather.
Being poor, in a city can be harder compared to rural areas, as the cost of living in rural
areas in cheaper. There is no shortage of housing in rural areas and food supplies can be
supplemented by farming, such as growing ones own vegetable and rearing chickens. People
cannot do in flats in urban areas. There has been major shift of the population, with about 70%
of Malaysians now living in urban areas compared to 20 years ago. Urban poverty is becoming
a more serious problem compared to rural poverty, as there are not enough policies to help
those affected by urban poverty.
Urban poverty remains a worrying problem as the average household income does not
necessary match the escalating cost of living today. The shrinking ringgit and growing inflation
have affected the standard of the living in Malaysia. The budget 2017 should focus more on
helping the urban poor. Malaysian are faced with the rising cost of living, lack of affordable
housing, low EPF retirement savings, lower wages and inflation. Unskilled and semi- skilled
workers, will be the most vulnerable groups. As Malaysian has a large number of low to middle-
income group, we need to ensure that the cost of living is manageable and find ways to
accelerate the income of urban poor.
Sources: Adapted from Poor in the city. The Star Online, 2016.
Questions:
1) Based on the articles, what is the causes of increasing in living standard in urban area?
2) According to the articles, current policies not enough to help those affected by urban poverty.
Any suggestions policies should focus on urban poverty especially M40.
3) As policy makers, discuss measures undertaken by the Malaysian government to narrow the
inter-region gap?.
Im writing an abstract class in java right now for this json file a.pdf
Im writing an abstract class in java right now for this json file a.pdfcontact41 I'm writing an abstract class in java right now for this json file and I'm not too sure why my code
is wrong.
7 usages int numMember; // number of members in Department 9 usages int numProject; //
number of currently working projects 2 usages private Project[] projects; // currently working
projects 1 usage private Employee[] members; // employees working in the department 7 usages
Employee leader; // leader of department 6 usages public Department(int numMember, int
numProject, Project[] projects, Employee[] members, Employee leader) \{ this. numMember =
numMember; this.numProject = numProject; this.projects = projects; this.members = members;
this. .eader = leader; \} 6 implementations public abstract void displayDetails(); 4
implementations abstract void addProjects(Project newProject); // more attributes if necessary
class Mobile extends Department \{ public Mobile(int numMember, int numProject, Project[]
projects, Employee[] members, Employee leader) \{ super(numMember, numProject,projects,
members, leader); // more attributes if necessary class Mobile extends Department \{ public
Mobile(int numMember, int numProject, Project[] projects, Employee[] members, Employee
leader) \{ super (numMember, numProject, projects, members, leader);
\} @override public void displayDetails() \{ System.out.println("Members: " + numMember);
System.out.println("Number of Projects: " + numProject); System.out.println("Leader: " +
leader); \} Qoverride void addProjects(Project newProject) \{ projects [numProject ]=
newProject; numProject++; System.out.println("Project added to Mobile Department: " +
newProject.getProjectName()); \} \}
"Name": "ACE Company", "Year": "2001", "CEO": "Ontaria Laker", "Number of Departments":
6, "Number of Employees": 7, "Departments": [ \{ "Name": "Mobile", "Leader": "David
Collins", "Number of Current Working Projects": 1, "Projects": ["ACE App"] \},\{ "Name":
"Test", "Leader": "Alice Wonderland", "Number of Current Working Projects": 0 , "Projects": []
\},\{ "Name": "Game", "Leader": "Hulk Hogan", "Number of Current Working Projects": 1,
"Projects": ["Ace Ventura"] \},\{ "Name": "Web", "Leader": "Bruce Duster", "Number of
Current Working Projects": 3, "Projects": ["ACE Platform", "ACE App", "ACE Support"] \},\{
"Name": "Maintenance",
\},\{ "Name": "Maintenance", "Leader": "Donald Kennedy", "Number of Current Working
Projects": 2, "Projects": ["ACE Platform", "ACE Support"] \},\{ "Name": "Service", "Leader":
"Lauren Liu", "Number of Current Working Projects": 1, "Projects": ["ACE Support"] \} \},\{
"Name": "Maintenance", "Leader": "Donald Kennedy", "Number of Current Working Projects":
2, "Projects": ["ACE Platform", "ACE Support"] \},\{ "Name": "Service", "Leader": "Lauren
Liu", "Number of Current Working Projects": 1, "Projects": ["ACE Support"] \}.
Imagine you are a cybersecurity consultant tasked with designing aut.pdf
Imagine you are a cybersecurity consultant tasked with designing aut.pdfcontact41 Imagine you are a cybersecurity consultant tasked with designing authentication and
authorization schemes for two distinct systems: an air traffic controller terminal and a school's
front office desk computer. Both systems handle sensitive information and require careful
consideration of security measures. Your goal is to ensure seamless and efficient access for
authorized personnel while minimizing potential risks.
Briefly compare the critical security requirements for an air traffic controller terminal and a
school's front office desk computer. What unique challenges do each of these systems present in
terms of authentication and authorization?
Consider factors such as the nature of the information handled, potential consequences of
unauthorized access, and the specific roles of personnel. Given the complexity and high-stakes
nature of air traffic control operations, discuss which authentication methods would be most
suitable for the air traffic controller terminal. Justify your choices by weighing the advantages
and disadvantages of various method..
Im looking for coding help I dont really need this to be explained.pdf
Im looking for coding help I dont really need this to be explained.pdfcontact41 I'm looking for coding help I don't really need this to be explained
I'm currently trying to draw a grid and a cube but I also need that cube to rotate
issue is I've been given so much information at once and there are so many missing pieces
mostly do to it not being explained or I've forgotten how to do it that I'm just at a lost
Here's my current code
Defines.h
#pragma once
#define Width 500
#define Height 500
#define NumPixels (Width * Height)
unsigned colorArray[NumPixels];
void ColorBuffer(unsigned int color)
{
for (unsigned int i = 0; i < NumPixels; i++)
{
colorArray[i] = color;
}
}
void drawPixel(unsigned int x, unsigned int y, unsigned int color)
{
unsigned int index = convertCoords(x, y);
colorArray[index] = color;
}
struct Float4
{
union
{
struct
{
float V[4];
};
struct
{
float x;
float y;
float z;
float w;
};
};
};
struct Matrix4x4
{
union
{
struct
{
float V[16];
};
struct
{
float xx;
float xy;
float xz;
float xw;
float yx;
float yy;
float yz;
float yw;
float zx;
float zy;
float zz;
float zw;
float wx;
float wy;
float wz;
float ww;
};
struct
{
Float4 AxisX;
Float4 AxisY;
Float4 AxisZ;
Float4 AxisW;
};
};
};
struct Vertex {
Float4 Position;
unsigned int color;
};
MyMath.h
#pragma once
#include "Defines.h"
float DotProduct(Float4 v1, Float4 v2)
{
return (v1.x * v2.x) + (v1.y * v2.y) + (v1.z * v2.z) + (v1.w * v2.w);
}
Matrix4x4 MultiplyMatrixByMatrix(const matrix& m1, const matrix& m2)
{
Matrix4x4 mOut;
mOut.xx = DotProduct(m1.Row0, m2.Column0);
mOut.xy = DotProduct(m1.Row0, m2.Column1);
mOut.xz = DotProduct(m1.Row0, m2.Column2);
mOut.xw = DotProduct(m1.Row0, m2.Column3);
mOut.yx = DotProduct(m1.Row1, m2.Column0);
mOut.yy = DotProduct(m1.Row1, m2.Column1);
mOut.yz = DotProduct(m1.Row1, m2.Column2);
mOut.yw = DotProduct(m1.Row1, m2.Column3);
mOut.zx = DotProduct(m1.Row2, m2.Column0);
mOut.zy = DotProduct(m1.Row2, m2.Column1);
mOut.zz = DotProduct(m1.Row2, m2.Column2);
mOut.zw = DotProduct(m1.Row2, m2.Column3);
mOut.wx = DotProduct(m1.Row3, m2.Column0);
mOut.wy = DotProduct(m1.Row3, m2.Column1);
mOut.wz = DotProduct(m1.Row3, m2.Column2);
mOut.ww = DotProduct(m1.Row3, m2.Column3);
return mOut;
}
unsigned int convertCoords(unsigned int x, unsigned int y)
{
return y * Width + x;
}
RasterFunc.h
#pragma once
#include "Shaders.h"
// Draws a line using one of the line equations.
void DrawLine(const Vertex& start, const Vertex& end)
{
// Copy input data and send through shaders
Vertex copy_start = start;
Vertex copy_end = end;
// Use vertex shader to modify incoming copies only.
if (VertexShader)
{
VertexShader(copy_start);
VertexShader(copy_end);
}
// original plotting variables adapted to use new cartesian data
SCREEN_XY screen_start = CartesianToScreen(copy_start);
SCREEN_XY screen_end = CartesianToScreen(copy_end);
// Standard line drawing code follows using integer coordinates...
for (numPixels)
{
A_PIXEL copyColor = currColor; // Just like a Vertex, copy original.
if (PixelShader) PixelShader(copyColor); // Modify copy.
PlotPixel(currX, c.
I. Common stocks increase. III. Accounts .pdf
I. Common stocks increase. III. Accounts .pdfcontact41 I. Common stocks increase. III. Accounts receivable increase.
II. Accounts payable decrease. IV. Inventory decreases.
A) I only C) II and III only
B) I and IV only D) I, II, and III only
2. Which of the following would be considered an increase in cash or cash availability?
I. Inventories increase. III. Accounts receivables decrease.
II. Common stocks increase. IV. Gross fixed assets increase.
A) II only C) II and III only
B) I and III only D) I, III, and IV only
3. The purchase of inventory on credit (increases, decreases) both accounts payable and
inventory, which are balance sheet accounts. It would, therefore, have (no, a positive, a negative)
effect on the income statement until it is sold.
4. Cash collected on accounts receivable produces (an increase, a decrease) in cash and (an
increase, a decrease) in accounts receivable, so that there is (no, a positive, a negative) change in
the asset accounts.
5 Which of the following accounts would not be involved in preparing the income statement?
A) Depreciation expense C) Accumulated depreciation
B) Accumulated retain earnings D) Retained earnings
E) B and C
Answer all 5 quick questions for upvote! THanks ensure correct please.
I. Inventories increase. III. Accounts rece.pdf
I. Inventories increase. III. Accounts rece.pdfcontact41 I. Inventories increase. III. Accounts receivables decrease.
II. Common stocks increase. IV. Gross fixed assets increase.
A) II only C) II and III only
B) I and III only D) I, III, and IV only
2. Which of the following are considered a decrease in cash (or cash availability)?
I. Common stocks increase. III. Accounts receivable increase.
II. Accounts payable decrease. IV. Inventory decreases.
A) I only C) II and III only
B) I and IV only D) I, II, and III only
Please answer two quick questions for upvote! thanks.
Ad
Recently uploaded (20)
Odoo Inventory Rules and Routes v17 - Odoo Slides
Odoo Inventory Rules and Routes v17 - Odoo SlidesCeline George Odoo's inventory management system is highly flexible and powerful, allowing businesses to efficiently manage their stock operations through the use of Rules and Routes.
How to Set warnings for invoicing specific customers in odoo
How to Set warnings for invoicing specific customers in odooCeline George Odoo 16 offers a powerful platform for managing sales documents and invoicing efficiently. One of its standout features is the ability to set warnings and block messages for specific customers during the invoicing process.
To study the nervous system of insect.pptx
To study the nervous system of insect.pptxArshad Shaikh The *nervous system of insects* is a complex network of nerve cells (neurons) and supporting cells that process and transmit information. Here's an overview:
Structure
1. *Brain*: The insect brain is a complex structure that processes sensory information, controls behavior, and integrates information.
2. *Ventral nerve cord*: A chain of ganglia (nerve clusters) that runs along the insect's body, controlling movement and sensory processing.
3. *Peripheral nervous system*: Nerves that connect the central nervous system to sensory organs and muscles.
Functions
1. *Sensory processing*: Insects can detect and respond to various stimuli, such as light, sound, touch, taste, and smell.
2. *Motor control*: The nervous system controls movement, including walking, flying, and feeding.
3. *Behavioral responThe *nervous system of insects* is a complex network of nerve cells (neurons) and supporting cells that process and transmit information. Here's an overview:
Structure
1. *Brain*: The insect brain is a complex structure that processes sensory information, controls behavior, and integrates information.
2. *Ventral nerve cord*: A chain of ganglia (nerve clusters) that runs along the insect's body, controlling movement and sensory processing.
3. *Peripheral nervous system*: Nerves that connect the central nervous system to sensory organs and muscles.
Functions
1. *Sensory processing*: Insects can detect and respond to various stimuli, such as light, sound, touch, taste, and smell.
2. *Motor control*: The nervous system controls movement, including walking, flying, and feeding.
3. *Behavioral responses*: Insects can exhibit complex behaviors, such as mating, foraging, and social interactions.
Characteristics
1. *Decentralized*: Insect nervous systems have some autonomy in different body parts.
2. *Specialized*: Different parts of the nervous system are specialized for specific functions.
3. *Efficient*: Insect nervous systems are highly efficient, allowing for rapid processing and response to stimuli.
The insect nervous system is a remarkable example of evolutionary adaptation, enabling insects to thrive in diverse environments.
The insect nervous system is a remarkable example of evolutionary adaptation, enabling insects to thrive
apa-style-referencing-visual-guide-2025.pdf
apa-style-referencing-visual-guide-2025.pdfIshika Ghosh Title: A Quick and Illustrated Guide to APA Style Referencing (7th Edition)
This visual and beginner-friendly guide simplifies the APA referencing style (7th edition) for academic writing. Designed especially for commerce students and research beginners, it includes:
✅ Real examples from original research papers
✅ Color-coded diagrams for clarity
✅ Key rules for in-text citation and reference list formatting
✅ Free citation tools like Mendeley & Zotero explained
Whether you're writing a college assignment, dissertation, or academic article, this guide will help you cite your sources correctly, confidently, and consistent.
Created by: Prof. Ishika Ghosh,
Faculty.
📩 For queries or feedback: [email protected]
Contact Lens:::: An Overview.pptx.: Optometry
Contact Lens:::: An Overview.pptx.: OptometryMushahidRaza8 A comprehensive guide for Optometry students: understanding in easy launguage of contact lens.
Don't forget to like,share and comments if you found it useful!.
Real GitHub Copilot Exam Dumps for Success
Real GitHub Copilot Exam Dumps for SuccessMark Soia Download updated GitHub Copilot exam dumps to boost your certification success. Get real exam questions and verified answers for guaranteed performance
Presentation on Tourism Product Development By Md Shaifullar Rabbi
Presentation on Tourism Product Development By Md Shaifullar RabbiMd Shaifullar Rabbi Presentation on Tourism Product Development By Md Shaifullar Rabbi, Assistant Manager- SABRE Bangladesh.
Operations Management (Dr. Abdulfatah Salem).pdf
Operations Management (Dr. Abdulfatah Salem).pdfArab Academy for Science, Technology and Maritime Transport This version of the lectures is provided free of charge to graduate students studying the Operations Management course at the MBA level.
World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...
World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...larencebapu132 This is short and accurate description of World war-1 (1914-18)
It can give you the perfect factual conceptual clarity on the great war
Regards Simanchala Sarab
Student of BABed(ITEP, Secondary stage)in History at Guru Nanak Dev University Amritsar Punjab 🙏🙏
Kenan Fellows Participants, Projects 2025-26 Cohort
Kenan Fellows Participants, Projects 2025-26 CohortEducationNC These are the educators participating in the Kenan Fellows Program for Teacher Leadership at NC State University.
"Basics of Heterocyclic Compounds and Their Naming Rules"
"Basics of Heterocyclic Compounds and Their Naming Rules"rupalinirmalbpharm This video is about heterocyclic compounds, which are chemical compounds with rings that include atoms like nitrogen, oxygen, or sulfur along with carbon. It covers:
Introduction – What heterocyclic compounds are.
Prefix for heteroatom – How to name the different non-carbon atoms in the ring.
Suffix for heterocyclic compounds – How to finish the name depending on the ring size and type.
Nomenclature rules – Simple rules for naming these compounds the right way.
Common rings – Examples of popular heterocyclic compounds used in real life.
How to manage Multiple Warehouses for multiple floors in odoo point of sale
How to manage Multiple Warehouses for multiple floors in odoo point of saleCeline George The need for multiple warehouses and effective inventory management is crucial for companies aiming to optimize their operations, enhance customer satisfaction, and maintain a competitive edge.
Introduction-to-Communication-and-Media-Studies-1736283331.pdf
Introduction-to-Communication-and-Media-Studies-1736283331.pdfjames5028 Introduction-to-Communication and media studies
pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulse
pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulsesushreesangita003 what is pulse ?
Purpose
physiology and Regulation of pulse
Characteristics of pulse
factors affecting pulse
Sites of pulse
Alteration of pulse
for BSC Nursing 1st semester
for Gnm Nursing 1st year
Students .
vitalsign
Biophysics Chapter 3 Methods of Studying Macromolecules.pdf
Biophysics Chapter 3 Methods of Studying Macromolecules.pdfPKLI-Institute of Nursing and Allied Health Sciences Lahore , Pakistan. This chapter provides an in-depth overview of the viscosity of macromolecules, an essential concept in biophysics and medical sciences, especially in understanding fluid behavior like blood flow in the human body.
Key concepts covered include:
✅ Definition and Types of Viscosity: Dynamic vs. Kinematic viscosity, cohesion, and adhesion.
⚙️ Methods of Measuring Viscosity:
Rotary Viscometer
Vibrational Viscometer
Falling Object Method
Capillary Viscometer
🌡️ Factors Affecting Viscosity: Temperature, composition, flow rate.
🩺 Clinical Relevance: Impact of blood viscosity in cardiovascular health.
🌊 Fluid Dynamics: Laminar vs. turbulent flow, Reynolds number.
🔬 Extension Techniques:
Chromatography (adsorption, partition, TLC, etc.)
Electrophoresis (protein/DNA separation)
Sedimentation and Centrifugation methods.
How to track Cost and Revenue using Analytic Accounts in odoo Accounting, App...
How to track Cost and Revenue using Analytic Accounts in odoo Accounting, App...Celine George Analytic accounts are used to track and manage financial transactions related to specific projects, departments, or business units. They provide detailed insights into costs and revenues at a granular level, independent of the main accounting system. This helps to better understand profitability, performance, and resource allocation, making it easier to make informed financial decisions and strategic planning.
Operations Management (Dr. Abdulfatah Salem).pdf
Operations Management (Dr. Abdulfatah Salem).pdfArab Academy for Science, Technology and Maritime Transport
Biophysics Chapter 3 Methods of Studying Macromolecules.pdf
Biophysics Chapter 3 Methods of Studying Macromolecules.pdfPKLI-Institute of Nursing and Allied Health Sciences Lahore , Pakistan.
Ad
Node file code below#ifndef NODE_H#define NODE_H#include .pdf
- 1. Node file code below #ifndef NODE_H #define NODE_H #include using namespace std; // the node class Node{ public: int value; // Array of pointers to the next nodes (which may be located at various levels) // next[i] is the next link for level i // the size of this vector determines the number of levels that the current node is part of vector next; vector prev; // previous links for each level the node is part of Node(int val, int level){ value = val; next = vector(level+1, nullptr); // initialize array of pointers to nulls prev = vector(level+1, nullptr); // initialize array of pointers to nulls }; }; #endif SKIPLIST.H FILE CODE BELOW #include #include #include #include #include
- 2. #include #include "Node.h" #ifndef SKIPLIST_H #define SKIPLIST_H using namespace std; class SkipList{ public: // Maximum allowed level index int MAXIMUM_ALLOWED_LEVEL_INDEX; // current maximum level amongst the inserted nodes int currentHighestLevelIndex; // the head node's next links are connected to the first node at every level Node *head; Node* tail; // last node at every level SkipList(int maxLevels){ MAXIMUM_ALLOWED_LEVEL_INDEX = maxLevels; // initially we have the bottom-most level only currentHighestLevelIndex = 0; // create the header node, value is irrelevant (as long as it doesn't match an inserted value - NO REPEATS), number of next links is important (initially this node is the first node at every level) head = new Node(INT_MIN, MAXIMUM_ALLOWED_LEVEL_INDEX);
- 3. tail = new Node(INT_MAX, MAXIMUM_ALLOWED_LEVEL_INDEX); // last nodes at each level // connect head to tail at every level for(int i = 0; i <= MAXIMUM_ALLOWED_LEVEL_INDEX; i++){ head->next[i] = tail; // head's prev is null tail->prev[i] = head; // tail's next is null } } int RandomLevel(){ float probablity = (float)rand()/RAND_MAX; // flip a coin int lvl = 0; while (probablity < 0.5 && lvl < MAXIMUM_ALLOWED_LEVEL_INDEX){ lvl++; // landed heads so increase level by 1 probablity = (float)rand()/RAND_MAX; // flip a coin again } return lvl; } Node* CreateNode(int value, int level){ // create a new node with next links for every level that this node will be part of // it will use these links to connect to the next node at each level return new Node(value, level); } void InsertElement(int value){ Node *current = head; // start at head node vector update(MAXIMUM_ALLOWED_LEVEL_INDEX+1, nullptr); // this will hold the nodes that need updating at every level after the insert takes place for (int i = currentHighestLevelIndex; i >= 0; i--){ // start at the highest level and move down so that more nodes may be skipped // for level i, if value is to be inserted here then find out where (i.e. after which node) while (current->next[i] != nullptr && current->next[i]->value < value){
- 4. current = current->next[i]; } // found the node after which the value is to be placed at level i update[i] = current; // move down a level, if possible } // at level 0, where current is pointing to by the end of the preceding loop, move over one node to the right where the value is to be inserted to see if the value already exists there (NO REPEATS allowed) current = current->next[0]; if (current == nullptr || current->value != value){ int ranLevel = RandomLevel(); // choose a random level upto where the new node will be placed (starting from level 0) if (ranLevel > currentHighestLevelIndex){ // if random level for current node is higher than the current maximum level for existing nodes; then set head as the node after which the new value is to be inserted for each level over current maximum to the level chosen for new value to be inserted (update currently contains nulls for these level(s)). for (int i = currentHighestLevelIndex+1; i <= ranLevel; i++){ update[i] = head; } // also change the current maximum level for the existing nodes currentHighestLevelIndex = ranLevel; } // create new node with next links for every level from ranLevel to zero Node* n = CreateNode(value, ranLevel); // placing new node in the correct place at every level for (int i = 0; i<=ranLevel; i++){ // n connects as a new node between update[i] and update[i]->next[i] n->next[i] = update[i]->next[i];
- 5. n->prev[i] = update[i]; // update[i] connects to n (update[i] is the node before n) update[i]->next[i] = n; // n->next[i] (this was originally update[i]->next[i], the node that should be after n) connects back to n n->next[i]->prev[i] = n; } } } void Delete(int value){ // remove value from skip list (all levels) if it exists (output a message if it does not exist) Node *current = head; // start at head node vector update(MAXIMUM_ALLOWED_LEVEL_INDEX+1, nullptr); // this will hold the nodes that need updating at every level after the delete takes place for (int i = currentHighestLevelIndex; i >= 0; i--){ // start at the highest level and move down so that more nodes may be skipped // for level i, if value is to be deleted from here then find out where from (i.e. after which node could it be) while (current->next[i] != nullptr && current->next[i]->value < value){ current = current->next[i]; // moving right on level i } if(current->next[i] != nullptr && current->next[i]->value == value){ // found the node after which exists the target node (node that is to be deleted from level i) update[i] = current; } // move down a level, if possible } // at level 0, where current is pointing to by the end of the preceding loop, move over one node to the right to see value exists there before we try to delete it current = current->next[0];
- 6. if (current != nullptr && current->value == value){ // value exists at level 0, so delete it from all levels where it is located. for (int i = 0; i <= currentHighestLevelIndex; i++){ if(update[i]){ // first we ensure that value exists at level i (otherwise update[i] will be null) // update[i] connects to the node after current (current->next[i]) update[i]->next[i] = current->next[i]; // current->next[i] (the node that should be after update[i]) connects back to update[i] current->next[i]->prev[i] = update[i]; // disconnect current from level i - are these necessary? current->next[i] = nullptr; current->prev[i] = nullptr; } } // delete current delete current; // update currentHighestLevelIndex if necessary while (currentHighestLevelIndex >= 0 && head->next[currentHighestLevelIndex] == tail){ currentHighestLevelIndex--; } } else{ // if update[0] is nullptr then preceding loop was unable to find value at level 0 cout << "Value " << value << " does not exist in the skip list.n"; } } bool Search(int value){ // TO BE COMPLETED // search for value in skip list and return true if it exists; false otherwise
- 7. Node *current = head; // start at head node for (int i = currentHighestLevelIndex; i >= 0; i--){ // start at the highest level and move down so that more nodes may be skipped // for level i, keep moving right while values are less than what we are looking for (and if it is possible to move any further right while (current->next[i] != nullptr && current->next[i]->value < value){ current = current->next[i]; // moving right } if(current->next[i] != nullptr && current->next[i]->value == value){ return true; // found the value at level i } // move down a level, if possible } return false; // value not found, we are at level 0 and to the farthest right at level 0 (value always exists at level 0 if in the list) } void ShowForward(){ cout << "Showing forward:n"; for (int i = currentHighestLevelIndex; i >= 0;i--){ Node *node = head->next[i]; cout << "Level " << i << ": "; while (node != nullptr && node->next[i] != tail){ cout << node->value << " -> "; node = node->next[i]; } if(node){ cout << node->value << " .n"; } else{ cout << " .n"; } } }
- 8. void ShowBackward(){ cout << "Showing backward:n"; for (int i = currentHighestLevelIndex; i >= 0;i--){ Node *node = tail->prev[i]; cout << "Level " << i << ": "; while (node != nullptr && node->prev[i] != head){ cout << node->value << " -> "; node = node->prev[i]; } if(node){ cout << node->value << " .n"; } else{ cout << " .n"; } } } }; #endif PRIORITYQ file code below #ifndef PRIORITYQ_H #define PRIORITYQ_H #include #include #include #include #include "Skiplist.h" using namespace std; class PriorityQ{ public: Node *head;
- 9. Node *tail; int priority; int maxlevel; PriorityQ(int Level){ srand(time(0)); //priority = rand() % (Level-1); maxlevel = Level-1; head = new Node(INT_MIN, Level-1); tail = new Node(INT_MAX, Level-1); } bool isEmpty() { return head->next[0] == tail; } void enqueue(int data) { priority = rand() % (maxlevel + 1); //cout << "priority " << priority << endl; Node *curr = head; for (int i = maxlevel; i >= 0; i--) { curr = head; while (curr->next[i] != nullptr && curr->next[i]->value < data) { curr = curr->next[i]; } if (i <= priority) { Node *newNode = new Node(data, i); newNode->next[i] = curr->next[i]; curr->next[i] = newNode; } } } void dequeue(int value, int level) { for (int i = level; i >= 0; i--) { Node *curr = head->next[i]; while (curr->next[i] != nullptr && curr->value < value) {
- 10. if(curr->value == value){ Node *temp = curr; curr->prev[i]->next[i] = curr->next[i]; curr->next[i]->prev[i]=curr->prev[i]; curr = curr->next[i]; delete temp; } curr = curr->next[i]; } } } void process() { for (int i = maxlevel; i >= 0; i--) { Node *curr = head; cout << "Process " << i << ": "; while (curr->next[i] != tail) { cout << curr->next[i]->value << ", "; dequeue(curr->next[i]->value, i); curr = curr->next[i]; } } } void show(){ for (int i = maxlevel; i >= 0;i--){ Node *node = head->next[i]; cout << "Level " << i << ": "; while (node != nullptr && node->next[i] != tail){ cout << node->value << " -> "; node = node->next[i]; } if(node){ cout << node->value << " .n"; } else{ cout << " .n";
- 11. } } } }; #endif in my priorityq file code my process method is not working correctly, its outputting the below Level 2: 5 -> 55 -> . Level 1: 5 -> 10 -> 55 -> 1000 -> . Level 0: 2 -> 5 -> 10 -> 22 -> 55 -> 700 -> 1000 -> . Process 2: 5, 55, WHEN l should be getting Level 2: 5 -> 55 -> . Level 1: 5 -> 10 -> 55 -> 1000 -> . Level 0: 2 -> 5 -> 10 -> 22 -> 55 -> 700 -> 1000 -> . Process 2: 5, 55, Process 1: 10,1000 Process 0 2,22,700 please fix my process and dequeue code if you see the problem