Scribd
Upload
34 views1 page

Assignment 1

The document provides instructions for Assignment 1 which is due on March 16, 2023. It includes 4 practice problems - writing a program to determine if a string is a palindrome, finding the 23rd Fibonacci number, finding the minimum and maximum elements in an array, and outputting a pattern using nested loops. Students are instructed to write comments in their code.

Uploaded by

Kavin Hasan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views1 page

Assignment 1

The document provides instructions for Assignment 1 which is due on March 16, 2023. It includes 4 practice problems - writing a program to determine if a string is a palindrome, finding the 23rd Fibonacci number, finding the minimum and maximum elements in an array, and outputting a pattern using nested loops. Students are instructed to write comments in their code.

Uploaded by

Kavin Hasan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment 1

CSE331L/EEE332L/ETE332L/EEE453L
Microprocessor Interfacing and Embedded Systems
Lab Instructor: Rokeya Siddiqua
Deadline: March 16, 2023

Practice problem: #2

1. A palindrome is a word that is same when read from both ends. Example: ‘RACECAR’.
Write a program that will take a string from a user and determine whether the word is a
palindrome. The output may be a ‘Yes’ or a ‘No’.

Sample Input Sample Output


racecar Yes
hellyeah No

2. Write a program to find 23rd Fibonacci number. [By implementing Fibonacci formula]

3. Write a program to find the minimum and maximum element in an array. [Create an array of
size 10 and read the elements as user input]

4. Write a program to output the following pattern – [Using nested loop]

Enter the number of Lines: 5

*
***
*****
*******
*********
*******
*****
***
*

Note: You have to write comments.

You might also like