Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
C PROGRAMMING! PLEASE FOLLOW THE INSTRUCTIONS AND MAKE SURE THE CODES OUTPUT MATCHES THE EXPECTED OUTPUT!! Expected Output String is : (abcdef) String is : (1234) String is : (cm)

C PROGRAMMING! PLEASE FOLLOW THE INSTRUCTIONS AND MAKE SURE THE CODES OUTPUT MATCHES THE EXPECTED OUTPUT!! Expected Output String is : (abcdef) String is : (1234) String is : (cm)

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

C PROGRAMMING!

PLEASE FOLLOW THE INSTRUCTIONS AND MAKE SURE THE CODES OUTPUT MATCHES THE EXPECTED OUTPUT!!

Expected Output

String is : (abcdef)
String is : (1234)
String is : (cm)

 

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.
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.
#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:#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);
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Computational Systems
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS