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 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)

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

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 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:

  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        initialize()
    • boolean IsEmpty (Stack)
    • character pop (Stack)
    • Stack push(Stack and character)
    • character top (Stack)
    • size(Stack)

 

  1. The driver program interface can be either menu-based driven application that displays buffer operations, or you can select your preferred interface.
  2. You need to implement the following constraints in the buffer operations:
  3. Can’t use the buffer before creating it.
  4. Can’t delete a character from an empty buffer.
  5. 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.
  6. 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.
  7. Print the contents of the buffer after each operation requested by the user.

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY