Site icon KHOJINET

BCSL-022 Solved Assignment 2018-19 For IGNOU BCA 2nd Semester

BCSL-022 Solved Assignment For IGNOU BCA 2nd Semester 2018-2019 in PDF Format

BCSL-022 Solved Assignment 2018-19. Assembly Language Programming Lab Assignment Solution In PDF Format. This solution is valid for July 2018 and January 2019 Session. Click on the button below to open download page.

Course Code : BCSL-022
Course Title : Assembly Language Programming Lab
Assignment Number : BCA(2)/BCSL022/Assignment/2018-19
Maximum Marks : 50
Weightage : 25%
Last Dates for Submission: 15th October, 2018 (For July, 2018 Session)
15st April, 2019 (For January, 2019 Session)

This assignment has two questions of total of 40 marks. Rest 10 marks are for viva voce. Please go through the guidelines regarding assignments given in the programme guide for the format of presentation.

Question 1:
Design a two bit counter circuit that counts from 0 to 3. It should have states 00, 01, 10 and 11. The initial state of the counter may be assumed to be 00. The counter will be in following successive states: 00, 01, 10, 11, 00, 01, 10, 11, 00, 01, 10, 11, 00 …
Use any flip flop to design the circuit. You must design counter using state transition diagram and Karnaugh’s map. (10 Marks)

Question 2:
Write and run following programs using 8086 assembly language. (3*10 = 30 Marks)
(a) Write and run an Assembly language program that converts an ASCII four digit number that is stored in four consecutive byte locations into a packed BCD number that is to be stored in DX register. For example, if ASCII digits 4321 are stored in four consecutive locations then your program will convert them into packed BCD and store it in DX as (0100 0011 0010 0001)2

(b) Write and run (using appropriate calling program) a near procedure in 8086 assembly language that checks if the input parameter has a value zero or not. If the value is zero subroutines terminates the program else returns a value 1 in AL register.

(c) Write and run an 8086 assembly language program that finds the sum of odd placed values out of 10 consecutive byte values stored in an array in the memory. For example, if 10 consecutive byte values (in hexadecimal) are – 12, AA, 13, AB, 14, AC, 15, AD, 16, AF, then this program should add only value 12, 13, 14, 15 and 16.

Download IGNOU BCA Solved Assignments July 2018 and January 2019 Session (For All Subjects) In PDF Format

Exit mobile version