Scribd
Upload
48 views7 pages

Se183391 WS4

This document provides objectives and exercises for a workshop on pointers and developing programs with simple menus in C. The objectives are: (1) managing data using pointers and (2) developing programs using simple menus. Part 1 includes exercises on pointer operations and outputs. Part 2 instructs students to develop two programs with simple menus - one to check if a number is prime or not and another to generate Fibonacci sequences. Students are also encouraged to develop additional programs combining functions from the previous workshop.

Uploaded by

Nguyễn Hưng
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
48 views7 pages

Se183391 WS4

This document provides objectives and exercises for a workshop on pointers and developing programs with simple menus in C. The objectives are: (1) managing data using pointers and (2) developing programs using simple menus. Part 1 includes exercises on pointer operations and outputs. Part 2 instructs students to develop two programs with simple menus - one to check if a number is prime or not and another to generate Fibonacci sequences. Students are also encouraged to develop additional programs combining functions from the previous workshop.

Uploaded by

Nguyễn Hưng
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Subject: PRF192- PFC

Workshop 04

Objectives:
(1) Managing data using pointers
(2) Developing programs using simple menus

Part 1: Use notebook

Exercise 1 (1 mark) : Explain outputs:

*pn = 7
*pm = 6
*pn = 6 + 2*6 - 3*7 = -3
*pm = *pm - *pn => *pm = 6 - (-3) = 9
=> m = 9, n = -3;
- m + n = 9 - 3 =6;

*p1 = A = 65;
*p2 = F = 70;
*p1 = *p1 + 3 = 65 + 3 = 68;
*p2 = *p2 - 5 = 70 - 5 = 65
=> c1 = 68, c2 = 65;
- c1 - c2 = 68 - 65 = 3

*p1 = 3.2;
*p2 = 5.1;
*p1 = *p1 + 3 - 2*(*p2) =3.2 + 3 - 2*5.1 = -4;
*p2 = *p2 - 3*(*p1) = 5.1 - 3*3.2 = 17.1
=> x= -4, y= 17.1;
- x + y= -4 + 17.1 = 13.1

Exercise 2: (1 marks) What are outputs


int
n=7,m=8;
int* p1= &n,
*p2=&m;
*p1 +=12-
m+ (*p2);
*p2 = m + n-
2*(*p1);
printf(“%d”,
m+n);
What is the
output?
- Output is: -4.
int n=7,m=8;
int* p1= &n,
*p2=&m;
*p1 +=12-m+
(*p2);
*p2 = m + n-
2*(*p1);
printf(“%d”,
m+n);
What is the
output?
- Output is: -4.
Exercise 3: (2 marks) Walkthroughs

- The value of the L is: 6.


- The value of the a = 6 and b = 7.

- The value of the C is 2.


Part 2: Develop a program using simple menu

Program 1(3 marks):

Objectives Practice implementing a program with simple menu.


Related knowledge None
Problem Write a C program that will execute repetitively using a simple menu
as following:

1- Process primes
2- Print min, max digit in an integer;
3- Quit
Select an operation:

1- When user selects the option 1, the program will accept a


positive integral number and print out a message about
whether the input number is a prime or not.
2- When user selects the option 2, the program will accept a
positive integral number and print out the minimum and
maximum digit in this number.
3- The program will terminate when user selects the option 3.

Analysis Nouns:
- positive integral number  int n
- A number represents a choice of user  int choice;
Functions:
int prime( int n)  see above
void printMinMaxDigits( int n)  see above
Suggested algorithm Begin
(logical order of Do /* Print out the menu and get user choice*/
verbs) { Print out “1- Process primes\n”;
Print out “2- Print min, max digit in an integer \n”;
Print out “3- Quit\n”;
Print out “Select an operation:”;
switch(choice)
{ case 1: do
{ Input n;
}
while(n<0);
If ( prime(n)==1) Print “ It is a prime\n”;
Else Print “ It is not a prime\n”;
break;
case 2: do
{ Input n;
}
while(n<0);
printMinMaxDigits( int n) ;
break;
}
}
while ( choice >0 & choice<3);
End

Program 2(3 marks): ( refer to the workshop 2 for algorithms)

Write a C program that will execute repetitively using a simple menu as following:

1-Fibonacci sequence
2-Check a date
3-Quit
Choose an operation:

1- When the option 1 is selected, the program will accept a positive integral number,
called as n, then the first n Fibonacci numbers will be printed out
2- When the option 2 is selected, the program will accept a date then the program will
tell that whether this data is valid or not.
3- If the option 3 is selected, the program quits

More Programs

You can pick 2 or 3 functions in the workshop 2, associate them to a new program.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy