VUsolutions Transferred to AchiKhasi.com

From December 2011, this blog www.VUsolutions.blogspot.com is transferred to http://achikhasi.com/vu/ . So, you may visit http://achikhasi.com/vu/ for latest study related help.

Back to home VUsolutions

VUsolutions Fans Club [join us for MORE solutions]

VUsolutions on Facebook

CS101 Assignment No. 2 Solution

Wednesday, April 27, 2011 Posted In Edit This
Assignment No. 02 

Semester Spring 2010

Human-Computer Interaction-CS201


Total Marks: 15



Due Date: 27/04/2011



Objective:
To learn Boolean Logical operations and the basics of Word Processor and Spread Sheet
Instructions:
Please read the following instructions carefully before solving & submitting assignment:
Assignment should be in your own wordings not copied from net, handouts or books.
It should be clear that your assignment will not get any credit (zero marks) if:

  • The assignment is submitted after due date.
  • The submitted assignment does not open or file is corrupt.
  • The assignment is copied from other student or copied from handouts or any internet source.
  • Student ID is not mentioned in the assignment File or name of file is other than student ID.
  • The assignment is not according to the given format

For any query about the assignment, contact at cs101@vu.edu.pk

Question No.1 (Marks = 10)
a) How many combinations of bits are exist when we make a truth table of 9 inputs?  (2 Marks)

b) Prepare a truth table for the following I = (w + x) Å (y . z) where w, x, y and z are four binary inputs in the truth table. (8 Marks)
Note :(Å  symbol represent XOR gate)

Question No.2 Write any three features and two limitations of each one in the given format (Marks = 5)

Features: (3 Marks)
Sr.No.
Word Processor
Spread Sheet
1.



2.



3.




 Limitations: (2 Marks)
Sr.No.
Word Processor
Spread Sheet
1.



2.





Note:

  • Assignment should be in your own wordings not copied from net, handouts or books.

  • Your answer should be “to the point”


Solution:


Answers

Question No.1 (Marks = 10)
a) How many combinations of bits are exist when we make a truth table of 9 inputs?
            2n are the total combinations of bits in Truth table, where n is number of variables, so
29=512
            512 bits will there


b) Prepare a truth table for the following I = (w + x) Å (y . z) where w, x, y and z are four binary inputs in the truth table.
Note :(Å  symbol represent XOR gate)
Solution:
Remember in XOR, output will high only if only all inputs are mismatch to each others.

Inputs


Output
W
X
Y
Z
w+x
y.z
(w + x)  Å (y . z)
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
1
0
0
0
0
0
0
1
1
0
1
1
0
1
0
0
1
0
1
0
1
0
1
1
0
1
0
1
1
0
1
0
1
0
1
1
1
1
1
0
1
0
0
0
1
0
1
1
0
0
1
1
0
1
1
0
1
0
1
0
1
1
0
1
1
1
1
0
1
1
0
0
0
0
0
1
1
0
1
1
0
1
1
1
1
0
1
0
1
1
1
1
1
1
1
0




Question No.2 Write any three features and two limitations of each one in the given format

Features: (3 Marks)
Sr.No.    Word Processor                                                  Spread Sheet
1.             Good Formatting Hand with                                  Good Mathematical Hand
               Integrate technology
2.             Real word 2d drawing                                            Good Drawing,  Flow chart
                Features of Spell and Grammatical error                and charts.
               checking
3.         Direct mail attachment and Data recovery Options   Data recovery, AutoSave and
And much more                                                                      much more
              



 Limitations:
Sr.No.    Word Processor                                                  Spread Sheet
1.             Calculation of Functions and relationship              Limited Format styles w.r.t
MS word
               Up gradation is very costly.
2              3D drawing not sported.                                         Animations and special
Effects not present
              

There May many more limitations and features search them.
::::::::::::::::::::::::::::::
Definition for xor: 

The logical operation exclusive disjunction, also called exclusive or (symbolized XOR, EOR, or ⊕), is a type of logical disjunction on two operands that results in a value of true if exactly one of the operands has a value of true. A simple way to state this is "one or the other but not both.".
::::::::::::::::::::::::::::

Question No.1 (Marks = 10)
a) How many combinations of bits are exist when we make a truth table of 9 inputs? (2 Marks)
Answer :
29=512
512 bits


b) Prepare a truth table for the following I = (w + x)  (y . z) where w, x, y and z are four binary inputs in the
truth table. (8 Marks)
Note :symbol represent XOR gate)

Answer :

W
X
Y
Z
W + X
Y.z
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
1
0
0
0
0
0
0
1
1
0
1
1
0
1
0
0
1
0
1
0
1
0
1
1
0
1
0
1
1
0
1
0
1
0
1
1
1
1
1
0
1
0
0
0
1
0
1
1
0
0
1
1
0
1
1
0
1
0
1
0
1
1
0
1
1
1
1
0
1
1
0
0
1
0
1
1
1
0
1
1
0
1
1
1
1
0
1
0
1
1
1
1
1
1
1
0





Back to home VUsolutions

Shaadi.com: Just create ur account & find ur partner or EARN money, its reall & EASY

VUsolutions Followers (Join NOW and Get Extra Benefits)

Install LATEST toolbar having lot of features - GET solutions on Desktop

toolbar powered by Conduit
Caliplus 300x250 NoFlam VitoLiv 468x60 GlucoLo