What would be missing codeRemaining part(not in picture )BeeNode* headObj = nullptr; BeeNode* firstBee = nullptr; BeeNode* secondBee = nullptr; BeeNode* currBee = nullptr; int babies1; int babies2; cin >> babies1; cin >> babies2; headObj = new BeeNode(-1); /* Your code goes here */ currBee = headObj; while (currBee != nullptr) { currBee->PrintNodeData(); currBee = currBee->GetNext(); } return 0;} Two integers, babies1 and babies2, are read from input as the number of babies of two bees. headObj has the default value of -1.Create a new node firstBee with integer babies1 and insert firstBee after headObj. Then, create a second node secondBee withinteger babies2 and insert second Bee after firstBee.Ex: If the input is 37 61, then the output is:-137611 #include 2 using namespace std;4 class BeeNode {5public:6BeeNode (int babiesInit = 0, BeeNode* nextLoc= nullptr);void InsertAfter (BeeNode* nodeLoc);78910111213 };14BeeNode GetNext();void PrintNodeData();private:Checkint babiesVal;BeeNode* nextNodePtr;15 BeeNode::BeeNode (int babies Init, BeeNode* nextLoc) '{16this->babiesVal= babies Init;this->nextNodePtr = nextLoc;1718}CS Scanned with CamScannerNext level3 CSTwo integers, babies1 and babies2, are read from input as the number of babies of two bees. headObj has the default value of -1.Create a new node firstBee with integer babies1 and insert firstBee after headObj. Then, create a second node secondBee withinteger babies2 and insert second Bee after firstBee.Ex: If the input is 37 61, then the output is:-137611920 void BeeNode:: InsertAfter (BeeNode* nodeLoc) {21BeeNode* tmpNext = nullptr;22232425 nodeLoc->nextNodePtr = tmpNext;tmpNext this->nextNodePtr;this->nextNodePtr = nodeLoc;26}2728 BeeNode* BeeNode::GetNext() {29 return this->nextNodePtr;30 }3132 void BeeNode::PrintNodeData() {33 cout << this->babiesVal << endl;34}3536 int main() {37BeeNode headObj = nullptr;1Scanned wi2lanner.'L3

The complete code is given below step with output screenshot

What would be missing code Remaining part(not in picture ) BeeNode* headObj = nullptr; BeeNode* firstBee = nullptr; BeeNode* secondBee = nullptr; BeeNode* currBee = nullptr; int babies1; int babies2; cin >> babies1; cin >> babies2; headObj = new BeeNode(-1); /* Your code goes here */ currBee = headObj; while (currBee != nullptr) { currBee->PrintNodeData(); currBee = currBee->GetNext(); } return 0; }

What would be missing code Remaining part(not in picture ) BeeNode* headObj = nullptr; BeeNode* firstBee = nullptr; BeeNode* secondBee = nullptr; BeeNode* currBee = nullptr; int babies1; int babies2; cin >> babies1; cin >> babies2; headObj = new BeeNode(-1); /* Your code goes here */ currBee = headObj; while (currBee != nullptr) { currBee->PrintNodeData(); currBee = currBee->GetNext(); } return 0; }

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 2PE

See similar textbooks

Similar questions

Counting hashtags Write Python code to count the frequency of hashtags in a twitter feed. Your code assumes a twitter feed variable tweets exists, which is a list of strings containing tweets. Each element of this list is a single tweet, stored as a string. For example, tweets may look like: tweets = ["Happy #IlliniFriday!", "It is a pretty campus, isn't it, #illini?", "Diving into the last weekend of winter break like... #ILLINI #JoinTheFight", "Are you wearing your Orange and Blue today, #Illini Nation?"] Your code should produce a sorted list of tuples stored in hashtag_counts, where each tuple looks like (hashtag, count), hashtag is a string and count is an integer. The list should be sorted by count in descending order, and if there are hashtags with identical counts, these should be sorted alphabetically, in ascending order, by hashtag. From the above example, our unsorted hashtag_counts might look like: [('#illini', 2), ('#jointhefight', 1),…
C++
This is a linked list node class Node { public: int data; Node *next; }; Using the above code write the following functions. Please test in the main function of your program. Please upload all code that you write. 1. Adding and removing a node 2. Removing ever third node 3. Adding the complete list at the end. if you had a list 1,2,3 the new list will be 1,2,3,1,2,3 4. Write a function to find the average of the list 5. Write a function that takes in a list as a parameter and adds it to the current list. This Node add will only happen if list 1 element is less then list 2 element. Example List 1 - 1,2,3 List 2 - 3,1,4 New List - 4,2,7 - It only adds if L2 > L1 List all assumptions.
Problem Name: Facebook RecommendationsProblem Description: You can visualize Facebook as a graph where the nodes represent a set of users and the edges between the nodes (as a “friend” connection between you and everyone who you have befriended). Your job is to write a program that automatically computes and suggests a new friend recommendation for a user, given knowledge of the entire network. In other words, for each user, suggest the most probable user to befriend based upon the intersection of your common friends. For example, if Person A is a user on the network, Person A will get a recommendation to add Person B as their friend if Person B has the most friends in common with Person A, but B is currently not friends with Person A. The high-level idea is that for any user, you should A) go through all the other users and calculate the number of friends they have in common. B) Find the user in the social network who they are currently not friends with but have the most friends in…
#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode* leftPtr; int data; struct treeNode* rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode* TreeNodePtr; void insertNode(TreeNodePtr* treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr* treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if…
#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode *leftPtr; int data; struct treeNode *rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode *TreeNodePtr; void insertNode(TreeNodePtr *treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr *treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if (*treePtr != NULL) { (*treePtr)->data = value;…
write a c++ code uisng linked list for quiz. In quiz game, questions are chosen in such a a way that they cover all fields of a typical quiz contest. The user’s general knowledge is tested with quiz questions regarding science, technology, movies, sports, general health, geography and many more. • Edit score• Help-- menu • Show record• Show score• Reset score The game ends when the user’s cash prize piles up to 100RS. For each question there are 4 options A, B, C and D and no negative markings. so money would not be deducted for wrong answersto the questions.
For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }
KnumberLoops4constant ? NumberSquare ♡ Language/Type: Related Links: J Write a console program in a class named Number Square that prompts the user for two integers, a min and a max, and prints the numbers in the range from min to max inclusive in a square pattern. Each line of the square consists of a wrapping sequence of integers increasing from min and max. The first line begins with min, the second line begins with min + 1, and so on. When the sequence in any line reaches max, it wraps around back to min. You may assume that min is less than or equal to max. Here is an example dialogue: Min? 1 Max? 5 12345 23451 34512 45123 51234 F Java interactive programs for % Scanner @ → JL # C $ Main Page → Exercises → Java → Solve an Exercise % Σ 31 A INO 3 19 10100 Nood bolna 5 Class: Write a complete Java class. acer & Submit ▸ 11 * O US ProcessName2 > Oct 13 7:17
2. ID: A Name: 2. A list of numbers is considered increasing if each value after the first is greater than or equal to the preceding value. The following procedure is intended to return true if numberList is increasing and return false otherwise. Assume that numberList contains at least two elements. Line 1: PROCEDURE isIncreasing (numberList) Line 2: { Line 3: count 2 Line 4: REPEAT UNTIL(count > LENGTH(numberList)) Line 5: Line 6: IF(numberList[count] =. YA198IC
djkvnuisdvsuykb jkxcnjlvnocv
Correct the code in order to make it work as shown in the example: insert: hello insert: world undo display hello redo display hello world The Code: #include <stdio.h>#include <stdlib.h>struct node{char data[100];struct node *link;}*top; struct node *list=NULL;void insert(){struct node *temp;temp = (struct node*)malloc(sizeof(struct node));printf("Enter the element to be inserted in the queue: ");scanf("%s",temp->data);temp->link = NULL;if (rear == NULL){top = temp;}else{top->link = temp;top= temp;}} void display(){struct node *temp;temp = top;int cnt = 0;if (top== NULL){printf("Stack underflow\n");}else{printf("The elements of the stack are:\n");while (temp){printf("%s\n", temp->data);temp = temp->link;cnt++;}}}void undo(){struct node *temp=top; if(top== NULL)printf("\nNO element to Undo.\n");else{while(temp->link->link){temp=temp->link;}if(list==NULL){…