Homework Answers
struct Node * find_ll(struct Node* anchor, char *word) // Checks whether the word is present in linked list.
{
Node* search = head; // Initialize search
while (search != NULL)
{
if (search->key == x)
return search;
search = search->next;
}
return NULL;
}
Explanation:
1) we will first initialize a node pointer search=head .
2) while search is not equal to null
a) if search ->key is equal to key word searched ,then return the pointer.
b) search= search ->next
3) return false.
Add Answer to:
struct Node * new_11( void ) { // return a new node to be the list...
Modify the below code to fit the above requirements: struct node { char data; struct node...
Modify the below code to fit the above requirements:
struct node
{
char data;
struct node *next;
struct node *previous;
} *front, *MyNode, *rear, *MyPointer, *anchor *Valuenode ;
typedef struct node node;
int Push(char input)
{
if(IsFull()==1)
{
printf("The queue is full. Enter the ‘^’ character to
stop.\n");
return -1;
}
else if (IsFull()==-1)
{
node *MyNode=(node*)malloc(sizeof(node));
MyNode->data=input;
rear->next=MyNode;
MyNode->previous=rear;
MyPointer=rear=MyNode;
return 1;
}
else
{
node *MyNode=(node*)malloc(sizeof(node));
node *anchor=(node*)malloc(sizeof(node));
MyNode->data=input;
MyPointer=rear=front=MyNode;
MyNode->previous=NULL;
MyNode->next=NULL;
anchor->next=MyNode;
return 0;
}
}
char...
Using the provided Linked List example code, linkedlist.c, as an example Make a node struct that...
Using the provided Linked List example code, linkedlist.c, as an example Make a node struct that holds ints instead of strings. In your main, insert 25 to 75 random integers with range (0 to 100) into a linked list of your nodes. Use a random to determine how many to make. Write a function int sum(NodePointer current) that returns the sum of the integers in the list by looping through the linked list. Write a function int count(NodePointer current) that...
In c++, what alternative to malloc line? Such as struct Node* newNode(int data) { struct Node*...
In c++, what alternative to malloc line? Such as struct Node* newNode(int data) { struct Node* node = (struct Node*) malloc(sizeof(struct Node)); node->data = data; node->left = NULL; node->right = NULL; return node; }
() Given the following structure definition and typedef for a linked list of strings: typedef struct...
() Given the following structure definition and typedef for a linked list of strings: typedef struct node st node; struct node st { char *word; /* a valid string pointer or NULL */ node *next; /* next node in the list or NULL */ }; Write a C function, free list(), that takes as an argument one of these lists, possibly NULL, and frees all the strings as well as the list itself. Write robust code. void free list(node *list){
C LANGUAGE I just need the void push() function, which inserts new node to the front...
C LANGUAGE I just need the void push() function, which inserts new node to the front of the list #include<stdio.h> #include<stdlib.h> typedef struct node { int data; struct node *next; } Node; //Creating head a as a global Node* Node *head; /* Given a node prev_node, insert a new node after the given prev_node */ void insertAfter (Node * prev_node, int new_data) { /*1. check if the given prev_node is NULL */ if (prev_node == NULL) { printf ("the given...
in the c programming language. List *init() { head = ( List * ) malloc( sizeof(...
in the c programming language. List *init() { head = ( List * ) malloc( sizeof( List ) ); if ( head == NULL ) { prtError( "Insufficient memory!" ); return( NULL ); } head->data = -1; head->next = NULL; tail = head; return ( head ); } /* Insert a new data element d into the list. */ /* Insert at the front of the list, right behind the dummy node. */ /* Return NULL if a new node...
implement a doubly-linked list in C. Each node in the linked list should contain a string,...
implement a doubly-linked list in C. Each node in the linked list should contain a string, a pointer to the previous node (or NULL), and a pointer to the next node (or NULL). The nodes should be sorted by their strings. struct node_t { char* str; struct node_t* prev; struct node_t* next; } To maintain the doubly-linked list, you should keep a pointer to the head node of the list (or NULL if the list is empty), and a pointer...
Programming in C: I am trying to modify this linked list to be doubly linked list....
Programming in C: I am trying to modify this linked list to be doubly linked list. I’m also trying to add a print in reverse function. I’m really struggling with how to change the insert function to doubly link the nodes without effecting the alphabetical sorting mechanism. Example of desired output: Enter your choice: 1 to insert an element into the list. 2 to delete an element from the list. 3 to end. ? 1 Enter a character: a The...
Implement a program that: reads a number of personal records (for example, using PERSON struct from...
Implement a program that: reads a number of personal records (for example, using PERSON struct from the earlier lab) from the standard input, creates a database of personal records, allows for adding new entries to the database, allows for deleting entries from the database, includes functions to acquire a record of personal data, and includes functions to display (print) a single selected record from the database, and also allows for printing all records in the database. NOTES: if name is...
****find_last_node.c #include <stdio.h> #include "linked_list.h" int main(){ ...
****find_last_node.c
#include <stdio.h>
#include "linked_list.h"
int main(){
struct node *linked_list = NULL;
linked_list = add_to_list(linked_list, 5,
'a');
linked_list = add_to_list(linked_list, 10, 'b');
linked_list = add_to_list(linked_list, 4, 'c');
linked_list = add_to_list(linked_list, 10, 'd');
linked_list = add_to_list(linked_list, 5, 'e');
linked_list = add_to_list(linked_list, 7, 'f');
linked_list = add_to_list(linked_list, 5, 'g');
linked_list = add_to_list(linked_list, 3, 'h');
int search_number;
printf("Enter number you want to search for:");
scanf("%d", &search_number);
struct node *last_node = find_last(linked_list,
search_number);
if (last_node != NULL)
{
printf("Node found: value = %d and...
Modify the below code to fit the above requirements:
struct node
{
char data;
struct node *next;
struct node *previous;
} *front, *MyNode, *rear, *MyPointer, *anchor *Valuenode ;
typedef struct node node;
int Push(char input)
{
if(IsFull()==1)
{
printf("The queue is full. Enter the ‘^’ character to
stop.\n");
return -1;
}
else if (IsFull()==-1)
{
node *MyNode=(node*)malloc(sizeof(node));
MyNode->data=input;
rear->next=MyNode;
MyNode->previous=rear;
MyPointer=rear=MyNode;
return 1;
}
else
{
node *MyNode=(node*)malloc(sizeof(node));
node *anchor=(node*)malloc(sizeof(node));
MyNode->data=input;
MyPointer=rear=front=MyNode;
MyNode->previous=NULL;
MyNode->next=NULL;
anchor->next=MyNode;
return 0;
}
}
char...
****find_last_node.c
#include <stdio.h>
#include "linked_list.h"
int main(){
struct node *linked_list = NULL;
linked_list = add_to_list(linked_list, 5,
'a');
linked_list = add_to_list(linked_list, 10, 'b');
linked_list = add_to_list(linked_list, 4, 'c');
linked_list = add_to_list(linked_list, 10, 'd');
linked_list = add_to_list(linked_list, 5, 'e');
linked_list = add_to_list(linked_list, 7, 'f');
linked_list = add_to_list(linked_list, 5, 'g');
linked_list = add_to_list(linked_list, 3, 'h');
int search_number;
printf("Enter number you want to search for:");
scanf("%d", &search_number);
struct node *last_node = find_last(linked_list,
search_number);
if (last_node != NULL)
{
printf("Node found: value = %d and...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago