n char get() Delete and return the character at the cursor char delete() Move the cursor k position to the left void left (int k) Move the cursor k positions to the right void right(int k) Requirements:
n char get() Delete and return the character at the cursor char delete() Move the cursor k position to the left void left (int k) Move the cursor k positions to the right void right(int k) Requirements:
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
Related questions
Question
Write a program in C to insert or delete characters in a buffer. You need to use stack operations to maintain operations for a buffer in a text editor. The program implements the following operations using two stacks that are represented using linked list:
- Create an empty buffer createBuffer()
- Insert a character at the cursor position insert()
- Get the character at the cursor position char get()
- Delete and return the character at the cursor char delete()
- Move the cursor k position to the left void left (int k)
- Move the cursor k positions to the right void right(int k)
Requirements:
- You need to implement the Stack ADT using either Array or Linked list implementation for the following operations in a file named “stack.h”:
- Stack initialize()
- boolean IsEmpty (Stack)
- character pop (Stack)
- Stack push(Stack and character)
- character top (Stack)
- size(Stack)
- The driver program interface can be either menu-based driven application that displays buffer operations, or you can select your preferred interface.
- You need to implement the following constraints in the buffer operations:
- Can’t use the buffer before creating it.
- Can’t delete a character from an empty buffer.
- Move the cursor k positions to the right where k <= n and n is the number of characters-in the buffer. If k >= n then the cursor moves to the last character in the buffer.
- Move the cursor k positions to the left where current position – k < 0 returns the cursor to 0 position. For example, if current position is 5 and k = 10 then 5-10 = -5 <0 then cursor will be in position 0.
- Print the contents of the buffer after each operation requested by the user.
![Write a program to insert or delete characters in a buffer. You need to use stack operations to
maintain operations for a buffer in a text editor. The program implements the following
operations using two stacks that are represented using linked list:
Create an empty buffer
• Insert a character at the cursor position
Get the character at the cursor position
• Delete and return the character at the cursor
createBuffer()
insert()
char get()
char delete()
void left (int k)
void right(int k)
Move the cursor k position to the left
• Move the cursor k positions to the right
Requirements:
1. You need to implement the Stack ADT using either Array or Linked list implementation
for the following operations in a file named "stack.h":
• Stack
• boolean
• character
• Stack
• character
• Integer.
initialize()
IsEmpty (Stack)
pop (Stack)
push(Stack and character)
top (Stack)
size(Stack)
2. The driver program interface can be either menu-based driven application that displays
buffer operations, or you can select your preferred interface.
3. You need to implement the following constraints in the buffer operations:
a. Can't use the buffer before creating it.
b. Can't delete a character from an empty buffer.
c. Move the cursor k positions to the right where k <=n and n is the number of
characters-in the buffer. If k >= n then the cursor moves to the last character in the
buffer.
d. Move the cursor k positions to the left where current position – k<0 returns the
cursor to 0 position. For example, if current position is 5 and k = 10 then 5-10 = -5 <0
then cursor will be in position 0.
e. Print the contents of the buffer after each operation requested by the user.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1cd89bf3-2a7d-4e7b-b55a-67efda27c369%2F4be1234d-bb30-4ad6-b81a-9d349a4b2093%2Fjqvvfww_processed.png&w=3840&q=75)
Transcribed Image Text:Write a program to insert or delete characters in a buffer. You need to use stack operations to
maintain operations for a buffer in a text editor. The program implements the following
operations using two stacks that are represented using linked list:
Create an empty buffer
• Insert a character at the cursor position
Get the character at the cursor position
• Delete and return the character at the cursor
createBuffer()
insert()
char get()
char delete()
void left (int k)
void right(int k)
Move the cursor k position to the left
• Move the cursor k positions to the right
Requirements:
1. You need to implement the Stack ADT using either Array or Linked list implementation
for the following operations in a file named "stack.h":
• Stack
• boolean
• character
• Stack
• character
• Integer.
initialize()
IsEmpty (Stack)
pop (Stack)
push(Stack and character)
top (Stack)
size(Stack)
2. The driver program interface can be either menu-based driven application that displays
buffer operations, or you can select your preferred interface.
3. You need to implement the following constraints in the buffer operations:
a. Can't use the buffer before creating it.
b. Can't delete a character from an empty buffer.
c. Move the cursor k positions to the right where k <=n and n is the number of
characters-in the buffer. If k >= n then the cursor moves to the last character in the
buffer.
d. Move the cursor k positions to the left where current position – k<0 returns the
cursor to 0 position. For example, if current position is 5 and k = 10 then 5-10 = -5 <0
then cursor will be in position 0.
e. Print the contents of the buffer after each operation requested by the user.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education