3) einclude struct stack | 40 9 12 11 7 6 6 12 40 int top; int items[50]; main() void fun(struct stack *); void stk print(struct stack "); struct stack S= (5,(6,7,11,12,9,40}}; stk_print(&S); fun(&S); stk_print(&S); /continues
3) einclude struct stack | 40 9 12 11 7 6 6 12 40 int top; int items[50]; main() void fun(struct stack *); void stk print(struct stack "); struct stack S= (5,(6,7,11,12,9,40}}; stk_print(&S); fun(&S); stk_print(&S); /continues
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
can you explain this question , i just want basic experession for understanding
it is c
![3)
#include <stdio.h>
struct stack
40 9 12 11 7 6
int top;
6 12 40
int items[50];
main()
void fun(struct stack *);
void stk_print(struct stack *);
struct stack S = (5,(6,7,11,12,9,40}};
stk_print(&S); fun(&S); stk_print(&5);
>l/continues
void stk_print(struct stack "ps)
int k;
for(k=ps->top; k >=0; k--) printf("%d ", ps->items[k]);
printf("\n");
void fun(struct stack *ps)
struct stack Q;
Int k;
Q.top = -1;
do
if((ps -> items[ps -> top]) % 2 == 0)
Q.items[++Q.top] = ps -> items[ps -> top];
}while(ps -> top--);
*ps = Q;
//======](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F695d2234-b6de-45f4-a5b2-a087c7d4312b%2F85530d52-f954-4920-bbf2-fcb52cf9c901%2Ftfjf8va_processed.png&w=3840&q=75)
Transcribed Image Text:3)
#include <stdio.h>
struct stack
40 9 12 11 7 6
int top;
6 12 40
int items[50];
main()
void fun(struct stack *);
void stk_print(struct stack *);
struct stack S = (5,(6,7,11,12,9,40}};
stk_print(&S); fun(&S); stk_print(&5);
>l/continues
void stk_print(struct stack "ps)
int k;
for(k=ps->top; k >=0; k--) printf("%d ", ps->items[k]);
printf("\n");
void fun(struct stack *ps)
struct stack Q;
Int k;
Q.top = -1;
do
if((ps -> items[ps -> top]) % 2 == 0)
Q.items[++Q.top] = ps -> items[ps -> top];
}while(ps -> top--);
*ps = Q;
//======
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 4 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education