Tuesday, June 9, 2015

M.ARIF left you a message

Hi Imbst04,
M.ARIF left you a private message
M.ARIF
View Message
Other Zorpians waiting to meet you...
Iramlehar
iramlehar, 28
Lahore, Pakistan
Srilatha
Srilatha, 27
Hyderabad, Pakistan
Abid
Abid, 22
Islamabad, Pakistan
Waqas
Waqas, 27
Islamabad, Pakistan
This email is sent to imbst04.afaf@blogger.com on behalf of M.ARIF ..
If you do not wish to receive email communications from Zorpia, please click here to opt out.
Zorpia Co. Ltd. P.O. Box #28960, Gloucester Road Post Office, Hong Kong

Friday, December 20, 2013

Thursday, November 28, 2013

★ Muhammad has sent you a message

                          

Hi there,

Muhammad left a message for you

Read Message
You have received this email because a myZamana member has sent you a message. Click the button above to read your message.
Have fun!
The myZamana Team
                          

myZamana, Inc. 427 N Tatnall St #40705 Wilmington, DE 19801
Don't want to receive emails like this in the future? Unsubscribe from future emails.

Monday, April 29, 2013

Digital Logic and Design – CS302


Assignment No. 1
Semester Spring 2013
Digital Logic and Design – CS302

Total Marks:   20

Due Date: 2nd May 2013

Objective:
The assignment has been designed to develop the understanding related to the followings,
  • Binary conversion and addition
  • BCD conversion and addition

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) due to followings,

1.      The assignment is submitted after due date.
2.      The submitted assignment does not open or file is corrupt.
3.      The assignment not submitted in MS Word file format.
4.      The assignment is copied (from other student or copied from handouts or internet).
5.      Student ID is not mentioned in the assignment file or name of file is other than student ID.

GOOD LUCK


Question 1                                                                                                                                          [5 Marks]


(Show complete conversion steps)



(Show complete addition steps)





Question 3                                                                                                                                          [10Marks]
Fill the empty columns in the table by performing each operation against each row.                                                                                                                                                                                                                         


Wednesday, November 28, 2012

CS402_3_SOL

Solution

Qustion 1 
a)

b)

Question 2



reflexive, Symmetric, Transitive and anti-symmetric



Q#01:  Let X = { 1, 5, 9} , Y =  { 3, 4, 7}
            Define f : XY by  f(1) = 4,  f(5) = 7, f(9) = 4
(i)                 Is f one-one?
(ii)               Is f onto?
(iii)             Does inverse of f exist?                                                       


Q#02: Let A = {a, b, c} and R = {(a, c), (b, b), (c, a)} be a relation on A.
 Determine whether R is reflexive, Symmetric, Transitive and anti-symmetric, or not. 
                                                                                                           
Q#03: Find the 36th term of the arithmetic sequence whose 3rd term is 7 and 8th term is 17.


Please provide solution.

NFA/FA



Q. No. 1 Construct Non-Deterministic Finite Automaton (NFA) from the concatenation of the following two languages:                                         
                                                           
a. Language of all strings defined over Σ = {0, 1} whose length is even and number of 1’s are odd.

b. Language of all strings defined over Σ = {0, 1} whose second last letter is 1.

Hint: First construct FA for the given languages and then construct NFA from their concatenation.                                                                                 




Q. No. 2 Construct a Finite Automaton (FA) for the language of all strings defined over Σ = {0, 1} that ends with substring “01” and have odd length.


Reply

Google Analytic