Data Structure And Algorithm ==================== Establish a sequential stack, and run operations in the sequential stack. General operations include:Create stack, push element into stack, pop element from the stack, display element in the stack, check if the stack is full. Implementation of algorithm Use stack to convert the decimal digit to octal digit. Define a function of conversion, create a stack, read N and push it into stack. Get the remainder of N%8 and push into stack. Go on the %8 until the remainder is 0. Pop the remainder and get the octal digit. Header file #define MAXSIZE 100 typedef int Elemtype; typedef struct {               Elemtype stack[MAXSIZE];               int top; }Sstack;   Source file #include #include #include #include "stack.h"   void initialize(Sstack *L)//initialize a stack {//initiate a stack                                 ;                 }   int stackIsEmpty(Sstack *L)//check if the stack is empty. If it is empty, return 1, else return 0. {//determine an empty stack                                 ;                                 ; }   int push(Sstack *L, Elemtype x)//Push element into stack. If the stack is full, hint the user and return 0. Else, push the element into the stack and return 1. {//push element x into stack                                     ;                            ;   }     Elemtype pop(Sstack *L)//Stack pop:if the stack is empty return 0,else pop an element and return the value of poped element. {//pop an element               Elemtype a;                                ;                      ;   }     Elemtype getTop(Sstack *L)//read and return the value of the top element. {//get the top element                                 ;   }     void conversion( )//Number conversion {               ElemType e; Sstack *L;                            ;//allocate stack memory for L                                      ;//Initialize L;               int N;               printf("Please input a number to be converted\n");               scanf("%d",&N);               while(N)//When N is not 0               {                                           ;                                           ;               }               printf("The number converted into octal form is\n");//output the changed number                                  ; }   void main()//main function {               conversion( ); }

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

Data Structure And Algorithm

====================

  1. Establish a sequential stack, and run operations in the sequential stack.

General operations include:Create stack, push element into stack, pop element from the stack, display element in the stack, check if the stack is full.

Implementation of algorithm

Use stack to convert the decimal digit to octal digit. Define a function of conversion, create a stack, read N and push it into stack. Get the remainder of N%8 and push into stack. Go on the %8 until the remainder is 0. Pop the remainder and get the octal digit.

Header file

#define MAXSIZE 100

typedef int Elemtype;

typedef struct

{

              Elemtype stack[MAXSIZE];

              int top;

}Sstack;

 

Source file

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

#include "stack.h"

 

void initialize(Sstack *L)//initialize a stack

{//initiate a stack

                                ;

             

 

}

 

int stackIsEmpty(Sstack *L)//check if the stack is empty. If it is empty, return 1, else return 0.

{//determine an empty stack

                                ;

                                ;

}

 

int push(Sstack *L, Elemtype x)//Push element into stack. If the stack is full, hint the user and return 0. Else, push the element into the stack and return 1.

{//push element x into stack

                                    ;

                           ;

 

}

 

 

Elemtype pop(Sstack *L)//Stack pop:if the stack is empty return 0,else pop an element and return the value of poped element.

{//pop an element

              Elemtype a;

                               ;

                     ;

 

}

 

 

Elemtype getTop(Sstack *L)//read and return the value of the top element.

{//get the top element

                                ;

 

}

 

 

void conversion( )//Number conversion

{

              ElemType e;

Sstack *L;

                           ;//allocate stack memory for L

 

                                   ;//Initialize L;

              int N;

              printf("Please input a number to be converted\n");

              scanf("%d",&N);

              while(N)//When N is not 0

              {

                                          ;

                                          ;

              }

              printf("The number converted into octal form is\n");//output the changed number

                                 ;

}

 

void main()//main function

{

              conversion( );

}

Expert Solution
steps

Step by step

Solved in 4 steps with 1 images

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