1
COURSE CODE - 3050214 PG DIPLOMA EXAMINATION - MAR 2014 PGDCA COMPUTER ARCHITECTURE AND SYSTEM SOFTWARE (For the candidates admitted from Academic year 2011 onwards) Time: 3 hours Max. Marks: 75 PART - A Answer All the Questions: 10 X 2 = 20 Answer should not exceed ½ page. 1. Define data structures. 2. Define stack. 3. List out the types of Binary tree. 4. Define Graph. 5. List out the basic concepts of OOP. 6. Define function. 7. What is string? 8. Write the function of static function. 9. Write the syntax for read and write operations in File. 10. List out the types of inheritance. PART - B Answer All the Questions: 5 X 5 = 25 Answer should not exceed 1 ½ pages. 11. a. Explain the classification of digital computer. (Or) b. What are called auxiliary storage devices? Explain them. 12. a. Short note on i) 9’s complement ii) 10’s complement. (Or) b. Explain the Boolean function available in C. 13. a. Explain the shift registers. (Or) b. Explain the half adder and full adder with diagram. 14. a. short note on the following i) constants ii) variables. (Or) b. Compare while…do and do…while statements in C. 15. a. Explain any five string handling functions in C. (Or) b. Compare structure and union in C. PART – C Answer any Two Questions: 2 X 15 = 30 Answer should not exceed 5 pages. 16. Discuss in detail about the generations of a computer. 17. Explain the two variable map methods. 18. Discuss in detail about Multiplexer with a diagram. 19. Discuss in detail about the Operators available in C. 20. Discuss in detail about the data file operations.

3050214 pgdca with pim

Embed Size (px)

DESCRIPTION

hello dear now adays you can watch the doc of many students

Citation preview

  • COURSE CODE - 3050214

    PG DIPLOMA EXAMINATION - MAR 2014

    PGDCA

    COMPUTER ARCHITECTURE AND SYSTEM SOFTWARE

    (For the candidates admitted from Academic year 2011 onwards)

    Time: 3 hours Max. Marks: 75

    PART - A

    Answer All the Questions: 10 X 2 = 20

    Answer should not exceed page.

    1. Define data structures.

    2. Define stack.

    3. List out the types of Binary tree.

    4. Define Graph.

    5. List out the basic concepts of OOP.

    6. Define function.

    7. What is string?

    8. Write the function of static function.

    9. Write the syntax for read and write operations in File.

    10. List out the types of inheritance.

    PART - B

    Answer All the Questions: 5 X 5 = 25

    Answer should not exceed 1 pages.

    11. a. Explain the classification of digital computer.

    (Or)

    b. What are called auxiliary storage devices? Explain them.

    12. a. Short note on i) 9s complement ii) 10s complement.

    (Or)

    b. Explain the Boolean function available in C.

    13. a. Explain the shift registers.

    (Or)

    b. Explain the half adder and full adder with diagram.

    14. a. short note on the following i) constants ii) variables.

    (Or)

    b. Compare whiledo and dowhile statements in C.

    15. a. Explain any five string handling functions in C.

    (Or)

    b. Compare structure and union in C.

    PART C

    Answer any Two Questions: 2 X 15 = 30

    Answer should not exceed 5 pages.

    16. Discuss in detail about the generations of a computer.

    17. Explain the two variable map methods.

    18. Discuss in detail about Multiplexer with a diagram.

    19. Discuss in detail about the Operators available in C.

    20. Discuss in detail about the data file operations.