Question

In: Computer Science

consider the code; typedef struct { int size; int *nums; }Data; Complete the function below that...

consider the code;

typedef struct {

int size;

int *nums;

}Data;

Complete the function below that creates and returns a new data type that contains a nums array with size randomly chosen integers. Ensure proper error checking.

Data *getRandomData(int size) {

//PUT CODE HERE

//Create random ints

for(int i=0; i<size; i++)

d->nums[1] = (int)(rand()/(float)RAND_MAX*100);

return d;

Expert Solution

CODE

#include <stdio.h>

#include <stdlib.h>

#include <time.h>

typedef struct {

int size;

int *nums;

} Data;

Data *getRandomData(int size) {

Data *d = (Data*) malloc(1 * sizeof(Data));

d->size = size;

d->nums = malloc(size * sizeof(int));

for(int i=0; i<size; i++) {

d->nums[i] = (int)(rand()/(float) RAND_MAX * 100);

}

return d;

}

int main(void) {

srand(time(0));

Data *d = getRandomData(3);

printf("Size: %d", d->size);

printf("\nElements: %d, %d, %d", d->nums[0], d->nums[1], d->nums[2]);

return 0;

}

OUTPUT

venereology answered 3 months ago

Using the following definitions for a binary tree, typedef struct bintreenode { int data; struct bintreenode*...

Using the following definitions for a binary tree, typedef struct bintreenode { int data; struct bintreenode* left; struct bintreenode* right; } btreenode; // Used for a node in the queue. typedef struct node { btreenode* nodePtr; struct node* next; } node; // Used to represent the queue efficiently. typedef struct queue { node* front; node* back; } queue; Implement the following functions: void bfs(btreenode* root) // Prints a breadth first search traversal of the binary search tree rooted at root....

#include <stdio.h> typedef struct Coordinates { int x; int y; } Coordinate; typedef union uCoordinates {...

#include <stdio.h> typedef struct Coordinates { int x; int y; } Coordinate; typedef union uCoordinates { int x; int y; } uCoordinate; // TODO - Populate 4 different Coordinates with any numbers between 1 and 99 for x & y values // using coordinate1, coordinate2, coordinate3, & coordinate4 as Coordinate names // TODO - Print to screen the x & y values of each coordinate // TODO - Replace the following with your name: Ethin Svoboda int main() { //...

Please debug the code and answer the questions: #include <stdio.h> typedef struct node { int value;...

Please debug the code and answer the questions: #include <stdio.h> typedef struct node { int value; struct node *next; } node; int ll_has_cycle(node *first) { node * head = first; while (head->next) { head = head->next; if (head == first) return 1; } return 0; } void test_ll_has_cycle(void) { int i,j; node nodes[5]; for(i=0; i < sizeof(nodes)/sizeof(node); i++) { nodes[i].next = NULL; nodes[i].value = i; } nodes[0].next = &nodes[1]; nodes[1].next = &nodes[2]; nodes[2].next = &nodes[1]; printf("Checking first list for cycles....

Consider the following declaration: typedef struct{ &nbsp

Consider the following declaration: typedef struct{ int A; char B[10]; float C; char D; }rectype; typedef rectype matrix[121][4][5]; matrix A1; Compute the address of element A1[120][3][3] given the base address at 2000.

#include<stdio.h> #include<stdlib.h> struct listNode{ int data; struct listNode nextptr; }; typedef struct listNode node; void insert(node);...

#include<stdio.h> #include<stdlib.h> struct listNode{ int data; struct listNode *nextptr; }; typedef struct listNode node; void insert(node*); void showList(node*); void printListBackwards(node *); int main(void) { node *list1; printf("\n Create a sorted list.."); printf("\n Enter values for the first list (-999 to end):"); list1=(node*)malloc(sizeof(node*)); //Allocate memory for the list node insert(list1); //insert values by calling the function insert showList(list1); //display values entered by user printf("\n After recursively reversing the list is :\n"); printListBackwards(list1); //print the values in reverse order using the function...

Assume that struct Node { int item; Node* link; }; typedef Node* NodePtr; 1. Write function...

Assume that struct Node { int item; Node* link; }; typedef Node* NodePtr; 1. Write function void list_head_insert(NodePtr& head, int entry); The function should insert a new Node, in which entry is the value of attribute item, in front of the linked list that is pointed by head. 2. Write function void list_head_remove(NodePtr& head); The function will remove the first node from the linked list that is pointed by head. 3. Write function NodePtr list_search(NodePtr head, int target); The function...

In c++: Code Challenge Consider the following code: struct ListNode { int value; struct ListNode *next;...

In c++: Code Challenge Consider the following code: struct ListNode { int value; struct ListNode *next; }; ListNode *head; // List head pointer Assume that a linked list has been created and head points to the first node. Write code that traverses the list displaying the contents of each node’s value member Now write the code that destroys the linked list

Please do this code with python. Thank you! struct Node { int data; struct...

Please do this code with python. Thank you! struct Node { int data; struct Node* left; struct Node* right; }; // Node creation struct Node* newNode(int data) { struct Node* nn = new Node; nn->data = data; nn->left = NULL; nn->right = NULL; return nn; } // Function to insert data in BST struct Node* insert(struct Node* root, int data) { if (root == NULL) return newNode(data); else {...

I have the following code #include <stdio.h> #include<string.h> #define BUFLEN 128 typedef struct { int numPhrases;...

I have the following code #include <stdio.h> #include<string.h> #define BUFLEN 128 typedef struct { int numPhrases; }SyncInfo; char buffer[BUFLEN] ; char *phrases[] = {"educated", "educated cat", "educated lion", "serious person" , "serious panda","curious student","curious art student", "obnoxious web developer"}; char localBuffer[BUFLEN]; int allVowelsPresent; void *checker(void *param) { int a=0, e=0, i=0, o = 0, u= 0 ; int* n = (int*)param; // typecasting a void* to int* //printf("%d\n",*n); for (int q=0; q< (*n); ++q) { // dereferencing to get the...

#include #include #include int reverse(int); // Stack ADT Type Defintions typedef struct node { void* dataPtr;...

#include #include #include int reverse(int); // Stack ADT Type Defintions typedef struct node { void* dataPtr; struct node* link; } STACK_NODE; typedef struct { int count; STACK_NODE* top; } STACK; /* =============== createStack ============== This algorithm creates an empty stack. Pre Nothing Post Returns pointer to a null stack -or- NULL if overflow */ STACK* createStack(void) { // Local Definitions STACK* stack; // Statements stack = (STACK*)malloc(sizeof(STACK)); if (stack) { stack->count = 0; stack->top = NULL; } // if return...