(1) Write a program that will:
(a) display "Enter Your Name:"
(b) convert the entered name to Capital letters (if small), If any other character is entered, the program will ask the user to "re-enter the name again".
(c) display the Name (in Capital letters) in the center of the screen.
(2) Write a program that will do the same operation as "AAA" instruction. Means the program will generate the same results as "AAA" operation.
(3) Write an efficient assembly language program that will generate Fibonacci numbers. Your program will:
(a) Display a message stating: Enter a number ‘n' (n<=10) to generate the sequence Fn of Fibonacci numbers.
(b) Display the generated Fibonacci numbers
(Example: if n=10, you should display 55)
In mathematics, the Fibonacci numbers are the numbers in the following integer sequence:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,...
By definition, the first two Fibonacci numbers are 0 and 1, and each subsequent number is the sum of the previous two. In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation:
Fn =Fn-1 +Fn-2, with seed values of F0 = 0 and F1 = 1