C PROGRAMMING PLEASE FOLLOW THE INSTRUCTIONS AND MAKE SURE THE OUTPUT MATCHES THE EXPECTED OUTPUT! DO NOT CHANGE ANYTHING IN THE MAIN FUNCTION!!!!!! Expected Output String is : (abcdef) String is : (1234) String is : (cm)
C PROGRAMMING PLEASE FOLLOW THE INSTRUCTIONS AND MAKE SURE THE OUTPUT MATCHES THE EXPECTED OUTPUT! DO NOT CHANGE ANYTHING IN THE MAIN FUNCTION!!!!!! Expected Output String is : (abcdef) String is : (1234) String is : (cm)
Related questions
Question
C PROGRAMMING
PLEASE FOLLOW THE INSTRUCTIONS AND MAKE SURE THE OUTPUT MATCHES THE EXPECTED OUTPUT! DO NOT CHANGE ANYTHING IN THE MAIN FUNCTION!!!!!!
Expected Output
String is : (abcdef)
String is : (1234)
String is : (cm)
Transcribed Image Text:#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);
Transcribed Image Text: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.
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!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
