CS301 Data Structures Assignment No 2 Fall Semester 5th November 2012

[Vuhelper]

After the cancellation of Assignment 1 now. New Assignment 2 has been uploaded.


CS301 Data Structures Assignment No 2 Fall Semester 5th November 2012


Assignment No. 02
SEMESTER Fall 2012
CS301- Data Structures
Total Marks: 20

Due Date: 07/11/2012
Instructions
Please read the following instructions carefully before solving & submitting assignment:
It should be clear that your assignment will not get any credit (zero marks) if:
o The assignment is submitted after due date.
o The submitted code does NOT compile.
o The submitted assignment is other than .CPP file.
o The submitted assignment does NOT open or file is corrupted.
o The assignment is copied (from other student or ditto copy from handouts or internet).
Uploading instructions
For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file.

Note: Use ONLY Dev-C++ IDE.
Objective
The objective of this assignment is

To make you familiar Programming with the Stack data structure.



GOOD LUCK
Marks: 20
In digital computers, bit patterns are used to represent many types of data. Computers perform various operations on bit patterns. With a good representation scheme, bit patterns represent data and bit pattern manipulations represent operations on data. An important example of this is the Binary Addition Algorithm, where two bit patterns representing two integers, which are manipulated to create a third pattern which represents the sum of the integers.
Most processor chips implement the Binary Addition Algorithm in its silicon as part of their arithmetic logic unit.
Write a program in C++ which asks user to enter two binary numbers. Store these two numbers in two different stack variables (objects) bit by bit and calculate its sum and store it in another stack variable and display its sum.


Solution Guidelines:

1. Create a class named Bin_add (means stack class) that should contain following inline functions:
• Constructor( ): To initialize “Bin_add” class data members.
• Isempty( ): To check whether a stack is empty or not.
• Push( ) To push binary number bit by bit onto the stack
• Pop( ) To pop bit (either 0 or 1) from the top of the stack
• Add( ) To add two binary numbers bit by bit and display the sum.

2. In main function:
(a). Create three objects b1, b2, b_sum of type Bin_add class, two for input and one for storing the sum.
(b). Read two binary numbers from user bit by bit and push (insert) them in b1 and b2.
©. Call the Add() function with b_sum object to add and display the sum of both binary numbers.

Sample Output 1:

Sample Output 2:


Lectures Covered: This assignment covers Lecture # 1-8
Deadline: Your assignment must be uploaded/submitted at or before, November 07,2012