Nothing Special   »   [go: up one dir, main page]
Scribd Logo
Upload

Welcome to Scribd!

  • 15 views

    Paper C 2004

    Uploaded by

    api-19663123
    This document is an exam paper for a Computer Science course. It contains 10 questions divided into two sections - Section A and Section B. Students must answer 5 questions total, selecting 2 from Section A and 3 from Section B. The exam is 3 hours long and worth a maximum of 25 marks.

    Copyright:

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

    Paper C 2004

    Uploaded by

    api-19663123
    15 views2 pages
    This document is an exam paper for a Computer Science course. It contains 10 questions divided into two sections - Section A and Section B. Students must answer 5 questions total, selecting 2 from Section A and 3 from Section B. The exam is 3 hours long and worth a maximum of 25 marks.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is an exam paper for a Computer Science course. It contains 10 questions divided into two sections - Section A and Section B. Students must answer 5 questions total, selecting 2 from Section A and 3 from Section B. The exam is 3 hours long and worth a maximum of 25 marks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    15 views2 pages

    Paper C 2004

    Uploaded by

    api-19663123
    This document is an exam paper for a Computer Science course. It contains 10 questions divided into two sections - Section A and Section B. Students must answer 5 questions total, selecting 2 from Section A and 3 from Section B. The exam is 3 hours long and worth a maximum of 25 marks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 2

    University Of Peshawar

    Computer Science (Part-II)


    Paper-C
    2004
    Time: 3 hrs Maximum Marks: 25

    Note: Attempt any FIVE questions selecting TWO questions from section-A
    and three from section-B. All questions carry equal marks.

    SECTION-A

    Q1. Differentiate between the following:


    a). Traditional Approach and Database Approach.
    b). Compound key and Composite key.
    c). Hierarchical Data Model and Network Data Model.
    Q2. What is Database Management System (DBMS)?
    Discuss different functions of DBMS.
    Q3. What is integrity? Discuss different steps that should be taken to
    ensure data integrity.
    Q4. Write short notes on any THREE of the following:
    a). Relational Data Model.
    b). DBA
    c). Types of Security.
    d). SQL and its feature.

    SECTION-B

    Q5. Differentiate between the following.


    a). C & C++
    b). Structure programming and Object-Oriented Programming.
    c). Constructor and Destructor.
    Q6. a). What is Object-Oriented Programming? What are the main
    characteristics of Object-oriented programming?
    b). Write a few names of Object-oriented languages.
    Q7. a). Write note on Functions in C++ language.
    b). Write a program to sort any 10 numbers in an ascending order
    for sorting process, use function and print the result in main
    function.
    Q8. a). What is class? How would you differentiate between Class and
    Object? How the class and Object are declared in C++ Program.
    b). Write a program in C++ by using a class to calculate the
    Factorial of any given number. The class should have its
    constructor functions.
    Q9. a). What is Operator Overloading? Why do we need operator
    overloading? Write the names of the operators that cannot be
    overloaded.
    b). Write a C++ Program showing overloading any binary operator.

    Q10. Write short notes on any TWO of the following.


    a). Polymorphism
    b). Copy Constructor.
    c). Friend Functions.

    --------------------------------------------

    You might also like