Scribd Logo
Upload

Welcome to Scribd!

  • Mca (Revised) Term-End Practical Examination December, 2oos 0 2 9 6 3

    Uploaded by

    Sumit Waitforit Rana
    43 views1 page
    This document provides instructions for a term-end practical examination in C and Assembly Language Programming. It consists of two parts, each worth 1 hour and 20 marks. Part I involves writing and running a C program that contains a recursive function to find the Greatest Common Divisor (GCD) of two integers. It also requires a main function to accept two numbers between 1-50 as input and call the GCD function to print the result. Part II involves writing and running an 8086 assembly language program that takes a 2-digit packed BCD number in the AL register, calculates the sum of squares of the digits, and displays the output.

    Original Description:

    sdfs

    Original Title

    MCSL 016

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides instructions for a term-end practical examination in C and Assembly Language Programming. It consists of two parts, each worth 1 hour and 20 marks. Part I involves writing and running a C program that contains a recursive function to find the Greatest Common Divisor (GCD) of two integers. It also requires a main function to accept two numbers between 1-50 as input and call the GCD function to print the result. Part II involves writing and running an 8086 assembly language program that takes a 2-digit packed BCD number in the AL register, calculates the sum of squares of the digits, and displays the output.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    43 views1 page

    Mca (Revised) Term-End Practical Examination December, 2oos 0 2 9 6 3

    Uploaded by

    Sumit Waitforit Rana
    This document provides instructions for a term-end practical examination in C and Assembly Language Programming. It consists of two parts, each worth 1 hour and 20 marks. Part I involves writing and running a C program that contains a recursive function to find the Greatest Common Divisor (GCD) of two integers. It also requires a main function to accept two numbers between 1-50 as input and call the GCD function to print the result. Part II involves writing and running an 8086 assembly language program that takes a 2-digit packed BCD number in the AL register, calculates the sum of squares of the digits, and displays the output.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    MCA (Revised) Term-End Practical Examination December,2ooS 02963

    MCSL-OLT C AND ASSEMBLYTANGUAGE PROGRAMMING z


    Timeallowed:2hours Note : Maximum Marks : 50

    There are two parts (C Programmingand AssemblyLanguageProgramming) in this paper. Eachpart is for L hour duration. Attempt anly that part(s) in which you are not successful yet, as
    PART I C Programming

    Nofe : Anstnerthefollowing question. It carries20 marks. 5 marksarefor oiaa-aoce this part. on 1. Write and run a program that has the following functions/features : ' It has a recursive function to find the Greatest Common Divisor (GCD) of two numbers. It has a main( ) program that acceptstwo integer values as input after checking that these values are in the range 1 to 50. The main( ) function then calls the function that finds GCD and prints the GCD value. Make suitable assumptions, if any.

    PART II Assembly Language Programming Note: Answer thefollorning question. It carcies marks. 5 marksarefor aiaa-uou on this part. 20 1. Write and run a program in 8086 assembly language that takes a packed 2 digit BCD number and displays the sum of squaresof the digits. You may assumethe number to be in AL register. (Examp_le: _Assuming AL contains 43 then the program should output 2 5 a s : 4 2 + 3= L 6 + 9 : 2 5 ) 2 -oOo20

    MCSt-0L7/53

    3,000

    You might also like