Study Guides (238,127)
York University (9,812)
EECS 1520 (166)

# 2009_feb.doc_-_CSE_1520_for_John_Hofbauer_on_2013-03-06_at_York_University.pdf

5 Pages
249 Views

School
York University
Department
Electrical Engineering and Computer Science
Course
EECS 1520
Professor
John Hofbauer
Semester
Fall

Description
Test 2 CSE 1520I 2008-09F Feb. 12, 2009 page 1 of 5 York University Faculty of Science and Engineering Department of Computer Science and Engineering CSE 1520I Computer Use: Fundamentals February 12, 2009 Family Name: ________________________________________________________ Given Name: ________________SOLUTION________________________________ Student Id: ________________________________________________________ Instructions 1. The exam has 20 questions and 5 pages (including this one). Examination time is 45 minutes. 2. No aids (such as calculator, reference sheet, etc.) are permitted. 3. Turn off cell phones and put your cell phones off the desk. 4. Write legibly. Unreadable answers do not count. Do not use red ink. 5. Generally, no questions re the interpretation, intention, etc. of an exam question will be answered by invigilators. If in doubt, state your interpretation as part of your answer. Mark: __________________ / 25 ----> __________________ / 50 - 1 - Test 2 CSE 1520I 2008-09F Feb. 12, 2009 page 2 of 5 Here are some truth tables. Each has inputs A and B and output E. (a) A B E (b) A B E (c) A B E (d) A B E (e) A B E ======= ======= ======= ======= ======= 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 1 1 0 1 0 0 1 1 0 1 0 1 0 0 1 0 1 1 0 1 1 0 1 1 0 0 1 1 0 1 1 1 1 1 0 1 1 0 1 1 1 1. Which of the above truth tables represents an XOR gate? a. b. c. d. e. 2. Which of the above truth tables represents the Boolean expression E = (A+B)(AB’)? a. b. c. d. e. 3. Consider the Boolean expression 0∙A + B∙B’ + 1∙A. To which of the following Boolean expressions is it equivalent? (a) A (b) 0 (c ) 1 4. Consider the Boolean expression ((A + B)∙0)(A + A’). To which of the following Boolean expressions is it equivalent? (a) A (b) 0 (c ) 1 5.(3 marks) Draw the circuit diagram corresponding to the Boolean equation E = (A + B)(B + C)’ I.e. show inputs A, B and C, output E and the necessary gates in between. - 2 - Test 2 CSE 1520I 2008-09F Feb. 12, 2009 page 3 of 5 6.(1 mark) A multiplexer has select lines S , S and S , 0npu1 lines 2 I 0 I 1 I ,2I , 3 , 4 , I5and6I , and 7utput line F. It computes the function F = S 0S ’1 ’2 + 0 ’S 0S I1+ 2 1S S ’0 +1S2’S 2 I + 0 S1’2 3I + S0S1’S 2 +4S S S0’1 +2S5S S I0.1 2 6 0 1 2 7 What values of the select lines make the output F equal to input line I ? 5 S 0 1 S 1 0 S 2 1 7. (2 marks) Beside each of the items on the left write the letter (a - d) of its approximate capacity, shown on the right. main memory ___c___ (a) 1 – 2 MB hard disk ___d___ (b) 600 MB compact disk ___b___ (c) 1 – 2 GB floppy disk ___a___ (d) 100 GB 8. If we had a 16-bit machine, what is the maximum number of memory cells that could be addressed? (a)16 (b) 10 16 (c) 2 16 (d) 8*2 16 (e) 16 2 9. True / False Circuitry exists in main memory to add numbers stored there. 10. True / False If we could see the bit pattern in main memory cells, we could tell wh
More Less

Related notes for EECS 1520

OR

Don't have an account?

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Join to view

OR

By registering, I agree to the Terms and Privacy Policies
Just a few more details

So we can recommend you notes for your school.