Using following main file and solve the taskInst.pdf

•

0 likes•3 views

Using following main file and solve the task Instead of ID and GPA, now consider following fields: Name, ID and Contact numberInsert last (already done)Display All (already done)Insert at the beginningDelete the first elementDelete the last elementSearch an element (by ID)Insert after an elementDisplay how many elements are there in the listFind the element with highest (biggest) IDFind the element with lowest (smallest) ID // main file please solve all it ... Thank You :) Using following main file and solve the task Instead of ID and GPA, now consider following fields: Name, ID and Contact numberInsert last (already done)Display All (already done)Insert at the beginningDelete the first elementDelete the last elementSearch an element (by ID)Insert after an elementDisplay how many elements are there in the listFind the element with highest (biggest) IDFind the element with lowest (smallest) ID // main file please solve all it ... Thank You :) Instead of ID and GPA, now consider following fields: Name, ID and Contact numberInsert last (already done)Display All (already done)Insert at the beginningDelete the first elementDelete the last elementSearch an element (by ID)Insert after an elementDisplay how many elements are there in the listFind the element with highest (biggest) IDFind the element with lowest (smallest) ID // main file please solve all it ... Thank You :) // main file please solve all it ... Thank You :) Solution // main file #include #include using namespace std; struct node{ //change to name , ID and contact number string name; int ID; ; string phone; //double GPA; node *link; }; node *head=NULL, *t; void insertNode() { node *temp=new node; cout<<\"Enter name..\"; cin>>temp->name; cout<<\"Enter the ID..\"; cin>>temp->ID; cout<<\"Enter Phone..\"; cin>>temp->phone; temp->link=NULL; if(head==NULL)//list is empty { head=temp; } else { t=head; while(t->link!=NULL) t=t->link; t->link=temp; } } void displayAll() { node *t=head; while(t!=NULL) { cout<<\"Name=\"<name<ID<phone<link; } } void isertAtbegin() { node *cur = head; node *temp=new node; cout<<\"Enter name..\"; cin>>temp->name; cout<<\"Enter the ID..\"; cin>>temp->ID; cout<<\"Enter Phone..\"; cin>>temp->phone; head = temp; temp->link = cur; } void deleteFirstElement() { node *cur = head,*prev=head; head = head->link; free(cur); } void searchElement(int ID) { node *cur = head; int found = 0,pos=0; while( cur!=NULL) { if( ID == cur->ID ) { found = 1; break; } cur = cur->link; ++pos; } if( found ) cout<<\"Element with Id= \"<link; node *temp=new node; cout<<\"Enter name..\"; cin>>temp->name; cout<<\"Enter the ID..\"; cin>>temp->ID; cout<<\"Enter Phone..\"; cin>>temp->phone; temp->link=next; cur->link = temp; break; } cur = cur->link; ++pos; } } void displayNumberOfelements() { node *cur = head; int count = 0; while( cur!=NULL) { ++count; cur = cur->link; } cout<<\"Number of elements in list = \"<ID; while( cur!=NULL) { if(max < cur ->ID) { max = cur ->ID; } cur = cur->link; } cout<<\.

Education

please solve all it ... Thank You :)
Using following main file and solve the task
Instead of ID and GPA, now consider following fields: Name, ID and Contact numberInsert last
(already done)Display All (already done)Insert at the beginningDelete the first elementDelete the
last elementSearch an element (by ID)Insert after an elementDisplay how many elements are
there in the listFind the element with highest (biggest) IDFind the element with lowest (smallest)
ID
// main file

please solve all it ... Thank You :)
Instead of ID and GPA, now consider following fields: Name, ID and Contact numberInsert last
(already done)Display All (already done)Insert at the beginningDelete the first elementDelete the
last elementSearch an element (by ID)Insert after an elementDisplay how many elements are
there in the listFind the element with highest (biggest) IDFind the element with lowest (smallest)
ID
// main file

please solve all it ... Thank You :)
// main file
please solve all it ... Thank You :)
Solution
// main file
#include

#include
using namespace std;
struct node{
//change to name , ID and contact number
string name;
int ID; ;
string phone;
//double GPA;
node *link;
};
node *head=NULL, *t;
void insertNode()
{
node *temp=new node;
cout<<"Enter name..";
cin>>temp->name;
cout<<"Enter the ID..";
cin>>temp->ID;
cout<<"Enter Phone..";
cin>>temp->phone;
temp->link=NULL;
if(head==NULL)//list is empty
{
head=temp;
}
else
{
t=head;
while(t->link!=NULL)
t=t->link;
t->link=temp;
}
}
void displayAll()
{
node *t=head;

while(t!=NULL)
{
cout<<"Name="<name<ID<phone<link;
}
}
void isertAtbegin()
{
node *cur = head;
node *temp=new node;
cout<<"Enter name..";
cin>>temp->name;
cout<<"Enter the ID..";
cin>>temp->ID;
cout<<"Enter Phone..";
cin>>temp->phone;
head = temp;
temp->link = cur;
}
void deleteFirstElement()
{
node *cur = head,*prev=head;
head = head->link;
free(cur);
}
void searchElement(int ID)
{
node *cur = head;
int found = 0,pos=0;
while( cur!=NULL)
{
if( ID == cur->ID )
{
found = 1;
break;
}

cur = cur->link;
++pos;
}
if( found )
cout<<"Element with Id= "<link;
node *temp=new node;
cout<<"Enter name..";
cin>>temp->name;
cout<<"Enter the ID..";
cin>>temp->ID;
cout<<"Enter Phone..";
cin>>temp->phone;
temp->link=next;
cur->link = temp;
break;
}
cur = cur->link;
++pos;
}
}
void displayNumberOfelements()
{
node *cur = head;
int count = 0;
while( cur!=NULL)
{
++count;
cur = cur->link;
}
cout<<"Number of elements in list = "<ID;
while( cur!=NULL)
{
if(max < cur ->ID)
{
max = cur ->ID;
}

cur = cur->link;
}
cout<<"The element with highest (biggest) ID = "<ID;
while( cur!=NULL)
{
if(min > cur ->ID)
{
min = cur ->ID;
}
cur = cur->link;
}
cout<<"the element with lowest (smallest) ID = "<>choice;
if(choice==1)
insertNode();
if(choice==2)
displayAll();
if(choice==3)
isertAtbegin();
if(choice==4)
deleteFirstElement();
if(choice==5)
searchElement(12);
if(choice==6)
insertAfterElement(2);
if(choice==7)
displayNumberOfelements();
if(choice==8)
highestId();
if(choice==9)
LowestId();
}//while loop
return 0 ;
}

Similar to Using following main file and solve the taskInst.pdf

In C pls // Write your name here // Write the compiler used: Visual studio or gcc // Reminder that your file name is incredibly important. Please do not change it. // Reminder that we are compiling on Gradescope using GCC. // READ BEFORE YOU START: // You are given a partially completed program that creates a list of game items like you'd see in a folder. // Each item has this information: item's name, game's name, type of item, item ID. // The struct 'itemRecord' holds information of one item. Variety is an enum. // An array of structs called 'list' is made to hold the list of items. // To begin, you should trace through the given code and understand how it works. // Please read the instructions above each required function and follow the directions carefully. // You should not modify any of the given code, the return types, or the parameters. Otherwise, you risk getting compilation errors. // You are not allowed to modify main(). // You can use string library functions. // WRITE COMMENTS FOR IMPORANT STEPS IN YOUR CODE. #include <stdio.h> #include <stdlib.h> #include <string.h> #pragma warning(disable: 4996) // for Visual Studio Only #define MAX_ITEMS 15 #define MAX_NAME_LENGTH 25 typedef enum { Health = 0, Equip, Etc } itemType; // enum type struct itemRecord { // struct for item details char itemName[MAX_NAME_LENGTH]; char gameName[MAX_NAME_LENGTH]; itemType variety; unsigned int itemID; }; struct itemRecord list[MAX_ITEMS]; // declare list of items int count = 0; // the number of items currently stored in the list (initialized to 0) // functions already implmented void flushStdIn(); void executeAction(char); void save(char* fileName); void display(); // functions that need implementation: int add(char* itemName_input, char* gameName_input, char* variety_input, unsigned int idNumber_input); // 10 points void sort(); // 10 points int delete(unsigned int idNumber_input); // 10 points void load(char* fileName); // 10 points int main() { char* fileName = "Item_List.txt"; load(fileName); // load list of items from file (if it exists). Initially there will be no file. char choice = 'i'; // initialized to a dummy value do { printf("\nEnter your selection:\n"); printf("\t a: add a new item\n"); printf("\t d: display item list\n"); printf("\t r: remove an item from list\n"); printf("\t s: sort item list by ID\n"); printf("\t q: quit\n"); choice = getchar(); flushStdIn(); executeAction(choice); } while (choice != 'q'); save(fileName); // save list of items to file (overwrites file, if it exists) return 0; } // flush out leftover '\n' characters void flushStdIn() { char c; do c = getchar(); while (c != '\n' && c != EOF); } // ask for details from user for the given selection and perform that action void executeAction(char c) { char itemName_input[MAX_NAME_LENGTH], gameName_input[MAX_NAME_LENGTH]; unsigned int idNumber_input, add_result = 0; char variety_input[20]; swi.

In C pls -- Write your name here -- Write the compiler used- Visual st.docx

Blake0FxCampbelld

1. Add a breadth-first (level-order) traversal function to the binar.pdf

arjuncp10

// Reminder that your file name is incredibly important. Please do not change it. // Reminder that we are compiling on Gradescope using GCC. // READ BEFORE YOU START: // You are given a partially completed program that creates a list of game items like you'd see in a folder. // Each item has this information: item's name, game's name, type of item, item ID. // The struct 'itemRecord' holds information of one item. Variety is an enum. // An array of structs called 'list' is made to hold the list of items. // To begin, you should trace through the given code and understand how it works. // Please read the instructions above each required function and follow the directions carefully. // You should not modify any of the given code, the return types, or the parameters. Otherwise, you risk getting compilation errors. // You are not allowed to modify main(). // You can use string library functions. // WRITE COMMENTS FOR IMPORANT STEPS IN YOUR CODE. #include <stdio.h> #include <stdlib.h> #include <string.h> #pragma warning(disable: 4996) // for Visual Studio Only #define MAX_ITEMS 15 #define MAX_NAME_LENGTH 25 typedef enum { Health = 0, Equip, Etc } itemType; // enum type struct itemRecord { // struct for item details char itemName[MAX_NAME_LENGTH]; char gameName[MAX_NAME_LENGTH]; itemType variety; unsigned int itemID; }; struct itemRecord list[MAX_ITEMS]; // declare list of items int count = 0; // the number of items currently stored in the list (initialized to 0) // functions already implmented void flushStdIn(); void executeAction(char); void save(char* fileName); void display(); // functions that need implementation: int add(char* itemName_input, char* gameName_input, char* variety_input, unsigned int idNumber_input); // 10 points void sort(); // 10 points int delete(unsigned int idNumber_input); // 10 points void load(char* fileName); // 10 points int main() { char* fileName = "Item_List.txt"; load(fileName); // load list of items from file (if it exists). Initially there will be no file. char choice = 'i'; // initialized to a dummy value do { printf("\nEnter your selection:\n"); printf("\t a: add a new item\n"); printf("\t d: display item list\n"); printf("\t r: remove an item from list\n"); printf("\t s: sort item list by ID\n"); printf("\t q: quit\n"); choice = getchar(); flushStdIn(); executeAction(choice); } while (choice != 'q'); save(fileName); // save list of items to file (overwrites file, if it exists) return 0; } // flush out leftover '\n' characters void flushStdIn() { char c; do c = getchar(); while (c != '\n' && c != EOF); } // ask for details from user for the given selection and perform that action void executeAction(char c) { char itemName_input[MAX_NAME_LENGTH], gameName_input[MAX_NAME_LENGTH]; unsigned int idNumber_input, add_result = 0; char variety_input[20]; switch (c) { case 'a': // input item record from user printf("\nEnter item name: ").

-- Reminder that your file name is incredibly important- Please do not.docx

Adamq0DJonese

DSA(1).pptx

DaniyalAli81

Please answer the 4 questions using C. The expected output is shown below. Thank you! --------------------------------------------------------------------------------------------------- // Write your name here // Write the compiler used: Visual studio or gcc // Reminder that your file name is incredibly important. Please do not change it. // Reminder that we are compiling on Gradescope using GCC. // READ BEFORE YOU START: // You are given a partially completed program that creates a list of game items like you'd see in a folder. // Each item has this information: item's name, game's name, type of item, item ID. // The struct 'itemRecord' holds information of one item. Variety is an enum. // An array of structs called 'list' is made to hold the list of items. // To begin, you should trace through the given code and understand how it works. // Please read the instructions above each required function and follow the directions carefully. // You should not modify any of the given code, the return types, or the parameters. Otherwise, you risk getting compilation errors. // You are not allowed to modify main(). // You can use string library functions. // WRITE COMMENTS FOR IMPORANT STEPS IN YOUR CODE. #include <stdio.h> #include <stdlib.h> #include <string.h> #pragma warning(disable: 4996) // for Visual Studio Only #define MAX_ITEMS 15 #define MAX_NAME_LENGTH 25 typedef enum { Health = 0, Equip, Etc } itemType; // enum type struct itemRecord { // struct for item details char itemName[MAX_NAME_LENGTH]; char gameName[MAX_NAME_LENGTH]; itemType variety; unsigned int itemID; }; struct itemRecord list[MAX_ITEMS]; // declare list of items int count = 0; // the number of items currently stored in the list (initialized to 0) // functions already implmented void flushStdIn(); void executeAction(char); void save(char* fileName); void display(); // functions that need implementation: int add(char* itemName_input, char* gameName_input, char* variety_input, unsigned int idNumber_input); // 10 points void sort(); // 10 points int delete(unsigned int idNumber_input); // 10 points void load(char* fileName); // 10 points int main() { char* fileName = "Item_List.txt"; load(fileName); // load list of items from file (if it exists). Initially there will be no file. char choice = 'i'; // initialized to a dummy value do { printf("\nEnter your selection:\n"); printf("\t a: add a new item\n"); printf("\t d: display item list\n"); printf("\t r: remove an item from list\n"); printf("\t s: sort item list by ID\n"); printf("\t q: quit\n"); choice = getchar(); flushStdIn(); executeAction(choice); } while (choice != 'q'); save(fileName); // save list of items to file (overwrites file, if it exists) return 0; } // flush out leftover '\n' characters void flushStdIn() { char c; do c = getchar(); while (c != '\n' && c != EOF); } // ask for details from user for the given selection and perform that action .

Please answer the 4 questions using C- The expected output is shown be.docx

cgraciela1

Write a program that accepts an arithmetic expression of unsigned integers in postfix notation and builds the arithmetic expression tree that represents that expression. From that tree, the corresponding fully parenthesized infix expression should be displayed and a file should be generated that contains the three address format instructions. This topic is discussed in the week 4 reading in module 2, section II-B. The main class should create the GUI shown below: Pressing the Construct Tree button should cause the tree to be constructed and using that tree, the corresponding infix expression should be displayed and the three address instruction file should be generated. The postfix expression input should not be required to have spaces between every token. Note in the above example that 9+- are not separated by spaces. The above example should produce the following output file containing the three address instructions: Add R0 5 9 Sub R1 3 R0 Mul R2 2 3 Div R3 R1 R2 Inheritance should be used to define the arithmetic expression tree. At a minimum, it should involve three classes: an abstract class for the tree nodes and two derived classes, one for operand nodes and another for operator nodes. Other classes should be included as needed to accomplish good object-oriented design. All instance data must be declared as private. You may assume that the expression is syntactically correct with regard to the order of operators and operands, but you should check for invalid tokens, such as characters that are not valid operators or operands such as 2a, which are not valid integers. If an invalid token is detected a RuntimeException should be thrown and caught by the main class and an appropriate error message should be displayed. Three Adddress Generator Enter Postfix Expression 359 2 3 Construct Tree Infix Expression ((3-(5 9))/ (2* 3 Solution #include #include #include #include #include struct TREE //Structure to represent a tree { char data; struct TREE *right,*left,*root; }; typedef TREE tree; /* Stack Using Linked List */ struct Stack //Structure to represent Stack { struct TREE *data; struct Stack *next,*head,*top; //Pointers to next node,head and top }; typedef struct Stack node; node *Nw; //Global Variable to represent node void initialize(node *&n) { n = new node; n -> next = n -> head = n -> top = NULL; } void create(node *n) { Nw = new node; //Create a new node Nw -> next = NULL; //Initialize next pointer field if(n -> head == NULL) //if first node { n -> head = Nw; //Initialize head n -> top = Nw; //Update top } } void push(node *n,tree *ITEM) { node *temp = n -> head; if(n -> head == NULL) //if First Item is Pushed to Stack { create(n); //Create a Node n -> head -> data = ITEM; //Insert Item to head of List n -> head = Nw; return; //Exit from Function } create(n); //Create a new Node Nw -> data = ITEM; //Insert Item while(temp -> next != NULL) temp = temp -> next; //Go to Last Node temp -> next = Nw; //Point New node n -> top = Nw; //Upda.

Write a program that accepts an arithmetic expression of unsigned in.pdf

JUSTSTYLISH3B2MOHALI

written in c, please answer the 4 questions and write the functions based on the given code. Thank you // Write your name here // Write the compiler used: Visual studio or gcc // Reminder that your file name is incredibly important. Please do not change it. // Reminder that we are compiling on Gradescope using GCC. // READ BEFORE YOU START: // You are given a partially completed program that creates a linked list of game items like you'd see in a folder. // Each item has this information: item name, game name, type of item, item ID. // The struct 'itemRecord' holds the information of one item. Variety is an enum. // A linked list of structs called 'list' is declared to hold the list of items. // To begin, you should trace through the given code and understand how it works. // Please read the instructions above each required function and follow the directions carefully. // You should not modify any of the given code, the return types, or the parameters. Otherwise, you risk getting compilation errors. // You are not allowed to modify main(). // You can use all string library functions. // You will have to write your functions from scratch by looking at what is expected to be passed into them in the pre-existing functions // WRITE COMMENTS FOR IMPORANT STEPS IN YOUR CODE. #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_ITEMS 15 #define MAX_NAME_LENGTH 25 typedef enum { Health = 0, Equip, Etc } itemType; // enum type struct itemRecord { // struct for item details char itemName[MAX_NAME_LENGTH]; char gameName[MAX_NAME_LENGTH]; itemType variety; unsigned int itemID; struct itemRecord* next; // pointer to next node }; struct itemRecord* list = NULL; // declare linked list 'list' int count = 0; // the number of items currently stored in the list (initialized to 0) // functions already pre-implemented last homework void flushStdIn(); void executeAction(char); void save(char* fileName); void display(); // functions that need implementation: add, sort, delete, load // Implement your own headers. int main() { char* fileName = "Item_List.txt"; load(fileName); // load list of items from file (if it exists). Initially there will be no file. char choice = 'i'; // initialized to a dummy value do { printf("\nEnter your selection:\n"); printf("\t a: add a new item\n"); printf("\t d: display item list\n"); printf("\t r: remove a item from list\n"); printf("\t s: sort item list by ID\n"); printf("\t q: quit\n"); choice = getchar(); flushStdIn(); executeAction(choice); } while (choice != 'q'); save(fileName); // save list of items to file (overwrites file if it exists) return 0; } // flush out leftover '\n' characters void flushStdIn() { char c; do c = getchar(); while (c != '\n' && c != EOF); } // ask for details from user for the given selection and perform that action void executeAction(char c) { char itemName_input[MAX_NAME_LENGTH], gameName_input[MAX_NAME_LENGTH]; unsigned int itemId_input, add_result = 0; char itemtype_input[20]; switc.

written in c- please answer the 4 questions and write the functions ba.pdf

sravi07

Sorting & Linked Lists

J.T.A.JONES

C programming. Answer question only in C code In the eighth part, you have to implement a binary search tree. The tree must satisfy the binary search tree property: the key in each node must be greater than all keys stored in the left sub-tree, and smaller than all keys in right sub- tree. You have to dynamically allocate space for each node and free the space for the nodes at the end of the program. This program takes a file name as an argument from the command line. The file is either blank or contains successive lines of input. Each line starts with a character, either \'i\' or \'s\' followed by a tab and then an integer. For each line that starts with V, your program should insert that number in the binary search tree if it is not already there. If it is already present, you will print \"duplicate\" and not change the tree. If the line starts with a \'s\' your program should search for the value. Output format: For each fine in the input file, your program should print the status/result of the operation. For an insert operation, the program should print either \"inserted\" with a single space followed by a number, the height of the inserted node in the tree, or \"duplicate\" if the value is already present in the tree. The height of the root node is 1. For a search, the program should either print \"present\", followed by the height of the node, or \"absent\" based on the outcome of the search. Your program should print \"error\" (and nothing else) if the file does not exist or for input lines with improper structure. Example Execution: Let\'s assume we have a file.txt with the following contents: 5 3 4 1 6 s Executing the program in the following fashion should produce the output shown below: $./eighth file1.txt inserted 1 inserted 2 inserted 3 inserted 3 inserted 2 present 3. Solution Above program only inserts data / nodes to the binary tree. To print the tree, we need to know how to traverse a Binary Search Tree C Program to implement Binary Search Tree Traversal Preorder traversal sequence : F, B, A, D, C, E, G, I, H (root, left, right) Inorder traversal sequence : A, B, C, D, E, F, G, H, I (left, root, right) Postorder traversal sequence: A, C, E, D, B, H, I, G, F (left, right, root) Program : # include # include # include typedef struct BST { int data; struct BST *lchild, *rchild; } node; void insert(node *, node *); void inorder(node *); void preorder(node *); void postorder(node *); node *search(node *, int, node **); void main() { int choice; char ans = \'N\'; int key; node *new_node, *root, *tmp, *parent; node *get_node(); root = NULL; clrscr(); printf(\"\ Program For Binary Search Tree \"); do { printf(\"\ 1.Create\"); printf(\"\ 2.Search\"); printf(\"\ 3.Recursive Traversals\"); printf(\"\ 4.Exit\"); printf(\"\ Enter your choice :\"); scanf(\"%d\", &choice); switch (choice) { case 1: do { new_node = get_node(); printf(\"\ Enter The Element \"); scanf(\"%d\", &new_node->data); if (root == NULL) /* Tree is not Created */ root =.

C programming. Answer question only in C code In the eighth part, yo.pdf

mohammedfootwear

Doublylinklist

ritu1806

please follow all instructions and answer the inbedded questions, and written in C pls // Write your name here // Write the compiler used: Visual studio or gcc // Reminder that your file name is incredibly important. Please do not change it. // Reminder that we are compiling on Gradescope using GCC. // READ BEFORE YOU START: // You are given a partially completed program that creates a linked list of game items like you'd see in a folder. // Each item has this information: item name, game name, type of item, item ID. // The struct 'itemRecord' holds the information of one item. Variety is an enum. // A linked list of structs called 'list' is declared to hold the list of items. // To begin, you should trace through the given code and understand how it works. // Please read the instructions above each required function and follow the directions carefully. // You should not modify any of the given code, the return types, or the parameters. Otherwise, you risk getting compilation errors. // You are not allowed to modify main(). // You can use all string library functions. // You will have to write your functions from scratch by looking at what is expected to be passed into them in the pre-existing functions // WRITE COMMENTS FOR IMPORANT STEPS IN YOUR CODE. #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_ITEMS 15 #define MAX_NAME_LENGTH 25 typedef enum { Health = 0, Equip, Etc } itemType; // enum type struct itemRecord { // struct for item details char itemName[MAX_NAME_LENGTH]; char gameName[MAX_NAME_LENGTH]; itemType variety; unsigned int itemID; struct itemRecord* next; // pointer to next node }; struct itemRecord* list = NULL; // declare linked list 'list' int count = 0; // the number of items currently stored in the list (initialized to 0) // functions already pre-implemented last homework void flushStdIn(); void executeAction(char); void save(char* fileName); void display(); // functions that need implementation: add, sort, delete, load // Implement your own headers. int main() { char* fileName = "Item_List.txt"; load(fileName); // load list of items from file (if it exists). Initially there will be no file. char choice = 'i'; // initialized to a dummy value do { printf("\nEnter your selection:\n"); printf("\t a: add a new item\n"); printf("\t d: display item list\n"); printf("\t r: remove a item from list\n"); printf("\t s: sort item list by ID\n"); printf("\t q: quit\n"); choice = getchar(); flushStdIn(); executeAction(choice); } while (choice != 'q'); save(fileName); // save list of items to file (overwrites file if it exists) return 0; } // flush out leftover '\n' characters void flushStdIn() { char c; do c = getchar(); while (c != '\n' && c != EOF); } // ask for details from user for the given selection and perform that action void executeAction(char c) { char itemName_input[MAX_NAME_LENGTH], gameName_input[MAX_NAME_LENGTH]; unsigned int itemId_input, add_result = 0; char itemtype_input[20]; switch (c) { case 'a'.

please follow all instructions and answer the inbedded questions- and.pdf

Ian5L3Allanm

You are required to implement the following functions for doubly linke.docx

Jonathan5GxRossk

Written in C, requires linked lists. Please answer the 4 questions and show the output. Thank you! // Write your name here // Write the compiler used: Visual studio or gcc // Reminder that your file name is incredibly important. Please do not change it. // Reminder that we are compiling on Gradescope using GCC. // READ BEFORE YOU START: // You are given a partially completed program that creates a linked list of game items like you'd see in a folder. // Each item has this information: item name, game name, type of item, item ID. // The struct 'itemRecord' holds the information of one item. Variety is an enum. // A linked list of structs called 'list' is declared to hold the list of items. // To begin, you should trace through the given code and understand how it works. // Please read the instructions above each required function and follow the directions carefully. // You should not modify any of the given code, the return types, or the parameters. Otherwise, you risk getting compilation errors. // You are not allowed to modify main(). // You can use all string library functions. // You will have to write your functions from scratch by looking at what is expected to be passed into them in the pre-existing functions // WRITE COMMENTS FOR IMPORANT STEPS IN YOUR CODE. #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_ITEMS 15 #define MAX_NAME_LENGTH 25 typedef enum { Health = 0, Equip, Etc } itemType; // enum type struct itemRecord { // struct for item details char itemName[MAX_NAME_LENGTH]; char gameName[MAX_NAME_LENGTH]; itemType variety; unsigned int itemID; struct itemRecord* next; // pointer to next node }; struct itemRecord* list = NULL; // declare linked list 'list' int count = 0; // the number of items currently stored in the list (initialized to 0) // functions already pre-implemented last homework void flushStdIn(); void executeAction(char); void save(char* fileName); void display(); // functions that need implementation: add, sort, delete, load // Implement your own headers. int main() { char* fileName = "Item_List.txt"; load(fileName); // load list of items from file (if it exists). Initially there will be no file. char choice = 'i'; // initialized to a dummy value do { printf("\nEnter your selection:\n"); printf("\t a: add a new item\n"); printf("\t d: display item list\n"); printf("\t r: remove a item from list\n"); printf("\t s: sort item list by ID\n"); printf("\t q: quit\n"); choice = getchar(); flushStdIn(); executeAction(choice); } while (choice != 'q'); save(fileName); // save list of items to file (overwrites file if it exists) return 0; } // flush out leftover '\n' characters void flushStdIn() { char c; do c = getchar(); while (c != '\n' && c != EOF); } // ask for details from user for the given selection and perform that action void executeAction(char c) { char itemName_input[MAX_NAME_LENGTH], gameName_input[MAX_NAME_LENGTH]; unsigned int itemId_input, add_result = 0; char itemtype_input[20]; switch (c.

Written in C- requires linked lists- Please answer the 4 questions and.pdf

sravi07

Written in C- requires linked lists- Please answer the 4 questions and (1).pdf

sravi07

Use the singly linked list class introduced in the lab to implement integers of unlimited size. Each node of the list should store one digit of the integer. You are to implement the addition, subtraction and multiplication operations. Please note that any additional data structure to be used in solving this problem has to be taken from the ones introduced in the ICS 202 lab. In addition, provide a test class that will do the following: It will keep asking the user to enter two integers, choose one of the operations (addition, subtraction, multiplication) and then display the result. The program will stop upon entering the # character (without the double quotes). this singly linked list class: public class SLL { private class SLLNode { private T info; private SLLNode next; int value; public SLLNode() { this(null, null); } public SLLNode(T el) { this(el, null); } public SLLNode(T el, SLLNode ptr) { info = el; next = ptr; } } protected SLLNode head, tail; public SLL() { head = tail = null; } public boolean isEmpty() { return head == null; } public void addToHead(T el) { head = new SLLNode(el, head); if (tail == null) tail = head; } public void addToTail(T el) { if (!isEmpty()) { tail.next = new SLLNode(el); tail = tail.next; } else head = tail = new SLLNode(el); } public T deleteFromHead() { // delete the head and return its info; if (isEmpty()) return null; T el = head.info; if (head == tail) // if only one node on the list; head = tail = null; else head = head.next; return el; } public T deleteFromTail() { // delete the tail and return its info; if (isEmpty()) return null; T el = tail.info; if (head == tail) // if only one node in the list; head = tail = null; else { // if more than one node in the list, SLLNode tmp; // find the predecessor of tail; for (tmp = head; tmp.next != tail; tmp = tmp.next) ; tail = tmp; // the predecessor of tail becomes tail; tail.next = null; } return el; } public void delete(T el) { // delete the node with an element el; if (!isEmpty()) if (head == tail && el.equals(head.info)) // if only one head = tail = null; // node on the list; else if (el.equals(head.info)) // if more than one node on the list; head = head.next; // and el is in the head node; else { // if more than one node in the list SLLNode pred, tmp;// and el is in a nonhead node; for (pred = head, tmp = head.next; tmp != null && !tmp.info.equals(el); pred = pred.next, tmp = tmp.next) ; if (tmp != null) { // if el was found; pred.next = tmp.next; if (tmp == tail) // if el is in the last node; tail = pred; } } } @Override public String toString() { if (head == null) return "[ ]"; String str = "[ "; SLLNode tmp = head; while (tmp != null) { str += tmp.info + " "; tmp = tmp.next; } return str + "]"; } public boolean contains(T el) { if (head == null) return false; SLLNode tmp = head; while (tmp != null) { if (tmp.info.equals(el)) return true; tmp = tmp.next; } return false; } public int size() { if (head == null) return 0; int count = 0; SLLNode p = head; w.

Use the singly linked list class introduced in the lab to implement .pdf

sales87

Dtd

Abhishek Kesharwani

Solve using Java programming language. //************************** SLL.java ********************************* // a generic singly linked list class public class SLL<T> { private class SLLNode<T> { private T info; private SLLNode<T> next; public SLLNode() { this(null,null); } public SLLNode(T el) { this(el,null); } public SLLNode(T el, SLLNode<T> ptr) { info = el; next = ptr; } } protected SLLNode<T> head, tail; public SLL() { head = tail = null; } public boolean isEmpty() { return head == null; } public void addToHead(T el) { head = new SLLNode<T>(el,head); if (tail == null) tail = head; } public void addToTail(T el) { if (!isEmpty()) { tail.next = new SLLNode<T>(el); tail = tail.next; } else head = tail = new SLLNode<T>(el); } public T deleteFromHead() { // delete the head and return its info; if (isEmpty()) return null; T el = head.info; if (head == tail) // if only one node on the list; head = tail = null; else head = head.next; return el; } public T deleteFromTail() { // delete the tail and return its info; if (isEmpty()) return null; T el = tail.info; if (head == tail) // if only one node in the list; head = tail = null; else { // if more than one node in the list, SLLNode<T> tmp; // find the predecessor of tail; for (tmp = head; tmp.next != tail; tmp = tmp.next); tail = tmp; // the predecessor of tail becomes tail; tail.next = null; } return el; } public void delete(T el) { // delete the node with an element el; if (!isEmpty()) if (head == tail && el.equals(head.info)) // if only one head = tail = null; // node on the list; else if (el.equals(head.info)) // if more than one node on the list; head = head.next; // and el is in the head node; else { // if more than one node in the list SLLNode<T> pred, tmp;// and el is in a nonhead node; for (pred = head, tmp = head.next; tmp != null && !tmp.info.equals(el); pred = pred.next, tmp = tmp.next); if (tmp != null) { // if el was found; pred.next = tmp.next; if (tmp == tail) // if el is in the last node; tail = pred; } } } @Override public String toString() { if(head == null) return "[ ]"; String str = "[ "; SLLNode<T> tmp = head; while(tmp != null){ str += tmp.info + " "; tmp = tmp.next; } return str+"]"; } public boolean contains(T el) { if(head == null) return false; SLLNode<T> tmp = head; while(tmp != null){ if(tmp.info.equals(el)) return true; tmp = tmp.next; } return false; } public int size(){ if(head == null) return 0; int count = 0; SLLNode<T> p = head; while(p != null) { count++; p = p.next; } return count; } } Given the code above, solve the following tasks (please show the solution for every task clearly): For part (c) this is the code for the test program: public class SLL_Driver { public static void main(String[] args) { SLL<String> myList = new SLL<String>(); String[] cityNames = {"Jubail", "Riyadh", "Abha", "Dammam", "Taif"}; for(int i = 0; i < cityNames.length; i++) myList.addToHead(cityNames[i]); System.out.println("The list is: " + myList); System.out.println("It is " + myLis.

Solve using Java programming language- ----------------------------.pdf

aksahnan

lab08/build.bat @echo off cls set DRIVE_LETTER=%1: set PATH=%DRIVE_LETTER%\MinGW\bin;%DRIVE_LETTER%\MinGW\msys\1.0\bin;%DRIVE_LETTER%\MinGW\gtkmm3\bin;%DRIVE_LETTER%\MinGW\gtk\bin;c:\Windows;c:\Windows\system32 set PROJECT_PATH=. make DRIVE_LETTER="%DRIVE_LETTER%" PROJECT_DIR="%PROJECT_PATH%" lab08/CSC2110/CD.h #if !defined CD_H #define CD_H #include "Song.h" #include "Text.h" using CSC2110::String; #include "ListArray.h" using CSC2110::ListArray; namespace CSC2110 { class CD { private: String* artist; String* title; int year; int rating; int num_tracks; ListArray<Song>* songs; public: CD(String* artist, String* title, int year, int rating, int num_tracks); virtual ~CD(); String* getKey(); void addSong(String* title, String* length); void displayCD(); static ListArray<CD>* readCDs(const char* file_name); static int compare_items(CD* one, CD* two); static int compare_keys(String* sk, CD* cd); static char getRadixChar(CD* cd, int index); //1-based }; } #endif lab08/CSC2110/Double.h #if !defined (DOUBLE_H) #define DOUBLE_H namespace CSC2110 { class Double { private: double value; public: Double(double val); ~Double(); double getValue(); }; } #endif lab08/CSC2110/HighPerformanceCounter.h #if !defined (HIGHPERFORMANCECOUNTER_H) #define HIGHPERFORMANCECOUNTER_H namespace CSC2110 { class HighPerformanceCounter { private: double micro_spt; //micro_seconds per tick HighPerformanceCounter(); static HighPerformanceCounter* hpc; static int getTicksPerSecond(); public: virtual ~HighPerformanceCounter(); static HighPerformanceCounter* getHighPerformanceCounter(); int getCurrentTimeInTicks(); double getTimeDifferenceInMicroSeconds(int start_time, int end_time); }; } #endif lab08/CSC2110/Integer.h #if !defined (INTEGER_H) #define INTEGER_H namespace CSC2110 { class Integer { private: int value; public: Integer(int val); virtual ~Integer(); int getValue(); }; } #endif lab08/CSC2110/Keyboard.h #if !defined KEYBOARD_H #define KEYBOARD_H #include "Text.h" using CSC2110::String; #include <string> using namespace std; namespace CSC2110 { class Keyboard { private: Keyboard(); public: virtual ~Keyboard(); static Keyboard* getKeyboard(); //pre: the string (character literal) that will prompt the user for input //post: the input read from the keyboard interpreted as an int is returned int readInt(string prompt); int getValidatedInt(string prompt, int min, int max); //pre: the string that will prompt the user for input //post: the input read from the keyboard interpreted as a double is returned double readDouble(string prompt); double getValidatedDouble(string prom ...

lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx

DIPESH30

// Write the compiler used: Visual studio or gcc // Reminder that your file name is incredibly important. Please do not change it. // Reminder that we are compiling on Gradescope using GCC. // READ BEFORE YOU START: // You are given a partially completed program that creates a linked list of game items like you'd see in a folder. // Each item has this information: item name, game name, type of item, item ID. // The struct 'itemRecord' holds the information of one item. Variety is an enum. // A linked list of structs called 'list' is declared to hold the list of items. // To begin, you should trace through the given code and understand how it works. // Please read the instructions above each required function and follow the directions carefully. // You should not modify any of the given code, the return types, or the parameters. Otherwise, you risk getting compilation errors. // You are not allowed to modify main(). // You can use all string library functions. // You will have to write your functions from scratch by looking at what is expected to be passed into them in the pre-existing functions // WRITE COMMENTS FOR IMPORANT STEPS IN YOUR CODE. #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_ITEMS 15 #define MAX_NAME_LENGTH 25 typedef enum { Health = 0, Equip, Etc } itemType; // enum type struct itemRecord { // struct for item details char itemName[MAX_NAME_LENGTH]; char gameName[MAX_NAME_LENGTH]; itemType variety; unsigned int itemID; struct itemRecord* next; // pointer to next node }; struct itemRecord* list = NULL; // declare linked list 'list' int count = 0; // the number of items currently stored in the list (initialized to 0) // functions already pre-implemented last homework void flushStdIn(); void executeAction(char); void save(char* fileName); void display(); // functions that need implementation: add, sort, delete, load // Implement your own headers. int main() { char* fileName = "Item_List.txt"; load(fileName); // load list of items from file (if it exists). Initially there will be no file. char choice = 'i'; // initialized to a dummy value do { printf("\nEnter your selection:\n"); printf("\t a: add a new item\n"); printf("\t d: display item list\n"); printf("\t r: remove a item from list\n"); printf("\t s: sort item list by ID\n"); printf("\t q: quit\n"); choice = getchar(); flushStdIn(); executeAction(choice); } while (choice != 'q'); save(fileName); // save list of items to file (overwrites file if it exists) return 0; } // flush out leftover '\n' characters void flushStdIn() { char c; do c = getchar(); while (c != '\n' && c != EOF); } // ask for details from user for the given selection and perform that action void executeAction(char c) { char itemName_input[MAX_NAME_LENGTH], gameName_input[MAX_NAME_LENGTH]; unsigned int itemId_input, add_result = 0; char itemtype_input[20]; switch (c) { case 'a': // input item record from user printf("\nEnter item name: "); fgets(itemName_input, sizeof(itemName_input), s.

-- Write the compiler used- Visual studio or gcc -- Reminder that your.pdf

ganisyedtrd

C++ Please write the whole code that is needed for this assignment- wr.docx

BrianGHiNewmanv

Similar to Using following main file and solve the taskInst.pdf (20)

In C pls -- Write your name here -- Write the compiler used- Visual st.docx

1. Add a breadth-first (level-order) traversal function to the binar.pdf

-- Reminder that your file name is incredibly important- Please do not.docx

DSA(1).pptx

Please answer the 4 questions using C- The expected output is shown be.docx

Write a program that accepts an arithmetic expression of unsigned in.pdf

written in c- please answer the 4 questions and write the functions ba.pdf

Sorting & Linked Lists

C programming. Answer question only in C code In the eighth part, yo.pdf

Doublylinklist

please follow all instructions and answer the inbedded questions- and.pdf

You are required to implement the following functions for doubly linke.docx

Written in C- requires linked lists- Please answer the 4 questions and.pdf

Written in C- requires linked lists- Please answer the 4 questions and (1).pdf

Use the singly linked list class introduced in the lab to implement .pdf

Dtd

Solve using Java programming language- ----------------------------.pdf

lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx

-- Write the compiler used- Visual studio or gcc -- Reminder that your.pdf

C++ Please write the whole code that is needed for this assignment- wr.docx

More from feetshoemart

Convert the following expressions from infix to Reverse Polish Notation (postfix). Think of Squareroot and tan as unary operators: ((2 - 1) (4 * 3)) + 15 -b+ Squareroot b^- 4ac/2a tan alpha + tan beta/1 - tan alpha tan beta Solution To convert an expression from infix to postfix, the method is: 1. If it is an operand at it to output expression. 2. If it is an operator, if stack is empty, or if the operator on top of stack is of lower precedence than this, push it onto stack. 3. Else, pop operators from the stack, till the operators on stack are of higher precedence than the one in hand, and add them to the output. Then, add this operator to the stack. So, applying this logic to the expressions: 1. ((2-1) / (4 / 3)) + 15 (, Push it onto stack. (, Push it onto stack. 2 Add it to output, so output expression now is: 2 - Push it onto stack. 1 Add it to output, so output expression now is: 2 1 ) Now, pop elements and add it to output, till a open brace. So, output expression is: 2 1 -, and stack will now hold (. / Push it onto stack. ( Push it onto stack. 4 Add it to output, so output expression now is: 2 1 - 4 * Push it onto stack. 3 Add it to ouput, so output expression now is: 2 1 - 4 3 ) Now, pop elements and add it to output, till a open brace. So, output expression is: 2 1 - 4 3 *, and stack will now hold ( /. ) Now, pop elements and add it to output, till a closed brace. So, output expression is: 2 1 - 4 3 * /, and stack is now empty. + Push it onto stack. 15 Add it to output, so output expression now is: 2 1 - 4 3 * / 15. As it is the end of expression, pop all elements from stack, and add it to output: So, now the expression is: 2 1 - 4 3 * / 15 +. Finally, the postfix equivalent of the given expression is: 2 1 - 4 3 * / 15 +..

Convert the following expressions from infix to Reverse Polish Notati.pdf

feetshoemart

Andy and Joan are married and under 65 years of age. They have two children: Monti and Silvia. Monti is 5 years old and receives all of his support from his parents. Silvia is 20 years old and receives less than half of her support from her parents. Both Monti and Silvia live with their parents. Silvia graduated from high school in 2016 and does not plan to go to college. Silvia earned $3,000 from a part- time job. Andy and Joan also provide more than half of the support of Andy\'s brother who lives with them and has no income. How many total personal and dependency exemptions should Andy and Joan claim?Five Solution No of personal and dependency exemptions should Andy and Joan claim = One for Silvia+One for Andy Brother = 2 Option D is Correct.

Andy and Joan are married and under 65 years of age. They have two c.pdf

feetshoemart

Compare the methods by which the Parsees of India benefitted from the trade in opium and the way that the British and Dutch governments benefitted from the trade in Opium. Solution The Parsi involvement in drugs got to serve many internal Parsi requirements and therefore,it can be seen as part of the larger Parsi historical imperative to safeguard identity, and the main intention is to remain economically, social and politically relevant as a community at any given time on the whole. Therefore, this was the non European foundation of Imperialism by the Parsis. However, the British and the Dutch had a different methodology where the main aim is to earn more profits through the trade by the East India company and Dutch company respectively. This is because opium trade can be considered as a modest investment could deliver huge returns on the whole..

Compare the methods by which the Parsees of India benefitted from th.pdf

feetshoemart

Computer Forensics Methodologies List them and explain each one. Pick one of the methodologies and describe What tools could you use for what situations. Procedures that you would follow. Types of documentation you would need to keep. Would it need to be done in a mobile lab or not? Why? Solution Computer forensics investigation is important now days, it is the term used to describe the process of investigation, analyze data, and evidance as per the stored information with us. There are few steps we need to follwed it:- First we have to acquire the evidance without loosing or damaging data. Second is make authentiacation on data which you have collected in first step. And third one is analyze your data. Following are the phases for computer forensics investigations:- Identification Case: Identify the exact information which we gathered for investigation purpose.Ask yourself while anyalyzing information like, who is the criminal, when it happen, what was the intention behind that? Acquisition of evidence:- Acquisition is to put to execution the acquisition plan designed in the earlier phase that is the identification. The aim of the acquisition phase is to obtain forensics copies of all the digital evidence/data that will be required during the next stage which is the Analysis Phase. In the actual acquisition, procedures are focused primarily on maintaining proper forensics techniques to ensure that any evidence acquired will be acceptable to the legal proceeding and can be duplicated and if necessary should be done by an independent third party. There are different scanario which shoud be consider in this case:- Environment Documentation and procedural documentation. Hardware and sofware tools documentation. Evidance proof of documetation. Etc. Evidence authentication:- Use different security alogothm used in computer science for anaylzing data like md5, sha1 etc. Check recording or any physical proof at the time of situation and analyze it. Check for fingerproof if any case it is major source to finding case in minimum time. Showing Proof as per Analysis:- Make final documenation as per your study, or analysis over the case. So it is easy for the someone who tooks decision what is right and what is wrong. Whatever you are presenting it should collected by yourself it menace you shold aware why we present this documents here. All document s which we are showing should be complete, accurate, and comprehensive It is important to accurately record the steps taken during the digital evidence examination along with all the needed details necessary for a third party examiner to reproduce and validate every piece of evidence..

Computer Forensics MethodologiesList them and explain each one.P.pdf

feetshoemart

Document2- Word (Product Activation Failed) Mailings Review View Tell.pdf

feetshoemart

Discussion 1: Choose one of the Opinion Poll questions (click here for a list of the questions) and discuss the justification for your view and how you think it fits in with the values of American political society. Initial Posting: 200-400 words. Please give me a good example and good explanation. Please do not copy and paste. thank you question 1: Taxes on the wealthy should be increased in order to reduce the federal decit without cung social programs. question 2:The United States should send foreign aid to other countries to reduce poverty and help solve other deep social programs experienced by the poorer nations. Discussion 2 Group Discussion: Slavery and the Constitution One of the chief areas of compromise at the Constitutional Convention was the issue of slavery. Should delegates who opposed slavery have been willing to compromise? Explain your reasoning. Please give me a good example. Thank you Solution The topic chooses in The first one related to taxes, The discussion for the same is as follows: The American political values are based on the concepts of liberty, equality, democracy, individualism, unity, and diversity. These are all democratic values and based on inclusive growth of the society. The growth will not be inclusive if one strata of the society is not even able to earn the daily breads. Social programs such as food coupons and others grant lower strata people a chance to survive while granting them some liberty and equality by providing them various social benefits necessary for survival. Federal deficit due to programs in own country to serve own people who are suffering by spending in our own country for the benefit of the society at large are in line with the vision of the society that forefather of the American have envision at the birth of this country. It is the people that are the wealth of the society without people and money without a country have no means. To support the American political values, the people who carry more than they required must be taxed to support the social programs. Not doing so will increase the inequality in the American society and lead to deterioration of the society..

Discussion 1 Choose one of the Opinion Poll questions (click here f.pdf

feetshoemart

calculate the hydrogen ion concentration in mol for the following s.pdf

feetshoemart

At a certain temperature, 0.5011 mol of N2 and 1.781 mol of H2 are placed in a 5.00-L container N,(g) + 3H2(g) 2NH3(g) At equilibrium, 0.1201 mol of N2 is present. Calculate the equilibrium constant, Kc. Number e146.7 Solution N2(g) + 3H2(g) <----> 2NH3(g) initial 0.5011/5 1.781/5 0 0.1 M 0.356 M 0 change -0.076 -0.228 +0.152 equilib 0.024 0.128 0.152 M at equilibrium, N2 = 0.1201/5 = 0.024 M Kc = [NH3]^2/[N2][H2]^3 Kc = 0.152^2/(0.128^3*0.024) = 459.03.

At a certain temperature, 0.5011 mol of N2 and 1.781 mol of H2 are pl.pdf

feetshoemart

Consider mappinp, phi: Z rightarrow R, defined as phi(x) = 2x, where Z is the set of all integers and R is the set of all real numbers and both are groups under addition. Is phi an isomorphism? Why? Is phi a homomorphism? why? Is phi an epimorphism? why? Is phi monomorphism? why? Solution : Z R is defined by (x) = 2x. 4. We know that a monomorphism is an injective homorphism. From 1 & 2 above, we know that is a homomorphism and also that is injective. Therefore is a monomorphism..

Consider mappinp, phi Z rightarrow R, defined as phi(x) = 2x, where .pdf

feetshoemart

wk3 reply to prof. I need help with this question below a 200 words summary with an introduction, body, conclusion and 1-2 references. please thank you. How IT and Systems make a valuable contribution to organizational change. Solution Introduction- By system, we mean “an integrated assembly of interacting elements [or components] designed to carry out cooperatively a predetermined function.” This definition is intentionally broad to cover a wide range of different systems. In an organizational context this implies a multiplicity of people, processes, technologies, and materials that together perform a significant function and contribute to a specific aim—a service or product development. Although the link between information technology and organizational learning has only begun to be explored, two related streams of research can be identified. The first adopts organizational learning as a means for explaining and resolving the problems of implementing and using new information technologies in organizations. The second stream of research develops applications of information technology to support the processes of organizational learning and knowledge management. For example, technologies such as data warehousing, expert systems, best-practice databases, and intranet/internet systems potentially comprise valuable components of organizational memory. Body- Past the standard office PC and advanced mobile phone, associations actualize information technology, custom programming or concentrated innovation gear to keep operations running easily. Progressions in innovation can possibly diminish the time expected to finish an assignment, or now and again dispose of the requirement for a business procedure or occupation work. Ordinarily, the want for expanded profitability drives moves up to innovation inside an association, which can altogether impact organization operations. Information technology (IT) has turned into an essential and indispensable piece of each strategy for success. From multi- national companies who keep up centralized server frameworks and databases to private ventures that claim a solitary PC, IT assumes a part. Companies are using IT to improve the way they design and manage customer relationships. Customer Relationship Management (CRM) systems capture every interaction a company has with a customer, so that a more enriching experience is possible. If a customer calls a call center with an issue, the customer support representative will be able to see what the customer has purchased, view shipping information, call up the training manual for that item and effectively respond to the issue. For employees, technological enhancements often reduce the number of tedious office tasks or improve efficiency. Changes in day-to-day operation may come in the form of an upgrade to desktop computers, faster office equipment or the introduction of a new information system. Business owners increasingly utilize comprehensive software platforms to.

wk3 reply to prof.I need help with this question below a 200 words.pdf

feetshoemart

Write a program that prompts the user to enter a positive integer and displays all its smallest factors in decreasing order. For example, if the integer is 120, the smallest factors are displayed as 5, 3, 2, 2, 2. Use the StackOflntegers class to store the factors (e.g., 2, 2, 2, 3, 5) and retrieve and display them in reverse order. Solution #include #include using namespace std; class StackOfIntegers { int s[100],top; public: StackOfIntegers() { top=-1; } void put(int n) { top++; s[top]=n; } int get() { if(top==-1) { return -1; } return s[top--]; } }stack; void primeFactors(int n) { while (n%2 == 0) { stack.put(2); n = n/2; } for (int i=3; i<=sqrt(n); i=i+2) { while (n%i==0) { stack.put(i); n = n/i; } } if (n > 2) stack.put(n); } int main() { int n; cout<<\"Enter a positive integer : \"; cin>>n; primeFactors(n); int f; f=stack.get(); while(f>0) { cout<.

Write a program that prompts the user to enter a positive integer and.pdf

feetshoemart

Write a function called countElements that counts the number of times two elements appear in a list. Your task is to ask the user to enter a list and two elements which they need to count in the list. The list and each of the elements should be inputs to a function called countElements. The function should print the count of the number of times the elements appear in the list. def countElements(countUst, element1, element2): Example: if the inputs to the function were (\"t\", \"s\", 7, 7, 2], \"t\", and 7, the function would count the instances of the letter T and the number 7 in the list, and print the number 3. There was one T and two 7\'s. Name your file Lastname_Firstname.py Solution def countElements(list, ch1, ch2): count = 0 for i in range(0,len(list)): if list[i] == ch1: count = count + 1 for i in range(0,len(list)): if list[i] == ch2: count = count + 1 return count; print countElements([\"t\",\"s\",7,7,2], \"t\", 7) Output: sh-4.3$ python main.py 3.

Write a function called countElements that counts the number of times.pdf

feetshoemart

This is a java lab assignment. I have added the first part \"java retail class\" at the bottom. I am unsure how to read the txt file into an array from the retail class. The stock txt file has been added also. A beginning framework and inventory list has been provided to you to use your Retail Item Class as an array. Develop a program to accomplish the following menu items that can be selected by the end user. Discussion of what each menu item should do is provided below the menu item. Modify your object class file as desired. Please append initials to files created. Use Select-Case for menu choices and methods to perform those choices. Please make a selection: 1. Open Inventory File (This should ask the user for the file name, open the file and load the data into the object array). 2. Display All (This should show a table of all items and data) 3. Display Reorder Only (This should show only the stock number, Description and current quantity for items requiring reorder) 4. Find Stock number (Allows the user to enter part of the description and displays all matching stock numbers and descriptions matching that - case insensitive, such as “cubs” or “cubs”) 5. Display Stock number (Allows user to enter stock number and displays record of item) 6. Add Quantity (Asks for stock number and quantity for units, adds it to current, displays record results) 7. Subtract Quantity (Asks for stock number and quantity, subtracts, displays results including if reorder is needed.) 8. Change Price (Asks for stick number, changes price to provided value, display results). 9. New Item (Allows adding a new item, updates count. Display record results). 10. Save Inventory File (asks user for file name, save all inventory to that file in a format that can be read back.) public class RetailItem{ private String description; private int unitsOnHand; private double price; private int restock; public void setDescription(String userDescription){ description=userDescription; } public void setUnitsOnHand(int userUnitsOnHand){ unitsOnHand=userUnitsOnHand; } public void setPrice(double userPrice){ price=userPrice; } public String getDescription(){ return description; } public int getUnitsOnHand(){ return unitsOnHand; } public double getPrice(){ return price; } public double getTotal(){ int total = unitsOnHand=(int) price; return total; } public boolean getRestock(){ return false; } public RetailItem(String descriptionGiven, int unitsOnHandGiven, double priceGiven, int restockGiven){ description=descriptionGiven; unitsOnHand=unitsOnHandGiven; price=priceGiven; restock=restockGiven; } } Solution public class RetailItem{ private int stocknumber; private String description; private int unitsOnHand; private double price; private int restock; public void setDescription(String userDescription){ description=userDescription; } public int getStocknumber() { return stocknumber; } public void setStocknumber(int stocknumber) { this.stocknumber = stocknumber; } public void setUnitsOnHand(in.

This is a java lab assignment. I have added the first part java re.pdf

feetshoemart

There is no video, All you have to do is show how you reference the two statements I listed below in APA format Create a reference page by citing the following sources in correct APA format. You may use your text or the OWL website to help you, but do not use citation generators. · The episode of Friends titled: The One After Joey and Rachel Kiss · The 6th edition of the APA Manual Solution Reich, A., Cohen, T. (Writers), & Bright, K. S. (Director). (2003).The one after Joey and Rachel Kiss [Television series episode]. In K. S. Bright (Producer), Friends. New York : National Broadcasting Company..

There is no video, All you have to do is show how you reference the .pdf

feetshoemart

The process of Imperialism and Colonialism played a role in the establishment of a \"European\" identity. To what extent are we witnessing this phenomenon being played out in other parts of the world today? Solution Imperialism and colonialism are interrelated. They had played a major role in establishing European identity across the world. It is actually a policy by which a country\'s power and influenceis established in other countries through colonization by means of using either military force, or other means. These days it is evident in cross border encroachments. Border issues has been a major problem in many Asian countries. Like for example India has border issues with Pakistan, Sri Lanka and China. All these countries have established their colonies across the border and they try to invade the country by means of military force. This is clearly a process of colonialism and a mark of European Identity. Though invading into another country\'s territory is not legal these days, it paves way to illegal invasion and encroachment. Countries try to exhibit their power by use of nuclear weapons. Most of the coutries are democratic these days and they have strong military base, they will not allow citizens of other countries to enter into their territory. But when miscreants or anti-democrats invade into other country they pave way for terrorism and anti-social activities. Hence all these activities exhibit the phenomenon of \"European Identity\"..

The process of Imperialism and Colonialism played a role in the esta.pdf

feetshoemart

Terrain Analysis Background Aircraft frequently rely on terrain elevation data to help navigate in low visibility conditions, to reduce pilot workload, to help closely follow terrain at low altitude to avoid radar detection (sometimes called ground-hugging or terrain-following flight), and to plot a course to avoid extreme sudden altitude changes (e.g., flying around a mountain, rather than over it). Terrain elevation data is gathered through terrain-following radar, lidar, satellites, and existing terrain map elevation information. Elevation data is especially useful radar or communication services are not operating. Elevation data is typically broken down into a grid, where each grid cell represents a square physical area of uniform size. Because elevation varies within a cell, the highest elevation in the cell is usually used as the elevation value for that cell on the grid. To navigate using elevation data, it’s useful to compute locations of peaks (high points), valleys (low points), and flat areas (which might be at high or low elevations). To a specific location is a peak, we\'re interested in discovering whether that location is a local maximum. To do this, we must examine its eight adjacent locations: left, right, above, below, and the four diagonal neighbors. If the location we’re analyzing has a higher elevation than all eight surrounding locations, then the location is clearly a peak. We might choose to loosen our definition of a peak by saying, for example, that a location is a peak if more than five of the eight surrounding locations have a lower elevation. Similarly, to decide if a location is a valley, we determine if it\'s a local minimum by checking to see if all eight neighboring locations are higher than the location we’re analyzing. If all eight are higher, we clearly have a valley. Again, we might choose to loosen our valley definition to identify a valley if more than five surrounding locations are higher than the location we’re analyzing. Determining if a location is part of a relatively flat area (a plain for our purposes, but it might also be a plateau in the real world), we would again examine all eight neighboring locations. If they are all within a small tolerance in elevation, then we would declare the location to be part of a plain. Once again, we might choose to loosen our definition of a plain, so that a location surrounded by more than five locations that have a similar elevation is considered a plain. Your Assignment You will develop a C program that creates a two-dimensional array of doubles representing an elevation grid, populates the array it with elevation data read from an instructor-supplied binary data file, displays the elevation data numerically, analyzes the data in the array to find the peaks, valleys, and plains, and displays strings indicating where these peaks, valleys, and plains are. Terrain elevation values are all assumed to be expressed in meters. When defining your C functions in this pr.

Terrain AnalysisBackgroundAircraft frequently rely on terrain el.pdf

feetshoemart

What do viral genomes look like compared to those of living organisms? Why is their genome so small? What do prokaryotic genomes look like compared to those of eukaryotes? (review the five points in the powerpoint discussion) Why is there such a strong correlation between genome size and gene number among prokaryotes? What is a plasmid and what role do they play in bacterial genome evolution? Horizontal Gene Transfer What does gene order tell us about the frequency of genome rearrangement in prokaryotes? Solution Viral Genome Vs. Living Organism\'s Genome Characteristics VIRUS LIVING ORGANISM NUCLEIC ACID DNA/RNA DNA REPLICATION ENZYMES USE HOST\'S ENZYME PRESENT GENOME SIZE SMALL LARGE GENOME MODIFICATIONS ABSENT PRESENT SEGMENTS MONO/MULTI-PARTITE -NA- viruses have small genome size because of high mutation rate in larger genomes, to avoid erors during multiplication the size of genome is reduced. Prokaryotic genome Vs Eukaryotic genomes characteristics prokaryote eukaryote ploidy haploid diploid origin of replication single multiple chromosome shape,number circular, single linear, multiple nuclear membrane, nucleus nucleoid, no membrane present introns absent present size small with no different regions large with distinct regions in prokaryotes, there is strong correlation between genome size and gene number because prokaryotes contain total coding genes no extra non coding region as seen in eukaryotes thus there is a positive correlation. Plasmid is a extrachromosomal DNA found in bacteria which can replicate it self independently from cellular DNA. it is involved in transfer of bacterial genes to other bacteria (horizontal gene transfer) thus facilitate recombination between genes and new genetic combination. gene order are conserved in prokaryotes, but introduction of new genes by horizontal gene transfer changes gene order. thus, changes mong conserved sequence can tell about the rearrangement between genes on chromosome..

What do viral genomes look like compared to those of living organism.pdf

feetshoemart

Verify the identity Verify the identity by transforming the left-hand side into the right-hand side. sec theta - cos theta/tan theta = tan theta/sec theta Solution (sec theta - cos theta)/tan theta=tan theta/sec theta starting with the left side (1 / cos theta - cos theta)/ tan theta (1-cos2theta)/cos theta/sin theta/cos theta= sin2theta/cos theta/sin theta/cos theta=sin theta checking the right side tan theta/sec theta=sin theta/cos theta/1/cos theta=sin theta both sides are equal to sin theta.

Verify the identity Verify the identity by transforming the left-han.pdf

feetshoemart

Suppose there are 14 children trying to form two teams with seven ch.pdf

feetshoemart

11. Define a simple deformable model to detect a half-circular shape (may be rotated). What will be the energy function? Solution shape is a recurring theme in computer vision. For example, shape is one of the main sources of information that can be used for object recognition. In medical image analysis, geometrical models of anatomical structures play an important role in automatic tissue segmentation. The shape of an organ can also be used to diagnose diseases. In a completely different setting, shape plays an important role in the perception of optical illusions (we tend to see particular shapes) and this can be used to explain how our visual system interprets the ambiguous and incomplete information available in an image. Our main goal is to develop techniques that can be used to represent and detect relatively generic objects in images. The techniques we present here revolve around a particular shape representation, based on the description of objects using triangulated polygons. Triangulated polygons allow us to describe complex shapes using simple building blocks. As we show in the next section, the triangles that decompose a polygon without holes are connected together in a tree structure, and this has important algorithmic consequences. By picking a particular triangulation for the polygons we obtain decompositions of objects into meaningful parts. This yields a discrete representation closely related to Blum’s medial axis transform [6]. In this paper we concentrate on the task of finding the location of a deformable shape in an image. This problem is important for the recognition of non-rigid objects. Moreover, objects in many generic classes can be described as deformed versions of an ideal template. In this setting, the location of an object is given by a continuous map from a template to an image. Figure 1 illustrates how we use a deformable template to detect a particular anatomical structure in an MR image. We will show how triangulated polygons provide rich models for deformable shapes. These models can capture both boundary and interior information of an object and can be deformed in an intuitive way. Equally important, we present an efficient algorithm for finding the optimal location of a deformable shape in an image. In contrast, previous methods that take into account the interior of deformable objects. The geometric properties of rigid objects are well understood. We know how three dimensional features such as corners or edges project into images, and there are a number of methods that can be used to represent rigid shapes and locate their projections. Some techniques, such as the alignment method [23], use explicit three dimensional representations. Other techniques, such as linear combination of views [36], capture the appearance of three dimensional shapes using a small number of two dimensional pictures. These and similar techniques assume that all shape variation comes from the viewpoint dependency of two dimensiona.

11. Define a simple deformable model to detect a half-circular shape.pdf

feetshoemart

More from feetshoemart (20)