Đề Thi Cơ Sở Dữ Liệu

Stack ADT Abstract Data Type... Stack Implementation in C• What is .h file?... Stack Implementation in C#define maxsize=5;... Stack Implementation in CInit... Stack Implementation in CPu

by Le Quy Loc Information Technology Faculty

DUT

Stack ADT (Abstract Data Type)

Stack

Design Stack

Push An Element Into a Stack

• Algorithm

1 If stack is still empty

1.1 Save the element to the top of stack 1.2 Increase the number of elements by 1

top

1 5

7

top =2 top=3

Stack Implementation in C

• What is h file?

Stack Implementation in C

#define maxsize=5;

Stack

Implementation

in C

Stack Implementation in C

Init

Stack Implementation in C

Push

Stack Implementation in C

Pop

Stack Implementation in C

Empty

Exercises

Determine the values of stack and top after each commands and what are printed in the program?

1 int top, element;

2 intstack[10];

3 int x, y, z;

4 x = 0;

5 y = 5;

6 z = y / 2;

7 init(&top); 8 push(stack, &top, x);

9 push(stack, &top, y);

10 z = pop(stack, &top);

11 push(stack, &top, x+1); 12 push(stack, &top, y);

13 push(stack, &top, 3);

14 while (!empty(&top))

15 {

16 z = pop(stack, &top); 17 printf(“%d ”, z);

18 }

19 printf("x = %d",x);

20 printf(“y = %d”,y);

21 printf("z = %d",z);

Using the stack operations, write functions to

1 Copy data from a stack to another stack

2 Sum of negative elements

3 Delete all elements equal x in a stack

4 Convert decimal to binary

Homework

Convert infix expression to postfix

expression

• Write a function to calculate

– (3 + 4)*5

– 3 + (4 - 2 + (12 – 6)/2)*6 + 8 * 3^2

Convert infix expression to postfix

expression

• Infix expression: operators between operands

– Good: easy to read for human

– Bad: difficult for computer to calculate

Convert infix expression to postfix

Convert infix expression to postfix