Scribd Logo
Upload

Welcome to Scribd!

  • 2K views

    Mid Semester Exam - Computer Fundamentals - (101) - SLIIT

    Uploaded by

    Sankha Palihawadana
    00592 SLI T •••••• In .. .. ··1£·· •••••• ~ ~~II'~ Sri Lanka Institute of Information Technology B. Sc. Special Honours Degree / Diploma Information Technology (IT/IS/CSN) Midterm Examination Year 1, Semester 1 (2010) Computer Fundamentals - (101) I Duration: 1 Hour I Thursday, 25th February 2010 (09.00 a.m. - 10.00 a.m.) Instruction to Candidates: • This paper contains 4 pages with the Cover Page. • This paper has TWO Sections. o Section A has 15 MCQ questions (Pages 02 - 03) o Section B

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Mid Semester Exam - Computer Fundamentals - (101) - SLIIT

    Uploaded by

    Sankha Palihawadana
    2K views4 pages
    00592 SLI T •••••• In .. .. ··1£·· •••••• ~ ~~II'~ Sri Lanka Institute of Information Technology B. Sc. Special Honours Degree / Diploma Information Technology (IT/IS/CSN) Midterm Examination Year 1, Semester 1 (2010) Computer Fundamentals - (101) I Duration: 1 Hour I Thursday, 25th February 2010 (09.00 a.m. - 10.00 a.m.) Instruction to Candidates: • This paper contains 4 pages with the Cover Page. • This paper has TWO Sections. o Section A has 15 MCQ questions (Pages 02 - 03) o Section B

    Original Title

    Mid semester exam - Computer Fundamentals - (101) - SLIIT

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    00592 SLI T •••••• In .. .. ··1£·· •••••• ~ ~~II'~ Sri Lanka Institute of Information Technology B. Sc. Special Honours Degree / Diploma Information Technology (IT/IS/CSN) Midterm Examination Year 1, Semester 1 (2010) Computer Fundamentals - (101) I Duration: 1 Hour I Thursday, 25th February 2010 (09.00 a.m. - 10.00 a.m.) Instruction to Candidates: • This paper contains 4 pages with the Cover Page. • This paper has TWO Sections. o Section A has 15 MCQ questions (Pages 02 - 03) o Section B

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    2K views4 pages

    Mid Semester Exam - Computer Fundamentals - (101) - SLIIT

    Uploaded by

    Sankha Palihawadana
    00592 SLI T •••••• In .. .. ··1£·· •••••• ~ ~~II'~ Sri Lanka Institute of Information Technology B. Sc. Special Honours Degree / Diploma Information Technology (IT/IS/CSN) Midterm Examination Year 1, Semester 1 (2010) Computer Fundamentals - (101) I Duration: 1 Hour I Thursday, 25th February 2010 (09.00 a.m. - 10.00 a.m.) Instruction to Candidates: • This paper contains 4 pages with the Cover Page. • This paper has TWO Sections. o Section A has 15 MCQ questions (Pages 02 - 03) o Section B

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 4

    00592

    SLI T
    In

    .. .. 1

    ~~II'~

    Sri Lanka Institute of Information Technology

    B. Sc. Special Honours Degree / Diploma Information Technology (IT/IS/CSN)


    Midterm Examination Year 1, Semester 1 (2010)

    Computer Fundamentals - (101)


    I Duration: 1 Hour I
    Thursday, 25th February 2010 (09.00 a.m. - 10.00 a.m.)
    Instruction to Candidates: This paper contains 4 pages with the Cover Page. This paper has TWO Sections. o Section A has 15 MCQ questions (Pages 02 - 03) o Section B has 5 Essay type questions. (page 04) Answer All Questions in both Sections A and B. Write down the answers in the given Answer Sheet ONLY. Total Marks 30.

    00592

    Section A - Multiple Choice Ouestions (01x15 = 15 marks) Select the most suitable answer for Questions 01 - 15 and mark it with a cross (x) in the Answer Sheet. 1. What is not a character representation code? (1)EBCIDIC (2) ASCII (3) ISBN 2. How many different encodings are used in ASCII? (1) 256 (2) 128 (3) 127

    (4) UNICODE

    (4) 16

    3. How many bits are required to address the memory locations of a memory of size 1GB? (1)8 bits (2)10 bits (3) 20 bits (4) 100 bits 4. The binary equivalent of the decimal number 67 is (1)1100001 (2)1000011 (3)1010001 5. The octal equivalent of binary number 1101110 is (1) 670 (2) 6E (3) 1232

    (4) 1000101

    (4) 156

    6. The hexadecimal equivalent of the binary number 11011101010 is (1)DD2 (2) 3352 (3) 6EA (4) 6722 7. The octal equivalent of the hexadecimal number 9387 is (1) 9387 (2) 447031 (3) 111607 (4) 111010 8. What is the MSB (Most Significant Bit) and LSB (Least Significant Bit) of the binary equivalent of decimal 127 respectively? (1) 1 and 1 (2) 1 and 0 (3) 0 and 1 (4) 0 and 0 9. Sum of the two binary numbers 1001 and 101 is (1)1110 (2)1011 (3)1010

    (4)1100

    10.Subtraction of the binary number 1101 from the binary number 10000 is (1)1101 (2)0010 (3) 1111 (4)0011 11.If the binary number 1110 III 0 is in 8-bit l ' s complement notation, what is the actual signed decimal number stored? (1)+238 (2)+18 (3)-17 (4)-18

    Page 2 of4

    00592

    12. If the binary number 10011101 is in 8-bit 2's complement notation, what is the actual signed decimal number stored? (1)+98 (2)-157 (3)-99 (4)-98 13. In Boolean algebra what is 1 + I? (1)0 (2)1

    (3)2

    (4) 10 such that the output is

    14.Find the values of the two inputs A and B respectively 1 for the gi ven circuit diagram.

    (l) 0 and 0

    (2) 0 and 1

    (3) 1 and 0

    (4) 1 and 1

    15. The logical expression A + (A.B) is equivalent to (l)A (2) B (3) A+B

    (4) A.B

    End of Section A

    Turn to the next page for Section B

    Page 3 of4

    00592

    Section B - Essay Questions

    (15 marks)

    Write down the answers for the following questions in the Answer Sheet provided. 1. Convert the following decimal fraction to a binary fraction with at least 4 binary points. Show your working. (2 marks) 0.958210 2. Perform the given 2's complement operation for the following number pairs using 4-bits per number. Show your working. Determine if overflow occurs. (2 marks) a. Addition: (-4) and (+4) b. Subtraction: (+4) and (-2) 3. Perform the following multiplication, after converting to binary. Use the sum and shift method. Show your working. (3 marks)
    (-14) x (-12)

    4. Using the De Morgan's theorem show that: a. A + AB + AB


    =

    (4 marks)

    1
    =

    b. (A + B) . (A+ B)

    5. Simplify the following Boolean function in SoP (Sum-of-Product) form by means ofa four variable K-Map. (4 marks) F (A,B,C,D) = I m(O, 2, 8,9, 10, 11, 14, 15) and Don't care conditions: d(A,B,C,D) = I m( 4, 5, 6, 13)

    Page 4 of4

    You might also like