# CS401 Assignment 2 Solution and Discussion Spring 2020

• CS401 Computer Architecture and Assembly Language Programming Assignment 2 Solution & Discussion Spring 2020

Computer Architecture and Assembly Language Programming (CS401)

Assignment # 02

Total marks = 20 Deadline Date June 12th, 2020

RULES FOR MARKING:

It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.
You should concern the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc. will not be accepted.

Topic Covered:

Branching

Subroutines

NOTE:

No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.

If you people find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.

For any query, feel free to email at: [email protected]

Q1. Write a subroutine that will take two arrays Array1 & Array2. Array1 will contain uppercase alphabets from A-M and the Array2 will contain lower case alphabets from n-z. Your subroutine should work in such a way that it will convert array1 elements to lower case and array2 elements to uppercase and populate them in a 3rd array. (Marks 20)

For example:

Array1 = A,B,C,D,E,F,G,H,I,J,K,L,M

Array2= n,o,p,q,r,s,t,u,v,w,x,y,z

Output should be:

Array3= a,b,c,d,e,f,g,h,I,j,k,l,m,N,O,P,Q,R,S,T,U,V,W,X,Y,Z

Note: You can consult to alphabet’s ASCII values through this link:

1

1

9

1

2

4

4

3
| |