MCSL-017 C and Assembly Language Programming Solved Assignment 2018-19

-

Section 1: C Programming Lab 

Question 1:- Write an interactive program in C language to create an application program for a cooperative bank to maintain the customers’ database. This application should have menu options like below: • Creating a New Record  • Reading/Listing of Records • Modify the record • Delete the record Each customer record should have Customer Name, Account Number, Account Type, Telephone/Mobile, Address, Nominee Name, Account Balance, Date of Joining, etc. The application should be designed user-friendly.        (20 Marks) 

Section 2: Assembly Language Programming Lab 

Question 1:- 
a) Write a program in assembly language to read the current time and Date from the system and display it in the standard format on the screen.    (5 Marks)

b) Write a program in assembly language to multiply two 16-bit numbers and to store the result in the specified location.      (5 Marks)

c) Write a program in assembly language to add two numbers and to store the result in the specified destination.       (5 Marks)

d) Write a program in assembly language to to move immediate data to Registers.          (5 Marks)

                                   👇Click below to Download Assinment👇

Comments

  1. Mateusz DomańskiOctober 2, 2019 at 9:19 AM

    I have read these tasks and probably would not cope with them. I think this is a typical task for a programmer. I am sure that the engineer enablement specialists would not have any problems with such tasks.

    ReplyDelete

Post a Comment

Popular posts from this blog

Asymptotic notations

-
  Data Structure The main idea of asymptotic analysis is to have a measure of efficiency of algorithms that doesn’t depend on machine specific constants,  and doesn’t require algorithms to be implemented and time taken by programs to be compared. Asymptotic notations are mathematical tools to represent time complexity of algorithms for asymptotic analysis.  The following 3 asymptotic notations are mostly used to represent time complexity of algorithms. 1) Θ Notation, 2) Big O Notation, 3) Ω Notation. Click here to learn more
Read more
-
  STACKS in Data Structure A stack is  an abstract data type that holds an ordered, linear sequence of items . In contrast to a queue, a stack is a last in, first out (LIFO) structure. A real-life example is a stack of plates: you can only take a plate from the top of the stack, and you can only add a plate to the top of the stack... Click here to Know more
Read more

Array

-
Image
  An array is a collection of similar data elements stored at contiguous memory locations. It is the simplest data structure where each data element can be accessed directly by only using its index number. For instance, if we want to store the marks scored by a student in 5 subjects, then there’s no need to define individual variables for each subject. Rather, we can define an array which will store the data elements at contiguous memory locations. · array  marks[5]  defines the marks scored by a student in 5 different subjects where each subject marks are located at a particular location in the array i.e.  marks[0]  denotes the marks scored in first subject,  marks[1]  denotes the marks scored in 2nd subject and so on.
Read more