In C programming ONLY!PLEASE FOLLOW THE INSTRUCTIONS #include #include typedef struct node {char letter;struct node* next;} node;// Returns number of nodes in the linked List.int length(node* head)}// parses the string in the linked List// if the linked list is head -> |a|->|b|-> |C|then tocString function wil return "abc"char* toCString(node* head)}// inserts character to the linkedlist// f the linked list is head -> |a|-| b|->|c|// then insert Char (&head, 'x') will update the linked list as foolows:// head-> |a|->|b|->|c|-> |x|void insertChar (node** pHead, char c)}// deletes all nodes in the linked List.void deleteList (node** pHead)}int main(void){}int i, strLen, numInputs;node* head = NULL;char* str;char c;FILE* inFile = fopen("input.txt","r");fscanf(inFile, " %d\n", &numInputs);while (numInputs --> 0){{}fscanf(inFile, " %d\n", &strLen);for (i = 0; i < strLen; i++){}str= toCString (head);printf("String is: %s\n", str);fscanf(inFile," %c", &c);insertChar (&head, c);free (str);delete List (&head);if (head != NULL)printf("deleteList is not correct!");break;fclose(inFile); COP 3502 Section 4Lab Assignment # 4An alternate method of storing a string is to store each letter of the string in a single node of a linked list,with the first node of the list storing the first letter of the string. Using this method of storage, no nullcharacter is needed since the next field of the node storing the last letter of the string would simply be anull pointer.In this program, you are going to complete the missing below functions in the attached C-file.This program reads the input from the attached input.txt file in the following format:36abcdef412342cmWhen the chars "abcdef" are read, your program will construct a linked list as follows:headab+сdefYou are going to implement the following functions:int length (node* head)char* toCString(node* head)void insertChar (node** pHead, char c)void deletelist (node** pHead)Once you are done, please upload the C-file. We are going to compile and run your C-file to grade.

Start the program.Declare the necessary variables and structures.Open the input file ("input.txt")…

COP 3502 Section 4 Lab Assignment # 4 An alternate method of storing a string is to store each letter of the string in a single node of a linked list, with the first node of the list storing the first letter of the string. Using this method of storage, no null character is needed since the next field of the node storing the last letter of the string would simply be a null pointer. In this program, you are going to complete the missing below functions in the attached C-file. This program reads the input from the attached input.txt file in the following format: 3 6 abcdef 4 1234 2 cm When the chars "abcdef" are read, your program will construct a linked list as follows: head a b - с d e f You are going to implement the following functions: int length (node* head) char* toCString(node* head) void insertChar (node** pHead, char c) void deletelist (node** pHead) Once you are done, please upload the C-file. We are going to compile and run your C-file to grade.

COP 3502 Section 4 Lab Assignment # 4 An alternate method of storing a string is to store each letter of the string in a single node of a linked list, with the first node of the list storing the first letter of the string. Using this method of storage, no null character is needed since the next field of the node storing the last letter of the string would simply be a null pointer. In this program, you are going to complete the missing below functions in the attached C-file. This program reads the input from the attached input.txt file in the following format: 3 6 abcdef 4 1234 2 cm When the chars "abcdef" are read, your program will construct a linked list as follows: head a b - с d e f You are going to implement the following functions: int length (node* head) char* toCString(node* head) void insertChar (node pHead, char c) void deletelist (node pHead) Once you are done, please upload the C-file. We are going to compile and run your C-file to grade.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.5: Case Studies

Problem 3E

See similar textbooks

Related questions

Q: C++ Programming language: Declare an integer variable, myValue. Declare an integer pointer, ptr,…

A: I have provided code in step2

Q: In C#, how do you distinguish between an argument and a parameter variable?

A: Introduction: When a function is called, an argument refers to the values that were supplied to the…

Q: I need some code redone, I have a basic setup of the code but I would like to make a few changes to…

A: I am writing the code in Step2 and screen shot of code in step3 and output in step4. In this code I…

Q: what is Statement block ?

A: The block statement is basically a series of zero or more statements enclosed within the braces. It…

Q: In order to be able to use the cout , cin , and endl commands what line of C++ code must be included

A: cin, cout and endl in C++ cin statement The keyword cin refers to as "console input" that enables…

Q: using namespace std;

A: First of all you need to know namespace is a feature which is added in c++ like as: #include…

Q: Provide an article detailing how networking has contributed to breakthroughs in IT.

A: It helps you find jobs and improve professionally even when you're not looking. Professional growth…

Q: Explain the concept of "header files" in programming, particularly in languages like C and C++.

A: In the world of programming, header files play a crucial role in managing code organization,…

Q: when assigning variable names in python, what must we do to create a copy of the data?

A: Assigning variable name in python : If you want to create variable in python so that name start from…

Q: Problem II Create a C++ program for a simple employee management system. The program should enable…

A: Initialize an empty vector of Employee structures.Create a menu-driven loop: a. Display…

Q: Problem I Design a C++ program for a simple task management system. The program should allow users…

A: Define a struct Task with title, description, due date, and completion status.Implement functions to…

Q: Fundamentals of Programming in C Language, BASICS ONLY Write the C language statement or…

A: Program Approach: Include the necessary header files for the standard I/O operations. Define the…

Q: A header of a C-language function is: void recurs( int current_level, int max_level ) The keyword…

A: The above question is solved in step 2 :-

Question

In C programming ONLY!

PLEASE FOLLOW THE INSTRUCTIONS

#include <stdio.h>
#include <stdlib.h>
typedef struct node {
char letter;
struct node* next;
} node;
// Returns number of nodes in the linked List.
int length(node* head)
}
// parses the string in the linked List
// if the linked list is head -> |a|->|b|-> |C|
then tocString function wil return "abc"
char* toCString(node* head)
}
// inserts character to the linkedlist
// f the linked list is head -> |a|-| b|->|c|
// then insert Char (&head, 'x') will update the linked list as foolows:
// head-> |a|->|b|->|c|-> |x|
void insertChar (node** pHead, char c)
}
// deletes all nodes in the linked List.
void deleteList (node** pHead)
}
int main(void)
{
}
int i, strLen, numInputs;
node* head = NULL;
char* str;
char c;
FILE* inFile = fopen("input.txt","r");
fscanf(inFile, " %d\n", &numInputs);
while (numInputs --> 0)
{
{
}
fscanf(inFile, " %d\n", &strLen);
for (i = 0; i < strLen; i++)
{
}
str= toCString (head);
printf("String is: %s\n", str);
fscanf(inFile," %c", &c);
insertChar (&head, c);
free (str);
delete List (&head);
if (head != NULL)
printf("deleteList is not correct!");
break;
fclose(inFile);

COP 3502 Section 4
Lab Assignment # 4
An alternate method of storing a string is to store each letter of the string in a single node of a linked list,
with the first node of the list storing the first letter of the string. Using this method of storage, no null
character is needed since the next field of the node storing the last letter of the string would simply be a
null pointer.
In this program, you are going to complete the missing below functions in the attached C-file.
This program reads the input from the attached input.txt file in the following format:
3
6
abcdef
4
1234
2
cm
When the chars "abcdef" are read, your program will construct a linked list as follows:
head
a
b
+
с
d
e
f
You are going to implement the following functions:
int length (node* head)
char* toCString(node* head)
void insertChar (node** pHead, char c)
void deletelist (node** pHead)
Once you are done, please upload the C-file. We are going to compile and run your C-file to grade.

Process by which instructions are given to a computer, software program, or application using code.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Algorithm

VIEW

Step 2: Source Code

VIEW

Step 3: Code Screenshot

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

flip_matrix(mat:list)->list You will be given a single parameter a 2D list (A list with lists within it) this will look like a 2D matrix when printed out, see examples below. Your job is to flip the matrix on its horizontal axis. In other words, flip the matrix horizontally so that the bottom is at top and the top is at the bottom. Return the flipped matrix. To print the matrix to the console: print('\n'.join([''.join(['{:4}'.format(item) for item in row]) for row in mat])) Example: Matrix: W R I T X H D R L G L K F M V G I S T C W N M N F Expected: W N M N F G I S T C L K F M V H D R L G W R I T X Matrix: L C S P Expected: S P L C Matrix: A D J A Q H J C I Expected: J C I A Q H A D J
Domino cycledef domino_cycle(tiles):A single domino tile is represented as a two-tuple of its pip values, such as (2,5) or (6,6). This function should determine whether the given list of tiles forms a cycle so that each tile in the list ends with the exact same pip value that its successor tile starts with, the successor of the last tile being the first tile of the list since this is supposed to be a cycle instead of a chain. Return True if the given list of domino tiles form such a cycle, and False otherwise. tiles Expected result [(3, 5), (5, 2), (2, 3)] True [(4, 4)] True [] True [(2, 6)] False [(5, 2), (2, 3), (4, 5)] False [(4, 3), (3, 1)] False
C++ Write a program that will allow a user to enter students into a database. The student information should include full name, student ID, GPA and status. The program should allow delete any student based on student ID. You may not use a vecto or an array only the list function.
Contact list: Binary Search A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe 123-5432 Linda…
struct nodeType { int infoData; nodeType * next; }; nodeType *first; … and containing the values(see image) Using a loop to reach the end of the list, write a code segment that deletes all the nodes in the list. Ensure the code performs all memory ‘cleanup’ functions.
By python
A c++ code that performs a search for a specific employee and returns the employee ID if found and 0 if not: int findEmployeeById(Employee list[], int size, int myId)
Program Specification For this assignment you will write a program to help people record the events of their day by supplying prompts and then saving their responses along with the question and the date to a file. Functional Requirements This program must contain the following features: Write a new entry - Show the user a random prompt (from a list that you create), and save their response, the prompt, and the date as an Entry. Display the journal - Iterate through all entries in the journal and display them to the screen. Save the journal to a file - Prompt the user for a filename and then save the current journal (the complete list of entries) to that file location. Load the journal from a file - Prompt the user for a filename and then load the journal (a complete list of entries) from that file. This should replace any entries currently stored the journal. Provide a menu that allows the user choose these options Your list of prompts must contain at least five different prompts.…
OCaml Code: Attached are the instructions. Make sure to read the instructions carefully and write your own test cases to make sure the code works. Make sure to include a screenshot of the correct code with the test cases that is used along with the output of the code being passed.
Data structures concatenate_dict(dict_list:list)->dict This function will be given a single parameter known as the Dictionary List. Your job is to combine all the dictionaries found in the dictionary list into a single dictionary and return it. There are two rules for adding values to the dictionary: 1. You must add key-value pairs to the dictionary in the same order they are found in the Dictionary List. 2. If the key already exists, it cannot be overwritten. In other words, if two or more dictionaries have the same key, the key to be added cannot be overwritten by the subsequent dictionaries. Example: Dictionary List: [{'Z': 6, 'k': 10, 'w': 3, 'I': 8, 'Y': 5}, {'Y': 1, 'Z': 4}, {'X': 2, 'L': 5}] Expected: {'Z': 6, 'k': 10, 'w': 3, 'I': 8, 'Y': 5, 'X': 2, 'L': 5} Dictionary List: [{'z': 0}, {'z': 7}] Expected: {'z': 0} Dictionary List: [{'b': 7}, {'b': 10, 'A': 8, 'Z': 2, 'V': 1}] Expected: {'b': 7, 'A': 8, 'Z': 2, 'V': 1}
Create a soda beverage shopping cart program using C++ implementing the following: Linked List - this will be used as the user's cart. This is where the items that the user will purchased are stored here before checking them out. Array - use arrays to store user's stored products. Pointers Functions - Make sure that the rogram will have user-defined functions (e.g.: function for adding nodes, function for displaying the cart, etc.) The program must have a menu where the user can select an action (e.g. Select product, View cart, Check out, etc.) Soda options: Coca-Cola, Pepsi, Sprite, Royal, Mountain Dew Must implement Developer name before the program exits. Please show the entire code and final output.
(List maintenance) a. Write a complete C++ program that can be used to update an ordered list of numbers. Use the list of numbers shown in Figure 7.13 to test that your program is working correctly. b. Test the program you wrote for Exercise 4a, using a new part number of 86 with the list of numbers shown in Figure 7.13. This test should place this new code at the beginning of the existing list. c. Test the program you wrote for Exercise 4a, using a part number of 200 with the list of numbers shown in Figure 7.13. This test should place this new part number at the end of the existing list