CS-64 Introduction to Computer Organisation
We are in the process of upadting this section for the question papers of BCA IGNOU
You have reached the cached page for http://bca.ignou4india.com/cs-64-introduction-to-computer-organisation/ Below is a snapshot of the Web page as it appeared on 12/5/2010 (the last time our crawler visited it). This is the version of the page that was used for ranking your search results. The page may have changed since we last cached it. To see what might have changed (without the highlights), go to the current page. Bing is not responsible for the content of this page. |
| Section: IGNOU | IGNOU Results | IGNOU MCA | IGNOU BCA | IGNOU MBA | IGNOU NEWS | Contact Us | Resources | |
BCA IGNOU
Pages (1) : [1]
CS-64 Introduction to Computer OrganisationWe are in the process of upadting this section for the question papers of BCA IGNOU Related Other Question PapersCS-64: Introduction to Computer Organisation December 2001CS-73 : Introduction to Computer Organisation Dec-2004Question Paper of CS-73 : Introduction to Computer Organisation Dec-2004 Q.l(a) State the operations under which each of the following classes of languages are closed. (i) Languages accepted by Finite Automata (ii) Languages accepted by Pushdown Automata (b) What is the difference between an NP-complete language and an NP-hard language? Give an example of a language which is NP hard and not NP-complete. Justify your choice of example. CS-64: Introduction to Computer Organisation December 2003Question Paper of CS-64: Introduction to Computer Organisation Ql(a). Perform the following arithmetic operations using 8-bit register. Use 2's complement method. Indicate overflow or underflow if it occurs. (i) 28 + (-28) (ii) 26 (-26) (iii) - 38 (90) (iv) 25 90 (b) Construct the karnaugh's map for the following function in term of various A, B, C, D. Find the optimal function using this map. CS-64 : Introduction to Computer Organisation January 2001Question Paper of CS-64: Introduction to Computer Organisation Ql(a). Perform the following arithmetic operations on 8 bit number using signed 2's complement notation. Indicate the overflow and underflow, if any. (b) Simplify the following Boolean function in sum-of-products form by using four variable karnaugh's map. Draw the resultant logic diagram using AND-ORgates F(A,B,C,D)= (0,5,6,7,9,10,15) Please note that symbol means that the minterms that produce 1 for the function are listed as decimal equivalent of cell number in K-map, enclosed in the parentheses. (d) What is meant by functionally complete set of gates ? Show that {NAND} is a functionally complete set of gates. (e) Write CS-64: Introduction to Computer Organisation June 2003Question Paper of CS-64: Introduction to Computer Organisation Ql(a). Perform the following arithmetic operations on 8-bit numbers using signed 2's complement notation. Indicate the overflow/underflow, if any. (b) Simplify the following Boolean function in sum-of-product form by using four variable Karnaugh's Draw the resultant logic diagram using AND-OR gates. ( c) The register of processor has the following values: AL 0011 0011 BL 1100 1100 CL 1111 1111 DL 0000 1111 What will be the value of various registers, if the following operations are performed: (i) Increment CL (ii)Mask AL With DL (iii) Selective set BL Using DL (iv) Rotate arithmetic left DL (v) Register AL = AL + BL (use new values) (d) Write a program in 8086 assembly language |
||||||
|
||||||
| Copyright : Education News India | Powered
By: IGNOU |
||
| Competetive Exams in India : IIT JEE Exam : AIEEE Exam : CAT Exam : GMAT Exam : PMT Exam : MAT Exam | |||